# Struct plane_split::bsp::BspSplitter

``````pub struct BspSplitter<A: Copy> {
result: Vec<Polygon<A>>,
nodes: Vec<BspNode>,
polygons: Vec<Polygon<A>>,
}``````
Expand description

Binary Space Partitioning splitter, uses a BSP tree.

## Fields§

§`result: Vec<Polygon<A>>`§`nodes: Vec<BspNode>`§`polygons: Vec<Polygon<A>>`

## Implementations§

source§

### impl<A: Copy> BspSplitter<A>

source

#### pub fn new() -> Self

Create a new BSP splitter.

source§

### impl<A> BspSplitter<A>where A: Copy + Debug + Default,

source

#### pub fn reset(&mut self)

Put the splitter back in it initial state.

Call this at the beginning of every frame when reusing the splitter.

source

#### pub fn add(&mut self, poly: Polygon<A>)

Add a polygon to the plane splitter.

This is where most of the expensive computation happens.

source

#### pub fn sort(&mut self, view: Vector3D<f64>) -> &[Polygon<A>]

Sort the added and split polygons against the view vector.

Call this towards the end of the frame after having added all polygons.

source

#### pub fn solve( &mut self, input: &[Polygon<A>], view: Vector3D<f64> ) -> &[Polygon<A>]where A: Copy,

Process a set of polygons at once.

source

#### fn insert(&mut self, node_idx: NodeIdx, value: &Polygon<A>)

Insert a value into the sub-tree starting with this node. This operation may spawn additional leafs/branches of the tree.

source

#### pub fn order(&self, node: NodeIdx, base: &Polygon<A>, out: &mut Vec<Polygon<A>>)

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 defined as the `base` plane front direction.

§

§

§

§

§

## Blanket Implementations§

source§

### impl<T> Any for Twhere T: 'static + ?Sized,

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

### impl<T> Borrow<T> for Twhere T: ?Sized,

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> for Twhere U: From<T>,

source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

source§

### impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

#### type Error = Infallible

The type returned in the event of a conversion error.
source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

### impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.