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.

翻译：我们提出一种算法,允许左平衡的 k-d 树的查找- 关闭点和 kNN- 风格的跨行,而不需要循环或软件管理的堆叠;而只使用当前和上一次穿行节点来计算下一个弯曲的节点。