Please note that IST 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 | Journal Article | IST-REx-ID: 4068
Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 5(1), 35–42.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner H. 1990. An acyclicity theorem for cell complexes in d dimension. Combinatorica. 10(3), 251–260.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 34(3–4), 129–144.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner H, Tan T, Waupotitsch R. 1990. An O(n^2log n) time algorithm for the MinMax angle triangulation. SCG: Symposium on Computational Geometry 44–52.
View | DOI
 

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

1990 | Conference Paper | IST-REx-ID: 4073
Chazelle B, Edelsbrunner H, Guibas L, Pollack R, Seidel R, Sharir M, Snoeyink J. 1990. Counting and cutting cycles of lines and rods in space. FOCS: Foundations of Computer Science 242–251.
View | DOI
 

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

1990 | Journal Article | IST-REx-ID: 4075
Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4076
Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1990. Euclidean minimum spanning trees and bichromatic closest pairs. SCG: Symposium on Computational Geometry 203–210.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4077
Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1990. Points and triangles in the plane and halving planes in space. SCG: Symposium on Computational Geometry 112–115.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4078
Chazelle B, Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M. 1990. Slimming down by adding; selecting heavily covered points. SCG: Symposium on Computational Geometry 116–127.
View | DOI
 

Filters and Search Terms

year=1990

Search

Filter Publications