Is there an algorithm for finding nearby points using only polar coordinates?

Question

Suppose I have a vector of points in the form of polar coordinates.

Suppose one of these points acts like a probe, for which I want to find all the other points at a certain distance.

Is there an algorithm for this without converting them to Cartesian?

Answer 1

You are looking for a distance for polar coordinates. You can find the formula in this link .

The distance between points (r1, a1) and (r2, a2) is equal to:

D = sqrt(r1*r1 + r2*r2 - 2*r1*r2*cos(a1-a2))

Answer 2

, , . , , /. , :

• ,
• , ,

, .

:

• :

  • :
  • , , O (1) ( , , ...) / ( , ).

• :

  • - O (n);
  • ( , n ).

, .