Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Sweeping simple polygons with the minimum number of chain guards
Information Processing Letters
A characterization of polygonal regions searchable from the boundary
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Hi-index | 0.00 |
We study the problem of searching for a mobile intruder in a polygonal region P by two guards. The objective is to decide whether there exists a search schedule for two guards to detect the intruder, no matter how fast he moves, and if so, generate a search schedule. During the search, two guards are required to walk on the boundary of P continuously and be mutually visible all the time. We present a characterization of the class of polygons searchable by two guards, and give an optimal O(n) time algorithm for determining the two-guard searchability of a polygon and an algorithm for generating a search schedule in time linear in its size.