An optimal algorithm for the two-guard problem
暂无分享,去创建一个
[1] Rolf Klein,et al. The two guards problem , 1991, SCG '91.
[2] J. Mitchell,et al. Optimal motion of covisible points among obstacles in the plane , 1990 .
[3] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[4] Godfried T. Toussaint,et al. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.
[5] Steve Fisk,et al. A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.
[6] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..
[7] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[8] Paul J. Heffernan. Linear-time Algorithms for Weakly-monotone Polygons , 1993, Comput. Geom..
[9] Simeon C. Ntafos,et al. Optimum Watchman Routes , 1988, Inf. Process. Lett..
[10] Thomas C. Shermer,et al. Visibility properties of polygons , 1989 .
[11] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .
[12] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.