Enum arctk::geom::dom::tree::Tree

pub enum Tree<'a, T> {
    Root {
        boundary: Cube,
        children: [Box<Tree<'a, T>>; 8],
    },
    Branch {
        boundary: Cube,
        children: [Box<Tree<'a, T>>; 8],
    },
    Leaf {
        boundary: Cube,
        tris: Vec<(T, &'a SmoothTriangle)>,
    },
    Empty {
        boundary: Cube,
    },
}

Tree cell enumeration.

Variants

Root

Root cell.

Fields of Root

boundary: Cube

Boundary.

children: [Box<Tree<'a, T>>; 8]

Children.

Branch

Branching cell.

Fields of Branch

boundary: Cube

Boundary.

children: [Box<Tree<'a, T>>; 8]

Children.

Leaf

Terminal populated cell.

Fields of Leaf

boundary: Cube

Boundary.

tris: Vec<(T, &'a SmoothTriangle)>

Intersecting triangles.

Empty

Terminal empty cell.

Fields of Empty

boundary: Cube

Boundary.

Implementations

impl<'a, T> Tree<'a, T>

#[must_use]pub fn num_cells(&self) -> usize

Determine the number of cells contained within the cell. This cell is included in the count.

#[must_use]pub fn num_leaf_cells(&self) -> usize

Determine the number leaf of cells contained within the cell. This cell is included in the count.

#[must_use]pub fn num_tri_refs(&self) -> usize

Determine the number of reference pairs contained within this cell and all child cells.

#[must_use]pub fn depth(&self) -> usize

Determine the maximum depth from this cell to a terminal cell.

impl<'a, T: Clone> Tree<'a, T>

#[must_use]pub fn observe(&self, ray: Ray, bump_dist: f64, max_dist: f64) -> Option<Hit<T>>

Determine what a ray would observe within the cell.

#[must_use]pub fn hit_scan(&self, ray: &Ray, bump_dist: f64) -> Scan<T>

Scan for hits within the cell.

impl<'a, T> Tree<'a, T>

#[must_use]pub fn find_terminal_cell(&self, pos: &Pos3) -> Option<&Self>

Determine the terminal cell containing the given position.

impl<'a, T> Tree<'a, T>

#[must_use]pub fn boundary(&self) -> &Cube

Reference the cell's boundary.