Graph-based Global Illumination
The slow render times of global illumination algorithms make them impractical in most commercial and academic settings. We propose a novel framework for calculating the computational complexity of global illumination algorithms and show that no other recent improvements have reduced this complexity....
Main Author: | |
---|---|
Format: | Others |
Published: |
BYU ScholarsArchive
2010
|
Subjects: | |
Online Access: | https://scholarsarchive.byu.edu/etd/2423 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3422&context=etd |
id |
ndltd-BGMYU2-oai-scholarsarchive.byu.edu-etd-3422 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-BGMYU2-oai-scholarsarchive.byu.edu-etd-34222021-08-21T05:01:27Z Graph-based Global Illumination Ricks, Brian C. The slow render times of global illumination algorithms make them impractical in most commercial and academic settings. We propose a novel framework for calculating the computational complexity of global illumination algorithms and show that no other recent improvements have reduced this complexity. We further show that many algorithms use a tree as their rendering paradigm. We propose a new rendering algorithm, pipe casting, which calculates light paths using a graph instead of a tree. Pipe casting significantly reduces both computational complexity and actual render time of rendering. Using an L2 pixel-wise error comparison, on average our algorithm can render a variety of scenes at the same error as traditional algorithms but in about 50% of the time. 2010-01-28T08:00:00Z text application/pdf https://scholarsarchive.byu.edu/etd/2423 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3422&context=etd http://lib.byu.edu/about/copyright/ Theses and Dissertations BYU ScholarsArchive global illumination computational complexity Computer Sciences |
collection |
NDLTD |
format |
Others
|
sources |
NDLTD |
topic |
global illumination computational complexity Computer Sciences |
spellingShingle |
global illumination computational complexity Computer Sciences Ricks, Brian C. Graph-based Global Illumination |
description |
The slow render times of global illumination algorithms make them impractical in most commercial and academic settings. We propose a novel framework for calculating the computational complexity of global illumination algorithms and show that no other recent improvements have reduced this complexity. We further show that many algorithms use a tree as their rendering paradigm. We propose a new rendering algorithm, pipe casting, which calculates light paths using a graph instead of a tree. Pipe casting significantly reduces both computational complexity and actual render time of rendering. Using an L2 pixel-wise error comparison, on average our algorithm can render a variety of scenes at the same error as traditional algorithms but in about 50% of the time. |
author |
Ricks, Brian C. |
author_facet |
Ricks, Brian C. |
author_sort |
Ricks, Brian C. |
title |
Graph-based Global Illumination |
title_short |
Graph-based Global Illumination |
title_full |
Graph-based Global Illumination |
title_fullStr |
Graph-based Global Illumination |
title_full_unstemmed |
Graph-based Global Illumination |
title_sort |
graph-based global illumination |
publisher |
BYU ScholarsArchive |
publishDate |
2010 |
url |
https://scholarsarchive.byu.edu/etd/2423 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3422&context=etd |
work_keys_str_mv |
AT ricksbrianc graphbasedglobalillumination |
_version_ |
1719460864813170688 |