Multiply guarded guards in orthogonal art galleries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2073, Issue , 2001, Pages 753-762

  Michael, T S ^a   Pinciu, Val ^b  

^a UNITED STATES NAVAL ACADEMY   (United States)

^b SOUTHERN CONNECTICUT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

ART GALLERY; CARDINALITIES;

COMPUTATION THEORY;

EID: 33645900923     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45545-0_87     Document Type: Conference Paper

References (8)

1. V. Chvátal, A combinatorial theorem in plane geometry, J. Combin. Theory Ser. B, 18 (1975), 39-41.
2. S. Fisk, A short proof of Chvátal's watchman theorem, J. Combin. Theory Ser. B, 24 (1978), 374.
3. J. Kahn, M. Klawe, and D. Kleitman, Traditional galleries require fewer watchmen, SIAM J. Alg. Disc. Meth., 4 (1983), 194-206.
4. B.-C. Liaw, N.F. Huang, and R.C.T. Lee, The minimum cooperative guards problem on k-spiral polygons (Extended Abstract), in Proc. 5-th Canadian Conf. on Computational Geometry (5CCCG), Waterloo, Ontario, Canada, (1993), 97-102.
5. B.-C. Liaw and R.C.T. Lee, An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons, Inform. Process. Lett., 57 (1994), 69-75.
6. T.S. Michael and V. Pinciu, Art gallery theorems for weakly cooperative guards, submitted.
7. J. O'Rourke, Art Gallery Theorems. Oxford University Press, 1987.
8. T.C. Shermer, Recent results in art gallery theorems, Proc. IEEE, 80 (1992), 1384-1399.