Acceleration techniques for progressive refinement radiosity
- 1 February 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGGRAPH Computer Graphics
- Vol. 24 (2) , 59-66
- https://doi.org/10.1145/91394.91419
Abstract
The progressive refinement radiosity method provides a means for computing the global illumination of an environment in time proportional to the size of the environment. Additionally, the method supplies a sequence of solutions that monotonically converge to a high-quality result, allowing it to be used for interactive applications that deliver "near real-time" updates as the computation proceeds. This paper presents two methods for accelerating the radiosity method. First, the traditional hemi-cube algorithm is modified to accelerate the expensive form-factor calculation. Second, the radiosity method is parallelized across a coarse-grain network, and the efficiency of the parallel system is discussed.Keywords
This publication has 9 references indexed in Scilit:
- Acceleration techniques for progressive refinement radiosityACM SIGGRAPH Computer Graphics, 1990
- A general two-pass method integrating specular and diffuse reflectionACM SIGGRAPH Computer Graphics, 1989
- Improving radiosity solutions through the use of analytically determined form-factorsACM SIGGRAPH Computer Graphics, 1989
- A progressive refinement approach to fast radiosity image generationPublished by Association for Computing Machinery (ACM) ,1988
- Image rendering by adaptive refinementACM SIGGRAPH Computer Graphics, 1986
- An Efficient Radiosity Approach for Realistic Image SynthesisIEEE Computer Graphics and Applications, 1986
- The hemi-cubePublished by Association for Computing Machinery (ACM) ,1985
- Modeling the interaction of light between diffuse surfacesPublished by Association for Computing Machinery (ACM) ,1984
- Improved Computational Methods for Ray TracingACM Transactions on Graphics, 1984