Struct fenris_geometry::Tetrahedron
source · pub struct Tetrahedron<T>where
T: Scalar,{ /* private fields */ }
Implementations§
source§impl<T> Tetrahedron<T>where
T: Scalar,
impl<T> Tetrahedron<T>where
T: Scalar,
sourcepub fn from_vertices(vertices: [Point3<T>; 4]) -> Self
pub fn from_vertices(vertices: [Point3<T>; 4]) -> Self
Construct tetrahedron from the given points.
Ordering is the same as for Tet4Connectivity
.
Trait Implementations§
source§impl<T: Real> BoundedGeometry<T> for Tetrahedron<T>
impl<T: Real> BoundedGeometry<T> for Tetrahedron<T>
type Dimension = Const<3>
fn bounding_box(&self) -> AxisAlignedBoundingBox<T, U3>
source§impl<T> Clone for Tetrahedron<T>where
T: Scalar + Clone,
impl<T> Clone for Tetrahedron<T>where
T: Scalar + Clone,
source§fn clone(&self) -> Tetrahedron<T>
fn clone(&self) -> Tetrahedron<T>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<'a, T> ConvexPolyhedron<'a, T> for Tetrahedron<T>where
T: Real,
impl<'a, T> ConvexPolyhedron<'a, T> for Tetrahedron<T>where
T: Real,
source§impl<'de, T> Deserialize<'de> for Tetrahedron<T>where
T: Scalar,
Point3<T>: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for Tetrahedron<T>where
T: Scalar,
Point3<T>: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<T> Distance<T, OPoint<T, Const<3>>> for Tetrahedron<T>where
T: Real,
impl<T> Distance<T, OPoint<T, Const<3>>> for Tetrahedron<T>where
T: Real,
fn distance(&self, point: &OPoint<T, U3>) -> T
source§fn distance_bound(&self, query_geometry: &QueryGeometry) -> [T; 2]
fn distance_bound(&self, query_geometry: &QueryGeometry) -> [T; 2]
Returns an interval
[l, u]
for the distance d
, such that d
is contained in [l, u]
.source§impl<T> PartialEq<Tetrahedron<T>> for Tetrahedron<T>where
T: Scalar + PartialEq,
impl<T> PartialEq<Tetrahedron<T>> for Tetrahedron<T>where
T: Scalar + PartialEq,
source§fn eq(&self, other: &Tetrahedron<T>) -> bool
fn eq(&self, other: &Tetrahedron<T>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.impl<T> Copy for Tetrahedron<T>where
T: Scalar + Copy,
impl<T> StructuralPartialEq for Tetrahedron<T>where
T: Scalar,
Auto Trait Implementations§
impl<T> RefUnwindSafe for Tetrahedron<T>where
T: RefUnwindSafe,
impl<T> Send for Tetrahedron<T>where
T: Send,
impl<T> Sync for Tetrahedron<T>where
T: Sync,
impl<T> Unpin for Tetrahedron<T>where
T: Unpin,
impl<T> UnwindSafe for Tetrahedron<T>where
T: UnwindSafe,
Blanket Implementations§
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.