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.

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.

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.

H. Edelsbrunner et al., “Implicitly representing arrangements of lines or segments,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 433–466, 1989.

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.

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.

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.

B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 139–181, 1989.

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.

H. Edelsbrunner and R. Seidel, “Voronoi diagrams and arrangements,” Discrete &; Computational Geometry, vol. 1, no. 1. Springer, pp. 25–44, 1986.