Struct SpatialGrid 

pub struct SpatialGrid<T: Clone> {
    pub cell_size: f32,
    /* private fields */
}

A uniform 3D spatial hash grid.

Space is divided into cubic cells of cell_size. Items are stored in buckets by their cell coordinate. Queries scan all cells overlapping the query sphere.

Complexity

• Insert: O(1) average
• Range query: O(k + m) where k = items in range, m = cells overlapping sphere
• Rebuild: O(n)

Fields

cell_size: f32

Cell size (world units per cell edge).

Implementations

impl<T: Clone> SpatialGrid<T>

pub fn new(cell_size: f32) -> Self

pub fn insert(&mut self, pos: Vec3, item: T)

pub fn query_radius(&self, center: Vec3, radius: f32) -> Vec<(T, Vec3, f32)>

Query all items within radius of center, returning (item, position, distance).

pub fn k_nearest(&self, center: Vec3, k: usize) -> Vec<(T, Vec3, f32)>

Find the k nearest items to center.

pub fn nearest(&self, center: Vec3) -> Option<(T, Vec3, f32)>

Find the single nearest item.

pub fn clear(&mut self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn bucket_count(&self) -> usize

pub fn avg_bucket_load(&self) -> f32

Average items per occupied bucket (load factor).

pub fn rebuild(&mut self, items: impl Iterator<Item = (Vec3, T)>)

Rebuild from an iterator of (position, item) pairs.

pub fn iter(&self) -> impl Iterator<Item = (&Vec3, &T)>

Iterate over all items.