Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

BIRTHDAY
2003
Springer

favoriteEmaildiscussreport

125views Applied Computing» more BIRTHDAY 2003»

On the Computational Complexity of Hierarchical Radiosity

13 years 9 months ago

On the Computational Complexity of Hierarchical Radiosity

Download www.garmann.com

The hierarchical radiosity algorithm is an eﬃcient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization and the reﬁnement of links between the scene’s patches based upon a user-speciﬁed 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.

Robert Garmann, Heinrich Müller

Real-time Traffic

Applied Computing | BIRTHDAY 2003 | Hanrahan Et | Hierarchical Radiosity Algorithm | User-speciﬁed Error Parameter |

claim paper

Related Content

» Memory Management Schemes for Radiosity Computation in Complex Environments

» Automatic Calculation of Soft Shadow Textures for Fast HighQuality Radiosity

» Getting Rid of Links in Hierarchical Radiosity

» Textures and radiosity controlling emission and reflection with texture maps

» A clustering algorithm for radiosity in complex environments

» Face Cluster Radiosity

» A novel approach makes higher order wavelets really efficient for radiosity

» Linear Radiosity with Error Estimation

» Wavelet Radiosity on Arbitrary Planar Surfaces

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	BIRTHDAY
Authors	Robert Garmann, Heinrich Müller

Comments (0)