Struct Polygon3

pub struct Polygon3 {
    pub vertices: Vec<Point3>,
}

A simple polygon in three-dimensional space, without holes.

The vertices are assumed coplanar and non-self-intersecting, and neither is checked here: both are tolerance-dependent judgements. The closing edge is implicit, so the last vertex joins the first and repeating it creates a zero-length edge rather than a closed ring.

Fields

vertices: Vec<Point3>

Boundary vertices in order. The closing edge is implicit.

Implementations

impl Polygon3

pub const fn new(vertices: Vec<Point3>) -> Self

Construct from boundary vertices in order.

pub fn len(&self) -> usize

Number of boundary vertices, which equals the number of edges.

pub fn is_empty(&self) -> bool

Whether the polygon has no vertices.

pub fn vector_area2(&self) -> Vec3

Twice the vector area, summed by the shoelace formula in three dimensions.

The direction is the polygon’s normal and the magnitude is twice its area, so this is the 3D analogue of the signed 2D shoelace sum. It is exact for a planar polygon and degrades gracefully for a slightly non-planar one, which is what imported data usually is.

Fewer than three vertices enclose nothing and yield a zero vector.

pub fn normal(&self) -> Vec3

Unnormalized normal implied by the vertex winding.

pub fn area(&self) -> Scalar

Polygon area, always non-negative.

Trait Implementations

impl Clone for Polygon3

fn clone(&self) -> Polygon3

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Polygon3

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

Formats the value using the given formatter.

impl PartialEq for Polygon3

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Polygon3