Struct Bvh 

pub struct Bvh { /* private fields */ }

Implementations

impl Bvh

pub fn point_candidates_bounded( &self, point: [f64; 3], radius: f64, out: &mut Vec<u32>, remaining: &mut usize, ) -> Result<(), &'static str>

Conservative near-point candidates using this same tree/padding policy, charging every visited node to a caller-owned aggregate work budget. On exhaustion discard out: a partial candidate list is not a result.

impl Bvh

pub fn ray_candidates_bounded( &self, p: [f64; 3], far: [f64; 3], out: &mut Vec<u32>, remaining: &mut usize, ) -> Result<(), &'static str>

Conservative candidates for the segment p→far, charging every visited node to the caller’s aggregate work budget like point_candidates_bounded. On exhaustion discard out: a partial candidate list is not a result.

impl Bvh

pub fn nearest_point_bounded( &self, point: [f64; 3], radius: f64, remaining: &mut usize, ambiguity: f64, candidates: &mut Vec<(u32, f64)>, distance_squared: impl FnMut(u32) -> f64, ) -> Result<Option<(u32, f64)>, &'static str>

Nearest leaf within a finite radius, visiting the nearer child first and shrinking the conservative query radius after each exact leaf distance. Retains candidates in the final nearest-distance plus ambiguity band; their exact distances let the caller reject near ties without a second walk. The callback must return the squared distance to that leaf’s primitive. Equal distances retain the original left-to-right candidate order. Every node and callback consumes the caller’s aggregate work budget; exhaustion returns an error, never a partial nearest result.

impl Bvh

pub fn build(tris: &[[[f64; 3]; 3]]) -> Bvh

pub fn ray_candidates(&self, p: [f64; 3], far: [f64; 3], out: &mut Vec<u32>)

Append the index of every triangle whose (padded) AABB the segment p→far may pass through — a conservative superset of the triangles the exact ray could hit. Used to turn the O(N) point_inside ray-cast into an O(log N + hits) one without changing its parity result.

pub fn point_candidates(&self, p: [f64; 3], radius: f64, out: &mut Vec<u32>)

Append the index of every triangle whose AABB, grown by radius (plus the conservative pad), contains point p. radius = 0 ⇒ exact-on-surface candidates; radius = band ⇒ near-coplanar-flush candidates. A conservative superset, so the exact per-triangle test that follows decides the verdict.

pub fn query(&self, q: &([f64; 3], [f64; 3]), out: &mut Vec<u32>)

Append the indices of every triangle whose AABB overlaps q.