Fast BVH Construction on GPUs

Simple item page
dc.contributor.authorLauterbach, C.en_US
dc.contributor.authorGarland, M.en_US
dc.contributor.authorSengupta, S.en_US
dc.contributor.authorLuebke, D.en_US
dc.contributor.authorManocha, D.en_US
dc.date.accessioned2015-02-23T10:15:37Z
dc.date.available2015-02-23T10:15:37Z
dc.date.issued2009en_US
dc.description.abstractWe 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.en_US
dc.description.number2en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume28en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01377.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages375-384en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01377.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleFast BVH Construction on GPUsen_US
Files
Collections
28-Issue 2
Full Papers 2009 - CGF 28-Issue 2