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

MPI-I-92-118

Enumerating the k closest pairs mechanically

Smid, Michiel and Lenhof, Hans-Peter

MPI-I-92-118. May 1992, 12 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
Let $S$ be a set of $n$ points in $D$-dimensional space, where
$D$ is a constant,
and let $k$ be an integer between $1$ and $n \choose 2$.
An algorithm is given that computes the $k$ closest pairs
in the set $S$ in $O(n \log n + k)$ time, using $O(n+k)$
space. The algorithm fits
in the algebraic decision tree model and is,
therefore, optimal.
Acknowledgement:
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-92-118.pdfMPI-I-92-118.pdf8616 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/1992-118
Hide details for BibTeXBibTeX
@TECHREPORT{SmidLenhof92,
  AUTHOR = {Smid, Michiel and Lenhof, Hans-Peter},
  TITLE = {Enumerating the k closest pairs mechanically},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-118},
  MONTH = {May},
  YEAR = {1992},
  ISSN = {0946-011X},
}