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…