Review: Kd-tree Traversal Algorithms for Ray Tracing

Simple item page
dc.contributor.authorHapala, M.en_US
dc.contributor.authorHavran, V.en_US
dc.contributor.editorEduard Groeller and Holly Rushmeieren_US
dc.date.accessioned2015-02-27T10:19:13Z
dc.date.available2015-02-27T10:19:13Z
dc.date.issued2011en_US
dc.description.abstractIn 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.en_US
dc.description.documenttypestar
dc.description.number1
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume30
dc.identifier.doi10.1111/j.1467-8659.2010.01844.x
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/v30i1pp199-213
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2010.01844.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleReview: Kd-tree Traversal Algorithms for Ray Tracingen_US
Files
Collections
30-Issue 1