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
Efficient Algorithms for Searching a Polygonal Room with a Door
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Characterization of Rooms Searchable by Two Guards
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Searching a Simple Polygon by a k-Searcher
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A linear-time algorithm for finding all door locations that make a room searchable
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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 |
Consider a simple polygon. A walk is conducted by two guards on the polygon boundary. They start at a boundary point and walk on the boundary. It is required that the two guards maintain their mutual visibility at all times and eventually meet together again. A polygon may or may not be walkable, depending on where the two guards start their walk or no matter where they start on the boundary. In this work, we characterize the class of walkable polygons by two guards by presenting a set of forbidden patterns.