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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete &; Computational Geometry 4 (1989) 433–466.
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

On arrangements of Jordan arcs with three intersections per pair
H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Discrete &; Computational Geometry 4 (1989) 523–539.
LibreCat: https://research-explorer.ista.ac.at/record/4089
DOI: 10.1007/BF02187745

The upper envelope of piecewise linear functions: Tight bounds on the number of faces 
H. Edelsbrunner, Discrete &; Computational Geometry 4 (1989) 337–343.
LibreCat: https://research-explorer.ista.ac.at/record/4086
DOI: 10.1007/BF02187734

The upper envelope of piecewise linear functions: Algorithms and applications
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 4 (1989) 311–336.
LibreCat: https://research-explorer.ista.ac.at/record/4081
DOI: 10.1007/BF02187733

The complexity of cutting complexes
B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete &; Computational Geometry 4 (1989) 139–181.
LibreCat: https://research-explorer.ista.ac.at/record/4093
DOI: 10.1007/BF02187720

Linear space data structures for two types of range search
B. Chazelle, H. Edelsbrunner, Discrete &; Computational Geometry 2 (1987) 113–126.
LibreCat: https://research-explorer.ista.ac.at/record/4100
DOI: 10.1007/BF02187875

Voronoi diagrams and arrangements
H. Edelsbrunner, R. Seidel, Discrete &; Computational Geometry 1 (1986) 25–44.
LibreCat: https://research-explorer.ista.ac.at/record/4108
DOI: 10.1007/BF02187681