ISBN: 9781334014048 - computing external-farthest neighbors for a simple polygon (classic reprint) (3 risultati)

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condizione: New. Print on Demand. 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. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…