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
LibreCat: https://research-explorer.ista.ac.at/record/4086
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
LibreCat: https://research-explorer.ista.ac.at/record/4081
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
LibreCat: https://research-explorer.ista.ac.at/record/4093
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
LibreCat: https://research-explorer.ista.ac.at/record/4100
DOI: 10.1007/BF02187875

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