BSP Boolean Operations
Divide and conquer
- Each node V corresponds to a convex region containing all geometry in the subtree rooted at V
- No intersection with bounding volume of V means no intersection with subtree rooted at V
- Do detail work only in regions required
- Boolean operations grow with O( log n) if “good” tree