Efficient construction of bounding volume hierarchies into a complete octree for ray tracing

2016 ◽  
Vol 27 (3-4) ◽  
pp. 358-368 ◽  
Author(s):  
Ulises Olivares ◽  
Héctor G. Rodríguez ◽  
Arturo García ◽  
Félix F. Ramos
Keyword(s):  
Ray Tracing ◽  
Bounding Volume ◽  
Efficient Construction ◽  
Bounding Volume Hierarchies

A Survey on Bounding Volume Hierarchies for Ray Tracing

2021 ◽  
Vol 40 (2) ◽  
pp. 683-712
Author(s):  
Daniel Meister ◽  
Shinji Ogaki ◽  
Carsten Benthin ◽  
Michael J. Doyle ◽  
Michael Guthe ◽  
...  
Keyword(s):  
Ray Tracing ◽  
Bounding Volume ◽  
Bounding Volume Hierarchies

Hardware-Accelerated Dual-Split Trees

2020 ◽  
Vol 3 (2) ◽  
pp. 1-21
Author(s):  
Daqi Lin ◽  
Elena Vasiou ◽  
Cem Yuksel ◽  
Daniel Kopta ◽  
Erik Brunvand
Keyword(s):  
Ray Tracing ◽  
Hardware Acceleration ◽  
Memory Storage ◽  
Compact Representation ◽  
Space Partitioning ◽  
Data Movement ◽  
Bounding Volume ◽  
Bounding Boxes ◽  
Split Trees ◽  
Bounding Volume Hierarchies

Bounding volume hierarchies (BVH) are the most widely used acceleration structures for ray tracing due to their high construction and traversal performance. However, the bounding planes shared between parent and children bounding boxes is an inherent storage redundancy that limits further improvement in performance due to the memory cost of reading these redundant planes. Dual-split trees can create identical space partitioning as BVHs, but in a compact form using less memory by eliminating the redundancies of the BVH structure representation. This reduction in memory storage and data movement translates to faster ray traversal and better energy efficiency. Yet, the performance benefits of dual-split trees are undermined by the processing required to extract the necessary information from their compact representation. This involves bit manipulations and branching instructions which are inefficient in software. We introduce hardware acceleration for dual-split trees and show that the performance advantages over BVHs are emphasized in a hardware ray tracing context that can take advantage of such acceleration. We provide details on how the operations needed for decoding dual-split tree nodes can be implemented in hardware and present experiments in a number of scenes with different sizes using path tracing. In our experiments, we have observed up to 31% reduction in render time and 38% energy saving using dual-split trees as compared to binary BVHs representing identical space partitioning.

Using Hardware Ray Transforms to Accelerate Ray/Primitive Intersections for Long, Thin Primitive Types

2020 ◽  
Vol 3 (2) ◽  
pp. 1-16
Author(s):  
Ingo Wald ◽  
Nate Morrical ◽  
Stefan Zellmann ◽  
Lei Ma ◽  
Will Usher ◽  
...  
Keyword(s):  
Ray Tracing ◽  
Data Sets ◽  
Bounding Box ◽  
Bounding Volume ◽  
Recent Addition ◽  
Bounding Boxes ◽  
Ray Transforms ◽  
Bounding Volume Hierarchies

With the recent addition of hardware ray tracing capabilities, GPUs have become incredibly efficient at ray tracing both triangular geometry, and instances thereof. However, the bounding volume hierarchies that current ray tracing hardware relies on are known to struggle with long, thin primitives like cylinders and curves, because the axis-aligned bounding boxes that these hierarchies rely on cannot tightly bound such primitives. In this paper, we evaluate the use of RTX ray tracing capabilities to accelerate these primitives by tricking the GPU's instancing units into executing a hardware-accelerated oriented bounding box (OBB) rejection test before calling the user's intersection program. We show that this can be done with minimal changes to the intersection programs and demonstrate speedups of up to 5.9× on a variety of data sets.

Ray tracing deformable scenes using dynamic bounding volume hierarchies

2007 ◽  
Vol 26 (1) ◽  
pp. 6 ◽  
Author(s):  
Ingo Wald ◽  
Solomon Boulos ◽  
Peter Shirley
Keyword(s):  
Ray Tracing ◽  
Bounding Volume ◽  
Bounding Volume Hierarchies

scholarly journals Constructing K-d Tree on GPU through Treelet Restructuring

2020 ◽  
pp. short56-1-short56-8
Author(s):  
Vadim Bulavintsev ◽  
Dmitry Zhdanov
Keyword(s):  
Ray Tracing ◽  
Graphics Processing Units ◽  
Global Illumination ◽  
Mapping Method ◽  
Bounding Volume ◽  
Illumination Algorithms ◽  
Graphics Processing ◽  
New Generation ◽  
Bounding Volume Hierarchies ◽  
Acceleration Structure

With every new generation of graphics processing units (GPUs), offloading ray-tracing algorithms to GPUs becomes more feasible. Software-hardware solutions for ray-tracing focus on implementing its basic components, such as building and traversing bounding volume hierarchies (BVH). However, global illumination algorithms, such as photon mapping method, depend on another kind of acceleration structure, namely k-d trees. In this work, we adapt state-ofthe-art GPU-based BVH-building algorithm of treelet restructuring to k-d trees. By evaluating the performance of the resulting k-d tree, we show that treelet optimisation heuristic suitable for BVHs of triangles is inadequate for k-d trees of points.

Multi bounding volume hierarchies for ray tracing pipelines

2016 ◽  
Author(s):  
Timo Viitanen ◽  
Matias Koskela ◽  
Pekka Jääskeläinen ◽  
Jarmo Takala
Keyword(s):  
Ray Tracing ◽  
Bounding Volume ◽  
Bounding Volume Hierarchies
Sign in / Sign up

Export Citation Format

Share Document