Using k-d trees to efficiently calculate nearest neighbors in 3D vector space

Re:Using k-d trees to efficiently calculate nearest neighbor... by rwbt on Saturday February 10, 2018 @05:58PM (#16350121)

AABB Trees (Axis Aligned Bounding Box) might be an option. Most realtime collision detection systems utilize them.

[ Parent | on HN ]

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)

[ Parent | on HN ]