News for hackers. Stuff that matters.
Re:Using k-d trees to efficiently calculate nearest neighbor... by yoklov on Sunday February 11, 2018 @03:02AM (#16351717)
Or more generally bounding volume hierarchies, of which AABB trees are a subset.

They’re great. Good perf, while being one of the simpler ways of accelerating spatial queries (compared to other types of trees, at least)

There are no comments on this comment yet.