Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Edelsbrunner, H. ; Welzl, E. ; Agarwal, P.K. ; Schwarzkopf, O.
Discrete & computational geometry, Tome 6 (1991), p. 407-422 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1991-01-01
EUDML-ID : urn:eudml:doc:131167 
@article{GDZPPN000364894,
     title = {Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.},
     journal = {Discrete \& computational geometry},
     volume = {6},
     year = {1991},
     pages = {407-422},
     zbl = {0753.68089},
     url = {http://dml.mathdoc.fr/item/GDZPPN000364894}
}

Edelsbrunner, H.; Welzl, E.; Agarwal, P.K.; Schwarzkopf, O. Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.. Discrete & computational geometry, Tome 6 (1991) pp. 407-422. http://gdmltest.u-ga.fr/item/GDZPPN000364894/