Struct implicit3d::Mesh
source · Expand description
Mesh generates an implicit function from a 3d object mesh. Warning! This primitive is currently horribly inefficient. That is, for each point it iterates over all faces and finds the closest. This implementation desperately needs some performance improvements, e.g. kd-tree support or similar.
Implementations§
Trait Implementations§
source§impl<S: Real + Float + From<f64> + From<f32>> Object<S> for Mesh<S>
impl<S: Real + Float + From<f64> + From<f32>> Object<S> for Mesh<S>
source§fn approx_value(&self, p: &Point3<S>, slack: S) -> S
fn approx_value(&self, p: &Point3<S>, slack: S) -> S
Value is 0 on object surfaces, negative inside and positive outside of objects.
If positive, value is guarateed to be the minimum distance to the object surface.
return some approximation (which is always larger then the proper value).
Only do a proper calculation, for values smaller then slack. Read more
source§fn bbox(&self) -> &BoundingBox<S>
fn bbox(&self) -> &BoundingBox<S>
Get the Bounding Box of this Object.
source§fn set_bbox(&mut self, _: &BoundingBox<S>)
fn set_bbox(&mut self, _: &BoundingBox<S>)
Explicitly set the Bounding Box.
source§fn set_parameters(&mut self, _: &PrimitiveParameters<S>)
fn set_parameters(&mut self, _: &PrimitiveParameters<S>)
Allows to set parameters.
source§impl<S: PartialEq + Real + Debug> PartialEq<Mesh<S>> for Mesh<S>
impl<S: PartialEq + Real + Debug> PartialEq<Mesh<S>> for Mesh<S>
impl<S: Real + Debug> StructuralPartialEq for Mesh<S>
Auto Trait Implementations§
impl<S> RefUnwindSafe for Mesh<S>where
S: RefUnwindSafe,
impl<S> Send for Mesh<S>
impl<S> Sync for Mesh<S>
impl<S> Unpin for Mesh<S>where
S: Unpin,
impl<S> UnwindSafe for Mesh<S>where
S: UnwindSafe,
Blanket Implementations§
source§impl<S, T> ObjectClone<S> for Twhere
S: Real + Float + From<f32>,
T: 'static + Object<S> + Clone,
impl<S, T> ObjectClone<S> for Twhere
S: Real + Float + From<f32>,
T: 'static + Object<S> + Clone,
source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.