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.
31 Publications
1990 | Published | Journal Article | IST-REx-ID: 4068
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.
1990 | Published | Journal Article | IST-REx-ID: 4069
An acyclicity theorem for cell complexes in d dimension
H. Edelsbrunner, Combinatorica 10 (1990) 251–260.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, Combinatorica 10 (1990) 251–260.
1990 | Published | Journal Article | IST-REx-ID: 4070
Ranking intervals under visibility constraints
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.
1990 | Published | Conference Paper | IST-REx-ID: 4071
An O(n^2log n) time algorithm for the MinMax angle triangulation
H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, T. Tan, R. Waupotitsch, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 44–52.
1990 | Published | Journal Article | IST-REx-ID: 4072
The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
View
| DOI
| Download None (ext.)
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational Geometry 5 (1990) 161–196.
1990 | Published | Conference Paper | IST-REx-ID: 4073
Counting and cutting cycles of lines and rods in space
B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, in:, 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–251.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, L. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, in:, 31st Annual Symposium on Foundations of Computer Science, IEEE, 1990, pp. 242–251.
1990 | Published | 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.)
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete & Computational Geometry 5 (1990) 99–160.
1990 | Published | Journal Article | IST-REx-ID: 4075
Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
View
| DOI
| Download None (ext.)
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.
1990 | Published | Conference Paper | IST-REx-ID: 4076
Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.
View
| DOI
| Download None (ext.)
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 203–210.
1990 | Published | Conference Paper | IST-REx-ID: 4077
Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.
View
| DOI
| Download None (ext.)
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 112–115.
1990 | Published | Conference Paper | IST-REx-ID: 4078
Slimming down by adding; selecting heavily covered points
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–127.
View
| DOI
| Download None (ext.)
B. Chazelle, H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, in:, Proceedings of the 6th Annual Symposium on Computational Geometry, ACM, 1990, pp. 116–127.