Author:
Faigl Jan,Kulich Miroslav,Přeučil Libor
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Artificial Intelligence,Industrial and Manufacturing Engineering,Mechanical Engineering,Control and Systems Engineering,Software
Reference34 articles.
1. Chin, W.-P., Ntafos, S.: Optimum watchman routes. In: SCG ’86: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 24–33, Yorktown Heights, New York. ACM (1986)
2. Packer, E.: Robust geometric computing and optimal visibility coverage. PhD thesis, Stony Brook University, New York (2008)
3. Danner, T., Kavraki, L.E.: Randomized planning for short inspection paths. In: Proceedings of The IEEE International Conference on Robotics and Automation (ICRA), pp. 971–976, San Francisco, CA. IEEE (2000)
4. Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J. Algorithms 17(1), 2–44 (1994)
5. Tan, X., Hirata, T.: Finding shortest safari routes in simple polygons. Inf. Process. Lett. 87(4), 179–186 (2003)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献