Struct fenris_geometry::SimplePolygon
source · pub struct SimplePolygon<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,{ /* private fields */ }
Implementations§
source§impl<T, D> SimplePolygon<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,
impl<T, D> SimplePolygon<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,
pub fn from_vertices(vertices: Vec<OPoint<T, D>>) -> Self
pub fn vertices(&self) -> &[OPoint<T, D>]
pub fn transform_vertices<F>(&mut self, transform: F)where
F: FnMut(&mut [OPoint<T, D>]),
pub fn num_vertices(&self) -> usize
pub fn num_edges(&self) -> usize
pub fn assume_convex(&self) -> Convex<&Self>
source§impl<T: Real> SimplePolygon<T, Const<2>>
impl<T: Real> SimplePolygon<T, Const<2>>
sourcepub fn apply_isometry(&self, similarity: &Isometry3<T>) -> SimplePolygon3d<T>
pub fn apply_isometry(&self, similarity: &Isometry3<T>) -> SimplePolygon3d<T>
Apply a similarity transform in order to construct a 3D simple polygon.
Each 2D vertex is implicitly assumed to have z coordinate 0.
source§impl<T: Real> SimplePolygon<T, Const<3>>
impl<T: Real> SimplePolygon<T, Const<3>>
pub fn area_vector(&self) -> Vector3<T>
pub fn area(&self) -> T
pub fn intersect_half_space(
&self,
half_space: &HalfSpace<T>
) -> SimplePolygon3d<T>
source§impl<T> SimplePolygon<T, Const<2>>where
T: Scalar,
impl<T> SimplePolygon<T, Const<2>>where
T: Scalar,
sourcepub fn edge_iter<'a>(&'a self) -> impl 'a + Iterator<Item = LineSegment2d<T>>
pub fn edge_iter<'a>(&'a self) -> impl 'a + Iterator<Item = LineSegment2d<T>>
An iterator over edges as line segments
Trait Implementations§
source§impl<T, D> BoundedGeometry<T> for SimplePolygon<T, D>where
T: Real,
D: DimName,
DefaultAllocator: Allocator<T, D>,
impl<T, D> BoundedGeometry<T> for SimplePolygon<T, D>where
T: Real,
D: DimName,
DefaultAllocator: Allocator<T, D>,
type Dimension = D
fn bounding_box(&self) -> AxisAlignedBoundingBox<T, D>
source§impl<T, D> Clone for SimplePolygon<T, D>where
T: Scalar + Clone,
D: DimName + Clone,
DefaultAllocator: Allocator<T, D>,
impl<T, D> Clone for SimplePolygon<T, D>where
T: Scalar + Clone,
D: DimName + Clone,
DefaultAllocator: Allocator<T, D>,
source§fn clone(&self) -> SimplePolygon<T, D>
fn clone(&self) -> SimplePolygon<T, D>
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<T, D> Debug for SimplePolygon<T, D>where
T: Scalar + Debug,
D: DimName + Debug,
DefaultAllocator: Allocator<T, D>,
impl<T, D> Debug for SimplePolygon<T, D>where
T: Scalar + Debug,
D: DimName + Debug,
DefaultAllocator: Allocator<T, D>,
source§impl<'de, T, D> Deserialize<'de> for SimplePolygon<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,
OPoint<T, D>: Deserialize<'de>,
impl<'de, T, D> Deserialize<'de> for SimplePolygon<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,
OPoint<T, D>: 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, D> PartialEq<SimplePolygon<T, D>> for SimplePolygon<T, D>where
T: Scalar + PartialEq,
D: DimName + PartialEq,
DefaultAllocator: Allocator<T, D>,
impl<T, D> PartialEq<SimplePolygon<T, D>> for SimplePolygon<T, D>where
T: Scalar + PartialEq,
D: DimName + PartialEq,
DefaultAllocator: Allocator<T, D>,
source§fn eq(&self, other: &SimplePolygon<T, D>) -> bool
fn eq(&self, other: &SimplePolygon<T, D>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<T, D> Serialize for SimplePolygon<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,
OPoint<T, D>: Serialize,
impl<T, D> Serialize for SimplePolygon<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,
OPoint<T, D>: Serialize,
impl<T, D> Eq for SimplePolygon<T, D>where
T: Scalar + Eq,
D: DimName + Eq,
DefaultAllocator: Allocator<T, D>,
impl<T, D> StructuralEq for SimplePolygon<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,
impl<T, D> StructuralPartialEq for SimplePolygon<T, D>where
T: Scalar,
D: DimName,
DefaultAllocator: Allocator<T, D>,
Auto Trait Implementations§
impl<T, D> !RefUnwindSafe for SimplePolygon<T, D>
impl<T, D> !Send for SimplePolygon<T, D>
impl<T, D> !Sync for SimplePolygon<T, D>
impl<T, D> !Unpin for SimplePolygon<T, D>
impl<T, D> !UnwindSafe for SimplePolygon<T, D>
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.