论文信息 - Sweeping simple polygons with the minimum number of chain guards

Sweeping simple polygons with the minimum number of chain guards

We study the problem of detecting a moving target using a group of k+1 (k is a positive integer) mobile guards inside a simple polygon. Our guards always form a simple polygonal chain within the polygon such that consecutive guards along the chain are mutually visible. In this paper, we introduce the notion of the link-k diagram of a polygon, which records the pairs of points on the polygon boundary such that the link distance between any of these pairs is at most k and a transition relation among minimum-link (=

Xuehou Tan

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

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

[3] Giora Slutzki,et al. An Algorithm for Searching a Polygonal Region with a Flashlight , 2002, Int. J. Comput. Geom. Appl..

[4] Paul J. Heffernan. An optimal algorithm for the two-guard problem , 1996, Int. J. Comput. Geom. Appl..

[5] Xuehou Tan,et al. The Two-Guard Problem Revisited and Its Generalization , 2004, ISAAC.

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

[7] Masafumi Yamashita,et al. Online polygon search by a seven-state boundary 1-searcher , 2006, IEEE Transactions on Robotics.

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

[9] Masafumi Yamashita,et al. Searching a Polygonal Region from the Boundary , 2001, Int. J. Comput. Geom. Appl..

[10] Xuehou Tan. A Characterization of Polygonal Regions Searchable from the Boundary , 2003, IJCCGGT.

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

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