Papers
3
Total Citations
10
H-Index
2
About
Phan Thanh An is a researcher whose work lies at the intersection of computational geometry, motion planning, and robotics. His primary research areas include the Euclidean shortest path problem, convex hull algorithms, and robotic grasping—problems that are fundamental to autonomous navigation and manipulation. A major contribution is his incremental approach to constructing convex hulls as a method for solving the classic shortest path problem within polygons, offering an orientation-based solution that avoids more computationally expensive triangulation. He has also tackled the convex rope problem, originally posed by Peshkin and Sanderson, developing methods to find reachable grasps on a polygon for a robot arm without relying on triangulation. While his most-cited works have garnered modest citation counts (4 citations each), they address deeply theoretical challenges in computational geometry with direct applications to robotics. Notably, his 2013 paper explores the broader role of graph theory in solving Euclidean shortest path problems in both 2D and 3D, demonstrating a sustained interest in foundational algorithmic questions. An’s work is valuable for researchers seeking efficient, geometry-driven solutions to path planning and robotic manipulation.
Research Focus
Key Achievements
Top Papers
- 1
- 2
- 3