rene 0.2.0

Computational geometry.
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77

use crate::constants::MIN_CONTOUR_VERTICES_COUNT;
use crate::operations::{shrink_collinear_vertices, Orient};

use super::mesh::Mesh;
use super::operations::{BoundaryEndpoints, DelaunayTriangulatable};
use super::quad_edge::{QuadEdge, UNDEFINED_QUAD_EDGE};

#[derive(Clone)]
pub(crate) struct DelaunayTriangulation<Endpoint> {
    left_side: QuadEdge,
    mesh: Mesh<Endpoint>,
    right_side: QuadEdge,
}

impl<Endpoint> BoundaryEndpoints<Endpoint> for DelaunayTriangulation<Endpoint>
where
    for<'a> &'a Endpoint: Orient,
{
    fn get_boundary_endpoints(&self) -> Vec<&Endpoint> {
        let endpoints = self.mesh.get_endpoints();
        if endpoints.len() < MIN_CONTOUR_VERTICES_COUNT {
            endpoints.iter().collect()
        } else {
            let mut result = Vec::new();
            let start = self.left_side;
            let mut edge = start;
            loop {
                result.push(self.mesh.get_start(edge));
                let candidate = self.mesh.to_right_from_end(edge);
                if candidate == start {
                    break;
                }
                edge = candidate;
            }
            shrink_collinear_vertices(&result)
        }
    }
}

impl<Endpoint: Ord> From<Vec<Endpoint>> for DelaunayTriangulation<Endpoint>
where
    Mesh<Endpoint>: DelaunayTriangulatable,
{
    fn from(mut endpoints: Vec<Endpoint>) -> Self {
        endpoints.sort();
        endpoints.dedup();
        let mut mesh = Mesh::from(endpoints);
        let (left_side, right_side) = mesh.delaunay_triangulation();
        Self {
            left_side,
            mesh,
            right_side,
        }
    }
}

impl<Endpoint> DelaunayTriangulation<Endpoint> {
    pub(crate) fn is_empty(&self) -> bool {
        let result = self.mesh.is_empty();
        debug_assert_eq!(self.left_side == UNDEFINED_QUAD_EDGE, result);
        debug_assert_eq!(self.right_side == UNDEFINED_QUAD_EDGE, result);
        result
    }
}

impl<Endpoint: PartialOrd> DelaunayTriangulation<Endpoint>
where
    for<'a> &'a Endpoint: Orient,
{
    pub(crate) fn iter_triangles_vertices(
        &self,
    ) -> impl Iterator<Item = (&Endpoint, &Endpoint, &Endpoint)> {
        self.mesh.to_triangles_base_edges().map(move |base_edge| {
            self.mesh.triangle_base_to_vertices(base_edge)
        })
    }
}