Ray tracing acceleration structure : GPU based KD-tree using SAH heuristic

Ray tracing is a very widely used rendering technique in many applications in the movie industry, architecture and media industry. The reason why ray tracing is so popular is because it can produce the most realistic and most accurate images compared to other rendering techniques due to...

Full description

Saved in:
Bibliographic Details
Main Author: Nguyen Khac Trung, Nguyen.
Other Authors: Seah Hock Soon
Format: Final Year Project
Language:English
Published: 2013
Subjects:
Online Access:http://hdl.handle.net/10356/52063
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-52063
record_format dspace
spelling sg-ntu-dr.10356-520632023-03-03T20:36:09Z Ray tracing acceleration structure : GPU based KD-tree using SAH heuristic Nguyen Khac Trung, Nguyen. Seah Hock Soon School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Computing methodologies::Computer graphics Ray tracing is a very widely used rendering technique in many applications in the movie industry, architecture and media industry. The reason why ray tracing is so popular is because it can produce the most realistic and most accurate images compared to other rendering techniques due to its straight forward nature of emulating light. However computational costs prevent it from being widely used in interactive applications. Much research has been done to help accelerate the ray tracing process and one of the most popular data structures being used is the KD-Tree. However KD-Tree construction is also a computationally expensive task thus holding it back from being used in interactive applications in which the scenes contain animations and require the tree to be rebuilt in every frame. With the advance of multi-purpose graphics hardware with its massive parallelism it is now possible to accelerate the ray tracing process further to improve the performance greatly from traditional CPU based approaches. The GPU construction stage also benefits greatly from the computing power of modern graphics hardware and thus it is now possible to construct KD-Tree in real time. In this final year project we try to implement such an approach by making a n early full GPU based ray tracer using KD-Tree as the acceleration structure. The whole KD-Tree construction algorithm is also implemented to try to take advantage of the GPU as much as possible using the CUDA framework running on NVIDIA graphics cards. Due to time constraints our GPU ray tracer is quite simple and does not support animation, however the code is functional and reasonably stable. Further optimizations can be made to improve the performance and more features can be implemented in future projects. Bachelor of Engineering (Computer Science) 2013-04-22T03:41:28Z 2013-04-22T03:41:28Z 2013 2013 Final Year Project (FYP) http://hdl.handle.net/10356/52063 en Nanyang Technological University 42 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Computing methodologies::Computer graphics
spellingShingle DRNTU::Engineering::Computer science and engineering::Computing methodologies::Computer graphics
Nguyen Khac Trung, Nguyen.
Ray tracing acceleration structure : GPU based KD-tree using SAH heuristic
description Ray tracing is a very widely used rendering technique in many applications in the movie industry, architecture and media industry. The reason why ray tracing is so popular is because it can produce the most realistic and most accurate images compared to other rendering techniques due to its straight forward nature of emulating light. However computational costs prevent it from being widely used in interactive applications. Much research has been done to help accelerate the ray tracing process and one of the most popular data structures being used is the KD-Tree. However KD-Tree construction is also a computationally expensive task thus holding it back from being used in interactive applications in which the scenes contain animations and require the tree to be rebuilt in every frame. With the advance of multi-purpose graphics hardware with its massive parallelism it is now possible to accelerate the ray tracing process further to improve the performance greatly from traditional CPU based approaches. The GPU construction stage also benefits greatly from the computing power of modern graphics hardware and thus it is now possible to construct KD-Tree in real time. In this final year project we try to implement such an approach by making a n early full GPU based ray tracer using KD-Tree as the acceleration structure. The whole KD-Tree construction algorithm is also implemented to try to take advantage of the GPU as much as possible using the CUDA framework running on NVIDIA graphics cards. Due to time constraints our GPU ray tracer is quite simple and does not support animation, however the code is functional and reasonably stable. Further optimizations can be made to improve the performance and more features can be implemented in future projects.
author2 Seah Hock Soon
author_facet Seah Hock Soon
Nguyen Khac Trung, Nguyen.
format Final Year Project
author Nguyen Khac Trung, Nguyen.
author_sort Nguyen Khac Trung, Nguyen.
title Ray tracing acceleration structure : GPU based KD-tree using SAH heuristic
title_short Ray tracing acceleration structure : GPU based KD-tree using SAH heuristic
title_full Ray tracing acceleration structure : GPU based KD-tree using SAH heuristic
title_fullStr Ray tracing acceleration structure : GPU based KD-tree using SAH heuristic
title_full_unstemmed Ray tracing acceleration structure : GPU based KD-tree using SAH heuristic
title_sort ray tracing acceleration structure : gpu based kd-tree using sah heuristic
publishDate 2013
url http://hdl.handle.net/10356/52063
_version_ 1759856193443987456