Review: Kd-tree Traversal Algorithms for Ray Tracing
Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic
Computer Graphics Forum, Volume 30, Issue 1, pages 199-213, 2011
@article{CGF:CGF1844,
author={Hapala, M. and Havran, V.},
title={Review: Kd-tree Traversal Algorithms for Ray Tracing},
journal={Computer Graphics Forum},
volume={30},
number={1},
publisher={Blackwell Publishing Ltd},
issn={1467-8659},
url={http://dx.doi.org/10.1111/j.1467-8659.2010.01844.x},
doi={10.1111/j.1467-8659.2010.01844.x},
pages={199–213},
keywords={I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Ray Tracing},
year={2011}
}
In this paper we review the traversal algorithms for kd-trees for ray tracing. Ordinary traversal algorithms such as sequential, recursive, and those with neighbour-links have different limitations, which led to several new developments within the last decade. We describe algorithms exploiting ray coherence and algorithms designed with specific hardware architecture limitations such as memory latency and consumption in mind. We also discuss the robustness of traversal algorithms as one issue that has been neglected in previous research.
February 20, 2012 by hgpu
