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.

翻译：我们提出了一种算法，可以在GPU上以一种简单的并行方式构建左平衡和完整的K-D树。我们的算法每个数据点仅需要一个int作为临时存储，并使用O(log N)次迭代，每次迭代执行一个并行排序和一个简单的并行CUDA每节点更新内核。