Struct truck_meshalgo::rexport_polymesh::Faces

source ·

pub struct Faces<V = StandardVertex> { /* private fields */ }

Expand description

Faces of polygon mesh

To optimize for the case where the polygon mesh consists only triangles and quadrangle, there are vectors which consist by each triangles and quadrilaterals, internally.

Implementations§

source §

impl<V> Faces<V>where
V: Copy,

source

pub fn extend<U, T, I>(&mut self, iter: I)where
 U: Copy + Into<V>,
 T: AsRef<[U]>,
 I: IntoIterator<Item = T>,

Extends faces by an iterator.

source

pub const fn from_tri_and_quad_faces(
tri_faces: Vec<[V; 3], Global>,
quad_faces: Vec<[V; 4], Global>
) -> Faces<V>

Creates faces of a polygon mesh by the vectors of triangle and quadrangle.

Examples

// Creates faces consisis only triangles.
use truck_polymesh::*;
let tri_faces: Vec<[StandardVertex; 3]> = vec![
    [[0, 0, 0].into(), [1, 1, 1].into(), [2, 2, 2].into()],
    [[0, 0, 0].into(), [2, 2, 2].into(), [3, 3, 3].into()],
];
let faces = Faces::from_tri_and_quad_faces(tri_faces, Vec::new());

source

pub fn push<U, T>(&mut self, face: T)where
U: Copy + Into<V>,
T: AsRef<[U]>,

Push a face to the faces.

If face.len() < 3, the face is ignored with warning.

Examples

use truck_polymesh::*;
let mut faces = Faces::<StandardVertex>::default(); // empty faces
faces.push(&[[0, 0, 0], [1, 1, 1], [2, 2, 2]]);
faces.push(&[[3, 3, 3], [0, 0, 0], [2, 2, 2]]);
faces.push(&[[0, 0, 0], [4, 4, 4], [5, 5, 5], [1, 1, 1]]);
faces.push(&[[100, 1000, 10]]); // Wargning: ignored one vertex "face"

source

pub const fn tri_faces(&self) -> &Vec<[V; 3], Global> ⓘ

Returns the vector of triangles.

source

pub fn tri_faces_mut(&mut self) -> &mut [[V; 3]]

Returns the mutable slice of triangles.

source

pub const fn quad_faces(&self) -> &Vec<[V; 4], Global> ⓘ

Returns the vector of quadrangles.

source

pub fn quad_faces_mut(&mut self) -> &mut [[V; 4]]

Returns the mutable slice of quadrangles.

source

pub const fn other_faces(&self) -> &Vec<Vec<V, Global>, Global> ⓘ

Returns the vector of n-gons (n > 4).

source

pub fn other_faces_mut(&mut self) -> impl Iterator<Item = &mut [V]>

Returns the mutable iterator of n-gons (n > 4).

source

pub fn face_iter(&self) -> impl Iterator<Item = &[V]>

Returns the iterator of the slice.

By the internal optimization, this iterator does not runs in the simple order in which they are registered, but runs order: triangle, square, and the others.

Examples

use truck_polymesh::*;
let slice: &[&[usize]] = &[
    &[0, 1, 2],
    &[0, 4, 5, 1],
    &[1, 2, 6, 7, 8, 9],
    &[0, 2, 3],
];
let faces = Faces::<usize>::from_iter(slice);
let mut iter = faces.face_iter();
assert_eq!(iter.next(), Some([0, 1, 2].as_ref()));
assert_eq!(iter.next(), Some([0, 2, 3].as_ref()));
assert_eq!(iter.next(), Some([0, 4, 5, 1].as_ref()));
assert_eq!(iter.next(), Some([1, 2, 6, 7, 8, 9].as_ref()));
assert_eq!(iter.next(), None);

source

pub fn face_iter_mut(&mut self) -> impl Iterator<Item = &mut [V]>

Returns the iterator of the slice.

By the internal optimization, this iterator does not runs in the simple order in which they are registered, but runs order: triangle, square, and the others. cf: Faces:face_iter

source

pub fn is_empty(&self) -> bool

Returns true if the faces is empty.

source

pub fn len(&self) -> usize

Returns the number of faces.

source

pub fn naive_concat(&mut self, other: Faces<V>)

Merges other into self.

source

pub fn triangle_iter(&self) -> TriangleIterator<'_, V> ⓘ

Returns iterator with triangulation faces

Examples

use truck_polymesh::*;
let slice: &[&[usize]] = &[
    &[0, 1, 2],
    &[0, 4, 5, 1],
    &[1, 2, 6, 7, 8, 9],
    &[1, 2, 4, 3],
    &[0, 2, 3],
];
let faces = Faces::<usize>::from_iter(slice);
let mut iter = faces.triangle_iter();
assert_eq!(iter.len(), 10);
assert_eq!(iter.next(), Some([0, 1, 2]));
assert_eq!(iter.next(), Some([0, 2, 3]));
assert_eq!(iter.next(), Some([0, 4, 5]));
assert_eq!(iter.next(), Some([0, 5, 1]));
assert_eq!(iter.next(), Some([1, 2, 4]));
assert_eq!(iter.next(), Some([1, 4, 3]));
assert_eq!(iter.next(), Some([1, 2, 6]));
assert_eq!(iter.next(), Some([1, 6, 7]));
assert_eq!(iter.next(), Some([1, 7, 8]));
assert_eq!(iter.next(), Some([1, 8, 9]));
assert_eq!(iter.len(), 0);
assert_eq!(iter.next(), None);