[−][src]Crate quadtree_f32
Simple f32-based quadtree that can query rects and points in Olog(n) time.
Note: For simplicity sake, there is no way to update the tree besides destroying and rebuilding it completely.
Structs
ItemId | Instead of making a generic tree, the quadtree only keeps items (rects or points) and their associated IDs. After insertion, you can query the IDs of items within a certain region. |
Point | f32-based Point |
QuadTree | A QuadTree that can store rectangles and points |
Rect | Rectangle (2d bounding box) that can be inserted into the QuadTree |
Enums
Item | Item that can be inserted into the QuadTree |