A framework for the analysis of error in global illumination algorithms
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
The irradiance Jacobian for partially occluded polyhedral sources
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Rendering with radiance: the art and science of lighting visualization
Rendering with radiance: the art and science of lighting visualization
A low distortion map between disk and square
Journal of Graphics Tools
A ray tracing solution for diffuse interreflection
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
An approximate global illumination system for computer generated films
ACM SIGGRAPH 2004 Papers
Radiance Caching for Efficient Global Illumination Computation
IEEE Transactions on Visualization and Computer Graphics
Improved radiance gradient computation
Proceedings of the 21st spring conference on Computer graphics
A first-order analysis of lighting, shading, and shadows
ACM Transactions on Graphics (TOG)
Physically Based Rendering, Second Edition: From Theory To Implementation
Physically Based Rendering, Second Edition: From Theory To Implementation
Practical Global Illumination with Irradiance Caching
Practical Global Illumination with Irradiance Caching
Theory, analysis and applications of 2D global illumination
ACM Transactions on Graphics (TOG)
Making radiance and irradiance caching practical: adaptive caching and neighbor clamping
EGSR'06 Proceedings of the 17th Eurographics conference on Rendering Techniques
Hi-index | 0.00 |
This paper introduces a new error metric for irradiance caching that significantly outperforms the classic Split-Sphere heuristic. Our new error metric builds on recent work using second order gradients (Hessians) as a principled error bound for the irradiance. We add occlusion information to the Hessian computation, which greatly improves the accuracy of the Hessian in complex scenes, and this makes it possible for the first time to use a radiometric error metric for irradiance caching. We enhance the metric making it based on the relative error in the irradiance as well as robust in the presence of black occluders. The resulting error metric is efficient to compute, numerically robust, supports elliptical error bounds and arbitrary hemispherical sample distributions, and unlike the Split-Sphere heuristic it is not necessary to arbitrarily clamp the computed error thresholds. Our results demonstrate that the new error metric outperforms existing error metrics based on the Split-Sphere model and occlusion-unaware Hessians.