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
use crate::{
    objects::{HalfEdge, Surface},
    storage::Handle,
};
use super::{
    curve::{CurveApprox, CurveCache},
    path::RangeOnPath,
    Approx, ApproxPoint, Tolerance,
};
impl Approx for (&Handle<HalfEdge>, &Surface) {
    type Approximation = HalfEdgeApprox;
    type Cache = CurveCache;
    fn approx_with_cache(
        self,
        tolerance: impl Into<Tolerance>,
        cache: &mut Self::Cache,
    ) -> Self::Approximation {
        let (half_edge, surface) = self;
        let boundary = half_edge.boundary();
        let range = RangeOnPath { boundary };
        let first = ApproxPoint::new(
            half_edge.start_vertex().position(),
            half_edge.start_vertex().global_form().position(),
        )
        .with_source((half_edge.clone(), half_edge.boundary()[0]));
        let curve_approx = (half_edge.curve(), surface, range)
            .approx_with_cache(tolerance, cache);
        HalfEdgeApprox {
            first,
            curve_approx,
        }
    }
}
#[derive(Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
pub struct HalfEdgeApprox {
    pub first: ApproxPoint<2>,
    pub curve_approx: CurveApprox,
}
impl HalfEdgeApprox {
    pub fn points(&self) -> Vec<ApproxPoint<2>> {
        let mut points = Vec::new();
        points.push(self.first.clone());
        points.extend(self.curve_approx.points.clone());
        points
    }
}