Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.
Discrete & computational geometry (1992)
- Volume: 7, Issue: 4, page 415-432
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
topHow to cite
topSmid, M.. "Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.." Discrete & computational geometry 7.4 (1992): 415-432. <http://eudml.org/doc/131205>.
@article{Smid1992,
author = {Smid, M.},
journal = {Discrete & computational geometry},
keywords = {dynamic data structure; minimal distance},
number = {4},
pages = {415-432},
title = {Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.},
url = {http://eudml.org/doc/131205},
volume = {7},
year = {1992},
}
TY - JOUR
AU - Smid, M.
TI - Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.
JO - Discrete & computational geometry
PY - 1992
VL - 7
IS - 4
SP - 415
EP - 432
KW - dynamic data structure; minimal distance
UR - http://eudml.org/doc/131205
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.