Fast BVH Construction on GPUs
Article first published online: 27 MAR 2009
© 2008 The Author(s) Journal compilation © 2008 The Eurographics Association and Blackwell Publishing Ltd.
Computer Graphics Forum
Volume 28, Issue 2, pages 375–384, April 2009
How to Cite
Lauterbach, C., Garland, M., Sengupta, S., Luebke, D. and Manocha, D. (2009), Fast BVH Construction on GPUs. Computer Graphics Forum, 28: 375–384. doi: 10.1111/j.1467-8659.2009.01377.x
- Issue published online: 27 MAR 2009
- Article first published online: 27 MAR 2009
We present two novel parallel algorithms for rapidly constructing bounding volume hierarchies on manycore GPUs. The first uses a linear ordering derived from spatial Morton codes to build hierarchies extremely quickly and with high parallel scalability. The second is a top-down approach that uses the surface area heuristic (SAH) to build hierarchies optimized for fast ray tracing. Both algorithms are combined into a hybrid algorithm that removes existing bottlenecks in the algorithm for GPU construction performance and scalability leading to significantly decreased build time. The resulting hierarchies are close in to optimized SAH hierarchies, but the construction process is substantially faster, leading to a significant net benefit when both construction and traversal cost are accounted for. Our preliminary results show that current GPU architectures can compete with CPU implementations of hierarchy construction running on multicore systems. In practice, we can construct hierarchies of models with up to several million triangles and use them for fast ray tracing or other applications.