Efficient incoherent ray traversal on GPUs through compressed wide BVHs
Authors:
Open Access
- 28 July 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Abstract
We present a GPU-based ray traversal algorithm that operates on compressed wide BVHs and maintains the traversal stack in a compressed format. Our method reduces the amount of memory traffic significantly, which translates to 1.9--2.1× improvement in incoherent ray traversal performance compared to the current state of the art. Furthermore, the memory consumption of our hierarchy is 35--60% of a typical uncompressed BVH. In addition, we present an algorithmically efficient method for converting a binary BVH into a wide BVH in a SAH-optimal fashion, and an improved method for ordering the child nodes at build time for the purposes of octant-aware fixed-order traversal.Keywords
This publication has 17 references indexed in Scilit:
- Dynamic ray stream traversalACM Transactions on Graphics, 2014
- Stackless Multi‐BVH Traversal for CPU, MIC and GPU Ray TracingComputer Graphics Forum, 2013
- Combining Single and Packet-Ray Tracing for Arbitrary Ray Distributions on the Intel MIC ArchitectureIEEE Transactions on Visualization and Computer Graphics, 2011
- Efficient stack-less BVH traversal for ray tracing2011
- Fast Ray Sorting and Breadth‐First Packet Traversal for GPU Ray TracingComputer Graphics Forum, 2010
- Faster incoherent rays2009
- Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent RaysComputer Graphics Forum, 2008
- Memory‐Conserving Bounding Volume Hierarchies with Coherent RaytracingComputer Graphics Forum, 2006
- Lightweight Bounding Volumes for Ray TracingJournal of Graphics Tools, 2006
- Heuristics for ray tracing using space subdivisionThe Visual Computer, 1990