Struct HalfEdgeFaceImpl 

pub struct HalfEdgeFaceImpl<T: HalfEdgeImplMeshType> { /* private fields */ }

A face in a mesh.

If you want to handle a non-orientable mesh, you have to use double covering.

Also, if you have inner components, you have to use multiple faces!

Implementations

impl<T: HalfEdgeImplMeshType> HalfEdgeFaceImpl<T>

pub fn new(edge: T::E, curved: bool, payload: T::FP) -> Self

Creates a new face.

Trait Implementations

impl<T: Clone + HalfEdgeImplMeshType> Clone for HalfEdgeFaceImpl<T>

where T::F: Clone, T::E: Clone, T::FP: Clone,

fn clone(&self) -> HalfEdgeFaceImpl<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: HalfEdgeImplMeshType> Debug for HalfEdgeFaceImpl<T>

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

Formats the value using the given formatter.

impl<T: HalfEdgeImplMeshType> Default for HalfEdgeFaceImpl<T>

where T::FP: DefaultFacePayload,

fn default() -> Self

Creates a deleted face

impl<T: HalfEdgeImplMeshType> Deletable<<T as MeshType>::F> for HalfEdgeFaceImpl<T>

fn delete(&mut self)

Marks the element as deleted.

fn is_deleted(&self) -> bool

Returns whether the element is deleted.

fn set_id(&mut self, id: T::F)

Sets the id of the element (un-deletes it).

fn allocate() -> Self

Allocates a new, “deleted” instance (it isn’t valid)

impl<T: HalfEdgeImplMeshType> Face for HalfEdgeFaceImpl<T>

type T = T

Associated mesh type

fn triangle_touches_boundary( &self, mesh: &T::Mesh, v0: T::V, v1: T::V, v2: T::V, ) -> Option<bool>

Whether a triangle shares a halfedge with the face.

fn centroid<const D: usize>( &self, mesh: &<Self::T as MeshType>::Mesh, ) -> <Self::T as EuclideanMeshType<D>>::Vec

where Self::T: EuclideanMeshType<D>,

Naive method to get the center of the face by averaging the vertices.

impl<T: HalfEdgeImplMeshType + MeshType3D> Face3d<T> for HalfEdgeFaceImpl<T>

fn vertices_crossed<'a>( &'a self, mesh: &'a T::Mesh, ) -> impl Iterator<Item = T::Vec> + 'a + Clone + ExactSizeIterator

where T::Vertex: 'a,

Get an iterator over the cross products of the vertices of the face.

fn is_convex(&self, mesh: &T::Mesh) -> bool

Whether the face is convex. Ignores order.

fn is_planar(&self, mesh: &T::Mesh, eps: T::S) -> bool

Whether the face is planar.

fn is_planar2(&self, mesh: &T::Mesh) -> bool

Whether the face is planar.

fn has_self_intersections(&self, mesh: &T::Mesh) -> bool

Whether the face is self-intersecting. This is a quite slow O(n^2) method. Use with caution.

fn is_simple(&self, mesh: &T::Mesh) -> bool

Whether the face is simple, i.e., doesn’t self-intersect or have holes. Testing this is quite slow O(n^2). Use with caution.

fn normal_naive(&self, mesh: &T::Mesh) -> T::Vec

A fast methods to get the surface normal, but will only work for convex faces.

fn normal(&self, mesh: &T::Mesh) -> T::Vec

Get the normal of the face. Assumes the face is planar. Uses Newell’s method to handle concave faces. PERF: Why not faster? Can’t we find the normal using 3 vertices?

fn vertices_2d<'a>( &'a self, mesh: &'a T::Mesh, ) -> impl Iterator<Item = (T::Vec2, T::V)> + Clone + ExactSizeIterator + 'a

Get an iterator over the 2d vertices of the face rotated to the XY plane.

fn vec2s<'a>(&'a self, mesh: &'a T::Mesh) -> Vec<IndexedVertex2D<T::V, T::Vec2>>

Get a vector of 2d vertices of the face rotated to the XY plane.

fn as_polygon(&self, mesh: &T::Mesh) -> T::Poly

Returns the polygon of the face rotated to the XY plane.

impl<T: HalfEdgeImplMeshType> FaceBasics<T> for HalfEdgeFaceImpl<T>

fn edge(&self, mesh: &T::Mesh) -> T::Edge

Returns an edge incident to the face.

fn edge_id(&self) -> T::E

Returns the id of a half-edge incident to the face.

fn set_edge(&mut self, edge: T::E)

Sets the representative edge incident to the face.

fn id(&self) -> T::F

Returns the index of the face.

fn may_be_curved(&self) -> bool

Whether the face is allowed to be curved.

fn num_edges(&self, mesh: &T::Mesh) -> usize

Get the number of edges of the face.

fn num_vertices(&self, mesh: &T::Mesh) -> usize

Get the number of vertices of the face.

fn num_triangles(&self, mesh: &T::Mesh) -> usize

Get the number of triangles of the face. (n-2)*3

fn payload(&self) -> &T::FP

Returns the face payload.

fn payload_mut(&mut self) -> &mut T::FP

Returns a mutable reference to the face payload.

fn vertices<'a>( &'a self, mesh: &'a T::Mesh, ) -> impl Iterator<Item = T::Vertex> + 'a + Clone + ExactSizeIterator

Iterates all vertices adjacent to the face

fn edges<'a>(&'a self, mesh: &'a T::Mesh) -> ForwardEdgeIterator<'a, T>

Iterates all half-edges incident to the face

fn vertex_ids<'a>( &'a self, mesh: &'a T::Mesh, ) -> impl Iterator<Item = T::V> + 'a

where T: 'a,

Iterates all vertex ids adjacent to the face

fn has_holes(&self) -> bool

Whether the face has holes. The data structure (currently!) cannot represent holes, so this is always false.

fn edge_ids<'a>(&'a self, mesh: &'a T::Mesh) -> impl Iterator<Item = T::E> + 'a

where T: 'a,

Iterates all half-edge ids incident to the face

impl<T: Hash + HalfEdgeImplMeshType> Hash for HalfEdgeFaceImpl<T>

where T::F: Hash, T::E: Hash, T::FP: Hash,

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: Copy + HalfEdgeImplMeshType> Copy for HalfEdgeFaceImpl<T>

where T::F: Copy, T::E: Copy, T::FP: Copy,