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
Cheng H, Dey T, Edelsbrunner H, Sullivan J. Dynamic skin triangulation. Discrete & Computational Geometry. 2001;25(4):525-568. doi:10.1007/s00454-001-0007-1
View
| DOI
2001 | Journal Article | IST-REx-ID: 2419
Wagner U, Welzl E. A continuous analogue of the Upper Bound Theorem. Discrete & Computational Geometry. 2001;26(2):205-219. doi:10.1007/s00454-001-0028-9
View
| DOI
2000 | Journal Article | IST-REx-ID: 4004
Edelsbrunner H, Grayson D. Edgewise subdivision of a simplex. Discrete & Computational Geometry. 2000;24(4):707-719. doi:10.1007/s004540010063
View
| DOI
1999 | Journal Article | IST-REx-ID: 4014
Edelsbrunner H. Deformable smooth surface design. Discrete & Computational Geometry. 1999;21(1):87-115. doi:10.1007/PL00009412
View
| DOI
1997 | Journal Article | IST-REx-ID: 4022
Edelsbrunner H, Valtr P, Welzl E. Cutting dense point sets in half. Discrete & Computational Geometry. 1997;17(3):243-255. doi:10.1007/PL00009291
View
| DOI
1997 | Journal Article | IST-REx-ID: 4023
Edelsbrunner H, Ramos E. Inclusion-exclusion complexes for pseudodisk collections. Discrete & Computational Geometry. 1997;17(3):287-306. doi:10.1007/PL00009295
View
| DOI
1995 | Journal Article | IST-REx-ID: 4035
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. Improved bounds on weak ε-nets for convex sets. Discrete & Computational Geometry. 1995;13(1):1-15. doi:10.1007/BF02574025
View
| DOI
| Download None (ext.)
1995 | Journal Article | IST-REx-ID: 4028 | 
Edelsbrunner H. The union of balls and its dual shape. Discrete & Computational Geometry. 1995;13(1):415-440. doi:10.1007/BF02574053
[Published Version]
View
| DOI
| Download Published Version (ext.)
1994 | Journal Article | IST-REx-ID: 4032
Dey T, Edelsbrunner H. Counting triangle crossings and halving planes. Discrete & Computational Geometry. 1994;12(1):281-289. doi:10.1007/BF02574381
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4040
Edelsbrunner H, Tan T. An upper bound for conforming Delaunay triangulations. Discrete & Computational Geometry. 1993;10(1):197-213. doi:10.1007/BF02573974
View
| DOI
| Download None (ext.)
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.)