A Stack-Free Traversal Algorithm for Left-Balanced k-d Trees
Data Structures and Algorithms
2022-11-04 v2
Abstract
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.
Cite
@article{arxiv.2210.12859,
title = {A Stack-Free Traversal Algorithm for Left-Balanced k-d Trees},
author = {Ingo Wald},
journal= {arXiv preprint arXiv:2210.12859},
year = {2022}
}