Given n points (x,y) on a euclidean plane. A radius R. <br>↵
Input: Q queries of form (a,b) <br>↵
Output: For each query, points within radius R <br>↵
↵
Suggest a solution to this? <br>↵
↵
Expected complexity: Better than brute force, asymptotically. ↵
Input: Q queries of form (a,b) <br>↵
Output: For each query, points within radius R <br>↵
↵
Suggest a solution to this? <br>↵
↵
Expected complexity: Better than brute force, asymptotically. ↵
