Robotics Research Technical Report: Computing the Geodesic Center of a Simple Polygon (Classic Reprint) - Softcover

R. Pollack

 
9781332115457: Robotics Research Technical Report: Computing the Geodesic Center of a Simple Polygon (Classic Reprint)

Synopsis

Find the geodesic center of a simple polygon with a clear, step-by-step algorithm that runs in near‑linear time.

This book presents the problem of locating the geodesic center inside a polygonal region and explains how it differs from the standard Euclidean facility location problem. It outlines the key ideas behind triangulation, a specialized search through diagonals, and a sequence of techniques that turn a geometric question into a tractable optimization task. The authors describe how to build shortest-path trees, use tangent lines to constrain the search, and apply Megiddo’s linear-time ideas to narrow the region where the center lies. The result is a practical method with concrete time bounds for computing the geodesic center.

What you’ll experience
  • A guided overview of the geodesic center concept and its geometric underpinnings.
  • Step-by-step description of the main algorithm, including RELCEN and GEOCEN.
  • Insight into how to reduce a geometric problem to a min‑max optimization over a family of distance functions.
  • Discussion of related problems in polygon geometry and the best known approaches at the time.
  • A concise path from triangulation to a final, verifiable center, with attention to computational efficiency and implementation considerations.
Ideal for readers of computational geometry and location theory who want to understand how to compute central points inside polygons and compare different algorithmic approaches.

"synopsis" may belong to another edition of this title.