Game Development Reference
In-Depth Information
Besides the partition issue, the memory consumption could be optimized by
decreasing or removing the empty space on the structure. However, doing this
might lead to having an extra look-up table or to a lack of simple arithmetic
operations to traverse the tree. We are currently looking for ways to remove the
empty nodes in the SLBVH while retaining the simple stackless traversal scheme.
We have also shown a very simple way to extend the framework to do global
illumination. Although naive, this implementation could also serve as a starting
point to create more optimized global illumination algorithms.
Even though the SLBVH was used on a ray-tracing environment, the data
structure may be used in other, more generic geometric search problems where
performance relies on eciently traversing a uniform set of data tokens repre-
sented in a heap. For instance, fast geometric search algorithms are widely used
in video games for collision detection and scene culling.
The authors would like to thank the Stanford Computer Graphics Laboratory
for the Happy Buddha and the Stanford Bunny models, the Bangor University
for the Welsh Dragon model (released for Eurographics 2011), and Crytek for its
modified version of the Sponza model.
[Ernest and Woop 11] Manfred Ernest and Sven Woop. “Embree—Photo-
Realistic Ray Tracing Kernels.” Intel Software ,
en-us/articles/embree-photo-realistic-ray-tracing-kernels/ , 2011.
[Garanzha and Loop 10] Kirill Garanzha and Charles Loop. “Fast Ray Sort-
ing and Breadth-First Packet Traversal for GPU Ray Tracing.” Computer
Graphics Forum 29:2 (2010), 289-298.
[Garcia et al. 12] Arturo Garcia, Francisco Avila, Sergio Murguia, and Leo Reyes.
“Interactive Ray Tracing Using DirectX11 on the Compute Shader.” In GPU
Pro 3 , edited by Wolfgang Engel, pp. 353-376. Boca Raton, FL: CRC Press,
[Laine 10] Samuli Laine. “Restart Trail for Stackless BVH Traversal.” In Proceed-
ings of the Conference on High Performance Graphics , pp. 107-111. Aire-la-
Ville, Switzerland: Eurographics Association, 2010.
[Lauterbach et al. 09] Christian Lauterbach, Michael Garland, Shubhabrata Sen-
gupta, David Luebke, and Dinesh Manocha. “Fast BVH Construction on
GPUs.” Computer Graphics Forum 28:2 (2009), 375-384.
Search Nedrilad ::

Custom Search