Struct Convex 

pub struct Convex {
    pub sides: Vec<(Vector2, Scalar)>,
}

A convex polygon, as the half-planes it is the intersection of: each an outward normal n and an offset c, the polygon lying where n · p ≤ c. What a box drawn on screen covers of a plane it looks at.

Fields

sides: Vec<(Vector2, Scalar)>

Implementations

impl Convex

pub fn new(corners: &[Vector2]) -> Option<Self>

The convex polygon of corners, in order either way round. None where they could enclose no area: fewer than three, or all on a line. Corners that do not go round convexly are no convex polygon, and give one that contains less than they do.

pub fn past<'a>(&'a self, p: &'a Vector2) -> impl Iterator<Item = Scalar> + 'a

How far p lies past each side, along its normal (not normalized): positive outside it.

pub fn could_contain(&self, p: &Vector2) -> bool

Whether p could lie in the polygon, its boundary included: past no side definitely.

Trait Implementations

impl Clone for Convex

fn clone(&self) -> Convex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Convex

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

Formats the value using the given formatter.

impl PartialEq for Convex

fn eq(&self, other: &Convex) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Convex