A fast las vegas algorithm for triangulating a simple polygon
- 1 October 1989
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (5) , 423-432
- https://doi.org/10.1007/bf02187741
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Simplified linear-time jordan sorting and polygon clippingInformation Processing Letters, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple PolygonSIAM Journal on Computing, 1988
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Sorting jordan sequences in linear time using level-linked search treesInformation and Control, 1986
- Computational GeometryPublished by Springer Nature ,1985
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Triangulation and shape-complexityACM Transactions on Graphics, 1984
- Triangulating a simple polygonInformation Processing Letters, 1978