MPI-I-92-155
Simple randomized algorithms for closest pair problems
Golin, Mordecai and Raman, Rajeev and Schwarz, Christian and Smid, Michiel
December 1992, 14 pages.
.
Status: available - back from printing
We present a conceptually simple, randomized incremental algorithm
for finding the closest pair in a set of $n$ points in
$D$-dimensional space, where $D \geq 2$ is a fixed constant.
Using dynamic perfect hashing, the algorithm runs in $O(n)$
expected time.
In addition to being quick on the average, this algorithm
is reliable: we show that it runs in $O(n \log n / \log\log n)$
time with high probability.
-
MPI-92-155.pdf
- Attachement: MPI-I-92-155.dvi (65 KBytes); MPI-92-155.pdf (18488 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1992-155
BibTeX
@TECHREPORT{GolinRamanSchwarzSmid92,
AUTHOR = {Golin, Mordecai and Raman, Rajeev and Schwarz, Christian and Smid, Michiel},
TITLE = {Simple randomized algorithms for closest pair problems},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-92-155},
MONTH = {December},
YEAR = {1992},
ISSN = {0946-011X},
}