Characterization of Rooms Searchable by Two Guards
We consider the problem of searching for mobile intruders in a polygonal region with one door by two guards. Given a simple polygon P with one door d, which is called a room (P, d), two guards start at d and walk along the boundary of P to detect a mobile intruder with a laser beam between the two guards. During the walk, two guards are required to be mutually visible all the time and eventually meet at one point. We give the characterization of the class of rooms searchable by two guards, which naturally leads to O(n log n)-time algorithm for testing the searchability of an n-sided room.
Unable to display preview. Download preview PDF.
- 7.S. M. Lavalle, B. H. Simov, and G. Slutzki. An algorithm for searching a polygonal region with a flashlight. In Proceedings, ACM Symposium on Computational Geometry, pages 260–269, Hong Kong, June 2000.Google Scholar
- 9.J.-H. Lee, S. Y. Shin and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal room with a door, In Proceedings, ACM Symposium on Computational Geometry, pages 281–290, FL, USA, June 1999.Google Scholar