Module quadtree 

Quadtree data structure for 2D space

This module provides a Quadtree implementation for efficient spatial queries in 2D space. Quadtrees recursively subdivide space into four equal quadrants, allowing for efficient nearest neighbor searches, range queries, and point-in-region operations.

The implementation supports:

• Quadtree construction from 2D point data
• Nearest neighbor searches
• Range queries for finding points within a specified distance
• Point-in-region queries
• Dynamic insertion and removal of points

Structs

BoundingBox2D

A 2D bounding box defined by its minimum and maximum corners

Quadtree

The Quadtree data structure for 2D spatial searches