Review: Kd‐tree Traversal Algorithms for Ray Tracing
Review: Kd‐tree Traversal Algorithms for Ray Tracing
复制标题
DOI：
10.1111/j.1467-8659.2010.01844.x
复制
发表时间：
2011-03
影响因子：
2.5
通讯作者：
Michal Hapala;V. Havran
中科院分区：
文献类型：
--
作者：
Michal Hapala;V. Havran
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.
