Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
Visibility-based pursuit-evasion in a polygonal room with a door
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
An algorithm for searching a polygonal region with a flashlight
Proceedings of the sixteenth annual symposium on Computational geometry
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
IEEE Transactions on Computers
The Two-Guard Polygon Walk Problem
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Hi-index | 0.01 |
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.