Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem
暂无分享,去创建一个
[1] Rolf Klein,et al. The two guards problem , 1991, SCG '91.
[2] Wei-Pand Chin,et al. Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..
[3] S. Suri. Minimum link paths in polygons and related problems , 1987 .
[4] Masafumi Yamashita,et al. The Searchlight Scheduling Problem , 1990, SIAM J. Comput..
[5] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[6] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..
[7] Simeon C. Ntafos,et al. Optimum Watchman Routes , 1988, Inf. Process. Lett..
[8] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .
[9] Masafumi Yamashita,et al. Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..
[10] Yan Ke. Polygon visibility algorithms for weak visibility and link distance problems , 1990 .