SOME NP-HARD POLYGON DECOMPOSITION PROBLEMS

被引：105

作者：

OROURKE, J ^{[1
]}

SUPOWIT, KJ ^{[1
]}

机构：

[1] HEWLETT PACKARD LABS,CTR COMP RES,PALO ALTO,CA 94304

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1983年 / 29卷 / 02期

关键词：

D O I：

10.1109/TIT.1983.1056648

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：181 / 190

页数：10

共 38 条

[1]

AHUJA N, 1980, 1ST P NAT C ART INT, P44

[2]

AVIS D, 1981, PATTERN RECOGN, V13, P295

[3] HIERARCHICAL SHAPE-DESCRIPTION BASED UPON CONVEX HULLS OF CONCAVITIES [J].

BATCHELOR, BG .

JOURNAL OF CYBERNETICS, 1980, 10 (1-3) :205-210

[4] COVERING REGIONS BY RECTANGLES [J].

CHAIKEN, S ;

KLEITMAN, DJ ;

SAKS, M ;

SHEARER, J .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (04) :394-410

[5]

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

[6]

CHAZELLE BM, 1981, 13TH P ACM S THEOR C, P70

[7]

CHAZELLE BM, 1980, CMUCS80150 CARN MELL

[8] COMBINATORIAL THEOREM IN PLANE GEOMETRY [J].

CHVATAL, V .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 18 (01) :39-41

[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] SHORT PROOF OF CHVATAL-WATCHMAN THEOREM [J].

FISK, S .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 24 (03) :374-374

← 1 2 3 4 →