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, Ho, et al. “Dynamic Skin Triangulation.” Discrete & Computational Geometry, vol. 25, no. 4, Springer, 2001, pp. 525–68, doi:10.1007/s00454-001-0007-1.
View
| DOI
2001 | Journal Article | IST-REx-ID: 2419
Wagner, Uli, and Emo Welzl. “A Continuous Analogue of the Upper Bound Theorem.” Discrete & Computational Geometry, vol. 26, no. 2, Springer, 2001, pp. 205–19, doi:10.1007/s00454-001-0028-9.
View
| DOI
2000 | Journal Article | IST-REx-ID: 4004
Edelsbrunner, Herbert, and Daniel Grayson. “Edgewise Subdivision of a Simplex.” Discrete & Computational Geometry, vol. 24, no. 4, Springer, 2000, pp. 707–19, doi:10.1007/s004540010063.
View
| DOI
1999 | Journal Article | IST-REx-ID: 4014
Edelsbrunner, Herbert. “Deformable Smooth Surface Design.” Discrete & Computational Geometry, vol. 21, no. 1, Springer, 1999, pp. 87–115, doi:10.1007/PL00009412.
View
| DOI
1997 | Journal Article | IST-REx-ID: 4022
Edelsbrunner, Herbert, et al. “Cutting Dense Point Sets in Half.” Discrete & Computational Geometry, vol. 17, no. 3, Springer, 1997, pp. 243–55, doi:10.1007/PL00009291.
View
| DOI
1997 | Journal Article | IST-REx-ID: 4023
Edelsbrunner, Herbert, and Edgar Ramos. “Inclusion-Exclusion Complexes for Pseudodisk Collections.” Discrete & Computational Geometry, vol. 17, no. 3, Springer, 1997, pp. 287–306, doi:10.1007/PL00009295.
View
| DOI
1995 | Journal Article | IST-REx-ID: 4035
Chazelle, Bernard, et al. “Improved Bounds on Weak ε-Nets for Convex Sets.” Discrete & Computational Geometry, vol. 13, no. 1, Springer, 1995, pp. 1–15, doi:10.1007/BF02574025.
View
| DOI
| Download None (ext.)
1995 | Journal Article | IST-REx-ID: 4028 | 
Edelsbrunner, Herbert. “The Union of Balls and Its Dual Shape.” Discrete & Computational Geometry, vol. 13, no. 1, Springer, 1995, pp. 415–40, doi:10.1007/BF02574053.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1994 | Journal Article | IST-REx-ID: 4032
Dey, Tamal, and Herbert Edelsbrunner. “Counting Triangle Crossings and Halving Planes.” Discrete & Computational Geometry, vol. 12, no. 1, Springer, 1994, pp. 281–89, doi:10.1007/BF02574381.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4040
Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay Triangulations.” Discrete & Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 197–213, doi:10.1007/BF02573974.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4044
Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” Discrete & Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 47–65, doi:10.1007/BF02573962.
View
| DOI
| Download None (ext.)
1993 | Journal Article | IST-REx-ID: 4045
Chazelle, Bernard, et al. “Diameter, Width, Closest Line Pair, and Parametric Searching.” Discrete & Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 183–96, doi:10.1007/BF02573973.
View
| DOI
| Download None (ext.)
1991 | Journal Article | IST-REx-ID: 4061 |
Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi:10.1007/BF02574698.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1991 | Journal Article | IST-REx-ID: 4062 |
Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.” Discrete & Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 435–42, doi:10.1007/BF02574700.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1990 | Journal Article | IST-REx-ID: 4066
Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4072
Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi:10.1007/BF02187784.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:10.1007/BF02187778.
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4074
Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.” Discrete & Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.
View
| DOI
| Download None (ext.)
1989 | Journal Article | IST-REx-ID: 4088 |
Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1989 | Journal Article | IST-REx-ID: 4089 |
Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:10.1007/BF02187745.
[Published Version]
View
| DOI
| Download Published Version (ext.)