Expand description
Spatial data structures for efficient spatial queries and indexing
This module provides spatial data structures commonly used in machine learning for nearest neighbor search, range queries, and spatial indexing.
Modules§
- geographic
- Geographic utilities for working with spatial coordinates and geographic data
Structs§
- KdTree
- K-d tree for efficient nearest neighbor search
- OctTree
- Octree for 3D spatial indexing
- Point
- A point in N-dimensional space
- Quad
Tree - Quadtree for 2D spatial indexing
- RTree
- R-tree for efficient spatial indexing of rectangles
- Rectangle
- Rectangle/Bounding box for spatial queries
- Spatial
Hash - Spatial hash for efficient spatial queries with grid-based indexing
- Spatial
Hash Stats