Decomposing a Polygon into Simpler Components
- 1 November 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (4) , 799-817
- https://doi.org/10.1137/0214056
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Optimal Convex DecompositionsPublished by Elsevier ,1985
- A linear algorithm for computing the visibility polygon from a pointJournal of Algorithms, 1981
- An efficient algorithm for decomposing a polygon into star-shaped polygonsPattern Recognition, 1981
- Decomposing a polygon into its convex partsPublished by Association for Computing Machinery (ACM) ,1979
- Location of a Point in a Planar Subdivision and Its ApplicationsSIAM Journal on Computing, 1977
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern RecognitionIEEE Transactions on Computers, 1975
- Minimal representations of some classes of dynamic programmingInformation and Control, 1975
- The concept of “state” in discrete dynamic programmingJournal of Mathematical Analysis and Applications, 1970
- Finite-State Processes and Dynamic ProgrammingSIAM Journal on Applied Mathematics, 1967