[−][src]Trait ncollide3d::partitioning::BVH
Trait implemented by Bounding Volume Hierarchy.
Associated Types
Loading content...Required methods
fn root(&self) -> Option<Self::Node>
The root of the BVH.
fn num_children(&self, node: Self::Node) -> usize
The number of children of the given node.
fn child(&self, i: usize, node: Self::Node) -> Self::Node
The i-th child of the given node.
fn content(&self, node: Self::Node) -> (&BV, Option<&T>)
The bounding volume and data contained by the given node.
Provided methods
fn visit(
&self,
visitor: &mut impl Visitor<T, BV>
)
&self,
visitor: &mut impl Visitor<T, BV>
)
Traverses this BVH using a visitor.
fn visit_bvtt(
&self,
other: &impl BVH<T, BV>,
visitor: &mut impl SimultaneousVisitor<T, BV>
)
&self,
other: &impl BVH<T, BV>,
visitor: &mut impl SimultaneousVisitor<T, BV>
)
Visits the bounding volume test tree implicitly formed with other
.
fn best_first_search<N, BFS>(&self, visitor: &mut BFS) -> Option<BFS::Result> where
N: Real,
BFS: BestFirstVisitor<N, T, BV>,
N: Real,
BFS: BestFirstVisitor<N, T, BV>,
Performs a best-fist-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: Real, T, BV> BVH<T, BV> for DBVT<N, T, BV>
[src]
type Node = DBVTNodeId
fn root(&self) -> Option<Self::Node>
[src]
fn num_children(&self, node: Self::Node) -> usize
[src]
fn child(&self, i: usize, node: Self::Node) -> Self::Node
[src]
fn content(&self, node: Self::Node) -> (&BV, Option<&T>)
[src]
fn visit(
&self,
visitor: &mut impl Visitor<T, BV>
)
[src]
&self,
visitor: &mut impl Visitor<T, BV>
)
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>
)
fn best_first_search<N, BFS>(&self, visitor: &mut BFS) -> Option<BFS::Result> where
N: Real,
BFS: BestFirstVisitor<N, T, BV>,
[src]
N: Real,
BFS: BestFirstVisitor<N, T, BV>,
impl<'a, T, BV> BVH<T, BV> for BVT<T, BV>
[src]
type Node = BVTNodeId
fn root(&self) -> Option<Self::Node>
[src]
fn num_children(&self, node: Self::Node) -> usize
[src]
fn child(&self, i: usize, node: Self::Node) -> Self::Node
[src]
fn content(&self, node: Self::Node) -> (&BV, Option<&T>)
[src]
fn visit(
&self,
visitor: &mut impl Visitor<T, BV>
)
[src]
&self,
visitor: &mut impl Visitor<T, BV>
)
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>
)
fn best_first_search<N, BFS>(&self, visitor: &mut BFS) -> Option<BFS::Result> where
N: Real,
BFS: BestFirstVisitor<N, T, BV>,
[src]
N: Real,
BFS: BestFirstVisitor<N, T, BV>,