Synopsis
Excerpt from Computing External-Farthest Neighbors for a Simple Polygon
This paper is divided into five sections. Section 2 discusses the basic geometric concepts that we use in this paper. In Section 3 we prove some properties of external shortest paths, which lead us to an efficient algorithm for computing the external farthest neighbors for every vertex of the polygon. Section 4 describes an O(u log n) algorithm to compute external farthest neighbors. We conclude with some final remarks in Section 5.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Computing External-Farthest Neighbors for a Simple...
Seller Image
Computing External-Farthest Neighbors for a Simple Polygon (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781334014048_0
Buy New
£ 12.93
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Computing ExternalFarthest Neighbors for a Simple Polygon Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334014048
Buy New
£ 17.32
£ 3.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available