Struct MeshGraph

pub struct MeshGraph {
    pub qbvh: Qbvh<Face>,
    pub qbvh_workspace: QbvhUpdateWorkspace,
    pub index_to_face_id: Vec<FaceId>,
    pub vertices: SlotMap<VertexId, Vertex>,
    pub halfedges: SlotMap<HalfedgeId, Halfedge>,
    pub faces: SlotMap<FaceId, Face>,
    pub positions: SecondaryMap<VertexId, Vec3>,
    pub vertex_normals: Option<SecondaryMap<VertexId, Vec3>>,
}

Halfedge data structure for representing triangle meshes.

Please see the crate documentation for more information.

Fields

qbvh: Qbvh<Face>

Acceleration structure for fast spatial queries. Uses parry3d’s Qbvh to implement some of parry3d’s spatial queries.

qbvh_workspace: QbvhUpdateWorkspace

Used in conjunction with the QBVH to accelerate spatial queries.

index_to_face_id: Vec<FaceId>

Used to map indices stored in the QBVH to face IDs.

vertices: SlotMap<VertexId, Vertex>

Maps vertex IDs to their corresponding graph node

halfedges: SlotMap<HalfedgeId, Halfedge>

Maps halfedge IDs to their corresponding graph node

faces: SlotMap<FaceId, Face>

Maps face IDs to their corresponding graph node

positions: SecondaryMap<VertexId, Vec3>

Maps vertex IDs to their corresponding positions

vertex_normals: Option<SecondaryMap<VertexId, Vec3>>

Maps vertex IDs to their corresponding normals

Implementations

impl MeshGraph

pub fn faces_share_edge(&self, face_id1: FaceId, face_id2: FaceId) -> bool

Test if two faces have at least one halfedge in common.

pub fn faces_share_all_vertices( &self, face_id1: FaceId, face_id2: FaceId, ) -> bool

Test if two faces share all vertices.

pub fn halfedges_share_all_vertices( &self, halfedge_id1: HalfedgeId, halfedge_id2: HalfedgeId, ) -> bool

Test if two halfedges share all vertices.

pub fn vertices_share_position( &self, vertex_id1: VertexId, vertex_id2: VertexId, ) -> bool

Test if two vertices have the exact same position.

pub fn make_outgoing_halfedge_boundary_if_possible( &mut self, _vertex_id: VertexId, )

impl MeshGraph

pub fn collapse_until_edges_above_min_length( &mut self, min_length_squared: f32, selection: &mut Selection, )

Collapses edges until all edges have a length above the minimum length.

This will schedule necessary updates to the QBVH but you have to call refit() and maybe rebalance() after the operation.

pub fn collapse_edge( &mut self, halfedge_id: HalfedgeId, ) -> (Vec<VertexId>, Vec<HalfedgeId>, Vec<FaceId>)

Collapse an edge in the mesh graph.

This moves the start vertex of the edge to the center of the edge and removes the end vertex and the adjacent and opposite faces.

It also performs a cleanup afterwards to remove flaps (faces that share the same vertices).

Returns the vertices, halfedges and faces that were removed.

impl MeshGraph

pub fn delete_face( &mut self, face_id: FaceId, ) -> (Vec<VertexId>, Vec<HalfedgeId>)

Deletes a face from the mesh graph.

It also deletes the vertices and halfedges that are no longer connected to any other faces.

Returns the ids of the removed vertices and halfedges.

impl MeshGraph

pub fn insert_vertex(&mut self, position: Vec3) -> VertexId

Inserts a vertex and it’s position into the mesh graph. It doesn’t do any connections.

pub fn insert_halfedge(&mut self, end_vertex: VertexId) -> HalfedgeId

Inserts a halfedge into the mesh graph. It only connects the halfedge to the given end vertex but not the reverse. It also doesn’t do any other connections.

pub fn insert_face(&mut self, halfedge: HalfedgeId) -> FaceId

Inserts a face into the mesh graph. It only connects the face to the given halfedge but not the reverse. It also doesn’t do any other connections.

impl MeshGraph

pub fn triangle(&self, face: Face) -> Triangle

impl MeshGraph

pub fn subdivide_edge(&mut self, halfedge_id: HalfedgeId) -> Vec<HalfedgeId>

Subdivides an edge by computing it’s center vertex. This also subdivides any adjacent triangles and makes sure everything is properly reconnected. Works only on triangle meshes.

Returns the id of the new halfedge which goes from the center vertex to the original edge’s end vertex. And also return the halfedges that are created by subdividing the adjacent faces. Only one of the two twin halfedges per face subdivision is returned. In total the number n of halfedges returned is 1 <= n <= 3. (The one from dividing the halfedge and at most 2 from dividing the two adjacent faces).

pub fn subdivide_until_edges_below_max_length( &mut self, max_length_squared: f32, selection: &mut Selection, )

Subdivide all edges in the selection until all of them are <= max_length. Please note that you have to provide the squared value of max_length. All new edges created during this process are added to the selection.

This will schedule necessary updates to the QBVH but you have to call refit() and maybe rebalance() after the operation.

impl MeshGraph

pub fn triangles(vertex_positions: &[Vec3]) -> Self

Create a triangle mesh graph from vertex positions. Every three positions represent a triangle.

Vertices with the same position are merged into a single vertex.

pub fn indexed_triangles( vertex_positions: &[Vec3], face_indices: &[usize], ) -> Self

Create a triangle mesh graph from vertex positions and face indices. Every chunk of three indices represents a triangle.

