Space subdivision using BSP trees
| Memory
representation |
- inner node = pointers to children,
position of the splitting plane
- leaf = list of pointers to the incident
objects
|
| Traversing
algorithm |
- recursive
- inner node - checking the ray against
the splitting plane
- leaf - checking the ray against all
incident objects
|
|