Constructing a BSP Tree
The algorithm to build a BSP tree is very simple:
- Select a partitioning plane/facet.
- Partition the remaining planes/facets
according to the side of the
partioning plane that they fall
on (+ or -).
- Repeat with each of the two new sets.
Partitioning facets:
Partitioning requires testing all facets in the active set to find if
they lie entirely on the positive side of the partition plane, entirely
on the negative side, or if they cross it. In the case of a crossing facet
we clip it into two halves (using our plane-at-a-time clipping alogithm).
|
|
