GRATIS per la spedizione da Regno Unito a U.S.A.
Destinazione, tempi e costiDa: Forgotten Books, London, Regno Unito
Paperback. Condizione: New. Print on Demand. This book presents a significant development in geometrical probability, proving central limit theorems for three fundamental constructions in computational geometry: the k-nearest graph, the Voronoi diagram, and the Delaunay triangulation. Within this field, the author provides a novel approach using dependency graphs to capture local dependence in these problems. The book establishes that, given a Poisson point process with parameter n, the lengths of these graphs satisfy central limit theorems as n approaches infinity. These results provide a theoretical framework for understanding the asymptotic behavior of these graphs and have implications for designing more efficient algorithms for solving related problems. Additionally, the author explores the relationship between these central limit theorems and efficient algorithms for these problems, demonstrating the potential for faster sequential and parallel algorithms. Overall, this book offers a valuable contribution to geometrical probability and computational geometry, providing new insights into the asymptotic behavior of important combinatorial structures and paving the way for advancements in algorithmic design. 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 9781334015205_0
Quantità: Più di 20 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781334015205
Quantità: 15 disponibili