Struct plane_split::Plane
source · pub struct Plane<T, U> {
pub normal: TypedVector3D<T, U>,
pub offset: T,
}Expand description
An infinite plane in 3D space, defined by equation: dot(v, normal) + offset = 0 When used for plane splitting, it’s defining a hemisphere with equation “dot(v, normal) + offset > 0”.
Fields§
§normal: TypedVector3D<T, U>Normalized vector perpendicular to the plane.
offset: TConstant offset from the normal plane, specified in the direction opposite to the normal.
Implementations§
source§impl<T: Copy + Zero + One + Float + ApproxEq<T> + Sub<T, Output = T> + Add<T, Output = T> + Mul<T, Output = T> + Div<T, Output = T>, U> Plane<T, U>
impl<T: Copy + Zero + One + Float + ApproxEq<T> + Sub<T, Output = T> + Add<T, Output = T> + Mul<T, Output = T> + Div<T, Output = T>, U> Plane<T, U>
sourcepub fn from_unnormalized(
normal: TypedVector3D<T, U>,
offset: T
) -> Result<Option<Self>, NegativeHemisphereError>
pub fn from_unnormalized(
normal: TypedVector3D<T, U>,
offset: T
) -> Result<Option<Self>, NegativeHemisphereError>
Construct a new plane from unnormalized equation.
sourcepub fn signed_distance_to(&self, point: &TypedPoint3D<T, U>) -> T
pub fn signed_distance_to(&self, point: &TypedPoint3D<T, U>) -> T
Return the signed distance from this plane to a point. The distance is negative if the point is on the other side of the plane from the direction of the normal.
sourcepub fn distance_to_line(&self, line: &Line<T, U>) -> Twhere
T: Neg<Output = T>,
pub fn distance_to_line(&self, line: &Line<T, U>) -> Twhere
T: Neg<Output = T>,
Compute the distance across the line to the plane plane, starting from the line origin.
sourcepub fn signed_distance_sum_to(&self, poly: &Polygon<T, U>) -> T
pub fn signed_distance_sum_to(&self, poly: &Polygon<T, U>) -> T
Compute the sum of signed distances to each of the points
of another plane. Useful to know the relation of a plane that
is a product of a split, and we know it doesn’t intersect self.
sourcepub fn are_outside(&self, points: &[TypedPoint3D<T, U>]) -> bool
pub fn are_outside(&self, points: &[TypedPoint3D<T, U>]) -> bool
Check if a convex shape defined by a set of points is completely outside of this plane. Merely touching the surface is not considered an intersection.