Struct LooseOctree 

pub struct LooseOctree<T: Clone> {
    pub center: [f64; 3],
    pub half_size: f64,
    pub depth: u32,
    pub items: Vec<(usize, [f64; 3], T)>,
    pub children: Option<Box<[LooseOctree<T>; 8]>>,
}

A loose octree node that stores items at every level.

Fields

center: [f64; 3]

World-space centre of this node.

half_size: f64

Half-size of the tight cell (the loose cell is 2 * half_size).

depth: u32

Remaining subdivision depth (0 = leaf).

items: Vec<(usize, [f64; 3], T)>

Items stored at this node (not yet pushed to children).

children: Option<Box<[LooseOctree<T>; 8]>>

Eight children, present after the first subdivision.

Implementations

impl<T: Clone> LooseOctree<T>

pub fn new(center: [f64; 3], half_size: f64, max_depth: u32) -> Self

Creates a new root node.

pub fn child_index(&self, pos: [f64; 3]) -> usize

Returns the octant index (0..7) for pos relative to self.center.

pub fn insert(&mut self, id: usize, pos: [f64; 3], data: T, max_items: usize)

Inserts (id, pos, data) into the tree.

pub fn query_sphere(&self, center: [f64; 3], radius: f64) -> Vec<(usize, &T)>

Returns all items whose stored position is within radius of center.

pub fn query_aabb(&self, min: [f64; 3], max: [f64; 3]) -> Vec<(usize, &T)>

Returns all items within an axis-aligned box.

pub fn item_count(&self) -> usize

Counts all items stored in this node and all descendants.

pub fn max_depth_reached(&self) -> u32

Returns the maximum depth reached in the tree.

pub fn node_count(&self) -> usize

Count the total number of nodes in the tree.

pub fn k_nearest(&self, center: [f64; 3], k: usize) -> Vec<(usize, f64, &T)>

K-nearest neighbours search via the octree.