Controlling Memory Consumption of Hierarchical Radiosity with Clustering

Xavier Granier 1 George Drettakis 1, *
* Corresponding author
1 iMAGIS - Models, Algorithms and Geometry for Computer Generated Image Graphics
GRAVIR - IMAG - Graphisme, Vision et Robotique, Inria Grenoble - Rhône-Alpes
Abstract : Memory consumption is a major limitation of current hierarchical radiosity algorithms, including those using clustering. To overcome this drawback we present a new algorithm which reduces the storage required for both the hierarchy of subdivided elements and the links representing light transfers. Our algorithm is based on a link hierarchy, combined with a progressive shooting algorithm. Links are thus stored only when they might transfer energy at subsequent iterations. The push-pull and refine/gather steps of hierarchical radiosity are then combined, allowing the simplification of subtrees of the element hierarchy during refinement. Subdivided polygons replaced by textures and groups of input objects contained in clusters may be deleted. A memory control strategy is then used, forcing links to be established higher in the link hierarchy, limiting the overall memory used. Results of our implementation show significant reduction in memory required for a simulation, without much loss of accuracy or visual quality.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download


https://hal.inria.fr/inria-00510069
Contributor : Team Evasion <>
Submitted on : Tuesday, August 17, 2010 - 3:12:49 PM
Last modification on : Thursday, July 4, 2019 - 4:02:33 PM
Long-term archiving on : Tuesday, October 23, 2012 - 12:26:23 PM

Identifiers

Collections

INRIA | UGA | IMAG

Citation

Xavier Granier, George Drettakis. Controlling Memory Consumption of Hierarchical Radiosity with Clustering. Proceedings of Graphics Interface '99, Jun 1999, Kingston, Ontario, Canada. pp.58-65, ⟨10.20380/GI1999.09⟩. ⟨inria-00510069⟩

Share

Metrics

Record views

316

Files downloads

364