01/22/2001
15-462 Computer Graphics I
16
Object-Space Approach
•
Consider objects pairwise
•
•
•
•
•
Complexity O(k
2
) where k = # of objects
•
Painter’s algorithm: render back-to-front
•
“Paint” over invisible polygons
•
How to sort and how to test overlap?