DMCA
Fast bvh construction on gpus (2009)
| Venue: | IN PROC. EUROGRAPHICS ’09 |
| Citations: | 54 - 9 self |
BibTeX
@INPROCEEDINGS{Lauterbach09fastbvh,
author = {C. Lauterbach and M. Garland and S. Sengupta and D. Luebke and D. Manocha},
title = {Fast bvh construction on gpus},
booktitle = {IN PROC. EUROGRAPHICS ’09},
year = {2009},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
fast bvh construction surface area traversal cost novel parallel construction process significant net benefit gpu construction performance cpu implementation multicore system top-down approach sah hierarchy volume hierarchy build time hybrid algorithm ray tracing current gpu architecture manycore gpus hierarchy construction preliminary result high parallel scalability fast ray tracing resulting hierarchy spatial morton code
