A coloring algorithm for finding connected guards in art galleries

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

Volumn 2731, Issue , 2003, Pages 257-264

  Pinciu, Val ^a  

^a SOUTHERN CONNECTICUT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ART GALLERY; COLORING ALGORITHMS; VISIBILITY GRAPHS;

ALGORITHMS;

EID: 35248870654     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45066-1_20     Document Type: Article

References (10)

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. G. Hernández-Peñalver, Controlling guards (extended abstract), in: Proceedings of the Sixth Canadian Conference on Computational Geometry (6CCCG), (1994), pp. 387-392.
4. G. Hernández-Peñalver, Vigilancia vigilada de polígonos ortogonales, in: Actes del VI Encuentros de Geometria Computacional, Barcelona, Spain (1995), pp. 98-205.
5. J. Kahn, M. Klawe, and D. Kleitman, Traditional galleries require fewer watchmen, SIAM J. Alg. Disc. Meth., 4 (1983), 194-206.
6. 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.
7. 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.
8. T.S. Michael and V. Pinciu, Art gallery theorems for guarded guards, to appear in Computational Geometry: Theory and Applications.
9. V. Pinciu, Connected guards in orthogonal art galleries, to appear in Proceedings of the International Conference on Computational Science, Montreal (2003), Lecture Notes in Computer Science.
10. J. O'Rourke, Art Gallery Theorems. Oxford University Press, 1987.