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
LibreCat: https://research-explorer.ista.ac.at/record/4007
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
LibreCat: https://research-explorer.ista.ac.at/record/2419
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
LibreCat: https://research-explorer.ista.ac.at/record/4004
DOI: 10.1007/s004540010063

Edelsbrunner H. Deformable smooth surface design. Discrete &; Computational Geometry. 1999;21(1):87-115. doi:10.1007/PL00009412
LibreCat: https://research-explorer.ista.ac.at/record/4014
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
LibreCat: https://research-explorer.ista.ac.at/record/4022
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
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. Improved bounds on weak ;5-nets for convex sets. Discrete &; Computational Geometry. 1995;13(1):1-15. doi:10.1007/BF02574025
LibreCat: https://research-explorer.ista.ac.at/record/4035
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
LibreCat: https://research-explorer.ista.ac.at/record/4028
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
LibreCat: https://research-explorer.ista.ac.at/record/4032
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
LibreCat: https://research-explorer.ista.ac.at/record/4040
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
LibreCat: https://research-explorer.ista.ac.at/record/4044
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
LibreCat: https://research-explorer.ista.ac.at/record/4045
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
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. Points and triangles in the plane and halving planes in space. Discrete &; Computational Geometry. 1991;6(1):435-442. doi:10.1007/BF02574700
LibreCat: https://research-explorer.ista.ac.at/record/4062
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
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 10.1007/BF02187785

Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete &; Computational Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784
LibreCat: https://research-explorer.ista.ac.at/record/4072
DOI: 10.1007/BF02187784

Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2. Discrete &; Computational Geometry. 1990;5(1):35-42. doi:10.1007/BF02187778
LibreCat: https://research-explorer.ista.ac.at/record/4068
DOI: 10.1007/BF02187778

Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete &; Computational Geometry. 1990;5(1):99-160. doi:10.1007/BF02187783
LibreCat: https://research-explorer.ista.ac.at/record/4074
DOI: 10.1007/BF02187783

Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. Discrete &; Computational Geometry. 1989;4(1):433-466. doi:10.1007/BF02187742
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

Edelsbrunner H, Guibas L, Hershberger J, et al. On arrangements of Jordan arcs with three intersections per pair. Discrete &; Computational Geometry. 1989;4(1):523-539. doi:10.1007/BF02187745
LibreCat: https://research-explorer.ista.ac.at/record/4089
DOI: 10.1007/BF02187745