Nearest Neighbour Search in 2 d plane.

Revision en1, by dreamplay, 2016-08-05 11:33:33

Given n points (x,y) on a euclidean plane. A radius R.
Input: Q queries of form (a,b)
Output: For each query, points within radius R

Suggest a solution to this?

Expected complexity: Better than brute force, asymptotically.

Tags #algorithms, #data structure, geometry, math

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English dreamplay 2016-08-05 11:34:11 41
en1 English dreamplay 2016-08-05 11:33:33 291 Initial revision (published)