del-geo 0.1.29

2D/3D geometry utility codes
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229

//! methods for 2D triangle

pub fn area_<T>(p0: &[T; 2], p1: &[T; 2], p2: &[T; 2]) -> T
where
    T: num_traits::Float,
{
    assert!(p0.len() == 2 && p1.len() == 2 && p2.len() == 2);
    let half = T::one() / (T::one() + T::one());
    half * ((p1[0] - p0[0]) * (p2[1] - p0[1]) - (p2[0] - p0[0]) * (p1[1] - p0[1]))
}

pub fn is_inside<Real>(
    p0: &[Real; 2],
    p1: &[Real; 2],
    p2: &[Real; 2],
    q: &[Real; 2],
    sign: Real,
) -> Option<(Real, Real)>
where
    Real: num_traits::Float,
{
    let a0 = area_(q, p1, p2) * sign;
    if a0 < Real::zero() {
        return None;
    }
    let a1 = area_(q, p2, p0) * sign;
    if a1 < Real::zero() {
        return None;
    }
    let a2 = area_(q, p0, p1) * sign;
    if a2 < Real::zero() {
        return None;
    }
    let sum_area_inv = Real::one() / (a0 + a1 + a2);
    Some((a0 * sum_area_inv, a1 * sum_area_inv))
}

/// shape function's derivative in x- and y-direction and the constant term
///
/// # Example
/// ```
/// let (dldx, c) = del_geo::tri2::dldx_(&[0., 1.], &[1., 2.], &[3., 4.]);
/// let a = dldx[0][2]; // x-differentiation of L^2
/// ```
pub fn dldx_<T>(p0: &[T; 2], p1: &[T; 2], p2: &[T; 2]) -> ([[T; 3]; 2], [T; 3])
where
    T: num_traits::Float,
{
    assert!(p0.len() == 2 && p1.len() == 2 && p2.len() == 2);
    let half = T::one() / (T::one() + T::one());
    let a0 = area_(p0, p1, p2);
    let tmp1: T = half / a0;
    (
        [
            [
                tmp1 * (p1[1] - p2[1]),
                tmp1 * (p2[1] - p0[1]),
                tmp1 * (p0[1] - p1[1]),
            ],
            [
                tmp1 * (p2[0] - p1[0]),
                tmp1 * (p0[0] - p2[0]),
                tmp1 * (p1[0] - p0[0]),
            ],
        ],
        [
            tmp1 * (p1[0] * p2[1] - p2[0] * p1[1]),
            tmp1 * (p2[0] * p0[1] - p0[0] * p2[1]),
            tmp1 * (p0[0] * p1[1] - p1[0] * p0[1]),
        ],
    )
}

pub fn barycentric_coords<Real>(
    p0: &[Real; 2],
    p1: &[Real; 2],
    p2: &[Real; 2],
    q: &[Real; 2],
) -> Option<(Real, Real, Real)>
where
    Real: num_traits::Float,
{
    let a0 = area_(q, p1, p2);
    let a1 = area_(q, p2, p0);
    let a2 = area_(q, p0, p1);
    if (a0 + a1 + a2).is_zero() {
        return None;
    }
    let sum_area_inv = Real::one() / (a0 + a1 + a2);
    Some((a0 * sum_area_inv, a1 * sum_area_inv, a2 * sum_area_inv))
}

// ----------------------------

pub fn area<T>(v1: &nalgebra::Vector2<T>, v2: &nalgebra::Vector2<T>, v3: &nalgebra::Vector2<T>) -> T
where
    T: nalgebra::RealField + Copy,
{
    ((v2[0] - v1[0]) * (v3[1] - v1[1]) - (v3[0] - v1[0]) * (v2[1] - v1[1])) / (T::one() + T::one())
}

pub fn circumcenter<T>(
    p0: &nalgebra::Vector2<T>,
    p1: &nalgebra::Vector2<T>,
    p2: &nalgebra::Vector2<T>,
) -> nalgebra::Vector2<T>
where
    T: nalgebra::RealField + Copy + std::fmt::Debug,
{
    let a0 = (p1 - p2).norm_squared();
    let a1 = (p2 - p0).norm_squared();
    let a2 = (p0 - p1).norm_squared();

    let b0: T = a0 * (a1 + a2 - a0);
    let b1: T = a1 * (a0 + a2 - a1);
    let b2: T = a2 * (a0 + a1 - a2);
    let sum = T::one() / (b0 + b1 + b2);

    let c0 = b0 * sum;
    let c1 = b1 * sum;
    let c2 = b2 * sum;

    p0.scale(c0) + p1.scale(c1) + p2.scale(c2)
}

#[test]
fn test_circumcenter() {
    type VEC = nalgebra::Vector2<f64>;
    let p0 = [VEC::new(1.3, 2.1), VEC::new(3.2, 2.1), VEC::new(1.5, 2.5)];
    let cc0 = circumcenter(&p0[0], &p0[1], &p0[2]);
    let d0 = (cc0 - p0[0]).norm_squared();
    let d1 = (cc0 - p0[1]).norm_squared();
    let d2 = (cc0 - p0[2]).norm_squared();
    assert!((d0 - d1).abs() < d0 * 1.0e-10);
    assert!((d0 - d2).abs() < d0 * 1.0e-10);
}

