Struct TreeIndex 

pub struct TreeIndex { /* private fields */ }

Static median-split tree over one mesh’s triangle bounds.

Implementations

impl TreeIndex

pub fn build(mesh: &dyn TriangleSource, options: TreeOptions) -> Self

pub fn build_with_runner( mesh: &dyn TriangleSource, options: TreeOptions, runner: &mut Runner<'_>, ) -> Result<Self, Cancelled>

Build, publishing index-build-start, index-build-partition (at chunk boundaries counted in triangles partitioned) and index-build-complete, and stopping at a partition boundary on cancel.

pub fn node_count(&self) -> usize

Trait Implementations

impl Clone for TreeIndex

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TreeIndex

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

Formats the value using the given formatter.

impl PartialEq for TreeIndex

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for TreeIndex

impl TriangleIndex for TreeIndex

fn query_aabb(&self, query: &Bounds3, mode: ProjectionMode, out: &mut Vec<u32>)

Append every triangle id whose bounds overlap query on the axes mode compares. Touching counts. Ids are appended in ascending order and out is NOT cleared first.

fn stats(&self) -> IndexStats

fn query(&self, query: &Bounds3, mode: ProjectionMode) -> Vec<u32>

Convenience: a fresh ascending candidate list.

fn query_cutter_xy(&self, x: f64, y: f64, radius: f64, out: &mut Vec<u32>)

Candidates for a cutter of radius at (x, y): the XY disc’s box, unbounded in Z (the drop-cutter’s query).