Expand description
Mesh representations and zero-copy interoperability views.
N-gons remain PolygonMesh until explicit triangulation. TriMesh is
the compact exchange type for render, spatial, and mesh-kernel algorithms.
HalfedgeMesh is the editable surface mesh with O(1) adjacency for
algorithms that rewrite connectivity in place.
Re-exports§
pub use adjacency::EdgeAdjacency;pub use adjacency::EdgeKey;pub use adjacency::EdgeUse;pub use attribute::AttributeChannel;pub use attribute::AttributeFate;pub use attribute::Blend;pub use attribute::DropReason;pub use audit::audit_mesh;pub use audit::audit_mesh_cycle;pub use audit::audit_mesh_scratch_bytes;pub use audit::try_audit_mesh;pub use audit::try_audit_mesh_cycle;pub use audit::MeshAuditError;pub use audit::MeshCycleHealth;pub use audit::MeshHealth;pub use component::component_count;pub use component::compose;pub use component::decompose;pub use error::MeshValidationError;pub use halfedge::EdgeId;pub use halfedge::FaceId;pub use halfedge::HalfedgeBuildError;pub use halfedge::HalfedgeEditError;pub use halfedge::HalfedgeId;pub use halfedge::HalfedgeInvariantError;pub use halfedge::HalfedgeMesh;pub use halfedge::HalfedgeRemap;pub use halfedge::VertexId;pub use polygon::PolygonFace;pub use polygon::PolygonMesh;pub use triangle::NormalAttribute;pub use triangle::TriMesh;pub use view::MeshView;pub use view::TriangleMeshView;
Modules§
- adjacency
- Edge adjacency derived once, so algorithms stop rebuilding it.
- attribute
- Named per-vertex data carried alongside positions.
- audit
- Deterministic structural triangle-mesh audit.
- component
- Splitting a mesh into connected components, and recombining them (#85).
- error
- Structured mesh validation failures.
- halfedge
- Halfedge surface mesh: O(1) adjacency and in-place connectivity edits.
- polygon
- Polygonal face mesh that preserves n-gons and inner voids before triangulation.
- triangle
- Indexed triangle mesh representation.
- view
- Borrowed mesh interoperability seam.
Functions§
- split_
triangle_ at_ side_ corners - Triangulate a proper triangle
twhose sidei(fromt[i]tot[i+1]) carries the cornerssides[i]in order, into proper triangles with the same winding, appended tooutas index triples.