Geodesic
Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.
Discrete & computational geometry, Tome 7 (1992) no. 4, pp. 415-432

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : dynamic data structure, minimal distance 
@article{DCG_1992__7_4_131205,
     author = {M. Smid},
     title = {Maintaining the {Minimal} {Distance} of a {Point} {Set} in {Poly-logarithmic} {Time.}},
     journal = {Discrete & computational geometry},
     pages = {415--432},
     publisher = {mathdoc},
     volume = {7},
     number = {4},
     year = {1992},
     zbl = {0764.68181},
     url = {http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131205/}
}
TY  - JOUR
AU  - M. Smid
TI  - Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.
JO  - Discrete & computational geometry
PY  - 1992
SP  - 415
EP  - 432
VL  - 7
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131205/
ID  - DCG_1992__7_4_131205
ER  - 
%0 Journal Article
%A M. Smid
%T Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.
%J Discrete & computational geometry
%D 1992
%P 415-432
%V 7
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131205/
%F DCG_1992__7_4_131205
M. Smid. Maintaining the Minimal Distance of a Point Set in Poly-logarithmic Time.. Discrete & computational geometry, Tome 7 (1992) no. 4, pp. 415-432. http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131205/