ACM Home Page
Please provide us with feedback. Feedback
A rapid hierarchical radiosity algorithm
Full text PdfPdf (6.84 MB)
Source International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 18th annual conference on Computer graphics and interactive techniques table of contents
Pages: 197 - 206  
Year of Publication: 1991
ISBN:0-89791-436-8
Also published in ...
Authors
Pat Hanrahan  Department of Computer Science, Princeton University, Princeton, NJ
David Salzman  68 Francis Avenue, Cambridge, MA
Larry Aupperle  Department of Computer Science, Princeton University, Princeton, NJ
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 113,   Citation Count: 106
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/122718.122740
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Appel, A.A. (1985) An efficient program for many-body simulation. SIAM J. Sci. Star. Computing 6(1), 85-103.
 
2
Barnes, J., Hut, P. (1986) A hierarchical O(NlogN) forcecalculation algorithm. Nature 324, 446-449.
3
4
 
5
6
7
 
8
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.
9
10
 
11
Esselink, E. (1989) About the order of Appel's algorithm. Computing Science Note KES-1, Department of Computer Science, University of Groningen.
 
12
Greengard, L. (1988) The rapid evaluation of potential fields in particle systems. MIT Press, Cambridge, MA.
 
13
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.
14
 
15
Medley, T.J.V. (1988) A shading method for computer generated images. Master's Thesis, The University of Utah
 
16
Siegel, R., Howell, J.R. (1981) Thermal radiation heat trans. yet. Hemisphere Publishing Co., Washington, DC
17
18
19
20
 
21
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.

CITED BY  106

Collaborative Colleagues:
Pat Hanrahan: colleagues
David Salzman: colleagues
Larry Aupperle: colleagues