pub struct ScatteredFit {
pub surface: BSplineSurface,
pub parameters: Vec<(f64, f64)>,
pub sigma: f64,
pub cross_sigma: f64,
pub worst: (usize, f64),
pub spans: (usize, usize),
pub ended: Ended,
}Expand description
What fit_surface_scattered_over produced.
Fields§
§surface: BSplineSurfaceThe surface, over the unit square.
parameters: Vec<(f64, f64)>Each point’s parameters: its nearest point on the surface, found from where the seed put it. The distances reported are to these.
sigma: f64The root mean square distance from the points to the surface.
cross_sigma: f64The root mean square distance from each point to a fit, over the
same knots and fairing, of the other half of the points (alternate
points, by index). A fit that follows the shape predicts the points
it did not see about as closely as those it did; a fit that follows
the noise predicts them worse, and this stands well above
sigma.
worst: (usize, f64)The point farthest from the surface: its index and its distance.
spans: (usize, usize)The knot spans, u then v.
ended: EndedWhy refinement stopped.
Implementations§
Trait Implementations§
Source§impl Clone for ScatteredFit
impl Clone for ScatteredFit
Source§impl Debug for ScatteredFit
impl Debug for ScatteredFit
Source§impl PartialEq for ScatteredFit
impl PartialEq for ScatteredFit
impl StructuralPartialEq for ScatteredFit
Auto Trait Implementations§
impl Freeze for ScatteredFit
impl RefUnwindSafe for ScatteredFit
impl Send for ScatteredFit
impl Sync for ScatteredFit
impl Unpin for ScatteredFit
impl UnsafeUnpin for ScatteredFit
impl UnwindSafe for ScatteredFit
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.