Efficient triangulation of simple polygons
- 1 September 1991
- journal article
- Published by Springer Nature in The Visual Computer
- Vol. 7 (5-6) , 280-295
- https://doi.org/10.1007/bf01905693
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On geodesic properties of polygons relevant to linear time triangulationThe Visual Computer, 1989
- On Triangulating Palm Polygons in Linear TimePublished by Springer Nature ,1988
- NEW RESULTS IN COMPUTATIONAL GEOMETRY RELEVANT TO PATTERN RECOGNITION IN PRACTICEPublished by Elsevier ,1986
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Triangulation and shape-complexityACM Transactions on Graphics, 1984
- Applications of a two-dimensional hidden-line algorithm to other geometric problemsComputing, 1983
- On a convex hull algorithm for polygons and its application to triangulation problemsPattern Recognition, 1982
- Triangulating a simple polygonInformation Processing Letters, 1978
- Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern RecognitionIEEE Transactions on Computers, 1975
- An elementary proof of the Jordan-Schoenflies theoremProceedings of the American Mathematical Society, 1951