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 |