An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.

P.M. Vaidya

Discrete & computational geometry (1989)

  • Volume: 4, Issue: 2, page 101-116
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Vaidya, P.M.. "An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.." Discrete & computational geometry 4.2 (1989): 101-116. <http://eudml.org/doc/131067>.

@article{Vaidya1989,
author = {Vaidya, P.M.},
journal = {Discrete & computational geometry},
keywords = {computational geometry; Minkowski metric; all-nearest-neighbors problem; algebraic decision-tree model of computation},
number = {2},
pages = {101-116},
title = {An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.},
url = {http://eudml.org/doc/131067},
volume = {4},
year = {1989},
}

TY - JOUR
AU - Vaidya, P.M.
TI - An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.
JO - Discrete & computational geometry
PY - 1989
VL - 4
IS - 2
SP - 101
EP - 116
KW - computational geometry; Minkowski metric; all-nearest-neighbors problem; algebraic decision-tree model of computation
UR - http://eudml.org/doc/131067
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.