The Split Grid - A Hierarchical 1D-Grid-based Acceleration Data Structure for Ray Tracing
dc.contributor.author | Bauszat, Pablo | en_US |
dc.contributor.author | Kastner, Marc Aurel | en_US |
dc.contributor.author | Eisemann, Martin | en_US |
dc.contributor.author | Magnor, Marcus | en_US |
dc.contributor.editor | Mathias Paulin and Carsten Dachsbacher | en_US |
dc.date.accessioned | 2014-12-16T07:10:02Z | |
dc.date.available | 2014-12-16T07:10:02Z | |
dc.date.issued | 2014 | en_US |
dc.description.abstract | We present a new acceleration structure for ray tracing called the Split Grid. Combining concepts of hierarchical grids, kd-trees and Bounding Volume Hierarchies (BVHs), our approach is based on the idea of nesting 1D-grids. Our proposed acceleration structure is compact in storage, adaptive to the scene geometry and can be traversed using a fast and efficient traversal scheme. We show that the Split Grid is comparable to other current state-of-theart acceleration structures regarding traversal performance and memory footprint. While other data structures usually achieve these levels of performance only due to a complex and expensive construction process (e.g. using the Surface Area Heuristic (SAH) [MB90]), our proposed Split Grid is built with a very simplistic construction scheme which is a major benefit of our approach. | en_US |
dc.description.seriesinformation | Eurographics 2014 - Posters | en_US |
dc.identifier.issn | 1017-4656 | en_US |
dc.identifier.uri | https://doi.org/10.2312/egp.20141067 | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.subject | I.3.6 [Computer Graphics] | en_US |
dc.subject | Methodology and Techniques | en_US |
dc.subject | Graphics data structures and data types | en_US |
dc.subject | I.3.7 [Computer Graphics] | en_US |
dc.subject | Three Dimensional Graphics and Realism | en_US |
dc.subject | Raytracing | en_US |
dc.title | The Split Grid - A Hierarchical 1D-Grid-based Acceleration Data Structure for Ray Tracing | en_US |
Files
Original bundle
1 - 1 of 1