Triangulating a simple polygon in linear time
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An optimal visibility graph algorithm for triangulated simple polygonsAlgorithmica, 1989
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygonsAlgorithmica, 1987
- Sorting jordan sequences in linear time using level-linked search treesInformation and Control, 1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Triangulation and shape-complexityACM Transactions on Graphics, 1984
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Fast triangulation of simple polygonsPublished by Springer Nature ,1983
- A theorem on polygon cutting with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Triangulating a simple polygonInformation Processing Letters, 1978