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
Dobkin D, Edelsbrunner H, Yap C. Probing convex polytopes. In: Cox I, Wilfong G, eds. Autonomous Robot Vehicles. Springer; 1990:328-341. doi:10.1007/978-1-4613-8997-2_25
View | DOI

1990 | Journal Article | IST-REx-ID: 4063
Edelsbrunner H, Mücke E. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics. 1990;9(1):66-104. doi:10.1145/77635.77639
View | DOI

1990 | Journal Article | IST-REx-ID: 4068
Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 1990;5(1):35-42. doi: 10.1007/BF02187778
View | DOI

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

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


Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed