Decoupling Propagation and Reflection for Radiance Computations



Although significant success has been made in the improvement
of radiosity algorithms, the methods to solve
the general global illumination problem with arbitrarily
reflecting surfaces still require unreasonable computing
times. In this paper, we describe an extension of the
well-known hierarchical radiosity algorithm, which is
able to cope with non-diffuse surfaces, without the explosion
of computation times known from other algorithms.
Results of the algorithm are presented and compared
with other global illumination methods.