Struct parry3d_f64::transformation::vhacd::VHACD

source ·
pub struct VHACD { /* private fields */ }
Expand description

Approximate convex decomposition using the VHACD algorithm.

Implementations§

source§

impl VHACD

source

pub fn decompose( params: &VHACDParameters, points: &[Point<Real>], indices: &[[u32; 3]], keep_voxel_to_primitives_map: bool ) -> Self

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 to true 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).
source

pub fn from_voxels(params: &VHACDParameters, voxels: VoxelSet) -> Self

Perform an approximate convex decomposition of a set of voxels.

source

pub fn voxel_parts(&self) -> &[VoxelSet]

The almost-convex voxelized parts computed by the VHACD algorithm.

source

pub fn compute_primitive_intersections( &self, points: &[Point<Real>], indices: &[[u32; 3]] ) -> Vec<Vec<Point<Real>>>

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.

source

pub fn compute_exact_convex_hulls( &self, points: &[Point<Real>], indices: &[[u32; 3]] ) -> Vec<(Vec<Point<Real>>, Vec<[u32; 3]>)>

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.

source

pub fn compute_convex_hulls( &self, downsampling: u32 ) -> Vec<(Vec<Point<Real>>, Vec<[u32; 3]>)>

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 Freeze for VHACD

§

impl RefUnwindSafe for VHACD

§

impl Send for VHACD

§

impl Sync for VHACD

§

impl Unpin for VHACD

§

impl UnwindSafe for VHACD

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> Downcast for T
where T: Any,

source§

fn into_any(self: Box<T>) -> Box<dyn 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.
source§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
source§

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
source§

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.
source§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

source§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

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

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.