Simpler and faster HLBVH with work queues
NVIDIA
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics, HPG ’11, 2011
@inproceedings{garanzha2011simpler,
title={Simpler and faster HLBVH with work queues},
author={Garanzha, K. and Pantaleoni, J. and McAllister, D.},
booktitle={Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics},
pages={59–64},
year={2011},
organization={ACM}
}
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tracing in real-time, even in the presence of millions of fully dynamic triangles. In this work we present a simpler and faster variant of HLBVH, where all the complex book-keeping of prefix sums, compaction and partial breadth-first tree traversal needed for spatial partitioning has been replaced with an elegant pipeline built on top of efficient work queues and binary search. The new algorithm is both faster and more memory efficient, removing the need for temporary storage of geometry data for intermediate computations. Finally, the same pipeline has been extended to parallelize the construction of the top-level SAH optimized tree on the GPU, eliminating round-trips to the CPU, accelerating the overall construction speed by a factor of 5 to 10x.
September 19, 2011 by hgpu
