On: An interactive explanation of quadtrees

[orthecreedence]

If my points are always moving and updating in position, is this method efficient? If not, what's a good way of finding nearest-neighbor for a set of data points that are constantly morphing?

[muhuk → orthecreedence]

This you might find useful:

http://gamedev.stackexchange.com/questions/72392/handle-move...