21 citations · 53 across the 13 of their papers we have counts for
Showing 2022 · cs.DSShow all
2 papers · 2 filters
cs.DS2022★ 3 cited
A Stack-Free Traversal Algorithm for Left-Balanced k-d Trees
Ingo Wald
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; in…
cs.DS2022
GPU-friendly, Parallel, and (Almost-)In-Place Construction of Left-Balanced k-d Trees
Ingo Wald
We present an algorithm that allows for building left-balanced and complete k-d trees over k-dimensional points in a trivially parallel and GPU friendly way. Our algorithm requires…