An efficient algorithm for decomposing a polygon into star-shaped polygons
- 1 January 1981
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 13 (6) , 395-398
- https://doi.org/10.1016/0031-3203(81)90002-9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Decomposition of Polygons into Convex SetsIEEE Transactions on Computers, 1978
- A short proof of Chvátal's Watchman TheoremJournal of Combinatorial Theory, Series B, 1978
- Triangulating a simple polygonInformation Processing Letters, 1978
- Location of a Point in a Planar Subdivision and Its ApplicationsSIAM Journal on Computing, 1977
- Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern RecognitionIEEE Transactions on Computers, 1975
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975
- Representation of figures by labeled graphsPattern Recognition, 1972