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


1993 | Journal Article | IST-REx-ID: 4044
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” Discrete & Computational Geometry, vol. 10, no. 1. Springer, pp. 47–65, 1993.
View | DOI | Download None (ext.)
 

1993 | Journal Article | IST-REx-ID: 4045
B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “Diameter, width, closest line pair, and parametric searching,” Discrete & Computational Geometry, vol. 10, no. 1. Springer, pp. 183–196, 1993.
View | DOI | Download None (ext.)
 

1991 | Journal Article | IST-REx-ID: 4061 | OA
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum spanning trees and bichromatic closest pairs,” Discrete & Computational Geometry, vol. 6, no. 1. Springer, pp. 407–422, 1991.
[Published Version] View | DOI | Download Published Version (ext.)
 

1991 | Journal Article | IST-REx-ID: 4062 | OA
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger, “Points and triangles in the plane and halving planes in space,” Discrete & Computational Geometry, vol. 6, no. 1. Springer, pp. 435–442, 1991.
[Published Version] View | DOI | Download Published Version (ext.)
 

1990 | Journal Article | IST-REx-ID: 4066
H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity of many cells in arrangements of planes and related problems,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 197–216, 1990.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4072
H. Edelsbrunner, L. Guibas, and M. Sharir, “The complexity and construction of many faces in arrangements of lines and of segments,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 161–196, 1990.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4068
H. Edelsbrunner and M. 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, pp. 35–42, 1990.
View | DOI | Download None (ext.)
 

1990 | Journal Article | IST-REx-ID: 4074
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, “Combinatorial complexity bounds for arrangements of curves and spheres,” Discrete & Computational Geometry, vol. 5, no. 1. Springer, pp. 99–160, 1990.
View | DOI | Download None (ext.)
 

1989 | Journal Article | IST-REx-ID: 4088 | OA
H. Edelsbrunner et al., “Implicitly representing arrangements of lines or segments,” Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 433–466, 1989.
[Published Version] View | DOI | Download Published Version (ext.)
 

1989 | Journal Article | IST-REx-ID: 4089 | OA
H. Edelsbrunner et al., “On arrangements of Jordan arcs with three intersections per pair,” Discrete & Computational Geometry, vol. 4, no. 1. Springer, pp. 523–539, 1989.
[Published Version] View | DOI | Download Published Version (ext.)
 

Filters and Search Terms

issn=0179-5376

Search

Filter Publications