Comparison of Acceleration Data Structures for Electromagnetic Ray-Tracing Purposes on GPUs [EM Programmer's Notebook]

2015 ◽  
Vol 57 (5) ◽  
pp. 159-176 ◽  
Author(s):  
Alfonso Breglia ◽  
Amedeo Capozzoli ◽  
Claudio Curcio ◽  
Angelo Liseno
Keyword(s):  
Ray Tracing ◽  
Data Structures ◽  
Acceleration Data

scholarly journals Comparison of Acceleration Data Structures for High Quality Fast Reflections of Static and Deformable Models in Walkthrough Animations

2016 ◽  
Vol 7 (1) ◽  
pp. 1
Author(s):  
Daniel V Macedo ◽  
Maria Andréia F Rodrigues
Keyword(s):  
Ray Tracing ◽  
Data Structures ◽  
Hybrid Algorithm ◽  
Deformable Models ◽  
Extended Version ◽  
High Quality ◽  
Acceleration Data ◽  
Interactive Frame ◽  
Acceleration Structures ◽  
Realistic Images

In order to render realistic images, the reflectance of surfaces must be simulated accurately. Generally, the ray tracing rendering technique is used to make a material reflect its surroundings, since it represents with great fidelity the behavior of light. However, ray tracing is still a very costly algorithm, so far mostly indicated in offline rendering scenarios. This situation is even more challenging for scenes containing 3D deformable meshes, since their geometry and, thus, the acceleration structures used, need to be updated in each frame of the animation. In this paper, we present an extended version of our hybrid algorithm that combines rasterization and a pure ray tracing through the NVIDIA OptiX to render high quality fast reflections, including scenes with deformable models. Additionally, we analyze and compare the performances of different NVIDIA OptiX acceleration data structures for generating reflections of static and deformable models in walkthrough animations. The results show that NVIDIA OptiX acceleration structures reach high frames per second for static objects. However, there is a performance decay in terms of frames per second when dealing with deformable models, since it becomes necessary to update the acceleration structures to cope with changing geometry, but even under these restrictions, we were able to achieve interactive frame rates.

Data structures and the time complexity of ray tracing

1987 ◽  
Vol 3 (4) ◽  
pp. 201-213 ◽  
Author(s):  
Isaac D. Scherson ◽  
Elisha Caspary
Keyword(s):  
Ray Tracing ◽  
Data Structures ◽  
Time Complexity

scholarly journals Comparing Hierarchical Data Structures for Sparse Volume Rendering with Empty Space Skipping

2019 ◽  
Author(s):  
Stefan Zellmann
Keyword(s):  
Data Structures ◽  
Volume Rendering ◽  
Empty Space ◽  
Hierarchical Data ◽  
Trade Off ◽  
Hierarchical Data Structures ◽  
Bounding Volume ◽  
Uniform Grids ◽  
Acceleration Data ◽  
Bounding Volume Hierarchies

<div> <div> <div> <p><i>Empty space skipping can be efficiently implemented with hierarchical data structures such as k-d trees and bounding volume hierarchies. This paper compares several recently published hierarchical data structures with regard to construction and rendering performance. The papers that form our prior work have primarily focused on interactively building the data structures and only showed that rendering performance is superior to using simple acceleration data structures such as uniform grids with macro cells. In the area of surface ray tracing, there exists a trade-off between construction and rendering performance of hierarchical data structures. In this paper we present performance comparisons for several empty space skipping data structures in order to determine if such a trade-off also exists for volume rendering with uniform data topologies. </i></p> </div> </div> </div>

scholarly journals Comparing Hierarchical Data Structures for Sparse Volume Rendering with Empty Space Skipping

2019 ◽  
Author(s):  
Stefan Zellmann
Keyword(s):  
Data Structures ◽  
Volume Rendering ◽  
Empty Space ◽  
Hierarchical Data ◽  
Trade Off ◽  
Hierarchical Data Structures ◽  
Bounding Volume ◽  
Uniform Grids ◽  
Acceleration Data ◽  
Bounding Volume Hierarchies

<div> <div> <div> <p><i>Empty space skipping can be efficiently implemented with hierarchical data structures such as k-d trees and bounding volume hierarchies. This paper compares several recently published hierarchical data structures with regard to construction and rendering performance. The papers that form our prior work have primarily focused on interactively building the data structures and only showed that rendering performance is superior to using simple acceleration data structures such as uniform grids with macro cells. In the area of surface ray tracing, there exists a trade-off between construction and rendering performance of hierarchical data structures. In this paper we present performance comparisons for several empty space skipping data structures in order to determine if such a trade-off also exists for volume rendering with uniform data topologies. </i></p> </div> </div> </div>

Sign in / Sign up

Export Citation Format

Share Document