Publisher
Springer Nature Switzerland
Reference22 articles.
1. Chin, W.-P., Ntafos, S.: Optimum watchman routes. In: Proceedings of the Second Annual Symposium on Computational Geometry, SCG 1986, pp. 24–33. ACM, New York (1986). ISBN 0-89791-194-6
2. Chin, W.-P., Ntafos, S.: Shortest watchman routes in simple polygons. Discret. Comput. Geom. 6(1), 9–31 (1991). https://doi.org/10.1007/BF02574671
3. Tan, X., Hirata, T., Inagaki, Y.: Corrigendum to “an incremental algorithm for constructing shortest watchman routes’’. Int. J. Comput. Geom. Appl. 9(3), 319–323 (1999)
4. Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a sequence of polygons. In: Proceedings of the 35th Annual ACM Symposium Theory Computing, pp. 473–482. ACM Press (2003)
5. Lecture Notes in Computer Science;S Carlsson,1993