pub fn wdw_circumcenter<T>(
    p0: &nalgebra::Vector2<T>,
    p1: &nalgebra::Vector2<T>,
    p2: &nalgebra::Vector2<T>,
) -> (nalgebra::Vector2<T>, [nalgebra::Matrix2<T>; 3])
where
    T: nalgebra::RealField + Copy + std::fmt::Debug + num_traits::Float,
{
    let a0 = (p1 - p2).norm_squared();
    let a1 = (p2 - p0).norm_squared();
    let a2 = (p0 - p1).norm_squared();
    //
    let b0: T = a0 * (a1 + a2 - a0);
    let b1: T = a1 * (a2 + a0 - a1);
    let b2: T = a2 * (a0 + a1 - a2);
    //
    let sum = b0 + b1 + b2;
    let sum_inv = T::one() / sum;
    //
    let c0 = b0 * sum_inv;
    let c1 = b1 * sum_inv;
    let c2 = b2 * sum_inv;
    let cc = p0.scale(c0) + p1.scale(c1) + p2.scale(c2);
    // -----------------
    let two = T::one() + T::one();
    let db0 = [
        (p0 - p2 + p0 - p1).scale(two * a0),
        (p1 - p0 + p2 - p1).scale(two * a0) + (p1 - p2).scale(two * (a1 + a2 - a0)),
        (p2 - p0 + p1 - p2).scale(two * a0) + (p2 - p1).scale(two * (a1 + a2 - a0)),
    ];
    let db1 = [
        (p0 - p1 + p2 - p0).scale(two * a1) + (p0 - p2).scale(two * (a2 + a0 - a1)),
        (p1 - p0 + p1 - p2).scale(two * a1),
        (p2 - p1 + p0 - p2).scale(two * a1) + (p2 - p0).scale(two * (a2 + a0 - a1)),
    ];
    let db2 = [
        (p0 - p2 + p1 - p0).scale(two * a2) + (p0 - p1).scale(two * (a0 + a1 - a2)),
        (p1 - p2 + p0 - p1).scale(two * a2) + (p1 - p0).scale(two * (a0 + a1 - a2)),
        (p2 - p1 + p2 - p0).scale(two * a2),
    ];
    let tmp = -T::one() / (sum * sum);
    let dsum_inv = [
        (db0[0] + db1[0] + db2[0]) * tmp,
        (db0[1] + db1[1] + db2[1]) * tmp,
        (db0[2] + db1[2] + db2[2]) * tmp,
    ];
    //
    let dcc = [
        nalgebra::Matrix2::<T>::identity() * c0
            + p0 * (db0[0].scale(sum_inv) + dsum_inv[0].scale(b0)).transpose()
            + p1 * (db1[0].scale(sum_inv) + dsum_inv[0].scale(b1)).transpose()
            + p2 * (db2[0].scale(sum_inv) + dsum_inv[0].scale(b2)).transpose(),
        nalgebra::Matrix2::<T>::identity() * c1
            + p0 * (db0[1].scale(sum_inv) + dsum_inv[1].scale(b0)).transpose()
            + p1 * (db1[1].scale(sum_inv) + dsum_inv[1].scale(b1)).transpose()
            + p2 * (db2[1].scale(sum_inv) + dsum_inv[1].scale(b2)).transpose(),
        nalgebra::Matrix2::<T>::identity() * c2
            + p0 * (db0[2].scale(sum_inv) + dsum_inv[2].scale(b0)).transpose()
            + p1 * (db1[2].scale(sum_inv) + dsum_inv[2].scale(b1)).transpose()
            + p2 * (db2[2].scale(sum_inv) + dsum_inv[2].scale(b2)).transpose(),
    ];

    (cc, dcc)
}

#[test]
fn test_dw_circumcenter() {
    type VEC = nalgebra::Vector2<f64>;
    let p0 = [VEC::new(0.1, 0.2), VEC::new(1.3, 0.2), VEC::new(0.3, 1.5)];
    let (cc0, dcc0) = wdw_circumcenter(&p0[0], &p0[1], &p0[2]);
    let eps = 1.0e-4;
    for i_node in 0..3 {
        for i_dim in 0..2 {
            let p1 = {
                let mut p1 = p0;
                p1[i_node][i_dim] += eps;
                p1
            };
            let (cc1, _dcc1) = wdw_circumcenter(&p1[0], &p1[1], &p1[2]);
            let dcc_num = (cc1 - cc0) / eps;
            let mut b = nalgebra::Vector2::<f64>::zeros();
            b[i_dim] = 1.0;
            let dcc_ana = dcc0[i_node] * b;
            let diff = (dcc_num - dcc_ana).norm();
            assert!(diff < 1.0e-4);
            println!(
                "{}, {} --> {:?}, {:?}, {:?}",
                i_node, i_dim, dcc_num, dcc_ana, diff
            );
        }
    }
}