Data structures and network algorithms
Data structures and network algorithms
Computational methods for integral equations
Computational methods for integral equations
A rapid hierarchical radiosity algorithm
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
An importance-driven radiosity algorithm
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Modeling global diffuse illumination for image synthesis
Modeling global diffuse illumination for image synthesis
Radiosity and realistic image synthesis
Radiosity and realistic image synthesis
Combining hierarchical radiosity and discontinuity meshing
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Radiosity algorithms using higher order finite element methods
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Galerkin radiosity: a higher order solution method for global illumination
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
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
The irradiance Jacobian for partially occluded polyhedral sources
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Monte Carlo approximation of form factors with error bounded a priori
Proceedings of the eleventh annual symposium on Computational geometry
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Sampling procedural shaders using affine arithmetic
ACM Transactions on Graphics (TOG)
ArtDefo: accurate real time deformable objects
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Fast and accurate hierarchical radiosity using global visibility
ACM Transactions on Graphics (TOG)
Radiance interpolants for accelerated bounded-error ray tracing
ACM Transactions on Graphics (TOG)
ACM Transactions on Graphics (TOG)
Texture-based visibility for efficient lighting simulation
ACM Transactions on Graphics (TOG)
Comparative evaluation of visualization and experimental results using image comparison metrics
Proceedings of the conference on Visualization '02
Journal of Computer Science and Technology
A Unified Hierarchical Algorithm for Global Illumination with Scattering Volumes and Object Clusters
IEEE Transactions on Visualization and Computer Graphics
Structured Penumbral Irradiance Computation
IEEE Transactions on Visualization and Computer Graphics
On the computational complexity of hierarchical radiosity
Computer Science in Perspective
Information-theory-based oracles for hierarchical radiosity
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Adaptive sampling for environment mapping
Proceedings of the 26th Spring Conference on Computer Graphics
EGWR'99 Proceedings of the 10th Eurographics conference on Rendering
| Hi-index | 0.00 |
We present a method for determining a posteriori bounds and estimates for local and total errors in radiosity solutions. The ability to obtain bounds and estimates for the total error is crucial fro reliably judging the acceptability of a solution. Realistic estimates of the local error improve the efficiency of adaptive radiosity algorithms, such as hierarchical radiosity, by indicating where adaptive refinement is necessary.First, we describe a hierarchical radiosity algorithm that computes conservative lower and upper bounds on the exact radiosity function, as well as on the approximate solution. These bounds account for the propagation of errors due to interreflections, and provide a conservative upper bound on the error. We also describe a non-conservative version of the same algorithm that is capable of computing tighter bounds, from which more realistic error estimates can be obtained. Finally, we derive an expression for the effect of a particular interaction on the total error. This yields a new error-driven refinement strategy for hierarchical radiosity, which is shown to be superior to brightness-weighted refinement.