Struct heron::rapier_plugin::rapier3d::parry::transformation::vhacd::VHACD [−][src]
pub struct VHACD { /* fields omitted */ }
Expand description
Approximate convex decomposition using the VHACD algorithm.
Implementations
Decompose the given polyline (in 2D) or triangle mesh (in 3D).
Parameters
params
- The parameters for the VHACD algorithm execution.points
- The vertex buffer of the polyline (in 2D) or triangle mesh (in 3D).indices
- The index buffer of the polyline (in 2D) or triangle mesh (in 3D).keep_voxel_to_primitives_map
- If set totrue
then a map between the voxels computed during the decomposition, and the primitives (triangle or segment) they intersect will be computed. This is required in order to compute the convex-hulls using the original polyline/trimesh primitives afterwards (otherwise the convex hulls resulting from the convex decomposition will use the voxels vertices).
Perform an approximate convex decomposition of a set of voxels.
The almost-convex voxelized parts computed by the VHACD algorithm.
Compute the intersections between the voxelized convex part of this decomposition, and all the primitives from the original decomposed polyline/trimesh,
This will panic if keep_voxel_to_primitives_map
was set to false
when initializing
self
.
Compute the convex-hulls of the parts computed by this approximate convex-decomposition, taking into account the primitives from the original polyline/trimesh being decomposed.
This will panic if keep_voxel_to_primitives_map
was set to false
when initializing
self
.
Compute the convex hulls of the voxelized approximately-convex parts
computed by self
on the voxelized model.
Use compute_exact_convex_hulls
instead if the original polyline/trimesh geometry
needs to be taken into account.
Auto Trait Implementations
impl RefUnwindSafe for VHACD
impl UnwindSafe for VHACD
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
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
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
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
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
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
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V
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