A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Real-time KD-tree construction on graphics hardware
2008
ACM SIGGRAPH Asia 2008 papers on - SIGGRAPH Asia '08
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
doi:10.1145/1457515.1409079
fatcat:5osvvoz545a75nyhozb4gfu5ey