i_triangle 0.42.0

Polygon Triangulation Library: Efficient Delaunay Triangulation for Complex Shapes.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

use crate::float::triangulation::Triangulation;
use crate::int::triangulation::IndexType;
use alloc::vec::Vec;

pub struct TriangulationBuilder<P, I> {
    points: Vec<P>,
    indices: Vec<I>,
}

impl<P, I: IndexType> TriangulationBuilder<P, I> {
    /// Appends another `Triangulation` to the builder.
    ///
    /// This method correctly offsets the indices of the appended triangulation
    /// based on the current number of points in the builder.
    pub fn append(&mut self, triangulation: Triangulation<P, I>) -> &mut Self {
        let points_count = self.points.len() + triangulation.points.len();
        if points_count > I::MAX {
            panic!(
                "Index type `{}` cannot hold {} points",
                core::any::type_name::<I>(),
                points_count
            );
        }

        let offset = I::try_from(self.points.len()).unwrap_or(I::ZERO);
        self.points.extend(triangulation.points);
        self.indices
            .extend(triangulation.indices.iter().map(|&i| i.add(offset)));
        self
    }

    /// Builds and returns the final `Triangulation`.
    pub fn build(self) -> Triangulation<P, I> {
        Triangulation {
            points: self.points,
            indices: self.indices,
        }
    }
}

impl<P, I> Default for TriangulationBuilder<P, I> {
    fn default() -> Self {
        Self {
            points: Vec::new(),
            indices: Vec::new(),
        }
    }
}