A Stack-Free Traversal Algorithm for Left-Balanced k-d Trees

10/23/2022
by   Ingo Wald, et al.
0

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

page 1

page 2

page 3

page 4

research
10/31/2022

GPU-friendly, Parallel, and (Almost-)In-Place Construction of Left-Balanced k-d Trees

We present an algorithm that allows for building left-balanced and compl...
research
04/09/2020

A Pedagogically Sound yet Efficient Deletion algorithm for Red-Black Trees: The Parity-Seeking Delete Algorithm

Red-black (RB) trees are one of the most efficient variants of balanced ...
research
06/01/2022

Rational partition models under iterative proportional scaling

In this work we investigate partition models, the subset of log-linear m...
research
02/08/2020

Node Templates to improve Reusability and Modularity of Behavior Trees

Behavior Trees (BTs) got the robotics society attention not least thanks...
research
08/28/2019

Eliminating Left Recursion without the Epsilon

The standard algorithm to eliminate indirect left recursion takes a prev...
research
12/18/2013

Nonlinear Eigenproblems in Data Analysis - Balanced Graph Cuts and the RatioDCA-Prox

It has been recently shown that a large class of balanced graph cuts all...
research
03/24/2023

Sharp threshold for embedding balanced spanning trees in random geometric graphs

A rooted tree is balanced if the degree of a vertex depends only on its ...

Please sign up or login with your details

Forgot password? Click here to reset