Sparsely Precomputing The Light Transport Matrix for Real-Time Rendering

Simple item page
dc.contributor.authorHuang, Fu-Chungen_US
dc.contributor.authorRamamoorthi, Ravien_US
dc.date.accessioned2015-02-23T16:57:40Z
dc.date.available2015-02-23T16:57:40Z
dc.date.issued2010en_US
dc.description.abstractPrecomputation-based methods have enabled real-time rendering with natural illumination, all-frequency shadows, and global illumination. However, a major bottleneck is the precomputation time, that can take hours to days. While the final real-time data structures are typically heavily compressed with clustered principal component analysis and/or wavelets, a full light transport matrix still needs to be precomputed for a synthetic scene, often by exhaustive sampling and raytracing. This is expensive and makes rapid prototyping of new scenes prohibitive. In this paper, we show that the precomputation can be made much more efficient by adaptive and sparse sampling of light transport. We first select a small subset of dense vertices , where we sample the angular dimensions more completely (but still adaptively). The remaining sparse vertices require only a few angular samples, isolating features of the light transport. They can then be interpolated from nearby dense vertices using locally low rank approximations. We demonstrate sparse sampling and precomputation 5 x faster than previous methods.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2010.01729.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages1335-1345en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2010.01729.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleSparsely Precomputing The Light Transport Matrix for Real-Time Renderingen_US
Files
Collections
29-Issue 4
EGSR10: 21th Eurographics Symposium on Rendering