pub struct MeshStats {
pub n_vertices: usize,
pub n_triangles: usize,
pub n_edges: usize,
pub avg_edge_length: f64,
pub min_edge_length: f64,
pub max_edge_length: f64,
pub avg_quality: f64,
pub min_quality: f64,
}Expand description
Mesh simplification statistics.
Fields§
§n_vertices: usizeNumber of vertices.
n_triangles: usizeNumber of triangles.
n_edges: usizeNumber of edges.
avg_edge_length: f64Average edge length.
min_edge_length: f64Minimum edge length.
max_edge_length: f64Maximum edge length.
avg_quality: f64Average triangle quality.
min_quality: f64Minimum triangle quality.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for MeshStats
impl RefUnwindSafe for MeshStats
impl Send for MeshStats
impl Sync for MeshStats
impl Unpin for MeshStats
impl UnsafeUnpin for MeshStats
impl UnwindSafe for MeshStats
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.