Watchman routes under limited visibility
- 1 March 1992
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 1 (3) , 149-170
- https://doi.org/10.1016/0925-7721(92)90014-j
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Region filling operations for mobile robot using computer graphicsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A unified solution to coverage and search in explored and unexplored terrains using indirect controlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Shortest watchman routes in simple polygonsDiscrete & Computational Geometry, 1991
- The robber route problemInformation Processing Letters, 1990
- Optimum watchman routesInformation Processing Letters, 1988
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977