pub struct FillReport {
pub faces: Range<u32>,
pub vertices: Range<u32>,
pub loops: usize,
pub flattened: usize,
pub largest_bend: f64,
}Expand description
What a fill made.
Fields§
§faces: Range<u32>The faces made, numbered after every face there was.
vertices: Range<u32>The vertices the refinement made, numbered after every vertex there was. Empty without refinement.
loops: usizeThe loops the rim was parted into at the points it passes more than once, each filled on its own: one for a rim passing every point once.
flattened: usizeHow many of the loops were longer than OPTIMAL_UP_TO edges, and
were flattened and ear-clipped.
largest_bend: f64The largest bend, in radians, of the triangulation before refinement. A bend is the angle between the normals of two faces across an edge of the triangulation, rim edges included. For loops triangulated optimally, no triangulation of them bends less.
Trait Implementations§
Source§impl Clone for FillReport
impl Clone for FillReport
Source§impl Debug for FillReport
impl Debug for FillReport
Source§impl PartialEq for FillReport
impl PartialEq for FillReport
impl StructuralPartialEq for FillReport
Auto Trait Implementations§
impl Freeze for FillReport
impl RefUnwindSafe for FillReport
impl Send for FillReport
impl Sync for FillReport
impl Unpin for FillReport
impl UnsafeUnpin for FillReport
impl UnwindSafe for FillReport
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.