Advertisement

A Characterization of Polygonal Regions Searchable from the Boundary

  • Xuehou Tan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3330)

Abstract

We consider the problem of searching for a moving target with unbounded speed in a dark polygonal region by a searcher. The searcher continuously moves on the polygon boundary and can see only along the rays of the flashlights emanating from his position at a time. We present necessary and sufficient conditions for a polygon of n vertices to be searchable from the boundary. Our two main results are the following:

  1. 1

    We present an O(n log n) time and O(n) space algorithm for testing the searchability of simple polygons. Moreover, a search schedule can be reported in time linear in its size I, if it exists. For the searcher having full 360° vision, I < 2n, and for the searcher having only one flashlight, I < 3 n 2. Our result improves upon the previous O(n 2) time and space solution, given by LaValle et al [5]. Also, the linear bound for the searcher having full 360° vision solves an open problem posed by Suzuki et al [7].

     
  2. 2

    We show the equivalence of the abilities of the searcher having only one flashlight and the one having full 360° vision. Although the same result has been obtained by Suzuki et al [7], their proof is long and complicated, due to lack of the characterization of boundary search.

     

Keywords

Boundary Point Simple Polygon Minimum Vertex Corner Incident Polygonal Region 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chazelle, B., Guibas, L.J.: Visibility and intersection problems in plane geometry. Disc. Comput. Geom. 4, 551–581 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Das, G., Heffernan, P.J., Narasimhan, G.: LR-visibility in polygons. Comput. Geom. Theory Appl. 7, 37–57 (1997)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Heffernan, P.J.: An optimal algorithm for the two-guard problem. IJCGA 6, 15–44 (1996)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Icking, C., Klein, R.: The two guards problem. IJCGA 2, 257–285 (1992)zbMATHMathSciNetGoogle Scholar
  5. 5.
    LaValle, S.M., Simov, B., Slutzki, G.: An algorithm for searching a polygonal region with a flashlight. IJCGA 12, 87–113 (2002)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Suzuki, I., Yamashita, M.: Searching for mobile intruders in a polygonal region. SIAM J. Comp. 21, 863–888 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Suzuki, I., Tazoe, Y., Yamashita, M., Kameda, T.: Searching a polygonal region from the boundary. IJCGA 11, 529–553 (2001)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Xuehou Tan
    • 1
  1. 1.Tokai UniversityNumazuJapan

Personalised recommendations