A rapid hierarchical radiosity algorithm
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Elements of information theory
Elements of information theory
An importance-driven radiosity algorithm
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Combining hierarchical radiosity and discontinuity meshing
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Bounds and error estimates for radiosity
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Proceedings of the eurographics workshop on Rendering techniques '96
Radiosity and Global Illumination
Radiosity and Global Illumination
Modeling the interaction of light between diffuse surfaces
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Information theory tools for scene discretization
EGWR'99 Proceedings of the 10th Eurographics conference on Rendering
A Generalised-Mutual-Information-Based Oracle for Hierarchical Radiosity
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
| Hi-index | 0.00 |
In the radiosity method scene meshing has to accurately represent illumination variations avoiding unnecessary refinements that would increase the computational cost. In this paper we present three refinement criteria for hierarchical radiosity which are based on the information content of a ray between two patches or elements and the loss of information transfer between them due to the discretisation. The results obtained with our information-theory-based oracles improve on the classic ones based on transported power, kernel smoothness, and smoothness of received radiosity.