1. Optimum watchman routes;Chin;Inform. Process. Lett.,1988
2. Watchman routes in simple polygons;Chin;Discrete and Comput. Geom.,1991
3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1978
4. Path planning in 01 weighted regions with applications;Gewali,1988
5. Linear time algorithms for visibility and shortest path problems inside simple polygons;Guibas,1986