Progressive Visibility Caching for Fast Indirect Illumination
| dc.contributor.author | Ulbrich, Justus | en_US |
| dc.contributor.author | Novák, Jan | en_US |
| dc.contributor.author | Rehfeld, Hauke | en_US |
| dc.contributor.author | Dachsbacher, Carsten | en_US |
| dc.contributor.editor | Michael Bronstein and Jean Favre and Kai Hormann | en_US |
| dc.date.accessioned | 2014-02-01T16:26:15Z | |
| dc.date.available | 2014-02-01T16:26:15Z | |
| dc.date.issued | 2013 | en_US |
| dc.description.abstract | Rendering realistic images requires exploring the vast space of all possible paths that light can take between emitters and receivers. Thanks to the advances in rendering we can tackle this problem using different algorithms; but in general, we will likely be evaluating many expensive visibility queries. In this paper, we leverage the observation that certain kinds of visibility calculations do not need to be resolved exactly and results can be shared efficiently among similar queries. We present a visibility caching algorithm that significantly accelerates computation of diffuse and glossy inter-reflections. By estimating the visibility correlation between surface points, the cache automatically adapts to the scene geometry, placing more cache records in areas with rapidly changing visibility. We demonstrate that our approach is most suitable for progressive algorithms delivering approximate but fast previews as well as high quality converged results. | en_US |
| dc.description.seriesinformation | Vision, Modeling & Visualization | en_US |
| dc.identifier.isbn | 978-3-905674-51-4 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/PE.VMV.VMV13.203-210 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | I.3.7 [Computer Graphics] | en_US |
| dc.subject | Three Dimensional Graphics and Realism | en_US |
| dc.subject | Raytracing | en_US |
| dc.title | Progressive Visibility Caching for Fast Indirect Illumination | en_US |