Struct building_blocks_partition::octree::Octree

pub struct Octree { /* fields omitted */ }

A sparse set of voxel coordinates (3D integer points). Supports spatial queries.

The octree is a cube shape and the edge lengths can only be a power of 2, at most 64. When an entire octant is full, it will be stored in a collapsed representation, so the leaves of the tree can be differently sized octants.

Implementations

impl Octree

pub fn from_array3<A, T>(array: &A, extent: Extent3i) -> Self where
    A: Array<[i32; 3]> + GetUncheckedRelease<Stride, T>,
    T: Clone + IsEmpty, 

Constructs an Octree which contains all of the points in extent which are not empty (as defined by the IsEmpty trait). extent must be cube-shaped with edge length being a power of 2. For exponent E where edge length is 2^E, we must have 0 < E <= 6, because there is a maximum fixed depth of the octree.

pub fn edge_length(&self) -> i32

pub fn octant(&self) -> Octant

The entire octant spanned by the octree.

pub fn extent(&self) -> &Extent3i

The extent spanned by the octree.

pub fn is_empty(&self) -> bool

Returns true iff the octree contains zero points.

pub fn visit(&self, visitor: &mut impl OctreeVisitor) -> VisitStatus

Visit every non-empty octant of the octree.