Author:
Mozafari Amirhossein,Zarei Alireza
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility-polygon search and Euclidean shortest paths. In: Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 155–164 (1985)
2. Asano, T., Kirkpatrick, D., Yap, C.: Pseudo approximation algorithms, with applications to optimal motion planning. In: Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 170–178 (2002)
3. Canny, J., Reif, J.H.: New lower bound techniques for robot motion planning problems. In: Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci, pp. 49–60 (1987)
4. Chin, W., Ntafos, S.: Shortest Watchman Routes in Simple Polygons. Discrete and Computational Geometry 6(1), 9–31 (1991)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT press (2009) ISBN 978-0-262-03384-8