Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete &; Computational Geometry 4 (1989) 433–466.
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

On arrangements of Jordan arcs with three intersections per pair
H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Discrete &; Computational Geometry 4 (1989) 523–539.
LibreCat: https://research-explorer.ista.ac.at/record/4089
DOI: 10.1007/BF02187745

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

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

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

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

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