BSP Tree Example
Computing visibility or depth-sorting with BSP trees is both simple and fast.
It resolves visibility at the primitive level.
Visibility computation is independent of screen size
Requires considerable preprocessing of the scene primitives
Primitives must be easy to subdivide along planes
Supports CSG
|
|
|
