Hi
I am looking at using octree data structures to optimize collision detection. I can see how it can be used to replace a normal grid. How does it work around an object? I have created AABB boxes that move and update there co-ordinates alongside an object correctly.
The way I understand it an octree is initialized, and then put around the objects based on the number of polygons. The more polygons in an area the more splits that occur. How does this work on a moving object?
If the object was to rotate would this mean that the octree would have to be recalculated?
If in a game a homing missile was fired and chasing a plane how would the octree react to both the plane and missile suddenly changing direction?
Am I right in assuming that if two boxes collide you iterate down the tree until a leaf is found when two leaves are found you can do a test within the two leaves to check for a collision?
Many thanks for any clarification sorry if the question is hard to understand
thanks