Review: Kd-tree Traversal Algorithms for Ray Tracing
Article first published online: 24 JAN 2011
© 2011 The Authors Computer Graphics Forum © 2011 The Eurographics Association and Blackwell Publishing Ltd.
Computer Graphics Forum
Volume 30, Issue 1, pages 199–213, March 2011
How to Cite
Hapala, M. and Havran, V. (2011), Review: Kd-tree Traversal Algorithms for Ray Tracing. Computer Graphics Forum, 30: 199–213. doi: 10.1111/j.1467-8659.2010.01844.x
- Issue published online: 24 FEB 2011
- Article first published online: 24 JAN 2011
- ray tracing;
- I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism—Ray Tracing
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.