Struct parry3d::transformation::vhacd::VHACD[][src]

pub struct VHACD { /* fields omitted */ }
Expand description

Approximate convex decomposition using the VHACD algorithm.

Implementations

impl VHACD[src]

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

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).

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

Perform an approximate convex decomposition of a set of voxels.

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

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

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

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.

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

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.

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

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

impl Sync for VHACD

impl Unpin for VHACD

impl UnwindSafe for VHACD

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

pub fn type_id(&self) -> TypeId[src]

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

pub fn borrow(&self) -> &T[src]

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

pub fn borrow_mut(&mut self) -> &mut T[src]

Mutably borrows from an owned value. Read more

impl<T> Downcast for T where
    T: Any
[src]

pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>[src]

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>[src]

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

pub fn as_any(&self) -> &(dyn Any + 'static)[src]

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)[src]

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> DowncastSync for T where
    T: Any + Send + Sync
[src]

pub fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + 'static + Sync + Send>[src]

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

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

Performs the conversion.

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

pub fn into(self) -> U[src]

Performs the conversion.

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP where
    SS: SubsetOf<SP>, 
[src]

pub fn to_subset(&self) -> Option<SS>[src]

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

pub fn is_in_subset(&self) -> bool[src]

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

pub fn to_subset_unchecked(&self) -> SS[src]

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

pub fn from_subset(element: &SS) -> SP[src]

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

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

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

Performs the conversion.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

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

The type returned in the event of a conversion error.

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

Performs the conversion.