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.
Points within radius R.
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.