Optimum watchman routes
暂无分享,去创建一个
[1] Herbert Edelsbrunner,et al. Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.
[2] J. Kahn,et al. Traditional Galleries Require Fewer Watchmen , 1983 .
[3] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[4] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[5] Godfried T. Toussaint,et al. An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] J. O'Rourke. An alternate proof of the rectilinear art gallery theorem , 1983 .
[8] Simeon C. Ntafos,et al. On Gallery Watchmen in Grids , 1986, Inf. Process. Lett..
[9] J. O'Rourke,et al. Stationing guards in rectilinear art galleries , 1984 .
[10] Joseph O'Rourke,et al. Galleries need fewer mobile guards: A variation on Chvátal's theorem , 1983 .
[11] Anna Lubiw,et al. Decomposing polygonal regions into convex quadrilaterals , 1985, SCG '85.
[12] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.
[13] Steve Fisk,et al. A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.
[14] Christos H. Papadimitriou,et al. The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..
[15] Francis Y. L. Chin,et al. Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons , 1983, IEEE Transactions on Computers.
[16] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .