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(logN ) iterations, each of which performs one parallel sort, and one trivially parallel CUDA per-node update kernel.

翻译：我们提出一种算法,允许在k维点上以微不足道的平行和对GPU友好的方式建立左平衡和完整的 k-d 树。 我们的算法要求每个数据点一整,作为临时存储,并使用O(logN) 迭代,每个迭代都执行一种平行类型,以及一个微小平行的 CUDA / node 更新内核。