Clearing a Polygon with Two 1-Searchers
暂无分享,去创建一个
[1] Steven M. LaValle,et al. Visibility-Based Pursuit-Evasion in an Unknown Planar Environment , 2004, Int. J. Robotics Res..
[2] Masafumi Yamashita,et al. Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..
[3] Masafumi Yamashita,et al. Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon , 1998, Inf. Process. Lett..
[4] D. T. Lee,et al. Two-Guard Walkability of Simple Polygons , 1998, Int. J. Comput. Geom. Appl..
[5] Kyung-Yong Chwa,et al. Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher , 2001, ICALP.
[6] Masafumi Yamashita,et al. Searching a Polygonal Region from the Boundary , 2001, Int. J. Comput. Geom. Appl..
[7] Kyung-Yong Chwa,et al. Searching a Polygonal Room with One Door by a 1-Searcher , 2000, Int. J. Comput. Geom. Appl..
[8] Masafumi Yamashita,et al. Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers , 2001, SCG '97.
[9] Giora Slutzki,et al. An algorithm for searching a polygonal region with a flashlight , 2000, SCG '00.
[10] Giora Slutzki,et al. Pursuit-evasion using beam detection , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[11] Leonidas J. Guibas,et al. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.
[12] Paul J. Heffernan,et al. An optimal algorithm for the two-guard problem , 1993, SCG '93.
[13] Sung Yong Shin,et al. Visibility-based pursuit-evasion in a polygonal room with a door , 1999, SCG '99.
[14] Steven M. LaValle,et al. Visibility-based pursuit-evasion: the case of curved environments , 2001, IEEE Trans. Robotics Autom..
[15] Bernard Chazelle,et al. Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[16] Steven M. LaValle,et al. A pursuit-evasion BUG algorithm , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[17] Leonidas J. Guibas,et al. Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.
[18] 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..
[19] Giora Slutzki,et al. An Algorithm for Searching a Polygonal Region with a Flashlight , 2002, Int. J. Comput. Geom. Appl..
[20] Rolf Klein,et al. The two guards problem , 1991, SCG '91.
[21] David Avis,et al. A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.
[22] S. Shankar Sastry,et al. Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation , 2002, IEEE Trans. Robotics Autom..
[23] Leonidas J. Guibas,et al. Sweeping simple polygons with a chain of guards , 2000, SODA '00.