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 .

Edelsbrunner, Herbert, David Letscher, and Afra Zomorodian. “Topological Persistence and Simplification.”https://doi.org/10.1007/s00454-002-2885-2__Discrete &; Computational Geometry. Springer, 2002.https://doi.org/10.1007/s00454-002-2885-2 .

Cheng, Ho, Tamal Dey, Herbert Edelsbrunner, and John Sullivan. “Dynamic Skin Triangulation.”https://doi.org/10.1007/s00454-001-0007-1__Discrete &; Computational Geometry. Springer, 2001.https://doi.org/10.1007/s00454-001-0007-1 .

Wagner, Uli, and Emo Welzl. “A Continuous Analogue of the Upper Bound Theorem.”https://doi.org/10.1007/s00454-001-0028-9__Discrete &; Computational Geometry. Springer, 2001.https://doi.org/10.1007/s00454-001-0028-9 .

Edelsbrunner, Herbert, and Daniel Grayson. “Edgewise Subdivision of a Simplex.”https://doi.org/10.1007/s004540010063__Discrete &; Computational Geometry. Springer, 2000.https://doi.org/10.1007/s004540010063 .

Edelsbrunner, Herbert. “Deformable Smooth Surface Design.”https://doi.org/10.1007/PL00009412__Discrete &; Computational Geometry. Springer, 1999.https://doi.org/10.1007/PL00009412 .

Edelsbrunner, Herbert, Pavel Valtr, and Emo Welzl. “Cutting Dense Point Sets in Half.”https://doi.org/10.1007/PL00009291__Discrete &; Computational Geometry. Springer, 1997.https://doi.org/10.1007/PL00009291 .

Edelsbrunner, Herbert, and Edgar Ramos. “Inclusion-Exclusion Complexes for Pseudodisk Collections.”https://doi.org/10.1007/PL00009295__Discrete &; Computational Geometry. Springer, 1997.https://doi.org/10.1007/PL00009295 .

Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Improved Bounds on Weak ;5-Nets for Convex Sets.”https://doi.org/10.1007/BF02574025__Discrete &; Computational Geometry. Springer, 1995.https://doi.org/10.1007/BF02574025 .

Edelsbrunner, Herbert. “The Union of Balls and Its Dual Shape.”https://doi.org/10.1007/BF02574053__Discrete &; Computational Geometry. Springer, 1995.https://doi.org/10.1007/BF02574053 .

Dey, Tamal, and Herbert Edelsbrunner. “Counting Triangle Crossings and Halving Planes.”https://doi.org/10.1007/BF02574381__Discrete &; Computational Geometry. Springer, 1994.https://doi.org/10.1007/BF02574381 .

Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay Triangulations.”https://doi.org/10.1007/BF02573974__Discrete &; Computational Geometry. Springer, 1993.https://doi.org/10.1007/BF02573974 .

Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations.”https://doi.org/10.1007/BF02573962__Discrete &; Computational Geometry. Springer, 1993.https://doi.org/10.1007/BF02573962 .

Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “Diameter, Width, Closest Line Pair, and Parametric Searching.”https://doi.org/10.1007/BF02573973__Discrete &; Computational Geometry. Springer, 1993.https://doi.org/10.1007/BF02573973 .

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 .