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 
LibreCat: https://research-explorer.ista.ac.at/record/4044
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/4045
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/4061
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/4062
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/4072
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/4068
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/4074
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/4089
DOI: 10.1007/BF02187745

Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187734 
LibreCat: https://research-explorer.ista.ac.at/record/4086
DOI: 10.1007/BF02187734

Edelsbrunner, H., Guibas, L., &; Sharir, M. (1989). The upper envelope of piecewise linear functions: Algorithms and applications. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187733 
LibreCat: https://research-explorer.ista.ac.at/record/4081
DOI: 10.1007/BF02187733

Chazelle, B., Edelsbrunner, H., &; Guibas, L. (1989). The complexity of cutting complexes. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187720 
LibreCat: https://research-explorer.ista.ac.at/record/4093
DOI: 10.1007/BF02187720

Chazelle, B., &; Edelsbrunner, H. (1987). Linear space data structures for two types of range search. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187875 
LibreCat: https://research-explorer.ista.ac.at/record/4100
DOI: 10.1007/BF02187875

Edelsbrunner, H., &; Seidel, R. (1986). Voronoi diagrams and arrangements. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187681 
LibreCat: https://research-explorer.ista.ac.at/record/4108
DOI: 10.1007/BF02187681