论文标题
GPU友好，平行和（几乎 - ）左平衡K-d树的构造
GPU-friendly, Parallel, and (Almost-)In-Place Construction of Left-Balanced k-d Trees
论文作者
论文摘要
我们提出了一种算法，该算法允许以微不足道的和GPU友好的方式在k维点上建造左平衡和完整的K-d树。我们的算法需要每个数据点作为临时存储，并使用O（log n）迭代，每个迭代都执行一个并行排序，并且一个琐碎的平行CUDA每节点更新内核。
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.
