Points within radius R.

Правка en2, от dreamplay, 2016-08-05 11:34:11

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.

Теги #algorithms, #data structure, geometry, math

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский dreamplay 2016-08-05 11:34:11 41
en1 Английский dreamplay 2016-08-05 11:33:33 291 Initial revision (published)