RTSAH Traversal Order for Occlusion Rays

Thiago Ize, Charles Hansen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations


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).
Original languageEnglish (US)
Title of host publicationComputer Graphics Forum
Number of pages9
StatePublished - Apr 28 2011
Externally publishedYes


Dive into the research topics of 'RTSAH Traversal Order for Occlusion Rays'. Together they form a unique fingerprint.

Cite this