dc.contributor.author | Nah, Jae-Ho | en_US |
dc.contributor.author | Manocha, Dinesh | en_US |
dc.contributor.editor | Oliver Deussen and Hao (Richard) Zhang | en_US |
dc.date.accessioned | 2015-03-03T12:45:20Z | |
dc.date.available | 2015-03-03T12:45:20Z | |
dc.date.issued | 2014 | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/cgf.12341 | en_US |
dc.description.abstract | We present the surface area traversal order (SATO) metric to accelerate shadow ray traversal. Our formulation uses the surface area of each child node to compute the TO. In this metric, we give a traversal priority to the child node with the larger surface area to quickly find occluders. Our algorithm reduces the pre-processing overhead significantly, and is much faster than other metrics. Overall, the SATO is useful for ray tracing large and complex dynamic scenes (e.g. a few million triangles) with shadows.We present the surface-area traversal order (SATO) metric to accelerate shadow ray traversal. Our formulation uses the surface area of each child node to compute the traversal order. Our algorithm reduces the preprocessing overhead significantly, and is much faster than other metrics. | en_US |
dc.publisher | The Eurographics Association and John Wiley and Sons Ltd. | en_US |
dc.title | SATO: Surface Area Traversal Order for Shadow Ray Tracing | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 33 | |
dc.description.number | 6 | |