%0 Book
%0 [E-Book] /
%A Smid, Michiel
%A Narasimhan, Giri
%I Cambridge University Press
%D 2007
%C Cambridge
%P 1 online resource (xv, 500 pages)
%G englisch
%@ 9780521815130
%@ 9780511546884
%T Geometric spanner networks [E-Book]
%U https://doi.org/10.1017/CBO9780511546884
%X Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geometric analysis techniques with many applications, practical and theoretical. The authors present rigorous descriptions of the main algorithms and their analyses for different variations of the Geometric Spanner Network Problem. Though the basic ideas behind most of these algorithms are intuitive, very few are easy to describe and analyze. For most of the algorithms, nontrivial data structures need to be designed, and nontrivial techniques need to be developed in order for analysis to take place. Still, there are several basic principles and results that are used throughout the book. One of the most important is the powerful well-separated pair decomposition. This decomposition is used as a starting point for several of the spanner constructions.
%K Computer algorithms.
%K Trees (Graph theory)
%K Geometry
%K Data processing.
%K Data processing.
%~ JuLib eXtended
%W Forschungszentrum Jülich GmbH, Zentralbibliothek