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.

5867 Publications


1991 | Journal Article | IST-REx-ID: 4056
Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit Distances between the Vertices of a Convex Polygon.” Journal of Combinatorial Theory Series A 56, no. 2 (1991): 312–16. https://doi.org/10.1016/0097-3165(91)90042-F.
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4057
Edelsbrunner, Herbert. “Corrigendum.” Journal of Computer and System Sciences 42, no. 2 (1991): 249–51. https://doi.org/10.1016/0022-0000(91)90013-U.
View | DOI
 

1991 | Conference Paper | IST-REx-ID: 4058
Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments,” 441–48. SIAM, 1991.
View
 

1991 | Conference Paper | IST-REx-ID: 4059
Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations,” 510:661–73. Springer, 1991. https://doi.org/10.1007/3-540-54233-7_172.
View | DOI
 

1991 | Journal Article | IST-REx-ID: 4061
Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete & Computational Geometry 6, no. 1 (1991): 407–22. https://doi.org/10.1007/BF02574698.
View | DOI
 

Search

Filter Publications