Geodesic
Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.
Discrete & computational geometry, Tome 13 (1995) no. 3-4, pp. 111-122 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : spanning tree, ordered nearest neighbor path, dynamic algorithms 
@article{DCG_1995__13_3-4_131349,
     author = {D. Eppstein},
     title = {Dynamic {Euclidean} {Minimum} {Spanning} {Trees} and {Extrema} of {Binary} {Functions.}},
     journal = {Discrete & computational geometry},
     pages = {111--122},
     year = {1995},
     volume = {13},
     number = {3-4},
     zbl = {0815.68078},
     url = {http://geodesic.mathdoc.fr/item/DCG_1995__13_3-4_131349/}
}
TY  - JOUR
AU  - D. Eppstein
TI  - Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.
JO  - Discrete & computational geometry
PY  - 1995
SP  - 111
EP  - 122
VL  - 13
IS  - 3-4
UR  - http://geodesic.mathdoc.fr/item/DCG_1995__13_3-4_131349/
ID  - DCG_1995__13_3-4_131349
ER  - 
%0 Journal Article
%A D. Eppstein
%T Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.
%J Discrete & computational geometry
%D 1995
%P 111-122
%V 13
%N 3-4
%U http://geodesic.mathdoc.fr/item/DCG_1995__13_3-4_131349/
%F DCG_1995__13_3-4_131349
D. Eppstein. Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.. Discrete & computational geometry, Tome 13 (1995) no. 3-4, pp. 111-122. http://geodesic.mathdoc.fr/item/DCG_1995__13_3-4_131349/