Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.”10.1007/BF02187742__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.

Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.”10.1007/BF02187745__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:10.1007/BF02187745.

Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .”10.1007/BF02187734__Discrete &; Computational Geometry, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:10.1007/BF02187734.

Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.”10.1007/BF02187733__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi:10.1007/BF02187733.

Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.”10.1007/BF02187720__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi:10.1007/BF02187720.

Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.”10.1007/BF02187875__Discrete &; Computational Geometry, vol. 2, no. 1, Springer, 1987, pp. 113–26, doi:10.1007/BF02187875.

Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.”10.1007/BF02187681__Discrete &; Computational Geometry, vol. 1, no. 1, Springer, 1986, pp. 25–44, doi:10.1007/BF02187681.