Struct heron::rapier_plugin::rapier3d::parry::query::epa::EPA [−][src]
pub struct EPA { /* fields omitted */ }
Expand description
The Expanding Polytope Algorithm in 3D.
Implementations
pub fn project_origin<G>(
&mut self,
m: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
g: &G,
simplex: &VoronoiSimplex
) -> Option<OPoint<f32, Const<3_usize>>> where
G: SupportMap + ?Sized,
pub fn project_origin<G>(
&mut self,
m: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
g: &G,
simplex: &VoronoiSimplex
) -> Option<OPoint<f32, Const<3_usize>>> where
G: SupportMap + ?Sized,
Projects the origin on boundary of the given shape.
The origin is assumed to be inside of the shape. If it is outside
use the GJK algorithm instead.
Return None
if the origin is not inside of the shape or if
the EPA algorithm failed to compute the projection.
Return the projected point in the local-space of g
.
pub fn closest_points<G1, G2>(
&mut self,
pos12: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
g1: &G1,
g2: &G2,
simplex: &VoronoiSimplex
) -> Option<(OPoint<f32, Const<3_usize>>, OPoint<f32, Const<3_usize>>, Unit<Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>>)> where
G1: SupportMap + ?Sized,
G2: SupportMap + ?Sized,
pub fn closest_points<G1, G2>(
&mut self,
pos12: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
g1: &G1,
g2: &G2,
simplex: &VoronoiSimplex
) -> Option<(OPoint<f32, Const<3_usize>>, OPoint<f32, Const<3_usize>>, Unit<Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>>)> where
G1: SupportMap + ?Sized,
G2: SupportMap + ?Sized,
Projects the origin on a shape unsing the EPA algorithm.
The origin is assumed to be located inside of the shape.
Returns None
if the EPA fails to converge or if g1
and g2
are not penetrating.
Auto Trait Implementations
impl RefUnwindSafe for EPA
impl UnwindSafe for EPA
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more