By Topic

Memory management schemes for radiosity computation in complex environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
D. Meneveaux ; IRISA, Rennes, France ; K. Bouatouch ; E. Maisel

Hierarchical radiosity is a very demanding process in terms of computation time and memory resources even for scenes of moderate complexity. To handle complex environments which don't fit in the 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. The authors propose different ordering strategies which can be seen as complementary to those devised by Teller (1994)

Published in:

Computer Graphics International, 1998. Proceedings

Date of Conference:

22-26 Jun 1998