GPU-friendly, Parallel, and (Almost-)In-Place Construction of Left-Balanced k-d Trees
arxiv(2023)
摘要
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.
更多查看译文
关键词
trees,parallel,gpu-friendly,in-place,left-balanced
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要