. "2"^^ . . . "226912" . "GB - Spojen\u00E9 kr\u00E1lovstv\u00ED Velk\u00E9 Brit\u00E1nie a Severn\u00EDho Irska" . "ray tracing; kd-trees"@en . "P(GAP202/11/1883), P(LC06008), P(MEB060906), S, Z(MSM6840770014)" . "30" . "10.1111/j.1467-8659.2010.01844.x" . "21230" . "2"^^ . "0167-7055" . "Review: Kd-tree Traversal Algorithms for Ray Tracing"@en . . "[8D07AF6949F7]" . . "http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2010.01844.x/abstract" . . . "Hapala, Michal" . "000287701100015" . . "In this paper we review the traversal algorithms for kd-trees for ray tracing. Ordinary traversal algorithms such as sequential, recursive, and those with neighbor-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 . . "1" . . . "Computer Graphics Forum" . "RIV/68407700:21230/11:00174010" . . . . "Review: Kd-tree Traversal Algorithms for Ray Tracing" . . . "15"^^ . "In this paper we review the traversal algorithms for kd-trees for ray tracing. Ordinary traversal algorithms such as sequential, recursive, and those with neighbor-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." . "RIV/68407700:21230/11:00174010!RIV12-MSM-21230___" . "Review: Kd-tree Traversal Algorithms for Ray Tracing"@en . "Review: Kd-tree Traversal Algorithms for Ray Tracing" . . "Havran, Vlastimil" . . . . .