论文信息 - Simple algorithms for searching a polygon with flashlights

Simple algorithms for searching a polygon with flashlights

The k-searcher is a mobile guard whose visibility is limited to k rays emanating from her position, where the direction of each ray can be changed continuously with bounded angular rotation speed. Given a polygonal region P, is it possible for the k-searcher to eventually see a mobile intruder that is arbitrarily faster than the searcher within P? We present O(n2)-time algorithms for constructing a search schedule of the 1-searcher and the 2-searcher, respectively. Our framework for the 1-searcher can be viewed as a modification of that of LaValle et al. [Proc. 16th ACM Symp. on Computational Geometry, 2000, pp. 260–269] and is naturally extended for the 2-searcher.

[1] Rolf Klein,et al. The Two Guards Problem , 1992, Int. J. Comput. Geom. Appl..

[2] Masafumi Yamashita,et al. Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem , 1995, Int. J. Comput. Geom. Appl..

[3] Sung Yong Shin,et al. Visibility-based pursuit-evasion in a polygonal room with a door , 1999, SCG '99.

[4] Leonidas J. Guibas,et al. Sweeping simple polygons with a chain of guards , 2000, SODA '00.

[5] Subhash Suri,et al. On some link distance problems in a simple polygon , 1990, IEEE Trans. Robotics Autom..

[6] Giora Slutzki,et al. An algorithm for searching a polygonal region with a flashlight , 2000, SCG '00.

[7] Ren-Hong Wang,et al. On computational geometry , 2003 .

[8] Masafumi Yamashita,et al. Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[9] Kyung-Yong Chwa,et al. Searching a Polygonal Room with One Door by a 1-Searcher , 2000, Int. J. Comput. Geom. Appl..

[10] Leonidas J. Guibas,et al. A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..