pub enum BvhNode {
Leaf {
aabb: Aabb,
indices: Vec<usize>,
},
Internal {
aabb: Aabb,
left: Box<BvhNode>,
right: Box<BvhNode>,
},
}Expand description
A node in a static binary BVH built over triangle soup or body AABBs.
Variants§
Implementations§
Source§impl BvhNode
impl BvhNode
Sourcepub fn build(items: &mut [(Aabb, usize)]) -> Option<Self>
pub fn build(items: &mut [(Aabb, usize)]) -> Option<Self>
Build a BVH over a list of (aabb, index) pairs using the SAH heuristic. Falls back to median split when SAH gives no benefit.
Sourcepub fn query_aabb(&self, query: &Aabb, out: &mut Vec<usize>)
pub fn query_aabb(&self, query: &Aabb, out: &mut Vec<usize>)
Query all leaf indices whose AABB overlaps query.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for BvhNode
impl RefUnwindSafe for BvhNode
impl Send for BvhNode
impl Sync for BvhNode
impl Unpin for BvhNode
impl UnsafeUnpin for BvhNode
impl UnwindSafe for BvhNode
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.