An Efficient Progressive Refinement Strategy for Hierarchical Radiosity - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 1994

An Efficient Progressive Refinement Strategy for Hierarchical Radiosity

Résumé

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.
Fichier principal
Vignette du fichier
egwr94.pdf (468.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00379411 , version 1 (28-04-2009)

Identifiants

  • HAL Id : inria-00379411 , version 1

Citer

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⟩
189 Consultations
241 Téléchargements

Partager

Gmail Facebook X LinkedIn More