"P(LC06008)" . "data structures; ray tracing; visibility"@en . "2"^^ . . "49;54" . "2"^^ . . . "Ray Tracing with Sparse Boxes"@en . . . . "Ray Tracing with Sparse Boxes" . . "Sledov\u00E1n\u00ED paprsk\u016F s vyu\u017Eit\u00EDm metody %22Sparse Boxes%22"@cs . . "Bratislava" . "RIV/68407700:21230/07:03132820!RIV08-MSM-21230___" . . "2007-04-26+02:00"^^ . "6"^^ . "Sledov\u00E1n\u00ED paprsk\u016F s vyu\u017Eit\u00EDm metody %22Sparse Boxes%22"@cs . "Ray Tracing with Sparse Boxes" . "[AA39D75A189D]" . "nen\u00ED zn\u00E1ma"@cs . "21230" . "Univerzita Komensk\u00E9ho v Bratislave" . "Spring Conference on Computer Graphics SCCG 2007. Conference Proceedings" . "RIV/68407700:21230/07:03132820" . "Havran, Vlastimil" . "446457" . . . . . "We present a new method for ray tracing acceleration by modification of current spatial data structures. We augment a spatial hierarchy such as kd-tree with sparsely distributed bounding boxes that are linked from bottom to top. The augmented data structures can be viewed as a hybrid between kd-trees and uniform grids. The augmentation by boxes is used in new traversal algorithms, which are not restricted to start the hierarchy traversal at the root node. This is in particular efficient for short rays where we significantly reduce the number of traversal steps through the hierarchy. Further we make use of ray coherence as well as explicit knowledge of ray distribution and initiate the traversal near the leaf nodes where the intersection is expected."@en . "978-80-223-2292-8" . . "Bittner, Ji\u0159\u00ED" . . . . "We present a new method for ray tracing acceleration by modification of current spatial data structures. We augment a spatial hierarchy such as kd-tree with sparsely distributed bounding boxes that are linked from bottom to top. The augmented data structures can be viewed as a hybrid between kd-trees and uniform grids. The augmentation by boxes is used in new traversal algorithms, which are not restricted to start the hierarchy traversal at the root node. This is in particular efficient for short rays where we significantly reduce the number of traversal steps through the hierarchy. Further we make use of ray coherence as well as explicit knowledge of ray distribution and initiate the traversal near the leaf nodes where the intersection is expected." . "Budmerice" . "Ray Tracing with Sparse Boxes"@en .