Title: Ray Tracing on a GPU with CUDA – Comparative Study of Three Algorithms
Authors: Zlatuška, Martin
Havran, Vlastimil
Citation: WSCG 2010: Communication Papers Proceedings: 18th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision in co-operation with EUROGRAPHICS, p. 69-76.
Issue Date: 2010
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/WSCG2010/Papers_2010/!_2010_Short-proceedings.pdf
ISBN: 978-80-86943-87-9
Keywords: programování grafických procesorů;CUDA;algoritmy sledování paprsků;uniformní mřížky;kd strom
Keywords in different language: GPU programming;CUDA;ray tracing algorithms;uniform grids;kd tree
Abstract: We present a comparative study of ray tracing algorithms implemented on a GPU for three published papers using different spatial data structures evaluated for performance on nine static scenes in walk-through animation. We compare the performance for uniform grids, bounding volume hierarchies (BVHs), and kd-trees evaluated on a GPU for ray casting and Whitted-style ray tracing. We show that performance of ray tracing with BVHs exceeds the performance of ray tracing with kd-trees for coherent rays. Contrary, the ray tracing with kd-trees is faster than that with BVHs for incoherent rays. The performance of ray tracing with uniform grids is slower than both ray tracing with BVHs and kd-trees except for uniformly populated scenes. We show that the performance is highly sensitive to details of implementation on kd-trees.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG 2010: Communication Papers Proceedings

Files in This Item:
File Description SizeFormat 
Zlatuska.pdfPlný text479,79 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11043

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.