The DynamicTrees provides a spatial partiioning data structure for quickly querying for overlapping bounding boxes for all tracked bodies. The worst case performance of this is O(n*log(n)) where n is the number of bodies in the tree.
Internally the bounding boxes are organized as a balanced binary tree of bounding boxes, where the leaf nodes are tracked bodies. Every non-leaf node is a bounding box that contains child bounding boxes.
Inserts a node into the dynamic tree
Removes a node from the dynamic tree
Returns the internal height of the tree, shorter trees are better. Performance drops as the tree grows
Queries the Dynamic Axis Aligned Tree for bodies that could be colliding with the provided body.
In the query callback, it will be passed a potential collider. Returning true from this callback indicates that you are complete with your query and you do not want to continue. Returning false will continue searching the tree until all possible colliders have been returned.
Queries the Dynamic Axis Aligned Tree for bodies that could be intersecting. By default the raycast query uses an infinitely
long ray to test the tree specified by
In the query callback, it will be passed a potential body that intersects with the racast. Returning true from this callback indicates that your are complete with your query and do not want to continue. Return false will continue searching the tree until all possible bodies that would intersect with the ray have been returned.
Tracks a body in the dynamic tree
Untracks a body from the dynamic tree
Updates the dynamic tree given the current bounds of each body being tracked