Cheng, H., Dey, T., Edelsbrunner, H., &; Sullivan, J. (2001). Dynamic skin triangulation. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-001-0007-1 

Wagner, U., &; Welzl, E. (2001). A continuous analogue of the Upper Bound Theorem. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-001-0028-9 

Edelsbrunner, H., &; Grayson, D. (2000). Edgewise subdivision of a simplex. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s004540010063 

Edelsbrunner, H. (1999). Deformable smooth surface design. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/PL00009412 

Edelsbrunner, H., Valtr, P., &; Welzl, E. (1997). Cutting dense point sets in half. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/PL00009291 

Edelsbrunner, H., &; Ramos, E. (1997). Inclusion-exclusion complexes for pseudodisk collections. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/PL00009295 

Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Sharir, M., &; Welzl, E. (1995). Improved bounds on weak ;5-nets for convex sets. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574025 

Edelsbrunner, H. (1995). The union of balls and its dual shape. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574053 

Dey, T., &; Edelsbrunner, H. (1994). Counting triangle crossings and halving planes. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574381 

Edelsbrunner, H., &; Tan, T. (1993). An upper bound for conforming Delaunay triangulations. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02573974 

Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., &; Tan, T. (1993). Edge insertion for optimal triangulations. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02573962 

Chazelle, B., Edelsbrunner, H., Guibas, L., &; Sharir, M. (1993). Diameter, width, closest line pair, and parametric searching. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02573973 

Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &; Welzl, E. (1991). Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574698 

Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &; Wenger, R. (1991). Points and triangles in the plane and halving planes in space. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574700 

Edelsbrunner, H., Guibas, L., &; Sharir, M. (1990). The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187785 

Edelsbrunner, H., Guibas, L., &; Sharir, M. (1990). The complexity and construction of many faces in arrangements of lines and of segments. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187784 

Edelsbrunner, H., &; Sharir, M. (1990). The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187778 

Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., &; Welzl, E. (1990). Combinatorial complexity bounds for arrangements of curves and spheres. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187783 

Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., &; Welzl, E. (1989). Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187742 

Edelsbrunner, H., Guibas, L., Hershberger, J., Pach, J., Pollack, R., Seidel, R.,https://doi.org/10.1007/BF02187745__Snoeyink, J. (1989). On arrangements of Jordan arcs with three intersections per pair. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187745