An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity

Computer Graphics Forum Computer Graphics Forum Volume 17 Issue 4, Pages 197 - 218 Published Online: 25 Dec 2001 Journal compilation © 2010 The Eurographics Association and Blackwell Publishing * Get Sample Copy * Recommend to Your Librarian * Save journal to My Profile * Set E-Mail Alert * Email this page * Print this page * RSS web feed (What is RSS?) < Previous Abstract | Next Abstract > Save Article to My Profile Download Citation Request Permissions Abstract | Full Text: PDF (Size: 832K) | Related Articles | Citation Tracking An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity Nicolas Holzschuch & François Sillion 1 iMAGIS, GRAVIR/IMAG - INRIA KEYWORDS hierarchical radiosity • error-control • refinement criterion • radiosity derivatives • global illumination 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 andd 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. DIGITAL OBJECT IDENTIFIER (DOI) 10.1111/1467-8659.00285 About DOI Related Articles * Find other articles like this in Wiley InterScience * Find articles in Wiley InterScience written by any of the authors Request ReprintReprint Request Wiley InterScience is a member of CrossRef. Cross Ref Member