| | |
| | | ts_uint jjp,jjm; |
| | | ts_vertex *j,*jp, *jm; |
| | | ts_triangle *jt; |
| | | ts_double s=0,xh=0,yh=0,zh=0,txn=0,tyn=0,tzn=0; |
| | | ts_double s=0.0,xh=0.0,yh=0.0,zh=0.0,txn=0.0,tyn=0.0,tzn=0.0; |
| | | ts_double x1,x2,x3,ctp,ctm,tot,xlen; |
| | | ts_double h,ht; |
| | | for(jj=1; jj<=vtx->neigh_no;jj++){ |
| | | for(jj=1; jj<=vtx->neigh->n;jj++){ |
| | | jjp=jj+1; |
| | | if(jjp>vtx->neigh_no) jjp=1; |
| | | if(jjp>vtx->neigh->n) jjp=1; |
| | | jjm=jj-1; |
| | | if(jjm<1) jjm=vtx->neigh_no; |
| | | j=vtx->neigh[jj-1]; |
| | | jp=vtx->neigh[jjp-1]; |
| | | jm=vtx->neigh[jjm-1]; |
| | | if(jjm<1) jjm=vtx->neigh->n; |
| | | j=vtx->neigh->vtx[jj-1]; |
| | | jp=vtx->neigh->vtx[jjp-1]; |
| | | jm=vtx->neigh->vtx[jjm-1]; |
| | | // printf("tristar_no=%u, neigh_no=%u, jj=%u\n",data->tristar_no,data->neigh_no,jj); |
| | | jt=vtx->tristar[jj-1]; |
| | | x1=vtx_distance_sq(vtx,jp); //shouldn't be zero! |
| | |
| | | #endif |
| | | tot=ctp+ctm; |
| | | tot=0.5*tot; |
| | | |
| | | xlen=vtx_distance_sq(j,vtx); |
| | | /* |
| | | #ifdef TS_DOUBLE_DOUBLE |
| | | vtx->bond[jj-1]->bond_length=sqrt(xlen); |
| | | #endif |
| | |
| | | #endif |
| | | |
| | | vtx->bond[jj-1]->bond_length_dual=tot*vtx->bond[jj-1]->bond_length; |
| | | |
| | | */ |
| | | s+=tot*xlen; |
| | | xh+=tot*(j->x - vtx->x); |
| | | yh+=tot*(j->y - vtx->y); |