Struct polygon2::greiner_hormann::Polygon

pub struct Polygon<T> { /* fields omitted */ }

Implementations

impl<T> Polygon<T>

pub fn new() -> Self

impl<T> Polygon<T>

pub fn iter(&self) -> PolygonIter<T>

impl<T> Polygon<T> where
    T: Clone + Signed + PartialEq + PartialOrd,
    &'a T: Div<&'b T, Output = T> + Sub<&'b T, Output = T> + Add<&'b T, Output = T> + Mul<&'b T, Output = T>, 

pub fn add(&mut self, vertex: *mut Vertex<T>)

pub fn insert(
    &mut self,
    vertex: *mut Vertex<T>,
    start: *mut Vertex<T>,
    end: *mut Vertex<T>
)

Insert and sort a vertex between a specified pair of vertices

pub fn next(&self, vertex: *mut Vertex<T>) -> *mut Vertex<T>

Return the next non intersecting vertex after the one specified

pub fn first_intersect(&self) -> *mut Vertex<T>

Return the first unchecked intersection point in the polygon

pub fn points(&self) -> Vec<[T; 2]>

Return the polygon points as a list of points, in counter clock wise order clear consecutive equals points

pub fn points_rev(&self) -> Vec<[T; 2]>

pub fn unprocessed(&self) -> bool

Check if an unchecked intersection remain in the polygon

pub fn phase_one(&mut self, polygon: &mut Polygon<T>)

pub fn phase_two(
    &mut self,
    polygon: &mut Polygon<T>,
    s_entry: bool,
    c_entry: bool
)

pub fn phase_three(&mut self, rev: bool) -> Vec<Vec<[T; 2]>>

pub fn clip(
    &mut self,
    polygon: &mut Polygon<T>,
    s_entry: bool,
    c_entry: bool,
    rev: bool
) -> Vec<Vec<[T; 2]>>

pub fn union(&mut self, polygon: &mut Polygon<T>) -> Vec<Vec<[T; 2]>>

pub fn intersection(&mut self, polygon: &mut Polygon<T>) -> Vec<Vec<[T; 2]>>

pub fn difference(&mut self, polygon: &mut Polygon<T>) -> Vec<Vec<[T; 2]>>

Trait Implementations

impl<T> Debug for Polygon<T> where
    T: Debug, 

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

Formats the value using the given formatter.

impl<T> Drop for Polygon<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<'slice, T> From<&'slice [[T; 2]]> for Polygon<T> where
    T: Clone + Zero + Signed + PartialEq + PartialOrd,
    &'a T: Div<&'b T, Output = T> + Sub<&'b T, Output = T> + Add<&'b T, Output = T> + Mul<&'b T, Output = T>, 

fn from(slice: &'slice [[T; 2]]) -> Self

Performs the conversion.