English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

Maintaining the minimal distance of a point set in polylogarithmic time (revised version)

MPS-Authors
/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-103.pdf
(Any fulltext), 10MB

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

Smid, M.(1991). Maintaining the minimal distance of a point set in polylogarithmic time (revised version) (MPI-I-91-103). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-7B00-0
Abstract
A dynamic data structure is given that maintains the minimal distance in a set of $n$ points in $k$-dimensional