Parallel Hierarchical Radiosity: The PIT Approach | Zendy

Fabrizio Baiardi | Zendy; Paolo Mori | Zendy; Laura Ricci | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel Hierarchical Radiosity: The PIT Approach

Author(s) -

Fabrizio Baiardi,

Paolo Mori,

Laura Ricci

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29067-2

DOI - 10.1007/11558958_125

Subject(s) - radiosity (computer graphics) , computer science , global illumination , decomposition , exploit , hierarchy , tree (set theory) , computer graphics (images) , hierarchical database model , parallel computing , theoretical computer science , mathematics , data mining , ecology , rendering (computer graphics) , mathematical analysis , computer security , economics , market economy , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research