|
61
|
Tar jan. Triangulating a simple polygon
– M R Garey, D S Johnson, F P Preparata, R E
- 1978
|
|
268
|
Triangulating a simple polygon in linear time
– B Chazelle
- 1991
|
|
40
|
Triangulation and shape-complexity
– Bernard Chazelle, Janet Incerpi
- 1984
|
|
50
|
Triangulating simple polygons and equivalent problems
– A Fournier, D Y Montuno
- 1984
|
|
23
|
A fast Las Vegas algorithm for triangulating a simple polygon, Discrete and Computational Geometry 4
– K Clarkson, R E Tarjan, C J Van Wyk
- 1989
|
|
91
|
A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons
– Raimund Seidel
- 1991
|
|
24
|
Randomized Parallel Algorithms For Trapezoidal Diagrams
– Kenneth L. Clarkson, Richard Cole, Robert E. Tarjan
- 1992
|
|
32
|
MEHLHORN K.: Fast triangulation of simple polygons
– S HERTEL
- 1983
|
|
69
|
A theorem on polygon cuttings with applications
– Bernard Chazelle
- 1982
|
|
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
|
|
30
|
Polygons have ears
– G H Meisters
- 1975
|
|
6
|
An output-complexity-sensitive polygon triangulation algorithm
– G T Toussaint
- 1990
|
|
1611
|
Computational geometry: An introduction
– F P Preparata, M I Shamos
- 1985
|
|
76
|
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2
– L Guibas, J Hershberger, D Leven, M Sharir, R Tarjan
- 1987
|
|
22
|
Localized search in sorted lists
– S R Kosaraju
- 1981
|
|
15
|
On a convex hull algorithm for polygons and its applications to triangulation problems
– G T Toussaint, D Avis
- 1982
|
|
212
|
A dichromatic framework for balanced trees
– L J Guibas, R Sedgewick
- 1978
|
|
16
|
Optimal parallel algorithms for triangulated simple polygons
– J Hershberger
- 1992
|
|
2173
|
The Design and Analysis of Computer Algorithms
– A V Aho, J E Hopcroft, J D Ullman
- 1974
|
