Struct libreda_db::layout::prelude::SimplePolygon

pub struct SimplePolygon<T> where
    T: CoordinateType,  {
    pub points: Vec<Point<T>, Global>,
}

A SimplePolygon is a polygon defined by vertices. It does not contain holes but can be self-intersecting.

TODO: Implement Deref for accessing the vertices.

Fields

points: Vec<Point<T>, Global>

Vertices of the polygon.

Implementations

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

pub fn new(points: Vec<Point<T>, Global>) -> SimplePolygon<T>

Create a new polygon from a list of points.

The orientation of the points is normalized to counter-clock-wise.

pub fn new_raw(points: Vec<Point<T>, Global>) -> SimplePolygon<T>

Create a new polygon from a list of points. The points are taken as they are, without reordering or simplification.

pub fn from_rect(rect: &Rect<T>) -> SimplePolygon<T>

Create a new simple polygon from a rectangle.

pub fn empty() -> SimplePolygon<T>

Create empty polygon without any vertices.

pub fn len(&self) -> usize

Get the number of vertices.

pub fn iter(&self) -> Iter<'_, Point<T>>

Shortcut for self.points.iter().

pub fn convex_hull(&self) -> SimplePolygon<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 edges(&self) -> Vec<Edge<T>, Global>

Get all exterior edges of the polygon.

Examples

use iron_shapes::simple_polygon::SimplePolygon;
use iron_shapes::edge::Edge;
let coords = vec![(0, 0), (1, 0)];

let poly = SimplePolygon::from(coords);

assert_eq!(poly.edges(), vec![Edge::new((0, 0), (1, 0)), Edge::new((1, 0), (0, 0))]);

pub fn is_rectilinear(&self) -> bool

Test if all edges are parallel to the x or y axis.

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

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

Examples

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

let poly = SimplePolygon::from(coords);

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

pub fn orientation(&self) -> Orientation

Get the orientation of the polygon, i.e. check if it is wound clock-wise or counter-clock-wise.

Examples

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

let poly = SimplePolygon::from(coords);

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

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for SimplePolygon<T> where
    T: CoordinateType + Deserialize<'de>, 

pub fn deserialize<__D>(
    __deserializer: __D
) -> Result<SimplePolygon<T>, <__D as Deserializer<'de>>::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<T> DoubledOrientedArea<T> for SimplePolygon<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::traits::DoubledOrientedArea;
use iron_shapes::simple_polygon::SimplePolygon;
let coords = vec![(0, 0), (3, 0), (3, 1)];

let poly = SimplePolygon::from(coords);

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

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<I, T, P> From<I> for SimplePolygon<T> where
    T: CoordinateType,
    I: IntoIterator<Item = P>,
    Point<T>: From<P>, 

Create a polygon from a type that is convertible into an iterator of values convertible to Points.

pub fn from(iter: I) -> SimplePolygon<T>

Performs the conversion.

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

pub fn from(x: SimplePolygon<T>) -> Geometry<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> FromIterator<P> for SimplePolygon<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) -> SimplePolygon<T> where
    I: IntoIterator<Item = P>, 

Creates a value from an iterator.

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

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

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

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

Point wise transformation.

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

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

Equality test for simple polygons.

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

Complexity: O(n^2)

TODO: Normalized ordering of vertices for faster comparison.

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

This method tests for !=.

impl<T> Serialize for SimplePolygon<T> where
    T: CoordinateType + Serialize, 

pub fn serialize<__S>(
    &self,
    __serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<T> TryBoundingBox<T> for SimplePolygon<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 SimplePolygon<T> where
    T: CoordinateType + NumCast,
    Dst: CoordinateType + NumCast, 

type Output = SimplePolygon<Dst>

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

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

Try to cast to target data type.

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

Cast to target data type.

impl<T> WindingNumber<T> for SimplePolygon<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

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.

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.

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

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