News for hackers. Stuff that matters.

A comment on Using k-d trees to efficiently calculate nearest neighbors in 3D vector space.

Re:Using k-d trees to efficiently calculate nearest neighbor... by Jordanpomeroy on Sunday February 11, 2018 @10:20AM (#16352996)
If I remember correctly these things don’t do well with dynamic updates, right? Don’t you have to rebuild the whole tree for every update?
[ Parent | on HN ]

There are no comments on this comment yet.