Author:
An P.T.,Hai N.N.,Hoai T.V.
Funder
National Foundation for Science and Technology Development, Vietnam (NAFOSTED)
Subject
Applied Mathematics,Computational Mathematics
Reference27 articles.
1. Reachable grasps on a polygon of a robot arm: finding convex ropes without triangulation;An;Journal of Robotics and Automation,2010
2. Shortest paths helps solve geometric optimization problems in planar regions;Melissaratos;SIAM Journal on Computing,1992
3. Blaschke-type theorem and separation of disjoint closed geodesic convex sets;Hai;Journal of Optimization Theory and Applications,2011
4. Some computational aspects of geodesic convex sets in a simple polygon;An;Numerical Functional Analysis and Optimization,2010
5. L. Aleksandrov, A. Maheshwari, J.-R. Sack, Approximation algorithms for geometric shortest path problems, in: Proceedings of the 32nd ACM-STOC (Symposium on Theory of Computing), Portland, Oregon, May 2000, pp. 286–295.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献