Intersection and Closest-Pair Problems for a Set of Planar Objects - Softcover

Unknown

 
9781332144990: Intersection and Closest-Pair Problems for a Set of Planar Objects

Synopsis

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.

"synopsis" may belong to another edition of this title.