A new algorithm for the radiosity computation of higher scene complexi
ty is presented. The algorithm regards a large radiosity system as a c
ollection of small subsystems. The subsystems interact with each other
only through input and output functions, so the large initial equatio
n system can be divided into a collection of small equation systems. T
his reduces the computational cost to O(n) for n subsystems. Moreover,
the data necessary for each subsystem computation is completely local
ized, which allows the database to be stored on disk. The algorithm ca
n easily be implemented with a slight modification of the hierarchical
radiosity algorithm. Experiments demonstrate the efficiency of the al
gorithm.