AN OPTIMAL ALGORITHM TO SOLVE THE MINIMUM WEAKLY COOPERATIVE GUARDS PROBLEM FOR 1-SPIRAL POLYGONS

被引：8

作者：

LIAW, BC ^{[1
]}

LEE, RCT ^{[1
]}

机构：

[1] NATL TSING HUA UNIV,DEPT COMP SCI,HSINCHU 30043,TAIWAN

来源：

INFORMATION PROCESSING LETTERS | 1994年 / 52卷 / 02期

关键词：

COMPUTATIONAL GEOMETRY; VISIBILITY; ART GALLERY PROBLEM; ALGORITHMS;

D O I：

10.1016/0020-0190(94)00128-6

中图分类号：

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

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：69 / 75

页数：7

共 9 条

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

CHVATAL, V .

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

[2] RECOGNIZING VISIBILITY GRAPHS OF SPIRAL POLYGONS [J].

EVERETT, H ;

CORNEIL, DG .

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1990, 11 (01) :1-26

[3] THE TWO GUARDS PROBLEM [J].

Icking, Christian ;

Klein, Rolf .

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1992, 2 (03) :257-285

[4] COMPUTATIONAL-COMPLEXITY OF ART GALLERY PROBLEMS [J].

LEE, DT ;

LIN, AK .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (02) :276-282

[5]

LIAW BC, 1993, 5TH P CAN C COMP GEO, P97

[6]

NILSSON BJ, 1990, 2ND CAN C COMP GEOM, P269

[7]

NILSSON BJ, 1990, LUCSTR9055 LUND U DE

[8]

OROARKE J, 1987, INT SCI MONOGRAPHS C

[9] RECENT RESULTS IN ART GALLERIES [J].

SHERMER, TC .

PROCEEDINGS OF THE IEEE, 1992, 80 (09) :1384-1399

← 1 →