DECOMPOSING A POLYGON INTO SIMPLER COMPONENTS

[1] AN EFFICIENT ALGORITHM FOR DECOMPOSING A POLYGON INTO STAR-SHAPED POLYGONS [J]. PATTERN RECOGNITION, 1981, 13 (06) : 395 - 398

[2] Bellman R., 1957, DYNAMIC PROGRAMMING

[3] BROWN KQ, 1979, CMUCS79106 CARN U CO

[4] CHAZELLE B, 1984, COMPUTATIONAL GEOMET

[5] CHAZELLE B, 1979, 11TH P ANN ACM S THE, P38

[6] CHAZELLE BM, 1980, THESIS YALE U NEW HA

[7] A LINEAR ALGORITHM FOR COMPUTING THE VISIBILITY POLYGON FROM A POINT [J]. JOURNAL OF ALGORITHMS, 1981, 2 (02) : 186 - 197

[8] CONCEPT OF STATE IN DISCRETE DYNAMIC PROGRAMMING [J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1970, 29 (03) : 523 - +

[9] DECOMPOSITION OF POLYGONS INTO SIMPLER COMPONENTS - FEATURE GENERATION FOR SYNTACTIC PATTERN-RECOGNITION [J]. IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (06) : 636 - 650

[10] GREENE D, 1982, UNPUB DECOMPOSITION

[1] AN EFFICIENT ALGORITHM FOR DECOMPOSING A POLYGON INTO STAR-SHAPED POLYGONS [J]. PATTERN RECOGNITION, 1981, 13 (06) : 395 - 398

[2] Bellman R., 1957, DYNAMIC PROGRAMMING

[3] BROWN KQ, 1979, CMUCS79106 CARN U CO

[4] CHAZELLE B, 1984, COMPUTATIONAL GEOMET

[5] CHAZELLE B, 1979, 11TH P ANN ACM S THE, P38

[6] CHAZELLE BM, 1980, THESIS YALE U NEW HA

[7] A LINEAR ALGORITHM FOR COMPUTING THE VISIBILITY POLYGON FROM A POINT [J]. JOURNAL OF ALGORITHMS, 1981, 2 (02) : 186 - 197

[8] CONCEPT OF STATE IN DISCRETE DYNAMIC PROGRAMMING [J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1970, 29 (03) : 523 - +

[9] DECOMPOSITION OF POLYGONS INTO SIMPLER COMPONENTS - FEATURE GENERATION FOR SYNTACTIC PATTERN-RECOGNITION [J]. IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (06) : 636 - 650

[10] GREENE D, 1982, UNPUB DECOMPOSITION