Articoli correlati a Intersection and Closest-Pair Problems for a Set of...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 18,95
EUR 1,93 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiRisultati della ricerca per Intersection and Closest-Pair Problems for a Set of...
Foto dell'editore
Intersection and ClosestPair Problems for a Set of Planar Objects Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332144990
Quantità: 15 disponibili
Foto dell'editore
Intersection and ClosestPair Problems for a Set of Planar Objects Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332144990
Quantità: 15 disponibili
Foto dell'editore
Intersection and Closest-Pair Problems for a Set of Planar Objects (Classic Reprint)
Da: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 28 | Sprache: Englisch | Produktart: Bücher. Codice articolo 26058988/2
Quantità: 1 disponibili
Immagini fornite dal venditore
Intersection and Closest-Pair Problems for a Set of Planar Objects
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781332144990_0
Quantità: Più di 20 disponibili