Artículos relacionados a Intersection and Closest-Pair Problems for a Set of...
Sinopsis
Excerpt from Intersection and Closest-Pair Problems for a Set of Planar Objects
The algorithm halts whenever an intersection is detected, or, if no intersection has been detected, when all the abscissae a, and b, have been processed, in which case the algorithm reports that there is no intersection between the objects in S.
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 18,49
EUR 0,60 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Intersection and Closest-Pair Problems for a Set of...
Imagen de archivo
Intersection and ClosestPair Problems for a Set of Planar Objects Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332144990
Cantidad disponible: 15 disponibles
Imagen de archivo
Intersection and ClosestPair Problems for a Set of Planar Objects Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332144990
Cantidad disponible: 15 disponibles
Imagen del vendedor
Intersection and Closest-Pair Problems for a Set of Planar Objects
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 9781332144990_0
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Intersection and Closest-Pair Problems for a Set of Planar Objects (Classic Reprint)
Publicado por
Forgotten Books, 2015
ISBN 10: 1332144993
ISBN 13: 9781332144990
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 26058988/2
Cantidad disponible: 1 disponibles