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
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The two-guard problem revisited and its generalization
ISAAC'04 Proceedings of the 15th international conference on Algorithms and 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
Online polygon search by a seven-state boundary 1-searcher
IEEE Transactions on Robotics
A unified and efficient solution to the room search problem
Computational Geometry: Theory and Applications
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
An efficient algorithm for the three-guard problem
Discrete Applied Mathematics
Searching a polygonal region by two guards
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Optimum sweeps of simple polygons with two guards
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Minimization of the maximum distance between the two guards patrolling a polygonal region
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Multi-UAV motion planning for guaranteed search
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Optimum sweeps of simple polygons with two guards
Information Processing Letters
| Hi-index | 0.89 |
We study the problem of detecting a moving target using a group of k+1 (k is a positive integer) mobile guards inside a simple polygon. Our guards always form a simple polygonal chain within the polygon such that consecutive guards along the chain are mutually visible. In this paper, we introduce the notion of the link-k diagram of a polygon, which records the pairs of points on the polygon boundary such that the link distance between any of these pairs is at most k and a transition relation among minimum-link (=