Skip to Main content Skip to Navigation
Conference papers

An Efficient Progressive Refinement Strategy for Hierarchical Radiosity

Nicolas Holzschuch 1, * François X. Sillion 1 George Drettakis 1 
* Corresponding author
1 iMAGIS - Models, Algorithms and Geometry for Computer Generated Image Graphics
GRAVIR - IMAG - Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble, Inria Grenoble - Rhône-Alpes
Abstract : A detailed study of the performance of hierarchical radiosity is presented, which confirms that visibility computation is the most expensive operation. Based on the analysis of the algorithm's behavior, two improvements are suggested. Lazy evaluation of the top-level links suppresses most of the initial linking cost, and is consistent with a progressive refinement strategy. In addition, the reduction of the number of links for mutually visible areas is made possible by the use of an improved subdivision criterion. Results show that initial linking can be avoided and the number of links significantly reduced without noticeable image degradation, making useful images more quickly.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Nicolas Holzschuch Connect in order to contact the contributor
Submitted on : Tuesday, April 28, 2009 - 3:19:07 PM
Last modification on : Tuesday, May 3, 2022 - 4:52:02 PM
Long-term archiving on: : Thursday, June 10, 2010 - 10:09:02 PM


Files produced by the author(s)


  • HAL Id : inria-00379411, version 1



Nicolas Holzschuch, François X. Sillion, George Drettakis. An Efficient Progressive Refinement Strategy for Hierarchical Radiosity. Photorealistic Rendering Techniques (Eurographics Workshop on Rendering), Jun 1994, Darmstadt, Germany. pp.357-372. ⟨inria-00379411⟩



Record views


Files downloads