MPI-INF/SWS Research Reports 1991-2021
2. Number - All Departments
MPI-I-95-1-026
Closest point problems in computational geometry
Smid, Michiel
October 1995, 62 pages.
.Status: available - back from printing
This is the preliminary version of a chapter that will
appear in the {\em Handbook on Computational Geometry},
edited by J.-R.\ Sack and J.\ Urrutia.
A comprehensive overview is given of algorithms and data
structures for proximity problems on point sets in $\IR^D$.
In particular, the closest pair problem, the exact and
approximate post-office problem, and the problem of
constructing spanners are discussed in detail.
-
- Attachement: MPI-I-95-1-026.pdf (60360 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1995-1-026
BibTeX@TECHREPORT{Smid95,
AUTHOR = {Smid, Michiel},
TITLE = {Closest point problems in computational geometry},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-95-1-026},
MONTH = {October},
YEAR = {1995},
ISSN = {0946-011X},
}