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

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

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

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

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

Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. 1989;4(1):433-466. doi:10.1007/BF02187742

Edelsbrunner H, Guibas L, Hershberger J, et al. On arrangements of Jordan arcs with three intersections per pair. Discrete &; Computational Geometry. 1989;4(1):523-539. doi:10.1007/BF02187745

Edelsbrunner H. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &; Computational Geometry. 1989;4(4):337-343. doi:10.1007/BF02187734

Edelsbrunner H, Guibas L, Sharir M. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete &; Computational Geometry. 1989;4(1):311-336. doi:10.1007/BF02187733

Chazelle B, Edelsbrunner H, Guibas L. The complexity of cutting complexes. Discrete &; Computational Geometry. 1989;4(1):139-181. doi:10.1007/BF02187720

Chazelle B, Edelsbrunner H. Linear space data structures for two types of range search. Discrete &; Computational Geometry. 1987;2(1):113-126. doi:10.1007/BF02187875

Edelsbrunner H, Seidel R. Voronoi diagrams and arrangements. Discrete &; Computational Geometry. 1986;1(1):25-44. doi:10.1007/BF02187681