Closest point problems in computational geometry
Edición de la obra Closest point problems in computational geometry
| Autor | Michiel Smid, Max-Planck-Institut für Informatik |
|---|---|
| Editorial | Max-Planck-Institut für Informatik |
| Fecha de publicación | 1995 |
| Lugar | Saarbrücken, Germany |
| Idioma | inglés |
| Páginas | 62 |
| Serie | Forschungsberichte = Research report / Max-Planck-Institut für Informatik -- MPI-I-95-1-026 |
| Número de Cutter | S639c |
"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."