Expand description
Octree data structure for 3D space
This module provides an Octree implementation for efficient spatial queries in 3D space. Octrees recursively subdivide space into eight equal octants, allowing for efficient nearest neighbor searches, range queries, and collision detection.
The implementation supports:
- Octree construction from 3D point data
- Nearest neighbor searches
- Range queries for finding points within a specified distance
- Collision detection between objects
- Dynamic insertion and removal of points
Structsยง
- Bounding
Box - A 3D bounding box defined by its minimum and maximum corners
- Octree
- The Octree data structure for 3D spatial searches