Skip to main content

HalfEdgeMesh

Struct HalfEdgeMesh 

Source
pub struct HalfEdgeMesh {
    pub vertices: Vec<[f64; 3]>,
    pub half_edges: Vec<HalfEdge>,
    pub face_starts: Vec<usize>,
}
Expand description

A half-edge mesh structure for efficient topological queries.

Fields§

§vertices: Vec<[f64; 3]>

Vertex positions.

§half_edges: Vec<HalfEdge>

Half-edges.

§face_starts: Vec<usize>

For each face, the index of one of its half-edges.

Implementations§

Source§

impl HalfEdgeMesh

Source

pub fn from_triangle_mesh(verts: &[[f64; 3]], tris: &[[usize; 3]]) -> Self

Build a half-edge mesh from a triangle mesh given as vertices + face indices.

Source

pub fn n_faces(&self) -> usize

Return the number of faces.

Source

pub fn n_vertices(&self) -> usize

Return the number of vertices.

Source

pub fn face_vertices(&self, fi: usize) -> [usize; 3]

Return the three vertex indices for face fi.

Source

pub fn face_area(&self, fi: usize) -> f64

Compute the area of face fi.

Source

pub fn boundary_half_edges(&self) -> Vec<usize>

Return all boundary edges (half-edges with no twin).

Source

pub fn is_manifold(&self) -> bool

Check whether the mesh is manifold (every edge has exactly one twin).

Source

pub fn new() -> Self

Create an empty half-edge mesh.

Source

pub fn add_vertex(&mut self, pos: [f64; 3]) -> usize

Add a vertex to the mesh. Returns the vertex index.

Source

pub fn add_triangle(&mut self, v0: usize, v1: usize, v2: usize) -> usize

Add a triangle face (given vertex indices). Returns the face index.

Rebuild twin half-edge links from scratch.

Source

pub fn num_faces(&self) -> usize

Alias for n_faces().

Source

pub fn face_count(&self) -> usize

Alias for n_faces().

Source

pub fn vertex_count(&self) -> usize

Alias for n_vertices().

Source

pub fn active_vertex_count(&self) -> usize

Alias for n_vertices() (no deletion tracking in this implementation).

Source

pub fn active_face_count(&self) -> usize

Alias for n_faces() (no deletion tracking in this implementation).

Source

pub fn face_normal(&self, fi: usize) -> [f64; 3]

Compute the unit normal for face fi.

Source

pub fn face_centroid(&self, fi: usize) -> [f64; 3]

Compute the centroid of face fi.

Source

pub fn boundary_edges(&self) -> Vec<(usize, usize)>

Return boundary edges as (from_vertex, to_vertex) pairs.

Source

pub fn boundary_loops(&self) -> Vec<Vec<usize>>

Group boundary edges into connected loops (lists of vertex indices).

Source

pub fn is_boundary_vertex(&self, v: usize) -> bool

Check whether vertex v is on the boundary (has at least one boundary half-edge).

Source

pub fn vertex_neighbors(&self, v: usize) -> Vec<usize>

Find all vertex neighbors of vertex v (vertices connected by an edge).

Source

pub fn extract_triangles(&self) -> (Vec<[f64; 3]>, Vec<[usize; 3]>)

Extract the mesh as (vertices, triangles) arrays.

Trait Implementations§

Source§

impl Default for HalfEdgeMesh

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.