First page Back Continue Last page Overview Graphics
Putting it Together
For moving single object v static object collision detection
- Starting with root of BSP Tree calculate where M(x,y,z) in relation to partition plane. Continue this recursively with front or back sub tree
- When leaf node reached calculate whether collision has occurred using standard bounding shape technique
For moving complex object v static object collision detection
- Each object will have its own BSP tree
- Merge the smaller tree into the larger tree
- Check for collisions between objects in the same leaf node