Struct bevy_rapier3d::prelude::ConvexPolyhedron

pub struct ConvexPolyhedron { /* fields omitted */ }

A convex polyhedron without degenerate faces.

Implementations

impl ConvexPolyhedron

pub fn aabb(&self, pos: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>) -> AABB

Computes the world-space AABB of this convex polyhedron, transformed by pos.

pub fn local_aabb(&self) -> AABB

Computes the local-space AABB of this convex polyhedron.

impl ConvexPolyhedron

pub fn bounding_sphere(
    &self,
    pos: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>
) -> BoundingSphere

Computes the world-space bounding sphere of this convex polyhedron, transformed by pos.

pub fn local_bounding_sphere(&self) -> BoundingSphere

Computes the local-space bounding sphere of this convex polyhedron.

impl ConvexPolyhedron

pub fn from_convex_hull(
    points: &[Point<f32, 3_usize>]
) -> Option<ConvexPolyhedron>

Creates a new convex polyhedron from an arbitrary set of points.

This explicitly computes the convex hull of the given set of points. Use Returns None if the convex hull computation failed.

pub fn from_convex_mesh(
    points: Vec<Point<f32, 3_usize>, Global>,
    indices: &[[u32; 3]]
) -> Option<ConvexPolyhedron>

Attempts to create a new solid assumed to be convex from the set of points and indices.

The given points and index information are assumed to describe a convex polyhedron. It it is not, weird results may be produced.

Return

Retruns None if he given solid is not manifold (contains t-junctions, not closed, etc.)

pub fn check_geometry(&self)

Verify if this convex polyhedron is actually convex.

pub fn points(&self) -> &[Point<f32, 3_usize>]

The set of vertices of this convex polyhedron.

pub fn vertices(&self) -> &[Vertex]

The topology of the vertices of this convex polyhedron.

pub fn edges(&self) -> &[Edge]

The topology of the edges of this convex polyhedron.

pub fn faces(&self) -> &[Face]

The topology of the faces of this convex polyhedron.

pub fn vertices_adj_to_face(&self) -> &[u32]

The array containing the indices of the vertices adjacent to each face.

pub fn edges_adj_to_face(&self) -> &[u32]

The array containing the indices of the edges adjacent to each face.

pub fn faces_adj_to_vertex(&self) -> &[u32]

The array containing the indices of the faces adjacent to each vertex.

pub fn support_feature_id_toward(
    &self,
    local_dir: &Unit<Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>>
) -> FeatureId

Computes the ID of the features with a normal that maximize the dot-product with local_dir.

pub fn feature_normal(
    &self,
    feature: FeatureId
) -> Option<Unit<Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>>>

The normal of the given feature.

impl ConvexPolyhedron

pub fn to_trimesh(
    &self
) -> (Vec<Point<f32, 3_usize>, Global>, Vec<[u32; 3], Global>)

Discretize the boundary of this convex polyhedron as a triangle-mesh.

Trait Implementations

impl Clone for ConvexPolyhedron

pub fn clone(&self) -> ConvexPolyhedron

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ConvexPolyhedron

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

Formats the value using the given formatter.

impl PartialEq<ConvexPolyhedron> for ConvexPolyhedron

pub fn eq(&self, other: &ConvexPolyhedron) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &ConvexPolyhedron) -> bool

This method tests for !=.

impl PointQuery for ConvexPolyhedron

pub fn project_local_point(
    &self,
    point: &Point<f32, 3_usize>,
    solid: bool
) -> PointProjection

Projects a point on self.

pub fn project_local_point_and_get_feature(
    &self,
    point: &Point<f32, 3_usize>
) -> (PointProjection, FeatureId)

Projects a point on the boundary of self and returns the id of the feature the point was projected on.

fn distance_to_local_point(&self, pt: &Point<f32, 3_usize>, solid: bool) -> f32

Computes the minimal distance between a point and self.

fn contains_local_point(&self, pt: &Point<f32, 3_usize>) -> bool

Tests if the given point is inside of self.

fn project_point(
    &self,
    m: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    pt: &Point<f32, 3_usize>,
    solid: bool
) -> PointProjection

Projects a point on self transformed by m.

fn distance_to_point(
    &self,
    m: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    pt: &Point<f32, 3_usize>,
    solid: bool
) -> f32

Computes the minimal distance between a point and self transformed by m.

fn project_point_and_get_feature(
    &self,
    m: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    pt: &Point<f32, 3_usize>
) -> (PointProjection, FeatureId)

