News for hackers. Stuff that matters.

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

Re:Using k-d trees to efficiently calculate nearest neighbor... by geophile on Saturday February 10, 2018 @07:31PM (#16350449)
Oh! I see the problem.

I don't mean just a tree keyed on the z-axis. I mean z-order: https://en.wikipedia.org/wiki/Z-order

[ Parent | on HN ]
Re:Using k-d trees to efficiently calculate nearest neighbor... by boulos on Saturday February 10, 2018 @08:21PM (#16350623)
Ahh! I wasn’t sure, so sadly I chose “z as in z axis” not Z as in Z/space-filling/Hilbert/Morton order. That’s a grid in disguise! :).
[ Parent | on HN ]