Struct collision::primitive::ConvexPolygon

pub struct ConvexPolygon<S> {
    pub vertices: Vec<Point2<S>>,
}

Convex polygon primitive.

Can contain any number of vertices, but a high number of vertices will affect performance of course. Vertices need to be in CCW order.

Fields

vertices: Vec<Point2<S>>

Vertices of the convex polygon.

Methods

impl<S> ConvexPolygon<S>

fn new(vertices: Vec<Point2<S>>) -> Self

Create a new convex polygon from the given vertices. Vertices need to be in CCW order.

Trait Implementations

impl<S: Debug> Debug for ConvexPolygon<S>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<S: Clone> Clone for ConvexPolygon<S>

fn clone(&self) -> ConvexPolygon<S>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S: PartialEq> PartialEq for ConvexPolygon<S>

fn eq(&self, __arg_0: &ConvexPolygon<S>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &ConvexPolygon<S>) -> bool

This method tests for !=.

impl<S> Primitive for ConvexPolygon<S> where
    S: BaseFloat, 

type Point = Point2<S>

Point type

fn support_point<T>(&self, direction: &Vector2<S>, transform: &T) -> Point2<S> where
    T: Transform<Point2<S>>, 

Get the support point on the shape in a given direction.

impl<S> ComputeBound<Aabb2<S>> for ConvexPolygon<S> where
    S: BaseFloat, 

fn compute_bound(&self) -> Aabb2<S>

Compute the bounding volume

impl<S> Discrete<Ray2<S>> for ConvexPolygon<S> where
    S: BaseFloat, 

fn intersects(&self, ray: &Ray2<S>) -> bool

Ray must be in object space

impl<S> Continuous<Ray2<S>> for ConvexPolygon<S> where
    S: BaseFloat, 

type Result = Point2<S>

Result returned by the intersection test

fn intersection(&self, ray: &Ray2<S>) -> Option<Point2<S>>

Ray must be in object space