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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

H. Edelsbrunner et al., “Implicitly representing arrangements of lines or segments,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 433–466, 1989.
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

H. Edelsbrunner et al., “On arrangements of Jordan arcs with three intersections per pair,” Discrete &; Computational Geometry, vol. 4, no. 1. Springer, pp. 523–539, 1989.
LibreCat: https://research-explorer.ista.ac.at/record/4089
DOI: 10.1007/BF02187745