Consider a rectangular art gallery, subdivided into n rectangular rooms; any two adjacent rooms have a door connecting them. We show that ⌈n/2⌉ guards are always sufficient to protect all rooms in a rectangular art gallery; furthermore, their positioning can be determined in O(n) time. We show that the optimal positioning of the guards can be determined in linear time. We extend the result by proving that in an arbitrary orthogonal art gallery (not necessarily convex, possibly having holes) with n rectangular rooms and k walls, ⌈(n+k)/2⌉ guards are always sufficient and occasionally necessary to guard all the rooms in our gallery. A linear time algorithm to find the positioning of the guards is obtained.
|Title of host publication||Graph-Theoretic Concepts in Computer Science - 17th International Workshop, WG 1991, Proceedings|
|Editors||Gunther Schmidt, Rudolf Berghammer|
|Number of pages||8|
|State||Published - 1992|
|Event||17th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1991 - Fischbachau, Germany|
Duration: 17 Jun 1991 → 19 Jun 1991
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||17th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1991|
|Period||17/06/91 → 19/06/91|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)