Papers
3
Total Citations
40
H-Index
3
About
Hee-Kap Ahn is a leading figure in computational geometry, whose work elegantly bridges theoretical foundations with practical robotics and manufacturing. His primary research areas include geometric algorithms, motion planning, and computational topology. Ahn’s most influential contributions center on understanding reachability under physical constraints. In his highly cited 2011 work (15 citations), he solved the problem of characterizing all points reachable by a curvature-bounded robot moving forward inside a convex polygon, a fundamental question for autonomous vehicle navigation. This built on his earlier, seminal 2000 paper (11 citations) that first established the region of reachable points for a point robot with bounded turning radius. Beyond motion planning, Ahn has made significant strides in manufacturing, notably with his 2003 paper (14 citations) on casting polyhedra under directional uncertainty, addressing how to reliably produce 3D objects when the direction of mold separation is not perfectly known. His work is characterized by clean, provable geometric characterizations that have direct applications in robotics, computer-aided design, and automated manufacturing, making him a vital contributor to the algorithmic foundations of spatial reasoning.
Research Focus
Key Achievements
Top Papers
- 1Reachability by paths of bounded curvature in a convex polygon15 citations · 2011
- 2Casting a polyhedron with directional uncertainty14 citations · 2003
- 3Reachability by paths of bounded curvature in convex polygons11 citations · 2000