A Stack-Free Traversal Algorithm for Left-Balanced k-d Trees
share
We present an algorithm that allows for find-closest-point and kNN-style traversals of left-balanced k-d trees, without the need for either recursion or software-managed stacks; instead using only current and last previously traversed node to compute which node to traverse next.
READ FULL TEXT