Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. 2021. Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. 66, 666–686.
LibreCat: https://research-explorer.ista.ac.at/record/8248
DOI: 10.1007/s00454-020-00233-9
WoS: 000558119300001

Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.
LibreCat: https://research-explorer.ista.ac.at/record/7905
DOI: 10.1007/s00454-020-00206-y
WoS: 000536324700001
arXiv: 1712.07734

Lubiw A, Masárová Z, Wagner U. 2019. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete &; Computational Geometry. 61(4), 880–898.
LibreCat: https://research-explorer.ista.ac.at/record/5986
DOI: 10.1007/s00454-018-0035-8
WoS: 000466130000009
arXiv: 1710.02741

Edelsbrunner H, Fasy BT, Rote G. 2013. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete &; Computational Geometry. 49(4), 797–822.
LibreCat: https://research-explorer.ista.ac.at/record/2815
DOI: 10.1007/s00454-013-9517-x

Edelsbrunner H, Letscher D, Zomorodian A. 2002. Topological persistence and simplification. Discrete &; Computational Geometry. 28(4), 511–533.
LibreCat: https://research-explorer.ista.ac.at/record/3996
DOI: 10.1007/s00454-002-2885-2

Cheng H, Dey T, Edelsbrunner H, Sullivan J. 2001. Dynamic skin triangulation. Discrete &; Computational Geometry. 25(4), 525–568.
LibreCat: https://research-explorer.ista.ac.at/record/4007
DOI: 10.1007/s00454-001-0007-1

Wagner U, Welzl E. 2001. A continuous analogue of the Upper Bound Theorem. Discrete &; Computational Geometry. 26(2), 205–219.
LibreCat: https://research-explorer.ista.ac.at/record/2419
DOI: 10.1007/s00454-001-0028-9

Edelsbrunner H, Grayson D. 2000. Edgewise subdivision of a simplex. Discrete &; Computational Geometry. 24(4), 707–719.
LibreCat: https://research-explorer.ista.ac.at/record/4004
DOI: 10.1007/s004540010063

Edelsbrunner H. 1999. Deformable smooth surface design. Discrete &; Computational Geometry. 21(1), 87–115.
LibreCat: https://research-explorer.ista.ac.at/record/4014
DOI: 10.1007/PL00009412

Edelsbrunner H, Valtr P, Welzl E. 1997. Cutting dense point sets in half. Discrete &; Computational Geometry. 17(3), 243–255.
LibreCat: https://research-explorer.ista.ac.at/record/4022
DOI: 10.1007/PL00009291

Edelsbrunner H, Ramos E. 1997. Inclusion-exclusion complexes for pseudodisk collections. Discrete &; Computational Geometry. 17(3), 287–306.
LibreCat: https://research-explorer.ista.ac.at/record/4023
DOI: 10.1007/PL00009295

Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. 1995. Improved bounds on weak ;5-nets for convex sets. Discrete &; Computational Geometry. 13(1), 1–15.
LibreCat: https://research-explorer.ista.ac.at/record/4035
DOI: 10.1007/BF02574025

Edelsbrunner H. 1995. The union of balls and its dual shape. Discrete &; Computational Geometry. 13(1), 415–440.
LibreCat: https://research-explorer.ista.ac.at/record/4028
DOI: 10.1007/BF02574053

Dey T, Edelsbrunner H. 1994. Counting triangle crossings and halving planes. Discrete &; Computational Geometry. 12(1), 281–289.
LibreCat: https://research-explorer.ista.ac.at/record/4032
DOI: 10.1007/BF02574381

Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations. Discrete &; Computational Geometry. 10(1), 197–213.
LibreCat: https://research-explorer.ista.ac.at/record/4040
DOI: 10.1007/BF02573974

Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1993. Edge insertion for optimal triangulations. Discrete &; Computational Geometry. 10(1), 47–65.
LibreCat: https://research-explorer.ista.ac.at/record/4044
DOI: 10.1007/BF02573962

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1993. Diameter, width, closest line pair, and parametric searching. Discrete &; Computational Geometry. 10(1), 183–196.
LibreCat: https://research-explorer.ista.ac.at/record/4045
DOI: 10.1007/BF02573973

Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. 6(1), 407–422.
LibreCat: https://research-explorer.ista.ac.at/record/4061
DOI: 10.1007/BF02574698

Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991. Points and triangles in the plane and halving planes in space. Discrete &; Computational Geometry. 6(1), 435–442.
LibreCat: https://research-explorer.ista.ac.at/record/4062
DOI: 10.1007/BF02574700

Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete &; Computational Geometry. 5(1), 197–216.
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 10.1007/BF02187785