MPI-I-91-103
Maintaining the minimal distance of a point set in polylogarithmic time (revised version)
Smid, Michiel
April 1991, 17 pages.
.
Status: available - back from printing
A dynamic data structure is given that maintains the
minimal distance in a set of $n$ points in $k$-dimensional
-
- Attachement: MPI-I-91-103.pdf (9377 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1991-103
BibTeX
@TECHREPORT{Smid91c,
AUTHOR = {Smid, Michiel},
TITLE = {Maintaining the minimal distance of a point set in polylogarithmic time (revised version)},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-91-103},
MONTH = {April},
YEAR = {1991},
ISSN = {0946-011X},
}