Hyeon-Suk Na
Papers
1
Total Citations
31
H-Index
1
About
Hyeon-Suk Na’s research lies at the intersection of computational geometry and algorithmic optimization, with a particular focus on path planning in complex, anisotropic environments. In her most-cited work, “Approximate Shortest Paths in Anisotropic Regions” (2008, 31 citations), Na tackles the fundamental challenge of computing near-optimal routes for a point robot moving through a planar subdivision where each face imposes a different convex distance metric. Her key contribution is a rigorous algorithmic framework that guarantees an approximate shortest path with a user-defined error bound ρ ≥ 1, all while ensuring the unit disk of each distance function remains contained within a concentric Euclidean unit disk. This work bridges theoretical guarantees with practical applicability, offering efficient solutions for robotics, geographic information systems, and material science simulations. Though her citation count reflects a focused, high-impact niche, Na’s methodology has influenced subsequent research on weighted region problems and anisotropic shortest paths. Her approach exemplifies how careful geometric reasoning can yield algorithms that are both provably correct and computationally tractable—a hallmark of impactful computational geometry research.
Research Focus
Key Achievements
Top Papers
- 1Approximate Shortest Paths in Anisotropic Regions31 citations · 2008