1
$\begingroup$

I want to know if there is an algorithm which does the following:

Imagine you have a point cloud and the points affect each other but the action from each point to an other is only valid in some radius around this point (locally).

Now remove one point and the local configuration changes.

How is the cheapest way to determine which points are affected from this removement?

$\endgroup$
  • 3
    $\begingroup$ This seems to be known as range searching and is supported by data structures such as range trees and kd-trees. $\endgroup$ – Yuval Filmus Feb 16 '15 at 17:47

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.