Hee-Kap Ahn

most citedA linear-time algorithm for the geodesic center of a simple polygon

4 citations · 4 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CG2015★ 4 cited

A linear-time algorithm for the geodesic center of a simple polygon

Hee-Kap Ahn, Luis Barba, Prosenjit Bose +3

Given two points in a simple polygon $P$ of $n$ vertices, its geodesic distance is the length of the shortest path that connects them among all paths that stay within $P$ . The geod…

cs.CG2010

Reachability by Paths of Bounded Curvature in a Convex Polygon

Hee-Kap Ahn, Otfried Cheong, Jirí Matoušek +1

Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a st…