Struct BspTree 

pub struct BspTree { /* private fields */ }

BSP tree wrapper for efficient spatial queries

Implementations

impl BspTree

pub fn new(nodes: Vec<WmoBspNode>) -> Self

Create a new BSP tree from nodes

pub fn empty() -> Self

Create an empty BSP tree

pub fn is_empty(&self) -> bool

Check if the tree is empty

pub fn len(&self) -> usize

Get the number of nodes

pub fn get_node(&self, index: usize) -> Option<&WmoBspNode>

Get a node by index

pub fn query_point(&self, point: &[f32; 3]) -> Vec<usize>

Query the BSP tree to find all leaf nodes that might contain the point.

Returns indices of leaf nodes that need to be checked for triangle intersection.

pub fn pick_closest_tri_neg_z( &self, point: &[f32; 3], vertices: &[Vec3], indices: &[u16], ) -> Option<usize>

Find the closest triangle below the given point using ray-triangle intersection.

Shoots a ray in the negative Z direction from the point and finds the first triangle it intersects.

Arguments

• point - The query point
• vertices - All vertices in the WMO group
• indices - Triangle indices (3 per triangle)

Returns

The index of the closest triangle (in terms of triangle count, not face index), or None if no triangle is below the point.

Trait Implementations

impl Clone for BspTree

fn clone(&self) -> BspTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BspTree

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

Formats the value using the given formatter.