Struct truck_geometry::decorators::IntersectionCurve

pub struct IntersectionCurve<C, S> { /* private fields */ }

Intersection curve between two surfaces.

Implementations

impl<C, S> IntersectionCurve<C, S>

pub fn surface0(&self) -> &S

This curve is a part of intersection of self.surface0() and self.surface1().

pub fn surface1(&self) -> &S

This curve is a part of intersection of self.surface0() and self.surface1().

pub fn leader(&self) -> &C

Returns the polyline leading this curve.

pub fn tolerance(&self) -> f64

The tolerance for generating this intersection curve.

pub fn new_unchecked( surface0: Box<S>, surface1: Box<S>, leader: C, tol: f64, ) -> Self

Creates intersection curve with unchecked bound. This method is only for developer of truck, deplicated for users.

impl<C, S> IntersectionCurve<C, S>

where C: ParametricCurve3D, S: ParametricSurface3D + SearchNearestParameter<D2, Point = Point3>,

pub fn search_triple(&self, t: f64) -> Option<(Point3, Point2, Point2)>

Search triple value of the point corresponding to the parameter t.

• the coordinate on 3D space
• the uv coordinate on self.surface0()
• the uv coordinate on self.surface1()

impl<C: BoundedCurve> IntersectionCurve<C, Plane>

pub fn optimize(&self) -> Line<C::Point>

Optimizes intersection curve of Plane into Line.

Trait Implementations

impl<C, S> BoundedCurve for IntersectionCurve<C, S>

where C: ParametricCurve3D + BoundedCurve, S: ParametricSurface3D + SearchNearestParameter<D2, Point = Point3>,

fn range_tuple(&self) -> (f64, f64)

Return the ends of parameter_range by tuple.

fn front(&self) -> Self::Point

The front end point of the curve.

fn back(&self) -> Self::Point

The back end point of the curve.

impl<C: Clone, S: Clone> Clone for IntersectionCurve<C, S>

fn clone(&self) -> IntersectionCurve<C, S>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<C, S> Cut for IntersectionCurve<C, S>

where C: Cut<Point = Point3, Vector = Vector3>, S: ParametricSurface3D + SearchNearestParameter<D2, Point = Point3>,

fn cut(&mut self, t: f64) -> Self

Cuts one curve into two curves. Assigns the former curve to self and returns the later curve.

impl<C: Debug, S: Debug> Debug for IntersectionCurve<C, S>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de, C, S> Deserialize<'de> for IntersectionCurve<C, S>

where C: Deserialize<'de>, S: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<C: Invertible, S: Clone> Invertible for IntersectionCurve<C, S>

fn invert(&mut self)

Inverts self

fn inverse(&self) -> Self

Returns the inverse.

impl<C, S> ParameterDivision1D for IntersectionCurve<C, S>

where C: ParametricCurve3D, S: ParametricSurface3D + SearchNearestParameter<D2, Point = Point3>,

type Point = Point3<f64>

The curve is in the space of Self::Point.

fn parameter_division( &self, range: (f64, f64), tol: f64, ) -> (Vec<f64>, Vec<Point3>)

Creates the curve division (parameters, corresponding points).

impl<C, S> ParametricCurve for IntersectionCurve<C, S>

where C: ParametricCurve3D, S: ParametricSurface3D + SearchNearestParameter<D2, Point = Point3>,

fn der2(&self, _: f64) -> Vector3

This method is unimplemented! Should panic!!

type Point = Point3<f64>

The curve is in the space of Self::Point.

type Vector = Vector3<f64>

The derivation vector of the curve.

fn subs(&self, t: f64) -> Point3

Substitutes the parameter t.

fn der(&self, t: f64) -> Vector3

Returns the derivation.

fn parameter_range(&self) -> ParameterRange

Returns default parameter range

fn try_range_tuple(&self) -> Option<(f64, f64)>

Return the ends of parameter_range by tuple. If the range is unbounded, return `None``.

fn period(&self) -> Option<f64>

None in default implementation; Some(period) if periodic.

impl<C: PartialEq, S: PartialEq> PartialEq for IntersectionCurve<C, S>

fn eq(&self, other: &IntersectionCurve<C, S>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<C, S> SearchNearestParameter<D1> for IntersectionCurve<C, S>

where C: ParametricCurve3D + SearchNearestParameter<D1, Point = Point3>, S: ParametricSurface3D + SearchNearestParameter<D2, Point = Point3>,

Only derive from leading curve. Not precise.

type Point = Point3<f64>

point

fn search_nearest_parameter<H: Into<SPHint1D>>( &self, point: Point3, hint: H, trials: usize, ) -> Option<f64>

Search nearest parameter t such that self.subs(t) is nearest point.
Returns None if could not find such parameter.

impl<C, S> SearchParameter<D1> for IntersectionCurve<C, S>

where C: ParametricCurve3D + SearchNearestParameter<D1, Point = Point3>, S: ParametricSurface3D + SearchNearestParameter<D2, Point = Point3>,

type Point = Point3<f64>

point

fn search_parameter<H: Into<SPHint1D>>( &self, point: Point3, hint: H, trials: usize, ) -> Option<f64>

Search parameter t such that self.subs(t) is near point.
Returns None if could not find such parameter.

impl<C, S> Serialize for IntersectionCurve<C, S>

where C: Serialize, S: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<C, S> Transformed<Matrix4<f64>> for IntersectionCurve<C, S>

where C: Transformed<Matrix4>, S: Transformed<Matrix4>,

fn transform_by(&mut self, trans: Matrix4)

transform by trans.

fn transformed(&self, trans: T) -> Self

transformed geometry by trans.

impl<C, S> StructuralPartialEq for IntersectionCurve<C, S>