ISTA Research Explorer

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

1991 | Journal Article | IST-REx-ID: 4056 |

A lower bound on the number of unit distances between the vertices of a convex polygon
H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991) 312–316.

[Published Version] View | DOI | Download Published Version (ext.)

1991 | Journal Article | IST-REx-ID: 4061 |

Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational Geometry 6 (1991) 407–422.

[Published Version] View | DOI | Download Published Version (ext.)

1990 | Journal Article | IST-REx-ID: 4066

The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 197–216.

View | DOI | Download None (ext.)

1990 | Journal Article | IST-REx-ID: 4074

Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.

View | DOI | Download None (ext.)

1989 | Journal Article | IST-REx-ID: 4088 |

Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.

[Published Version] View | DOI | Download Published Version (ext.)