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.

6032 Publications


1990 | Conference Paper | IST-REx-ID: 4067
Edelsbrunner, H., & Sharir, M. (1990). A hyperplane Incidence problem with applications to counting distances (Vol. 450, pp. 419–428). Presented at the SIGAL:  Special Interest Group on Algorithms, International Symposium on Algorithms  , Springer. https://doi.org/10.1007/3-540-52921-7_91
View | DOI
 

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
 

Search

Filter Publications