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
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113

use core::cmp::Ordering;
use i_overlay::i_float::int::point::IntPoint;
use i_overlay::i_float::triangle::Triangle;

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub(crate) struct VSegment {
    pub(crate) a: IntPoint,
    pub(crate) b: IntPoint,
}

impl VSegment {
    #[inline]
    fn is_under_segment_order(&self, other: &VSegment) -> Ordering {
        match self.b.cmp(&other.b) {
            Ordering::Less => Triangle::clock_order_point(self.b, other.a, other.b),
            Ordering::Equal => Triangle::clock_order_point(self.b, self.a, other.a),
            Ordering::Greater => Triangle::clock_order_point(other.b, self.b, self.a),
        }
    }

    #[inline]
    pub(crate) fn is_under_point_order(&self, p: IntPoint) -> Ordering {
        debug_assert!(self.a.x <= p.x && p.x <= self.b.x);
        Triangle::clock_order_point(self.a, p, self.b)
    }
}

impl PartialOrd<Self> for VSegment {
    #[inline]
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl Ord for VSegment {
    #[inline]
    fn cmp(&self, other: &Self) -> Ordering {
        self.is_under_segment_order(other)
    }
}

impl Default for VSegment {
    #[inline]
    fn default() -> Self {
        Self {
            a: IntPoint::ZERO,
            b: IntPoint::ZERO,
        }
    }
}

#[cfg(test)]
mod tests {
    use crate::int::monotone::v_segment::VSegment;
    use core::cmp::Ordering;
    use i_overlay::i_float::int::point::IntPoint;

    #[test]
    fn test_0() {
        let v0 = VSegment {
            a: IntPoint::new(0, 0),
            b: IntPoint::new(5, 0),
        };
        let v1 = VSegment {
            a: IntPoint::new(0, 0),
            b: IntPoint::new(5, 5),
        };

        assert_eq!(v0.is_under_segment_order(&v1), Ordering::Less);
    }

    #[test]
    fn test_1() {
        let v0 = VSegment {
            a: IntPoint::new(-2, -2),
            b: IntPoint::new(5, -2),
        };
        let v1 = VSegment {
            a: IntPoint::new(0, 0),
            b: IntPoint::new(5, 0),
        };

        assert_eq!(v0.is_under_segment_order(&v1), Ordering::Less);
    }

    #[test]
    fn test_2() {
        let v0 = VSegment {
            a: IntPoint::new(-2, -5),
            b: IntPoint::new(5, 0),
        };
        let v1 = VSegment {
            a: IntPoint::new(0, 0),
            b: IntPoint::new(5, 0),
        };

        assert_eq!(v0.is_under_segment_order(&v1), Ordering::Less);
    }

    #[test]
    fn test_3() {
        let v0 = VSegment {
            a: IntPoint::new(0, -5),
            b: IntPoint::new(5, 5),
        };
        let v1 = VSegment {
            a: IntPoint::new(0, 0),
            b: IntPoint::new(5, 0),
        };

        assert_eq!(v0.is_under_segment_order(&v1), Ordering::Greater);
    }
}