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, Herbert, and Micha Sharir. “A Hyperplane Incidence Problem with Applications to Counting Distances,” 450:419–28. Springer, 1990. https://doi.org/10.1007/3-540-52921-7_91.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” Discrete & Computational Geometry 5, no. 1 (1990): 35–42. https://doi.org/ 10.1007/BF02187778.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4069
Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” Combinatorica 10, no. 3 (1990): 251–60. https://doi.org/10.1007/BF02122779.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4070
Edelsbrunner, Herbert, Mark Overmars, Emo Welzl, Irith Hartman, and Jack Feldman. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics 34, no. 3–4 (1990): 129–44. https://doi.org/10.1080/00207169008803871.
View | DOI
 

1990 | Conference Paper | IST-REx-ID: 4071
Edelsbrunner, Herbert, Tiow Tan, and Roman Waupotitsch. “An O(N^2log n) Time Algorithm for the MinMax Angle Triangulation,” 44–52. ACM, 1990. https://doi.org/10.1145/98524.98535.
View | DOI
 

Search

Filter Publications