Skip to main content

MeshQuality

Struct MeshQuality 

Source
pub struct MeshQuality;
Expand description

Additional triangle mesh quality metrics.

Implementations§

Source§

impl MeshQuality

Source

pub fn compute_dihedral_angle( ea: [f32; 3], eb: [f32; 3], p0: [f32; 3], p1: [f32; 3], ) -> f32

Compute the dihedral angle (in degrees) between two adjacent triangles sharing an edge defined by vertices ea and eb.

The first triangle is (ea, eb, p0) and the second is (ea, eb, p1). Returns the angle between their face normals, in the range [0°, 180°].

Source

pub fn compute_edge_length_ratio( v0: [f32; 3], v1: [f32; 3], v2: [f32; 3], ) -> f32

Compute the edge-length ratio (max edge / min edge) for a triangle.

A value of 1 indicates an equilateral triangle. Returns f32::INFINITY if the minimum edge length is effectively zero (degenerate triangle).

Source

pub fn compute_mesh_regularity(mesh: &TriangleMesh) -> f32

Compute a global mesh regularity score in [0, 1].

Regularity is defined as:

R = 1 / (1 + sigma)

where sigma is the standard deviation of the per-triangle aspect ratios. A perfectly regular mesh (all equilateral triangles) has sigma = 0R = 1. A highly irregular mesh has large sigmaR → 0.

Returns 1.0 for an empty mesh.

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.