Trait heron::rapier_plugin::rapier::ncollide::partitioning::BVH [−][src]
Trait implemented by Bounding Volume Hierarchy.
Associated Types
Loading content...Required methods
pub fn root(&self) -> Option<Self::Node>
[src]
The root of the BVH.
pub fn num_children(&self, node: Self::Node) -> usize
[src]
The number of children of the given node.
pub fn child(&self, i: usize, node: Self::Node) -> Self::Node
[src]
The i-th child of the given node.
pub fn content(&self, node: Self::Node) -> (&BV, Option<&T>)
[src]
The bounding volume and data contained by the given node.
Provided methods
pub fn visit(&self, visitor: &mut impl Visitor<T, BV>)
[src]
Traverses this BVH using a visitor.
pub fn visit_bvtt(
&self,
other: &impl BVH<T, BV>,
visitor: &mut impl SimultaneousVisitor<T, BV>
)
[src]
&self,
other: &impl BVH<T, BV>,
visitor: &mut impl SimultaneousVisitor<T, BV>
)
Visits the bounding volume test tree implicitly formed with other
.
pub fn best_first_search<N, BFS>(
&self,
visitor: &mut BFS
) -> Option<(Self::Node, <BFS as BestFirstVisitor<N, T, BV>>::Result)> where
N: RealField,
BFS: BestFirstVisitor<N, T, BV>,
[src]
&self,
visitor: &mut BFS
) -> Option<(Self::Node, <BFS as BestFirstVisitor<N, T, BV>>::Result)> where
N: RealField,
BFS: BestFirstVisitor<N, T, BV>,
Performs a best-first-search on the BVH.
Returns the content of the leaf with the smallest associated cost, and a result of user-defined type.
Implementors
impl<'a, N, T, BV> BVH<T, BV> for DBVT<N, T, BV> where
N: RealField,
[src]
N: RealField,
type Node = DBVTNodeId
pub fn root(&self) -> Option<<DBVT<N, T, BV> as BVH<T, BV>>::Node>
[src]
pub fn num_children(&self, node: <DBVT<N, T, BV> as BVH<T, BV>>::Node) -> usize
[src]
pub fn child(
&self,
i: usize,
node: <DBVT<N, T, BV> as BVH<T, BV>>::Node
) -> <DBVT<N, T, BV> as BVH<T, BV>>::Node
[src]
&self,
i: usize,
node: <DBVT<N, T, BV> as BVH<T, BV>>::Node
) -> <DBVT<N, T, BV> as BVH<T, BV>>::Node
pub fn content(
&self,
node: <DBVT<N, T, BV> as BVH<T, BV>>::Node
) -> (&BV, Option<&T>)
[src]
&self,
node: <DBVT<N, T, BV> as BVH<T, BV>>::Node
) -> (&BV, Option<&T>)
impl<'a, T, BV> BVH<T, BV> for BVT<T, BV>
[src]
type Node = BVTNodeId
pub fn root(&self) -> Option<<BVT<T, BV> as BVH<T, BV>>::Node>
[src]
pub fn num_children(&self, node: <BVT<T, BV> as BVH<T, BV>>::Node) -> usize
[src]
pub fn child(
&self,
i: usize,
node: <BVT<T, BV> as BVH<T, BV>>::Node
) -> <BVT<T, BV> as BVH<T, BV>>::Node
[src]
&self,
i: usize,
node: <BVT<T, BV> as BVH<T, BV>>::Node
) -> <BVT<T, BV> as BVH<T, BV>>::Node
pub fn content(
&self,
node: <BVT<T, BV> as BVH<T, BV>>::Node
) -> (&BV, Option<&T>)
[src]
&self,
node: <BVT<T, BV> as BVH<T, BV>>::Node
) -> (&BV, Option<&T>)