pub struct Efd<const D: usize>{ /* private fields */ }Expand description
Elliptical Fourier Descriptor coefficients. Provide transformation between discrete points and coefficients.
Start with Efd::from_curve() and its related methods.
Transformation
The transformation of normalized coefficients.
Implements Kuhl and Giardina method of normalizing the coefficients An, Bn, Cn, Dn. Performs 3 separate normalizations. First, it makes the data location invariant by re-scaling the data to a common origin. Secondly, the data is rotated with respect to the major axis. Thirdly, the coefficients are normalized with regard to the absolute value of A₁.
Please see GeoVar for more information.
Raw Coefficients
The coefficients is contained with na::Matrix, use
Efd::try_from_coeffs() to input the coefficients externally.
See also Efd::from_parts_unchecked() and Efd::into_inner() without
checking data.
Implementations§
source§impl<const D: usize> Efd<D>
impl<const D: usize> Efd<D>
sourcepub const fn from_parts_unchecked(
coeffs: Coeffs<D>,
geo: GeoVar<Rot<D>, D>
) -> Self
pub const fn from_parts_unchecked( coeffs: Coeffs<D>, geo: GeoVar<Rot<D>, D> ) -> Self
Create object from a matrix directly.
The array size is (harmonic) x (dimension x 2). The dimension is D.
Zero harmonic is allowed but meaningless. If the harmonic is zero, some operations will panic.
use efd::{Efd2, GeoVar};
let path = Efd2::from_parts_unchecked(vec![], GeoVar::identity()).generate(20);
assert_eq!(path.len(), 0);See also Efd::into_inner().
sourcepub fn try_from_coeffs(coeffs: Coeffs<D>) -> Option<Self>
pub fn try_from_coeffs(coeffs: Coeffs<D>) -> Option<Self>
Create object from a matrix with boundary check and normalization.
The array size is (harmonic) x (dimension x 2). The dimension is D.
Return none if the harmonic is zero.
sourcepub fn try_from_coeffs_unnorm(coeffs: Coeffs<D>) -> Option<Self>
pub fn try_from_coeffs_unnorm(coeffs: Coeffs<D>) -> Option<Self>
Create object from a matrix with boundary check.
The array size is (harmonic) x (dimension x 2). The dimension is D.
Return none if the harmonic is zero.
sourcepub fn from_curve<C>(curve: C, is_open: bool) -> Selfwhere
C: Curve<D>,
pub fn from_curve<C>(curve: C, is_open: bool) -> Selfwhere
C: Curve<D>,
Fully automated coefficient calculation.
- The initial harmonic number is the same as the curve point.
- Fourier Power Anaysis (FPA) uses 99.99% threshold.
Tail End Closed
If curve.first() != curve.last(), the curve will be automatically
closed when is_open is false.
Open Curve Option
The open curve option is for the curve that duplicated a reversed part of itself. For example,
let efd = efd::Efd2::from_curve(path_open, true);is equivalent to
let path_closed = path_open
.iter()
.chain(path_open.iter().rev().skip(1))
.cloned()
.collect::<Vec<_>>();
let efd = efd::Efd2::from_curve(path_closed, false);but not actually increase the data size.
Panics
Panics if the curve length is not greater than 2 in debug mode. This
function check the lengths only. Please use valid_curve() to
verify the curve if there has NaN input.
sourcepub fn from_curve_nyquist<C>(curve: C, is_open: bool) -> Selfwhere
C: Curve<D>,
pub fn from_curve_nyquist<C>(curve: C, is_open: bool) -> Selfwhere
C: Curve<D>,
Same as Efd::from_curve(), but if your sampling points are large,
use Nyquist Frequency as an initial harmonic number.
Nyquist Frequency is half of the sample number.
Please ensure the sampling points are generated from a known function and are more than enough. Otherwise, it will cause undersampling.
sourcepub fn from_curve_harmonic<C>(curve: C, is_open: bool, harmonic: usize) -> Selfwhere
C: Curve<D>,
pub fn from_curve_harmonic<C>(curve: C, is_open: bool, harmonic: usize) -> Selfwhere
C: Curve<D>,
Manual coefficient calculation.
- The initial harmonic is decide by user.
- No harmonic reduced. Please call
Efd::fourier_power_anaysis().
Panics
Panics if the specific harmonic is zero or the curve length is not
greater than 2 in the debug mode. This function check the lengths
only. Please use valid_curve() to verify the curve if there has
NaN input.
sourcepub fn from_curve_harmonic_and_get<C>(
curve: C,
is_open: bool,
harmonic: usize
) -> (Self, Vec<f64>)where
C: Curve<D>,
pub fn from_curve_harmonic_and_get<C>(
curve: C,
is_open: bool,
harmonic: usize
) -> (Self, Vec<f64>)where
C: Curve<D>,
Same as Efd::from_curve_harmonic() but get the the theta value of
each point coordinate of the curve.
See also get_target_pos() if you want to ignore the coefficients.
Panics
Please see Efd::from_curve_harmonic().
sourcepub fn from_curve_harmonic_unnorm<C>(
curve: C,
is_open: bool,
harmonic: usize
) -> Selfwhere
C: Curve<D>,
pub fn from_curve_harmonic_unnorm<C>(
curve: C,
is_open: bool,
harmonic: usize
) -> Selfwhere
C: Curve<D>,
Same as Efd::from_curve_harmonic() but without normalization.
sourcepub fn with_geo(self, geo: GeoVar<Rot<D>, D>) -> Self
pub fn with_geo(self, geo: GeoVar<Rot<D>, D>) -> Self
A builder method for changing geometric variables.
sourcepub fn fourier_power_anaysis<T>(self, threshold: T) -> Self
pub fn fourier_power_anaysis<T>(self, threshold: T) -> Self
Use Fourier Power Anaysis (FPA) to reduce the harmonic number.
The coefficient memory will be saved but cannot be used twice due to undersampling.
The default threshold is 99.99%.
Panics
Panics if the threshold is not in 0..1, or the harmonic is zero.
sourcepub fn set_harmonic(&mut self, harmonic: usize)
pub fn set_harmonic(&mut self, harmonic: usize)
Set the harmonic number of the coefficients.
Panics
Panics if the harmonic is zero or greater than the current harmonic.
sourcepub fn normalized(self) -> Self
pub fn normalized(self) -> Self
Force normalize the coefficients.
If the coefficients are constructed by *_unnorm or *_unchecked
methods, this method will normalize them.
Panics
Panics if the harmonic is zero.
sourcepub fn into_inner(self) -> (Coeffs<D>, GeoVar<Rot<D>, D>)
pub fn into_inner(self) -> (Coeffs<D>, GeoVar<Rot<D>, D>)
Consume self and return the parts of this type.
See also Efd::from_parts_unchecked().
sourcepub fn coeff(&self, harmonic: usize) -> &Kernel<D>
pub fn coeff(&self, harmonic: usize) -> &Kernel<D>
Get a view to the specific coefficients. (0..self.harmonic())
sourcepub fn coeffs_iter(&self) -> impl Iterator<Item = &Kernel<D>>
pub fn coeffs_iter(&self) -> impl Iterator<Item = &Kernel<D>>
Get an iterator over all the coefficients per harmonic.
sourcepub fn coeffs_iter_mut(&mut self) -> impl Iterator<Item = &mut Kernel<D>>
pub fn coeffs_iter_mut(&mut self) -> impl Iterator<Item = &mut Kernel<D>>
Get a mutable iterator over all the coefficients per harmonic.
sourcepub fn as_geo_mut(&mut self) -> &mut GeoVar<Rot<D>, D>
pub fn as_geo_mut(&mut self) -> &mut GeoVar<Rot<D>, D>
Get the mutable reference of geometric variables.
sourcepub fn is_valid(&self) -> bool
pub fn is_valid(&self) -> bool
Check if the coefficients are valid.
- The harmonic number must be greater than 0.
- All the coefficients must not be
NaNor zero.
It is only helpful if this object is constructed by
Efd::from_parts_unchecked().
sourcepub fn distance(&self, rhs: &Self) -> f64
pub fn distance(&self, rhs: &Self) -> f64
Calculate the L1 distance between two coefficient set.
For more distance methods, please see Distance.
sourcepub fn reverse_inplace(&mut self)
pub fn reverse_inplace(&mut self)
Reverse the order of described curve then return a mutable reference.
sourcepub fn reversed(self) -> Self
pub fn reversed(self) -> Self
Consume and return a reversed version of the coefficients. This method can avoid mutable require.
Please clone the object if you want to do self-comparison.
sourcepub fn generate(&self, n: usize) -> Vec<Coord<D>>
pub fn generate(&self, n: usize) -> Vec<Coord<D>>
Generate (reconstruct) the described curve. (theta=0~TAU)
Panics
Panics if the number of the points n is less than 2.
sourcepub fn generate_half(&self, n: usize) -> Vec<Coord<D>>
pub fn generate_half(&self, n: usize) -> Vec<Coord<D>>
Generate (reconstruct) a half of the described curve. (theta=0~PI)
Panics
Panics if the number of the points n is less than 2.
sourcepub fn generate_norm(&self, n: usize) -> Vec<Coord<D>>
pub fn generate_norm(&self, n: usize) -> Vec<Coord<D>>
Generate (reconstruct) the described curve. (theta=0~TAU)
Normalized curve is without transformation.
Panics
Panics if the number of the points n is less than 2.
sourcepub fn generate_norm_half(&self, n: usize) -> Vec<Coord<D>>
pub fn generate_norm_half(&self, n: usize) -> Vec<Coord<D>>
Generate (reconstruct) a half of the described curve. (t=0~PI)
Normalized curve is without transformation.
Panics
Panics if the number of the points n is less than 2.
sourcepub fn generate_by(&self, t: &[f64]) -> Vec<Coord<D>>
pub fn generate_by(&self, t: &[f64]) -> Vec<Coord<D>>
Generate (reconstruct) a described curve in a series of time t.
sourcepub fn generate_norm_by(&self, t: &[f64]) -> Vec<Coord<D>>
pub fn generate_norm_by(&self, t: &[f64]) -> Vec<Coord<D>>
Generate (reconstruct) a normalized curve in a series of time t.
Normalized curve is without transformation.
Trait Implementations§
Auto Trait Implementations§
impl<const D: usize> !RefUnwindSafe for Efd<D>
impl<const D: usize> !Send for Efd<D>
impl<const D: usize> !Sync for Efd<D>
impl<const D: usize> !Unpin for Efd<D>
impl<const D: usize> !UnwindSafe for Efd<D>
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
§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>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.