Struct half_edge_mesh::vert::Vert[][src]

pub struct Vert {
    pub edge: EdgePtr,
    pub pos: Point3<f32>,
    pub id: u32,
}

Fields

Methods

impl Vert
[src]

All structure of the mesh revolves around vertex positions and their connectivity. (Faces are just an abstraction). All vertices must therefore have a concrete position.

Vertex connected to an existing edge

Important traits for VertAdjacentVertIterator

Important: Iterates over the vertices connected to a vertex in clockwise order

Important traits for VertAdjacentEdgeIterator

Important: Iterates over the edges connected to a vertex in clockwise order

Important traits for VertAdjacentFaceIterator

Important: Iterates over the faces connected to a vertex in clockwise order

Trait Implementations

impl Debug for Vert
[src]

Formats the value using the given formatter. Read more

impl PartialEq<Vert> for Vert
[src]

This method tests for self and other values to be equal, and is used by ==. Read more

This method tests for !=.

impl Eq for Vert
[src]

impl Hash for Vert
[src]

Feeds this value into the given [Hasher]. Read more

Feeds a slice of this type into the given [Hasher]. Read more

Auto Trait Implementations

impl !Send for Vert

impl !Sync for Vert