The complexity of searching a graph
Journal of the ACM (JACM)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
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
Simple algorithms for searching a polygon with flashlights
Information Processing Letters
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Randomized Pursuit-Evasion in Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Visibility-based Pursuit-evasion with Limited Field of View
International Journal of Robotics Research
Optimum sweeps of simple polygons with two guards
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Search and pursuit-evasion in mobile robotics
Autonomous Robots
Capturing an evader in polygonal environments with obstacles: The full visibility case
International Journal of Robotics Research
Studying the stochastic capturing of moving intruders by mobile sensors
Computers & Mathematics with Applications
Capture bounds for visibility-based pursuit evasion
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We consider the most basic visibility-based pursuit-evasion problem defined as follows: Given a polygonal region, a searcher with 360° vision, and an unpredictable intruder that is arbitrarily faster than the searcher, plan the motion of the searcher so as to see the intruder. In this paper, we present simple necessary and sufficient conditions for a polygon to be searchable, which settles a decade-old open problem raised in [13]. We also show that every searchable polygon is also searchable by a searcher with two flashlights (that is, two ray visions). This implies, combined with the previous work [7], that there is an O(n2)-time algorithm for constructing a search path for an n-sided polygon.