Isbn: 9781332144990 - intersection and closest-pair problems for a set of planar objects (classic reprint) (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 explores efficient algorithms for detecting intersections and computing closest neighbors in a set of convex bodies within the plane. The authors generalize known techniques for solving these problems with sets of points or line segments. One algorithm constructs a generalized Voronoi diagram for a set of circular bodies in time O(n log^2 n), and demonstrates its applications. Another algorithm locates the closest neighbor to a query point among a set of n bodies, preprocessing the set in linear time and performing a query in O(log n) time. The book's insights on efficient geometric algorithms are significant for applications in the fields of robotics and computer science. 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.…