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
- 1
- 2
- 3
- 4 (current)
- 5
1993 | Journal Article | IST-REx-ID: 4044
Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for optimal triangulations. Discrete & Computational Geometry. 1993;10(1):47-65. doi:10.1007/BF02573962
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4045
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. Diameter, width, closest line pair, and parametric searching. Discrete & Computational Geometry. 1993;10(1):183-196. doi:10.1007/BF02573973
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4061 | 
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry. 1991;6(1):407-422. doi:10.1007/BF02574698
[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. Points and triangles in the plane and halving planes in space. Discrete & Computational Geometry. 1991;6(1):435-442. doi:10.1007/BF02574700
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner H, Guibas L, Sharir M. The complexity of many cells in arrangements of planes and related problems. Discrete & Computational Geometry. 1990;5(1):197-216. doi:10.1007/BF02187785
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner H, Guibas L, Sharir M. The complexity and construction of many faces in arrangements of lines and of segments. Discrete & Computational Geometry. 1990;5(1):161-196. doi:10.1007/BF02187784
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 1990;5(1):35-42. doi:10.1007/BF02187778
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
Clarkson K, Edelsbrunner H, Guibas L, Sharir M, Welzl E. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete & Computational Geometry. 1990;5(1):99-160. doi:10.1007/BF02187783
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4088 |
Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. 1989;4(1):433-466. doi:10.1007/BF02187742
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4089 |
Edelsbrunner H, Guibas L, Hershberger J, et al. On arrangements of Jordan arcs with three intersections per pair. Discrete & Computational Geometry. 1989;4(1):523-539. doi:10.1007/BF02187745
[Published Version]
View
| DOI
| Download Published Version (ext.)
- 1
- 2
- 3
- 4 (current)
- 5