6339

Efficient Stack-less BVH Traversal for Ray Tracing

Michal Hapala, Tomas Davidovic, Ingo Wald, Vlastimil Havran, Philipp Slusallek
Czech Technical University in Prague, Faculty of Electrical Engineering
27th Spring Conference on Computer Graphics (SCCG 2011), 2011

@Inproceedings{hapala:sccg2011,

   title={Efficient Stack-less BVH Traversal for Ray Tracing},

   year={2011},

   url={http://graphics.cg.uni-saarland.de/?id=hapalasccg2011},

   booktitle={27th Spring Conference on Computer Graphics (SCCG 2011)},

   state={unpublished},

   author={Hapala, Michal and Davidovic, Tomas and Wald, Ingo and Havran, Vlastimil and Philipp Slusallek}

}

Download Download (PDF)   View View   Source Source   

1245

views

We propose a new, completely iterative traversal algorithm for ray tracing bounding volume hierarchies that is based on storing a parent pointer with each node, and on using simple state logic to infer which node to traverse next. Though our traversal algorithm does re-visit internal nodes, it intersects each visited node only once, and in general performs exactly the same ray-box tests and ray-primitive intersection tests-and in exactly the same order-as a traditional stack-based variant. The proposed algorithm can be used for computer architectures that need to minimize the use of local memory for processing rays or those that need to minimize the data transport such as distributed multi-CPU architectures.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: