Searching a Polygonal Room with One Door by a 1-Searcher

@article{Lee2000SearchingAP,
  title={Searching a Polygonal Room with One Door by a 1-Searcher},
  author={Jae-Ha Lee and Sang-Min Park and Kyung-Yong Chwa},
  journal={Int. J. Comput. Geometry Appl.},
  year={2000},
  volume={10},
  pages={201-220}
}
The 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 P with a specified boundary point d, is it possible for a 1-searcher to eventually see a mobile intruder that is arbitrarily faster than the searcher within P, 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… CONTINUE READING

Similar Papers

Loading similar papers…