Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/2614348.2614356 | SCCG |
Keywords | Field | DocType |
visibility,ray tracing,data structures,raytracing | Spatial analysis,Data structure,Tree traversal,Computer science,Explicit knowledge,Ray tracing (graphics),Theoretical computer science,Acceleration,Hierarchy,Bounding overwatch | Conference |
Citations | PageRank | References |
4 | 0.52 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vlastimil Havran | 1 | 353 | 34.71 |
| Jiri Bittner | 2 | 63 | 5.88 |