pub struct EPA { /* private fields */ }Expand description
The Expanding Polytope Algorithm in 2D.
Implementations§
source§impl EPA
impl EPA
sourcepub fn project_origin<G>(
&mut self,
m: &Isometry<Real>,
g: &G,
simplex: &VoronoiSimplex
) -> Option<Point<Real>>where
G: SupportMap + ?Sized,
pub fn project_origin<G>(
&mut self,
m: &Isometry<Real>,
g: &G,
simplex: &VoronoiSimplex
) -> Option<Point<Real>>where
G: SupportMap + ?Sized,
Projects the origin on boundary 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.
sourcepub fn closest_points<G1, G2>(
&mut self,
pos12: &Isometry<Real>,
g1: &G1,
g2: &G2,
simplex: &VoronoiSimplex
) -> Option<(Point<Real>, Point<Real>, Unit<Vector<Real>>)>
pub fn closest_points<G1, G2>( &mut self, pos12: &Isometry<Real>, g1: &G1, g2: &G2, simplex: &VoronoiSimplex ) -> Option<(Point<Real>, Point<Real>, Unit<Vector<Real>>)>
Projects the origin on a shape using 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.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for EPA
impl RefUnwindSafe for EPA
impl Send for EPA
impl Sync for EPA
impl Unpin for EPA
impl UnwindSafe for EPA
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> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn 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.source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
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.source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moresource§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.