Pat Hanrahan
ABSTRACT
This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing large polygonal patches. The algorithm constructs a hierarchical representation of the form factor matrix by adaptively subdividing patches into subpatches according to a user-supplied error bound. The algorithm guarantees that all form factors are calculated to the same precision, removing many common image artifacts due to inaccurate form factors. More importantly, the algorithm decomposes the form factor matrix into at most O(n) blocks (where n is the number of elements). Previous radiosity algorithms represented the element-to-element transport interactions with n2 form factors. Visibility algorithms are given that work well with this approach. Standard techniques for shooting and gathering can be used with the hierarchical representation to solve for equilibrium radiosities, but we also discuss using a brightness-weighted error criteria, in conjunction with multigridding, to even more rapidly progressively refine the image.
- Appel, A.A. (1985) An efficient program for many-body simulation. SIAM J. Sci. Star. Computing 6(1), 85-103.Google Scholar
Cross Ref
- Barnes, J., Hut, P. (1986) A hierarchical O(NlogN) forcecalculation algorithm. Nature 324, 446-449.Google ScholarCross Ref
- Baum, D.R., Rushmeier, H.E., Winget, J.M.(1989) Improving radiosity solutions through the useof analytically determined form factors. Computer Graphics 23(3), 325-334. Google ScholarDigital Library
- Bergman, L., Fuchs, If., Grant, E., Spach, S. (1986) Image rendering by adaptive refinement. Computer Graphics 20(4), 29-38. Google ScholarDigital Library
- Blinn, J. (1990) Triage Tables. IEEE Computer Graphics and Applications, 10(1) 70-75. Google ScholarDigital Library
- Campbell, A.T., Fussel, D.S. (1990) Adaptive mesh generation for global diffuse illumination. Computer Graphics 24(4), 155-164. Google ScholarDigital Library
- Cohen, M.F., Greenberg, D.P. (1985) The hemi-cube: A radiosity approach for complex environments. Computer Graphics 19(3), 31-40. Google ScholarDigital Library
- Cohen, M.F., Greenberg, D.P., Immel, D.S., Brock, P.J. (1986) An efficient radiosity approach for realistic image synthesis. IEEE Computer Graphics and Applications 6(2), 26- 30.Google ScholarDigital Library
- Cohen, M.F., Chen, S.E., Wallace, J.R., Greenberg, D.P. (1988) A progressive refinement approach to fast radiosity image generation. Computer Graphics 22(4), 75-84. Google ScholarDigital Library
- Cook, R.L. (1986) Stochastic sampling in computer graphics. ACM Transactions on Graphics 5(1), 51-72. Google ScholarDigital Library
- Esselink, E. (1989) About the order of Appel's algorithm. Computing Science Note KES-1, Department of Computer Science, University of Groningen.Google Scholar
- Greengard, L. (1988) The rapid evaluation of potential fields in particle systems. MIT Press, Cambridge, MA.Google Scholar
- Hanrahan, P., Salzman, D.B. (1990) A rapid hierarchical radiosity algorithm for unoccluded environments. Published in K. Bouatouch, Photosimulation, Realism and Physics in Computer Graphics. Springer-Verlag (1991), Reprinted as Princeton University CS-TR-281-90.Google Scholar
- Heckbert, P.S. (1990) Adaptive radiosity textures for bidirectional ray tracing. Computer Graphics 24(4), 145-154. Google ScholarDigital Library
- Medley, T.J.V. (1988) A shading method for computer generated images. Master's Thesis, The University of UtahGoogle Scholar
- Siegel, R., Howell, J.R. (1981) Thermal radiation heat trans. yet. Hemisphere Publishing Co., Washington, DCGoogle Scholar
- Sillion, F., Puech, C. (1989) A general two-pass method for integrating specular and diffuse reflection. Computer Graphics 23(3), 335-344. Google ScholarDigital Library
- Thibault, W., Naylor, B. (198"/') Set operations on polyhedra using binary space partitioning trees. Computer Graphics 21(4), 153-162. Google ScholarDigital Library
- Wallace, J.R., Elmquist, K.A., Haines, E.A. (_1989) A ray tracing algorithm for progressive radiosity. Computer Graphics 23(3), 315-324. Google ScholarDigital Library
- Ward, G.J., Rubinstein, F.M., Cleat, R.D. (1988) A ray txacing solution for ditfuse environments. Computer Graphics 22(3), 85-92. Google ScholarDigital Library
- Warnock, J. (1969) A hidden-surface algorithm for computer-generated half-tone pictures. Technical Report TR 4-15, NTIS AD-?53 671, Computer Science Department, University of Utah.Google Scholar
Index Terms
- A rapid hierarchical radiosity algorithm
Recommendations
A progressive refinement approach to fast radiosity image generation
SIGGRAPH '88: Proceedings of the 15th annual conference on Computer graphics and interactive techniquesA reformulated radiosity algorithm is presented that produces initial images in time linear to the number of patches. The enormous memory costs of the radiosity algorithm are also eliminated by computing form-factors on-the-fly. The technique is based ...
A rapid hierarchical radiosity algorithm
This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing large polygonal patches. The algorithm constructs a hierarchical representation of the form factor matrix by adaptively subdividing patches into subpatches ...
Image-based rendering of diffuse, specular and glossy surfaces from a single image
SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniquesIn this paper, we present a new method to recover an approximation of the bidirectional reflectance distribution function (BRDF) of the surfaces present in a real scene. This is done from a single photograph and a 3D geometric model of the scene. The ...
Comments