04/09/2002
15-462 Graphics I
34
Classical Radiosity Algorithms
•Matrix Radiosity
–Diagonally
dominant matrix
–Use
Gauss-Seidel iterative solution
–Time
and space complexity is O(n2) for n elements
–Memory
cost excessive
•Progressive Refinement Radiosity
–Solve
equations incrementally with form factors
–Time
complexity is O(n ¢ s) for s
iterations
–Used
more commonly (space complexity O(n))