English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

An optimal algorithm for the on-line closest-pair problem

MPS-Authors
/persons/resource/persons45433

Schwarz,  Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-I-91-123.pdf
(Any fulltext), 12MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Schwarz, C., & Smid, M.(1991). An optimal algorithm for the on-line closest-pair problem (MPI-I-91-123). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B6DA-A
Abstract
We give an algorithm that computes the closest pair in a set of $n$ points in $k$-dimensional space on-line, in $O(n \log n)$ ime. The algorithm only uses algebraic functions and, therefore, is optimal. The algorithm maintains a hierarchical subdivision of $k$-space into hyperrectangles, which is stored in a binary tree. Centroids are used to maintain a balanced decomposition of this tree.