Struct SimplicialMesh
pub struct SimplicialMesh { /* private fields */ }Description
Runtime-dimensional, fixed-connectivity mesh of affine simplex cells.
Topology is stored independently from coordinates. Cell vertex order is retained because it defines the affine map orientation; all lower strata are deduplicated by sorted vertex closure. The constructor rejects duplicate cells, isolated vertices, non-manifold facets, inverted cells, and cells below the requested quality gate.
Implementations§
§impl SimplicialMesh
impl SimplicialMesh
pub fn bisect_marked(
&self,
chart: OverlapCoordinateChart2d,
marked: &[CellId],
maximum_cells: usize,
) -> Result<(SimplicialMesh, SimplicialRevisionOverlap2d), Diagnostic>
pub fn bisect_marked( &self, chart: OverlapCoordinateChart2d, marked: &[CellId], maximum_cells: usize, ) -> Result<(SimplicialMesh, SimplicialRevisionOverlap2d), Diagnostic>
Bisect selected triangles and close neighboring edges to preserve conformity.
Each stage labels the longest edge of each source triangle, breaking ties by canonical edge identity. Completion marks incident triangles’ reference edges; children use their new midpoint as the newest vertex. Existing vertices remain a prefix, and unchanged cells retain their orientation. Mark order and repeated marks do not change the result.
Returns the accepted target Mesh and the ordinary common-refinement witness.
Its cell fragments retain each child’s exact source cell. Use
SimplicialRevisionOverlap2d::with_retained_facets to verify a requested
semantic boundary relation. Coordinates use binary64 midpoint construction
with the same rounding-cell certificates as other revision overlaps.
§Errors
Rejects nonplanar meshes, out-of-range cells, an insufficient completion budget, unrepresentable midpoints, a quality-gate failure or incomplete coverage.
§impl SimplicialMesh
impl SimplicialMesh
pub fn signed_boundary(
&self,
entity: MeshEntity,
) -> Option<Vec<(MeshEntity, i8)>>
pub fn signed_boundary( &self, entity: MeshEntity, ) -> Option<Vec<(MeshEntity, i8)>>
Signed codimension-one boundary in this exact mesh’s entity ordering.
A top-dimensional cell retains its supplied vertex orientation; lower entities use the mesh’s canonical vertex ordering. Coefficients are exact integers. Consecutive boundary operators compose to zero, independently of physical coordinates and floating-point differentiation. Transposes give the oriented vertex/edge/face cochain incidence maps.
Returns None for an absent entity. A vertex has an empty boundary.
§impl SimplicialMesh
impl SimplicialMesh
pub fn new(
dimension: usize,
vertices: Vec<Vec<f64>>,
cells: Vec<Vec<usize>>,
quality_gate: MeshQualityGate,
) -> Result<SimplicialMesh, Diagnostic>
pub fn new( dimension: usize, vertices: Vec<Vec<f64>>, cells: Vec<Vec<usize>>, quality_gate: MeshQualityGate, ) -> Result<SimplicialMesh, Diagnostic>
Validate and construct one full-dimensional affine simplex mesh.
§Errors
Returns EQ0803 for invalid dimensions/connectivity, duplicate or
non-manifold topology, non-finite coordinates, inverted/degenerate
cells, or a quality-gate violation.
pub fn vertices(&self) -> &[Vec<f64>]
pub fn vertices(&self) -> &[Vec<f64>]
Accepted coordinates in canonical vertex order.
pub fn cells(&self) -> &[Vec<usize>]
pub fn cells(&self) -> &[Vec<usize>]
Positively oriented cell closures in cell order.
pub const fn quality_gate(&self) -> MeshQualityGate
pub const fn quality_gate(&self) -> MeshQualityGate
Acceptance policy recorded with this mesh revision.
pub const fn quality_report(&self) -> MeshQualityReport
pub const fn quality_report(&self) -> MeshQualityReport
Mesh-quality evidence computed before acceptance.
pub fn entity_vertices(&self, entity: MeshEntity) -> Option<Vec<MeshEntity>>
pub fn entity_vertices(&self, entity: MeshEntity) -> Option<Vec<MeshEntity>>
Ordered vertex closure of a valid entity.
pub fn is_boundary_entity(&self, entity: MeshEntity) -> Option<bool>
pub fn is_boundary_entity(&self, entity: MeshEntity) -> Option<bool>
Whether a valid entity lies in the boundary closure.
pub fn linearized_geometry_map(
&self,
entity: MeshEntity,
vertex_velocities: &[Vec<f64>],
) -> Result<AffineGeometryLinearization, Diagnostic>
pub fn linearized_geometry_map( &self, entity: MeshEntity, vertex_velocities: &[Vec<f64>], ) -> Result<AffineGeometryLinearization, Diagnostic>
Linearize one entity map under an accepted vertex-velocity field.
§Errors
Returns EQ0803 for an invalid entity/action shape or affine-map
failure.
Trait Implementations§
§impl Clone for SimplicialMesh
impl Clone for SimplicialMesh
§impl Debug for SimplicialMesh
impl Debug for SimplicialMesh
§impl MeshGeometry for SimplicialMesh
impl MeshGeometry for SimplicialMesh
§type Map<'a> = AffineGeometryMap
type Map<'a> = AffineGeometryMap
§fn geometric_dimension(&self) -> usize
fn geometric_dimension(&self) -> usize
§fn geometry_map(
&self,
entity: MeshEntity,
) -> Option<<SimplicialMesh as MeshGeometry>::Map<'_>>
fn geometry_map( &self, entity: MeshEntity, ) -> Option<<SimplicialMesh as MeshGeometry>::Map<'_>>
§impl MeshTopology for SimplicialMesh
impl MeshTopology for SimplicialMesh
§fn orientation_permutation(
&self,
code: OrientationCode,
arity: usize,
) -> Option<VertexPermutation>
fn orientation_permutation( &self, code: OrientationCode, arity: usize, ) -> Option<VertexPermutation>
Resolve an orientation code into its exact vertex permutation.
§fn topological_dimension(&self) -> usize
fn topological_dimension(&self) -> usize
§fn entity_count(&self, dimension: usize) -> Option<usize>
fn entity_count(&self, dimension: usize) -> Option<usize>
§fn incidence(
&self,
entity: MeshEntity,
target_dimension: usize,
) -> Option<Vec<EntityIncidence>>
fn incidence( &self, entity: MeshEntity, target_dimension: usize, ) -> Option<Vec<EntityIncidence>>
target_dimension incident to entity in
deterministic reference-cell order. Invalid IDs or dimensions return
None.§impl PartialEq for SimplicialMesh
impl PartialEq for SimplicialMesh
§fn eq(&self, other: &SimplicialMesh) -> bool
fn eq(&self, other: &SimplicialMesh) -> bool
self and other values to be equal, and is used by ==.Auto Trait Implementations§
impl Freeze for SimplicialMesh
impl RefUnwindSafe for SimplicialMesh
impl Send for SimplicialMesh
impl Sync for SimplicialMesh
impl Unpin for SimplicialMesh
impl UnsafeUnpin for SimplicialMesh
impl UnwindSafe for SimplicialMesh
Blanket Implementations§
Source§impl<T> Any for Twhere
T: 'static + ?Sized,
impl<T> Any for Twhere
T: 'static + ?Sized,
§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Source§impl<T> Borrow<T> for Twhere
T: ?Sized,
impl<T> Borrow<T> for Twhere
T: ?Sized,
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§impl<T> ConvUtil for T
impl<T> ConvUtil for T
§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
§fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
§fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
Source§impl<T> From<T> for T
impl<T> From<T> for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T, U> Into<U> for Twhere
U: From<T>,
impl<T, U> Into<U> for Twhere
U: From<T>,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> Same for T
impl<T> Same for T
§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>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.