# Item

ITEM ACTIONSEXPORT

Released

Report

#### Randomized Data Structures for the Dynamic Closest-Pair Problem

##### MPS-Authors

##### Locator

There are no locators available

##### Fulltext (public)

MPI-I-93-102.pdf

(Any fulltext), 349KB

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Golin, M. J., Raman, R., Schwarz, C., & Smid, M.(1993). *Randomized
Data Structures for the Dynamic Closest-Pair Problem* (MPI-I-93-102). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B3F0-3

##### Abstract

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$.