Struct parry3d::transformation::voxelization::VoxelSet [−][src]
Expand description
A sparse set of voxels.
It only contains voxels that are considered as “full” after a voxelization.
Fields
origin: Point<Real>
Expand description
The 3D origin of this voxel-set.
scale: Real
Expand description
The scale factor between the voxel integer coordinates and their actual float world-space coordinates.
Implementations
impl VoxelSet
[src]
impl VoxelSet
[src]pub fn voxel_volume(&self) -> Real
[src]
pub fn voxel_volume(&self) -> Real
[src]The volume of a single voxel of this voxel set.
pub fn voxelize(
points: &[Point<Real>],
indices: &[[u32; 3]],
resolution: u32,
fill_mode: FillMode,
keep_voxel_to_primitives_map: bool
) -> Self
[src]
pub fn voxelize(
points: &[Point<Real>],
indices: &[[u32; 3]],
resolution: u32,
fill_mode: FillMode,
keep_voxel_to_primitives_map: bool
) -> Self
[src]Voxelizes the given shape described by its boundary: a triangle mesh (in 3D) or polyline (in 2D).
Parameters
points
- The vertex buffer of the boundary of the shape to voxelize.indices
- The index buffer of the boundary of the shape to voxelize.resolution
- Controls the number of subdivision done along each axis. This number is the number of subdivisions along the axis where the input shape has the largest extent. The other dimensions will have a different automatically-determined resolution (in order to keep the voxels cubic).fill_mode
- Controls what is being voxelized.keep_voxel_to_primitives_map
- If set totrue
a map between the voxels and the primitives (3D triangles or 2D segments) it intersects will be computed.
pub fn min_bb_voxels(&self) -> Point<u32>
[src]
pub fn min_bb_voxels(&self) -> Point<u32>
[src]The minimal coordinates of the integer bounding-box of the voxels in this set.
pub fn max_bb_voxels(&self) -> Point<u32>
[src]
pub fn max_bb_voxels(&self) -> Point<u32>
[src]The maximal coordinates of the integer bounding-box of the voxels in this set.
pub fn compute_volume(&self) -> Real
[src]
pub fn compute_volume(&self) -> Real
[src]Computes the total volume of the voxels contained by this set.
pub fn compute_bb(&mut self)
[src]
pub fn compute_bb(&mut self)
[src]Update the bounding box of this voxel set.
pub fn compute_exact_convex_hull(
&self,
points: &[Point<Real>],
indices: &[[u32; 3]]
) -> (Vec<Point<Real>>, Vec<[u32; 3]>)
[src]
pub fn compute_exact_convex_hull(
&self,
points: &[Point<Real>],
indices: &[[u32; 3]]
) -> (Vec<Point<Real>>, Vec<[u32; 3]>)
[src]Compute the convex-hull of this voxel set after cutting each voxel by the primitives (3D triangle or 2D segments) it intersects.
This will panic if this VoxelSet
was created with keep_voxel_to_primitives_map = false
.
pub fn compute_primitive_intersections(
&self,
points: &[Point<Real>],
indices: &[[u32; 3]]
) -> Vec<Point<Real>>
[src]
pub fn compute_primitive_intersections(
&self,
points: &[Point<Real>],
indices: &[[u32; 3]]
) -> Vec<Point<Real>>
[src]Computes the intersections between all the voxels of this voxel set, and all the primitives (triangle or segments) it intersected (as per the voxel-to-primitives-map computed during voxelization).
Panics if the voxelization was performed without setting the parameter
voxel_to_primitives_map = true
.
pub fn compute_convex_hull(
&self,
sampling: u32
) -> (Vec<Point<Real>>, Vec<[u32; 3]>)
[src]
pub fn compute_convex_hull(
&self,
sampling: u32
) -> (Vec<Point<Real>>, Vec<[u32; 3]>)
[src]Compute the convex-hull of the voxels in this set.
Parameters
sampling
- The convex-hull computation will ignoresampling
voxels at regular intervals. Useful to save some computation times if an exact result isn’t need. Use0
to make sure no voxel is being ignored.
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for VoxelSet
impl Send for VoxelSet
impl Sync for VoxelSet
impl Unpin for VoxelSet
impl UnwindSafe for VoxelSet
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[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]
impl<T> Downcast for T where
T: Any,
[src]pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
[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]
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]
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]
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]
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[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]
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]
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]
pub fn from_subset(element: &SS) -> SP
[src]The inclusion map: converts self
to the equivalent element of its superset.