/[escript]/branches/domexper/dudley/src/Mesh_findMatchingFaces.c
ViewVC logotype

Annotation of /branches/domexper/dudley/src/Mesh_findMatchingFaces.c

Parent Directory Parent Directory | Revision Log Revision Log


Revision 757 - (hide annotations)
Mon Jun 26 13:12:56 2006 UTC (13 years ago) by woo409
Original Path: trunk/finley/src/Mesh_findMatchingFaces.c
File MIME type: text/plain
File size: 8927 byte(s)
+ Merge of intelc_win32 branch (revision 741:755) with trunk. Tested on iVEC altix (run_tests and py_tests all pass)

1 jgs 150 /*
2 elspeth 616 ************************************************************
3     * Copyright 2006 by ACcESS MNRF *
4     * *
5     * http://www.access.edu.au *
6     * Primary Business: Queensland, Australia *
7     * Licensed under the Open Software License version 3.0 *
8     * http://www.opensource.org/licenses/osl-3.0.php *
9     * *
10     ************************************************************
11 jgs 150 */
12    
13 jgs 82 /**************************************************************/
14    
15     /* Finley: Mesh */
16    
17     /* searches for faces in the mesh which are matching */
18    
19     /**************************************************************/
20    
21 jgs 150 /* Author: gross@access.edu.au */
22     /* Version: $Id$
23 jgs 82
24     /**************************************************************/
25    
26     #include "Util.h"
27     #include "Mesh.h"
28     /**************************************************************/
29    
30     static double Finley_Mesh_lockingGridSize=0;
31    
32     int Finley_Mesh_findMatchingFaces_compar(const void *arg1 , const void *arg2 ) {
33     Finley_Mesh_findMatchingFaces_center *e1,*e2;
34 jgs 123 bool_t l,g;
35     dim_t i;
36 jgs 82 e1=(Finley_Mesh_findMatchingFaces_center*) arg1;
37     e2=(Finley_Mesh_findMatchingFaces_center*) arg2;
38     for (i=0;i<MAX_numDim;i++) {
39     l= (e1->x[i]<e2->x[i]+Finley_Mesh_lockingGridSize) ? TRUE : FALSE;
40     g= (e2->x[i]<e1->x[i]+Finley_Mesh_lockingGridSize) ? TRUE : FALSE;
41     if (! (l && g)) {
42     if (l) return -1;
43     if (g) return 1;
44     }
45     }
46     return 0;
47     }
48    
49     void Finley_Mesh_findMatchingFaces(Finley_NodeFile *nodes, Finley_ElementFile *faces, double safety_factor,double tolerance,
50 jgs 123 dim_t* numPairs, index_t* elem0,index_t* elem1,index_t* matching_nodes_in_elem1) {
51 jgs 82 #define getDist(_dist_,_e0_,_i0_,_e1_,_i1_) \
52 jgs 123 {dim_t i; \
53 jgs 82 _dist_=0; \
54     for (i=0;i<numDim;i++) _dist_=MAX(_dist_,ABS(X[INDEX3(i,_i0_,_e0_,numDim,NN)]-X[INDEX3(i,_i1_,_e1_,numDim,NN)])); \
55     }
56    
57     #define SWAP(_i1_,_i2_) \
58 jgs 123 {index_t* i; \
59 jgs 82 i=(_i2_); \
60     (_i2_)=(_i1_); \
61     (_i1_)=i; \
62     }
63    
64 jgs 150 char error_msg[LenErrorMsg_MAX];
65 jgs 82 double h=DBLE(HUGE_VAL),h_local,dist,*X=NULL;
66 jgs 123 dim_t NN=faces->ReferenceElement->Type->numNodes;
67     dim_t numDim=nodes->numDim;
68 jgs 82 Finley_Mesh_findMatchingFaces_center *center;
69 jgs 123 index_t e_0,e_1,a1[NN],a2[NN],*perm,*perm_tmp;
70     dim_t e,i,i0,i1,n;
71 jgs 82
72 jgs 102 X=TMPMEMALLOC(NN*numDim*faces->numElements,double);
73     center=TMPMEMALLOC(faces->numElements,Finley_Mesh_findMatchingFaces_center);
74 jgs 82 if (!(Finley_checkPtr(X) || Finley_checkPtr(center)) ) {
75     /* OMP */
76     for (e=0;e<faces->numElements;e++) {
77     /* get the coordinates of the nodes */
78     Finley_Util_Gather_double(NN,&(faces->Nodes[INDEX2(0,e,NN)]),numDim,nodes->Coordinates,&(X[INDEX3(0,0,e,numDim,NN)]));
79     /* get the element center */
80     center[e].refId=e;
81     for (i=0;i<MAX_numDim;i++) center[e].x[i]=0;
82     for (i0=0;i0<faces->ReferenceElement->Type->numNodesOnFace;i0++) {
83     for (i=0;i<numDim;i++) center[e].x[i]+=X[INDEX3(i,faces->ReferenceElement->Type->faceNode[i0],e,numDim,NN)];
84     }
85     for (i=0;i<numDim;i++) center[e].x[i]/=faces->ReferenceElement->Type->numNodesOnFace;
86     /* get the minimum distance between nodes in the element */
87     for (i0=0;i0<faces->ReferenceElement->Type->numNodesOnFace;i0++) {
88     for (i1=i0+1;i1<faces->ReferenceElement->Type->numNodesOnFace;i1++) {
89     getDist(h_local,e,faces->ReferenceElement->Type->faceNode[i0],e,faces->ReferenceElement->Type->faceNode[i1]);
90     h=MIN(h,h_local);
91     }
92     }
93     }
94     /* set the */
95     Finley_Mesh_lockingGridSize=h*MAX(safety_factor,0);
96     #ifdef Finley_TRACE
97     printf("locking grid size is %e\n",Finley_Mesh_lockingGridSize);
98     #endif
99     /* sort the elements by center center coordinates (lexigraphical)*/
100     qsort(center,faces->numElements,sizeof(Finley_Mesh_findMatchingFaces_center),Finley_Mesh_findMatchingFaces_compar);
101     /* find elements with matching center */
102     *numPairs=0;
103     /* OMP */
104 jgs 150 for (e=0;e<faces->numElements-1 && Finley_noError();e++) {
105 jgs 82 if (Finley_Mesh_findMatchingFaces_compar((void*) &(center[e]),(void*) &(center[e+1]))==0) {
106     e_0=center[e].refId;
107     e_1=center[e+1].refId;
108     elem0[*numPairs]=e_0;
109     elem1[*numPairs]=e_1;
110     /* now the element e_1 is rotated such that the first node in element e_0 and e_1 have the same coordinates */
111     perm=a1;
112     perm_tmp=a2;
113     for (i=0;i<NN;i++) perm[i]=i;
114 jgs 150 while (Finley_noError()) {
115 jgs 82 /* if node 0 and perm[0] are the same we are ready */
116     getDist(dist,e_0,0,e_1,perm[0]);
117     if (dist<=h*tolerance) break;
118     if (faces->ReferenceElement->Type->shiftNodes[0]>=0) {
119     /* rotate the nodes */
120     for (i=0;i<NN;i++) perm_tmp[i]=perm[faces->ReferenceElement->Type->shiftNodes[i]];
121     SWAP(perm,perm_tmp);
122     }
123     /* if the permutation is back at the identity, ie. perm[0]=0, the faces don't match: */
124     if (perm[0]==0) {
125 jgs 150 sprintf(error_msg,"__FILE__:couldn't match first node of element %d to touching element %d",e_0,e_1);
126     Finley_setError(VALUE_ERROR,error_msg);
127 jgs 82 }
128     }
129     /* now we check if the second nodes match */
130 jgs 150 if (Finley_noError()) {
131 jgs 82 if (faces->ReferenceElement->Type->numNodesOnFace>1) {
132     getDist(dist,e_0,1,e_1,perm[faces->ReferenceElement->Type->faceNode[1]]);
133     /* if the second node does not match we reverse the direction of the nodes */
134     if (dist>h*tolerance) {
135     /* rotate the nodes */
136     if (faces->ReferenceElement->Type->reverseNodes[0]<0) {
137 jgs 150 sprintf(error_msg,"__FILE__:couldn't match the second node of element %d to touching element %d",e_0,e_1);
138     Finley_setError(VALUE_ERROR,error_msg);
139 jgs 82 } else {
140     for (i=0;i<NN;i++) perm_tmp[i]=perm[faces->ReferenceElement->Type->reverseNodes[i]];
141     SWAP(perm,perm_tmp);
142     getDist(dist,e_0,1,e_1,perm[faces->ReferenceElement->Type->faceNode[1]]);
143     if (dist>h*tolerance) {
144 jgs 150 sprintf(error_msg,"__FILE__:couldn't match the second node of element %d to touching element %d",e_0,e_1);
145     Finley_setError(VALUE_ERROR,error_msg);
146 jgs 82 }
147     }
148     }
149     }
150     }
151     /* we check if the rest of the face nodes match: */
152 jgs 150 if (Finley_noError()) {
153 jgs 82 for (i=2;i<faces->ReferenceElement->Type->numNodesOnFace;i++) {
154     n=faces->ReferenceElement->Type->faceNode[i];
155     getDist(dist,e_0,n,e_1,perm[n]);
156     if (dist>h*tolerance) {
157 jgs 150 sprintf(error_msg,"__FILE__:couldn't match the %d-th node of element %d to touching element %d",i,e_0,e_1);
158     Finley_setError(VALUE_ERROR,error_msg);
159 jgs 82 break;
160     }
161     }
162     }
163     /* copy over the permuted nodes of e_1 into matching_nodes_in_elem1 */
164 jgs 150 if (Finley_noError()) {
165 jgs 82 for (i=0;i<NN;i++) matching_nodes_in_elem1[INDEX2(i,*numPairs,NN)]=faces->Nodes[INDEX2(perm[i],e_1,NN)];
166     }
167     (*numPairs)++;
168     }
169     }
170     #ifdef Finley_TRACE
171     printf("number of pairs of matching faces %d\n",*numPairs);
172     #endif
173     }
174     /* clean up */
175     TMPMEMFREE(X);
176     TMPMEMFREE(center);
177    
178     #undef getDist
179     #undef SWAP
180     }
181    
182     /*
183     * $Log$
184 jgs 150 * Revision 1.6 2005/09/15 03:44:22 jgs
185     * Merge of development branch dev-02 back to main trunk on 2005-09-15
186     *
187     * Revision 1.5.2.1 2005/09/07 06:26:19 gross
188     * the solver from finley are put into the standalone package paso now
189     *
190 jgs 123 * Revision 1.5 2005/07/08 04:07:51 jgs
191     * Merge of development branch back to main trunk on 2005-07-08
192     *
193 jgs 102 * Revision 1.4 2004/12/15 07:08:32 jgs
194 jgs 97 * *** empty log message ***
195 jgs 123 * Revision 1.1.1.1.2.2 2005/06/29 02:34:51 gross
196     * some changes towards 64 integers in finley
197 jgs 82 *
198 jgs 123 * Revision 1.1.1.1.2.1 2004/11/24 01:37:14 gross
199     * some changes dealing with the integer overflow in memory allocation. Finley solves 4M unknowns now
200 jgs 97 *
201 jgs 82 *
202 jgs 123 *
203 jgs 82 */
204    

Properties

Name Value
svn:eol-style native
svn:keywords Author Date Id Revision

  ViewVC Help
Powered by ViewVC 1.1.26