Class diagram for ddgOctTree:
|bool||insert (void *pn, ddgBBox3 *pbb)|
|Insert an object into the octtree.|
|bool||remove (void *pn, ddgBBox3 *pbb)|
|Remove an object from the octtree.|
It consists of a hierarchy of nodes.
Assumptions: Objects are inserted into the minimum sized node that can fit them. if there are more than N objects in a node, the node is split.