Crate aabb_tree [−] [src]
AABB tree
This crate is the implementation of a dynamic bounding volume tree based on
axis aligned bounding boxes. It is a spatial structure with support for
querying objects based on their position and size inside the tree.
This work is based on Presson's btDbvt
written for Bullet Physics and
Catto's b2DynamicTree
written for Box2D.
Structs
AabbTree |
A dynamic spatial tree. Data is arranged in a binary tree which allows fast positional queries. The proxies returned from the various methods are leaves in the tree. |
Proxy |
An easily copyable type that represents a value inside the tree |
Type Definitions
MinMaxTuple |
How the tree represents AABBs internally |