Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.”https://doi.org/10.1007/s00454-022-00431-7__Discrete &; Computational Geometry. Springer Nature, 2023.https://doi.org/10.1007/s00454-022-00431-7 .

Arroyo Guevara, Alan M, Fabian Klute, Irene Parada, Birgit Vogtenhuber, Raimund Seidel, and Tilo Wiedera. “Inserting One Edge into a Simple Drawing Is Hard.”https://doi.org/10.1007/s00454-022-00394-9__Discrete and Computational Geometry. Springer Nature, 2023.https://doi.org/10.1007/s00454-022-00394-9 .

Kourimska, Hana. “Discrete Yamabe Problem for Polyhedral Surfaces.”https://doi.org/10.1007/s00454-023-00484-2__Discrete and Computational Geometry. Springer Nature, 2023.https://doi.org/10.1007/s00454-023-00484-2 .

Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.”https://doi.org/10.1007/s00454-022-00476-8__Discrete and Computational Geometry. Springer Nature, 2023.https://doi.org/10.1007/s00454-022-00476-8 .

Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. “The Crossing Tverberg Theorem.”https://doi.org/10.1007/s00454-023-00532-x__Discrete and Computational Geometry. Springer Nature, 2023.https://doi.org/10.1007/s00454-023-00532-x .

Edelsbrunner, Herbert, Alexey Garber, Mohadese Ghafari, Teresa Heiss, and Morteza Saghafian. “On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane.”https://doi.org/10.1007/s00454-023-00566-1__Discrete and Computational Geometry. Springer Nature, 2023.https://doi.org/10.1007/s00454-023-00566-1 .

Brunck, Florestan R. “Iterated Medial Triangle Subdivision in Surfaces of Constant Curvature.”https://doi.org/10.1007/s00454-023-00500-5__Discrete and Computational Geometry. Springer Nature, 2023.https://doi.org/10.1007/s00454-023-00500-5 .

Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay Mosaics.”https://doi.org/10.1007/s00454-022-00371-2__Discrete and Computational Geometry. Springer Nature, 2022.https://doi.org/10.1007/s00454-022-00371-2 .

Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through a Convex Body.”https://doi.org/10.1007/s00454-021-00364-7__Discrete and Computational Geometry. Springer Nature, 2022.https://doi.org/10.1007/s00454-021-00364-7 .

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.”https://doi.org/10.1007/s00454-022-00436-2__Discrete &; Computational Geometry. Springer Nature, 2022.https://doi.org/10.1007/s00454-022-00436-2 .

Fulek, Radoslav, and Jan Kyndl. “The Z2-Genus of Kuratowski Minors.”https://doi.org/10.1007/s00454-022-00412-w__Discrete and Computational Geometry. Springer Nature, 2022.https://doi.org/10.1007/s00454-022-00412-w .

Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.”https://doi.org/10.1007/s00454-021-00299-z__Discrete &; Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-021-00299-z .

Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls.”https://doi.org/10.1007/s00454-021-00281-9__Discrete and Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-021-00281-9 .

Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.”https://doi.org/10.1007/s00454-020-00250-8__Discrete &; Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-020-00250-8 .

Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.”https://doi.org/10.1007/s00454-020-00240-w__Discrete and Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-020-00240-w .

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 .

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 .