"We present a new stackless ray traversal algorithm which makes use of kD-tree augmented with sparsely distributed bounding boxes. The proposed traversal algorithm is not restricted to start the hierarchy traversal at the root node and so it can exploit the knowledge of the ray origin. The algorithm achieves traversal times comparable with the traditional hierarchical traversal as well as recently introduced bottom-up traversal with sparse boxes. The stackless nature of the algorithm lends itself towards implementation of the method on the architectures with limited number of registers."@cs . . . "21230" . "Stackless Ray Traversal for kD-Trees with Sparse Boxes"@cs . . "Computer Graphics & Geometry" . "[38ABA2B4C49C]" . "RU - Rusk\u00E1 federace" . "P(LC06008)" . "Stackless Ray Traversal for kD-Trees with Sparse Boxes"@en . "kd trees; sparse boxes"@en . "1514"^^ . "9" . "Havran, Vlastimil" . "RIV/68407700:21230/07:03138105!RIV08-MSM-21230___" . "Stackless Ray Traversal for kD-Trees with Sparse Boxes" . "Stackless Ray Traversal for kD-Trees with Sparse Boxes"@en . "1811-8992" . . . "3" . . "We present a new stackless ray traversal algorithm which makes use of kD-tree augmented with sparsely distributed bounding boxes. The proposed traversal algorithm is not restricted to start the hierarchy traversal at the root node and so it can exploit the knowledge of the ray origin. The algorithm achieves traversal times comparable with the traditional hierarchical traversal as well as recently introduced bottom-up traversal with sparse boxes. The stackless nature of the algorithm lends itself towards implementation of the method on the architectures with limited number of registers."@en . . . "Stackless Ray Traversal for kD-Trees with Sparse Boxes" . "2"^^ . . "16;30" . "We present a new stackless ray traversal algorithm which makes use of kD-tree augmented with sparsely distributed bounding boxes. The proposed traversal algorithm is not restricted to start the hierarchy traversal at the root node and so it can exploit the knowledge of the ray origin. The algorithm achieves traversal times comparable with the traditional hierarchical traversal as well as recently introduced bottom-up traversal with sparse boxes. The stackless nature of the algorithm lends itself towards implementation of the method on the architectures with limited number of registers." . . "RIV/68407700:21230/07:03138105" . "Stackless Ray Traversal for kD-Trees with Sparse Boxes"@cs . "2"^^ . . "452003" . . . "Bittner, Ji\u0159\u00ED" . . .