Struct binary_space_partition::BspNode
[−]
[src]
pub struct BspNode<T> { /* fields omitted */ }A node in the BspTree, which can be considered a tree itself.
Methods
impl<T> BspNode<T>[src]
fn new() -> Self
Create a new node.
fn is_leaf(&self) -> bool
Check if this node is a leaf of the tree.
fn get_depth(&self) -> usize
Get the tree depth starting with this node.
impl<T: Plane> BspNode<T>[src]
fn insert(&mut self, value: T)
Insert a value into the sub-tree starting with this node. This operation may spawn additional leafs/branches of the tree.
fn order(&self, base: &T, out: &mut Vec<T>)
Build the draw order of this sub-tree into an out vector,
so that the contained planes are sorted back to front according
to the view vector given as the base plane normal.