Struct libreda_pnr::db::Polygon

pub struct Polygon<T> where
    T: CoordinateType,  {
    pub exterior: SimplePolygon<T>,
    pub interiors: Vec<SimplePolygon<T>, Global>,
}

A polygon possibly with holes. The polygon is defined by a hull and a list of holes which are both SimplePolygons.

Fields

exterior: SimplePolygon<T>

The outer hull of the polygon.

interiors: Vec<SimplePolygon<T>, Global>

A list of holes in the polygon.

Implementations

impl<T> Polygon<T> where
    T: CoordinateType, 

pub fn new<I>(i: I) -> Polygon<T> where
    I: Into<Polygon<T>>, 

Create a new polygon from a sequence of points.

pub fn empty() -> Polygon<T>

Create empty polygon without any vertices.

pub fn new_with_holes<E, I>(exterior: E, holes: Vec<I, Global>) -> Polygon<T> where
    I: Into<SimplePolygon<T>>,
    E: Into<SimplePolygon<T>>, 

Create a new polygon from a hull and a list of holes.

pub fn len(&self) -> usize

Get the number of vertices.

pub fn edges(&self) -> Vec<Edge<T>, Global>

Get all exterior edges of the polygon.

pub fn convex_hull(&self) -> Polygon<T> where
    T: Ord, 

Get the convex hull of the polygon.

Implements Andrew's Monotone Chain algorithm. See: http://geomalgorithms.com/a10-_hull-1.html

pub fn lower_left_vertex(&self) -> Point<T>

Get the vertex with lowest x-coordinate of the exterior polygon. Prefer lower y-coordinates to break ties.

Examples

use iron_shapes::polygon::Polygon;
use iron_shapes::point::Point;
let coords = vec![(0, 0), (1, 0), (-1, 2), (-1, 1)];

let poly = Polygon::new(coords);

assert_eq!(poly.lower_left_vertex(), Point::new(-1, 1));

pub fn orientation(&self) -> Orientation

Get the orientation of the exterior polygon.

Examples

use iron_shapes::polygon::Polygon;
use iron_shapes::point::Point;
use iron_shapes::types::Orientation;
let coords = vec![(0, 0), (3, 0), (3, 1)];

let poly = Polygon::new(coords);

assert_eq!(poly.orientation(), Orientation::CounterClockWise);

Trait Implementations

impl<T> Clone for Polygon<T> where
    T: Clone + CoordinateType, 

pub fn clone(&self) -> Polygon<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<T> DoubledOrientedArea<T> for Polygon<T> where
    T: CoordinateType, 

pub fn area_doubled_oriented(&self) -> T

Calculates the doubled oriented area.

Using doubled area allows to compute in the integers because the area of a polygon with integer coordinates is either integer or half-integer.

The area will be positive if the vertices are listed counter-clockwise, negative otherwise.

Complexity: O(n)

Examples

use iron_shapes::polygon::{Polygon, DoubledOrientedArea};
let coords = vec![(0, 0), (3, 0), (3, 1)];

let poly = Polygon::new(coords);

assert_eq!(poly.area_doubled_oriented(), 3);

impl<T> Eq for Polygon<T> where
    T: Eq + CoordinateType, 

impl<'_, T> From<&'_ Rect<T>> for Polygon<T> where
    T: CoordinateType, 

Create a polygon from a rectangle.

pub fn from(rect: &Rect<T>) -> Polygon<T>

Performs the conversion.

impl<'_, T> From<&'_ SimplePolygon<T>> for Polygon<T> where
    T: CoordinateType, 

Create a polygon from a simple polygon.

pub fn from(simple_polygon: &SimplePolygon<T>) -> Polygon<T>

Performs the conversion.

impl<'a, T, P> From<&'a Vec<P, Global>> for Polygon<T> where
    T: CoordinateType,
    Point<T>: From<&'a P>, 

Create a polygon from a Vec of values convertible to Points.

pub fn from(vec: &'a Vec<P, Global>) -> Polygon<T>

Performs the conversion.

impl<T> From<Polygon<T>> for Geometry<T> where
    T: CoordinateType, 

pub fn from(x: Polygon<T>) -> Geometry<T>

Performs the conversion.

impl<T> From<Rect<T>> for Polygon<T> where
    T: CoordinateType, 

Create a polygon from a rectangle.

pub fn from(rect: Rect<T>) -> Polygon<T>

Performs the conversion.

impl<T> From<SimplePolygon<T>> for Polygon<T> where
    T: CoordinateType, 

Create a polygon from a simple polygon.

pub fn from(simple_polygon: SimplePolygon<T>) -> Polygon<T>

Performs the conversion.

impl<T, P> From<Vec<P, Global>> for Polygon<T> where
    T: CoordinateType,
    Point<T>: From<P>, 

Create a polygon from a Vec of values convertible to Points.

pub fn from(vec: Vec<P, Global>) -> Polygon<T>

Performs the conversion.

impl<T, P> FromIterator<P> for Polygon<T> where
    T: CoordinateType,
    P: Into<Point<T>>, 

Create a polygon from a iterator of values convertible to Points.

pub fn from_iter<I>(iter: I) -> Polygon<T> where
    I: IntoIterator<Item = P>, 

Creates a value from an iterator.

impl<T> Hash for Polygon<T> where
    T: Hash + CoordinateType, 

pub fn hash<__H>(&self, state: &mut __H) where
    __H: Hasher, 

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<T> Into<Polygon<T>> for Geometry<T> where
    T: CoordinateType + NumCast, 

pub fn into(self) -> Polygon<T>

Convert a geometry into a polygon.

impl<T> MapPointwise<T> for Polygon<T> where
    T: CoordinateType, 

pub fn transform<F>(&self, tf: F) -> Polygon<T> where
    F: Fn(Point<T>) -> Point<T>, 

Point wise transformation.

impl<T> PartialEq<Polygon<T>> for Polygon<T> where
    T: CoordinateType, 

pub fn eq(&self, rhs: &Polygon<T>) -> bool

Equality test for polygons.

Two polygons are equal iff a cyclic shift on their vertices can be applied such that the both lists of vertices match exactly.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T> StructuralEq for Polygon<T> where
    T: CoordinateType, 

impl<T> TryBoundingBox<T> for Polygon<T> where
    T: CoordinateType, 

pub fn try_bounding_box(&self) -> Option<Rect<T>>

Return the bounding box of this geometry if a bounding box is defined.

impl<T, Dst> TryCastCoord<T, Dst> for Polygon<T> where
    T: CoordinateType + NumCast,
    Dst: CoordinateType + NumCast, 

type Output = Polygon<Dst>

Output type of the cast. This is likely the same geometrical type just with other coordinate types.

pub fn try_cast(&self) -> Option<<Polygon<T> as TryCastCoord<T, Dst>>::Output>

Try to cast to target data type.

pub fn cast(&self) -> Self::Output

Cast to target data type.

impl<T> WindingNumber<T> for Polygon<T> where
    T: CoordinateType, 

pub fn winding_number(&self, point: Point<T>) -> isize

Calculate the winding number of the polygon around this point.

TODO: Define how point on edges and vertices is handled.

See: http://geomalgorithms.com/a03-_inclusion.html

pub fn contains_point_non_oriented(&self, point: Point<T>) -> bool

Check if point is inside the polygon, i.e. the polygons winds around the point a non-zero number of times.

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

Check if point is inside the polygon, i.e. the polygon winds around the point an odd number of times.