Memory Management Schemes for Radiosity Computation in Complex Environments - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

Memory Management Schemes for Radiosity Computation in Complex Environments

Abstract

Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not fitting in memory, new solutions have to be devised. One solution is to partition the scene into subsets of polygons 3D cells or clusters and to maintain in memory only some of them. The radiosity computation is performed only for this resident subset which changes during the resolution process. This change entails many read and write operations from or onto the disk. These disk transfers must be ordered to make the radiosity algorithms tractable. We propose in this paper different ordering strategies which can be seen as complementary to those devised by Teller.
Fichier principal
Vignette du fichier
RR-3149.pdf (342.64 Ko) Télécharger le fichier

Dates and versions

inria-00073540 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073540 , version 1

Cite

Daniel Meneveaux, Kadi Bouatouch, Eric Maisel. Memory Management Schemes for Radiosity Computation in Complex Environments. [Research Report] RR-3149, INRIA. 1997. ⟨inria-00073540⟩
69 View
137 Download

Share

Gmail Facebook X LinkedIn More