03/28/2002
15-462 Graphics I
22
Painter’s Algorithm with BSP Trees
•Building
the tree
–May
need to split some polygons
–Slow,
but done only once
•Traverse
back-to-front or front-to-back
–Order
is viewer-direction dependent
–What
is front and what is back of each line changes
–Determine
order on the fly