Projects a point on the boundary of self transformed by m and returns the id of the feature the point was projected on.

fn contains_point(
    &self,
    m: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    pt: &Point<f32, 3_usize>
) -> bool

Tests if the given point is inside of self transformed by m.

impl PolygonalFeatureMap for ConvexPolyhedron

pub fn local_support_feature(
    &self,
    dir: &Unit<Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>>,
    out_feature: &mut PolygonalFeature
)

Compute the support polygonal face of self towards the dir.

impl RayCast for ConvexPolyhedron

pub fn cast_local_ray_and_get_normal(
    &self,
    ray: &Ray,
    max_toi: f32,
    solid: bool
) -> Option<RayIntersection>

Computes the time of impact, and normal between this transformed shape and a ray.

fn cast_local_ray(&self, ray: &Ray, max_toi: f32, solid: bool) -> Option<f32>

Computes the time of impact between this transform shape and a ray.

fn intersects_local_ray(&self, ray: &Ray, max_toi: f32) -> bool

Tests whether a ray intersects this transformed shape.

fn cast_ray(
    &self,
    m: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    ray: &Ray,
    max_toi: f32,
    solid: bool
) -> Option<f32>

Computes the time of impact between this transform shape and a ray.

fn cast_ray_and_get_normal(
    &self,
    m: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    ray: &Ray,
    max_toi: f32,
    solid: bool
) -> Option<RayIntersection>

Computes the time of impact, and normal between this transformed shape and a ray.

fn intersects_ray(
    &self,
    m: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    ray: &Ray,
    max_toi: f32
) -> bool

Tests whether a ray intersects this transformed shape.

impl Shape for ConvexPolyhedron

pub fn clone_box(&self) -> Box<dyn Shape + 'static, Global>

Clones this shape into a boxed trait-object.

pub fn compute_local_aabb(&self) -> AABB

Computes the AABB of this shape.

pub fn compute_local_bounding_sphere(&self) -> BoundingSphere

Computes the bounding-sphere of this shape.

pub fn compute_aabb(
    &self,
    position: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>
) -> AABB

Computes the AABB of this shape with the given position.

pub fn mass_properties(&self, density: f32) -> MassProperties

Compute the mass-properties of this shape given its uniform density.

pub fn is_convex(&self) -> bool

Is this shape known to be convex?

pub fn shape_type(&self) -> ShapeType

Gets the type tag of this shape.

pub fn as_typed_shape(&self) -> TypedShape<'_>

Gets the underlying shape as an enum.

pub fn ccd_thickness(&self) -> f32

pub fn ccd_angular_thickness(&self) -> f32

pub fn as_support_map(&self) -> Option<&dyn SupportMap>

Convents this shape into its support mapping, if it has one.

pub fn as_polygonal_feature_map(
    &self
) -> Option<(&dyn PolygonalFeatureMap, f32)>

Converts this shape to a polygonal feature-map, if it is one.

pub fn feature_normal_at_point(
    &self,
    feature: FeatureId,
    _point: &Point<f32, 3_usize>
) -> Option<Unit<Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>>>

The shape’s normal at the given point located on a specific feature.

fn compute_bounding_sphere(
    &self,
    position: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>
) -> BoundingSphere

Computes the bounding-sphere of this shape with the given position.

fn as_composite_shape(&self) -> Option<&dyn SimdCompositeShape>

fn compute_swept_aabb(
    &self,
    start_pos: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    end_pos: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>
) -> AABB

Computes the swept AABB of this shape, i.e., the space it would occupy by moving from the given start position to the given end position.

impl SupportMap for ConvexPolyhedron

pub fn local_support_point(
    &self,
    dir: &Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>
) -> Point<f32, 3_usize>

fn local_support_point_toward(
    &self,
    dir: &Unit<Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>>
) -> Point<f32, 3_usize>

Same as self.local_support_point except that dir is normalized.

fn support_point(
    &self,
    transform: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    dir: &Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>
) -> Point<f32, 3_usize>

fn support_point_toward(
    &self,
    transform: &Isometry<f32, Unit<Quaternion<f32>>, 3_usize>,
    dir: &Unit<Matrix<f32, Const<{_: usize}>, Const<1_usize>, ArrayStorage<f32, 3_usize, 1_usize>>>
) -> Point<f32, 3_usize>

Same as self.support_point except that dir is normalized.

impl StructuralPartialEq for ConvexPolyhedron