A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- 1 July 1991
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 1 (1) , 51-64
- https://doi.org/10.1016/0925-7721(91)90012-4
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMSInternational Journal of Computational Geometry & Applications, 1992
- Triangulating a simple polygon in linear timeDiscrete & Computational Geometry, 1991
- An Output-Complexity-Sensitive Polygon Triangulation AlgorithmPublished by Springer Nature ,1990
- A fast las vegas algorithm for triangulating a simple polygonDiscrete & Computational Geometry, 1989
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple PolygonSIAM Journal on Computing, 1988
- Sorting jordan sequences in linear time using level-linked search treesInformation and Control, 1986
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Triangulation and shape-complexityACM Transactions on Graphics, 1984
- Fast triangulation of simple polygonsPublished by Springer Nature ,1983
- On a convex hull algorithm for polygons and its application to triangulation problemsPattern Recognition, 1982