A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

Computational Geometry: Theory and Applications

Volumn 1, Issue 1, 1991, Pages 51-64

  Seidel, Raimund ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POINT LOCATION QUERY; TRAPEZOIDAL DECOMPOSITION; TRIANGULATING POLYGON;

EID: 0026282692     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(91)90012-4     Document Type: Article

References (13)

1. A theorem on polygon cutting with applications
2. Triangulating a simple polygon in linear time
3. Triangulation and shape-complexity
4. Randomized parallel algorithms for trapezoidal diagrams
5. A fast Las Vegas algorithm for triangulating a simple polygon
6. Triangulating simple polygons and equivalent problems
7. Triangulating a simple polygon
8. Fast triangulation of a simple polygon
9. Sorting Jordan sequences in linear time using level-linked search trees
10. O(n log log n) polygon triangulation with simple data structures
11. An O(n log log n)-time algorithm for triangulating a simple polygon
12. On a convex hull algorithm for polygons and its applications to triangulation problems
13. An output-complexity-sensitive polygon triangulation algorithm