GPU-friendly, Parallel, and (Almost-)In-Place Construction of Left-Balanced k-d Trees
Data Structures and Algorithms
2023-04-06 v3 Graphics
Abstract
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 exactly one int per data point as temporary storage, and uses O(log N) iterations, each of which performs one parallel sort, and one trivially parallel CUDA per-node update kernel.
Keywords
Cite
@article{arxiv.2211.00120,
title = {GPU-friendly, Parallel, and (Almost-)In-Place Construction of Left-Balanced k-d Trees},
author = {Ingo Wald},
journal= {arXiv preprint arXiv:2211.00120},
year = {2023}
}