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.
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.
A QuadTree that can store rectangles and points
Rectangle (2d bounding box) that can be inserted into the QuadTree
Item that can be inserted into the QuadTree