A rapid hierarchical radiosity algorithm
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Modeling the interaction of light between diffuse surfaces
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Information-theory-based oracles for hierarchical radiosity
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Information theory in computer graphics and visualization
SIGGRAPH Asia 2011 Courses
Hi-index | 0.00 |
One of the main problems in the radiosity method is how to discretise a scene into mesh elements that allow us to accurately represent illumination. In this paper we present a new refinement criterion for hierarchical radiosity based on the continuous and discrete generalised mutual information measures between two patches or elements. These measures, derived from the generalised entropy of of Harvda-Charvát-Tsallis, express the information transfer within a scene. The results obtained improve on the ones based on kernel smoothness and Shannon mutual information.