|
268
|
Triangulating a simple polygon in linear time
– B Chazelle
- 1991
|
|
50
|
Triangulating simple polygons and equivalent problems
– A Fournier, D Y Montuno
- 1984
|
|
61
|
Tar jan. Triangulating a simple polygon
– M R Garey, D S Johnson, F P Preparata, R E
- 1978
|
|
91
|
A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons
– Raimund Seidel
- 1991
|
|
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
|
|
32
|
AN O(n log log n)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON
– Robert E. Tarjan, Christopher J. Van Wyk
- 1988
|
|
32
|
MEHLHORN K.: Fast triangulation of simple polygons
– S HERTEL
- 1983
|
|
24
|
Randomized Parallel Algorithms For Trapezoidal Diagrams
– Kenneth L. Clarkson, Richard Cole, Robert E. Tarjan
- 1992
|
|
147
|
Optimal point location in a monotone subdivision
– H Edelsbrunner, L J Guibas, J Stolfi
- 1986
|
|
274
|
Computational Geometry: An Introduction through Randomized Algorithms
– K Mulmuley
- 1994
|
|
69
|
A theorem on polygon cuttings with applications
– Bernard Chazelle
- 1982
|
|
1612
|
Computational Geometry. An Introduction
– F P Preparata, M I Shamos
- 1985
|
|
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
|
|
442
|
Computational Geometry in C
– J O’Rourke
- 2000
|
|
76
|
Linear time algorithms for visibility and shortest path problems inside simple polygons
– L Guibas, J Hershberger, D Leven, M Sharir, R Tarjan
- 1986
|
|
6
|
An output-complexity-sensitive polygon triangulation algorithm
– G T Toussaint
- 1990
|
|
134
|
Applications of random sampling
– K L Clarkson, P W Shor
- 1989
|
|
46
|
Planar Separators and Parallel Polygon Triangulation
– Michael T. Goodrich
- 1992
|
|
15
|
On a convex hull algorithm for polygons and its applications to triangulation problems
– G T Toussaint, D Avis
- 1982
|
