Visibility masks for solving complex radiosity computations on multiprocessors

This paper presents a strategy to handle very complex scenes for radiosity computation. Compared to other radiosity algorithms, our solution focuses on the ability to compute the radiosity in local environments instead of solving the problem for the whole environment, By splitting the problem into subproblems, using virtual interface and visibility masks, our technique is able to achieve better data locality than other standard solutions. We present an implementation of visibility masks on a distributed memory parallel computer (Intel Paragon XP/S).