Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .”https://doi.org/10.1007/BF02187734__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187734 .

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.”https://doi.org/10.1007/BF02187733__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187733 .

Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.”https://doi.org/10.1007/BF02187720__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187720 .

Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.”https://doi.org/10.1007/BF02187875__Discrete &; Computational Geometry. Springer, 1987.https://doi.org/10.1007/BF02187875 .

Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.”https://doi.org/10.1007/BF02187681__Discrete &; Computational Geometry. Springer, 1986.https://doi.org/10.1007/BF02187681 .