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

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

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

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

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