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
1995 | Journal Article | IST-REx-ID: 4035
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. 1995. Improved bounds on weak ε-nets for convex sets. Discrete & Computational Geometry. 13(1), 1–15.
View
| DOI
| Download None (ext.)
1995 | Journal Article | IST-REx-ID: 4028 | 
Edelsbrunner H. 1995. The union of balls and its dual shape. Discrete & Computational Geometry. 13(1), 415–440.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1994 | Journal Article | IST-REx-ID: 4032
Dey T, Edelsbrunner H. 1994. Counting triangle crossings and halving planes. Discrete & Computational Geometry. 12(1), 281–289.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4040
Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations. Discrete & Computational Geometry. 10(1), 197–213.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4044
Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1993. Edge insertion for optimal triangulations. Discrete & Computational Geometry. 10(1), 47–65.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4045
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1993. Diameter, width, closest line pair, and parametric searching. Discrete & Computational Geometry. 10(1), 183–196.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4061 |
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. 6(1), 407–422.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4062 |
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991. Points and triangles in the plane and halving planes in space. Discrete & Computational Geometry. 6(1), 435–442.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 5(1), 197–216.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. 1990. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 5(1), 161–196.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 5(1), 35–42.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. 1990. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 5(1), 99–160.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4088 |
Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. 1989. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. 4(1), 433–466.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4089 |
Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir M, Snoeyink J. 1989. On arrangements of Jordan arcs with three intersections per pair. Discrete & Computational Geometry. 4(1), 523–539.
[Published Version]
View
| DOI
| Download Published Version (ext.)