Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


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

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-95-1-026.pdf60360 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:
Hide details for BibTeXBibTeX
  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},