Abstract
A simple way of using importance, also called visual potential, in progressive refinement radiosity and similar radiosity methods is presented. This is accomplished by taking the visual potential of the patches into account when choosing of the “next most contributing” patch. Quite faster convergence is obtained for individual views in which only a relatively small part of a scene is visible. We also show how changes of the viewing parameters can be handled efficiently by computing importance incrementally.
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.
References
Ph. Bekaert and Y. D. Willems. A progressive importance-driven rendering algorithm. In Proceedings of the X. Spring School on Computer Graphics, Bratislava, Slovakia, pages 58 - 67, June 1994.
S. E. Chen. Incremental radiosity: An extension of progressive radiosity to an interactive image synthesis system. Computer Graphics, 24 (4): 135–144, 1990.
M. F. Cohen, S. E.Chen, J. R. Wallace, and D. P. Greenberg. A progressive refinement approach to fast radiosity image generation. Computer Graphics, 22 (4): 75–84, 1988.
G. Greiner, W. Heidrich, and Ph. Slusallek. Bockwiserefinement — a new method for solving the radiosity problem. In Proceedings of the fourth Eurographics Workshop on Rendering, Paris, France, pages 233–245, 1993.
P. Hanrahan, D. Salzman, and L. Aupperle. A rapid hierarchical radiosity algorithm. Computer Graphics, 25 (4): 197–206, 1991.
A. Kok. Grouping of patches in progressive radiosity. In Fourth Eurographics Workshop on Rendering, Paris, France, pages 221–232, June 1993.
S. Pattanaik and S. Mudur. The potential equation and importance in illumination computations. Computer Graphics Forum, 12: 131–136, 1993.
F. Sillion. Clustering and volume scattering for hierarchical radiosity calculations. In Proceedings of the fifth Eurographics Workshop on Rendering, Darmstadt, Germany, pages 105–115, 1994.
F. X. Sillion, J. R. Arvo, S. H. Westin, and D. P. Greenberg. A global illumination solution for general reflectance distributions. Computer Graphics, 25 (4): 187–196, 1991.
B. Smits, J. Arvo, and D. Greenberg. A clustering algorithm for radiosity in complex environments. In Computer Graphics (SIGGRAPH ’94 Proceedings), pages 435–443, July 1994.
B. E. Smits, J. R. Arvo, and D. H. Salesin. An importance-driven radiosity algorithm. Computer Graphics, 26 (2): 273–282, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag/Wien
About this paper
Cite this paper
Bekaert, P., Willems, Y.D. (1995). Importance-Driven Progressive Refinement Radiosity. In: Hanrahan, P.M., Purgathofer, W. (eds) Rendering Techniques ’95. EGSR 1995. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9430-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-7091-9430-0_30
Published:
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82733-8
Online ISBN: 978-3-7091-9430-0
eBook Packages: Springer Book Archive