Parallel hierarchical radiosity: the PIT approach

Authors:
Fabrizio Baiardi;Paolo Mori;Laura Ricci
Affiliations:
Dipartimento di Informatica, Universitá di Pisa, Pisa, Italy;Dipartimento di Informatica, Universitá di Pisa, Pisa, Italy;Dipartimento di Informatica, Universitá di Pisa, Pisa, Italy
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 6
Cited 0

A rapid hierarchical radiosity algorithm

Proceedings of the 18th annual conference on Computer graphics and interactive techniques
The hemi-cube: a radiosity solution for complex environments

SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
Radiosity and Global Illumination

Radiosity and Global Illumination
Parallelization of Irregular Problems Based on Hierarchical Domain Representation

HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
PIT: A Library for the Parallelization of Irregular Problems

PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Modeling the interaction of light between diffuse surfaces

SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Radiosity is a method to compute the global illumination of a scene. To reduce its complexity, hierarchical radiosity decomposes the scene into a hierarchy of patches and computes the light exchanged between patches at different levels, according to their distance and/or to the amount of light they emit. A distributed memory implementation of this method has been developed through PIT, a problem independent library that supports hierarchical applications on distributed memory architectures. PIT functions exploit a distributed version of the tree representing the hierarchical decomposition.