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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Garmann, R., & Müller, H. (2003). On the computational complexity of hierarchical radiosity. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2598, 167–178. https://doi.org/10.1007/3-540-36477-3_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
