New Contributions To Spatial Partitioning And Parallel Global Illumination Algorithms
switch to german Deutsche Version

Robert Garmann:
New Contributions To Spatial Partitioning And Parallel Global Illumination Algorithms
Dissertation, Fachbereich Informatik, Universität Dortmund, September 2000.

Abstract: This thesis resides around the interface of two disciplines in computer science: computer graphics (global illumination) and parallel computing (dynamic partitioning). On the one hand the hierarchical radiosity algorithm (HRA) - a famous and efficient global illumination algorithm - is examined with respect to its capability of being parallelized. On the other hand a dynamic orthogonal recursive bisection tool for the dynamic partitioning of spatially mapped tasks is developped and analyzed theoretically and experimentally. The HRA is a special instance of algorithms that can be formulated as a collection of spatially mapped tasks. As a proof of practicability of our tool we apply the tool to the HRA and observe a well scalable behaviour and useful speedup values.

Keywords: Hierarchical Radiosity, Global Illumination, Parallel Computing, Graph Partitioning, Dynamic Load Balancing, Orthogonal Recursive Bisection, Computer Graphics, Scientific Visualization, Rendering, Simulation, Message Passing, Distributed Memory

Text:
  full text

Links:
  PARILLU

Robert Garmann, February 22, 2002
HOME