mesh_find.c 5.31 KB
 Jonathan Lambrechts committed Jan 19, 2017 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 ``````#include #include #include "quadtree.h" #include "mesh.h" #define DIMENSION 2 #include "vector.h" static void _bboxtol(double *bbmin, double *bbmax) { double lmax = 0; for (int i = 0; i < DIMENSION; ++i) { lmax = fmax(lmax, bbmax[i] - bbmin[i]); } double tol = 1e-8 * lmax; for (int i = 0; i < DIMENSION; ++i) { bbmax[i] += tol; bbmin[i] -= tol; } } double volTet(double x0[3], double x1[3], double x2[3], double x3[3]) { // x1 * (y2 * (z3 - z4) - z2 * (y3 - y4) + y3 * z4 - y4 * z3) //- y1 * (x2 * (z3 - z4) - z2 * (x3 - x4) + x3 * z4 - x4 * z3) //+ z1 * (x2 * (y3 - y4) - y2 * (x3 - x4) + x3 * y4 - x4 * y3) //- (x2 * (y3 * z4 - y4 * z3) - y2 * (x3 * z4 - x4 * z3) + z2 * (x3 * y4 - x4 * y3)) return x0[0] * (x1[1] * (x2[2] - x3[2]) - x1[2] * (x2[1] - x3[1]) + x2[1] * x3[2] - x3[1] * x2[2]) - x0[1] * (x1[0] * (x2[2] - x3[2]) - x1[2] * (x2[0] - x3[0]) + x2[0] * x3[2] - x3[0] * x2[2]) + x0[2] * (x1[0] * (x2[1] - x3[1]) - x1[1] * (x2[0] - x3[0]) + x2[0] * x3[1] - x3[0] * x2[1]) - (x1[0] * (x2[1] * x3[2] - x3[1] * x2[2]) - x1[1] * (x2[0] * x3[2] - x3[0] * x2[2]) + x1[2] * (x2[0] * x3[1] - x3[0] * x2[1])); } void particle_to_mesh(size_t nParticles, double *particles, int nElements, double *elements, int *elid, double *Xi) { double bbmin[DIMENSION], bbmax[DIMENSION]; int N = DIMENSION + 1; for (int i = 0; i < DIMENSION; ++i) { bbmin[i] = elements[i]; bbmax[i] = elements[i]; } for (int i = 0; i < N * nElements; ++i) { for (int d = 0; d < DIMENSION; ++d) { bbmin[d] = fmin(bbmin[d], elements[DIMENSION * i + d]); bbmax[d] = fmax(bbmax[d], elements[DIMENSION * i + d]); } } _bboxtol(bbmin, bbmax); Cell *tree = cellNew(bbmin, bbmax); double amin[DIMENSION], amax[DIMENSION]; for (int i = 0; i < nElements; ++i) { double *el = elements + (DIMENSION * N) * i; for (int d = 0; d < DIMENSION; ++d) { amin[d] = el[d]; amax[d] = el[d]; } for (int v = 1; v < N; ++v) {//only simplices for (int d = 0; d < DIMENSION; ++d) { amin[d] = fmin(amin[d], el[v * DIMENSION + d]); amax[d] = fmax(amax[d], el[v * DIMENSION + d]); } } _bboxtol(amin, amax); cellAdd(tree, amin, amax, i, NULL); } int *found = NULL; vectorPushN(&found, 100); vectorClear(found); for (size_t i = 0; i < nParticles; ++i) { double *x = &particles[i * DIMENSION]; elid[i] = -1; cellSearch(tree, x, x, &found); for (size_t j = 0; j < vectorSize(found); ++j) { double *el = &elements[found[j] * N * DIMENSION]; if (DIMENSION == 2) { double *X[3] = {el, el + DIMENSION, el + DIMENSION * 2}; double dx = x[0] - X[0][0], dy = x[1] - X[0][1]; double DX[2] = {X[1][0] - X[0][0], X[2][0] - X[0][0]}; double DY[2] = {X[1][1] - X[0][1], X[2][1] - X[0][1]}; double det = DX[1] * DY[0] - DX[0] * DY[1]; double xi = (DX[1] * dy - DY[1] * dx) / det; double eta = -(DX[0] * dy - DY[0] * dx) / det; if (xi > -1e-8 && eta > -1e-8 && 1 - xi - eta > -1e-8) { Xi[i * DIMENSION + 0] = xi; Xi[i * DIMENSION + 1] = eta; elid[i] = found[j]; break; } } else { double *X[4] = {el, el + DIMENSION, el + DIMENSION * 2, el + DIMENSION * 3}; double v = volTet(X[0], X[1], X[2], X[3]); double v0 = volTet(x, X[1], X[2], X[3]); if (v0 * v < -1e-8) continue; double v1 = volTet(X[0], x, X[2], X[3]); if (v1 * v < -1e-8) continue; double v2 = volTet(X[0], X[1], x, X[3]); if (v2 * v < -1e-8) continue; double v3 = volTet(X[0], X[1], X[2], x); if (v3 * v < -1e-8) continue; Xi[i * 3 + 0] = v1 / v; Xi[i * 3 + 1] = v2 / v; Xi[i * 3 + 2] = v3 / v; elid[i] = found[j]; break; } } /*if (elid[i] == -1) { printf(" PARTICLE %i OUTSIDE DOMAIN N2 search!!!\n", i); double toll = -1000; for (size_t j = 0; j < nElements; ++j) { double *el = &elements[j * N * DIMENSION]; double *X[3] = {el, el + DIMENSION, el + DIMENSION * 2}; double dx = x[0] - X[0][0], dy = x[1] - X[0][1]; double DX[2] = {X[1][0] - X[0][0], X[2][0] - X[0][0]}; double DY[2] = {X[1][1] - X[0][1], X[2][1] - X[0][1]}; double det = DX[1] * DY[0] - DX[0] * DY[1]; double xi = (DX[1] * dy - DY[1] * dx) / det; double eta = -(DX[0] * dy - DY[0] * dx) / det; toll = fmax(toll, fmin(-xi, fmin(-eta, xi + eta -1))); if (xi > -1e-8 && eta > -1e-8 && 1 - xi - eta > -1e-8) { Xi[i * DIMENSION + 0] = xi; Xi[i * DIMENSION + 1] = eta; elid[i] = j; break; } }*/ if (elid[i] == -1) { //printf(" PARTICLE %lu OUTSIDE DOMAIN!!! %g %g\n", i, x[0], x[1]); //exit(1); } //} } vectorFree(found); cellFree(tree); } void mesh_particles_to_mesh(const Mesh *mesh, size_t nParticles, double *particles, int *elid, double *xi) { double *elements = malloc(sizeof(double)*6*mesh->n_triangles); for (int i = 0; i < mesh->n_triangles*3; ++i) { int iv = mesh->triangles[i]; elements[i*2+0] = mesh->x[iv*3+0]; elements[i*2+1] = mesh->x[iv*3+1]; } particle_to_mesh(nParticles,particles,mesh->n_triangles,elements,elid,xi); free(elements); }``````