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
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vos droits au titre de la garantie légale : Chaque consommateur de l'UE bénéficie d'au moins deux ans de protection au titre de la garantie légale pour tout bien de consommation vendu dans l'UE. Voir plus
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. No Jacket. Print on Demand. Efficient geometry for polygon worlds. This book presents practical methods for measuring and finding the farthest points on a simple polygon's boundary. It focuses on the external distance between points and how to compute representatives for farthest neighbors for every vertex, using ideas like pockets, left and right shortest paths, and external diameter. The results include an algorithm that runs in near-linear time and uses linear space, making a once hard problem more accessible for applications in robotics and computer graphics.- Learn how to model robot paths that stay outside polygon interiors and how to define external distance.- See how pockets and lids partition a polygon and how these ideas enable fast computations.- Explore strategies to compute farthest neighbors for all vertices with proven time bounds.- Understand how the external diameter relates to diametric pairs and why it matters for decision problems.Ideal for readers of advanced computational geometry and algorithm design, and for practitioners who need efficient geometric tools. 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. N° de réf. du vendeur 9781334014048_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781334014048
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781334014048
Quantité disponible : 15 disponible(s)