Review: Kd-tree Traversal Algorithms for Ray Tracing
No Thumbnail Available
Date
2011
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and Blackwell Publishing Ltd.
Abstract
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.
Description
@article{10.1111:j.1467-8659.2010.01844.x,
journal = {Computer Graphics Forum},
title = {{Review: Kd-tree Traversal Algorithms for Ray Tracing}},
author = {Hapala, M. and Havran, V.},
year = {2011},
publisher = {The Eurographics Association and Blackwell Publishing Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2010.01844.x}
}