Dynamic closest elements
I have a 2D surface ( Grid ) with 50 elements at different locations.
I need to decide which are the 10 closest elements to a given point.

In addition, the given point is constantly moving and i need to do the calculation on each movement.

I know I can calculate the Euclidean distance to each point on each movement, but I want a faster way.

Thanks.
Dynamic closest elements
===

I have a 2D surface ( Grid ) with 50 elements at different locations.
I need to decide which are the 10 closest elements to a given point.

In addition, the given point is constantly moving and i need to do the calculation on each movement.

I know I can calculate the Euclidean distance to each point on each movement, but I want a faster way.

Thanks.