Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
45 Publications
2001 | Journal Article | IST-REx-ID: 4007
Dynamic skin triangulation
H. Cheng, T. Dey, H. Edelsbrunner, J. Sullivan, Discrete & Computational Geometry 25 (2001) 525–568.
View
| DOI
H. Cheng, T. Dey, H. Edelsbrunner, J. Sullivan, Discrete & Computational Geometry 25 (2001) 525–568.
2001 | Journal Article | IST-REx-ID: 2419
A continuous analogue of the Upper Bound Theorem
U. Wagner, E. Welzl, Discrete & Computational Geometry 26 (2001) 205–219.
View
| DOI
U. Wagner, E. Welzl, Discrete & Computational Geometry 26 (2001) 205–219.
2000 | Journal Article | IST-REx-ID: 4004
Edgewise subdivision of a simplex
H. Edelsbrunner, D. Grayson, Discrete & Computational Geometry 24 (2000) 707–719.
View
| DOI
H. Edelsbrunner, D. Grayson, Discrete & Computational Geometry 24 (2000) 707–719.
1999 | Journal Article | IST-REx-ID: 4014
Deformable smooth surface design
H. Edelsbrunner, Discrete & Computational Geometry 21 (1999) 87–115.
View
| DOI
H. Edelsbrunner, Discrete & Computational Geometry 21 (1999) 87–115.
1997 | Journal Article | IST-REx-ID: 4022
Cutting dense point sets in half
H. Edelsbrunner, P. Valtr, E. Welzl, Discrete & Computational Geometry 17 (1997) 243–255.
View
| DOI
H. Edelsbrunner, P. Valtr, E. Welzl, Discrete & Computational Geometry 17 (1997) 243–255.
1997 | Journal Article | IST-REx-ID: 4023
Inclusion-exclusion complexes for pseudodisk collections
H. Edelsbrunner, E. Ramos, Discrete & Computational Geometry 17 (1997) 287–306.
View
| DOI
H. Edelsbrunner, E. Ramos, Discrete & Computational Geometry 17 (1997) 287–306.
1995 | Journal Article | IST-REx-ID: 4035
Improved bounds on weak ε-nets for convex sets
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 13 (1995) 1–15.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 13 (1995) 1–15.
1995 | Journal Article | IST-REx-ID: 4028 | 
The union of balls and its dual shape
H. Edelsbrunner, Discrete & Computational Geometry 13 (1995) 415–440.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, Discrete & Computational Geometry 13 (1995) 415–440.
1994 | Journal Article | IST-REx-ID: 4032
Counting triangle crossings and halving planes
T. Dey, H. Edelsbrunner, Discrete & Computational Geometry 12 (1994) 281–289.
View
| DOI
| Download None (ext.)
T. Dey, H. Edelsbrunner, Discrete & Computational Geometry 12 (1994) 281–289.
1993 | Journal Article | IST-REx-ID: 4040
An upper bound for conforming Delaunay triangulations
H. Edelsbrunner, T. Tan, Discrete & Computational Geometry 10 (1993) 197–213.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, T. Tan, Discrete & Computational Geometry 10 (1993) 197–213.
1993 | Journal Article | IST-REx-ID: 4044
Edge insertion for optimal triangulations
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, Discrete & Computational Geometry 10 (1993) 47–65.
View
| DOI
| Download None (ext.)
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, Discrete & Computational Geometry 10 (1993) 47–65.
1993 | Journal Article | IST-REx-ID: 4045
Diameter, width, closest line pair, and parametric searching
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 10 (1993) 183–196.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 10 (1993) 183–196.
1991 | Journal Article | IST-REx-ID: 4061 |
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
[Published Version]
View
| DOI
| Download Published Version (ext.)
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.
1991 | Journal Article | IST-REx-ID: 4062 |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, Discrete & Computational Geometry 6 (1991) 435–442.
1990 | Journal Article | IST-REx-ID: 4066
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.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.
1990 | Journal Article | IST-REx-ID: 4072
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.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
1990 | Journal Article | IST-REx-ID: 4068
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
1990 | Journal Article | IST-REx-ID: 4074
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.
View
| DOI
| Download None (ext.)
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.
1989 | Journal Article | IST-REx-ID: 4088 |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.
1989 | Journal Article | IST-REx-ID: 4089 |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Discrete & Computational Geometry 4 (1989) 523–539.