Skip to main content

Crate spatialrust_search

Crate spatialrust_search 

Source
Expand description

Spatial search structures for SpatialRust.

KDTree, hash grid, and octree implementations live in this crate.

Structs§

BruteForceIndex
Reference index using brute-force search for correctness tests.
KdTree
Cache-friendly KD-tree for 3D point clouds.
Neighbor
One neighbor search result.
NeighborGraph
A directed neighborhood graph over a point cloud.

Traits§

NearestNeighborIndex
Exact nearest neighbor queries.
RadiusSearchIndex
Radius search queries.
SpatialIndex
Common spatial index operations.

Functions§

brute_force_knn
Finds up to k nearest neighbors by brute force.
brute_force_radius
Finds all neighbors within radius by brute force.
knn_graph
Builds a directed k-nearest-neighbor graph: an edge from every point to each of its k nearest neighbors (excluding itself).
radius_graph
Builds a directed radius graph: an edge from every point to each other point within radius.