Computing External-Farthest Neighbors for a Simple Polygon (Classic Reprint) - Softcover

Pankaj K. Agarwal

 
9781334014048: Computing External-Farthest Neighbors for a Simple Polygon (Classic Reprint)

Synopsis

This book presents an efficient algorithm for computing external farthest neighbors for every vertex of a simple polygon. It enables users to find the farthest point on the polygon's boundary from any given point, considering both the internal and external geometry of the polygon. The algorithm leverages geometric concepts and properties of external shortest paths to optimize its computation, resulting in an improved time complexity compared to previous methods. The book also provides insights into the relationship between internal and external geodesic farthest neighbors, extending the understanding of geodesic distance problems in computational geometry.

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

Other Popular Editions of the Same Title