Rasterized Bounding Volume Hierarchies

  • Authors:
  • Jan Novák;Carsten Dachsbacher

  • Affiliations:
  • Computer Graphics Group / Karlsruhe Institute of Technology;Computer Graphics Group / Karlsruhe Institute of Technology

  • Venue:
  • Computer Graphics Forum
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present the rasterized bounding volume hierarchy (RBVH), a compact data structure that accelerates approximate ray casting of complex meshes and provides adjustable level of detail. During construction, we identify subtrees of BVHs containing surfaces that can be represented by height fields. For these subtrees the conventional ray-surface intersection, which possibly involves a large number of triangles, is replaced by a simple ray marching procedure to find the intersection with the surface. We describe GPU algorithms for construction, ray casting, and data querying of the RBVH that achieve comparable or higher performance than state of the art acceleration structures for triangle meshes. Moreover, RBVHs provide an inherent surface parameterization for storing data on the surfaces and natively handle triangle and point-based surface representations. We also show that RBVHs support adaptive level-of-detail and can be combined with traditional BVHs to handle complex scenes. © 2012 Wiley Periodicals, Inc.