Handle URI:
http://hdl.handle.net/10754/599543
Title:
RTSAH Traversal Order for Occlusion Rays
Authors:
Ize, Thiago; Hansen, Charles
Abstract:
We accelerate the finding of occluders in tree based acceleration structures, such as a packetized BVH and a single ray kd-tree, by deriving the ray termination surface area heuristic (RTSAH) cost model for traversing an occlusion ray through a tree and then using the RTSAH to determine which child node a ray should traverse first instead of the traditional choice of traversing the near node before the far node. We further extend RTSAH to handle materials that attenuate light instead of fully occluding it, so that we can avoid superfluous intersections with partially transparent objects. For scenes with high occlusion, we substantially lower the number of traversal steps and intersection tests and achieve up to 2× speedups. © 2010 The Author(s).
Citation:
Ize T, Hansen C (2011) RTSAH Traversal Order for Occlusion Rays. Computer Graphics Forum 30: 297–305. Available: http://dx.doi.org/10.1111/j.1467-8659.2011.01861.x.
Publisher:
Wiley-Blackwell
Journal:
Computer Graphics Forum
KAUST Grant Number:
KUS-C1-016-04
Conference/Event name:
32nd Annual Conference on European Association for Computer Graphics, EUROGRAPHICS 2011
Issue Date:
Apr-2011
DOI:
10.1111/j.1467-8659.2011.01861.x
Type:
Conference Paper
ISSN:
0167-7055
Sponsors:
This publication is based on work supported by Award No. KUS-C1-016-04, made by King Abdullah University of Science and Technology (KAUST), DOE VACET, NSF OCI0906379, and NSF CRI-0551724. Pete Shirley wrote code to compute the BVH RTSAH using Monte Carlo sampling. We are extremely grateful for the anonymous reviewer's suggestion to use form factors to solve the BVH RTSAH. The Mad Science scene is by Dan Konieczka and Giorgio Luciano; the Carnival by Dan Konieczka, the Bedroom was modeled by David Vacek and designed by David Tousek; all three scenes are available from the 3dRender. com Lighting Challenges. The Happy Buddha, Bunny, Dragon, and Armadillo are courtesy of the Stanford Computer Graphics Laboratory.
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorIze, Thiagoen
dc.contributor.authorHansen, Charlesen
dc.date.accessioned2016-02-28T05:53:05Zen
dc.date.available2016-02-28T05:53:05Zen
dc.date.issued2011-04en
dc.identifier.citationIze T, Hansen C (2011) RTSAH Traversal Order for Occlusion Rays. Computer Graphics Forum 30: 297–305. Available: http://dx.doi.org/10.1111/j.1467-8659.2011.01861.x.en
dc.identifier.issn0167-7055en
dc.identifier.doi10.1111/j.1467-8659.2011.01861.xen
dc.identifier.urihttp://hdl.handle.net/10754/599543en
dc.description.abstractWe accelerate the finding of occluders in tree based acceleration structures, such as a packetized BVH and a single ray kd-tree, by deriving the ray termination surface area heuristic (RTSAH) cost model for traversing an occlusion ray through a tree and then using the RTSAH to determine which child node a ray should traverse first instead of the traditional choice of traversing the near node before the far node. We further extend RTSAH to handle materials that attenuate light instead of fully occluding it, so that we can avoid superfluous intersections with partially transparent objects. For scenes with high occlusion, we substantially lower the number of traversal steps and intersection tests and achieve up to 2× speedups. © 2010 The Author(s).en
dc.description.sponsorshipThis publication is based on work supported by Award No. KUS-C1-016-04, made by King Abdullah University of Science and Technology (KAUST), DOE VACET, NSF OCI0906379, and NSF CRI-0551724. Pete Shirley wrote code to compute the BVH RTSAH using Monte Carlo sampling. We are extremely grateful for the anonymous reviewer's suggestion to use form factors to solve the BVH RTSAH. The Mad Science scene is by Dan Konieczka and Giorgio Luciano; the Carnival by Dan Konieczka, the Bedroom was modeled by David Vacek and designed by David Tousek; all three scenes are available from the 3dRender. com Lighting Challenges. The Happy Buddha, Bunny, Dragon, and Armadillo are courtesy of the Stanford Computer Graphics Laboratory.en
dc.publisherWiley-Blackwellen
dc.titleRTSAH Traversal Order for Occlusion Raysen
dc.typeConference Paperen
dc.identifier.journalComputer Graphics Forumen
dc.conference.date2011-04-11 to 2011-04-15en
dc.conference.name32nd Annual Conference on European Association for Computer Graphics, EUROGRAPHICS 2011en
dc.conference.locationLlandudno, Wales, GBRen
dc.contributor.institutionUniversity of Utah, Salt Lake City, United Statesen
kaust.grant.numberKUS-C1-016-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.