Author:
Backer Jonathan,Kirkpatrick David
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Agarwal, P.K., Biedl, T., Lazard, S., Robbins, S., Suri, S., Whitesides, S.: Curvature-constrained shortest paths in a convex polygon. SIAM J. Comput. 31(6), 1814–1851 (2002)
2. Agarwal, P.K., Raghavan, P., Tamaki, H.: Motion planning for a steering-constrained robot through moderate obstacles. In: ACM symposium on Theory of computing, pp. 343–352. ACM Press, New York (1995)
3. Agarwal, P.K., Wang, H.: Approximation algorithms for curvature-constrained shortest paths. SIAM J. Comput. 30(6), 1739–1772 (2001)
4. Backer, J., Kirkpatrick, D.: Finding curvature-constrained paths that avoid polygonal obstacles. In: SCG 2007: Proceedings of the twenty-third annual symposium on Computational geometry, pp. 66–73. ACM, New York (2007)
5. Bereg, S., Kirkpatrick, D.: Curvature-bounded traversals of narrow corridors. In: SCG 2005: Proceedings of the twenty-first annual symposium on Computational geometry, pp. 278–287. ACM Press, New York (2005)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献