Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean Space.”https://doi.org/10.1007/s00454-020-00233-9__Discrete and Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-020-00233-9 .

Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.”https://doi.org/10.1007/s00454-020-00206-y__Discrete and Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-020-00206-y .

Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.”https://doi.org/10.1007/s00454-018-0035-8__Discrete &; Computational Geometry. Springer Nature, 2019.https://doi.org/10.1007/s00454-018-0035-8 .

Edelsbrunner, Herbert, Brittany Terese Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.”https://doi.org/10.1007/s00454-013-9517-x__Discrete &; Computational Geometry. Springer, 2013.https://doi.org/10.1007/s00454-013-9517-x .

Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”https://doi.org/10.1007/BF02574698__Discrete &; Computational Geometry. Springer, 1991.https://doi.org/10.1007/BF02574698 .

Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space.”https://doi.org/10.1007/BF02574700__Discrete &; Computational Geometry. Springer, 1991.https://doi.org/10.1007/BF02574700 .

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.”https://doi.org/10.1007/BF02187785__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187785 .

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.”https://doi.org/10.1007/BF02187784__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187784 .

Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n2.”https://doi.org/10.1007/BF02187778__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187778 .

Clarkson, Kenneth, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”https://doi.org/10.1007/BF02187783__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187783 .

Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.”https://doi.org/10.1007/BF02187742__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187742 .

Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “On Arrangements of Jordan Arcs with Three Intersections per Pair.”https://doi.org/10.1007/BF02187745__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187745 .

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 .