Struct maplibre::util::math::Plane

pub struct Plane<S> {
    pub n: Vector3<S>,
    pub d: S,
}

A 3-dimensional plane formed from the equation: A*x + B*y + C*z - D = 0.

Fields

• n: a unit vector representing the normal of the plane where:
  • n.x: corresponds to A in the plane equation
  • n.y: corresponds to B in the plane equation
  • n.z: corresponds to C in the plane equation
• d: the distance value, corresponding to D in the plane equation

Notes

The A*x + B*y + C*z - D = 0 form is preferred over the other common alternative, A*x + B*y + C*z + D = 0, because it tends to avoid superfluous negations (see Real Time Collision Detection, p. 55).

Copied from: https://github.com/rustgd/collision-rs

Fields

n: Vector3<S>

Plane normal

d: S

Plane distance value

Implementations

impl<S: BaseFloat> Plane<S>

pub fn new(n: Vector3<S>, d: S) -> Plane<S>

Construct a plane from a normal vector and a scalar distance. The plane will be perpendicular to n, and d units offset from the origin.

pub fn from_points(a: Point3<S>, b: Point3<S>, c: Point3<S>) -> Option<Plane<S>>

Constructs a plane that passes through the the three points a, b and c

pub fn from_point_normal(p: Point3<S>, n: Vector3<S>) -> Plane<S>

Construct a plane from a point and a normal vector. The plane will contain the point p and be perpendicular to n.

fn intersection_distance_ray(
    &self,
    ray_origin: &Vector3<S>,
    ray_direction: &Vector3<S>
) -> Option<S>

pub fn intersection_points_aabb3(&self, aabb: &Aabb3<S>) -> Vec<Vector3<S>>

Returns unsorted intersection points with an Aabb3 Adopted from: https://www.asawicki.info/news_1428_finding_polygon_of_plane-aabb_intersection Inspired by: https://godotengine.org/qa/54688/camera-frustum-intersection-with-plane

pub fn intersection_polygon_aabb3(&self, aabb: &Aabb3<S>) -> Vec<Vector3<S>>

Trait Implementations

impl<S: BaseFloat> Debug for Plane<S>

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

Formats the value using the given formatter.