Searching a Polygonal Region from the Boundary
暂无分享,去创建一个
Masafumi Yamashita | Ichiro Suzuki | Tiko Kameda | Yuichi Tazoe | M. Yamashita | T. Kameda | I. Suzuki | Yuichi Tazoe
[1] Masafumi Yamashita,et al. Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon , 1998, Inf. Process. Lett..
[2] D. T. Lee,et al. Two-Guard Walkability of Simple Polygons , 1998, Int. J. Comput. Geom. Appl..
[3] Rolf Klein,et al. The two guards problem , 1991, SCG '91.
[4] Masafumi Yamashita,et al. Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers , 2001, SCG '97.
[5] Paul J. Heffernan. An optimal algorithm for the two-guard problem , 1996, Int. J. Comput. Geom. Appl..
[6] 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..
[7] Leonidas J. Guibas,et al. Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.
[8] Masafumi Yamashita,et al. The Searchlight Scheduling Problem , 1990, SIAM J. Comput..
[9] Sung Yong Shin,et al. Visibility-based pursuit-evasion in a polygonal room with a door , 1999, SCG '99.
[10] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[11] Steven M. LaValle,et al. Visibility-based pursuit-evasion: the case of curved environments , 2001, IEEE Trans. Robotics Autom..
[12] Giora Slutzki,et al. An algorithm for searching a polygonal region with a flashlight , 2000, SCG '00.
[13] Paul J. Heffernan,et al. An optimal algorithm for the two-guard problem , 1993, SCG '93.
[14] D. T. Lee,et al. An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.
[15] Masafumi Yamashita,et al. Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..
[16] Kyung-Yong Chwa,et al. Searching a Polygonal Room with One Door by a 1-Searcher , 2000, Int. J. Comput. Geom. Appl..