03/28/2002
15-462 Graphics I
21
Building a Good Tree
•Naive
partitioning of n polygons yields O(n3) polygons (in
3D)
•Algorithms
with O(n2) increase exist
–Try
all, use polygon with fewest splits
–Do not
need to split exactly along polygon planes
•Should
balance tree
–More
splits allow easier balancing
–Rebalancing?