DECOMPOSING A POLYGON INTO SIMPLER COMPONENTS

被引:92
作者
KEIL, JM
机构
关键词
D O I
10.1137/0214056
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:799 / 817
页数:19
相关论文
共 26 条
[1]   AN EFFICIENT ALGORITHM FOR DECOMPOSING A POLYGON INTO STAR-SHAPED POLYGONS [J].
AVIS, D ;
TOUSSAINT, GT .
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].
ELGINDY, H ;
AVIS, D .
JOURNAL OF ALGORITHMS, 1981, 2 (02) :186-197
[8]   CONCEPT OF STATE IN DISCRETE DYNAMIC PROGRAMMING [J].
ELMAGHRABY, SE .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1970, 29 (03) :523-+
[9]   DECOMPOSITION OF POLYGONS INTO SIMPLER COMPONENTS - FEATURE GENERATION FOR SYNTACTIC PATTERN-RECOGNITION [J].
FENG, HYF ;
PAVLIDIS, T .
IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (06) :636-650
[10]  
GREENE D, 1982, UNPUB DECOMPOSITION