Automata, Languages and Programming

Volume 2076 of the series Lecture Notes in Computer Science pp 456-468


Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher

  • Sang-Min ParkAffiliated withDept. of Computer Science, KAIST
  • , Jae-Ha LeeAffiliated withMax-Planck-Institut für Informatik
  • , Kyung-Yong ChwaAffiliated withDept. of Computer Science, KAIST

* Final gross prices may vary according to local VAT.

Get Access


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(n 2)-time algorithm for constructing a search path for an n-sided polygon.