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

  • Sang-Min Park
  • Jae-Ha Lee
  • Kyung-Yong Chwa
Conference paper

DOI: 10.1007/3-540-48224-5_38

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2076)
Cite this paper as:
Park SM., Lee JH., Chwa KY. (2001) Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher. In: Orejas F., Spirakis P.G., van Leeuwen J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Sang-Min Park
    • 1
  • Jae-Ha Lee
    • 2
  • Kyung-Yong Chwa
    • 1
  1. 1.Dept. of Computer ScienceKAISTKorea
  2. 2.Max-Planck-Institut für InformatikGermany

Personalised recommendations