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. https://doi.org/ 10.1007/BF02187778
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. https://doi.org/10.1007/BF02122779
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. https://doi.org/10.1080/00207169008803871
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 (pp. 44–52). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/98524.98535
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. https://doi.org/ 10.1007/BF02187784
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 (pp. 242–251). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FSCS.1990.89543
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. https://doi.org/10.1007/BF02187783
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. https://doi.org/10.1007/BF01840404
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 (pp. 203–210). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/98524.98567
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 (pp. 112–115). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/98524.98548
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 (pp. 116–127). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/98524.98551
View | DOI
 

Filters and Search Terms

year=1990

Search

Filter Publications