Struct heron::rapier_plugin::rapier3d::parry::bounding_volume::AABB

source · 
pub struct AABB {
    pub mins: OPoint<f32, Const<3>>,
    pub maxs: OPoint<f32, Const<3>>,
}
Expand description

An Axis Aligned Bounding Box.

Fields

mins: OPoint<f32, Const<3>>maxs: OPoint<f32, Const<3>>

Implementations

The vertex indices of each edge of this AABB.

This gives, for each edge of this AABB, the indices of its vertices when taken from the self.vertices() array. Here is how the faces are numbered, assuming a right-handed coordinate system:

y 3 - 2 | 7 − 6 | ___ x | | 1 (the zero is bellow 3 and on the left of 1, hidden by the 4-5-6-7 face.) / 4 - 5 z

The vertex indices of each face of this AABB.

This gives, for each face of this AABB, the indices of its vertices when taken from the self.vertices() array. Here is how the faces are numbered, assuming a right-handed coordinate system:

y 3 - 2 | 7 − 6 | ___ x | | 1 (the zero is bellow 3 and on the left of 1, hidden by the 4-5-6-7 face.) / 4 - 5 z

Creates a new AABB.

Arguments:
  • mins - position of the point with the smallest coordinates.
  • maxs - position of the point with the highest coordinates. Each component of mins must be smaller than the related components of maxs.

Creates an invalid AABB with mins components set to Real::max_values and maxscomponents set to -Real::max_values.

This is often used as the initial values of some AABB merging algorithms.

Creates a new AABB from its center and its half-extents.

Creates a new AABB from a set of points.

The center of this AABB.

The half extents of this AABB.

The volume of this AABB.

The extents of this AABB.

Enlarges this AABB so it also contains the point pt.

Computes the AABB bounding self transformed by m.

The smallest bounding sphere containing this AABB.

Computes the intersection of this AABB and another one.

Returns the difference between this AABB and rhs.

Removing another AABB from self will result in zero, one, or up to 4 (in 2D) or 8 (in 3D) new smaller AABBs.

Returns the difference between this AABB and rhs.

Removing another AABB from self will result in zero, one, or up to 4 (in 2D) or 8 (in 3D) new smaller AABBs.

Return

This returns a pair where the first item are the new AABBs and the the second item is the sequance of cuts applied to self to obtain the new AABBs. Each cut is performed along one axis identified by -1, -2, -3 for -X, -Y, -Z and 1, 2, 3 for +X, +Y, +Z, and the plane’s bias. The cuts are applied sequancially. For example, if result.1[0] contains 1, then it means that result.0[0] is equal to the piece of self lying in the negative half-space delimited by the plane with outward normal +X. Then, the other piece of self generated by this cut (i.e. the piece of self lying in the positive half-space delimited by the plane with outward normal +X) is the one that will be affected by the next cut.

The returned cut sequence will be empty if the aabbs are disjoint.

Computes the vertices of this AABB.

Splits this AABB at its center, into height parts (as in an octree).

Projects every point of AABB on an arbitrary axis.

Computes the intersection of a segment with this AABB.

Returns None if there is no intersection.

Computes the parameters of the two intersection points between a line and this AABB.

The parameters are such that the point are given by orig + dir * parameter. Returns None if there is no intersection.

Computes the intersection segment between a line and this AABB.

Returns None if there is no intersection.

Computes the parameters of the two intersection points between a ray and this AABB.

The parameters are such that the point are given by ray.orig + ray.dir * parameter. Returns None if there is no intersection.

Computes the intersection segment between a ray and this AABB.

Returns None if there is no intersection.

Computes the intersections between this AABB and the given polygon.

The results is written into points directly. The input points are assumed to form a convex polygon where all points lie on the same plane. In order to avoid internal allocations, uses self.clip_polygon_with_workspace instead.

Computes the intersections between this AABB and the given polygon.

The results is written into points directly. The input points are assumed to form a convex polygon where all points lie on the same plane.

Splits this AABB along the given canonical axis.

This will split the AABB by a plane with a normal with it’s axis-th component set to 1. The splitting plane is shifted wrt. the origin by the bias (i.e. it passes through the point equal to normal * bias).

Result

Returns the result of the split. The first AABB returned is the piece lying on the negative half-space delimited by the splitting plane. The second AABB returned is the piece lying on the positive half-space delimited by the splitting plane.

Outlines this AABB’s shape using polylines.

Discretize the boundary of this AABB as a triangle-mesh.

Trait Implementations

Returns a point inside of this bounding volume. This is ideally its center.
Checks if this bounding volume intersect with another one.
Checks if this bounding volume contains another one.
Merges this bounding volume with another one. The merge is done in-place.
Merges this bounding volume with another one.
Enlarges this bounding volume.
Creates a new, enlarged version, of this bounding volume.
Tighten this bounding volume.
Creates a new, tightened version, of this bounding volume.
Returns a copy of the value. Read more
Performs copy-assignment from source. Read more
Formats the value using the given formatter. Read more
This method tests for self and other values to be equal, and is used by ==. Read more
This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more
Projects a point on self. Read more
Projects a point on the boundary of self and returns the id of the feature the point was projected on. Read more
Computes the minimal distance between a point and self.
Projects a point on self, unless the projection lies further than the given max distance. Read more
Projects a point on self transformed by m, unless the projection lies further than the given max distance.
Tests if the given point is inside of self.
Projects a point on self transformed by m.
Computes the minimal distance between a point and self transformed by m.
Projects a point on the boundary of self transformed by m and returns the id of the feature the point was projected on. Read more
Tests if the given point is inside of self transformed by m.
Computes the time of impact between this transform shape and a ray.
Computes the time of impact, and normal between this transformed shape and a ray.
Tests whether a ray intersects this transformed shape.
Computes the time of impact between this transform shape and a ray.
Computes the time of impact, and normal between this transformed shape and a ray.
Tests whether a ray intersects this transformed shape.

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more
Return the T [ShaderType] for self. When used in [AsBindGroup] derives, it is safe to assume that all images in self exist. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait. Read more
Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait. Read more
Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s. Read more
Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s. Read more
Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait. Read more

Returns the argument unchanged.

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

The alignment of pointer.
The type for initializers.
Initializes a with the given initializer. Read more
Dereferences the given pointer. Read more
Mutably dereferences the given pointer. Read more
Drops the object pointed to by the given pointer. Read more
Should always be Self
The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Checks if self is actually part of its subset T (and can be converted to it).
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
The inclusion map: converts self to the equivalent element of its superset.
The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
Uses borrowed data to replace owned data, usually by cloning. Read more
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.
Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more