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
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimal Algorithms for Two-Guard Walkability of Simple Polygons
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
| Hi-index | 0.00 |
We study the problem of sweeping a simple polygon using a chain of mobile guards. The basic question is as follows: Given a simple polygon P in the plane, is it possible for two guards to simultaneously walk along the boundary of P from one point to another point in such a way that two guards are always mutually visible and any target moving continuously inside P should eventually lie on the line segment between two guards? It is known that an O(n2)-time algorithm can decide this question. Our contribution is to present efficient algorithms for the following optimization problems: - Given an n-sided polygon, we present an O(n2 log n)-time algorithm for computing a shortest walk in which the total length of the paths that two guards traverse is minimized. - Given an n-sided polygon, we present an O(n2)-time algorithm for computing a minimum diameter walk in which the maximum distance between two guards is minimized. Finally we allow more than two guards. Here the guards should form a simple chain within the polygon such that any consecutive two guards along the chain are mutually visible and the first and last guard have to move along the boundary but others do not. - We present an O(n2)-time algorithm for computing the minimum number of guards to sweep an n-sided polygon and an O(n3)-time algorithm for computing such a schedule.