-
Notifications
You must be signed in to change notification settings - Fork 21
/
ref_search.c
724 lines (622 loc) · 24.3 KB
/
ref_search.c
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
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
/* Copyright 2006, 2014, 2021 United States Government as represented
* by the Administrator of the National Aeronautics and Space
* Administration. No copyright is claimed in the United States under
* Title 17, U.S. Code. All Other Rights Reserved.
*
* The refine version 3 unstructured grid adaptation platform is
* licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
* https://www.apache.org/licenses/LICENSE-2.0.
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
* implied. See the License for the specific language governing
* permissions and limitations under the License.
*/
#include "ref_search.h"
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include "ref_malloc.h"
#include "ref_math.h"
#define MAX_NODE_LIST (100)
REF_FCN REF_STATUS ref_search_create(REF_SEARCH *ref_search_ptr, REF_INT n) {
REF_SEARCH ref_search;
ref_malloc(*ref_search_ptr, 1, REF_SEARCH_STRUCT);
ref_search = (*ref_search_ptr);
ref_search->d = 3;
ref_search->n = n;
ref_search->empty = 0;
ref_malloc_init(ref_search->item, ref_search->n, REF_INT, REF_EMPTY);
ref_malloc_init(ref_search->left, ref_search->n, REF_INT, REF_EMPTY);
ref_malloc_init(ref_search->right, ref_search->n, REF_INT, REF_EMPTY);
ref_malloc(ref_search->pos, ref_search->d * ref_search->n, REF_DBL);
ref_malloc(ref_search->radius, ref_search->n, REF_DBL);
ref_malloc_init(ref_search->children_ball, ref_search->n, REF_DBL, 0.0);
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_free(REF_SEARCH ref_search) {
if (NULL == (void *)ref_search) return REF_NULL;
ref_free(ref_search->children_ball);
ref_free(ref_search->radius);
ref_free(ref_search->pos);
ref_free(ref_search->right);
ref_free(ref_search->left);
ref_free(ref_search->item);
ref_free(ref_search);
return REF_SUCCESS;
}
REF_FCN static REF_STATUS ref_search_distance(REF_SEARCH ref_search, REF_INT a,
REF_INT b, REF_DBL *distance) {
REF_INT i;
*distance = 0.0;
for (i = 0; i < ref_search->d; i++)
(*distance) += pow(ref_search->pos[i + ref_search->d * b] -
ref_search->pos[i + ref_search->d * a],
2);
(*distance) = sqrt(*distance);
return REF_SUCCESS;
}
REF_FCN static REF_STATUS ref_search_home(REF_SEARCH ref_search, REF_INT child,
REF_INT parent) {
REF_DBL child_distance;
REF_DBL left_distance, right_distance;
RUS(REF_EMPTY, child, "empty child");
RUS(REF_EMPTY, parent, "empty parent");
/* done, don't add self to children */
if (child == parent) return REF_SUCCESS;
RSS(ref_search_distance(ref_search, child, parent, &child_distance), "d");
ref_search->children_ball[parent] =
MAX(ref_search->children_ball[parent],
child_distance + ref_search->radius[child]);
if (REF_EMPTY == ref_search->left[parent]) {
ref_search->left[parent] = child;
return REF_SUCCESS;
}
if (REF_EMPTY == ref_search->right[parent]) {
ref_search->right[parent] = child;
return REF_SUCCESS;
}
RSS(ref_search_distance(ref_search, child, ref_search->left[parent],
&left_distance),
"left dist");
RSS(ref_search_distance(ref_search, child, ref_search->right[parent],
&right_distance),
"right dist");
if (left_distance < right_distance) {
RSS(ref_search_home(ref_search, child, ref_search->left[parent]),
"recursively add to left child");
} else {
RSS(ref_search_home(ref_search, child, ref_search->right[parent]),
"recursively add to right child");
}
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_insert(REF_SEARCH ref_search, REF_INT item,
REF_DBL *position, REF_DBL radius) {
REF_INT i, location;
if (ref_search->empty >= ref_search->n)
RSS(REF_INCREASE_LIMIT, "need larger tree for more items");
if (item < 0) RSS(REF_INVALID, "item can not be negative");
location = ref_search->empty;
(ref_search->empty)++;
ref_search->item[location] = item;
for (i = 0; i < ref_search->d; i++)
ref_search->pos[i + ref_search->d * location] = position[i];
ref_search->radius[location] = radius;
RSS(ref_search_home(ref_search, location, 0), "top level home");
return REF_SUCCESS;
}
static REF_INT ref_search_depth_tree(REF_SEARCH ref_search, REF_INT self) {
REF_INT depth, right, left;
depth = 0;
if (REF_EMPTY == self) return depth;
if (self < 0 || ref_search->n <= self) {
printf("self invalid %d n %d self\n", ref_search->n, self);
return REF_EMPTY;
}
if (REF_EMPTY == ref_search->item[self]) return depth;
left = ref_search_depth_tree(ref_search, ref_search->left[self]);
right = ref_search_depth_tree(ref_search, ref_search->right[self]);
depth = 1 + MAX(left, right);
return depth;
}
REF_FCN REF_STATUS ref_search_depth(REF_SEARCH ref_search, REF_INT *depth) {
REF_INT self = 0;
*depth = ref_search_depth_tree(ref_search, self);
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_stats(REF_SEARCH ref_search) {
REF_INT i, empty, two, one, zero;
empty = 0;
two = 0;
one = 0;
zero = 0;
for (i = 0; i < ref_search->n; i++) {
if (REF_EMPTY == ref_search->item[i]) {
empty += 1;
continue;
}
if (REF_EMPTY == ref_search->left[i] && REF_EMPTY == ref_search->right[i]) {
zero += 1;
continue;
}
if (REF_EMPTY != ref_search->left[i] && REF_EMPTY != ref_search->right[i]) {
two += 1;
continue;
}
one += 1;
}
printf("n %d empty %d zero %d one %d two %d\n", ref_search->n, empty, zero,
one, two);
return REF_SUCCESS;
}
REF_FCN static REF_STATUS ref_search_gather(REF_SEARCH ref_search,
REF_LIST ref_list, REF_INT parent,
REF_DBL *position, REF_DBL radius) {
REF_INT i;
REF_DBL distance;
if (0 == ref_search->n) return REF_SUCCESS; /* tree empty */
if (REF_EMPTY == parent) return REF_SUCCESS; /* finished traversing */
RAB(0 <= parent && parent < ref_search->n, "parent invalid",
{ printf("%d n %d parent\n", ref_search->n, parent); })
/* finished traversing */
if (REF_EMPTY == ref_search->item[parent]) return REF_SUCCESS;
distance = 0.0;
for (i = 0; i < ref_search->d; i++)
distance +=
pow(position[i] - ref_search->pos[i + ref_search->d * parent], 2);
distance = sqrt(distance);
/* if the distance between me and the target are less than combined radii */
if (distance <= ref_search->radius[parent] + radius) {
RSS(ref_list_push(ref_list, ref_search->item[parent]), "add item");
}
/* if the distance between me and the target are less than children
* children_ball includes child radii, so only subtract target radius */
if (distance - radius <= ref_search->children_ball[parent]) {
RSS(ref_search_gather(ref_search, ref_list, ref_search->left[parent],
position, radius),
"gthr");
RSS(ref_search_gather(ref_search, ref_list, ref_search->right[parent],
position, radius),
"gthr");
}
return REF_SUCCESS;
}
REF_FCN static REF_STATUS ref_search_gather_seg(REF_SEARCH ref_search,
REF_DBL *xyz, REF_INT parent,
REF_DBL *position,
REF_DBL *distance) {
REF_INT i;
REF_DBL dist;
if (0 == ref_search->n) return REF_SUCCESS; /* tree empty */
if (REF_EMPTY == parent) return REF_SUCCESS; /* finished traversing */
RAB(0 <= parent && parent < ref_search->n, "parent invalid",
{ printf("%d n %d parent\n", ref_search->n, parent); })
/* finished traversing */
if (REF_EMPTY == ref_search->item[parent]) return REF_SUCCESS;
dist = 0.0;
for (i = 0; i < ref_search->d; i++)
dist += pow(position[i] - ref_search->pos[i + ref_search->d * parent], 2);
dist = sqrt(dist);
/* if the distance between me and the target are less than combined radii */
if (dist - ref_search->radius[parent] <= *distance) {
REF_INT element = ref_search->item[parent];
REF_DBL element_dist;
RSS(ref_search_distance2(&(xyz[0 + 6 * element]), &(xyz[3 + 6 * element]),
position, &element_dist),
"dist2");
*distance = MIN(*distance, element_dist);
}
/* if the distance between me and the target are less than children
* children_ball includes child radii, so only subtract target radius */
if (*distance >= dist - ref_search->children_ball[parent]) {
RSS(ref_search_gather_seg(ref_search, xyz, ref_search->left[parent],
position, distance),
"gthr left");
RSS(ref_search_gather_seg(ref_search, xyz, ref_search->right[parent],
position, distance),
"gthr right");
}
return REF_SUCCESS;
}
REF_FCN static REF_STATUS ref_search_gather_tri(REF_SEARCH ref_search,
REF_DBL *xyz, REF_INT parent,
REF_DBL *position,
REF_DBL *distance) {
REF_INT i;
REF_DBL dist;
if (0 == ref_search->n) return REF_SUCCESS; /* tree empty */
if (REF_EMPTY == parent) return REF_SUCCESS; /* finished traversing */
RAB(0 <= parent && parent < ref_search->n, "parent invalid",
{ printf("%d n %d parent\n", ref_search->n, parent); });
/* finished traversing */
if (REF_EMPTY == ref_search->item[parent]) return REF_SUCCESS;
dist = 0.0;
for (i = 0; i < ref_search->d; i++)
dist += pow(position[i] - ref_search->pos[i + ref_search->d * parent], 2);
dist = sqrt(dist);
/* if the distance between me and the target are less than combined radii */
if (dist - ref_search->radius[parent] <= *distance) {
REF_INT element = ref_search->item[parent];
REF_DBL element_dist;
RSS(ref_search_distance3(&(xyz[0 + 9 * element]), &(xyz[3 + 9 * element]),
&(xyz[6 + 9 * element]), position, &element_dist),
"tri dist");
*distance = MIN(*distance, element_dist);
}
/* if the distance between me and the target are less than children
* children_ball includes child radii, so only subtract target radius */
if (*distance >= dist - ref_search->children_ball[parent]) {
RSS(ref_search_gather_tri(ref_search, xyz, ref_search->left[parent],
position, distance),
"gthr left");
RSS(ref_search_gather_tri(ref_search, xyz, ref_search->right[parent],
position, distance),
"gthr right");
}
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_touching(REF_SEARCH ref_search, REF_LIST ref_list,
REF_DBL *position, REF_DBL radius) {
RSS(ref_search_gather(ref_search, ref_list, 0, position, radius), "gthr");
return REF_SUCCESS;
}
REF_FCN static REF_STATUS ref_search_trim(REF_SEARCH ref_search, REF_INT parent,
REF_DBL *position,
REF_DBL *trim_radius) {
REF_INT i;
REF_DBL distance;
if (REF_EMPTY == parent) return REF_SUCCESS;
if (parent >= ref_search->n) return REF_SUCCESS;
if (REF_EMPTY == ref_search->item[parent]) return REF_SUCCESS;
distance = 0.0;
for (i = 0; i < ref_search->d; i++)
distance +=
pow(position[i] - ref_search->pos[i + ref_search->d * parent], 2);
distance = sqrt(distance);
if (distance + ref_search->radius[parent] < *trim_radius) {
*trim_radius = distance + ref_search->radius[parent];
}
/* if the trim_distance is larger than the distance between me and the target
* minus the children_ball look for better */
if (*trim_radius > distance - ref_search->children_ball[parent]) {
RSS(ref_search_trim(ref_search, ref_search->left[parent], position,
trim_radius),
"gthr");
RSS(ref_search_trim(ref_search, ref_search->right[parent], position,
trim_radius),
"gthr");
}
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_trim_radius(REF_SEARCH ref_search,
REF_DBL *position,
REF_DBL *trim_radius) {
REF_INT parent;
parent = 0;
*trim_radius = REF_DBL_MAX;
RSS(ref_search_trim(ref_search, parent, position, trim_radius), "trim");
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_nearest_candidates(REF_SEARCH ref_search,
REF_LIST ref_list,
REF_DBL *position) {
REF_DBL trim_radius;
RSS(ref_search_trim_radius(ref_search, position, &trim_radius), "scope");
RSS(ref_search_touching(ref_search, ref_list, position, trim_radius),
"touches");
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_nearest_candidates_closer_than(
REF_SEARCH ref_search, REF_LIST ref_list, REF_DBL *position,
REF_DBL distance) {
REF_DBL trim_radius;
REF_INT parent;
parent = 0;
trim_radius = distance;
RSS(ref_search_trim(ref_search, parent, position, &trim_radius), "trim");
RSS(ref_search_touching(ref_search, ref_list, position, trim_radius),
"touches");
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_nearest_element(REF_SEARCH ref_search,
REF_INT node_per, REF_DBL *xyz,
REF_DBL *position,
REF_DBL *distance) {
REF_INT parent;
parent = 0;
if (2 == node_per) {
RSS(ref_search_gather_seg(ref_search, xyz, parent, position, distance),
"touches");
} else {
RSS(ref_search_gather_tri(ref_search, xyz, parent, position, distance),
"touches");
}
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_selection(REF_MPI ref_mpi, REF_INT n,
REF_DBL *elements, REF_LONG position,
REF_DBL *value) {
REF_INT i, bisection;
REF_LONG low_pos, high_pos, count;
REF_DBL low_val, high_val, temp, mid_val;
low_pos = 0;
high_pos = (REF_LONG)n;
RSS(ref_mpi_allsum(ref_mpi, &high_pos, 1, REF_LONG_TYPE), "high_pos");
high_pos--;
low_val = REF_DBL_MAX;
high_val = REF_DBL_MIN;
for (i = 0; i < n; i++) {
low_val = MIN(low_val, elements[i]);
high_val = MAX(high_val, elements[i]);
}
temp = low_val;
RSS(ref_mpi_min(ref_mpi, &temp, &low_val, REF_DBL_TYPE), "min");
RSS(ref_mpi_bcast(ref_mpi, &low_val, 1, REF_DBL_TYPE), "bcast");
temp = high_val;
RSS(ref_mpi_max(ref_mpi, &temp, &high_val, REF_DBL_TYPE), "max");
RSS(ref_mpi_bcast(ref_mpi, &high_val, 1, REF_DBL_TYPE), "bcast");
if (position <= low_pos) {
*value = low_val;
return REF_SUCCESS;
}
if (position >= high_pos) {
*value = high_val;
return REF_SUCCESS;
}
mid_val = 0.5 * (low_val + high_val); /* ensure initialized */
for (bisection = 0; bisection < 40; bisection++) {
mid_val = 0.5 * (low_val + high_val);
count = 0;
for (i = 0; i < n; i++) {
if (elements[i] <= mid_val) count++;
}
RSS(ref_mpi_allsum(ref_mpi, &count, 1, REF_LONG_TYPE), "bcast");
/* printf("pos %ld %ld %ld val %f %f %f\n",
low_pos, count, high_pos, low_val,
mid_val, high_val);*/
if (count - 1 < position) {
low_val = mid_val;
} else {
high_val = mid_val;
}
}
*value = mid_val;
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_distance2(REF_DBL *xyz0, REF_DBL *xyz1,
REF_DBL *xyz, REF_DBL *distance) {
REF_DBL dl[3], dxyz[3], len2, proj2, t;
dl[0] = xyz1[0] - xyz0[0];
dl[1] = xyz1[1] - xyz0[1];
dl[2] = xyz1[2] - xyz0[2];
dxyz[0] = xyz[0] - xyz0[0];
dxyz[1] = xyz[1] - xyz0[1];
dxyz[2] = xyz[2] - xyz0[2];
len2 = ref_math_dot(dl, dl);
proj2 = ref_math_dot(dxyz, dl);
if (ref_math_divisible(proj2, len2)) {
t = proj2 / len2;
t = MAX(t, 0.0);
t = MIN(t, 1.0);
dxyz[0] = xyz[0] - (xyz0[0] + t * dl[0]);
dxyz[1] = xyz[1] - (xyz0[1] + t * dl[1]);
dxyz[2] = xyz[2] - (xyz0[2] + t * dl[2]);
*distance = sqrt(ref_math_dot(dxyz, dxyz));
} else { /* length zero, either endpoint */
*distance = sqrt(ref_math_dot(dxyz, dxyz));
}
return REF_SUCCESS;
}
REF_FCN static REF_STATUS ref_search_xyz_normal(REF_DBL *xyz0, REF_DBL *xyz1,
REF_DBL *xyz2,
REF_DBL *normal) {
REF_DBL edge10[3], edge20[3];
edge10[0] = xyz1[0] - xyz0[0];
edge10[1] = xyz1[1] - xyz0[1];
edge10[2] = xyz1[2] - xyz0[2];
edge20[0] = xyz2[0] - xyz0[0];
edge20[1] = xyz2[1] - xyz0[1];
edge20[2] = xyz2[2] - xyz0[2];
ref_math_cross_product(edge10, edge20, normal);
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_distance3(REF_DBL *xyz0, REF_DBL *xyz1,
REF_DBL *xyz2, REF_DBL *xyz,
REF_DBL *distance) {
REF_DBL dist;
REF_DBL bary[3], total, total_normal[3], normal[3];
REF_DBL dxyz[3];
REF_DBL xyzp[3];
RSS(ref_search_xyz_normal(xyz0, xyz1, xyz2, total_normal), "n0");
/* projects query point to triangle plane */
xyzp[0] = xyz[0] - xyz0[0];
xyzp[1] = xyz[1] - xyz0[1];
xyzp[2] = xyz[2] - xyz0[2];
total = ref_math_dot(xyzp, total_normal);
xyzp[0] -= total_normal[0] * total;
xyzp[1] -= total_normal[1] * total;
xyzp[2] -= total_normal[2] * total;
xyzp[0] += xyz0[0];
xyzp[1] += xyz0[1];
xyzp[2] += xyz0[2];
RSS(ref_search_xyz_normal(xyzp, xyz1, xyz2, normal), "n0");
bary[0] = ref_math_dot(normal, total_normal);
RSS(ref_search_xyz_normal(xyz0, xyzp, xyz2, normal), "n1");
bary[1] = ref_math_dot(normal, total_normal);
RSS(ref_search_xyz_normal(xyz0, xyz1, xyzp, normal), "n2");
bary[2] = ref_math_dot(normal, total_normal);
total = bary[0] + bary[1] + bary[2];
if (ref_math_divisible(bary[0], total) &&
ref_math_divisible(bary[1], total) &&
ref_math_divisible(bary[2], total)) {
bary[0] /= total;
bary[1] /= total;
bary[2] /= total;
if (bary[0] >= 0.0 && bary[1] >= 0.0 && bary[2] >= 0.0) {
dxyz[0] =
bary[0] * xyz0[0] + bary[1] * xyz1[0] + bary[2] * xyz2[0] - xyz[0];
dxyz[1] =
bary[0] * xyz0[1] + bary[1] * xyz1[1] + bary[2] * xyz2[1] - xyz[1];
dxyz[2] =
bary[0] * xyz0[2] + bary[1] * xyz1[2] + bary[2] * xyz2[2] - xyz[2];
*distance = sqrt(ref_math_dot(dxyz, dxyz));
return REF_SUCCESS;
}
}
RSS(ref_search_distance2(xyz0, xyz1, xyz, &dist), "e01");
*distance = dist;
RSS(ref_search_distance2(xyz1, xyz2, xyz, &dist), "e12");
*distance = MIN(*distance, dist);
RSS(ref_search_distance2(xyz2, xyz0, xyz, &dist), "e20");
*distance = MIN(*distance, dist);
return REF_SUCCESS;
}
/* Ericson Real Time Collision Detection p141 */
REF_FCN REF_STATUS ref_search_dist3(REF_DBL *a, REF_DBL *b, REF_DBL *c,
REF_DBL *p, REF_DBL *distance) {
REF_DBL ab[3], ac[3], ap[3];
REF_DBL d1, d2;
REF_DBL bp[3];
REF_DBL d3, d4;
REF_DBL vc, v;
REF_DBL proj[3];
REF_DBL cp[3];
REF_DBL d5, d6;
REF_DBL vb, va;
REF_DBL w;
/*
printf("REF_DBL xyz0[]={%.15e, %.15e, %.15e};\n",a[0],a[1],a[2]);
printf("REF_DBL xyz1[]={%.15e, %.15e, %.15e};\n",b[0],b[1],b[2]);
printf("REF_DBL xyz2[]={%.15e, %.15e, %.15e};\n",c[0],c[1],c[2]);
printf("REF_DBL xyz[]={%.15e, %.15e, %.15e};\n",p[0],p[1],p[2]);
*/
/* Check if P in vertex region outside A */
ab[0] = b[0] - a[0];
ab[1] = b[1] - a[1];
ab[2] = b[2] - a[2];
ac[0] = c[0] - a[0];
ac[1] = c[1] - a[1];
ac[2] = c[2] - a[2];
ap[0] = p[0] - a[0];
ap[1] = p[1] - a[1];
ap[2] = p[2] - a[2];
d1 = ab[0] * ap[0] + ab[1] * ap[1] + ab[2] * ap[2];
d2 = ac[0] * ap[0] + ac[1] * ap[1] + ac[2] * ap[2];
if (d1 <= 0.0 && d2 <= 0.0) {
*distance =
sqrt((p[0] - a[0]) * (p[0] - a[0]) + (p[1] - a[1]) * (p[1] - a[1]) +
(p[2] - a[2]) * (p[2] - a[2]));
return REF_SUCCESS;
}
/* Check if P in vertex region outside B */
bp[0] = p[0] - b[0];
bp[1] = p[1] - b[1];
bp[2] = p[2] - b[2];
d3 = ab[0] * bp[0] + ab[1] * bp[1] + ab[2] * bp[2];
d4 = ac[0] * bp[0] + ac[1] * bp[1] + ac[2] * bp[2];
if (d3 >= 0.0 && d4 <= d3) {
*distance =
sqrt((p[0] - b[0]) * (p[0] - b[0]) + (p[1] - b[1]) * (p[1] - b[1]) +
(p[2] - b[2]) * (p[2] - b[2]));
return REF_SUCCESS;
}
/* Check if P in edge region of AB, if so return projection of P onto AB */
vc = d1 * d4 - d3 * d2;
if (vc <= 0.0 && d1 >= 0.0 && d3 <= 0.0) {
RAS(ref_math_divisible(d1, (d1 - d3)), "div zero d1/(d1-d3)");
v = d1 / (d1 - d3);
proj[0] = a[0] + v * ab[0];
proj[1] = a[1] + v * ab[1];
proj[2] = a[2] + v * ab[2];
*distance = sqrt((p[0] - proj[0]) * (p[0] - proj[0]) +
(p[1] - proj[1]) * (p[1] - proj[1]) +
(p[2] - proj[2]) * (p[2] - proj[2]));
return REF_SUCCESS;
}
/* Check if P in vertex region outside C */
cp[0] = p[0] - c[0];
cp[1] = p[1] - c[1];
cp[2] = p[2] - c[2];
d5 = ab[0] * cp[0] + ab[1] * cp[1] + ab[2] * cp[2];
d6 = ac[0] * cp[0] + ac[1] * cp[1] + ac[2] * cp[2];
if (d6 >= 0.0 && d5 <= d6) {
*distance =
sqrt((p[0] - c[0]) * (p[0] - c[0]) + (p[1] - c[1]) * (p[1] - c[1]) +
(p[2] - c[2]) * (p[2] - c[2]));
return REF_SUCCESS;
}
/* Check if P in edge region of AC, if so return projection of P onto AC */
vb = d5 * d2 - d1 * d6;
if (vb <= 0.0 && d2 >= 0.0 && d6 <= 0.0) {
RAS(ref_math_divisible(d2, (d2 - d6)), "div zero d2/(d2-d6)");
v = d2 / (d2 - d6);
proj[0] = a[0] + v * ac[0];
proj[1] = a[1] + v * ac[1];
proj[2] = a[2] + v * ac[2];
*distance = sqrt((p[0] - proj[0]) * (p[0] - proj[0]) +
(p[1] - proj[1]) * (p[1] - proj[1]) +
(p[2] - proj[2]) * (p[2] - proj[2]));
return REF_SUCCESS;
}
/* Check if P in edge region of BC, if so return projection of P onto BC */
va = d3 * d6 - d5 * d4;
if (va <= 0.0 && (d4 - d3) >= 0.0 && (d5 - d6) >= 0.0) {
RAS(ref_math_divisible((d4 - d3), ((d4 - d3) + (d5 - d6))),
"div zero (d4 - d3) / ((d4 - d3) + (d5 - d6))");
v = (d4 - d3) / ((d4 - d3) + (d5 - d6));
proj[0] = b[0] + v * (c[0] - b[0]);
proj[1] = b[1] + v * (c[1] - b[1]);
proj[2] = b[2] + v * (c[2] - b[2]);
*distance = sqrt((p[0] - proj[0]) * (p[0] - proj[0]) +
(p[1] - proj[1]) * (p[1] - proj[1]) +
(p[2] - proj[2]) * (p[2] - proj[2]));
return REF_SUCCESS;
}
RAS(ref_math_divisible(vb, (va + vb + vc)), "div zero vb / (va + vb + vc)");
v = vb / (va + vb + vc);
RAS(ref_math_divisible(vc, (va + vb + vc)), "div zero vc / (va + vb + vc)");
w = vc / (va + vb + vc);
proj[0] = a[0] + v * ab[0] + w * ac[0];
proj[1] = a[1] + v * ab[1] + w * ac[1];
proj[2] = a[2] + v * ab[2] + w * ac[2];
*distance = sqrt((p[0] - proj[0]) * (p[0] - proj[0]) +
(p[1] - proj[1]) * (p[1] - proj[1]) +
(p[2] - proj[2]) * (p[2] - proj[2]));
return REF_SUCCESS;
}
REF_FCN REF_STATUS ref_search_tec(REF_SEARCH ref_search, const char *filename) {
FILE *f;
const char *zonetype = "felineseg";
REF_INT i;
f = fopen(filename, "w");
if (NULL == (void *)f) printf("unable to open %s\n", filename);
RNS(f, "unable to open file");
RAS(3 == ref_search->d, "limited to 3D");
fprintf(f, "title=\"tecplot refine search\"\n");
fprintf(f, "variables = \"x\" \"y\" \"z\" \"r\" \"i\"\n");
fprintf(f,
"zone t=\"tree\", nodes=%d, elements=%d, datapacking=%s, "
"zonetype=%s\n",
ref_search->n, 2 * (ref_search->n), "point", zonetype);
for (i = 0; i < ref_search->n; i++) {
fprintf(f, " %f %f %f %f %d\n", ref_search->pos[0 + ref_search->d * i],
ref_search->pos[1 + ref_search->d * i],
ref_search->pos[2 + ref_search->d * i], ref_search->radius[i],
ref_search->item[i]);
}
for (i = 0; i < ref_search->n; i++) {
REF_INT j;
j = ref_search->right[i];
if (REF_EMPTY == j) j = i;
fprintf(f, " %d %d\n", i + 1, j + 1);
j = ref_search->left[i];
if (REF_EMPTY == j) j = i;
fprintf(f, " %d %d\n", i + 1, j + 1);
}
fclose(f);
return REF_SUCCESS;
}