pub struct Smooth<'a> {
pub size: f64,
pub max_move: f64,
pub keep_edges: Option<f64>,
pub region: Option<&'a [bool]>,
}Expand description
How a mesh is smoothed.
Fields§
§size: f64How far about each vertex its neighbours are taken from.
max_move: f64The farthest a vertex may end from where it started.
keep_edges: Option<f64>The angle, in radians, beyond which a neighbour’s normal turns too
far from a vertex’s for it to count; None to count every
neighbour.
region: Option<&'a [bool]>Which vertices may move, one entry per vertex number; None for
all.
Trait Implementations§
impl<'a> Copy for Smooth<'a>
impl<'a> StructuralPartialEq for Smooth<'a>
Auto Trait Implementations§
impl<'a> Freeze for Smooth<'a>
impl<'a> RefUnwindSafe for Smooth<'a>
impl<'a> Send for Smooth<'a>
impl<'a> Sync for Smooth<'a>
impl<'a> Unpin for Smooth<'a>
impl<'a> UnsafeUnpin for Smooth<'a>
impl<'a> UnwindSafe for Smooth<'a>
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,
impl<T> Scalar for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.