Struct BspNode 

pub struct BspNode {
    pub plane: BspPlane,
    pub polygons: Vec<Vec<[f64; 3]>>,
    pub front: Option<Box<BspNode>>,
    pub back: Option<Box<BspNode>>,
}

A node in a Binary Space Partitioning tree.

Each node divides space with a plane; polygons are classified as front, back, or coplanar with the plane.

Fields

plane: BspPlane

The dividing plane.

polygons: Vec<Vec<[f64; 3]>>

Coplanar polygons stored at this node.

front: Option<Box<BspNode>>

Subtree in front of the plane.

back: Option<Box<BspNode>>

Subtree behind the plane.

Implementations

impl BspNode

pub fn new(plane: BspPlane) -> Self

Create a new BSP node with the given plane, no polygons, no children.

pub fn classify_point(&self, p: [f64; 3]) -> PlaneClass

Classify a point relative to this node’s plane.

pub fn insert_polygon(&mut self, polygon: Vec<[f64; 3]>)

Insert a polygon into the BSP tree.

The polygon is split if it straddles the plane, and each fragment is routed to the front or back subtree.

pub fn collect_front_polygons(&self) -> Vec<Vec<[f64; 3]>>

Collect all polygons in front of the plane (recursively).

pub fn collect_back_polygons(&self) -> Vec<Vec<[f64; 3]>>

Collect all polygons behind the plane (recursively).

pub fn count_polygons(&self) -> usize

Count all polygons in the tree.