On the computational complexity of hierarchical radiosity

Authors:
Robert Garmann;Heinrich Müller
Affiliations:
Informatik VII (Computer Graphics), University of Dortmund, D-44221 Dortmund, Germany;Informatik VII (Computer Graphics), University of Dortmund, D-44221 Dortmund, Germany
Venue:
Computer Science in Perspective
Year:
2003

Citing 5
Cited 0

A rapid hierarchical radiosity algorithm

Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Radiosity and realistic image synthesis

Radiosity and realistic image synthesis
Bounds and error estimates for radiosity

SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Wavelet algorithms for illumination computations

Wavelet algorithms for illumination computations
Radiosity and Global Illumination

Radiosity and Global Illumination

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 = Θ (N2) links where N denotes the number of elements generated by the algorithm.