Fused Collapsing for Wide BVH Construction

Wilhem Barbier Mathias Paulin
IRIT, Université de Toulouse
Paper Slides Talk
Supp. data Supp. video

We propose a novel approach for constructing wide bounding volume hierarchies on the GPU by integrating a simple bottom-up collapsing procedure within an existing binary bottom-up BVH builder. Our approach directly constructs a wide BVH without traversing a temporary binary BVH as done by previous approaches and achieves 1.4−1.6× lower build times. We demonstrate the ability of our algorithm to output compressed wide BVHs using existing compressed representations. We analyze the impact of our method on software raytracing performance and show that it reduces the overall frame time on complex dynamic scenes where rebuilding the BVH every frame is the limiting factor on rendering performance.


Our wide BVH construction algorithm is divided in three steps: first we integrate a bottom-up collapsing algorithm within an existing binary bottom-up BVH builder, allowing us to directly compute the topology of our wide BVH without additional traversal. Then we assign indices so that sibling nodes and triangles are numbered consecutively, and finally we write the wide BVH using a compressed representation.