An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.
Vaidya, P.M.
Discrete & computational geometry, Tome 4 (1989), p. 101-116 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1989-01-01
EUDML-ID : urn:eudml:doc:131067 
@article{GDZPPN000363898,
     title = {An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.},
     journal = {Discrete \& computational geometry},
     volume = {4},
     year = {1989},
     pages = {101-116},
     zbl = {0663.68058},
     url = {http://dml.mathdoc.fr/item/GDZPPN000363898}
}

Vaidya, P.M. An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.. Discrete & computational geometry, Tome 4 (1989) pp. 101-116. http://gdmltest.u-ga.fr/item/GDZPPN000363898/