Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. 2021;66:666-686. doi:10.1007/s00454-020-00233-9

Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 2021;65:1166-1198. doi:10.1007/s00454-020-00206-y

Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete &; Computational Geometry. 2019;61(4):880-898. doi:10.1007/s00454-018-0035-8

Edelsbrunner H, Fasy BT, Rote G. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete &; Computational Geometry. 2013;49(4):797-822. doi:10.1007/s00454-013-9517-x

Edelsbrunner H, Letscher D, Zomorodian A. Topological persistence and simplification. Discrete &; Computational Geometry. 2002;28(4):511-533. doi:10.1007/s00454-002-2885-2

Cheng H, Dey T, Edelsbrunner H, Sullivan J. Dynamic skin triangulation. Discrete &; Computational Geometry. 2001;25(4):525-568. doi:10.1007/s00454-001-0007-1

Wagner U, Welzl E. A continuous analogue of the Upper Bound Theorem. Discrete &; Computational Geometry. 2001;26(2):205-219. doi:10.1007/s00454-001-0028-9

Edelsbrunner H, Grayson D. Edgewise subdivision of a simplex. Discrete &; Computational Geometry. 2000;24(4):707-719. doi:10.1007/s004540010063

Edelsbrunner H. Deformable smooth surface design. Discrete &; Computational Geometry. 1999;21(1):87-115. doi:10.1007/PL00009412

Edelsbrunner H, Valtr P, Welzl E. Cutting dense point sets in half. Discrete &; Computational Geometry. 1997;17(3):243-255. doi:10.1007/PL00009291

Edelsbrunner H, Ramos E. Inclusion-exclusion complexes for pseudodisk collections. Discrete &; Computational Geometry. 1997;17(3):287-306. doi:10.1007/PL00009295

Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. Improved bounds on weak ;5-nets for convex sets. Discrete &; Computational Geometry. 1995;13(1):1-15. doi:10.1007/BF02574025

Edelsbrunner H. The union of balls and its dual shape. Discrete &; Computational Geometry. 1995;13(1):415-440. doi:10.1007/BF02574053

Dey T, Edelsbrunner H. Counting triangle crossings and halving planes. Discrete &; Computational Geometry. 1994;12(1):281-289. doi:10.1007/BF02574381

Edelsbrunner H, Tan T. An upper bound for conforming Delaunay triangulations. Discrete &; Computational Geometry. 1993;10(1):197-213. doi:10.1007/BF02573974

Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for optimal triangulations. Discrete &; Computational Geometry. 1993;10(1):47-65. doi:10.1007/BF02573962

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. Diameter, width, closest line pair, and parametric searching. Discrete &; Computational Geometry. 1993;10(1):183-196. doi:10.1007/BF02573973

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. 1991;6(1):407-422. doi:10.1007/BF02574698

Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space. Discrete &; Computational Geometry. 1991;6(1):435-442. doi:10.1007/BF02574700

Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. 1990;5(1):197-216. doi:10.1007/BF02187785