pub struct CurveIntersection<P> {
pub crossings: Vec<Crossing<P>>,
pub overlaps: Vec<Overlap>,
}Expand description
What two curves do to each other.
Fields§
§crossings: Vec<Crossing<P>>Isolated crossings, in order along the first curve.
overlaps: Vec<Overlap>Stretches of shared support.
The analytic same-support cases (collinear lines, arcs of one circle) come back exactly. In space, the sampling path also reports a stretch along which the first curve’s samples stay within the gap of the second, its ends bisected to parametric resolution and its correspondence stated by those ends alone: a fitted section tracing the arc it was cut along is one overlap, not a row of crossings. A stretch shorter than two samples of the first curve is still read as whatever crossings the sampling finds; in the plane, only the analytic cases are detected.
Implementations§
Trait Implementations§
Source§impl<P: Clone> Clone for CurveIntersection<P>
impl<P: Clone> Clone for CurveIntersection<P>
Source§impl<P: Debug> Debug for CurveIntersection<P>
impl<P: Debug> Debug for CurveIntersection<P>
Source§impl<P: PartialEq> PartialEq for CurveIntersection<P>
impl<P: PartialEq> PartialEq for CurveIntersection<P>
impl<P: PartialEq> StructuralPartialEq for CurveIntersection<P>
Auto Trait Implementations§
impl<P> Freeze for CurveIntersection<P>
impl<P> RefUnwindSafe for CurveIntersection<P>
impl<P> Send for CurveIntersection<P>
impl<P> Sync for CurveIntersection<P>
impl<P> Unpin for CurveIntersection<P>
impl<P> UnsafeUnpin for CurveIntersection<P>
impl<P> UnwindSafe for CurveIntersection<P>
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
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.