Sciweavers

EGH
2003
Springer

GPU algorithms for radiosity and subsurface scattering

13 years 9 months ago
GPU algorithms for radiosity and subsurface scattering
We capitalize on recent advances in modern programmable graphics hardware, originally designed to support advanced local illumination models for shading, to instead perform two different kinds of global illumination models for light transport. We first use the new floating-point texture map formats to find matrix radiosity solutions for light transport in a diffuse environment, and use this example to investigate the differences between GPU and CPU performance on matrix operations. We then examine multiple-scattering subsurface light transport, which can be modeled to resemble a single radiosity gathering step. We use a multiresolution meshed atlas to organize a hierarchy of precomputed subsurface links, and devise a three-pass GPU algorithm to render in real time the subsurface-scattered illumination of an object, with dynamic lighting and viewing. Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Subsurface Scattering
Nathan A. Carr, Jesse D. Hall, John C. Hart
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where EGH
Authors Nathan A. Carr, Jesse D. Hall, John C. Hart
Comments (0)