pub fn compute_vertex_normals(&mut self)

Computes the vertex normals by averaging over the computed face normals

pub fn normalize_vertex_normals(&mut self)

Ensures that the vertex normals are all normalized

pub fn rebalance_qbvh(&mut self)

pub fn refit_qbvh(&mut self)

Recomputes the bounding boxes of the QBVH. This is necessary when the mesh is modified.

It does not no change the topology of the QBVH. Call rebalance_qbvh to to that.

pub fn rebuild_qbvh(&mut self)

Clear and rebuild the QBVH.

Trait Implementations

impl Clone for MeshGraph

fn clone(&self) -> MeshGraph

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl From<IcoSphere> for MeshGraph

fn from(isosphere: IcoSphere) -> Self

Converts to this type from the input type.

impl From<MeshGraph> for VertexIndexBuffers

fn from(mesh_graph: MeshGraph) -> VertexIndexBuffers

Converts to this type from the input type.

impl From<Quad> for MeshGraph

fn from(quad: Quad) -> Self

Converts to this type from the input type.

impl From<Triangle> for MeshGraph

fn from(triangle: Triangle) -> Self

Converts to this type from the input type.

impl PointQuery for MeshGraph

fn project_local_point( &self, point: &Point<f32>, solid: bool, ) -> PointProjection

Projects a point on self.

fn project_local_point_and_get_feature( &self, _point: &Point<f32>, ) -> (PointProjection, FeatureId)

Projects a point on the boundary of self and returns the id of the feature the point was projected on.

fn project_local_point_with_max_dist( &self, pt: &OPoint<f32, Const<3>>, solid: bool, max_dist: f32, ) -> Option<PointProjection>

Projects a point on self, unless the projection lies further than the given max distance.

fn project_point_with_max_dist( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, pt: &OPoint<f32, Const<3>>, solid: bool, max_dist: f32, ) -> Option<PointProjection>

Projects a point on self transformed by m, unless the projection lies further than the given max distance.

fn distance_to_local_point( &self, pt: &OPoint<f32, Const<3>>, solid: bool, ) -> f32

Computes the minimal distance between a point and self.

fn contains_local_point(&self, pt: &OPoint<f32, Const<3>>) -> bool

Tests if the given point is inside of self.

fn project_point( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, pt: &OPoint<f32, Const<3>>, solid: bool, ) -> PointProjection

Projects a point on self transformed by m.

fn distance_to_point( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, pt: &OPoint<f32, Const<3>>, solid: bool, ) -> f32

Computes the minimal distance between a point and self transformed by m.

fn project_point_and_get_feature( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, pt: &OPoint<f32, Const<3>>, ) -> (PointProjection, FeatureId)

Projects a point on the boundary of self transformed by m and returns the id of the feature the point was projected on.

fn contains_point( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, pt: &OPoint<f32, Const<3>>, ) -> bool

Tests if the given point is inside of self transformed by m.

impl PointQueryWithLocation for MeshGraph

fn project_local_point_and_get_location_with_max_dist( &self, point: &Point<f32>, solid: bool, max_dist: f32, ) -> Option<(PointProjection, Self::Location)>

Projects a point on self, with a maximum projection distance.

type Location = (Face, ())

Additional shape-specific projection information

fn project_local_point_and_get_location( &self, point: &Point<f32>, solid: bool, ) -> (PointProjection, Self::Location)

Projects a point on self.

fn project_point_and_get_location( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, pt: &OPoint<f32, Const<3>>, solid: bool, ) -> (PointProjection, Self::Location)

Projects a point on self transformed by m.

fn project_point_and_get_location_with_max_dist( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, pt: &OPoint<f32, Const<3>>, solid: bool, max_dist: f32, ) -> Option<(PointProjection, Self::Location)>

Projects a point on self transformed by m, with a maximum projection distance.

impl RayCast for MeshGraph

fn cast_local_ray( &self, ray: &Ray, max_time_of_impact: f32, solid: bool, ) -> Option<f32>

Computes the time of impact between this transform shape and a ray.

fn cast_local_ray_and_get_normal( &self, ray: &Ray, max_time_of_impact: f32, solid: bool, ) -> Option<RayIntersection>

Computes the time of impact, and normal between this transformed shape and a ray.

fn intersects_local_ray(&self, ray: &Ray, max_time_of_impact: f32) -> bool

Tests whether a ray intersects this transformed shape.

fn cast_ray( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, ray: &Ray, max_time_of_impact: f32, solid: bool, ) -> Option<f32>

Computes the time of impact between this transform shape and a ray.

fn cast_ray_and_get_normal( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, ray: &Ray, max_time_of_impact: f32, solid: bool, ) -> Option<RayIntersection>

Computes the time of impact, and normal between this transformed shape and a ray.

fn intersects_ray( &self, m: &Isometry<f32, Unit<Quaternion<f32>>, 3>, ray: &Ray, max_time_of_impact: f32, ) -> bool

Tests whether a ray intersects this transformed shape.

impl TypedSimdCompositeShape for MeshGraph

type PartShape = Triangle

type PartNormalConstraints = ()

type PartId = Face

fn map_typed_part_at( &self, face: Face, f: impl FnMut(Option<&Isometry<f32>>, &Self::PartShape, Option<&Self::PartNormalConstraints>), )

fn map_untyped_part_at( &self, face: Face, f: impl FnMut(Option<&Isometry<f32>>, &dyn Shape, Option<&dyn NormalConstraints>), )

fn typed_qbvh(&self) -> &Qbvh<Face>