| 1 |
#include "mshmet.h" |
| 2 |
|
| 3 |
|
| 4 |
int norpoi(pMesh mesh,pSol sol) { |
| 5 |
pTria pt; |
| 6 |
pPoint p0,p1,p2; |
| 7 |
double *np,ux,uy,uz,vx,vy,vz,d1,d2,d,nx,ny,nz,poi,sum; |
| 8 |
int i,k,iadr,nsdep,ip1,ip2,list[LONMAX+2],ilist; |
| 9 |
|
| 10 |
assert(mesh->nt); |
| 11 |
sol->nn = (double*)M_calloc(sol->np,sol->dim*sizeof(double),"nn"); |
| 12 |
assert(sol->nn); |
| 13 |
|
| 14 |
for (k=1; k<=mesh->np; k++) { |
| 15 |
p0 = &mesh->point[k]; |
| 16 |
nsdep = p0->s; |
| 17 |
|
| 18 |
pt = &mesh->tria[nsdep]; |
| 19 |
if ( pt->v[0] == k ) i = 0; |
| 20 |
else if ( pt->v[1] == k ) i = 1; |
| 21 |
else i = 2; |
| 22 |
|
| 23 |
ilist = boulep(mesh,nsdep,i,list); |
| 24 |
if ( ilist < 1 ) return(0); |
| 25 |
|
| 26 |
iadr = (k-1)*sol->dim + 1; |
| 27 |
np = &sol->nn[iadr]; |
| 28 |
sum = 0.0; |
| 29 |
|
| 30 |
ip1 = list[1]; |
| 31 |
p1 = &mesh->point[ip1]; |
| 32 |
for (i=2; i<=ilist; i++) { |
| 33 |
ip2 = list[i]; |
| 34 |
p2 = &mesh->point[ip2]; |
| 35 |
|
| 36 |
ux = p1->c[0] - p0->c[0]; |
| 37 |
uy = p1->c[1] - p0->c[1]; |
| 38 |
uz = p1->c[2] - p0->c[2]; |
| 39 |
d1 = ux*ux + uy*uy + uz*uz; |
| 40 |
|
| 41 |
vx = p2->c[0] - p0->c[0]; |
| 42 |
vy = p2->c[1] - p0->c[1]; |
| 43 |
vz = p2->c[2] - p0->c[2]; |
| 44 |
d2 = vx*vx + vy*vy + vz*vz; |
| 45 |
|
| 46 |
nx = uy*vz - uz*vy; |
| 47 |
ny = uz*vx - ux*vz; |
| 48 |
nz = ux*vy - uy*vx; |
| 49 |
d = nx*nx + ny*ny + nz*nz; |
| 50 |
if ( d > 0.0 ) { |
| 51 |
d = 1.0 / sqrt(d); |
| 52 |
poi = (ux*vx + uy*vy + uz*vz) / sqrt(d1*d2); |
| 53 |
poi = acos(poi) * d; |
| 54 |
np[0] += poi * nx; |
| 55 |
np[1] += poi * ny; |
| 56 |
np[2] += poi * nz; |
| 57 |
sum += poi; |
| 58 |
} |
| 59 |
p1 = p2; |
| 60 |
} |
| 61 |
|
| 62 |
d = np[0]*np[0] + np[1]*np[1] + np[2]*np[2]; |
| 63 |
if ( d > 0.0 ) { |
| 64 |
d = 1.0 / sqrt(d); |
| 65 |
np[0] *= d; |
| 66 |
np[1] *= d; |
| 67 |
np[2] *= d; |
| 68 |
} |
| 69 |
} |
| 70 |
|
| 71 |
return(1); |
| 72 |
} |