English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

A Case Study Towards Validation of Global Illumination Algorithms: Progressive Hierarchical Radiosity with Clustering

MPS-Authors
/persons/resource/persons45095

Myszkowski,  Karol
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Myszkowski, K., & Kunii, T. L. (2000). A Case Study Towards Validation of Global Illumination Algorithms: Progressive Hierarchical Radiosity with Clustering. The Visual Computer, 16(5), 271-288. Retrieved from http://link.springer.de/link/service/journals/00371/bibs/0016005/00160271.htm.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3480-1
Abstract
The paper consists of two main parts: presentation of an efficient global illumination algorithm and description of its extensive experimental validation. In the first part, a hybrid of cluster-based hierarchical and progressive radiosity techniques is proposed, which does not require storing links between interacting surfaces and clusters. The clustering does not rely on input geometry, but is performed on the basis of local position in the scene for a pre-meshed scene model. The locality of the resulting clusters improves the accuracy of form factor calculations, and increases the number of possible high-level energy transfers between clusters within an imposed error bound. Limited refinement of the hierarchy of light interactions is supported without compromising the quality of shading when intermediate images are produced immediately upon user request. In the second part, a multi-stage validation procedure is proposed and results obtained using the presented algorithm are discussed. At first, experimental validation of the algorithm against analytically-derived and measured real-world data is performed to check how calculation speed is traded for lighting simulation accuracy for various clustering and meshing scenarios. Then the algorithm performance and rendering quality is tested by a direct comparison of the virtual and real-world images of a complex environment.