HLBVH: hierarchical LBVH construction for real-time ray tracing of dynamic geometry

  • Authors:
  • J. Pantaleoni;D. Luebke

  • Affiliations:
  • NVIDIA Research;NVIDIA Research

  • Venue:
  • Proceedings of the Conference on High Performance Graphics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present HLBVH and SAH-optimized HLBVH, two high performance BVH construction algorithms targeting real-time ray tracing of dynamic geometry. HLBVH provides a novel hierarchical formulation of the LBVH algorithm [LGS*09] and SAH-optimized HLBVH uses a new combination of HLBVH and the greedy surface area heuristic algorithm. These algorithms minimize work and memory bandwidth usage by extracting and exploiting coarse-grained spatial coherence already available in the input meshes. As such, they are well-suited for sorting dynamic geometry, in which the mesh to be sorted at a given time step can be defined as a transformation of a mesh that has been already sorted at the previous time step. Our algorithms always perform full resorting, unlike previous approaches based on refitting. As a result they remain efficient even during chaotic and discontinuous transformations, such as fracture or explosion.