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.

6699 Publications


1992 | Journal Article | IST-REx-ID: 4043
H. Edelsbrunner, T. Tan, and R. Waupotitsch, “An O(n^2 log n) time algorithm for the MinMax angle triangulation,” SIAM Journal on Scientific Computing, vol. 13, no. 4. Society for Industrial and Applied Mathematics , pp. 994–1008, 1992.
View | DOI
 

1992 | Journal Article | IST-REx-ID: 4046
B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments in the plane,” Journal of the ACM, vol. 39, no. 1. ACM, pp. 1–54, 1992.
View | DOI
 

1992 | Journal Article | IST-REx-ID: 4047
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” Theoretical Computer Science, vol. 92, no. 2. Elsevier, pp. 319–336, 1992.
View | DOI
 

1992 | Journal Article | IST-REx-ID: 4048
A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari, “Optimal time bounds for some proximity problems in the plane,” Information Processing Letters, vol. 42, no. 1. Elsevier, pp. 55–60, 1992.
View | DOI
 

1992 | Conference Paper | IST-REx-ID: 4049
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” presented at the LATIN: Latin American Symposium on Theoretical Informatics , 1992, vol. 583, pp. 46–60.
View | DOI
 

Search

Filter Publications