Struct fenris_geometry::Line
source · pub struct Line<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,{ /* private fields */ }
Implementations§
source§impl<T, D> Line<T, D>where
T: Real,
D: DimName,
DefaultAllocator: Allocator<T, D>,
impl<T, D> Line<T, D>where
T: Real,
D: DimName,
DefaultAllocator: Allocator<T, D>,
pub fn from_point_through_point(
point: OPoint<T, D>,
through: &OPoint<T, D>
) -> Self
sourcepub fn project_point_parametric(&self, point: &OPoint<T, D>) -> T
pub fn project_point_parametric(&self, point: &OPoint<T, D>) -> T
Computes the projection of the given point onto the line, representing the point in parametric form.
sourcepub fn project_point(&self, point: &OPoint<T, D>) -> OPoint<T, D>
pub fn project_point(&self, point: &OPoint<T, D>) -> OPoint<T, D>
Computes the projection of the given point onto the line.
pub fn point_from_parameter(&self, t: T) -> OPoint<T, D>
source§impl<T> Line<T, Const<2>>where
T: Real,
impl<T> Line<T, Const<2>>where
T: Real,
pub fn intersect(&self, other: &Line2d<T>) -> Option<Point2<T>>
sourcepub fn intersect_line_parametric(&self, other: &Line2d<T>) -> Option<(T, T)>
pub fn intersect_line_parametric(&self, other: &Line2d<T>) -> Option<(T, T)>
Computes the intersection of two lines, if any.
Let all points on each line segment be defined by the relation x1 = a1 + t1 * d1
for 0 <= t1 <= 1
, and similarly for t2
. Here, t1
is the parameter associated with
self
, and t2
is the parameter associated with other
.
pub fn intersect_disk(&self, disk: &Disk<T>) -> Option<LineSegment2d<T>>
pub fn intersect_disk_parametric(&self, disk: &Disk<T>) -> Option<[T; 2]>
Trait Implementations§
Auto Trait Implementations§
impl<T, D> !RefUnwindSafe for Line<T, D>
impl<T, D> !Send for Line<T, D>
impl<T, D> !Sync for Line<T, D>
impl<T, D> !Unpin for Line<T, D>
impl<T, D> !UnwindSafe for Line<T, D>
Blanket Implementations§
§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.