Barbier, WilhemPaulin, MathiasKnoll, AaronPeters, Christoph2025-06-202025-06-2020251467-8659https://doi.org/10.1111/cgf.70213https://diglib.eg.org/handle/10.1111/cgf70213We 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.Attribution 4.0 International LicenseCCS Concepts: Computing methodologies → Ray tracing; Massively parallel algorithmsComputing methodologies → Ray tracingMassively parallel algorithms10.1111/cgf.7021310 pages