@inproceedings{Hapala:2011ESB,
author = {Hapala, Michal and Davidovi\v{c}, Tom\'{a}\v{s} and Wald, Ingo and Havran, Vlastimil and Slusallek, Philipp},
title = {Efficient Stack-less BVH Traversal for Ray Tracing},
booktitle = {Proceedings of the 27th Spring Conference on Computer Graphics},
series = {SCCG '11},
year = {2013},
isbn = {978-1-4503-1978-2},
location = {Vinicne, Slovak Republic},
pages = {7--12},
numpages = {6},
url = {http://doi.acm.org/10.1145/2461217.2461219},
doi = {10.1145/2461217.2461219},
acmid = {2461219},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {bounding volume hierarchy, ray tracing, stack-based, stack-less traversal algorithm},
month = {April/May},
abstract = {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.},
}