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().

Examples found in repository

src/decorators/intersection_curve.rs (line 115)

    pub fn search_triple(&self, t: f64) -> Option<(Point3, Point2, Point2)> {
        double_projection(
            self.surface0(),
            None,
            self.surface1(),
            None,
            self.leader.subs(t),
            self.leader.der(t),
            100,
        )
    }

pub fn surface1(&self) -> &S

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

Examples found in repository

src/decorators/intersection_curve.rs (line 117)

    pub fn search_triple(&self, t: f64) -> Option<(Point3, Point2, Point2)> {
        double_projection(
            self.surface0(),
            None,
            self.surface1(),
            None,
            self.leader.subs(t),
            self.leader.der(t),
            100,
        )
    }

pub fn leader(&self) -> &C

Returns the polyline leading this curve.

Examples found in repository

src/decorators/intersection_curve.rs (line 205)

    fn search_parameter<H: Into<SPHint1D>>(
        &self,
        point: Point3,
        hint: H,
        trials: usize,
    ) -> Option<f64> {
        let t = self
            .leader()
            .search_nearest_parameter(point, hint, trials)
            .unwrap();
        let pt = self.subs(t);
        match pt.near(&point) {
            true => Some(t),
            false => None,
        }
    }
}

/// Only derive from leading curve. Not precise.
impl<C, S> SearchNearestParameter<D1> for IntersectionCurve<C, S>
where
    C: ParametricCurve3D + SearchNearestParameter<D1, Point = Point3>,
    S: ParametricSurface3D + SearchNearestParameter<D2, Point = Point3>,
{
    type Point = Point3;
    fn search_nearest_parameter<H: Into<SPHint1D>>(
        &self,
        point: Point3,
        hint: H,
        trials: usize,
    ) -> Option<f64> {
        self.leader().search_nearest_parameter(point, hint, trials)
    }

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()

Examples found in repository

src/decorators/intersection_curve.rs (line 133)

    fn subs(&self, t: f64) -> Point3 { self.search_triple(t).unwrap().0 }
    fn der(&self, t: f64) -> Vector3 {
        let n = self.leader.der(t);
        let (_, p0, p1) = self.search_triple(t).unwrap();
        let d = self
            .surface0
            .normal(p0.x, p0.y)
            .cross(self.surface1.normal(p1.x, p1.y))
            .normalize();
        d * (n.dot(n) / d.dot(n))
    }

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 parameter_range(&self) -> (f64, f64)

The range of the parameter of the curve.

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.

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.