Closest point problems in computational geometry

de Michiel Smid, Max-Planck-Institut für Informatik

"A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in R[superscript D]. In particular, the closest pair problem, the exact and approximate post-office problem, and the problem of constructing spanners are discussed in detail."