Expand description
Spatial search structures for SpatialRust.
KDTree, hash grid, and octree implementations live in this crate.
Structs§
- Brute
Force Index - Reference index using brute-force search for correctness tests.
- KdTree
- Cache-friendly KD-tree for 3D point clouds.
- Neighbor
- One neighbor search result.
- Neighbor
Graph - A directed neighborhood graph over a point cloud.
Traits§
- Nearest
Neighbor Index - Exact nearest neighbor queries.
- Radius
Search Index - Radius search queries.
- Spatial
Index - Common spatial index operations.
Functions§
- brute_
force_ knn - Finds up to
knearest neighbors by brute force. - brute_
force_ radius - Finds all neighbors within
radiusby brute force. - knn_
graph - Builds a directed k-nearest-neighbor graph: an edge from every point to each
of its
knearest neighbors (excluding itself). - radius_
graph - Builds a directed radius graph: an edge from every point to each other point
within
radius.