AN O(n log log n)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON (1988)

by Robert E. Tarjan , Christopher J. Van Wyk
Citations:37 - 4 self

Documents Related by Co-Citation

66 Triangulating a simple polygon – M R Garey, D S Johnson, F P Preparata, R E Tarjan - 1978
294 Triangulating a simple polygon in linear time – B Chazelle - 1991
54 Triangulating simple polygons and equivalent problems – A Fournier, D Y Montuno - 1984
41 Triangulation and shape-complexity – Bernard Chazelle, Janet Incerpi - 1984
24 A Fast Las Vegas Algorithm for Triangulating a Simple Polygon – K L Clarkon, R E Tarjan, C J Van Wyk - 1989
99 A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons – Raimund Seidel - 1991
39 Fast triangulation of simple polygons – S Hertel, K Mehlhorn - 1983
77 A Theorem on Polygon Cutting with Applications – B Chazelle - 1982
23 Randomized Parallel Algorithms For Trapezoidal Diagrams – Kenneth L. Clarkson, Richard Cole, Robert E. Tarjan - 1992
12 Polygon triangulation in O(n log log n) time with simple data structures. Discrete Comput – D G Kirkpatrick, M M Klawe, R E Tarjan - 1992
33 H.: Polygons have ears – Gary Meisters - 1975
6 An output-complexity-sensitive polygon triangulation algorithm – G T Toussaint - 1990
4 O(n log log n) polygon triangulation with simple data structures – D G Kirkpatrick, M M Klawe, R E Tarjan - 1990
1770 Computational Geometry: An Introduction – Franco P Preparata, Michael Ian Shamos - 1985
694 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
16 On a convex hull algorithm for polygons and its application to triangulation problems, Pattem Recognition Lett. 15 (l – G T Toussaint, D Avis - 1982
305 A Data Structure for Dynamic Trees – D D Sleator, R E Tarjan - 1983
16 Optimal parallel algorithms for triangulated simple polygons – J Hershberger - 1992
45 On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof – Richard Cole