Robotics research technical report de pollack (3 resultados)

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: New. Print on Demand. This book introduces an algorithm designed to locate the geodesic center of a simple polygon, which is a point inside the polygon with the minimal maximum distance to any point within the polygon. This geodesic center problem is an expansion of the classic Euclidean facility location problem, where the objective is to find the point that minimizes the distance between the facility and the furthest point in a given set. The algorithm provided by the author calculates the geodesic center of a simple polygon in time O(n log2n), where n is the number of vertices in the polygon. This is an improvement over the existing algorithm by Asano and Toussaint, which achieves O(n4log n) time complexity. The book explores the geometric definitions of geodesic diameter and geodesic center, and explains how to compute the geodesic diameter of a given polygon using a method by Suri. It also discusses topics such as the link diameter and link center, P-convex sets, and shortest path trees within a polygon. The author presents a linear-time technique by Megiddo for linear programming in R2, which is utilized within the algorithm. By decomposing the problem into smaller subproblems and employing fast parallel algorithms, the author achieves efficient sequential optimization. Overall, this book provides a valuable contribution to the field of computational geometry, offering a practical algorithm for a complex problem and advancing the understanding of geodesic center computation. 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.…