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. 4(1), 433–466.

Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir M, Snoeyink J. 1989. On arrangements of Jordan arcs with three intersections per pair. Discrete &; Computational Geometry. 4(1), 523–539.

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

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

Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes. Discrete &; Computational Geometry. 4(1), 139–181.

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

Edelsbrunner H, Seidel R. 1986. Voronoi diagrams and arrangements. Discrete &; Computational Geometry. 1(1), 25–44.