Relax
rules for quadtrees and octrees
k-dimensional
tree (k-d tree)
Split
at arbitrary interior point
Split
one dimension at a time
Binary
space partitioning tree (BSP tree)
In 2
dimensions, split with any line
In k
dims. split with k-1 dimensional hyperplane
Particularly
useful for painters algorithm
Can
also be used for ray tracing [see
handout]