COMPUTATIONAL-COMPLEXITY OF ART GALLERY PROBLEMS

被引：247

作者：

LEE, DT

LIN, AK

机构：

[1] Northwestern Univ, IL, USA, Northwestern Univ, IL, USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1986年 / 32卷 / 02期

关键词：

ART GALLERY PROBLEMS - COMPUTATION THEORY - MINIMUM VERTEX GUARD PROBLEM - POLYGONS DECOMPOSITION;

D O I：

10.1109/TIT.1986.1057165

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：276 / 282

页数：7

共 18 条

[1]

AGGARWAL A, COMMUNICATION

[2]

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

[3]

AVIS D, 1981, IEEE T COMPUT, V30, P910, DOI 10.1109/TC.1981.1675729

[4] AN EFFICIENT ALGORITHM FOR DECOMPOSING A POLYGON INTO STAR-SHAPED POLYGONS [J].

AVIS, D ;

TOUSSAINT, GT .

PATTERN RECOGNITION, 1981, 13 (06) :395-398

[5]

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

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

CHVATAL, V .

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

[7] STATIONING GUARDS IN RECTILINEAR ART GALLERIES [J].

EDELSBRUNNER, H ;

OROURKE, J ;

WELZL, E .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1984, 27 (02) :167-176

[8] 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

[9] SHORT PROOF OF CHVATAL-WATCHMAN THEOREM [J].

FISK, S .

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

[10]

Garey MR., 1979, COMPUTERS INTRACTABI

← 1 2 →