ABSTRACT
Of the many spatial partitioning methods available, the BSP tree is the most versatile. It can perform the same tasks as the k-d tree, the quadtree, or the octree, but not vice versa. In addition to spatial partitioning, the BSP tree can be used as a boundary or solid representation of arbitrary polyhedral scenes. BSP trees are also powerful structures for collision detection, which this chapter explores.
