A parallel hierarchical radiosity algorithm for complex scenes
Chen-Chin Feng, Shi-Nine Yang · 1997
The radiosity method is known for generating high quality images of diffuse environments. However it suffers from extensive computation and requires a large amount of memory, especially when the given scene is rather complex. As parallel computing becomes widely available, it is natural to exploit parallelism to speed up radiosity computations. The paper presents a general parallel radiosity algorithm for complex scenes based on a hierarchical method. To achieve the generality, the algorithm is primarily designed for a parallel model machine with distributed memory so that it can be realized easily on any set of homogeneous or heterogeneous machines with message passing capability. To cope with the huge volume of input data and to solve the task allocation problem in parallel computation, the complex scene is first subdivided into cells by axial occluders such as walls, floors and ceilings, and then every cell is augmented to form its cell-visible set according to cell visibility. Then the radiosity of these cell-visible sets are scheduled for parallel processing. In order to facilitate the parallel construction of visible sets, the notion of visible buffer is introduced. Moreover, by exploiting the principle of spatial coherence, a scheduling scheme for visible sets is incorporated so that both the communication and disk access overhead can be reduced. Finally the authors implement their algorithm on the PVM (Parallel Virtual Machine) programming environment over 8 DEC Alpha 3000 machines to investigate its performance. The experiment results show that the parallel algorithm achieves good speedup.