max planck institut
informatik

# MPI-I-95-1-026

## Closest point problems in computational geometry

### Smid, Michiel

MPI-I-95-1-026. October 1995, 62 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:

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.
Acknowledgement:
References to related material:

60360 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://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},