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.
33 Publications
1991 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | Journal Article | IST-REx-ID: 4081 |
The upper envelope of piecewise linear functions: Algorithms and applications
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 4 (1989) 311–336.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 4 (1989) 311–336.
1989 | Published | Journal Article | IST-REx-ID: 4086 |
The upper envelope of piecewise linear functions: Tight bounds on the number of faces
H. Edelsbrunner, Discrete & Computational Geometry 4 (1989) 337–343.
[Published Version]
View
| DOI
| Download Published Version (ext.)
H. Edelsbrunner, Discrete & Computational Geometry 4 (1989) 337–343.
1989 | Published | 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 | Published | 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.
1989 | Published | Journal Article | IST-REx-ID: 4093
The complexity of cutting complexes
B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete & Computational Geometry 4 (1989) 139–181.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete & Computational Geometry 4 (1989) 139–181.
1987 | Published | Journal Article | IST-REx-ID: 4100
Linear space data structures for two types of range search
B. Chazelle, H. Edelsbrunner, Discrete & Computational Geometry 2 (1987) 113–126.
View
| DOI
B. Chazelle, H. Edelsbrunner, Discrete & Computational Geometry 2 (1987) 113–126.
1986 | Published | Journal Article | IST-REx-ID: 4108
Voronoi diagrams and arrangements
H. Edelsbrunner, R. Seidel, Discrete & Computational Geometry 1 (1986) 25–44.
View
| DOI
H. Edelsbrunner, R. Seidel, Discrete & Computational Geometry 1 (1986) 25–44.