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.

5430 Publications


1990 | Book Chapter | IST-REx-ID: 3565
D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in Autonomous Robot Vehicles, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4063
H. Edelsbrunner and E. Mücke, “Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms,” ACM Transactions on Graphics, vol. 9, no. 1, pp. 66–104, 1990.
View | DOI
 

1990 | Journal Article | IST-REx-ID: 4068
H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2,” Discrete & Computational Geometry, vol. 5, no. 1, pp. 35–42, 1990.
View | DOI
 

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

1990 | Journal Article | IST-REx-ID: 4075
D. Dobkin, H. Edelsbrunner, and M. Overmars, “Searching for empty convex polygons,” Algorithmica, vol. 5, no. 4, pp. 561–571, 1990.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed