Struct SpatialIndex2D 

pub struct SpatialIndex2D { /* private fields */ }

2D spatial index using R*-tree for efficient collision queries.

Implementations

impl SpatialIndex2D

pub fn new() -> Self

Creates a new empty spatial index.

pub fn with_entries(entries: Vec<SpatialEntry2D>) -> Self

Creates a spatial index with the given entries.

pub fn insert(&mut self, entry: SpatialEntry2D)

Inserts a new entry into the spatial index.

pub fn insert_geometry( &mut self, index: usize, geometry: &Geometry2D, position: (f64, f64), rotation: f64, )

Inserts a placed geometry into the spatial index.

pub fn len(&self) -> usize

Returns the number of entries in the index.

pub fn is_empty(&self) -> bool

Returns true if the index is empty.

pub fn clear(&mut self)

Clears all entries from the index.

pub fn query_aabb(&self, min: [f64; 2], max: [f64; 2]) -> Vec<&SpatialEntry2D>

Finds all entries whose bounding boxes intersect with the given AABB.

This is the primary broad-phase collision detection method.

pub fn query_geometry( &self, geometry: &Geometry2D, position: (f64, f64), rotation: f64, ) -> Vec<&SpatialEntry2D>

Finds all entries that potentially intersect with a geometry at the given position.

pub fn query_with_margin( &self, geometry: &Geometry2D, position: (f64, f64), rotation: f64, margin: f64, ) -> Vec<&SpatialEntry2D>

Finds all entries that potentially intersect with the given geometry AABB expanded by a margin (for spacing).

pub fn iter(&self) -> impl Iterator<Item = &SpatialEntry2D>

Returns an iterator over all entries in the index.

pub fn get_potential_collisions( &self, geometry: &Geometry2D, position: (f64, f64), rotation: f64, spacing: f64, ) -> Vec<usize>

Returns the indices of potentially colliding geometries for a query geometry.

Trait Implementations

impl Debug for SpatialIndex2D

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for SpatialIndex2D

fn default() -> Self

Returns the “default value” for a type.