An exhaustive error-bounding algorithm for hierarchical radiosity

Nicolas Holzschuch 1 François X. Sillion 2
1 ISA - Models, algorithms and geometry for computer graphics and vision
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 iMAGIS - Models, Algorithms and Geometry for Computer Generated Image Graphics
GRAVIR - IMAG - Graphisme, Vision et Robotique, Inria Grenoble - Rhône-Alpes
Abstract : This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial applications and one of the most challenging issues remaining in global illumination research. In order to control the error, we need to estimate the accuracy of the calculation while computing the energy exchanged between two objects. Having this information for each radiosity interaction allows to allocate more resources to refine interactions with greater potential error, and to avoid spending more time to refine interactions already represented with sufficient accuracy. Until now, the accuracy of the computed energy exchange could only be approximated using heuristic algorithms. This paper presents the first exhaustive algorithm to compute fully reliable upper and lower bounds on the energy being exchanged in each interaction. This is accomplished by computing first and second derivatives of the radiosity function where appropriate, and making use of two concavity conjectures. These bounds are then used in a refinement criterion for hierarchical radiosity, resulting in a global illumination algorithm with complete control of the error incurred. Results are presented, demonstrating the possibility to create radiosity solutions with guaranteed precision. We then extend our algorithm to consider linear bounding functions instead of constant functions, thus creating simpler meshes in regions where the function is concave, without loss of precision. Our experiments show that the computation of radiosity derivatives along with the radiosity values only requires a modest extra cost, with the advantage of a much greater precision.
Type de document :
Article dans une revue
Computer Graphics Forum, Wiley, 1998, 17 (4), pp.197-218. 〈http://www.eg.org/EG/CGF/volume17/issue4/285.pdf〉. 〈10.1111/1467-8659.00285〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00098630
Contributeur : <>
Soumis le : mercredi 2 décembre 2009 - 13:46:39
Dernière modification le : mardi 25 octobre 2016 - 17:02:11
Document(s) archivé(s) le : vendredi 13 mai 2011 - 21:07:35

Fichier

HS98.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Collections

Citation

Nicolas Holzschuch, François X. Sillion. An exhaustive error-bounding algorithm for hierarchical radiosity. Computer Graphics Forum, Wiley, 1998, 17 (4), pp.197-218. 〈http://www.eg.org/EG/CGF/volume17/issue4/285.pdf〉. 〈10.1111/1467-8659.00285〉. 〈inria-00098630〉

Partager

Métriques

Consultations de la notice

465

Téléchargements de fichiers

240