Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing

dc.contributor.authorGaranzha, Kirillen_US
dc.contributor.authorLoop, Charlesen_US
dc.date.accessioned2015-02-23T16:39:57Z
dc.date.available2015-02-23T16:39:57Z
dc.date.issued2010en_US
dc.description.abstractWe present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages that are mapped efficiently to the massively parallel architecture of modern GPUs. These stages include: ray sorting into coherent packets, creation of frustums for packets, breadth-first frustum traversal through a bounding volume hierarchy for the scene, and localized ray-primitive intersections. We utilize the well known parallel primitives scan and segmented scan in order to process irregular data structures, to remove the need for a stack, and to minimize branch divergence in all stages. Our ray sorting stage is based on applying hash values to individual rays, ray stream compression, sorting and decompression. Our breadth-first BVH traversal is based on parallel frustum-bounding box intersection tests and parallel scan per each BVH level.We demonstrate our algorithm with area light sources to get a soft shadow effect and show that our concept is reasonable for GPU implementation. For the same data sets and ray-primitive intersection routines our pipeline is 3x faster than an optimized standard depth first ray tracing implemented in one kernel.en_US
dc.description.number2en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01598.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages289-298en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01598.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleFast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracingen_US
Files