pub struct ConvexPolygon<T>where
    T: Scalar,
{ /* private fields */ }

Implementations§

source§

impl<T> ConvexPolygon<T>where
    T: Scalar,

source

pub fn from_vertices(vertices: Vec<Point2<T>>) -> ConvexPolygon<T>

Construct a new convex polygon from the given vertices, assumed to be ordered in a counter-clockwise way such that (i, i + 1) forms an edge between vertex i and i + 1.

It is assumed that the polygon is convex.

source

pub fn vertices(&self) -> &[Point2<T>]

source

pub fn num_edges(&self) -> usize

Returns the number of edges in the polygon. Note that a single point has 1 edge, pointing from itself to itself, a line segment has two edges, and in general the number of edges is equal to the number of vertices.

source

pub fn edges(&self) -> impl Iterator<Item = (&Point2<T>, &Point2<T>)>

source

pub fn is_empty(&self) -> bool

source

pub fn is_point(&self) -> bool

source

pub fn is_line_segment(&self) -> bool

source§

impl<T> ConvexPolygon<T>where
    T: Real,

source

pub fn half_planes<'a>(&'a self) -> impl Iterator<Item = HalfPlane<T>> + 'a

Iterates over the half planes that define the polygon.

Every non-degenerate polygon can be represented by the intersection of a finite number of closed half-planes.

If the polygon is degenerate, the intersection of the half planes returned by this method will in general not be sufficient to describe the polygon.

source

pub fn contains_point(&self, point: &Point2<T>) -> bool

Determines if the (closed) convex polygon contains the given point.

source

pub fn intersect_halfplane(&self, half_plane: &HalfPlane<T>) -> ConvexPolygon<T>

Computes the intersection with the current polygon and the given half plane, and returns a new polygon that holds the result.

Note: No steps have been made to make this routine numerically robust. TODO: Make numerically robust?

source

pub fn intersect_polygon(&self, other: &ConvexPolygon<T>) -> Self

Computes the intersection of this polygon and the given convex polygon.

source

pub fn triangulate<'a>(&'a self) -> impl Iterator<Item = Triangle2d<T>> + 'a

Splits the convex polygon into a set of disjoint triangles that exactly cover the area of the polygon.

source

pub fn triangulate_into_vec(&self) -> Vec<Triangle2d<T>>

Trait Implementations§

source§

impl<T> Clone for ConvexPolygon<T>where
    T: Scalar + Clone,

source§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<T> Debug for ConvexPolygon<T>where
    T: Scalar + Debug,

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<T> From<ConvexPolygon<T>> for SimplePolygon2d<T>where
    T: Scalar,

source§

fn from(poly: ConvexPolygon<T>) -> Self

Converts to this type from the input type.
source§

impl<T> From<LineSegment<T, Const<2>>> for ConvexPolygon<T>where
    T: Scalar,

source§

fn from(segment: LineSegment2d<T>) -> Self

Converts to this type from the input type.
source§

impl<T> From<Triangle<T, Const<2>>> for ConvexPolygon<T>where
    T: Scalar,

source§

fn from(triangle: Triangle2d<T>) -> Self

Converts to this type from the input type.
source§

impl<T> PartialEq<ConvexPolygon<T>> for ConvexPolygon<T>where
    T: Scalar + PartialEq,

source§

fn eq(&self, other: &ConvexPolygon<T>) -> bool

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<T> TryFrom<Quad2d<T>> for ConvexPolygon<T>where
    T: Real,

§

type Error = ConcavePolygonError

The type returned in the event of a conversion error.
source§

fn try_from(value: Quad2d<T>) -> Result<Self, Self::Error>

Performs the conversion.
source§

impl<T> Eq for ConvexPolygon<T>where
    T: Scalar + Eq,

source§

impl<T> StructuralEq for ConvexPolygon<T>where
    T: Scalar,

source§

impl<T> StructuralPartialEq for ConvexPolygon<T>where
    T: Scalar,

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for ConvexPolygon<T>where
    T: RefUnwindSafe,

§

impl<T> Send for ConvexPolygon<T>where
    T: Send,

§

impl<T> Sync for ConvexPolygon<T>where
    T: Sync,

§

impl<T> Unpin for ConvexPolygon<T>where
    T: Unpin,

§

impl<T> UnwindSafe for ConvexPolygon<T>where
    T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere
    T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere
    T: ?Sized,

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere
    T: ?Sized,

const: unstable · source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere
    U: From<T>,

const: unstable · source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SPwhere
    SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T> ToOwned for Twhere
    T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere
    U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
const: unstable · source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere
    U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
const: unstable · source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> Scalar for Twhere
    T: 'static + Clone + PartialEq<T> + Debug,