Geodesic
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Discrete & computational geometry, Tome 6 (1991) no. 4, pp. 407-422
Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Mots-clés : minimum spanning trees, bichromatic closest pair 
@article{DCG_1991__6_4_131167,
     author = {H. Edelsbrunner and E. Welzl and P.K. Agarwal and O. Schwarzkopf},
     title = {Euclidean {Minimum} {Spanning} {Trees} and {Bichromatic} {Closest} {Pairs.}},
     journal = {Discrete & computational geometry},
     pages = {407--422},
     year = {1991},
     volume = {6},
     number = {4},
     zbl = {0753.68089},
     url = {http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131167/}
}
TY  - JOUR
AU  - H. Edelsbrunner
AU  - E. Welzl
AU  - P.K. Agarwal
AU  - O. Schwarzkopf
TI  - Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
JO  - Discrete & computational geometry
PY  - 1991
SP  - 407
EP  - 422
VL  - 6
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131167/
ID  - DCG_1991__6_4_131167
ER  - 
%0 Journal Article
%A H. Edelsbrunner
%A E. Welzl
%A P.K. Agarwal
%A O. Schwarzkopf
%T Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
%J Discrete & computational geometry
%D 1991
%P 407-422
%V 6
%N 4
%U http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131167/
%F DCG_1991__6_4_131167
H. Edelsbrunner; E. Welzl; P.K. Agarwal; O. Schwarzkopf. Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.. Discrete & computational geometry, Tome 6 (1991) no. 4, pp. 407-422. http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131167/