User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Journal Article

Searching a polygonal room with one door by a 1-searcher


Lee,  Jae-Ha
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Lee, J.-H., Park, S.-M., & Chwa, K.-Y. (2000). Searching a polygonal room with one door by a 1-searcher. International Journal of Computational Geometry and Applications, 10(2), 201-220.

Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-33FB-A
The {\em 1-searcher} is a mobile guard whose visibility is limited to a ray emanating from his position, where the direction of the ray can be changed continuously with bounded angular rotation speed. Given a polygonal region $\poly$ with a specified boundary point $d$, is it possible for a 1-searcher to eventually {\em see} a mobile intruder that is arbitrarily faster than the searcher within $\poly$, before the intruder reaches $d$? We decide this question in $O(n\log n)$-time for an $n$-sided polygon. Our main result is a simple characterization of the class of polygons (with a boundary point $d$) that admits such a search strategy. We also present a simple $O(n^2)$-time algorithm for constructing a search schedule, if one exists. Finally, we compare the search capability of a 1-searcher with that of two guards.