English
资源说明：We present an algorithm for constructing kd-trees on GPUs. This
algorithm achieves real-time performance by exploiting the GPU’s
streaming architecture at all stages of kd-tree construction. Unlike
previous parallel kd-tree algorithms, our method builds tree nodes
completely in BFS (breadth-first search) order. We also develop a
special strategy for large nodes at upper tree levels so as to further
exploit the fine-grained parallelism of GPUs. For these nodes, we
parallelize the computation over all geometric primitives instead of
nodes at each level. Finally, in order to maintain kd-tree quality, we
introduce novel schemes for fast evaluation of node split costs.
本源码包内暂不包含可直接显示的源代码文件，请下载源码包。
