finish up plugin architecture
[csRadar.git] / csrMath.h
1 // Copyright (C) 2021 Harry Godden (hgn)
2
3 // Util
4 // ==================================================================================================================
5
6 #define CSR_INLINE static inline
7 #define CSR_PIf 3.14159265358979323846264338327950288f
8
9 // Simple min/max replacements
10 CSR_INLINE float csr_minf( float a, float b )
11 {
12 return a < b? a: b;
13 }
14
15 CSR_INLINE float csr_maxf( float a, float b )
16 {
17 return a > b? a: b;
18 }
19
20 CSR_INLINE int csr_min( int a, int b )
21 {
22 return a < b? a: b;
23 }
24
25 CSR_INLINE int csr_max( int a, int b )
26 {
27 return a > b? a: b;
28 }
29
30 // Convert double precision vec3 into single
31 CSR_INLINE void v3d_v3f( double a[3], float b[3] )
32 {
33 b[0] = a[0];
34 b[1] = a[1];
35 b[2] = a[2];
36 }
37
38 // Convert degrees to radians
39 CSR_INLINE float csr_rad( float deg )
40 {
41 return deg * CSR_PIf / 180.0f;
42 }
43
44 // Vector 2
45 // ==================================================================================================================
46
47 CSR_INLINE void v2_copy( v2f a, v2f b )
48 {
49 b[0] = a[0]; b[1] = a[1];
50 }
51
52 CSR_INLINE void v2_minv( v2f a, v2f b, v2f dest )
53 {
54 dest[0] = csr_minf(a[0], b[0]);
55 dest[1] = csr_minf(a[1], b[1]);
56 }
57
58 CSR_INLINE void v2_maxv( v2f a, v2f b, v2f dest )
59 {
60 dest[0] = csr_maxf(a[0], b[0]);
61 dest[1] = csr_maxf(a[1], b[1]);
62 }
63
64 CSR_INLINE void v2_sub( v2f a, v2f b, v2f d )
65 {
66 d[0] = a[0]-b[0]; d[1] = a[1]-b[1];
67 }
68
69 CSR_INLINE float v2_cross( v2f a, v2f b )
70 {
71 return a[0] * b[1] - a[1] * b[0];
72 }
73
74 CSR_INLINE void v2_add( v2f a, v2f b, v2f d )
75 {
76 d[0] = a[0]+b[0]; d[1] = a[1]+b[1];
77 }
78
79 CSR_INLINE void v2_muls( v2f a, float s, v2f d )
80 {
81 d[0] = a[0]*s; d[1] = a[1]*s;
82 }
83
84 CSR_INLINE void v2_mul( v2f a, v2f b, v2f d )
85 {
86 d[0] = a[0]*b[0]; d[1] = a[1]*b[1];
87 }
88
89 // Vector 3
90 // ==================================================================================================================
91
92 CSR_INLINE void v3_zero( v3f a )
93 {
94 a[0] = 0.f; a[1] = 0.f; a[2] = 0.f;
95 }
96
97 CSR_INLINE void v3_copy( v3f a, v3f b )
98 {
99 b[0] = a[0]; b[1] = a[1]; b[2] = a[2];
100 }
101
102 CSR_INLINE void v3_add( v3f a, v3f b, v3f d )
103 {
104 d[0] = a[0]+b[0]; d[1] = a[1]+b[1]; d[2] = a[2]+b[2];
105 }
106
107 CSR_INLINE void v3_sub( v3f a, v3f b, v3f d )
108 {
109 d[0] = a[0]-b[0]; d[1] = a[1]-b[1]; d[2] = a[2]-b[2];
110 }
111
112 CSR_INLINE void v3_mul( v3f a, v3f b, v3f d )
113 {
114 d[0] = a[0]*b[0]; d[1] = a[1]*b[1]; d[2] = a[2]*b[2];
115 }
116
117 CSR_INLINE void v3_div( v3f a, v3f b, v3f d )
118 {
119 d[0] = a[0]/b[0]; d[1] = a[1]/b[1]; d[2] = a[2]/b[2];
120 }
121
122 CSR_INLINE void v3_muls( v3f a, float s, v3f d )
123 {
124 d[0] = a[0]*s; d[1] = a[1]*s; d[2] = a[2]*s;
125 }
126
127 CSR_INLINE void v3_divs( v3f a, float s, v3f d )
128 {
129 d[0] = a[0]/s; d[1] = a[1]/s; d[2] = a[2]/s;
130 }
131
132 CSR_INLINE void v3_muladds( v3f a, v3f b, float s, v3f d )
133 {
134 d[0] = a[0]+b[0]*s; d[1] = a[1]+b[1]*s; d[2] = a[2]+b[2]*s;
135 }
136
137 CSR_INLINE float v3_dot( v3f a, v3f b )
138 {
139 return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
140 }
141
142 CSR_INLINE void v3_cross( v3f a, v3f b, v3f d )
143 {
144 d[0] = a[1] * b[2] - a[2] * b[1];
145 d[1] = a[2] * b[0] - a[0] * b[2];
146 d[2] = a[0] * b[1] - a[1] * b[0];
147 }
148
149 CSR_INLINE float v3_length2( v3f a )
150 {
151 return v3_dot( a, a );
152 }
153
154 CSR_INLINE float v3_length( v3f a )
155 {
156 return sqrtf( v3_length2( a ) );
157 }
158
159 CSR_INLINE float v3_dist2( v3f a, v3f b )
160 {
161 v3f delta;
162 v3_sub( a, b, delta );
163 return v3_length2( delta );
164 }
165
166 CSR_INLINE float v3_dist( v3f a, v3f b )
167 {
168 return sqrtf( v3_dist2( a, b ) );
169 }
170
171 CSR_INLINE void v3_normalize( v3f a )
172 {
173 v3_muls( a, 1.f / v3_length( a ), a );
174 }
175
176 CSR_INLINE float csr_lerpf( float a, float b, float t )
177 {
178 return a + t*(b-a);
179 }
180
181 CSR_INLINE void v3_lerp( v3f a, v3f b, float t, v3f d )
182 {
183 d[0] = a[0] + t*(b[0]-a[0]);
184 d[1] = a[1] + t*(b[1]-a[1]);
185 d[2] = a[2] + t*(b[2]-a[2]);
186 }
187
188 CSR_INLINE void v3_minv( v3f a, v3f b, v3f dest )
189 {
190 dest[0] = csr_minf(a[0], b[0]);
191 dest[1] = csr_minf(a[1], b[1]);
192 dest[2] = csr_minf(a[2], b[2]);
193 }
194
195 CSR_INLINE void v3_maxv( v3f a, v3f b, v3f dest )
196 {
197 dest[0] = csr_maxf(a[0], b[0]);
198 dest[1] = csr_maxf(a[1], b[1]);
199 dest[2] = csr_maxf(a[2], b[2]);
200 }
201
202 CSR_INLINE float v3_minf( v3f a )
203 {
204 return csr_minf( csr_minf( a[0], a[1] ), a[2] );
205 }
206
207 CSR_INLINE float v3_maxf( v3f a )
208 {
209 return csr_maxf( csr_maxf( a[0], a[1] ), a[2] );
210 }
211
212 CSR_INLINE void v3_fill( v3f a, float v )
213 {
214 a[0] = v;
215 a[1] = v;
216 a[2] = v;
217 }
218
219 // Vector 4
220 // ==================================================================================================================
221
222 CSR_INLINE void v4_copy( v4f a, v4f b )
223 {
224 b[0] = a[0]; b[1] = a[1]; b[2] = a[2]; b[3] = a[3];
225 }
226
227 CSR_INLINE void v4_zero( v4f a )
228 {
229 a[0] = 0.f; a[1] = 0.f; a[2] = 0.f; a[3] = 0.f;
230 }
231
232 // Matrix 3x3
233 //======================================================================================================
234
235 CSR_INLINE void m3x3_inv_transpose( m3x3f src, m3x3f dest )
236 {
237 float a = src[0][0], b = src[0][1], c = src[0][2],
238 d = src[1][0], e = src[1][1], f = src[1][2],
239 g = src[2][0], h = src[2][1], i = src[2][2];
240
241 float det = 1.f /
242 (+a*(e*i-h*f)
243 -b*(d*i-f*g)
244 +c*(d*h-e*g));
245
246 dest[0][0] = (e*i-h*f)*det;
247 dest[1][0] = -(b*i-c*h)*det;
248 dest[2][0] = (b*f-c*e)*det;
249 dest[0][1] = -(d*i-f*g)*det;
250 dest[1][1] = (a*i-c*g)*det;
251 dest[2][1] = -(a*f-d*c)*det;
252 dest[0][2] = (d*h-g*e)*det;
253 dest[1][2] = -(a*h-g*b)*det;
254 dest[2][2] = (a*e-d*b)*det;
255 }
256
257 CSR_INLINE void m3x3_mulv( m3x3f m, v3f v, v3f d )
258 {
259 v3f res;
260
261 res[0] = m[0][0]*v[0] + m[1][0]*v[1] + m[2][0]*v[2];
262 res[1] = m[0][1]*v[0] + m[1][1]*v[1] + m[2][1]*v[2];
263 res[2] = m[0][2]*v[0] + m[1][2]*v[1] + m[2][2]*v[2];
264
265 v3_copy( res, d );
266 }
267
268 // Matrix 4x3
269 // ==================================================================================================================
270
271 #define M4X3_IDENTITY {{1.0f, 0.0f, 0.0f, },\
272 { 0.0f, 1.0f, 0.0f, },\
273 { 0.0f, 0.0f, 1.0f, },\
274 { 0.0f, 0.0f, 0.0f }}
275
276 CSR_INLINE void m4x3_to_3x3( m4x3f a, m3x3f b )
277 {
278 v3_copy( a[0], b[0] );
279 v3_copy( a[1], b[1] );
280 v3_copy( a[2], b[2] );
281 }
282
283 CSR_INLINE void m4x3_copy( m4x3f a, m4x3f b )
284 {
285 v3_copy( a[0], b[0] );
286 v3_copy( a[1], b[1] );
287 v3_copy( a[2], b[2] );
288 v3_copy( a[3], b[3] );
289 }
290
291 CSR_INLINE void m4x3_identity( m4x3f a )
292 {
293 m4x3f id = M4X3_IDENTITY;
294 m4x3_copy( id, a );
295 }
296
297 CSR_INLINE void m4x3_mul( m4x3f a, m4x3f b, m4x3f d )
298 {
299 float
300 a00 = a[0][0], a01 = a[0][1], a02 = a[0][2],
301 a10 = a[1][0], a11 = a[1][1], a12 = a[1][2],
302 a20 = a[2][0], a21 = a[2][1], a22 = a[2][2],
303 a30 = a[3][0], a31 = a[3][1], a32 = a[3][2],
304 b00 = b[0][0], b01 = b[0][1], b02 = b[0][2],
305 b10 = b[1][0], b11 = b[1][1], b12 = b[1][2],
306 b20 = b[2][0], b21 = b[2][1], b22 = b[2][2],
307 b30 = b[3][0], b31 = b[3][1], b32 = b[3][2];
308
309 d[0][0] = a00*b00 + a10*b01 + a20*b02;
310 d[0][1] = a01*b00 + a11*b01 + a21*b02;
311 d[0][2] = a02*b00 + a12*b01 + a22*b02;
312 d[1][0] = a00*b10 + a10*b11 + a20*b12;
313 d[1][1] = a01*b10 + a11*b11 + a21*b12;
314 d[1][2] = a02*b10 + a12*b11 + a22*b12;
315 d[2][0] = a00*b20 + a10*b21 + a20*b22;
316 d[2][1] = a01*b20 + a11*b21 + a21*b22;
317 d[2][2] = a02*b20 + a12*b21 + a22*b22;
318 d[3][0] = a00*b30 + a10*b31 + a20*b32 + a30;
319 d[3][1] = a01*b30 + a11*b31 + a21*b32 + a31;
320 d[3][2] = a02*b30 + a12*b31 + a22*b32 + a32;
321 }
322
323 CSR_INLINE void m4x3_mulv( m4x3f m, v3f v, v3f d )
324 {
325 v3f res;
326
327 res[0] = m[0][0]*v[0] + m[1][0]*v[1] + m[2][0]*v[2] + m[3][0];
328 res[1] = m[0][1]*v[0] + m[1][1]*v[1] + m[2][1]*v[2] + m[3][1];
329 res[2] = m[0][2]*v[0] + m[1][2]*v[1] + m[2][2]*v[2] + m[3][2];
330
331 v3_copy( res, d );
332 }
333
334 // Affine transforms
335
336 CSR_INLINE void m4x3_translate( m4x3f m, v3f v )
337 {
338 v3_muladds( m[3], m[0], v[0], m[3] );
339 v3_muladds( m[3], m[1], v[1], m[3] );
340 v3_muladds( m[3], m[2], v[2], m[3] );
341 }
342
343 CSR_INLINE void m4x3_scale( m4x3f m, float s )
344 {
345 v3_muls( m[0], s, m[0] );
346 v3_muls( m[1], s, m[1] );
347 v3_muls( m[2], s, m[2] );
348 }
349
350 CSR_INLINE void m4x3_rotate_x( m4x3f m, float angle )
351 {
352 m4x3f t = M4X3_IDENTITY;
353 float c, s;
354
355 c = cosf( angle );
356 s = sinf( angle );
357
358 t[1][1] = c;
359 t[1][2] = s;
360 t[2][1] = -s;
361 t[2][2] = c;
362
363 m4x3_mul( m, t, m );
364 }
365
366 CSR_INLINE void m4x3_rotate_y( m4x3f m, float angle )
367 {
368 m4x3f t = M4X3_IDENTITY;
369 float c, s;
370
371 c = cosf( angle );
372 s = sinf( angle );
373
374 t[0][0] = c;
375 t[0][2] = -s;
376 t[2][0] = s;
377 t[2][2] = c;
378
379 m4x3_mul( m, t, m );
380 }
381
382 CSR_INLINE void m4x3_rotate_z( m4x3f m, float angle )
383 {
384 m4x3f t = M4X3_IDENTITY;
385 float c, s;
386
387 c = cosf( angle );
388 s = sinf( angle );
389
390 t[0][0] = c;
391 t[0][1] = s;
392 t[1][0] = -s;
393 t[1][1] = c;
394
395 m4x3_mul( m, t, m );
396 }
397
398 // Warning: These functions are unoptimized..
399 CSR_INLINE void m4x3_expand_aabb_point( m4x3f m, boxf box, v3f point )
400 {
401 v3f v;
402 m4x3_mulv( m, point, v );
403
404 v3_minv( box[0], v, box[0] );
405 v3_maxv( box[1], v, box[1] );
406 }
407
408 CSR_INLINE void box_concat( boxf a, boxf b )
409 {
410 v3_minv( a[0], b[0], a[0] );
411 v3_maxv( a[1], b[1], a[1] );
412 }
413
414 CSR_INLINE void box_copy( boxf a, boxf b )
415 {
416 v3_copy( a[0], b[0] );
417 v3_copy( a[1], b[1] );
418 }
419
420 CSR_INLINE void m4x3_transform_aabb( m4x3f m, boxf box )
421 {
422 v3f a; v3f b;
423
424 v3_copy( box[0], a );
425 v3_copy( box[1], b );
426 v3_fill( box[0], INFINITY );
427 v3_fill( box[1], -INFINITY );
428
429 m4x3_expand_aabb_point( m, box, a );
430 m4x3_expand_aabb_point( m, box, (v3f){ a[0], b[1], a[2] } );
431 m4x3_expand_aabb_point( m, box, (v3f){ b[0], a[1], a[2] } );
432 m4x3_expand_aabb_point( m, box, (v3f){ b[0], b[1], a[2] } );
433 m4x3_expand_aabb_point( m, box, b );
434 m4x3_expand_aabb_point( m, box, (v3f){ a[0], b[1], b[2] } );
435 m4x3_expand_aabb_point( m, box, (v3f){ b[0], a[1], b[2] } );
436 m4x3_expand_aabb_point( m, box, (v3f){ b[0], b[1], b[2] } );
437 }
438
439 // Planes (double precision)
440 // ==================================================================================================================
441
442 CSR_INLINE void tri_to_plane( double a[3], double b[3], double c[3], double p[4] )
443 {
444 double edge0[3];
445 double edge1[3];
446 double l;
447
448 edge0[0] = b[0] - a[0];
449 edge0[1] = b[1] - a[1];
450 edge0[2] = b[2] - a[2];
451
452 edge1[0] = c[0] - a[0];
453 edge1[1] = c[1] - a[1];
454 edge1[2] = c[2] - a[2];
455
456 p[0] = edge0[1] * edge1[2] - edge0[2] * edge1[1];
457 p[1] = edge0[2] * edge1[0] - edge0[0] * edge1[2];
458 p[2] = edge0[0] * edge1[1] - edge0[1] * edge1[0];
459
460 l = sqrt(p[0] * p[0] + p[1] * p[1] + p[2] * p[2]);
461 p[3] = (p[0] * a[0] + p[1] * a[1] + p[2] * a[2]) / l;
462
463 p[0] = p[0] / l;
464 p[1] = p[1] / l;
465 p[2] = p[2] / l;
466 }
467
468 CSR_INLINE int plane_intersect( double a[4], double b[4], double c[4], double p[4] )
469 {
470 double const epsilon = 1e-8f;
471
472 double x[3];
473 double d;
474
475 x[0] = a[1] * b[2] - a[2] * b[1];
476 x[1] = a[2] * b[0] - a[0] * b[2];
477 x[2] = a[0] * b[1] - a[1] * b[0];
478
479 d = x[0] * c[0] + x[1] * c[1] + x[2] * c[2];
480
481 if( d < epsilon && d > -epsilon ) return 0;
482
483 p[0] = (b[1] * c[2] - b[2] * c[1]) * -a[3];
484 p[1] = (b[2] * c[0] - b[0] * c[2]) * -a[3];
485 p[2] = (b[0] * c[1] - b[1] * c[0]) * -a[3];
486
487 p[0] += (c[1] * a[2] - c[2] * a[1]) * -b[3];
488 p[1] += (c[2] * a[0] - c[0] * a[2]) * -b[3];
489 p[2] += (c[0] * a[1] - c[1] * a[0]) * -b[3];
490
491 p[0] += (a[1] * b[2] - a[2] * b[1]) * -c[3];
492 p[1] += (a[2] * b[0] - a[0] * b[2]) * -c[3];
493 p[2] += (a[0] * b[1] - a[1] * b[0]) * -c[3];
494
495 p[0] = -p[0] / d;
496 p[1] = -p[1] / d;
497 p[2] = -p[2] / d;
498
499 return 1;
500 }
501
502 CSR_INLINE double plane_polarity( double p[4], double a[3] )
503 {
504 return
505 (a[0] * p[0] + a[1] * p[1] + a[2] * p[2])
506 -(p[0]*p[3] * p[0] + p[1]*p[3] * p[1] + p[2]*p[3] * p[2])
507 ;
508 }