On the Computational Complexity of Hierarchical Radiosity
- 443 Downloads
The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization and the refinement of links between the scene’s patches based upon a user-specified error parameter ε . They state that the number of links is linear in the number of elements if ε is assumed to be a constant. We present a result based upon the assumption that the geometry is constant and ε approaches 0 in a multigridding-procedure. Then the algorithm generates L=θ(N 2) links where N denotes the number of elements generated by the algorithm.
KeywordsGlobal Illumination Complete Binary Tree Parent Link Initial Patch Simple Scene
Unable to display preview. Download preview PDF.
- 3.P. Hanrahan, D. Salzman, and L. Aupperle. “A rapid hierarchical radiosity algorithm.” Computer Graphics, vol. 25, pp. 197–206, July 1991.Google Scholar
- 4.D. Lischinski, B. Smits, and D. P. Greenberg. “Bounds and error estimates for radiosity.” In Proceedings of SIGGRAPH 94, pp. 67–74, 1994.Google Scholar
- 5.P. Schröder. Wavelet Algorithms for Illumination Computations. PhD thesis, Princeton University, November 1994.Google Scholar
- 6.F. X. Sillion and C. Puech. Radiosity &Global Illumination. Morgan Kaufman, San Francisco, 1994.Google Scholar