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 available more quickly.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cohen, M. F., Chen, S. E., Wallace, J. R., Greenberg, D. P.: A Progressive Refinement Approach to Fast Radiosity Image Generation. SIGGRAPH (1988) 75–84
Drettakis, G., Fiume, E.: Accurate and Consistent Reconstruction of Illumination Functions Using Structured Sampling. Computer Graphics Forum (Eurographics 1993 Conf. Issue) 273–284
Goral, C. M., Torrance, K. E., Greenberg, D. P., Bataille, B.: Modeling the Interaction of Light Between Diffuse Surfaces. SIGGRAPH (1984) 213–222
Hanrahan, P. M., Salzman, D.: A Rapid Hierarchical Radiosity Algorithm for Unoccluded Environments. Eurographics Workshop on Photo simulation, Realism and Physics in Computer Graphics, June 1990.
Hanrahan, P. M., Salzman, D., Auperle, L.: A Rapid Hierarchical Radiosity Algorithm. SIGGRAPH (1991) 197–206
Lischinski, D., Tampieri, F., Greenberg, D. P.: Combining Hierarchical Radiosity and Discontinuity Meshing. SIGGRAPH (1993)
Sillion, F.: Clustering and Volume Scattering for Hierarchical Radiosity calculations. Fifth Eurographics Workshop on Rendering, Darmstadt, June 1994 (in these proceedings).
Smits, B. E., Arvo, J. R., Salesin, D. H.: An Importance-Driven Radiosity Algorithm. SIGGRAPH (1992) 273–282
Teller, S. J., Hanrahan, P. M.: Global Visibility Algorithm for Illumination Com-putations. SIGGRAPH (1993) 239–246
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 EUROGRAPHICS The European Association for Computer Graphics
About this paper
Cite this paper
Holzschuch, N., Sillion, F., Drettakis, G. (1995). An Efficient Progressive Refinement Strategy for Hierarchical Radiosity. In: Sakas, G., Müller, S., Shirley, P. (eds) Photorealistic Rendering Techniques. Focus on Computer Graphics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87825-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-87825-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-87827-5
Online ISBN: 978-3-642-87825-1
eBook Packages: Springer Book Archive