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


Randomized Data Structures for the Dynamic Closest-Pair Problem

Golin, Mordecai and Raman, Rajeev and Schwarz, Christian and Smid, Michiel

MPI-I-93-102. January 1993, 32 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
We describe a new randomized data structure,
the {\em sparse partition}, for solving the
dynamic closest-pair problem. Using this
data structure the closest pair of a set of $n$ points in
$k$-dimensional space, for any fixed $k$, can be found
in constant time. If the points are chosen from a finite universe,
and if the floor function is available at unit-cost, then the
data structure supports insertions into and deletions from the set
in expected $O(\log n)$ time and requires expected $O(n)$ space.
Here, it is assumed that the updates are chosen by an adversary who
does not know the random choices made by the data structure.
The data structure can be modified to run in $O(\log^2 n)$ expected
time per update in the algebraic decision tree model of
computation. Even this version is more efficient than the currently
best known deterministic algorithms for solving the problem for $k>1$.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s): KBytes; 348 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 = {Golin, Mordecai and Raman, Rajeev and Schwarz, Christian and Smid, Michiel},
  TITLE = {Randomized Data Structures for the Dynamic Closest-Pair Problem},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-93-102},
  MONTH = {January},
  YEAR = {1993},
  ISSN = {0946-011X},