P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” Discrete &; Computational Geometry, vol. 6, no. 1. Springer, pp. 407–422, 1991.
LibreCat: https://research-explorer.ista.ac.at/record/4061
DOI: 10.1007/BF02574698

B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” Discrete &; Computational Geometry, vol. 6, no. 1. Springer, pp. 435–442, 1991.
LibreCat: https://research-explorer.ista.ac.at/record/4062
DOI: 10.1007/BF02574700

H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 10.1007/BF02187785

H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction of many faces in arrangements of lines and of segments,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 161–196, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4072
DOI: 10.1007/BF02187784

H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 35–42, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4068
DOI: 10.1007/BF02187778

K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, “Combinatorial complexity bounds for arrangements of curves and spheres,” Discrete &; Computational Geometry, vol. 5, no. 1. Springer, pp. 99–160, 1990.
LibreCat: https://research-explorer.ista.ac.at/record/4074
DOI: 10.1007/BF02187783

H. Edelsbrunner et al., “Implicitly representing arrangements of lines or segments,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 433–466, 1989.
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

H. Edelsbrunner et al., “On arrangements of Jordan arcs with three intersections per pair,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 523–539, 1989.
LibreCat: https://research-explorer.ista.ac.at/record/4089
DOI: 10.1007/BF02187745

H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight bounds on the number of faces ,” Discrete &; Computational Geometry, vol. 4, no. 4. Springer, pp. 337–343, 1989.
LibreCat: https://research-explorer.ista.ac.at/record/4086
DOI: 10.1007/BF02187734

H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise linear functions: Algorithms and applications,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 311–336, 1989.
LibreCat: https://research-explorer.ista.ac.at/record/4081
DOI: 10.1007/BF02187733

B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 139–181, 1989.
LibreCat: https://research-explorer.ista.ac.at/record/4093
DOI: 10.1007/BF02187720

B. Chazelle and H. Edelsbrunner, “Linear space data structures for two types of range search,” Discrete &; Computational Geometry, vol. 2, no. 1. Springer, pp. 113–126, 1987.
LibreCat: https://research-explorer.ista.ac.at/record/4100
DOI: 10.1007/BF02187875

H. Edelsbrunner and R. Seidel, “Voronoi diagrams and arrangements,” Discrete &; Computational Geometry, vol. 1, no. 1. Springer, pp. 25–44, 1986.
LibreCat: https://research-explorer.ista.ac.at/record/4108
DOI: 10.1007/BF02187681