Struct Triangle3 

pub struct Triangle3 {
    pub a: Point3,
    pub b: Point3,
    pub c: Point3,
}

A three-dimensional triangle.

Corner order defines the winding, and therefore the sign of normal. A degenerate triangle – collinear or coincident corners – is representable on purpose: whether that is an error depends on the caller’s tolerance, so the decision belongs to the algorithm consuming it.

Fields

a: Point3

First corner.

b: Point3

Second corner.

c: Point3

Third corner.

Implementations

impl Triangle3

pub const fn new(a: Point3, b: Point3, c: Point3) -> Self

Construct a triangle without validating it.

pub fn normal(&self) -> Vec3

Unnormalized right-handed normal.

Left unnormalized because its magnitude is twice the triangle area, so callers that need area get it without a second cross product, and callers that need a direction normalize explicitly against their own tolerance. A degenerate triangle yields a zero vector rather than a NaN-bearing unit vector.

pub fn area(&self) -> Scalar

Triangle area, always non-negative.

pub fn centroid(&self) -> Point3

Centroid of the three corners.

Trait Implementations

impl Clone for Triangle3

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Triangle3

impl Debug for Triangle3

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

Formats the value using the given formatter.

impl PartialEq for Triangle3

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Triangle3