Struct e2rcore::implement::math::bvh::Bvh

pub struct Bvh { /* fields omitted */ }

implementation of spatial acceleration using bounding volume hierarchy with surface area heuristic

Methods

impl Bvh

fn init(bins: u32) -> Bvh

Trait Implementations

impl ISpatialAccel for Bvh

fn query_intersect(&self, input: &IBound) -> Result<Vec<u64>, &'static str>

query for a list of objects intersecting with input

fn build_all(&mut self, objs: &[(u64, &IBound)]) -> Result<(), &'static str>

build a acceleration structure with input bounds and object ids

impl IStatTree for Bvh

fn sum_subtree_child_count(&self) -> Option<u64>

fn node_degree(&self) -> Option<u64>

fn max_depth(&self) -> Option<u64>

fn mean_depth(&self) -> Option<u64>

fn min_depth(&self) -> Option<u64>

fn balance_ratio(&self) -> Option<f64>