1 |
sattarpa |
554 |
#include <stdio.h> |
2 |
|
|
#include "mg_file.h" |
3 |
|
|
#include "criaqoperators.h" |
4 |
sattarpa |
596 |
#include "tpl_grille.h" |
5 |
|
|
#include "ot_mathematique.h" |
6 |
|
|
#include <math.h> |
7 |
|
|
#include "tpl_octree.h" |
8 |
sattarpa |
609 |
#include "fem_maillage_outils.h" |
9 |
|
|
#include "mg_maillage_outils.h" |
10 |
sattarpa |
646 |
#include <sstream> |
11 |
|
|
#include <string.h> |
12 |
sattarpa |
554 |
|
13 |
sattarpa |
596 |
CRIAQOPERATORS::CRIAQOPERATORS():MAILLEUR(false) |
14 |
sattarpa |
554 |
{ |
15 |
|
|
} |
16 |
sattarpa |
596 |
CRIAQOPERATORS::~CRIAQOPERATORS() |
17 |
sattarpa |
554 |
{ |
18 |
|
|
} |
19 |
sattarpa |
673 |
|
20 |
|
|
void CRIAQOPERATORS::bumparea_calcul(char* magicfilename,int nummai,int mgsolid,double tolerance,char* areamagicfilename,int defnodid) |
21 |
|
|
{ |
22 |
|
|
MG_FILE gest(magicfilename); |
23 |
|
|
MG_MAILLAGE* mai; |
24 |
|
|
if (nummai==0) mai=gest.get_mg_maillage(nummai); else mai=gest.get_mg_maillageid(nummai); |
25 |
|
|
MG_SOLUTION* mgsol=gest.get_mg_solutionid(mgsolid); |
26 |
|
|
mgsol->active_solution(0); |
27 |
|
|
MG_NOEUD* defnd; |
28 |
|
|
LISTE_MG_NOEUD::iterator itnd; |
29 |
|
|
for(MG_NOEUD* nd=mai->get_premier_noeud(itnd);nd!=NULL;nd=mai->get_suivant_noeud(itnd)) |
30 |
|
|
{ |
31 |
|
|
if (nd->get_id()==defnodid) |
32 |
|
|
defnd=nd; |
33 |
|
|
} |
34 |
|
|
cout<<defnd->get_solution()<<endl; |
35 |
|
|
double max_dist=defnd->get_solution(); |
36 |
|
|
TPL_MAP_ENTITE<MG_TRIANGLE*> areatris; |
37 |
|
|
for (int i=0;i<defnd->get_lien_triangle()->get_nb();i++) |
38 |
|
|
{ |
39 |
|
|
MG_TRIANGLE* trii=defnd->get_lien_triangle()->get(i); |
40 |
|
|
areatris.ajouter(trii); |
41 |
|
|
} |
42 |
|
|
int stoplvl=0; |
43 |
|
|
while (areatris.get_nb()>stoplvl) |
44 |
|
|
{ |
45 |
|
|
stoplvl=areatris.get_nb(); |
46 |
|
|
TPL_MAP_ENTITE<MG_TRIANGLE*>::ITERATEUR itareatris; |
47 |
|
|
for(MG_TRIANGLE* trii=areatris.get_premier(itareatris);trii!=NULL;trii=areatris.get_suivant(itareatris)) |
48 |
|
|
{ |
49 |
|
|
for(int i=0;i<trii->get_segment1()->get_lien_triangle()->get_nb();i++) |
50 |
|
|
{ |
51 |
|
|
MG_TRIANGLE* trineib=trii->get_segment1()->get_lien_triangle()->get(i); |
52 |
|
|
double avdis=(trineib->get_noeud1()->get_solution()+trineib->get_noeud2()->get_solution()+trineib->get_noeud3()->get_solution())/3.; |
53 |
|
|
if (avdis>tolerance) |
54 |
|
|
areatris.ajouter(trineib); |
55 |
|
|
} |
56 |
|
|
for(int i=0;i<trii->get_segment2()->get_lien_triangle()->get_nb();i++) |
57 |
|
|
{ |
58 |
|
|
MG_TRIANGLE* trineib=trii->get_segment2()->get_lien_triangle()->get(i); |
59 |
|
|
double avdis=(trineib->get_noeud1()->get_solution()+trineib->get_noeud2()->get_solution()+trineib->get_noeud3()->get_solution())/3.; |
60 |
|
|
if (avdis>tolerance) |
61 |
|
|
areatris.ajouter(trineib); |
62 |
|
|
} |
63 |
|
|
for(int i=0;i<trii->get_segment3()->get_lien_triangle()->get_nb();i++) |
64 |
|
|
{ |
65 |
|
|
MG_TRIANGLE* trineib=trii->get_segment3()->get_lien_triangle()->get(i); |
66 |
|
|
double avdis=(trineib->get_noeud1()->get_solution()+trineib->get_noeud2()->get_solution()+trineib->get_noeud3()->get_solution())/3.; |
67 |
|
|
if (avdis>tolerance) |
68 |
|
|
areatris.ajouter(trineib); |
69 |
|
|
} |
70 |
|
|
} |
71 |
|
|
} |
72 |
|
|
double area=0.; |
73 |
|
|
TPL_MAP_ENTITE<MG_TRIANGLE*>::ITERATEUR itareatris; |
74 |
|
|
for(MG_TRIANGLE* tri=areatris.get_premier(itareatris);tri!=NULL;tri=areatris.get_suivant(itareatris)) |
75 |
|
|
{ |
76 |
|
|
OT_VECTEUR_3D v1(tri->get_noeud1()->get_coord(),tri->get_noeud2()->get_coord()); |
77 |
|
|
OT_VECTEUR_3D v2(tri->get_noeud1()->get_coord(),tri->get_noeud3()->get_coord()); |
78 |
|
|
OT_VECTEUR_3D area1=v1&v2; |
79 |
|
|
double area2=0.5*area1.get_longueur(); |
80 |
|
|
area=area+area2; |
81 |
|
|
} |
82 |
|
|
cout<<"area= "<<area<<endl; |
83 |
|
|
|
84 |
|
|
MG_MAILLAGE* mai1; |
85 |
|
|
if (nummai==0) mai1=gest.get_mg_maillage(nummai); else mai1=gest.get_mg_maillageid(nummai); |
86 |
|
|
TPL_MAP_ENTITE<MG_TRIANGLE*> deltris; |
87 |
|
|
LISTE_MG_TRIANGLE::iterator ittri; |
88 |
|
|
for (MG_TRIANGLE* tri=mai1->get_premier_triangle(ittri);tri!=NULL;tri=mai1->get_suivant_triangle(ittri)) |
89 |
|
|
{ |
90 |
|
|
int triexist=0; |
91 |
|
|
for(MG_TRIANGLE* triarea=areatris.get_premier(itareatris);triarea!=NULL;triarea=areatris.get_suivant(itareatris)) |
92 |
|
|
{ |
93 |
|
|
if (triarea==tri) |
94 |
|
|
triexist++; |
95 |
|
|
} |
96 |
|
|
if (triexist<1) |
97 |
|
|
deltris.ajouter(tri); |
98 |
|
|
} |
99 |
|
|
for(MG_TRIANGLE* tridel=deltris.get_premier(itareatris);tridel!=NULL;tridel=deltris.get_suivant(itareatris)) |
100 |
|
|
{ |
101 |
|
|
mai1->supprimer_mg_triangleid(tridel->get_id()); |
102 |
|
|
} |
103 |
|
|
|
104 |
|
|
gest.ajouter_mg_maillage(mai1); |
105 |
|
|
gest.enregistrer(areamagicfilename); |
106 |
|
|
} |
107 |
sattarpa |
662 |
void CRIAQOPERATORS::samplepoints_compare(char* samplepoints1,char* samplepoints2,char* sortedsmplpnts) |
108 |
|
|
{ |
109 |
|
|
std::vector<double*> lstsamplepoints1; |
110 |
|
|
FILE *in1=fopen(samplepoints1,"rt"); |
111 |
|
|
if (in1==NULL) affiche((char*) "file is not available"); |
112 |
|
|
while(!feof(in1)) |
113 |
|
|
{ |
114 |
|
|
char chaine[500]; |
115 |
|
|
char* res=fgets(chaine,500,in1); |
116 |
|
|
if(res!=NULL) |
117 |
|
|
{ |
118 |
|
|
double x,y,z; |
119 |
|
|
double q1,q2,q3; |
120 |
|
|
double* pcoordbc=new double[6]; |
121 |
|
|
int nb=sscanf(chaine,"%le %le %le %le %le %le",&x,&y,&z,&q1,&q2,&q3); |
122 |
|
|
if (nb!=-1 && nb!=6) cout<<"Wrong file format"<<endl; |
123 |
|
|
else if(nb==6) |
124 |
|
|
{ |
125 |
|
|
pcoordbc[0]=x; pcoordbc[1]=y; pcoordbc[2]=z; pcoordbc[3]=q1; pcoordbc[4]=q2; pcoordbc[5]=q3; |
126 |
|
|
lstsamplepoints1.push_back(pcoordbc); |
127 |
|
|
} |
128 |
|
|
} |
129 |
|
|
} |
130 |
|
|
fclose(in1); |
131 |
|
|
std::vector<double*> lstsamplepoints2; |
132 |
|
|
FILE *in2=fopen(samplepoints2,"rt"); |
133 |
|
|
if (in2==NULL) affiche((char*) "file is not available"); |
134 |
|
|
while(!feof(in2)) |
135 |
|
|
{ |
136 |
|
|
char chaine[500]; |
137 |
|
|
char* res=fgets(chaine,500,in2); |
138 |
|
|
if(res!=NULL) |
139 |
|
|
{ |
140 |
|
|
double x,y,z; |
141 |
|
|
double q1,q2,q3; |
142 |
|
|
double* pcoordbc=new double[6]; |
143 |
|
|
int nb=sscanf(chaine,"%le %le %le %le %le %le",&x,&y,&z,&q1,&q2,&q3); |
144 |
|
|
if (nb!=-1 && nb!=6) cout<<"Wrong file format"<<endl; |
145 |
|
|
else if(nb==6) |
146 |
|
|
{ |
147 |
|
|
pcoordbc[0]=x; pcoordbc[1]=y; pcoordbc[2]=z; pcoordbc[3]=q1; pcoordbc[4]=q2; pcoordbc[5]=q3; |
148 |
|
|
lstsamplepoints2.push_back(pcoordbc); |
149 |
|
|
} |
150 |
|
|
} |
151 |
|
|
} |
152 |
|
|
fclose(in2); |
153 |
|
|
cout<<lstsamplepoints1.size()<<endl; |
154 |
|
|
cout<<lstsamplepoints2.size()<<endl; |
155 |
|
|
|
156 |
|
|
std::vector<double*> lstsortedsmplpnts; |
157 |
|
|
for(std::vector<double*>::iterator itlstsamplepoints1=lstsamplepoints1.begin();itlstsamplepoints1!=lstsamplepoints1.end();itlstsamplepoints1++) |
158 |
|
|
{ |
159 |
|
|
double* pcoordbc=new double[7]; |
160 |
|
|
int countsmpcomp=0; |
161 |
|
|
double* xyzsmp1=(*itlstsamplepoints1); |
162 |
|
|
for(std::vector<double*>::iterator itlstsamplepoints2=lstsamplepoints2.begin();itlstsamplepoints2!=lstsamplepoints2.end();itlstsamplepoints2++) |
163 |
|
|
{ |
164 |
|
|
double* xyzsmp2=(*itlstsamplepoints2); |
165 |
|
|
if(xyzsmp1[0]==xyzsmp2[0] && xyzsmp1[1]==xyzsmp2[1] && xyzsmp1[2]==xyzsmp2[2] && xyzsmp1[3]==xyzsmp2[3] && xyzsmp1[4]==xyzsmp2[4] && xyzsmp1[5]==xyzsmp2[5]) |
166 |
|
|
countsmpcomp++; |
167 |
|
|
} |
168 |
|
|
if(countsmpcomp==0) |
169 |
|
|
{ |
170 |
|
|
pcoordbc[0]=0; pcoordbc[1]=xyzsmp1[0]; pcoordbc[2]=xyzsmp1[1]; pcoordbc[3]=xyzsmp1[2]; pcoordbc[4]=xyzsmp1[3]; pcoordbc[5]=xyzsmp1[4]; pcoordbc[6]=xyzsmp1[5]; |
171 |
|
|
lstsortedsmplpnts.push_back(pcoordbc); |
172 |
|
|
} |
173 |
|
|
else if (countsmpcomp>0) |
174 |
|
|
{ |
175 |
|
|
pcoordbc[0]=1; pcoordbc[1]=xyzsmp1[0]; pcoordbc[2]=xyzsmp1[1]; pcoordbc[3]=xyzsmp1[2]; pcoordbc[4]=xyzsmp1[3]; pcoordbc[5]=xyzsmp1[4]; pcoordbc[6]=xyzsmp1[5]; |
176 |
|
|
lstsortedsmplpnts.push_back(pcoordbc); |
177 |
|
|
} |
178 |
|
|
|
179 |
|
|
|
180 |
|
|
} |
181 |
|
|
cout<<lstsortedsmplpnts.size()<<endl; |
182 |
|
|
|
183 |
|
|
|
184 |
|
|
FILE* insmp=fopen(sortedsmplpnts,"wt"); |
185 |
|
|
for(std::vector<double*>::iterator itlstsortedsmplpnts=lstsortedsmplpnts.begin();itlstsortedsmplpnts!=lstsortedsmplpnts.end();itlstsortedsmplpnts++) |
186 |
|
|
{ |
187 |
|
|
double* xyzsmpsort=(*itlstsortedsmplpnts); |
188 |
|
|
//cout<<xyzsmpsort[0]<<" "<<xyzsmpsort[1]<<endl; |
189 |
|
|
fprintf(insmp,"%le %le %le %le %le %le %le \n",xyzsmpsort[0],xyzsmpsort[1],xyzsmpsort[2],xyzsmpsort[3],xyzsmpsort[4],xyzsmpsort[5],xyzsmpsort[6]); |
190 |
|
|
} |
191 |
|
|
fclose(insmp); |
192 |
|
|
|
193 |
|
|
} |
194 |
|
|
|
195 |
sattarpa |
596 |
void CRIAQOPERATORS::meshdistance_compare(char* referencemagicfilename,int refmeshno,char* comparemagicfilename,int compmeshno,char* outputcomparefile) |
196 |
sattarpa |
554 |
{ |
197 |
sattarpa |
596 |
MG_FILE refgest(referencemagicfilename); |
198 |
|
|
MG_MAILLAGE* refmgmai; |
199 |
sattarpa |
600 |
if (refmeshno==0) refmgmai=refgest.get_mg_maillage(refmeshno); else refmgmai=refgest.get_mg_maillageid(refmeshno); |
200 |
sattarpa |
596 |
MG_FILE compgest(comparemagicfilename); |
201 |
|
|
MG_MAILLAGE* compmgmai; |
202 |
sattarpa |
600 |
if (compmeshno==0) compmgmai=compgest.get_mg_maillage(compmeshno); else compmgmai=compgest.get_mg_maillageid(compmeshno); |
203 |
sattarpa |
658 |
|
204 |
|
|
//octree initialization |
205 |
sattarpa |
596 |
double xmin=1e308,ymin=1e308,zmin=1e308,xmax=-1e308,ymax=-1e308,zmax=-1e308; |
206 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> lstnoeud; |
207 |
|
|
LISTE_MG_NOEUD::iterator it; |
208 |
|
|
for (MG_NOEUD* no=refmgmai->get_premier_noeud(it);no!=NULL;no=refmgmai->get_suivant_noeud(it)) |
209 |
|
|
{ |
210 |
|
|
if (no->get_x()<xmin) xmin=no->get_x(); |
211 |
|
|
if (no->get_y()<ymin) ymin=no->get_y(); |
212 |
|
|
if (no->get_z()<zmin) zmin=no->get_z(); |
213 |
|
|
if (no->get_x()>xmax) xmax=no->get_x(); |
214 |
|
|
if (no->get_y()>ymax) ymax=no->get_y(); |
215 |
|
|
if (no->get_z()>zmax) zmax=no->get_z(); |
216 |
|
|
} |
217 |
|
|
for (MG_NOEUD* no=compmgmai->get_premier_noeud(it);no!=NULL;no=compmgmai->get_suivant_noeud(it)) |
218 |
|
|
{ |
219 |
|
|
if (no->get_x()<xmin) xmin=no->get_x(); |
220 |
|
|
if (no->get_y()<ymin) ymin=no->get_y(); |
221 |
|
|
if (no->get_z()<zmin) zmin=no->get_z(); |
222 |
|
|
if (no->get_x()>xmax) xmax=no->get_x(); |
223 |
|
|
if (no->get_y()>ymax) ymax=no->get_y(); |
224 |
|
|
if (no->get_z()>zmax) zmax=no->get_z(); |
225 |
|
|
lstnoeud.ajouter(no); |
226 |
|
|
} |
227 |
|
|
OT_VECTEUR_3D vecmin(xmin,ymin,zmin);OT_VECTEUR_3D vecmmax(xmax,ymax,zmax); |
228 |
|
|
OT_VECTEUR_3D vec(vecmmax,vecmin); |
229 |
|
|
|
230 |
|
|
//double search_radius=0.001*(vec.get_longueur()); |
231 |
|
|
double search_radius=3.; |
232 |
|
|
OT_VECTEUR_3D min(xmin,ymin,zmin); OT_VECTEUR_3D max(xmax,ymax,zmax); OT_VECTEUR_3D average=(min+max)/2.; OT_VECTEUR_3D lengthvec(min,max); |
233 |
|
|
double length=sqrt(lengthvec*lengthvec); double bxr=1.1; |
234 |
|
|
xmin=average.get_x()-(length*bxr);ymin=average.get_y()-(length*bxr);zmin=average.get_z()-(length*bxr); |
235 |
|
|
xmax=average.get_x()+(length*bxr);ymax=average.get_y()+(length*bxr);zmax=average.get_z()+(length*bxr); |
236 |
|
|
|
237 |
|
|
TPL_OCTREE<MG_NOEUD*,MG_NOEUD*> octree; |
238 |
|
|
octree.initialiser(&lstnoeud,1,xmin,ymin,zmin,xmax,ymax,zmax); |
239 |
|
|
for (MG_NOEUD* no=compmgmai->get_premier_noeud(it);no!=NULL;no=compmgmai->get_suivant_noeud(it)) |
240 |
|
|
octree.inserer(no); |
241 |
|
|
|
242 |
sattarpa |
646 |
MG_SOLUTION* mgsol=new MG_SOLUTION(refmgmai,1,(char*)"distance.sol",1,(char*)"Normaldistance",MAGIC::ENTITE_SOLUTION::ENTITE_NOEUD,MAGIC::TYPE_SOLUTION::SCALAIRE); |
243 |
sattarpa |
596 |
refgest.ajouter_mg_solution(mgsol); |
244 |
|
|
mgsol->change_legende(0,"Normaldistance"); |
245 |
|
|
int i=0; |
246 |
|
|
for (MG_NOEUD* nop=refmgmai->get_premier_noeud(it);nop!=NULL;nop=refmgmai->get_suivant_noeud(it)) |
247 |
|
|
{ |
248 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> lstneiclose; |
249 |
|
|
int neindnb=lstneiclose.get_nb(); |
250 |
|
|
while(neindnb==0) |
251 |
|
|
{ |
252 |
|
|
octree.rechercher(nop->get_x(),nop->get_y(),nop->get_z(),search_radius,lstneiclose); |
253 |
|
|
neindnb=lstneiclose.get_nb(); |
254 |
|
|
} |
255 |
|
|
map<double,MG_NOEUD*,std::less<double> > lstdist; |
256 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itnop; |
257 |
|
|
for(MG_NOEUD* no=lstneiclose.get_premier(itnop);no!=NULL;no=lstneiclose.get_suivant(itnop)) |
258 |
|
|
{ |
259 |
sattarpa |
679 |
//double distns=sqrt(pow(nop->get_x()-no->get_x(),2)+pow(nop->get_y()-no->get_y(),2)+pow(nop->get_z()-no->get_z(),2)); |
260 |
sattarpa |
596 |
|
261 |
|
|
OT_VECTEUR_3D w_n_tot(0.,0.,0.); |
262 |
|
|
double norme_w_n_tot=0.; |
263 |
|
|
OT_VECTEUR_3D w2_n_tot(0.,0.,0.); |
264 |
|
|
double norme_w2_n_tot=0.; |
265 |
sattarpa |
679 |
//int nbtri=nop->get_lien_triangle()->get_nb(); |
266 |
|
|
int nbtri=no->get_lien_triangle()->get_nb(); |
267 |
sattarpa |
596 |
for (int i=0;i<nbtri;i++) |
268 |
|
|
{ |
269 |
sattarpa |
679 |
//MG_TRIANGLE* tri=(MG_TRIANGLE*)nop->get_lien_triangle()->get(i); |
270 |
|
|
MG_TRIANGLE* tri=(MG_TRIANGLE*)no->get_lien_triangle()->get(i); |
271 |
sattarpa |
596 |
double *xyzn1=tri->get_noeud1()->get_coord(); |
272 |
|
|
double *xyzn2=tri->get_noeud2()->get_coord(); |
273 |
|
|
double *xyzn3=tri->get_noeud3()->get_coord(); |
274 |
|
|
|
275 |
|
|
OT_VECTEUR_3D vec1(xyzn1,xyzn3); |
276 |
|
|
OT_VECTEUR_3D vec2(xyzn1,xyzn2); |
277 |
|
|
OT_VECTEUR_3D n_tri=vec1&vec2; // Normale au triangle |
278 |
|
|
|
279 |
|
|
double w=n_tri.get_longueur(); // 2 fois l'aire du triangle (pour éviter une division par 2) |
280 |
|
|
n_tri.norme(); |
281 |
|
|
OT_VECTEUR_3D w_n=w*n_tri; |
282 |
|
|
double norme_w_n=w_n.get_longueur(); |
283 |
|
|
w_n_tot=w_n_tot+w_n; |
284 |
|
|
norme_w_n_tot=norme_w_n_tot+norme_w_n; |
285 |
|
|
} |
286 |
|
|
|
287 |
|
|
OT_VECTEUR_3D n=w_n_tot/norme_w_n_tot; // Normale à la surface au noeud |
288 |
|
|
n.norme(); |
289 |
|
|
OT_VECTEUR_3D distvec(nop->get_coord(),no->get_coord()); |
290 |
|
|
double normaldistance=distvec*n; |
291 |
|
|
double normaldistanceabs=fabs(normaldistance); |
292 |
|
|
//cout<<"normaldistanceabs= "<<normaldistanceabs<<endl; |
293 |
|
|
lstdist.insert(pair<double,MG_NOEUD*>(normaldistanceabs,nop)); |
294 |
|
|
} |
295 |
|
|
map<double,MG_NOEUD*,std::less<double> >::iterator itlstdist=lstdist.begin(); |
296 |
|
|
double distnsclos=(*itlstdist).first; |
297 |
|
|
MG_NOEUD* nodcls=(*itlstdist).second; |
298 |
|
|
//cout<<"distnsclos= "<<distnsclos<<endl; |
299 |
|
|
mgsol->ecrire(distnsclos,i,0,0); |
300 |
|
|
//mgsol->ecrire(distnsclos,1,0,0); |
301 |
|
|
i++; |
302 |
sattarpa |
554 |
} |
303 |
sattarpa |
596 |
refgest.enregistrer(outputcomparefile); |
304 |
|
|
} |
305 |
sattarpa |
609 |
void CRIAQOPERATORS::deformed_correspond_mgmaiadd(char* magicfilename,int meshno,int numsol1,int numsol2,int numsol3,int numchamp1,int numchamp2,int numchamp3,double coef) |
306 |
|
|
{ |
307 |
|
|
MG_FILE gest(magicfilename); |
308 |
|
|
FEM_MAILLAGE* femmai; |
309 |
|
|
if (meshno==0) femmai=gest.get_fem_maillage(meshno); else femmai=gest.get_fem_maillageid(meshno); |
310 |
|
|
FEM_SOLUTION* sol1=gest.get_fem_solutionid(numsol1); |
311 |
|
|
FEM_SOLUTION* sol2=gest.get_fem_solutionid(numsol2); |
312 |
|
|
FEM_SOLUTION* sol3=gest.get_fem_solutionid(numsol3); |
313 |
|
|
femmai->calcul_deforme(sol1,numchamp1,sol2,numchamp2,sol3,numchamp3); |
314 |
|
|
if (coef>1e-16) |
315 |
|
|
{ |
316 |
|
|
cout<<" Création du maillage deforme avec correspondence text file"<<endl; |
317 |
|
|
MG_MAILLAGE* defmgmai=new MG_MAILLAGE(gest.get_mg_geometrie(0)); |
318 |
|
|
gest.ajouter_mg_maillage(defmgmai); |
319 |
|
|
{ |
320 |
|
|
if (femmai->get_degre()==1) |
321 |
|
|
{ |
322 |
|
|
//gest=femmai->get_mg_maillage()->get_gestionnaire(); |
323 |
|
|
//gest->ajouter_mg_maillage(this); |
324 |
|
|
std::vector<unsigned long*> lstcores;//sasan |
325 |
|
|
LISTE_FEM_NOEUD::iterator it; |
326 |
|
|
for (FEM_NOEUD* no=femmai->get_premier_noeud(it);no!=NULL;no=femmai->get_suivant_noeud(it)) |
327 |
|
|
{ |
328 |
|
|
double x=no->get_x(coef); |
329 |
|
|
double y=no->get_y(coef); |
330 |
|
|
double z=no->get_z(coef); |
331 |
|
|
MG_NOEUD *newno=new MG_NOEUD(no->get_lien_topologie(),x,y,z,DEFORME); |
332 |
|
|
defmgmai->ajouter_mg_noeud(newno); |
333 |
|
|
no->change_numero(newno->get_id()); |
334 |
|
|
unsigned long* correscad_defcad=new unsigned long[2];//sasan |
335 |
|
|
correscad_defcad[0]=no->get_mg_element_maillage()->get_id();//sasan |
336 |
|
|
correscad_defcad[1]=newno->get_id();//sasan |
337 |
|
|
lstcores.push_back(correscad_defcad);//sasan |
338 |
|
|
} |
339 |
|
|
//sasan |
340 |
|
|
FILE* in1=fopen("correspond_deform_mgmaill.txt","wt"); |
341 |
sattarpa |
659 |
fprintf(in1,"MG_MAILLAGE No. : deformed_MAILLAGE No.\n"); |
342 |
sattarpa |
609 |
fprintf(in1,"%lu %lu\n",femmai->get_mg_maillage()->get_id(),defmgmai->get_id()); |
343 |
|
|
for(std::vector<unsigned long*>::iterator itlstpinsert=lstcores.begin();itlstpinsert!=lstcores.end();itlstpinsert++) |
344 |
|
|
{ |
345 |
|
|
unsigned long* xyzpins1; |
346 |
|
|
xyzpins1=(*itlstpinsert); |
347 |
|
|
//cout<<" xyzpins1[0]= "<<xyzpins1[0]<<" xyzpins1[1]= "<<xyzpins1[1]<<endl; |
348 |
|
|
fprintf(in1,"%lu %lu\n",xyzpins1[0],xyzpins1[1]); |
349 |
|
|
} |
350 |
|
|
fclose(in1); |
351 |
|
|
//sasan till |
352 |
|
|
LISTE_FEM_ELEMENT1::iterator it1; |
353 |
|
|
for (FEM_ELEMENT1 *ele=femmai->get_premier_element1(it1);ele!=NULL;ele=femmai->get_suivant_element1(it1)) |
354 |
|
|
{ |
355 |
|
|
MG_NOEUD* no1=defmgmai->get_mg_noeudid(ele->get_fem_noeud(0)->get_numero()); |
356 |
|
|
MG_NOEUD* no2=defmgmai->get_mg_noeudid(ele->get_fem_noeud(1)->get_numero()); |
357 |
|
|
MG_SEGMENT *seg=new MG_SEGMENT(ele->get_lien_topologie(),no1,no2,DEFORME); |
358 |
|
|
defmgmai->ajouter_mg_segment(seg); |
359 |
|
|
} |
360 |
|
|
LISTE_FEM_ELEMENT2::iterator it2; |
361 |
|
|
for (FEM_ELEMENT2 *ele=femmai->get_premier_element2(it2);ele!=NULL;ele=femmai->get_suivant_element2(it2)) |
362 |
|
|
{ |
363 |
|
|
if (ele->get_nb_fem_noeud()==3) |
364 |
|
|
{ |
365 |
|
|
MG_NOEUD* no1=defmgmai->get_mg_noeudid(ele->get_fem_noeud(0)->get_numero()); |
366 |
|
|
MG_NOEUD* no2=defmgmai->get_mg_noeudid(ele->get_fem_noeud(1)->get_numero()); |
367 |
|
|
MG_NOEUD* no3=defmgmai->get_mg_noeudid(ele->get_fem_noeud(2)->get_numero()); |
368 |
|
|
defmgmai->ajouter_mg_triangle(ele->get_lien_topologie(),no1,no2,no3,DEFORME); |
369 |
|
|
} |
370 |
|
|
if (ele->get_nb_fem_noeud()==4) |
371 |
|
|
{ |
372 |
|
|
MG_NOEUD* no1=defmgmai->get_mg_noeudid(ele->get_fem_noeud(0)->get_numero()); |
373 |
|
|
MG_NOEUD* no2=defmgmai->get_mg_noeudid(ele->get_fem_noeud(1)->get_numero()); |
374 |
|
|
MG_NOEUD* no3=defmgmai->get_mg_noeudid(ele->get_fem_noeud(2)->get_numero()); |
375 |
|
|
MG_NOEUD* no4=defmgmai->get_mg_noeudid(ele->get_fem_noeud(3)->get_numero()); |
376 |
|
|
defmgmai->ajouter_mg_quadrangle(ele->get_lien_topologie(),no1,no2,no3,no4,DEFORME); |
377 |
|
|
} |
378 |
|
|
} |
379 |
|
|
LISTE_FEM_ELEMENT3::iterator it3; |
380 |
|
|
for (FEM_ELEMENT3 *ele=femmai->get_premier_element3(it3);ele!=NULL;ele=femmai->get_suivant_element3(it3)) |
381 |
|
|
{ |
382 |
|
|
if (ele->get_nb_fem_noeud()==4) |
383 |
|
|
{ |
384 |
|
|
MG_NOEUD* no1=defmgmai->get_mg_noeudid(ele->get_fem_noeud(0)->get_numero()); |
385 |
|
|
MG_NOEUD* no2=defmgmai->get_mg_noeudid(ele->get_fem_noeud(1)->get_numero()); |
386 |
|
|
MG_NOEUD* no3=defmgmai->get_mg_noeudid(ele->get_fem_noeud(2)->get_numero()); |
387 |
|
|
MG_NOEUD* no4=defmgmai->get_mg_noeudid(ele->get_fem_noeud(3)->get_numero()); |
388 |
|
|
defmgmai->ajouter_mg_tetra(ele->get_lien_topologie(),no1,no2,no3,no4,DEFORME); |
389 |
|
|
} |
390 |
|
|
if (ele->get_nb_fem_noeud()==8) |
391 |
|
|
{ |
392 |
|
|
MG_NOEUD* no1=defmgmai->get_mg_noeudid(ele->get_fem_noeud(0)->get_numero()); |
393 |
|
|
MG_NOEUD* no2=defmgmai->get_mg_noeudid(ele->get_fem_noeud(1)->get_numero()); |
394 |
|
|
MG_NOEUD* no3=defmgmai->get_mg_noeudid(ele->get_fem_noeud(2)->get_numero()); |
395 |
|
|
MG_NOEUD* no4=defmgmai->get_mg_noeudid(ele->get_fem_noeud(3)->get_numero()); |
396 |
|
|
MG_NOEUD* no5=defmgmai->get_mg_noeudid(ele->get_fem_noeud(4)->get_numero()); |
397 |
|
|
MG_NOEUD* no6=defmgmai->get_mg_noeudid(ele->get_fem_noeud(5)->get_numero()); |
398 |
|
|
MG_NOEUD* no7=defmgmai->get_mg_noeudid(ele->get_fem_noeud(6)->get_numero()); |
399 |
|
|
MG_NOEUD* no8=defmgmai->get_mg_noeudid(ele->get_fem_noeud(7)->get_numero()); |
400 |
|
|
defmgmai->ajouter_mg_hexa(ele->get_lien_topologie(),no1,no2,no3,no4,no5,no6,no7,no8,DEFORME); |
401 |
|
|
} |
402 |
|
|
} |
403 |
|
|
|
404 |
|
|
} |
405 |
|
|
} |
406 |
|
|
} |
407 |
|
|
cout<<" Enregistrement"<<endl; |
408 |
|
|
gest.enregistrer(magicfilename); |
409 |
|
|
} |
410 |
sattarpa |
650 |
void CRIAQOPERATORS::curvtur_crit_remvsmp(char* magicfilename,char* correspondfilename,char* gnifinspointfile,char* out_gnifinspointfile_removondefect,double search_radius,double curvdif_coef,int gmsh_affiche,double relet_search_rad,int relet_curvature) |
411 |
sattarpa |
609 |
{ |
412 |
|
|
MG_FILE gest(magicfilename); |
413 |
|
|
map<unsigned long, unsigned long> coresspondndidlst; |
414 |
|
|
FILE* in1=fopen(correspondfilename,"rt"); |
415 |
|
|
if (in1==NULL) cout<<"correspondfile is not available"<<endl; |
416 |
|
|
char mess[500]; |
417 |
|
|
char *res=fgets(mess,500,in1); |
418 |
sattarpa |
655 |
if(feof(in1)) |
419 |
|
|
cout<<"correspondfile has not been well written"<<endl; |
420 |
sattarpa |
609 |
res=fgets(mess,500,in1); |
421 |
sattarpa |
655 |
if(feof(in1)) |
422 |
|
|
cout<<"correspondfile has not been well written"<<endl; |
423 |
sattarpa |
609 |
int cadmeshno; |
424 |
|
|
int defcadmeshno; |
425 |
sattarpa |
659 |
int nb1=sscanf(mess,"%d %d",&cadmeshno,&defcadmeshno); |
426 |
sattarpa |
609 |
while (!feof(in1)) |
427 |
|
|
{ |
428 |
|
|
char chaine[500]; |
429 |
sattarpa |
655 |
res=fgets(chaine,500,in1); |
430 |
|
|
if(res!=NULL) |
431 |
|
|
{ |
432 |
sattarpa |
609 |
unsigned long cadndid; |
433 |
|
|
unsigned long defcadndid; |
434 |
|
|
int nb=sscanf(chaine,"%lu %lu",&cadndid,&defcadndid); |
435 |
|
|
if (nb!=-1 && nb!=2) cout<<"Wrong file format"<<endl; |
436 |
|
|
else if (nb==2) |
437 |
|
|
{ |
438 |
|
|
coresspondndidlst.insert(pair<unsigned long, unsigned long> (defcadndid,cadndid) ); |
439 |
|
|
} |
440 |
sattarpa |
655 |
} |
441 |
sattarpa |
609 |
} |
442 |
|
|
fclose(in1); |
443 |
sattarpa |
650 |
|
444 |
|
|
cout<<"cadmeshno= "<<cadmeshno<<" defcadmeshno= "<<defcadmeshno<<endl; |
445 |
sattarpa |
609 |
MG_MAILLAGE* cadmgmai; |
446 |
|
|
if (cadmeshno==0) cadmgmai=gest.get_mg_maillage(cadmeshno); else cadmgmai=gest.get_mg_maillageid(cadmeshno); |
447 |
|
|
MG_MAILLAGE* defcadmgmai; |
448 |
|
|
if (defcadmeshno==0) defcadmgmai=gest.get_mg_maillage(defcadmeshno); else defcadmgmai=gest.get_mg_maillageid(defcadmeshno); |
449 |
sattarpa |
650 |
|
450 |
|
|
cout<<"octree initialization "<<endl; |
451 |
|
|
//CAD octree initialization |
452 |
|
|
LISTE_MG_NOEUD::iterator itcadndcurv; |
453 |
|
|
double xmincad=1e308,ymincad=1e308,zmincad=1e308,xmaxcad=-1e308,ymaxcad=-1e308,zmaxcad=-1e308; |
454 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> lstcadnoeud; |
455 |
|
|
for(MG_NOEUD* cadndcurv=cadmgmai->get_premier_noeud(itcadndcurv);cadndcurv!=NULL;cadndcurv=cadmgmai->get_suivant_noeud(itcadndcurv)) |
456 |
|
|
{ |
457 |
|
|
if (cadndcurv->get_x()<xmincad) xmincad=cadndcurv->get_x(); |
458 |
|
|
if (cadndcurv->get_y()<ymincad) ymincad=cadndcurv->get_y(); |
459 |
|
|
if (cadndcurv->get_z()<zmincad) zmincad=cadndcurv->get_z(); |
460 |
|
|
if (cadndcurv->get_x()>xmaxcad) xmaxcad=cadndcurv->get_x(); |
461 |
|
|
if (cadndcurv->get_y()>ymaxcad) ymaxcad=cadndcurv->get_y(); |
462 |
|
|
if (cadndcurv->get_z()>zmaxcad) zmaxcad=cadndcurv->get_z(); |
463 |
|
|
lstcadnoeud.ajouter(cadndcurv); |
464 |
|
|
} |
465 |
|
|
OT_VECTEUR_3D vecmincad(xmincad,ymincad,zmincad); |
466 |
|
|
OT_VECTEUR_3D vecmmaxcad(xmaxcad,ymaxcad,zmaxcad); |
467 |
|
|
OT_VECTEUR_3D vecad(vecmmaxcad,vecmincad); |
468 |
|
|
OT_VECTEUR_3D mincad(xmincad,ymincad,zmincad); OT_VECTEUR_3D maxcad(xmaxcad,ymaxcad,zmaxcad); OT_VECTEUR_3D averagecad=(mincad+maxcad)/2.; OT_VECTEUR_3D lengthvecad(mincad,maxcad); |
469 |
|
|
double lengthcad=sqrt(lengthvecad*lengthvecad); double bxrcad=1.1; |
470 |
|
|
xmincad=averagecad.get_x()-(lengthcad*bxrcad);ymincad=averagecad.get_y()-(lengthcad*bxrcad);zmincad=averagecad.get_z()-(lengthcad*bxrcad); |
471 |
|
|
xmaxcad=averagecad.get_x()+(lengthcad*bxrcad);ymaxcad=averagecad.get_y()+(lengthcad*bxrcad);zmaxcad=averagecad.get_z()+(lengthcad*bxrcad); |
472 |
|
|
TPL_OCTREE<MG_NOEUD*,MG_NOEUD*> octreecad; |
473 |
|
|
octreecad.initialiser(&lstcadnoeud,1,xmincad,ymincad,zmincad,xmaxcad,ymaxcad,zmaxcad); |
474 |
|
|
for(MG_NOEUD* cadndcurv=cadmgmai->get_premier_noeud(itcadndcurv);cadndcurv!=NULL;cadndcurv=cadmgmai->get_suivant_noeud(itcadndcurv)) |
475 |
|
|
octreecad.inserer(cadndcurv); |
476 |
|
|
//deformed_CAD octree initialization |
477 |
|
|
LISTE_MG_NOEUD::iterator itdefcadndcurv; |
478 |
|
|
double xmindefcad=1e308,ymindefcad=1e308,zmindefcad=1e308,xmaxdefcad=-1e308,ymaxdefcad=-1e308,zmaxdefcad=-1e308; |
479 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> lstdefcadnoeud; |
480 |
|
|
for(MG_NOEUD* defcadndcurv=defcadmgmai->get_premier_noeud(itdefcadndcurv);defcadndcurv!=NULL;defcadndcurv=defcadmgmai->get_suivant_noeud(itdefcadndcurv)) |
481 |
|
|
{ |
482 |
|
|
if (defcadndcurv->get_x()<xmindefcad) xmindefcad=defcadndcurv->get_x(); |
483 |
|
|
if (defcadndcurv->get_y()<ymindefcad) ymindefcad=defcadndcurv->get_y(); |
484 |
|
|
if (defcadndcurv->get_z()<zmindefcad) zmindefcad=defcadndcurv->get_z(); |
485 |
|
|
if (defcadndcurv->get_x()>xmaxdefcad) xmaxdefcad=defcadndcurv->get_x(); |
486 |
|
|
if (defcadndcurv->get_y()>ymaxdefcad) ymaxdefcad=defcadndcurv->get_y(); |
487 |
|
|
if (defcadndcurv->get_z()>zmaxdefcad) zmaxdefcad=defcadndcurv->get_z(); |
488 |
|
|
lstdefcadnoeud.ajouter(defcadndcurv); |
489 |
|
|
} |
490 |
|
|
OT_VECTEUR_3D vecmindefcad(xmindefcad,ymindefcad,zmindefcad);OT_VECTEUR_3D vecmmaxdefcad(xmaxdefcad,ymaxdefcad,zmaxdefcad); |
491 |
|
|
OT_VECTEUR_3D vecdefcad(vecmmaxdefcad,vecmindefcad); |
492 |
|
|
OT_VECTEUR_3D mindefcad(xmindefcad,ymindefcad,zmindefcad); OT_VECTEUR_3D maxdefcad(xmaxdefcad,ymaxdefcad,zmaxdefcad); OT_VECTEUR_3D averagedefcad=(mindefcad+maxdefcad)/2.; OT_VECTEUR_3D lengthvecdefcad(mindefcad,maxdefcad); |
493 |
|
|
double lengthdefcad=sqrt(lengthvecdefcad*lengthvecdefcad); double bxrdefcad=1.1; |
494 |
|
|
xmindefcad=averagedefcad.get_x()-(lengthdefcad*bxrdefcad);ymindefcad=averagedefcad.get_y()-(lengthdefcad*bxrdefcad);zmindefcad=averagedefcad.get_z()-(lengthdefcad*bxrdefcad); |
495 |
|
|
xmaxdefcad=averagedefcad.get_x()+(lengthdefcad*bxrdefcad);ymaxdefcad=averagedefcad.get_y()+(lengthdefcad*bxrdefcad);zmaxdefcad=averagedefcad.get_z()+(lengthdefcad*bxrdefcad); |
496 |
|
|
TPL_OCTREE<MG_NOEUD*,MG_NOEUD*> octreedefcad; |
497 |
|
|
octreedefcad.initialiser(&lstdefcadnoeud,1,xmindefcad,ymindefcad,zmindefcad,xmaxdefcad,ymaxdefcad,zmaxdefcad); |
498 |
|
|
for(MG_NOEUD* defcadndcurv=defcadmgmai->get_premier_noeud(itdefcadndcurv);defcadndcurv!=NULL;defcadndcurv=defcadmgmai->get_suivant_noeud(itdefcadndcurv)) |
499 |
|
|
octreedefcad.inserer(defcadndcurv); |
500 |
|
|
|
501 |
sattarpa |
609 |
multimap<double,MG_NOEUD*,std::greater<double> > lstkmin_cadmgmai; |
502 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkmax_cadmgmai; |
503 |
sattarpa |
646 |
multimap<double,MG_NOEUD*,std::greater<double> > lstkgau_cadmgmai; |
504 |
sattarpa |
609 |
multimap<double,MG_NOEUD*,std::greater<double> > lstkmin_defcadmgmai; |
505 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkmax_defcadmgmai; |
506 |
sattarpa |
646 |
multimap<double,MG_NOEUD*,std::greater<double> > lstkgau_defcadmgmai; |
507 |
sattarpa |
650 |
map<MG_NOEUD*,double > lstkmin_cad; |
508 |
|
|
map<MG_NOEUD*,double > lstkmax_cad; |
509 |
|
|
map<MG_NOEUD*,double > lstkgau_cad; |
510 |
|
|
map<MG_NOEUD*,double > lstkmin_defcad; |
511 |
|
|
map<MG_NOEUD*,double > lstkmax_defcad; |
512 |
|
|
map<MG_NOEUD*,double > lstkgau_defcad; |
513 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkmin_relt_cadmgmai; |
514 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkmax_relt_cadmgmai; |
515 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkgau_relt_cadmgmai; |
516 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkmin_relt_defcadmgmai; |
517 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkmax_relt_defcadmgmai; |
518 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkgau_relt_defcadmgmai; |
519 |
sattarpa |
609 |
std::map<std::string,double> liste_kmin; |
520 |
|
|
std::map<std::string,double> liste_kmax; |
521 |
|
|
std::map<std::string,double> liste_gau; |
522 |
|
|
std::map<std::string,double> liste_courburemax1; |
523 |
|
|
std::map<std::string,double> liste_courburemax2; |
524 |
|
|
std::map<std::string,double> liste_courburemax3; |
525 |
|
|
std::map<std::string,double> liste_courburemax4; |
526 |
|
|
std::map<std::string,double> liste_courburemax5; |
527 |
|
|
int opensurafece=1; |
528 |
sattarpa |
650 |
|
529 |
sattarpa |
609 |
cout<<"calcul courbure cadmgmai"<<endl; |
530 |
|
|
// calcul courbure cadmgmai ******************************** |
531 |
|
|
for (MG_NOEUD* cadmgnd=cadmgmai->get_premier_noeud(itcadndcurv);cadmgnd!=NULL;cadmgnd=cadmgmai->get_suivant_noeud(itcadndcurv)) |
532 |
|
|
{ |
533 |
|
|
double kmin1=0.; |
534 |
|
|
double kmax1=0.; |
535 |
|
|
double kmin2=0.; |
536 |
|
|
double kmax2=0.; |
537 |
|
|
MG_MAILLAGE_OUTILS *cou; |
538 |
|
|
cou->calcul_courbure_face_arete_sommet(cadmgnd,kmin1,kmax1,kmin2,kmax2,liste_kmin,liste_kmax,liste_gau,liste_courburemax1,liste_courburemax2,liste_courburemax3,liste_courburemax4,liste_courburemax5,opensurafece); |
539 |
|
|
} |
540 |
|
|
for (MG_NOEUD* cadmgnd=cadmgmai->get_premier_noeud(itcadndcurv);cadmgnd!=NULL;cadmgnd=cadmgmai->get_suivant_noeud(itcadndcurv)) |
541 |
|
|
{ |
542 |
sattarpa |
650 |
|
543 |
sattarpa |
609 |
unsigned long idface=cadmgnd->get_lien_topologie()->get_id(); |
544 |
|
|
unsigned long idnoeud=cadmgnd->get_id(); |
545 |
|
|
char mess[500]; |
546 |
|
|
sprintf(mess,"%lu_%lu",idnoeud,idface); |
547 |
|
|
for(std::map<std::string,double>::iterator itkmin=liste_kmin.begin();itkmin!=liste_kmin.end();itkmin++) |
548 |
|
|
{ |
549 |
|
|
if(mess==(*itkmin).first) |
550 |
sattarpa |
650 |
{ |
551 |
sattarpa |
609 |
lstkmin_cadmgmai.insert(pair<double,MG_NOEUD*>((*itkmin).second,cadmgnd) ); |
552 |
sattarpa |
650 |
lstkmin_cad.insert(pair<MG_NOEUD*,double>(cadmgnd,(*itkmin).second)); |
553 |
|
|
} |
554 |
sattarpa |
609 |
} |
555 |
|
|
for(std::map<std::string,double>::iterator itkmax=liste_kmax.begin();itkmax!=liste_kmax.end();itkmax++) |
556 |
|
|
{ |
557 |
|
|
if(mess==(*itkmax).first) |
558 |
sattarpa |
650 |
{ |
559 |
sattarpa |
609 |
lstkmax_cadmgmai.insert(pair<double,MG_NOEUD*>((*itkmax).second,cadmgnd) ); |
560 |
sattarpa |
650 |
lstkmax_cad.insert(pair<MG_NOEUD*,double>(cadmgnd,(*itkmax).second)); |
561 |
|
|
} |
562 |
sattarpa |
609 |
} |
563 |
sattarpa |
646 |
for(std::map<std::string,double>::iterator itkgau=liste_gau.begin();itkgau!=liste_gau.end();itkgau++) |
564 |
|
|
{ |
565 |
|
|
if(mess==(*itkgau).first) |
566 |
sattarpa |
650 |
{ |
567 |
sattarpa |
646 |
lstkgau_cadmgmai.insert(pair<double,MG_NOEUD*>((*itkgau).second,cadmgnd) ); |
568 |
sattarpa |
650 |
lstkgau_cad.insert(pair<MG_NOEUD*,double>(cadmgnd,(*itkgau).second)); |
569 |
|
|
} |
570 |
sattarpa |
646 |
} |
571 |
sattarpa |
609 |
} |
572 |
sattarpa |
650 |
//calc reletive curvature CAD |
573 |
|
|
map<MG_NOEUD*,double >::iterator itlstkmin_cad; |
574 |
|
|
map<MG_NOEUD*,double >::iterator itlstkmax_cad; |
575 |
|
|
map<MG_NOEUD*,double >::iterator itlstkgau_cad; |
576 |
|
|
for (MG_NOEUD* cadmgnd=cadmgmai->get_premier_noeud(itcadndcurv);cadmgnd!=NULL;cadmgnd=cadmgmai->get_suivant_noeud(itcadndcurv)) |
577 |
|
|
{ |
578 |
|
|
itlstkmin_cad=lstkmin_cad.find(cadmgnd); |
579 |
|
|
double relet_kmincad=(*itlstkmin_cad).second; |
580 |
|
|
itlstkmax_cad=lstkmax_cad.find(cadmgnd); |
581 |
|
|
double relet_kmaxcad=(*itlstkmax_cad).second; |
582 |
|
|
itlstkgau_cad=lstkgau_cad.find(cadmgnd); |
583 |
|
|
double relet_kgaucad=(*itlstkgau_cad).second; |
584 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> lstnei_relcad; |
585 |
|
|
int relcad_neindnb=lstnei_relcad.get_nb(); |
586 |
|
|
double relet_search_rad1=relet_search_rad; |
587 |
|
|
while(relcad_neindnb<1) |
588 |
|
|
{ |
589 |
|
|
octreecad.rechercher(cadmgnd->get_x(),cadmgnd->get_y(),cadmgnd->get_z(),relet_search_rad1,lstnei_relcad); |
590 |
|
|
relcad_neindnb=lstnei_relcad.get_nb(); |
591 |
|
|
relet_search_rad1=relet_search_rad1+0.1*relet_search_rad; |
592 |
|
|
} |
593 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itndnei; |
594 |
|
|
for(MG_NOEUD* cadndnei=lstnei_relcad.get_premier(itndnei);cadndnei!=NULL;cadndnei=lstnei_relcad.get_suivant(itndnei)) |
595 |
|
|
{ |
596 |
|
|
itlstkmin_cad=lstkmin_cad.find(cadndnei); |
597 |
|
|
relet_kmincad=relet_kmincad+(*itlstkmin_cad).second; |
598 |
|
|
itlstkmax_cad=lstkmax_cad.find(cadndnei); |
599 |
|
|
relet_kmaxcad=relet_kmaxcad+(*itlstkmax_cad).second; |
600 |
|
|
itlstkgau_cad=lstkgau_cad.find(cadndnei); |
601 |
|
|
relet_kgaucad=relet_kgaucad+(*itlstkgau_cad).second; |
602 |
|
|
} |
603 |
|
|
relet_kmincad=relet_kmincad/lstnei_relcad.get_nb(); |
604 |
|
|
relet_kmaxcad=relet_kmaxcad/lstnei_relcad.get_nb(); |
605 |
|
|
relet_kgaucad=relet_kgaucad/lstnei_relcad.get_nb(); |
606 |
|
|
lstkmin_relt_cadmgmai.insert(pair<double,MG_NOEUD*> (relet_kmincad,cadmgnd)); |
607 |
|
|
lstkmax_relt_cadmgmai.insert(pair<double,MG_NOEUD*> (relet_kmaxcad,cadmgnd)); |
608 |
|
|
lstkgau_relt_cadmgmai.insert(pair<double,MG_NOEUD*> (relet_kgaucad,cadmgnd)); |
609 |
|
|
} |
610 |
|
|
// affichage reletive sur GMSH ****************************** |
611 |
|
|
if (gmsh_affiche>1) |
612 |
|
|
{ |
613 |
|
|
cout<<"affiche: calcul_courbure_cadmgmai_relet "<<endl; |
614 |
|
|
std::ostringstream oss; |
615 |
|
|
oss << "calcul_courbure_cadmgmai_curvdif_relet_coef:" <<curvdif_coef ; |
616 |
|
|
std::string namefic = oss.str(); |
617 |
|
|
char *cstr = new char[namefic.length() + 1]; |
618 |
|
|
strcpy(cstr, namefic.c_str()); |
619 |
|
|
MG_SOLUTION* sol1=new MG_SOLUTION(cadmgmai,3,cstr,1,(char*)"discrete_curboure_solution",MAGIC::ENTITE_SOLUTION::ENTITE_ELEMENT2_NOEUD,MAGIC::TYPE_SOLUTION::SCALAIRE); |
620 |
|
|
gest.ajouter_mg_solution(sol1); |
621 |
|
|
sol1->change_legende(0,"Kmin_relet"); |
622 |
|
|
sol1->change_legende(1,"Kmax_relet"); |
623 |
|
|
sol1->change_legende(2,"K_gau_relet"); |
624 |
|
|
LISTE_MG_TRIANGLE::iterator ittri; |
625 |
|
|
int compte=0; |
626 |
|
|
for (MG_TRIANGLE* tri=cadmgmai->get_premier_triangle(ittri);tri!=NULL;tri=cadmgmai->get_suivant_triangle(ittri)) |
627 |
|
|
{ |
628 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_relt_cadmgmai; |
629 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_relt_cadmgmai; |
630 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkgau_relt_cadmgmai; |
631 |
|
|
MG_NOEUD *no1=tri->get_noeud1(); |
632 |
|
|
MG_NOEUD *no2=tri->get_noeud2(); |
633 |
|
|
MG_NOEUD *no3=tri->get_noeud3(); |
634 |
|
|
double valeur0; |
635 |
|
|
double valeur1; |
636 |
|
|
double valeur2; |
637 |
|
|
for(itlstkmin_relt_cadmgmai=lstkmin_relt_cadmgmai.begin();itlstkmin_relt_cadmgmai!=lstkmin_relt_cadmgmai.end();itlstkmin_relt_cadmgmai++) |
638 |
|
|
{ |
639 |
|
|
if (no1==(*itlstkmin_relt_cadmgmai).second) |
640 |
|
|
valeur0=(*itlstkmin_relt_cadmgmai).first; |
641 |
|
|
} |
642 |
|
|
for(itlstkmax_relt_cadmgmai=lstkmax_relt_cadmgmai.begin();itlstkmax_relt_cadmgmai!=lstkmax_relt_cadmgmai.end();itlstkmax_relt_cadmgmai++) |
643 |
|
|
{ |
644 |
|
|
if (no1==(*itlstkmax_relt_cadmgmai).second) |
645 |
|
|
valeur1=(*itlstkmax_relt_cadmgmai).first; |
646 |
|
|
} |
647 |
|
|
for(itlstkgau_relt_cadmgmai=lstkgau_relt_cadmgmai.begin();itlstkgau_relt_cadmgmai!=lstkgau_relt_cadmgmai.end();itlstkgau_relt_cadmgmai++) |
648 |
|
|
{ |
649 |
|
|
if (no1==(*itlstkgau_relt_cadmgmai).second) |
650 |
|
|
valeur2=(*itlstkgau_relt_cadmgmai).first; |
651 |
|
|
} |
652 |
|
|
sol1->ecrire(valeur0,compte,0,0); |
653 |
|
|
sol1->ecrire(valeur1,compte,1,0); |
654 |
|
|
sol1->ecrire(valeur2,compte,2,0); |
655 |
|
|
for(itlstkmin_relt_cadmgmai=lstkmin_relt_cadmgmai.begin();itlstkmin_relt_cadmgmai!=lstkmin_relt_cadmgmai.end();itlstkmin_relt_cadmgmai++) |
656 |
|
|
{ |
657 |
|
|
if (no2==(*itlstkmin_relt_cadmgmai).second) |
658 |
|
|
valeur0=(*itlstkmin_relt_cadmgmai).first; |
659 |
|
|
} |
660 |
|
|
for(itlstkmax_relt_cadmgmai=lstkmax_relt_cadmgmai.begin();itlstkmax_relt_cadmgmai!=lstkmax_relt_cadmgmai.end();itlstkmax_relt_cadmgmai++) |
661 |
|
|
{ |
662 |
|
|
if (no2==(*itlstkmax_relt_cadmgmai).second) |
663 |
|
|
valeur1=(*itlstkmax_relt_cadmgmai).first; |
664 |
|
|
} |
665 |
|
|
for(itlstkgau_relt_cadmgmai=lstkgau_relt_cadmgmai.begin();itlstkgau_relt_cadmgmai!=lstkgau_relt_cadmgmai.end();itlstkgau_relt_cadmgmai++) |
666 |
|
|
{ |
667 |
|
|
if (no2==(*itlstkgau_relt_cadmgmai).second) |
668 |
|
|
valeur2=(*itlstkgau_relt_cadmgmai).first; |
669 |
|
|
} |
670 |
|
|
sol1->ecrire(valeur0,compte,0,1); |
671 |
|
|
sol1->ecrire(valeur1,compte,1,1); |
672 |
|
|
sol1->ecrire(valeur2,compte,2,1); |
673 |
|
|
for(itlstkmin_relt_cadmgmai=lstkmin_relt_cadmgmai.begin();itlstkmin_relt_cadmgmai!=lstkmin_relt_cadmgmai.end();itlstkmin_relt_cadmgmai++) |
674 |
|
|
{ |
675 |
|
|
if (no3==(*itlstkmin_relt_cadmgmai).second) |
676 |
|
|
valeur0=(*itlstkmin_relt_cadmgmai).first; |
677 |
|
|
} |
678 |
|
|
for(itlstkmax_relt_cadmgmai=lstkmax_relt_cadmgmai.begin();itlstkmax_relt_cadmgmai!=lstkmax_relt_cadmgmai.end();itlstkmax_relt_cadmgmai++) |
679 |
|
|
{ |
680 |
|
|
if (no3==(*itlstkmax_relt_cadmgmai).second) |
681 |
|
|
valeur1=(*itlstkmax_relt_cadmgmai).first; |
682 |
|
|
} |
683 |
|
|
for(itlstkgau_relt_cadmgmai=lstkgau_relt_cadmgmai.begin();itlstkgau_relt_cadmgmai!=lstkgau_relt_cadmgmai.end();itlstkgau_relt_cadmgmai++) |
684 |
|
|
{ |
685 |
|
|
if (no3==(*itlstkgau_relt_cadmgmai).second) |
686 |
|
|
valeur2=(*itlstkgau_relt_cadmgmai).first; |
687 |
|
|
} |
688 |
|
|
sol1->ecrire(valeur0,compte,0,2); |
689 |
|
|
sol1->ecrire(valeur1,compte,1,2); |
690 |
|
|
sol1->ecrire(valeur2,compte,2,2); |
691 |
|
|
compte++; |
692 |
|
|
} |
693 |
|
|
} |
694 |
sattarpa |
646 |
// affichage sur GMSH ****************************** |
695 |
|
|
if (gmsh_affiche>1) |
696 |
|
|
{ |
697 |
|
|
cout<<"affiche: calcul_courbure_cadmgmai "<<endl; |
698 |
|
|
std::ostringstream oss; |
699 |
|
|
oss << "calcul_courbure_cadmgmai_curvdif_coef:" <<curvdif_coef ; |
700 |
|
|
std::string namefic = oss.str(); |
701 |
|
|
char *cstr = new char[namefic.length() + 1]; |
702 |
|
|
strcpy(cstr, namefic.c_str()); |
703 |
|
|
MG_SOLUTION* sol1=new MG_SOLUTION(cadmgmai,3,cstr,1,(char*)"discrete_curboure_solution",MAGIC::ENTITE_SOLUTION::ENTITE_ELEMENT2_NOEUD,MAGIC::TYPE_SOLUTION::SCALAIRE); |
704 |
|
|
gest.ajouter_mg_solution(sol1); |
705 |
|
|
sol1->change_legende(0,"Kmin"); |
706 |
|
|
sol1->change_legende(1,"Kmax"); |
707 |
|
|
sol1->change_legende(2,"K_gau"); |
708 |
|
|
LISTE_MG_TRIANGLE::iterator ittri; |
709 |
|
|
int compte=0; |
710 |
|
|
for (MG_TRIANGLE* tri=cadmgmai->get_premier_triangle(ittri);tri!=NULL;tri=cadmgmai->get_suivant_triangle(ittri)) |
711 |
|
|
{ |
712 |
|
|
MG_NOEUD *no1=tri->get_noeud1(); |
713 |
|
|
MG_NOEUD *no2=tri->get_noeud2(); |
714 |
|
|
MG_NOEUD *no3=tri->get_noeud3(); |
715 |
|
|
char mess[500]; |
716 |
|
|
sprintf(mess,"%lu_%lu",no1->get_id(),tri->get_lien_topologie()->get_id()); |
717 |
|
|
double valeur0=liste_kmin[mess]; |
718 |
|
|
double valeur1=liste_kmax[mess]; |
719 |
|
|
double valeur2=liste_gau[mess]; |
720 |
|
|
sol1->ecrire(valeur0,compte,0,0); |
721 |
|
|
sol1->ecrire(valeur1,compte,1,0); |
722 |
|
|
sol1->ecrire(valeur2,compte,2,0); |
723 |
|
|
sprintf(mess,"%lu_%lu",no2->get_id(),tri->get_lien_topologie()->get_id()); |
724 |
|
|
valeur0=liste_kmin[mess]; |
725 |
|
|
valeur1=liste_kmax[mess]; |
726 |
|
|
valeur2=liste_gau[mess]; |
727 |
|
|
sol1->ecrire(valeur0,compte,0,1); |
728 |
|
|
sol1->ecrire(valeur1,compte,1,1); |
729 |
|
|
sol1->ecrire(valeur2,compte,2,1); |
730 |
|
|
sprintf(mess,"%lu_%lu",no3->get_id(),tri->get_lien_topologie()->get_id()); |
731 |
|
|
valeur0=liste_kmin[mess]; |
732 |
|
|
valeur1=liste_kmax[mess]; |
733 |
|
|
valeur2=liste_gau[mess]; |
734 |
|
|
sol1->ecrire(valeur0,compte,0,2); |
735 |
|
|
sol1->ecrire(valeur1,compte,1,2); |
736 |
|
|
sol1->ecrire(valeur2,compte,2,2); |
737 |
|
|
compte++; |
738 |
|
|
} |
739 |
|
|
} |
740 |
sattarpa |
609 |
liste_kmin.clear();liste_kmax.clear();liste_gau.clear();liste_courburemax1.clear();liste_courburemax2.clear();liste_courburemax3.clear();liste_courburemax4.clear();liste_courburemax5.clear(); |
741 |
sattarpa |
650 |
|
742 |
|
|
cout<<"calcul courbure defcadmgmai"<<endl; |
743 |
sattarpa |
609 |
// calcul courbure defcadmgmai ******************************** |
744 |
sattarpa |
554 |
|
745 |
sattarpa |
609 |
for (MG_NOEUD* defcadmgnd=defcadmgmai->get_premier_noeud(itdefcadndcurv);defcadmgnd!=NULL;defcadmgnd=defcadmgmai->get_suivant_noeud(itdefcadndcurv)) |
746 |
|
|
{ |
747 |
|
|
double kmin1=0.; |
748 |
|
|
double kmax1=0.; |
749 |
|
|
double kmin2=0.; |
750 |
|
|
double kmax2=0.; |
751 |
|
|
MG_MAILLAGE_OUTILS *cou; |
752 |
|
|
cou->calcul_courbure_face_arete_sommet(defcadmgnd,kmin1,kmax1,kmin2,kmax2,liste_kmin,liste_kmax,liste_gau,liste_courburemax1,liste_courburemax2,liste_courburemax3,liste_courburemax4,liste_courburemax5,opensurafece); |
753 |
|
|
} |
754 |
|
|
for (MG_NOEUD* defcadmgnd=defcadmgmai->get_premier_noeud(itdefcadndcurv);defcadmgnd!=NULL;defcadmgnd=defcadmgmai->get_suivant_noeud(itdefcadndcurv)) |
755 |
|
|
{ |
756 |
|
|
unsigned long idface=defcadmgnd->get_lien_topologie()->get_id(); |
757 |
|
|
unsigned long idnoeud=defcadmgnd->get_id(); |
758 |
|
|
char mess[500]; |
759 |
|
|
sprintf(mess,"%lu_%lu",idnoeud,idface); |
760 |
|
|
for(std::map<std::string,double>::iterator itkmin=liste_kmin.begin();itkmin!=liste_kmin.end();itkmin++) |
761 |
|
|
{ |
762 |
|
|
if(mess==(*itkmin).first) |
763 |
sattarpa |
650 |
{ |
764 |
sattarpa |
609 |
lstkmin_defcadmgmai.insert(pair<double,MG_NOEUD*>((*itkmin).second,defcadmgnd) ); |
765 |
sattarpa |
650 |
lstkmin_defcad.insert(pair<MG_NOEUD*,double>(defcadmgnd,(*itkmin).second)); |
766 |
|
|
} |
767 |
sattarpa |
609 |
} |
768 |
|
|
for(std::map<std::string,double>::iterator itkmax=liste_kmax.begin();itkmax!=liste_kmax.end();itkmax++) |
769 |
|
|
{ |
770 |
|
|
if(mess==(*itkmax).first) |
771 |
sattarpa |
650 |
{ |
772 |
sattarpa |
609 |
lstkmax_defcadmgmai.insert(pair<double,MG_NOEUD*>((*itkmax).second,defcadmgnd) ); |
773 |
sattarpa |
650 |
lstkmax_defcad.insert(pair<MG_NOEUD*,double>(defcadmgnd,(*itkmax).second)); |
774 |
|
|
} |
775 |
sattarpa |
609 |
} |
776 |
sattarpa |
646 |
for(std::map<std::string,double>::iterator itkgau=liste_gau.begin();itkgau!=liste_gau.end();itkgau++) |
777 |
|
|
{ |
778 |
|
|
if(mess==(*itkgau).first) |
779 |
sattarpa |
650 |
{ |
780 |
sattarpa |
646 |
lstkgau_defcadmgmai.insert(pair<double,MG_NOEUD*>((*itkgau).second,defcadmgnd) ); |
781 |
sattarpa |
650 |
lstkgau_defcad.insert(pair<MG_NOEUD*,double>(defcadmgnd,(*itkgau).second)); |
782 |
|
|
} |
783 |
sattarpa |
646 |
} |
784 |
sattarpa |
609 |
} |
785 |
sattarpa |
650 |
//calc reletive curvature defCAD |
786 |
|
|
map<MG_NOEUD*,double >::iterator itlstkmin_defcad; |
787 |
|
|
map<MG_NOEUD*,double >::iterator itlstkmax_defcad; |
788 |
|
|
map<MG_NOEUD*,double >::iterator itlstkgau_defcad; |
789 |
|
|
for (MG_NOEUD* defcadmgnd=defcadmgmai->get_premier_noeud(itdefcadndcurv);defcadmgnd!=NULL;defcadmgnd=defcadmgmai->get_suivant_noeud(itdefcadndcurv)) |
790 |
|
|
{ |
791 |
|
|
itlstkmin_defcad=lstkmin_defcad.find(defcadmgnd); |
792 |
|
|
double relet_kmindefcad=(*itlstkmin_defcad).second; |
793 |
|
|
itlstkmax_defcad=lstkmax_defcad.find(defcadmgnd); |
794 |
|
|
double relet_kmaxdefcad=(*itlstkmax_defcad).second; |
795 |
|
|
itlstkgau_defcad=lstkgau_cad.find(defcadmgnd); |
796 |
|
|
double relet_kgaudefcad=(*itlstkgau_defcad).second; |
797 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> lstnei_reldefcad; |
798 |
|
|
int reldefcad_neindnb=lstnei_reldefcad.get_nb(); |
799 |
|
|
double relet_search_rad1=relet_search_rad; |
800 |
|
|
while(reldefcad_neindnb<1) |
801 |
|
|
{ |
802 |
|
|
octreecad.rechercher(defcadmgnd->get_x(),defcadmgnd->get_y(),defcadmgnd->get_z(),relet_search_rad1,lstnei_reldefcad); |
803 |
|
|
reldefcad_neindnb=lstnei_reldefcad.get_nb(); |
804 |
|
|
relet_search_rad1=relet_search_rad1+0.1*relet_search_rad; |
805 |
|
|
} |
806 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itndnei; |
807 |
|
|
for(MG_NOEUD* defcadndnei=lstnei_reldefcad.get_premier(itndnei);defcadndnei!=NULL;defcadndnei=lstnei_reldefcad.get_suivant(itndnei)) |
808 |
|
|
{ |
809 |
|
|
itlstkmin_cad=lstkmin_cad.find(defcadndnei); |
810 |
|
|
relet_kmindefcad=relet_kmindefcad+(*itlstkmin_defcad).second; |
811 |
|
|
itlstkmax_cad=lstkmax_cad.find(defcadndnei); |
812 |
|
|
relet_kmaxdefcad=relet_kmaxdefcad+(*itlstkmax_defcad).second; |
813 |
|
|
itlstkgau_cad=lstkgau_cad.find(defcadndnei); |
814 |
|
|
relet_kgaudefcad=relet_kgaudefcad+(*itlstkgau_defcad).second; |
815 |
|
|
} |
816 |
|
|
relet_kmindefcad=relet_kmindefcad/lstnei_reldefcad.get_nb(); |
817 |
|
|
relet_kmaxdefcad=relet_kmaxdefcad/lstnei_reldefcad.get_nb(); |
818 |
|
|
relet_kgaudefcad=relet_kgaudefcad/lstnei_reldefcad.get_nb(); |
819 |
|
|
lstkmin_relt_defcadmgmai.insert(pair<double,MG_NOEUD*> (relet_kmindefcad,defcadmgnd)); |
820 |
|
|
lstkmax_relt_defcadmgmai.insert(pair<double,MG_NOEUD*> (relet_kmaxdefcad,defcadmgnd)); |
821 |
|
|
lstkgau_relt_defcadmgmai.insert(pair<double,MG_NOEUD*> (relet_kgaudefcad,defcadmgnd)); |
822 |
|
|
} |
823 |
|
|
// affichage reletive defcad sur GMSH ****************************** |
824 |
|
|
if (gmsh_affiche>1) |
825 |
|
|
{ |
826 |
|
|
cout<<"affiche: calcul_courbure_cadmgmai_relet "<<endl; |
827 |
|
|
std::ostringstream oss; |
828 |
|
|
oss << "calcul_courbure_cadmgmai_curvdif_relet_coef:" <<curvdif_coef ; |
829 |
|
|
std::string namefic = oss.str(); |
830 |
|
|
char *cstr = new char[namefic.length() + 1]; |
831 |
|
|
strcpy(cstr, namefic.c_str()); |
832 |
|
|
MG_SOLUTION* sol1=new MG_SOLUTION(cadmgmai,3,cstr,1,(char*)"discrete_curboure_solution",MAGIC::ENTITE_SOLUTION::ENTITE_ELEMENT2_NOEUD,MAGIC::TYPE_SOLUTION::SCALAIRE); |
833 |
|
|
gest.ajouter_mg_solution(sol1); |
834 |
|
|
sol1->change_legende(0,"Kmin_relet"); |
835 |
|
|
sol1->change_legende(1,"Kmax_relet"); |
836 |
|
|
sol1->change_legende(2,"K_gau_relet"); |
837 |
|
|
LISTE_MG_TRIANGLE::iterator ittri; |
838 |
|
|
int compte=0; |
839 |
|
|
for (MG_TRIANGLE* tri=cadmgmai->get_premier_triangle(ittri);tri!=NULL;tri=cadmgmai->get_suivant_triangle(ittri)) |
840 |
|
|
{ |
841 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_relt_cadmgmai; |
842 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_relt_cadmgmai; |
843 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkgau_relt_cadmgmai; |
844 |
|
|
MG_NOEUD *no1=tri->get_noeud1(); |
845 |
|
|
MG_NOEUD *no2=tri->get_noeud2(); |
846 |
|
|
MG_NOEUD *no3=tri->get_noeud3(); |
847 |
|
|
double valeur0; |
848 |
|
|
double valeur1; |
849 |
|
|
double valeur2; |
850 |
|
|
for(itlstkmin_relt_cadmgmai=lstkmin_relt_cadmgmai.begin();itlstkmin_relt_cadmgmai!=lstkmin_relt_cadmgmai.end();itlstkmin_relt_cadmgmai++) |
851 |
|
|
{ |
852 |
|
|
if (no1==(*itlstkmin_relt_cadmgmai).second) |
853 |
|
|
valeur0=(*itlstkmin_relt_cadmgmai).first; |
854 |
|
|
} |
855 |
|
|
for(itlstkmax_relt_cadmgmai=lstkmax_relt_cadmgmai.begin();itlstkmax_relt_cadmgmai!=lstkmax_relt_cadmgmai.end();itlstkmax_relt_cadmgmai++) |
856 |
|
|
{ |
857 |
|
|
if (no1==(*itlstkmax_relt_cadmgmai).second) |
858 |
|
|
valeur1=(*itlstkmax_relt_cadmgmai).first; |
859 |
|
|
} |
860 |
|
|
for(itlstkgau_relt_cadmgmai=lstkgau_relt_cadmgmai.begin();itlstkgau_relt_cadmgmai!=lstkgau_relt_cadmgmai.end();itlstkgau_relt_cadmgmai++) |
861 |
|
|
{ |
862 |
|
|
if (no1==(*itlstkgau_relt_cadmgmai).second) |
863 |
|
|
valeur2=(*itlstkgau_relt_cadmgmai).first; |
864 |
|
|
} |
865 |
|
|
sol1->ecrire(valeur0,compte,0,0); |
866 |
|
|
sol1->ecrire(valeur1,compte,1,0); |
867 |
|
|
sol1->ecrire(valeur2,compte,2,0); |
868 |
|
|
for(itlstkmin_relt_cadmgmai=lstkmin_relt_cadmgmai.begin();itlstkmin_relt_cadmgmai!=lstkmin_relt_cadmgmai.end();itlstkmin_relt_cadmgmai++) |
869 |
|
|
{ |
870 |
|
|
if (no2==(*itlstkmin_relt_cadmgmai).second) |
871 |
|
|
valeur0=(*itlstkmin_relt_cadmgmai).first; |
872 |
|
|
} |
873 |
|
|
for(itlstkmax_relt_cadmgmai=lstkmax_relt_cadmgmai.begin();itlstkmax_relt_cadmgmai!=lstkmax_relt_cadmgmai.end();itlstkmax_relt_cadmgmai++) |
874 |
|
|
{ |
875 |
|
|
if (no2==(*itlstkmax_relt_cadmgmai).second) |
876 |
|
|
valeur1=(*itlstkmax_relt_cadmgmai).first; |
877 |
|
|
} |
878 |
|
|
for(itlstkgau_relt_cadmgmai=lstkgau_relt_cadmgmai.begin();itlstkgau_relt_cadmgmai!=lstkgau_relt_cadmgmai.end();itlstkgau_relt_cadmgmai++) |
879 |
|
|
{ |
880 |
|
|
if (no2==(*itlstkgau_relt_cadmgmai).second) |
881 |
|
|
valeur2=(*itlstkgau_relt_cadmgmai).first; |
882 |
|
|
} |
883 |
|
|
sol1->ecrire(valeur0,compte,0,1); |
884 |
|
|
sol1->ecrire(valeur1,compte,1,1); |
885 |
|
|
sol1->ecrire(valeur2,compte,2,1); |
886 |
|
|
for(itlstkmin_relt_cadmgmai=lstkmin_relt_cadmgmai.begin();itlstkmin_relt_cadmgmai!=lstkmin_relt_cadmgmai.end();itlstkmin_relt_cadmgmai++) |
887 |
|
|
{ |
888 |
|
|
if (no3==(*itlstkmin_relt_cadmgmai).second) |
889 |
|
|
valeur0=(*itlstkmin_relt_cadmgmai).first; |
890 |
|
|
} |
891 |
|
|
for(itlstkmax_relt_cadmgmai=lstkmax_relt_cadmgmai.begin();itlstkmax_relt_cadmgmai!=lstkmax_relt_cadmgmai.end();itlstkmax_relt_cadmgmai++) |
892 |
|
|
{ |
893 |
|
|
if (no3==(*itlstkmax_relt_cadmgmai).second) |
894 |
|
|
valeur1=(*itlstkmax_relt_cadmgmai).first; |
895 |
|
|
} |
896 |
|
|
for(itlstkgau_relt_cadmgmai=lstkgau_relt_cadmgmai.begin();itlstkgau_relt_cadmgmai!=lstkgau_relt_cadmgmai.end();itlstkgau_relt_cadmgmai++) |
897 |
|
|
{ |
898 |
|
|
if (no3==(*itlstkgau_relt_cadmgmai).second) |
899 |
|
|
valeur2=(*itlstkgau_relt_cadmgmai).first; |
900 |
|
|
} |
901 |
|
|
sol1->ecrire(valeur0,compte,0,2); |
902 |
|
|
sol1->ecrire(valeur1,compte,1,2); |
903 |
|
|
sol1->ecrire(valeur2,compte,2,2); |
904 |
|
|
compte++; |
905 |
|
|
} |
906 |
|
|
} |
907 |
sattarpa |
646 |
// affichage sur GMSH ****************************** |
908 |
|
|
if (gmsh_affiche>1) |
909 |
|
|
{ |
910 |
|
|
cout<<"affiche: calcul_courbure_defcadmgmai "<<endl; |
911 |
|
|
std::ostringstream oss; |
912 |
|
|
oss << "calcul_courbure_defcadmgmai_curvdif_coef:" <<curvdif_coef ; |
913 |
|
|
std::string namefic = oss.str(); |
914 |
|
|
char *cstr = new char[namefic.length() + 1]; |
915 |
|
|
strcpy(cstr, namefic.c_str()); |
916 |
|
|
MG_SOLUTION* sol2=new MG_SOLUTION(defcadmgmai,3,cstr,1,(char*)"discrete_curboure_solution",MAGIC::ENTITE_SOLUTION::ENTITE_ELEMENT2_NOEUD,MAGIC::TYPE_SOLUTION::SCALAIRE); |
917 |
|
|
gest.ajouter_mg_solution(sol2); |
918 |
|
|
sol2->change_legende(0,"Kmin"); |
919 |
|
|
sol2->change_legende(1,"Kmax"); |
920 |
|
|
sol2->change_legende(2,"K_gau"); |
921 |
|
|
LISTE_MG_TRIANGLE::iterator ittri; |
922 |
|
|
int compte=0; |
923 |
|
|
for (MG_TRIANGLE* tri=defcadmgmai->get_premier_triangle(ittri);tri!=NULL;tri=defcadmgmai->get_suivant_triangle(ittri)) |
924 |
|
|
{ |
925 |
|
|
MG_NOEUD *no1=tri->get_noeud1(); |
926 |
|
|
MG_NOEUD *no2=tri->get_noeud2(); |
927 |
|
|
MG_NOEUD *no3=tri->get_noeud3(); |
928 |
|
|
char mess[500]; |
929 |
|
|
sprintf(mess,"%lu_%lu",no1->get_id(),tri->get_lien_topologie()->get_id()); |
930 |
|
|
double valeur0=liste_kmin[mess]; |
931 |
|
|
double valeur1=liste_kmax[mess]; |
932 |
|
|
double valeur2=liste_gau[mess]; |
933 |
|
|
sol2->ecrire(valeur0,compte,0,0); |
934 |
|
|
sol2->ecrire(valeur1,compte,1,0); |
935 |
|
|
sol2->ecrire(valeur2,compte,2,0); |
936 |
|
|
sprintf(mess,"%lu_%lu",no2->get_id(),tri->get_lien_topologie()->get_id()); |
937 |
|
|
valeur0=liste_kmin[mess]; |
938 |
|
|
valeur1=liste_kmax[mess]; |
939 |
|
|
valeur2=liste_gau[mess]; |
940 |
|
|
sol2->ecrire(valeur0,compte,0,1); |
941 |
|
|
sol2->ecrire(valeur1,compte,1,1); |
942 |
|
|
sol2->ecrire(valeur2,compte,2,1); |
943 |
|
|
sprintf(mess,"%lu_%lu",no3->get_id(),tri->get_lien_topologie()->get_id()); |
944 |
|
|
valeur0=liste_kmin[mess]; |
945 |
|
|
valeur1=liste_kmax[mess]; |
946 |
|
|
valeur2=liste_gau[mess]; |
947 |
|
|
sol2->ecrire(valeur0,compte,0,2); |
948 |
|
|
sol2->ecrire(valeur1,compte,1,2); |
949 |
|
|
sol2->ecrire(valeur2,compte,2,2); |
950 |
|
|
compte++; |
951 |
|
|
} |
952 |
sattarpa |
673 |
|
953 |
sattarpa |
646 |
} |
954 |
|
|
liste_kmin.clear();liste_kmax.clear();liste_gau.clear();liste_courburemax1.clear();liste_courburemax2.clear();liste_courburemax3.clear();liste_courburemax4.clear();liste_courburemax5.clear(); |
955 |
|
|
|
956 |
|
|
|
957 |
|
|
///make correspondence between cadmgmai and defcadmgmai nodes |
958 |
sattarpa |
609 |
map<unsigned long, unsigned long>::iterator itcoresspondndidlst; |
959 |
|
|
for(MG_NOEUD* defcadndcurv=defcadmgmai->get_premier_noeud(itdefcadndcurv);defcadndcurv!=NULL;defcadndcurv=defcadmgmai->get_suivant_noeud(itdefcadndcurv)) |
960 |
|
|
{ |
961 |
|
|
itcoresspondndidlst=coresspondndidlst.find(defcadndcurv->get_id()); |
962 |
|
|
defcadndcurv->change_nouveau_numero((*itcoresspondndidlst).second); |
963 |
|
|
} |
964 |
|
|
|
965 |
|
|
cout<<"solution calculation"<<endl; |
966 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkmin_diff; |
967 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkmax_diff; |
968 |
sattarpa |
646 |
multimap<double,MG_NOEUD*,std::greater<double> > lstkgau_diff; |
969 |
sattarpa |
609 |
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_cadmgmai; |
970 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_cadmgmai; |
971 |
sattarpa |
646 |
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkgau_cadmgmai; |
972 |
sattarpa |
609 |
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_defcadmgmai; |
973 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_defcadmgmai; |
974 |
sattarpa |
646 |
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkgau_defcadmgmai; |
975 |
sattarpa |
609 |
cout<<"lstkmin_cadmgmai.size()= "<<lstkmin_cadmgmai.size()<<endl; |
976 |
|
|
cout<<"lstkmin_defcadmgmai.size()= "<<lstkmin_defcadmgmai.size()<<endl; |
977 |
sattarpa |
646 |
cout<<"kmin diff. calc. started"<<endl; |
978 |
sattarpa |
650 |
|
979 |
sattarpa |
609 |
for(itlstkmin_cadmgmai=lstkmin_cadmgmai.begin();itlstkmin_cadmgmai!=lstkmin_cadmgmai.end();itlstkmin_cadmgmai++) |
980 |
sattarpa |
554 |
{ |
981 |
sattarpa |
609 |
MG_NOEUD* cadndcurv=(*itlstkmin_cadmgmai).second; |
982 |
|
|
double kmindcad; |
983 |
|
|
double kmindcad_def; |
984 |
|
|
kmindcad=(*itlstkmin_cadmgmai).first; |
985 |
|
|
for(itlstkmin_defcadmgmai=lstkmin_defcadmgmai.begin();itlstkmin_defcadmgmai!=lstkmin_defcadmgmai.end();itlstkmin_defcadmgmai++) |
986 |
|
|
{ |
987 |
|
|
MG_NOEUD* defcadndcurv=(*itlstkmin_defcadmgmai).second; |
988 |
|
|
if(defcadndcurv->get_nouveau_numero()==cadndcurv->get_id()) |
989 |
|
|
kmindcad_def=(*itlstkmin_defcadmgmai).first; |
990 |
|
|
} |
991 |
|
|
|
992 |
|
|
double kmin_diff=kmindcad_def-kmindcad; |
993 |
|
|
lstkmin_diff.insert(pair<double,MG_NOEUD*>(kmin_diff,cadndcurv) ); |
994 |
|
|
} |
995 |
sattarpa |
646 |
cout<<"kmax diff. calc. started"<<endl; |
996 |
sattarpa |
609 |
for(itlstkmax_cadmgmai=lstkmax_cadmgmai.begin();itlstkmax_cadmgmai!=lstkmax_cadmgmai.end();itlstkmax_cadmgmai++) |
997 |
|
|
{ |
998 |
|
|
MG_NOEUD* cadndcurv=(*itlstkmax_cadmgmai).second; |
999 |
|
|
double kmaxndcad; |
1000 |
|
|
double kmaxndcad_def; |
1001 |
|
|
kmaxndcad=(*itlstkmax_cadmgmai).first; |
1002 |
|
|
for(itlstkmax_defcadmgmai=lstkmax_defcadmgmai.begin();itlstkmax_defcadmgmai!=lstkmax_defcadmgmai.end();itlstkmax_defcadmgmai++) |
1003 |
|
|
{ |
1004 |
|
|
MG_NOEUD* defcadndcurv=(*itlstkmax_defcadmgmai).second; |
1005 |
|
|
if(defcadndcurv->get_nouveau_numero()==cadndcurv->get_id()) |
1006 |
|
|
{ |
1007 |
|
|
kmaxndcad_def=(*itlstkmax_defcadmgmai).first; |
1008 |
|
|
} |
1009 |
|
|
} |
1010 |
|
|
double kmax_diff=kmaxndcad_def-kmaxndcad; |
1011 |
|
|
lstkmax_diff.insert(pair<double,MG_NOEUD*>(kmax_diff,cadndcurv) ); |
1012 |
|
|
} |
1013 |
sattarpa |
646 |
cout<<"kgau diff. calc. started"<<endl; |
1014 |
|
|
for(itlstkgau_cadmgmai=lstkgau_cadmgmai.begin();itlstkgau_cadmgmai!=lstkgau_cadmgmai.end();itlstkgau_cadmgmai++) |
1015 |
|
|
{ |
1016 |
|
|
MG_NOEUD* cadndcurv=(*itlstkgau_cadmgmai).second; |
1017 |
|
|
double kgaundcad; |
1018 |
|
|
double kgaundcad_def; |
1019 |
|
|
kgaundcad=(*itlstkgau_cadmgmai).first; |
1020 |
|
|
for(itlstkgau_defcadmgmai=lstkgau_defcadmgmai.begin();itlstkgau_defcadmgmai!=lstkgau_defcadmgmai.end();itlstkgau_defcadmgmai++) |
1021 |
|
|
{ |
1022 |
|
|
MG_NOEUD* defcadndcurv=(*itlstkgau_defcadmgmai).second; |
1023 |
|
|
if(defcadndcurv->get_nouveau_numero()==cadndcurv->get_id()) |
1024 |
|
|
{ |
1025 |
|
|
kgaundcad_def=(*itlstkgau_defcadmgmai).first; |
1026 |
|
|
} |
1027 |
|
|
} |
1028 |
|
|
double kgau_diff=kgaundcad_def-kgaundcad; |
1029 |
|
|
lstkgau_diff.insert(pair<double,MG_NOEUD*>(kgau_diff,cadndcurv) ); |
1030 |
|
|
} |
1031 |
sattarpa |
673 |
// mean diff |
1032 |
sattarpa |
650 |
multimap<double,MG_NOEUD*,std::greater<double> > lstkmin_relt_diff; |
1033 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkmax_relt_diff; |
1034 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> > lstkgau_relt_diff; |
1035 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_relt_cadmgmai; |
1036 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_relt_cadmgmai; |
1037 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkgau_relt_cadmgmai; |
1038 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_relt_defcadmgmai; |
1039 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_relt_defcadmgmai; |
1040 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkgau_relt_defcadmgmai; |
1041 |
sattarpa |
658 |
cout<<"kmin _relt diff. calc. started"<<endl; |
1042 |
|
|
for(itlstkmin_relt_cadmgmai=lstkmin_relt_cadmgmai.begin();itlstkmin_relt_cadmgmai!=lstkmin_relt_cadmgmai.end();itlstkmin_relt_cadmgmai++) |
1043 |
sattarpa |
650 |
{ |
1044 |
|
|
MG_NOEUD* cadndcurv=(*itlstkmin_relt_cadmgmai).second; |
1045 |
|
|
double kmindcad; |
1046 |
|
|
double kmindcad_relt_def; |
1047 |
|
|
kmindcad=(*itlstkmin_relt_cadmgmai).first; |
1048 |
|
|
for(itlstkmin_relt_defcadmgmai=lstkmin_relt_defcadmgmai.begin();itlstkmin_relt_defcadmgmai!=lstkmin_relt_defcadmgmai.end();itlstkmin_relt_defcadmgmai++) |
1049 |
|
|
{ |
1050 |
|
|
MG_NOEUD* defcadndcurv=(*itlstkmin_relt_defcadmgmai).second; |
1051 |
|
|
if(defcadndcurv->get_nouveau_numero()==cadndcurv->get_id()) |
1052 |
|
|
kmindcad_relt_def=(*itlstkmin_relt_defcadmgmai).first; |
1053 |
|
|
} |
1054 |
|
|
|
1055 |
|
|
double kmin_relt_diff=kmindcad_relt_def-kmindcad; |
1056 |
|
|
lstkmin_relt_diff.insert(pair<double,MG_NOEUD*>(kmin_relt_diff,cadndcurv) ); |
1057 |
|
|
} |
1058 |
|
|
cout<<"kmax _relt diff. calc. started"<<endl; |
1059 |
|
|
for(itlstkmax_relt_cadmgmai=lstkmax_relt_cadmgmai.begin();itlstkmax_relt_cadmgmai!=lstkmax_relt_cadmgmai.end();itlstkmax_relt_cadmgmai++) |
1060 |
|
|
{ |
1061 |
|
|
MG_NOEUD* cadndcurv=(*itlstkmax_relt_cadmgmai).second; |
1062 |
|
|
double kmaxndcad; |
1063 |
|
|
double kmaxndcad_relt_def; |
1064 |
|
|
kmaxndcad=(*itlstkmax_relt_cadmgmai).first; |
1065 |
|
|
for(itlstkmax_relt_defcadmgmai=lstkmax_relt_defcadmgmai.begin();itlstkmax_relt_defcadmgmai!=lstkmax_relt_defcadmgmai.end();itlstkmax_relt_defcadmgmai++) |
1066 |
|
|
{ |
1067 |
|
|
MG_NOEUD* defcadndcurv=(*itlstkmax_relt_defcadmgmai).second; |
1068 |
|
|
if(defcadndcurv->get_nouveau_numero()==cadndcurv->get_id()) |
1069 |
|
|
{ |
1070 |
|
|
kmaxndcad_relt_def=(*itlstkmax_relt_defcadmgmai).first; |
1071 |
|
|
} |
1072 |
|
|
} |
1073 |
|
|
double kmax_relt_diff=kmaxndcad_relt_def-kmaxndcad; |
1074 |
|
|
lstkmax_relt_diff.insert(pair<double,MG_NOEUD*>(kmax_relt_diff,cadndcurv) ); |
1075 |
|
|
} |
1076 |
|
|
cout<<"kgau_relt diff. calc. started"<<endl; |
1077 |
|
|
for(itlstkgau_relt_cadmgmai=lstkgau_relt_cadmgmai.begin();itlstkgau_relt_cadmgmai!=lstkgau_relt_cadmgmai.end();itlstkgau_relt_cadmgmai++) |
1078 |
|
|
{ |
1079 |
|
|
MG_NOEUD* cadndcurv=(*itlstkgau_relt_cadmgmai).second; |
1080 |
|
|
double kgaundcad; |
1081 |
|
|
double kgaundcad_relt_def; |
1082 |
|
|
kgaundcad=(*itlstkgau_relt_cadmgmai).first; |
1083 |
|
|
for(itlstkgau_relt_defcadmgmai=lstkgau_relt_defcadmgmai.begin();itlstkgau_relt_defcadmgmai!=lstkgau_relt_defcadmgmai.end();itlstkgau_relt_defcadmgmai++) |
1084 |
|
|
{ |
1085 |
|
|
MG_NOEUD* defcadndcurv=(*itlstkgau_relt_defcadmgmai).second; |
1086 |
|
|
if(defcadndcurv->get_nouveau_numero()==cadndcurv->get_id()) |
1087 |
|
|
{ |
1088 |
|
|
kgaundcad_relt_def=(*itlstkgau_relt_defcadmgmai).first; |
1089 |
|
|
} |
1090 |
|
|
} |
1091 |
|
|
double kgau_relt_diff=kgaundcad_relt_def-kgaundcad; |
1092 |
|
|
lstkgau_relt_diff.insert(pair<double,MG_NOEUD*>(kgau_relt_diff,cadndcurv) ); |
1093 |
|
|
} |
1094 |
|
|
// affichage reletive diff sur GMSH ****************************** |
1095 |
|
|
if (gmsh_affiche>0) |
1096 |
|
|
{ |
1097 |
|
|
cout<<"affiche: calcul_relet_difference_courbure "<<endl; |
1098 |
|
|
std::ostringstream oss; |
1099 |
|
|
oss << "KMaxMinGaudiff_curvdifcoef_relet:" <<curvdif_coef ; |
1100 |
|
|
std::string namefic = oss.str(); |
1101 |
|
|
char *cstr = new char[namefic.length() + 1]; |
1102 |
|
|
strcpy(cstr, namefic.c_str()); |
1103 |
|
|
MG_SOLUTION* sol4=new MG_SOLUTION(cadmgmai,3,cstr,1,(char*)"Kdiff_relt_solution",MAGIC::ENTITE_SOLUTION::ENTITE_ELEMENT2_NOEUD,MAGIC::TYPE_SOLUTION::SCALAIRE); |
1104 |
|
|
gest.ajouter_mg_solution(sol4); |
1105 |
|
|
sol4->change_legende(0,"Kmin_diff"); |
1106 |
|
|
sol4->change_legende(1,"Kmax_diff"); |
1107 |
|
|
sol4->change_legende(2,"Kgau_diff"); |
1108 |
|
|
LISTE_MG_TRIANGLE::iterator ittri; |
1109 |
|
|
int compte=0; |
1110 |
|
|
for (MG_TRIANGLE* tri=cadmgmai->get_premier_triangle(ittri);tri!=NULL;tri=cadmgmai->get_suivant_triangle(ittri)) |
1111 |
|
|
{ |
1112 |
|
|
MG_NOEUD *no1=tri->get_noeud1(); |
1113 |
|
|
MG_NOEUD *no2=tri->get_noeud2(); |
1114 |
|
|
MG_NOEUD *no3=tri->get_noeud3(); |
1115 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_relt_diff; |
1116 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_relt_diff; |
1117 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkgau_relt_diff; |
1118 |
|
|
double valeurKmin1, valeurKmin2, valeurKmin3; |
1119 |
|
|
double valeurKmax1, valeurKmax2, valeurKmax3; |
1120 |
|
|
double valeurKgau1, valeurKgau2, valeurKgau3; |
1121 |
|
|
for (itlstkmin_relt_diff=lstkmin_relt_diff.begin();itlstkmin_relt_diff!=lstkmin_relt_diff.end();itlstkmin_relt_diff++) |
1122 |
|
|
{ |
1123 |
|
|
if (no1==(*itlstkmin_relt_diff).second) |
1124 |
|
|
valeurKmin1=(*itlstkmin_relt_diff).first; |
1125 |
|
|
if (no2==(*itlstkmin_relt_diff).second) |
1126 |
|
|
valeurKmin2=(*itlstkmin_relt_diff).first; |
1127 |
|
|
if (no3==(*itlstkmin_relt_diff).second) |
1128 |
|
|
valeurKmin3=(*itlstkmin_relt_diff).first; |
1129 |
|
|
} |
1130 |
|
|
for (itlstkmax_relt_diff=lstkmax_relt_diff.begin();itlstkmax_relt_diff!=lstkmax_relt_diff.end();itlstkmax_relt_diff++) |
1131 |
|
|
{ |
1132 |
|
|
if (no1==(*itlstkmax_relt_diff).second) |
1133 |
|
|
valeurKmax1=(*itlstkmax_relt_diff).first; |
1134 |
|
|
if (no2==(*itlstkmax_relt_diff).second) |
1135 |
|
|
valeurKmax2=(*itlstkmax_relt_diff).first; |
1136 |
|
|
if (no3==(*itlstkmax_relt_diff).second) |
1137 |
|
|
valeurKmax3=(*itlstkmax_relt_diff).first; |
1138 |
|
|
} |
1139 |
|
|
for (itlstkgau_relt_diff=lstkgau_relt_diff.begin();itlstkgau_relt_diff!=lstkgau_relt_diff.end();itlstkgau_relt_diff++) |
1140 |
|
|
{ |
1141 |
|
|
if (no1==(*itlstkgau_relt_diff).second) |
1142 |
|
|
valeurKgau1=(*itlstkgau_relt_diff).first; |
1143 |
|
|
if (no2==(*itlstkgau_relt_diff).second) |
1144 |
|
|
valeurKgau2=(*itlstkgau_relt_diff).first; |
1145 |
|
|
if (no3==(*itlstkgau_relt_diff).second) |
1146 |
|
|
valeurKgau3=(*itlstkgau_relt_diff).first; |
1147 |
|
|
} |
1148 |
|
|
sol4->ecrire(valeurKmin1,compte,0,0); |
1149 |
|
|
sol4->ecrire(valeurKmax1,compte,1,0); |
1150 |
|
|
sol4->ecrire(valeurKgau1,compte,2,0); |
1151 |
|
|
|
1152 |
|
|
sol4->ecrire(valeurKmin2,compte,0,1); |
1153 |
|
|
sol4->ecrire(valeurKmax2,compte,1,1); |
1154 |
|
|
sol4->ecrire(valeurKgau2,compte,2,1); |
1155 |
|
|
|
1156 |
|
|
sol4->ecrire(valeurKmin3,compte,0,2); |
1157 |
|
|
sol4->ecrire(valeurKmax3,compte,1,2); |
1158 |
|
|
sol4->ecrire(valeurKgau3,compte,2,2); |
1159 |
|
|
compte++; |
1160 |
|
|
} |
1161 |
|
|
} |
1162 |
|
|
|
1163 |
sattarpa |
646 |
// affichage sur GMSH ****************************** |
1164 |
sattarpa |
658 |
if (gmsh_affiche>1) |
1165 |
sattarpa |
646 |
{ |
1166 |
|
|
cout<<"affiche: calcul_difference_courbure "<<endl; |
1167 |
|
|
std::ostringstream oss; |
1168 |
|
|
oss << "KMaxMinGaudiff_curvdifcoef:" <<curvdif_coef ; |
1169 |
|
|
std::string namefic = oss.str(); |
1170 |
|
|
char *cstr = new char[namefic.length() + 1]; |
1171 |
|
|
strcpy(cstr, namefic.c_str()); |
1172 |
|
|
MG_SOLUTION* sol3=new MG_SOLUTION(cadmgmai,3,cstr,1,(char*)"Kdiff_solution",MAGIC::ENTITE_SOLUTION::ENTITE_ELEMENT2_NOEUD,MAGIC::TYPE_SOLUTION::SCALAIRE); |
1173 |
|
|
gest.ajouter_mg_solution(sol3); |
1174 |
|
|
sol3->change_legende(0,"Kmin_diff"); |
1175 |
|
|
sol3->change_legende(1,"Kmax_diff"); |
1176 |
|
|
sol3->change_legende(2,"Kgau_diff"); |
1177 |
|
|
LISTE_MG_TRIANGLE::iterator ittri; |
1178 |
|
|
int compte=0; |
1179 |
|
|
for (MG_TRIANGLE* tri=cadmgmai->get_premier_triangle(ittri);tri!=NULL;tri=cadmgmai->get_suivant_triangle(ittri)) |
1180 |
|
|
{ |
1181 |
|
|
MG_NOEUD *no1=tri->get_noeud1(); |
1182 |
|
|
MG_NOEUD *no2=tri->get_noeud2(); |
1183 |
|
|
MG_NOEUD *no3=tri->get_noeud3(); |
1184 |
|
|
//char mess[500]; |
1185 |
|
|
//sprintf(mess,"%lu_%lu",no1->get_id(),tri->get_lien_topologie()->get_id()); |
1186 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_diff; |
1187 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_diff; |
1188 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkgau_diff; |
1189 |
|
|
double valeurKmin1, valeurKmin2, valeurKmin3; |
1190 |
|
|
double valeurKmax1, valeurKmax2, valeurKmax3; |
1191 |
|
|
double valeurKgau1, valeurKgau2, valeurKgau3; |
1192 |
|
|
for (itlstkmin_diff=lstkmin_diff.begin();itlstkmin_diff!=lstkmin_diff.end();itlstkmin_diff++) |
1193 |
|
|
{ |
1194 |
|
|
if (no1==(*itlstkmin_diff).second) |
1195 |
|
|
valeurKmin1=(*itlstkmin_diff).first; |
1196 |
|
|
if (no2==(*itlstkmin_diff).second) |
1197 |
|
|
valeurKmin2=(*itlstkmin_diff).first; |
1198 |
|
|
if (no3==(*itlstkmin_diff).second) |
1199 |
|
|
valeurKmin3=(*itlstkmin_diff).first; |
1200 |
|
|
} |
1201 |
|
|
for (itlstkmax_diff=lstkmax_diff.begin();itlstkmax_diff!=lstkmax_diff.end();itlstkmax_diff++) |
1202 |
|
|
{ |
1203 |
|
|
if (no1==(*itlstkmax_diff).second) |
1204 |
|
|
valeurKmax1=(*itlstkmax_diff).first; |
1205 |
|
|
if (no2==(*itlstkmax_diff).second) |
1206 |
|
|
valeurKmax2=(*itlstkmax_diff).first; |
1207 |
|
|
if (no3==(*itlstkmax_diff).second) |
1208 |
|
|
valeurKmax3=(*itlstkmax_diff).first; |
1209 |
|
|
} |
1210 |
|
|
for (itlstkgau_diff=lstkgau_diff.begin();itlstkgau_diff!=lstkgau_diff.end();itlstkgau_diff++) |
1211 |
|
|
{ |
1212 |
|
|
if (no1==(*itlstkgau_diff).second) |
1213 |
|
|
valeurKgau1=(*itlstkgau_diff).first; |
1214 |
|
|
if (no2==(*itlstkgau_diff).second) |
1215 |
|
|
valeurKgau2=(*itlstkgau_diff).first; |
1216 |
|
|
if (no3==(*itlstkgau_diff).second) |
1217 |
|
|
valeurKgau3=(*itlstkgau_diff).first; |
1218 |
|
|
} |
1219 |
|
|
sol3->ecrire(valeurKmin1,compte,0,0); |
1220 |
|
|
sol3->ecrire(valeurKmax1,compte,1,0); |
1221 |
|
|
sol3->ecrire(valeurKgau1,compte,2,0); |
1222 |
sattarpa |
609 |
|
1223 |
sattarpa |
646 |
sol3->ecrire(valeurKmin2,compte,0,1); |
1224 |
|
|
sol3->ecrire(valeurKmax2,compte,1,1); |
1225 |
|
|
sol3->ecrire(valeurKgau2,compte,2,1); |
1226 |
|
|
|
1227 |
|
|
sol3->ecrire(valeurKmin3,compte,0,2); |
1228 |
|
|
sol3->ecrire(valeurKmax3,compte,1,2); |
1229 |
|
|
sol3->ecrire(valeurKgau3,compte,2,2); |
1230 |
|
|
compte++; |
1231 |
|
|
} |
1232 |
sattarpa |
673 |
|
1233 |
|
|
} |
1234 |
|
|
|
1235 |
|
|
char chaine[1000]; |
1236 |
sattarpa |
646 |
char* p; |
1237 |
|
|
p=strrchr(magicfilename,'.'); |
1238 |
|
|
strncpy(chaine,magicfilename,p-magicfilename); |
1239 |
|
|
std::string namfic=chaine; |
1240 |
|
|
namfic=namfic + "courbcal.magic"; |
1241 |
|
|
gest.enregistrer(namfic.c_str()); |
1242 |
sattarpa |
673 |
cout<<"read insert points in lstpinsert"<<endl; |
1243 |
sattarpa |
609 |
//read insert points in lstpinsert |
1244 |
|
|
std::vector<double*> lstpinsert; |
1245 |
|
|
double prop=0.001; |
1246 |
|
|
FILE *in=fopen(gnifinspointfile,"rt"); |
1247 |
|
|
if (in==NULL) cout<<"file is not available"<<endl; |
1248 |
|
|
while (!feof(in)) |
1249 |
|
|
{ |
1250 |
|
|
char chaine[500]; |
1251 |
sattarpa |
655 |
char* res=fgets(chaine,500,in); |
1252 |
|
|
if(res!=NULL) |
1253 |
|
|
{ |
1254 |
sattarpa |
609 |
double x,y,z; |
1255 |
|
|
double q1,q2,q3; |
1256 |
|
|
int nb=sscanf(chaine,"%le %le %le %le %le %le",&x,&y,&z,&q1,&q2,&q3); |
1257 |
|
|
q1=prop*q1; |
1258 |
|
|
q2=prop*q2; |
1259 |
|
|
q3=prop*q3; |
1260 |
|
|
if (nb!=-1 && nb!=6) cout<<"Wrong file format"<<endl; |
1261 |
|
|
else if (nb==6) |
1262 |
|
|
{ |
1263 |
|
|
double* pcoordbc=new double[6]; |
1264 |
|
|
pcoordbc[0]=x; pcoordbc[1]=y; pcoordbc[2]=z; pcoordbc[3]=q1; pcoordbc[4]=q2; pcoordbc[5]=q3; |
1265 |
|
|
lstpinsert.push_back(pcoordbc); |
1266 |
|
|
} |
1267 |
sattarpa |
655 |
} |
1268 |
sattarpa |
609 |
} |
1269 |
|
|
fclose(in); |
1270 |
sattarpa |
650 |
if (relet_curvature<1) |
1271 |
|
|
{ |
1272 |
sattarpa |
609 |
//criterion |
1273 |
sattarpa |
658 |
multimap<double,MG_NOEUD*,std::greater<double> >::reverse_iterator ritlstkmin_diff=lstkmin_diff.rbegin(); |
1274 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::reverse_iterator ritlstkmax_diff=lstkmax_diff.rbegin(); |
1275 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_diff=lstkmin_diff.begin(); |
1276 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_diff=lstkmax_diff.begin(); |
1277 |
|
|
double kmin_diff_min=(*ritlstkmin_diff).first; |
1278 |
|
|
double kmin_diff_max=(*itlstkmin_diff).first; |
1279 |
|
|
double kmax_diff_min=(*ritlstkmax_diff).first; |
1280 |
|
|
double kmax_diff_max=(*itlstkmax_diff).first; |
1281 |
|
|
cout<<"kmin_diff_min= "<<kmin_diff_min<<" kmin_diff_max= "<<kmin_diff_max<<endl; |
1282 |
|
|
cout<<"kmax_diff_min= "<<kmax_diff_min<<" kmax_diff_max= "<<kmax_diff_max<<endl; |
1283 |
|
|
|
1284 |
|
|
double crikmin_min=curvdif_coef*kmin_diff_min; |
1285 |
|
|
double crikmin_max=curvdif_coef*kmin_diff_max; |
1286 |
|
|
double crikmax_min=curvdif_coef*kmax_diff_min; |
1287 |
|
|
double crikmax_max=curvdif_coef*kmax_diff_max; |
1288 |
|
|
cout<<"crikmin_min= "<<crikmin_min<<" crikmin_max= "<<crikmin_max<<" crikmax_min= "<<crikmax_min<<" crikmax_max= "<<crikmax_max<<endl; |
1289 |
sattarpa |
609 |
cout<<"lstkmin_diff.size()= "<<lstkmin_diff.size()<<endl; |
1290 |
|
|
cout<<"lstkmax_diff.size()= "<<lstkmax_diff.size()<<endl; |
1291 |
sattarpa |
650 |
|
1292 |
|
|
cout<<"for Kmin"<<endl; |
1293 |
sattarpa |
609 |
TPL_MAP_ENTITE<MG_NOEUD*> lstneipdefect; |
1294 |
|
|
for (itlstkmin_diff=lstkmin_diff.begin();itlstkmin_diff!=lstkmin_diff.end();itlstkmin_diff++) |
1295 |
|
|
{ |
1296 |
|
|
{ |
1297 |
|
|
if((crikmin_max<(*itlstkmin_diff).first) || (crikmin_min>(*itlstkmin_diff).first)) |
1298 |
|
|
{ |
1299 |
|
|
MG_NOEUD* piefect=(*itlstkmin_diff).second; |
1300 |
|
|
int neindnb=lstneipdefect.get_nb(); |
1301 |
|
|
double search_radius1=search_radius; |
1302 |
|
|
while(neindnb==0) |
1303 |
|
|
{ |
1304 |
sattarpa |
650 |
octreecad.rechercher(piefect->get_x(),piefect->get_y(),piefect->get_z(),search_radius1,lstneipdefect); |
1305 |
sattarpa |
609 |
neindnb=lstneipdefect.get_nb(); |
1306 |
|
|
search_radius1=search_radius1+0.1*search_radius; |
1307 |
|
|
} |
1308 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itndnei; |
1309 |
|
|
for(MG_NOEUD* ndnei=lstneipdefect.get_premier(itndnei);ndnei!=NULL;ndnei=lstneipdefect.get_suivant(itndnei)) |
1310 |
|
|
{ |
1311 |
|
|
for(std::vector<double*>::iterator itlstpinsert=lstpinsert.begin();itlstpinsert!=lstpinsert.end();itlstpinsert++) |
1312 |
|
|
{ |
1313 |
|
|
double* xyzpins; |
1314 |
|
|
xyzpins=(*itlstpinsert); |
1315 |
sattarpa |
650 |
if(ndnei->get_x()==xyzpins[0] && ndnei->get_y()==xyzpins[1] && ndnei->get_z()==xyzpins[2]) |
1316 |
|
|
lstpinsert.erase(itlstpinsert); |
1317 |
sattarpa |
609 |
} |
1318 |
|
|
} |
1319 |
|
|
lstneipdefect.vide(); |
1320 |
|
|
} |
1321 |
|
|
} |
1322 |
|
|
} |
1323 |
|
|
cout<<"for Kmax"<<endl; |
1324 |
|
|
for (itlstkmax_diff=lstkmax_diff.begin();itlstkmax_diff!=lstkmax_diff.end();itlstkmax_diff++) |
1325 |
|
|
{ |
1326 |
|
|
if((crikmax_max<(*itlstkmax_diff).first) || (crikmax_min>(*itlstkmax_diff).first)) |
1327 |
|
|
{ |
1328 |
|
|
MG_NOEUD* piefect=(*itlstkmax_diff).second; |
1329 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> lstneipdefect; |
1330 |
|
|
int neindnb=lstneipdefect.get_nb(); |
1331 |
|
|
double search_radius1=search_radius; |
1332 |
|
|
while(neindnb==0) |
1333 |
|
|
{ |
1334 |
sattarpa |
650 |
octreecad.rechercher(piefect->get_x(),piefect->get_y(),piefect->get_z(),search_radius1,lstneipdefect); |
1335 |
sattarpa |
609 |
neindnb=lstneipdefect.get_nb(); |
1336 |
|
|
search_radius1=search_radius1+0.1*search_radius; |
1337 |
|
|
} |
1338 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itndnei; |
1339 |
|
|
for(MG_NOEUD* ndnei=lstneipdefect.get_premier(itndnei);ndnei!=NULL;ndnei=lstneipdefect.get_suivant(itndnei)) |
1340 |
|
|
{ |
1341 |
|
|
for(std::vector<double*>::iterator itlstpinsert=lstpinsert.begin();itlstpinsert!=lstpinsert.end();itlstpinsert++) |
1342 |
|
|
{ |
1343 |
|
|
double* xyzpins; |
1344 |
|
|
xyzpins=(*itlstpinsert); |
1345 |
|
|
if(ndnei->get_x()==xyzpins[0] && ndnei->get_y()==xyzpins[1] && ndnei->get_z()==xyzpins[2]) |
1346 |
|
|
lstpinsert.erase(itlstpinsert); |
1347 |
|
|
} |
1348 |
|
|
} |
1349 |
|
|
|
1350 |
|
|
} |
1351 |
|
|
} |
1352 |
sattarpa |
650 |
} |
1353 |
|
|
if (relet_curvature>0) |
1354 |
|
|
{ |
1355 |
|
|
//criterion |
1356 |
sattarpa |
658 |
multimap<double,MG_NOEUD*,std::greater<double> >::reverse_iterator ritlstkmin_relt_diff=lstkmin_relt_diff.rbegin(); |
1357 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::reverse_iterator ritlstkmax_relt_diff=lstkmax_relt_diff.rbegin(); |
1358 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmin_relt_diff=lstkmin_relt_diff.begin(); |
1359 |
|
|
multimap<double,MG_NOEUD*,std::greater<double> >::iterator itlstkmax_relt_diff=lstkmax_relt_diff.begin(); |
1360 |
|
|
double kmin_relt_diff_min=(*ritlstkmin_relt_diff).first; |
1361 |
|
|
double kmin_relt_diff_max=(*itlstkmin_relt_diff).first; |
1362 |
|
|
double kmax_relt_diff_min=(*ritlstkmax_relt_diff).first; |
1363 |
|
|
double kmax_relt_diff_max=(*itlstkmax_relt_diff).first; |
1364 |
|
|
cout<<"kmin_relt_diff_min= "<<kmin_relt_diff_min<<" kmin_relt_diff_max= "<<kmin_relt_diff_max<<endl; |
1365 |
|
|
cout<<"kmax_relt_diff_min= "<<kmax_relt_diff_min<<" kmax_relt_diff_max= "<<kmax_relt_diff_max<<endl; |
1366 |
sattarpa |
673 |
/* |
1367 |
sattarpa |
658 |
double crikmin_min=curvdif_coef*kmin_relt_diff_min; |
1368 |
|
|
double crikmin_max=curvdif_coef*kmin_relt_diff_max; |
1369 |
|
|
double crikmax_min=curvdif_coef*kmax_relt_diff_min; |
1370 |
sattarpa |
673 |
double crikmax_max=curvdif_coef*kmax_relt_diff_max;*/ |
1371 |
|
|
double crikmin_min=-curvdif_coef; |
1372 |
|
|
double crikmin_max=curvdif_coef; |
1373 |
|
|
double crikmax_min=-curvdif_coef; |
1374 |
|
|
double crikmax_max=curvdif_coef; |
1375 |
|
|
|
1376 |
sattarpa |
658 |
cout<<"crikmin_min= "<<crikmin_min<<" crikmin_max= "<<crikmin_max<<" crikmax_min= "<<crikmax_min<<" crikmax_max= "<<crikmax_max<<endl; |
1377 |
sattarpa |
650 |
cout<<"lstkmin_diff.size()= "<<lstkmin_diff.size()<<endl; |
1378 |
|
|
cout<<"lstkmax_diff.size()= "<<lstkmax_diff.size()<<endl; |
1379 |
|
|
|
1380 |
sattarpa |
658 |
cout<<"for Kmin_relet_diff"<<endl; |
1381 |
|
|
cout<<"lstkmin_relt_diff.size()= "<<lstkmin_relt_diff.size()<<endl; |
1382 |
sattarpa |
650 |
TPL_MAP_ENTITE<MG_NOEUD*> lstneipdefect; |
1383 |
|
|
for (itlstkmin_relt_diff=lstkmin_relt_diff.begin();itlstkmin_relt_diff!=lstkmin_relt_diff.end();itlstkmin_relt_diff++) |
1384 |
|
|
{ |
1385 |
|
|
{ |
1386 |
|
|
if((crikmin_max<(*itlstkmin_relt_diff).first) || (crikmin_min>(*itlstkmin_relt_diff).first)) |
1387 |
|
|
{ |
1388 |
|
|
MG_NOEUD* piefect=(*itlstkmin_relt_diff).second; |
1389 |
|
|
int neindnb=lstneipdefect.get_nb(); |
1390 |
|
|
double search_radius1=search_radius; |
1391 |
|
|
while(neindnb==0) |
1392 |
|
|
{ |
1393 |
|
|
octreecad.rechercher(piefect->get_x(),piefect->get_y(),piefect->get_z(),search_radius1,lstneipdefect); |
1394 |
|
|
neindnb=lstneipdefect.get_nb(); |
1395 |
|
|
search_radius1=search_radius1+0.1*search_radius; |
1396 |
|
|
} |
1397 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itndnei; |
1398 |
|
|
for(MG_NOEUD* ndnei=lstneipdefect.get_premier(itndnei);ndnei!=NULL;ndnei=lstneipdefect.get_suivant(itndnei)) |
1399 |
|
|
{ |
1400 |
|
|
for(std::vector<double*>::iterator itlstpinsert=lstpinsert.begin();itlstpinsert!=lstpinsert.end();itlstpinsert++) |
1401 |
|
|
{ |
1402 |
|
|
double* xyzpins; |
1403 |
|
|
xyzpins=(*itlstpinsert); |
1404 |
sattarpa |
658 |
|
1405 |
sattarpa |
650 |
if(ndnei->get_x()==xyzpins[0] && ndnei->get_y()==xyzpins[1] && ndnei->get_z()==xyzpins[2]) |
1406 |
sattarpa |
658 |
{ |
1407 |
sattarpa |
650 |
lstpinsert.erase(itlstpinsert); |
1408 |
sattarpa |
658 |
itlstpinsert=lstpinsert.begin(); |
1409 |
|
|
} |
1410 |
|
|
|
1411 |
sattarpa |
650 |
} |
1412 |
|
|
} |
1413 |
|
|
lstneipdefect.vide(); |
1414 |
|
|
} |
1415 |
|
|
} |
1416 |
|
|
} |
1417 |
sattarpa |
658 |
cout<<"for Kmax_relet_diff"<<endl; |
1418 |
|
|
|
1419 |
sattarpa |
650 |
for (itlstkmax_relt_diff=lstkmax_relt_diff.begin();itlstkmax_relt_diff!=lstkmax_relt_diff.end();itlstkmax_relt_diff++) |
1420 |
|
|
{ |
1421 |
|
|
if((crikmax_max<(*itlstkmax_relt_diff).first) || (crikmax_min>(*itlstkmax_relt_diff).first)) |
1422 |
|
|
{ |
1423 |
|
|
MG_NOEUD* piefect=(*itlstkmax_relt_diff).second; |
1424 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> lstneipdefect; |
1425 |
|
|
int neindnb=lstneipdefect.get_nb(); |
1426 |
|
|
double search_radius1=search_radius; |
1427 |
|
|
while(neindnb==0) |
1428 |
|
|
{ |
1429 |
|
|
octreecad.rechercher(piefect->get_x(),piefect->get_y(),piefect->get_z(),search_radius1,lstneipdefect); |
1430 |
|
|
neindnb=lstneipdefect.get_nb(); |
1431 |
|
|
search_radius1=search_radius1+0.1*search_radius; |
1432 |
|
|
} |
1433 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itndnei; |
1434 |
|
|
for(MG_NOEUD* ndnei=lstneipdefect.get_premier(itndnei);ndnei!=NULL;ndnei=lstneipdefect.get_suivant(itndnei)) |
1435 |
|
|
{ |
1436 |
|
|
for(std::vector<double*>::iterator itlstpinsert=lstpinsert.begin();itlstpinsert!=lstpinsert.end();itlstpinsert++) |
1437 |
|
|
{ |
1438 |
|
|
double* xyzpins; |
1439 |
|
|
xyzpins=(*itlstpinsert); |
1440 |
|
|
if(ndnei->get_x()==xyzpins[0] && ndnei->get_y()==xyzpins[1] && ndnei->get_z()==xyzpins[2]) |
1441 |
sattarpa |
658 |
{ |
1442 |
|
|
lstpinsert.erase(itlstpinsert); |
1443 |
|
|
itlstpinsert=lstpinsert.begin(); |
1444 |
|
|
} |
1445 |
sattarpa |
650 |
} |
1446 |
|
|
} |
1447 |
|
|
|
1448 |
|
|
} |
1449 |
|
|
} |
1450 |
|
|
} |
1451 |
sattarpa |
609 |
FILE* in2=fopen(out_gnifinspointfile_removondefect,"wt"); |
1452 |
sattarpa |
655 |
int countfuck=0; |
1453 |
sattarpa |
609 |
for(std::vector<double*>::iterator itlstpinsert=lstpinsert.begin();itlstpinsert!=lstpinsert.end();itlstpinsert++) |
1454 |
|
|
{ |
1455 |
|
|
double* xyzpins1; |
1456 |
|
|
xyzpins1=(*itlstpinsert); |
1457 |
sattarpa |
658 |
fprintf(in2,"%le %le %le %le %le %le\n",xyzpins1[0],xyzpins1[1],xyzpins1[2],xyzpins1[3]*1000.,xyzpins1[4]*1000.,xyzpins1[5]*1000.); |
1458 |
sattarpa |
609 |
} |
1459 |
sattarpa |
650 |
fclose(in2); |
1460 |
sattarpa |
609 |
} |
1461 |
|
|
void CRIAQOPERATORS::vm_crit_remvsmp(int femmeshno,char* magicfilename,int femsolid,int femsubsolno,char* gnifinspointfile,char* out_gnifinspointfile_removondefect,double search_radius,double vm_coef) |
1462 |
|
|
{ |
1463 |
sattarpa |
554 |
MG_FILE gest(magicfilename); |
1464 |
sattarpa |
596 |
FEM_MAILLAGE* femmai; |
1465 |
|
|
if (femmeshno==0) femmai=gest.get_fem_maillage(femmeshno); else femmai=gest.get_fem_maillageid(femmeshno); |
1466 |
|
|
FEM_SOLUTION* femsol=gest.get_fem_solutionid(femsolid); |
1467 |
|
|
femsol->active_solution(femsubsolno); |
1468 |
|
|
|
1469 |
|
|
std::map<double,FEM_NOEUD*,std::greater<double> > mpsol; |
1470 |
|
|
LISTE_FEM_NOEUD::iterator itfemnds; |
1471 |
|
|
for(FEM_NOEUD* nod=femmai->get_premier_noeud(itfemnds);nod!=NULL;nod=femmai->get_suivant_noeud(itfemnds)) |
1472 |
|
|
{ |
1473 |
sattarpa |
609 |
nod->get_mg_element_maillage()->get_id(); |
1474 |
sattarpa |
596 |
mpsol.insert(pair<double,FEM_NOEUD*> (nod->get_solution(),nod)); |
1475 |
|
|
//cout<<"nod->get_solution()= "<<nod->get_solution()<<endl; |
1476 |
|
|
//if(nod->get_solution()<=1.e-20 && nod->get_solution()!=0.) |
1477 |
|
|
//cout<<nod->get_id()<<" : "<<nod->get_solution()<<endl; |
1478 |
|
|
} |
1479 |
|
|
std::map<double,FEM_NOEUD*,std::greater<double> >::iterator itmpsol=mpsol.begin(); |
1480 |
|
|
|
1481 |
|
|
double maxi=(*itmpsol).first; |
1482 |
|
|
itmpsol=mpsol.end(); |
1483 |
|
|
double mini=(*itmpsol).first; |
1484 |
sattarpa |
673 |
//double crit=vm_coef*(maxi+mini)/2.; |
1485 |
|
|
double crit=vm_coef; |
1486 |
|
|
cout<<"critreion value= "<<crit<<endl; |
1487 |
sattarpa |
596 |
std::vector<double*> lstpinsert; |
1488 |
|
|
double prop=0.001; |
1489 |
|
|
FILE *in=fopen(gnifinspointfile,"rt"); |
1490 |
|
|
if (in==NULL) cout<<"file is not available"<<endl; |
1491 |
|
|
while (!feof(in)) |
1492 |
|
|
{ |
1493 |
|
|
char chaine[500]; |
1494 |
sattarpa |
655 |
char* res=fgets(chaine,500,in); |
1495 |
|
|
if(res!=NULL) |
1496 |
|
|
{ |
1497 |
sattarpa |
596 |
double x,y,z; |
1498 |
|
|
double q1,q2,q3; |
1499 |
|
|
int nb=sscanf(chaine,"%le %le %le %le %le %le",&x,&y,&z,&q1,&q2,&q3); |
1500 |
|
|
q1=prop*q1; |
1501 |
|
|
q2=prop*q2; |
1502 |
|
|
q3=prop*q3; |
1503 |
|
|
if (nb!=-1 && nb!=6) cout<<"Wrong file format"<<endl; |
1504 |
|
|
else if (nb==6) |
1505 |
|
|
{ |
1506 |
|
|
double* pcoordbc=new double[6]; |
1507 |
|
|
pcoordbc[0]=x; pcoordbc[1]=y; pcoordbc[2]=z; pcoordbc[3]=q1; pcoordbc[4]=q2; pcoordbc[5]=q3; |
1508 |
|
|
lstpinsert.push_back(pcoordbc); |
1509 |
|
|
} |
1510 |
sattarpa |
655 |
} |
1511 |
sattarpa |
596 |
} |
1512 |
|
|
fclose(in); |
1513 |
|
|
|
1514 |
|
|
|
1515 |
|
|
//octree initialization |
1516 |
|
|
double xmin=1e308,ymin=1e308,zmin=1e308,xmax=-1e308,ymax=-1e308,zmax=-1e308; |
1517 |
|
|
TPL_MAP_ENTITE<FEM_NOEUD*> lstnoeud; |
1518 |
|
|
LISTE_FEM_NOEUD::iterator it; |
1519 |
|
|
for (FEM_NOEUD* no=femmai->get_premier_noeud(it);no!=NULL;no=femmai->get_suivant_noeud(it)) |
1520 |
|
|
{ |
1521 |
|
|
if (no->get_x()<xmin) xmin=no->get_x(); |
1522 |
|
|
if (no->get_y()<ymin) ymin=no->get_y(); |
1523 |
|
|
if (no->get_z()<zmin) zmin=no->get_z(); |
1524 |
|
|
if (no->get_x()>xmax) xmax=no->get_x(); |
1525 |
|
|
if (no->get_y()>ymax) ymax=no->get_y(); |
1526 |
|
|
if (no->get_z()>zmax) zmax=no->get_z(); |
1527 |
|
|
lstnoeud.ajouter(no); |
1528 |
|
|
} |
1529 |
|
|
OT_VECTEUR_3D vecmin(xmin,ymin,zmin);OT_VECTEUR_3D vecmmax(xmax,ymax,zmax); |
1530 |
|
|
OT_VECTEUR_3D vec(vecmmax,vecmin); |
1531 |
|
|
|
1532 |
|
|
//double search_radius=0.001*(vec.get_longueur()); |
1533 |
sattarpa |
609 |
//double search_radius=2.; //sasan this should be as a parameter |
1534 |
sattarpa |
596 |
OT_VECTEUR_3D min(xmin,ymin,zmin); OT_VECTEUR_3D max(xmax,ymax,zmax); OT_VECTEUR_3D average=(min+max)/2.; OT_VECTEUR_3D lengthvec(min,max); |
1535 |
|
|
double length=sqrt(lengthvec*lengthvec); double bxr=1.1; |
1536 |
|
|
xmin=average.get_x()-(length*bxr);ymin=average.get_y()-(length*bxr);zmin=average.get_z()-(length*bxr); |
1537 |
|
|
xmax=average.get_x()+(length*bxr);ymax=average.get_y()+(length*bxr);zmax=average.get_z()+(length*bxr); |
1538 |
|
|
|
1539 |
|
|
TPL_OCTREE<FEM_NOEUD*,FEM_NOEUD*> octree; |
1540 |
|
|
octree.initialiser(&lstnoeud,1,xmin,ymin,zmin,xmax,ymax,zmax); |
1541 |
|
|
for (FEM_NOEUD* no=femmai->get_premier_noeud(it);no!=NULL;no=femmai->get_suivant_noeud(it)) |
1542 |
|
|
octree.inserer(no); |
1543 |
|
|
|
1544 |
|
|
for (itmpsol=mpsol.begin();itmpsol!=mpsol.end();itmpsol++) |
1545 |
|
|
{ |
1546 |
|
|
if(crit<(*itmpsol).first) |
1547 |
|
|
{ |
1548 |
|
|
FEM_NOEUD* pdefect=(*itmpsol).second; |
1549 |
|
|
TPL_MAP_ENTITE<FEM_NOEUD*> lstneipdefect; |
1550 |
|
|
int neindnb=lstneipdefect.get_nb(); |
1551 |
sattarpa |
609 |
double search_radius1=search_radius; |
1552 |
sattarpa |
596 |
while(neindnb==0) |
1553 |
|
|
{ |
1554 |
sattarpa |
609 |
octree.rechercher(pdefect->get_x(),pdefect->get_y(),pdefect->get_z(),search_radius1,lstneipdefect); |
1555 |
sattarpa |
596 |
neindnb=lstneipdefect.get_nb(); |
1556 |
sattarpa |
609 |
search_radius1=search_radius1+0.1*search_radius; |
1557 |
sattarpa |
596 |
} |
1558 |
|
|
TPL_MAP_ENTITE<FEM_NOEUD*>::ITERATEUR itfendnei; |
1559 |
|
|
for(FEM_NOEUD* fendnei=lstneipdefect.get_premier(itfendnei);fendnei!=NULL;fendnei=lstneipdefect.get_suivant(itfendnei)) |
1560 |
|
|
{ |
1561 |
|
|
// std::map<double*,double*,std::less<double*> >::iterator itlstpinsert=lstpinsert.begin();//itlstpinsert!=lstpinsert.end();itlstpinsert++ |
1562 |
|
|
for(std::vector<double*>::iterator itlstpinsert=lstpinsert.begin();itlstpinsert!=lstpinsert.end();itlstpinsert++) |
1563 |
|
|
{ |
1564 |
|
|
double* xyzpins; |
1565 |
|
|
xyzpins=(*itlstpinsert); |
1566 |
|
|
if(fendnei->get_x()==xyzpins[0] && fendnei->get_y()==xyzpins[1] && fendnei->get_z()==xyzpins[2]) |
1567 |
|
|
{ |
1568 |
|
|
lstpinsert.erase(itlstpinsert); |
1569 |
sattarpa |
658 |
itlstpinsert=lstpinsert.begin(); |
1570 |
sattarpa |
596 |
} |
1571 |
|
|
} |
1572 |
|
|
} |
1573 |
|
|
|
1574 |
|
|
} |
1575 |
|
|
|
1576 |
|
|
} |
1577 |
|
|
|
1578 |
|
|
FILE* in1=fopen(out_gnifinspointfile_removondefect,"wt"); |
1579 |
|
|
for(std::vector<double*>::iterator itlstpinsert=lstpinsert.begin();itlstpinsert!=lstpinsert.end();itlstpinsert++) |
1580 |
|
|
{ |
1581 |
|
|
double* xyzpins1; |
1582 |
|
|
xyzpins1=(*itlstpinsert); |
1583 |
sattarpa |
658 |
fprintf(in1,"%le %le %le %le %le %le\n",xyzpins1[0],xyzpins1[1],xyzpins1[2],xyzpins1[3]*1000.,xyzpins1[4]*1000.,xyzpins1[5]*1000.); |
1584 |
sattarpa |
596 |
} |
1585 |
|
|
fclose(in1); |
1586 |
|
|
} |
1587 |
|
|
void CRIAQOPERATORS::surfmaker_e1(char* outputfilename,int meshno,char* magicfilename) |
1588 |
|
|
{ |
1589 |
|
|
MG_FILE gest(magicfilename); |
1590 |
sattarpa |
554 |
MG_GEOMETRIE* geo=gest.get_mg_geometrie(0); |
1591 |
|
|
MG_MAILLAGE* mai; |
1592 |
|
|
if (meshno==0) mai=gest.get_mg_maillage(meshno); else mai=gest.get_mg_maillageid(meshno); |
1593 |
|
|
//MG_FILE gest((char*)"longflxprtwithpockets_3d_3mm.magic"); |
1594 |
|
|
//MG_GEOMETRIE* geo=gest.get_mg_geometrieid(1); |
1595 |
|
|
//MG_MAILLAGE* mai=gest.get_mg_maillageid(5674824); |
1596 |
|
|
MG_GESTIONNAIRE* gestnew=new MG_GESTIONNAIRE(); |
1597 |
|
|
MG_GEOMETRIE* geonew=mai->get_mg_geometrie(); |
1598 |
|
|
gestnew->ajouter_mg_geometrie(geonew); |
1599 |
|
|
MG_MAILLAGE* mainew=new MG_MAILLAGE(geonew); |
1600 |
|
|
gestnew->ajouter_mg_maillage(mainew); |
1601 |
|
|
|
1602 |
|
|
LISTE_MG_NOEUD::iterator itnod; |
1603 |
|
|
for (MG_NOEUD* vertices=mai->get_premier_noeud(itnod);vertices!=NULL;vertices=mai->get_suivant_noeud(itnod)) |
1604 |
|
|
{ |
1605 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topnd=vertices->get_lien_topologie(); |
1606 |
|
|
MG_FACE* facevert=(MG_FACE*) (vertices->get_lien_topologie()); |
1607 |
|
|
MG_ARETE* aretver=(MG_ARETE*) (vertices->get_lien_topologie()); |
1608 |
|
|
MG_SOMMET* sometver=(MG_SOMMET*) (vertices->get_lien_topologie()); |
1609 |
sattarpa |
596 |
|
1610 |
|
|
if(facevert->get_id()==76 |
1611 |
|
|
|| aretver->get_id()==84 || aretver->get_id()==103|| aretver->get_id()==91|| aretver->get_id()==13 || aretver->get_id()==110||aretver->get_id()==98 |
1612 |
|
|
|| aretver->get_id()==81 || aretver->get_id()==83 || aretver->get_id()==10|| aretver->get_id()==12|| aretver->get_id()==90|| aretver->get_id()==97 |
1613 |
|
|
/* facevert->get_id()==133 |
1614 |
sattarpa |
554 |
|| aretver->get_id()==355 || aretver->get_id()==362|| aretver->get_id()==374|| aretver->get_id()==298 || aretver->get_id()==291||aretver->get_id()==338 |
1615 |
|
|
|| aretver->get_id()==326 || aretver->get_id()==333|| aretver->get_id()==319|| aretver->get_id()==312 || aretver->get_id()==305||aretver->get_id()==169 |
1616 |
|
|
|| aretver->get_id()==162 || aretver->get_id()==141|| aretver->get_id()==174|| aretver->get_id()==148 || aretver->get_id()==155||aretver->get_id()==217 |
1617 |
|
|
|| aretver->get_id()==212 || aretver->get_id()==191|| aretver->get_id()==184|| aretver->get_id()==64 || aretver->get_id()==280||aretver->get_id()==32 |
1618 |
|
|
|| aretver->get_id()==387 || aretver->get_id()==198|| aretver->get_id()==205|| aretver->get_id()==269 || aretver->get_id()==262||aretver->get_id()==234 |
1619 |
|
|
|| aretver->get_id()==227 || aretver->get_id()==255|| aretver->get_id()==248|| aretver->get_id()==241 || aretver->get_id()==380||aretver->get_id()==96 |
1620 |
|
|
|| aretver->get_id()==369 || aretver->get_id()==344|| aretver->get_id()==128|| aretver->get_id()==274 |
1621 |
|
|
|| sometver->get_id()==368|| sometver->get_id()==361|| sometver->get_id()==106|| sometver->get_id()==122|| sometver->get_id()==74|| sometver->get_id()==90 |
1622 |
|
|
|| sometver->get_id()==233|| sometver->get_id()==240|| sometver->get_id()==247|| sometver->get_id()==254|| sometver->get_id()==261|| sometver->get_id()==268 |
1623 |
|
|
|| sometver->get_id()==226|| sometver->get_id()==224|| sometver->get_id()==190|| sometver->get_id()==197|| sometver->get_id()==204|| sometver->get_id()==211 |
1624 |
|
|
|| sometver->get_id()==183|| sometver->get_id()==181|| sometver->get_id()==154|| sometver->get_id()==147|| sometver->get_id()==140|| sometver->get_id()==161 |
1625 |
|
|
|| sometver->get_id()==168|| sometver->get_id()==138|| sometver->get_id()==318|| sometver->get_id()==311|| sometver->get_id()==304|| sometver->get_id()==297 |
1626 |
|
|
|| sometver->get_id()==325|| sometver->get_id()==332|| sometver->get_id()==290|| sometver->get_id()==288|| sometver->get_id()==42|| sometver->get_id()==58 |
1627 |
sattarpa |
596 |
|| sometver->get_id()==352|| sometver->get_id()==354|| sometver->get_id()==10|| sometver->get_id()==26*/ |
1628 |
|
|
|
1629 |
|
|
) |
1630 |
sattarpa |
554 |
{ |
1631 |
|
|
double x=vertices->get_x(); |
1632 |
|
|
double y=vertices->get_y(); |
1633 |
|
|
double z=vertices->get_z(); |
1634 |
|
|
//MG_NOEUD *newno=new MG_NOEUD(NULL,x,y,z,vertices->get_origine()); |
1635 |
|
|
MG_NOEUD *newno=new MG_NOEUD(vertices->get_lien_topologie(),x,y,z,vertices->get_origine()); |
1636 |
|
|
mainew->ajouter_mg_noeud(newno); |
1637 |
|
|
vertices->change_nouveau_numero(newno->get_id()); // what does this do? |
1638 |
|
|
} |
1639 |
|
|
} |
1640 |
|
|
|
1641 |
|
|
LISTE_MG_SEGMENT::iterator itSeg; |
1642 |
|
|
for (MG_SEGMENT * segment =mai->get_premier_segment(itSeg); segment; segment=mai->get_suivant_segment(itSeg)) |
1643 |
|
|
{ |
1644 |
|
|
//%275=NOEUD($10,93.94800850483597,-250.0000000000000,0.000000000000000,1010); |
1645 |
|
|
//NOEUD linked with a topology (get_lien_topologie => $10 ) -> and %10=SOMMET(1,$9,0); %9=POINT_OCC(1); |
1646 |
|
|
//%390=SEGMENT($13,$275,$277,1010); => %13=ARETE(3,$8,$14,$15,1,0); %275=NOEUD($10,93.94800850483597,-250.0000000000000,0.000000000000000,1010); %277=NOEUD($13,89.09047601136933,-249.4243468871926,0.000000000000000,1010); |
1647 |
|
|
MG_FACE* faceseg=(MG_FACE*) (segment->get_lien_topologie()); |
1648 |
|
|
MG_ARETE* aretver=(MG_ARETE*) (segment->get_lien_topologie()); |
1649 |
sattarpa |
596 |
if (faceseg->get_id()==76 |
1650 |
|
|
|| aretver->get_id()==84 || aretver->get_id()==103|| aretver->get_id()==91|| aretver->get_id()==13 || aretver->get_id()==110||aretver->get_id()==98 |
1651 |
|
|
//faceseg->get_id()==133 |
1652 |
|
|
//|| aretver->get_id()==355 || aretver->get_id()==362|| aretver->get_id()==374|| aretver->get_id()==298 || aretver->get_id()==291||aretver->get_id()==338 |
1653 |
|
|
//|| aretver->get_id()==326 || aretver->get_id()==333|| aretver->get_id()==319|| aretver->get_id()==312 || aretver->get_id()==305||aretver->get_id()==169 |
1654 |
|
|
//|| aretver->get_id()==162 || aretver->get_id()==141|| aretver->get_id()==174|| aretver->get_id()==148 || aretver->get_id()==155||aretver->get_id()==217 |
1655 |
|
|
//|| aretver->get_id()==212 || aretver->get_id()==191|| aretver->get_id()==184|| aretver->get_id()==64 || aretver->get_id()==280||aretver->get_id()==32 |
1656 |
|
|
//|| aretver->get_id()==387 || aretver->get_id()==198|| aretver->get_id()==205|| aretver->get_id()==269 || aretver->get_id()==262||aretver->get_id()==234 |
1657 |
|
|
// || aretver->get_id()==227 || aretver->get_id()==255|| aretver->get_id()==248|| aretver->get_id()==241 || aretver->get_id()==380||aretver->get_id()==96 |
1658 |
|
|
// || aretver->get_id()==369 || aretver->get_id()==344|| aretver->get_id()==128|| aretver->get_id()==274 |
1659 |
|
|
|
1660 |
|
|
) |
1661 |
sattarpa |
554 |
{ |
1662 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(segment->get_noeud1()->get_nouveau_numero()); |
1663 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(segment->get_noeud2()->get_nouveau_numero()); |
1664 |
|
|
MG_SEGMENT *seg=new MG_SEGMENT(segment->get_lien_topologie(),no1,no2,segment->get_origine()); |
1665 |
|
|
//MG_SEGMENT *seg=new MG_SEGMENT(NULL,no1,no2,segment->get_origine()); |
1666 |
|
|
mainew->ajouter_mg_segment(seg); |
1667 |
|
|
} |
1668 |
|
|
} |
1669 |
|
|
|
1670 |
|
|
LISTE_MG_TRIANGLE::iterator itTri; |
1671 |
|
|
for (MG_TRIANGLE * triangle =mai->get_premier_triangle(itTri); triangle; triangle=mai->get_suivant_triangle(itTri)) |
1672 |
|
|
{ |
1673 |
|
|
MG_FACE* facetri=(MG_FACE*) (triangle->get_lien_topologie()); |
1674 |
sattarpa |
596 |
if (facetri->get_id()==76) |
1675 |
sattarpa |
554 |
{ |
1676 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(triangle->get_noeud1()->get_nouveau_numero()); |
1677 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(triangle->get_noeud2()->get_nouveau_numero()); |
1678 |
|
|
MG_NOEUD* no3=mainew->get_mg_noeudid(triangle->get_noeud3()->get_nouveau_numero()); |
1679 |
|
|
mainew->ajouter_mg_triangle(triangle->get_lien_topologie(),no1,no2,no3,triangle->get_origine()); |
1680 |
|
|
} |
1681 |
|
|
} |
1682 |
|
|
|
1683 |
|
|
//gestnew->enregistrer("scnsurf_longflxprtwithpockets_3d_3mm_8mmdef_0bump.magic"); |
1684 |
|
|
gestnew->enregistrer(outputfilename); |
1685 |
|
|
////////////////// |
1686 |
|
|
|
1687 |
|
|
//////////////////////// |
1688 |
|
|
|
1689 |
|
|
|
1690 |
|
|
/* |
1691 |
|
|
mainew->supprimer_mg_triangleid(106625); |
1692 |
|
|
mainew->supprimer_mg_triangleid(106662); |
1693 |
|
|
mainew->supprimer_mg_triangleid(106626); |
1694 |
|
|
mainew->supprimer_mg_triangleid(106701); |
1695 |
|
|
mainew->supprimer_mg_triangleid(106702); |
1696 |
|
|
mainew->supprimer_mg_triangleid(106639);*/ |
1697 |
|
|
//cout<<"output mesh no.= 495557 "<<endl; |
1698 |
|
|
//gest.enregistrer("2dsurfmesh_cad.magic"); //CAD model output |
1699 |
|
|
//scanned part output |
1700 |
|
|
|
1701 |
|
|
|
1702 |
|
|
} |
1703 |
sattarpa |
596 |
void CRIAQOPERATORS::surfmaker_e2(char* outputfilename,int meshno,char* magicfilename) |
1704 |
sattarpa |
554 |
{ |
1705 |
|
|
// surfmeshgenerator a partially scanned (deformed CAD model) for GNIF examples for simple exam with hole (badisplacenmentvector + smplwithpocket) |
1706 |
|
|
MG_FILE gest(magicfilename); |
1707 |
|
|
MG_GEOMETRIE* geo=gest.get_mg_geometrie(0); |
1708 |
|
|
MG_MAILLAGE* mai; |
1709 |
|
|
if (meshno==0) mai=gest.get_mg_maillage(meshno); else mai=gest.get_mg_maillageid(meshno); |
1710 |
|
|
//MG_FILE gest((char*)"2d_smplwithole_23mm.magic"); |
1711 |
|
|
//MG_GEOMETRIE* geo=gest.get_mg_geometrieid(1); |
1712 |
|
|
//MG_MAILLAGE* mai=gest.get_mg_maillageid(1197); |
1713 |
|
|
MG_GESTIONNAIRE* gestnew=new MG_GESTIONNAIRE(); |
1714 |
|
|
MG_GEOMETRIE* geonew=mai->get_mg_geometrie(); |
1715 |
|
|
gestnew->ajouter_mg_geometrie(geonew); |
1716 |
|
|
MG_MAILLAGE* mainew=new MG_MAILLAGE(geonew); |
1717 |
|
|
gestnew->ajouter_mg_maillage(mainew); |
1718 |
|
|
|
1719 |
|
|
LISTE_MG_NOEUD::iterator itnod; |
1720 |
|
|
for (MG_NOEUD* vertices=mai->get_premier_noeud(itnod);vertices!=NULL;vertices=mai->get_suivant_noeud(itnod)) |
1721 |
|
|
{ |
1722 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topnd=vertices->get_lien_topologie(); |
1723 |
|
|
MG_FACE* facevert=(MG_FACE*) (vertices->get_lien_topologie()); |
1724 |
|
|
MG_ARETE* aretver=(MG_ARETE*) (vertices->get_lien_topologie()); |
1725 |
|
|
MG_SOMMET* sometver=(MG_SOMMET*) (vertices->get_lien_topologie()); |
1726 |
|
|
if(facevert->get_id()==76 |
1727 |
|
|
|| aretver->get_id()==84 || aretver->get_id()==103|| aretver->get_id()==91|| aretver->get_id()==98 || aretver->get_id()==13||aretver->get_id()==110 |
1728 |
|
|
|| sometver->get_id()==10|| sometver->get_id()==12|| sometver->get_id()==81|| sometver->get_id()==83|| sometver->get_id()==90|| sometver->get_id()==97) |
1729 |
|
|
{ |
1730 |
|
|
double x=vertices->get_x(); |
1731 |
|
|
double y=vertices->get_y(); |
1732 |
|
|
double z=vertices->get_z(); |
1733 |
|
|
//MG_NOEUD *newno=new MG_NOEUD(NULL,x,y,z,vertices->get_origine()); |
1734 |
|
|
MG_NOEUD *newno=new MG_NOEUD(vertices->get_lien_topologie(),x,y,z,vertices->get_origine()); |
1735 |
|
|
mainew->ajouter_mg_noeud(newno); |
1736 |
|
|
vertices->change_nouveau_numero(newno->get_id()); // what does this do? |
1737 |
|
|
} |
1738 |
|
|
} |
1739 |
|
|
|
1740 |
|
|
LISTE_MG_SEGMENT::iterator itSeg; |
1741 |
|
|
for (MG_SEGMENT * segment =mai->get_premier_segment(itSeg); segment; segment=mai->get_suivant_segment(itSeg)) |
1742 |
|
|
{ |
1743 |
|
|
//%275=NOEUD($10,93.94800850483597,-250.0000000000000,0.000000000000000,1010); |
1744 |
|
|
//NOEUD linked with a topology (get_lien_topologie => $10 ) -> and %10=SOMMET(1,$9,0); %9=POINT_OCC(1); |
1745 |
|
|
//%390=SEGMENT($13,$275,$277,1010); => %13=ARETE(3,$8,$14,$15,1,0); %275=NOEUD($10,93.94800850483597,-250.0000000000000,0.000000000000000,1010); %277=NOEUD($13,89.09047601136933,-249.4243468871926,0.000000000000000,1010); |
1746 |
|
|
MG_FACE* faceseg=(MG_FACE*) (segment->get_lien_topologie()); |
1747 |
|
|
//cout<<"faceseg->get_id()= "<<faceseg->get_id()<<endl; |
1748 |
|
|
MG_ARETE* aretver=(MG_ARETE*) (segment->get_lien_topologie()); |
1749 |
|
|
//cout<<"aretver->get_id()= "<<aretver->get_id()<<endl; |
1750 |
|
|
if (faceseg->get_id()==76 || |
1751 |
|
|
aretver->get_id()==84 || aretver->get_id()==103|| aretver->get_id()==91|| aretver->get_id()==98 || aretver->get_id()==13|| aretver->get_id()==110) |
1752 |
|
|
{ |
1753 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(segment->get_noeud1()->get_nouveau_numero()); |
1754 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(segment->get_noeud2()->get_nouveau_numero()); |
1755 |
|
|
MG_SEGMENT *seg=new MG_SEGMENT(segment->get_lien_topologie(),no1,no2,segment->get_origine()); |
1756 |
|
|
//MG_SEGMENT *seg=new MG_SEGMENT(NULL,no1,no2,segment->get_origine()); |
1757 |
|
|
mainew->ajouter_mg_segment(seg); |
1758 |
|
|
} |
1759 |
|
|
} |
1760 |
|
|
|
1761 |
|
|
LISTE_MG_TRIANGLE::iterator itTri; |
1762 |
|
|
for (MG_TRIANGLE * triangle =mai->get_premier_triangle(itTri); triangle; triangle=mai->get_suivant_triangle(itTri)) |
1763 |
|
|
{ |
1764 |
|
|
MG_FACE* facetri=(MG_FACE*) (triangle->get_lien_topologie()); |
1765 |
|
|
if (facetri->get_id()==76) |
1766 |
|
|
{ |
1767 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(triangle->get_noeud1()->get_nouveau_numero()); |
1768 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(triangle->get_noeud2()->get_nouveau_numero()); |
1769 |
|
|
MG_NOEUD* no3=mainew->get_mg_noeudid(triangle->get_noeud3()->get_nouveau_numero()); |
1770 |
|
|
mainew->ajouter_mg_triangle(triangle->get_lien_topologie(),no1,no2,no3,triangle->get_origine()); |
1771 |
|
|
} |
1772 |
|
|
} |
1773 |
|
|
|
1774 |
|
|
//gestnew->enregistrer("cadsurfmsh_smplwithole_23mm.magic"); |
1775 |
|
|
gestnew->enregistrer(outputfilename); |
1776 |
|
|
} |
1777 |
sattarpa |
596 |
void CRIAQOPERATORS::surfmaker_e2t(char* outputfilename,int meshno,char* magicfilename) |
1778 |
sattarpa |
554 |
{ |
1779 |
|
|
// surfmeshgenerator a partially scanned (deformed CAD model) for GNIF examples for simple exam with hole (badisplacenmentvector + smplwithpocket) |
1780 |
|
|
MG_FILE gest(magicfilename); |
1781 |
|
|
MG_GEOMETRIE* geo=gest.get_mg_geometrie(0); |
1782 |
|
|
MG_MAILLAGE* mai; |
1783 |
|
|
if (meshno==0) mai=gest.get_mg_maillage(meshno); else mai=gest.get_mg_maillageid(meshno); |
1784 |
|
|
//MG_FILE gest((char*)"2d_smplwithole_23mm.magic"); |
1785 |
|
|
//MG_GEOMETRIE* geo=gest.get_mg_geometrieid(1); |
1786 |
|
|
//MG_MAILLAGE* mai=gest.get_mg_maillageid(1197); |
1787 |
|
|
MG_GESTIONNAIRE* gestnew=new MG_GESTIONNAIRE(); |
1788 |
|
|
MG_GEOMETRIE* geonew=mai->get_mg_geometrie(); |
1789 |
|
|
gestnew->ajouter_mg_geometrie(geonew); |
1790 |
|
|
MG_MAILLAGE* mainew=new MG_MAILLAGE(geonew); |
1791 |
|
|
gestnew->ajouter_mg_maillage(mainew); |
1792 |
|
|
|
1793 |
|
|
LISTE_MG_NOEUD::iterator itnod; |
1794 |
|
|
for (MG_NOEUD* vertices=mai->get_premier_noeud(itnod);vertices!=NULL;vertices=mai->get_suivant_noeud(itnod)) |
1795 |
|
|
{ |
1796 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topnd=vertices->get_lien_topologie(); |
1797 |
|
|
MG_FACE* facevert=(MG_FACE*) (vertices->get_lien_topologie()); |
1798 |
|
|
MG_ARETE* aretver=(MG_ARETE*) (vertices->get_lien_topologie()); |
1799 |
|
|
MG_SOMMET* sometver=(MG_SOMMET*) (vertices->get_lien_topologie()); |
1800 |
|
|
if(facevert->get_id()==37 |
1801 |
|
|
|| aretver->get_id()==20 || aretver->get_id()==108|| aretver->get_id()==113|| aretver->get_id()==101 || aretver->get_id()==59||aretver->get_id()==64 |
1802 |
|
|
|| aretver->get_id()==45 || aretver->get_id()==52|| aretver->get_id()==93|| aretver->get_id()==74 || aretver->get_id()==81||aretver->get_id()==88 |
1803 |
|
|
|| sometver->get_id()==10|| sometver->get_id()==19|| sometver->get_id()==51|| sometver->get_id()==58|| sometver->get_id()==42|| sometver->get_id()==44 |
1804 |
|
|
|| sometver->get_id()==87|| sometver->get_id()==73|| sometver->get_id()==80|| sometver->get_id()==71|| sometver->get_id()==100|| sometver->get_id()==107 |
1805 |
|
|
//for e2t |
1806 |
|
|
//|| aretver->get_id()==20 || aretver->get_id()==141|| aretver->get_id()==129|| aretver->get_id()==136 || aretver->get_id()==66||aretver->get_id()==59 |
1807 |
|
|
//|| aretver->get_id()==73 || aretver->get_id()==78|| aretver->get_id()==45|| aretver->get_id()==52 || aretver->get_id()==95||aretver->get_id()==102 |
1808 |
|
|
//|| aretver->get_id()==88 || aretver->get_id()==121|| aretver->get_id()==116|| aretver->get_id()==109 |
1809 |
|
|
//|| sometver->get_id()==10|| sometver->get_id()==19|| sometver->get_id()==65|| sometver->get_id()==58|| sometver->get_id()==51|| sometver->get_id()==42 |
1810 |
|
|
//|| sometver->get_id()==44|| sometver->get_id()==72|| sometver->get_id()==115|| sometver->get_id()==87|| sometver->get_id()==108|| sometver->get_id()==101 |
1811 |
|
|
//|| sometver->get_id()==94|| sometver->get_id()==85|| sometver->get_id()==128|| sometver->get_id()==135 |
1812 |
|
|
) |
1813 |
|
|
{ |
1814 |
|
|
double x=vertices->get_x(); |
1815 |
|
|
double y=vertices->get_y(); |
1816 |
|
|
double z=vertices->get_z(); |
1817 |
|
|
//MG_NOEUD *newno=new MG_NOEUD(NULL,x,y,z,vertices->get_origine()); |
1818 |
|
|
MG_NOEUD *newno=new MG_NOEUD(vertices->get_lien_topologie(),x,y,z,vertices->get_origine()); |
1819 |
|
|
mainew->ajouter_mg_noeud(newno); |
1820 |
|
|
vertices->change_nouveau_numero(newno->get_id()); // what does this do? |
1821 |
|
|
} |
1822 |
|
|
} |
1823 |
|
|
|
1824 |
|
|
LISTE_MG_SEGMENT::iterator itSeg; |
1825 |
|
|
for (MG_SEGMENT * segment =mai->get_premier_segment(itSeg); segment; segment=mai->get_suivant_segment(itSeg)) |
1826 |
|
|
{ |
1827 |
|
|
//%275=NOEUD($10,93.94800850483597,-250.0000000000000,0.000000000000000,1010); |
1828 |
|
|
//NOEUD linked with a topology (get_lien_topologie => $10 ) -> and %10=SOMMET(1,$9,0); %9=POINT_OCC(1); |
1829 |
|
|
//%390=SEGMENT($13,$275,$277,1010); => %13=ARETE(3,$8,$14,$15,1,0); %275=NOEUD($10,93.94800850483597,-250.0000000000000,0.000000000000000,1010); %277=NOEUD($13,89.09047601136933,-249.4243468871926,0.000000000000000,1010); |
1830 |
|
|
MG_FACE* faceseg=(MG_FACE*) (segment->get_lien_topologie()); |
1831 |
|
|
//cout<<"faceseg->get_id()= "<<faceseg->get_id()<<endl; |
1832 |
|
|
MG_ARETE* aretver=(MG_ARETE*) (segment->get_lien_topologie()); |
1833 |
|
|
//cout<<"aretver->get_id()= "<<aretver->get_id()<<endl; |
1834 |
|
|
if (faceseg->get_id()==37 |
1835 |
|
|
|| aretver->get_id()==20 || aretver->get_id()==108|| aretver->get_id()==113|| aretver->get_id()==101 || aretver->get_id()==59||aretver->get_id()==64 |
1836 |
|
|
|| aretver->get_id()==45 || aretver->get_id()==52|| aretver->get_id()==93|| aretver->get_id()==74 || aretver->get_id()==81||aretver->get_id()==88 |
1837 |
|
|
//|| aretver->get_id()==20 || aretver->get_id()==141|| aretver->get_id()==129|| aretver->get_id()==136 || aretver->get_id()==66||aretver->get_id()==59 |
1838 |
|
|
//|| aretver->get_id()==73 || aretver->get_id()==78|| aretver->get_id()==45|| aretver->get_id()==52 || aretver->get_id()==95||aretver->get_id()==102 |
1839 |
|
|
//|| aretver->get_id()==88 || aretver->get_id()==121|| aretver->get_id()==116|| aretver->get_id()==109 |
1840 |
|
|
|
1841 |
|
|
) |
1842 |
|
|
{ |
1843 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(segment->get_noeud1()->get_nouveau_numero()); |
1844 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(segment->get_noeud2()->get_nouveau_numero()); |
1845 |
|
|
MG_SEGMENT *seg=new MG_SEGMENT(segment->get_lien_topologie(),no1,no2,segment->get_origine()); |
1846 |
|
|
//MG_SEGMENT *seg=new MG_SEGMENT(NULL,no1,no2,segment->get_origine()); |
1847 |
|
|
mainew->ajouter_mg_segment(seg); |
1848 |
|
|
} |
1849 |
|
|
} |
1850 |
|
|
|
1851 |
|
|
LISTE_MG_TRIANGLE::iterator itTri; |
1852 |
|
|
for (MG_TRIANGLE * triangle =mai->get_premier_triangle(itTri); triangle; triangle=mai->get_suivant_triangle(itTri)) |
1853 |
|
|
{ |
1854 |
|
|
MG_FACE* facetri=(MG_FACE*) (triangle->get_lien_topologie()); |
1855 |
|
|
if (facetri->get_id()==37) |
1856 |
|
|
{ |
1857 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(triangle->get_noeud1()->get_nouveau_numero()); |
1858 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(triangle->get_noeud2()->get_nouveau_numero()); |
1859 |
|
|
MG_NOEUD* no3=mainew->get_mg_noeudid(triangle->get_noeud3()->get_nouveau_numero()); |
1860 |
|
|
mainew->ajouter_mg_triangle(triangle->get_lien_topologie(),no1,no2,no3,triangle->get_origine()); |
1861 |
|
|
} |
1862 |
|
|
} |
1863 |
|
|
|
1864 |
|
|
//gestnew->enregistrer("cadsurfmsh_smplwithole_23mm.magic"); |
1865 |
|
|
gestnew->enregistrer(outputfilename); |
1866 |
|
|
} |
1867 |
sattarpa |
596 |
void CRIAQOPERATORS::surfmaker_e3(char* outputfilename,int meshno,char* magicfilename) |
1868 |
sattarpa |
554 |
{ |
1869 |
|
|
//surfmesh maker (smplwithpocket+smpl withpocket) |
1870 |
|
|
MG_FILE gest(magicfilename); |
1871 |
|
|
MG_GEOMETRIE* geo=gest.get_mg_geometrie(0); |
1872 |
|
|
MG_MAILLAGE* mai; |
1873 |
|
|
if (meshno==0) mai=gest.get_mg_maillage(meshno); else mai=gest.get_mg_maillageid(meshno); |
1874 |
|
|
//MG_FILE gest((char*)"smplwithpocket_3d_13mm.magic"); |
1875 |
|
|
//MG_GEOMETRIE* geo=gest.get_mg_geometrieid(1); |
1876 |
|
|
//MG_MAILLAGE* mai=gest.get_mg_maillageid(2982821); |
1877 |
|
|
MG_GESTIONNAIRE* gestnew=new MG_GESTIONNAIRE(); |
1878 |
|
|
MG_GEOMETRIE* geonew=mai->get_mg_geometrie(); |
1879 |
|
|
gestnew->ajouter_mg_geometrie(geonew); |
1880 |
|
|
MG_MAILLAGE* mainew=new MG_MAILLAGE(geonew); |
1881 |
|
|
gestnew->ajouter_mg_maillage(mainew); |
1882 |
|
|
|
1883 |
|
|
LISTE_MG_NOEUD::iterator itnod; |
1884 |
|
|
for (MG_NOEUD* vertices=mai->get_premier_noeud(itnod);vertices!=NULL;vertices=mai->get_suivant_noeud(itnod)) |
1885 |
|
|
{ |
1886 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topnd=vertices->get_lien_topologie(); |
1887 |
|
|
MG_FACE* facevert=(MG_FACE*) (vertices->get_lien_topologie()); |
1888 |
|
|
MG_ARETE* aretver=(MG_ARETE*) (vertices->get_lien_topologie()); |
1889 |
|
|
MG_SOMMET* sometver=(MG_SOMMET*) (vertices->get_lien_topologie()); |
1890 |
|
|
if(facevert->get_id()==5 |
1891 |
|
|
|| aretver->get_id()==32 || aretver->get_id()==61|| aretver->get_id()==42|| aretver->get_id()==56 || aretver->get_id()==49||aretver->get_id()==27 |
1892 |
|
|
|| aretver->get_id()==85 || aretver->get_id()==90|| aretver->get_id()==78|| aretver->get_id()==71 || aretver->get_id()==20||aretver->get_id()==13 |
1893 |
|
|
|| sometver->get_id()==10|| sometver->get_id()==26|| sometver->get_id()==41|| sometver->get_id()==55|| sometver->get_id()==39|| sometver->get_id()==48 |
1894 |
|
|
|| sometver->get_id()==84|| sometver->get_id()==77|| sometver->get_id()==70|| sometver->get_id()==68|| sometver->get_id()==12|| sometver->get_id()==19) |
1895 |
|
|
{ |
1896 |
|
|
double x=vertices->get_x(); |
1897 |
|
|
double y=vertices->get_y(); |
1898 |
|
|
double z=vertices->get_z(); |
1899 |
|
|
//MG_NOEUD *newno=new MG_NOEUD(NULL,x,y,z,vertices->get_origine()); |
1900 |
|
|
MG_NOEUD *newno=new MG_NOEUD(vertices->get_lien_topologie(),x,y,z,vertices->get_origine()); |
1901 |
|
|
mainew->ajouter_mg_noeud(newno); |
1902 |
|
|
vertices->change_nouveau_numero(newno->get_id()); // what does this do? |
1903 |
|
|
} |
1904 |
|
|
} |
1905 |
|
|
|
1906 |
|
|
LISTE_MG_SEGMENT::iterator itSeg; |
1907 |
|
|
for (MG_SEGMENT * segment =mai->get_premier_segment(itSeg); segment; segment=mai->get_suivant_segment(itSeg)) |
1908 |
|
|
{ |
1909 |
|
|
//%275=NOEUD($10,93.94800850483597,-250.0000000000000,0.000000000000000,1010); |
1910 |
|
|
//NOEUD linked with a topology (get_lien_topologie => $10 ) -> and %10=SOMMET(1,$9,0); %9=POINT_OCC(1); |
1911 |
|
|
//%390=SEGMENT($13,$275,$277,1010); => %13=ARETE(3,$8,$14,$15,1,0); %275=NOEUD($10,93.94800850483597,-250.0000000000000,0.000000000000000,1010); %277=NOEUD($13,89.09047601136933,-249.4243468871926,0.000000000000000,1010); |
1912 |
|
|
MG_FACE* faceseg=(MG_FACE*) (segment->get_lien_topologie()); |
1913 |
|
|
//cout<<"faceseg->get_id()= "<<faceseg->get_id()<<endl; |
1914 |
|
|
MG_ARETE* aretver=(MG_ARETE*) (segment->get_lien_topologie()); |
1915 |
|
|
//cout<<"aretver->get_id()= "<<aretver->get_id()<<endl; |
1916 |
|
|
if (faceseg->get_id()==5 |
1917 |
|
|
|| aretver->get_id()==32 || aretver->get_id()==61|| aretver->get_id()==42|| aretver->get_id()==56 || aretver->get_id()==49||aretver->get_id()==27 |
1918 |
|
|
|| aretver->get_id()==85 || aretver->get_id()==90|| aretver->get_id()==78|| aretver->get_id()==71 || aretver->get_id()==20||aretver->get_id()==13) |
1919 |
|
|
{ |
1920 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(segment->get_noeud1()->get_nouveau_numero()); |
1921 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(segment->get_noeud2()->get_nouveau_numero()); |
1922 |
|
|
MG_SEGMENT *seg=new MG_SEGMENT(segment->get_lien_topologie(),no1,no2,segment->get_origine()); |
1923 |
|
|
//MG_SEGMENT *seg=new MG_SEGMENT(NULL,no1,no2,segment->get_origine()); |
1924 |
|
|
mainew->ajouter_mg_segment(seg); |
1925 |
|
|
} |
1926 |
|
|
} |
1927 |
|
|
|
1928 |
|
|
LISTE_MG_TRIANGLE::iterator itTri; |
1929 |
|
|
for (MG_TRIANGLE * triangle =mai->get_premier_triangle(itTri); triangle; triangle=mai->get_suivant_triangle(itTri)) |
1930 |
|
|
{ |
1931 |
|
|
MG_FACE* facetri=(MG_FACE*) (triangle->get_lien_topologie()); |
1932 |
|
|
if (facetri->get_id()==5) |
1933 |
|
|
{ |
1934 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(triangle->get_noeud1()->get_nouveau_numero()); |
1935 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(triangle->get_noeud2()->get_nouveau_numero()); |
1936 |
|
|
MG_NOEUD* no3=mainew->get_mg_noeudid(triangle->get_noeud3()->get_nouveau_numero()); |
1937 |
|
|
mainew->ajouter_mg_triangle(triangle->get_lien_topologie(),no1,no2,no3,triangle->get_origine()); |
1938 |
|
|
} |
1939 |
|
|
} |
1940 |
|
|
|
1941 |
|
|
//gestnew->enregistrer("scnsurf_smplwithpocket_3d_13mm_232mmdeform.magic"); |
1942 |
|
|
gestnew->enregistrer(outputfilename); |
1943 |
|
|
} |
1944 |
sattarpa |
596 |
void CRIAQOPERATORS::gnifformatmaker(char* elementxtoutfile,char* nodtxtoutfile,int meshno,char* magicfilename) |
1945 |
sattarpa |
554 |
{ |
1946 |
|
|
// gnifformatmaker |
1947 |
|
|
MG_FILE gest(magicfilename); |
1948 |
|
|
MG_MAILLAGE* mai; |
1949 |
|
|
if (meshno==0) mai=gest.get_mg_maillage(meshno); else mai=gest.get_mg_maillageid(meshno); |
1950 |
|
|
//MG_FILE gest((char*)"scnsurf_longflxprtwithpockets_3d_3mm_8mmdef_0bump.magic"); |
1951 |
|
|
// MG_MAILLAGE* mai=gest.get_mg_maillageid(2); |
1952 |
|
|
//std::string fichiermaillage="CAD_output_elements.txt"; |
1953 |
|
|
//FILE* in=fopen(fichiermaillage.c_str(),"wt"); |
1954 |
|
|
//FILE* in1=fopen("scnsurf_longflxprtwithpockets_3d_3mm_8mmdef_0bump_nodes.txt","wt"); |
1955 |
|
|
FILE* in1=fopen(nodtxtoutfile,"wt"); |
1956 |
|
|
//FILE* in1=fopen("scannedsurface_nodes.txt","wt"); |
1957 |
|
|
LISTE_MG_NOEUD::iterator itnod; |
1958 |
|
|
unsigned long firstno=mai->get_premier_noeud(itnod)->get_id(); |
1959 |
|
|
firstno=firstno-1; |
1960 |
|
|
cout<<firstno<<endl; |
1961 |
|
|
int counter1=1; |
1962 |
|
|
cout<<"mai->get_nb_mg_noeud()="<<mai->get_nb_mg_noeud()<<endl; |
1963 |
|
|
for (MG_NOEUD* nod=mai->get_premier_noeud(itnod);nod!=NULL;nod=mai->get_suivant_noeud(itnod)) |
1964 |
|
|
{ |
1965 |
|
|
nod->change_nouveau_numero(counter1); |
1966 |
|
|
//nod->change_id(counter1); |
1967 |
|
|
//fprintf(in1,"%d node coordinate %le %le %le\n",nod->get_id(), nod->get_x(),nod->get_y(), nod->get_z() ); |
1968 |
sattarpa |
658 |
//fprintf(in,"%d node coordinate %le %le %le\n",nod->get_id(), nod->get_x(),nod->get_y(), nod->get_z() ); |
1969 |
|
|
fprintf(in1,"%19d%32.9le%16.9le%8d\n",nod->get_nouveau_numero(), nod->get_x(),nod->get_y(),nod->get_nouveau_numero()); |
1970 |
|
|
fprintf(in1,"%7d%16.9le\n",nod->get_nouveau_numero(), nod->get_z()); |
1971 |
sattarpa |
554 |
counter1++; |
1972 |
|
|
} |
1973 |
|
|
//FILE* in2=fopen("scnsurf_longflxprtwithpockets_3d_3mm_8mmdef_0bump_elements.txt","wt"); // CAD text output elements |
1974 |
|
|
FILE* in2=fopen(elementxtoutfile,"wt"); |
1975 |
|
|
//FILE* in2=fopen("scannedsurface_elements.txt","wt"); //scanned text output elements |
1976 |
|
|
int counter=1; |
1977 |
|
|
LISTE_MG_TRIANGLE::iterator ittri; |
1978 |
|
|
for (MG_TRIANGLE* tri=mai->get_premier_triangle(ittri);tri!=NULL;tri=mai->get_suivant_triangle(ittri)) |
1979 |
|
|
{ |
1980 |
|
|
fprintf(in2,"%10d 1%8d%8d%8d\n",counter,tri->get_noeud1()->get_nouveau_numero(),tri->get_noeud2()->get_nouveau_numero(),tri->get_noeud3()->get_nouveau_numero() ); |
1981 |
|
|
counter++; |
1982 |
|
|
} |
1983 |
|
|
fclose(in1); |
1984 |
|
|
fclose(in2); |
1985 |
|
|
} |
1986 |
sattarpa |
596 |
void CRIAQOPERATORS::rmovscnprtfromdefrmdcad(char* outputfilename,int meshno,char* magicfilename) |
1987 |
sattarpa |
554 |
{ |
1988 |
|
|
MG_FILE gest(magicfilename); |
1989 |
|
|
MG_MAILLAGE* mai; |
1990 |
|
|
if (meshno==0) mai=gest.get_mg_maillage(meshno); else mai=gest.get_mg_maillageid(meshno); |
1991 |
sattarpa |
596 |
MG_GESTIONNAIRE* newgest=new MG_GESTIONNAIRE(); |
1992 |
sattarpa |
554 |
MG_GEOMETRIE* geonew=mai->get_mg_geometrie(); |
1993 |
sattarpa |
596 |
newgest->ajouter_mg_geometrie(geonew); |
1994 |
sattarpa |
554 |
MG_MAILLAGE* mainew=new MG_MAILLAGE(geonew); |
1995 |
sattarpa |
596 |
newgest->ajouter_mg_maillage(mainew); |
1996 |
|
|
|
1997 |
sattarpa |
554 |
LISTE_MG_NOEUD::iterator itnod; |
1998 |
|
|
for (MG_NOEUD* vertices=mai->get_premier_noeud(itnod);vertices!=NULL;vertices=mai->get_suivant_noeud(itnod)) |
1999 |
|
|
{ |
2000 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topnd=vertices->get_lien_topologie(); |
2001 |
|
|
MG_FACE* facevert=(MG_FACE*) (vertices->get_lien_topologie()); |
2002 |
sattarpa |
596 |
//if(facevert->get_id()!=76 && topnd->get_dimension()!=3) //e1 |
2003 |
|
|
//if(facevert->get_id()!=5 && topnd->get_dimension()!=3) //e2 |
2004 |
sattarpa |
554 |
{ |
2005 |
|
|
double x=vertices->get_x(); |
2006 |
|
|
double y=vertices->get_y(); |
2007 |
|
|
double z=vertices->get_z(); |
2008 |
|
|
MG_NOEUD *newno=new MG_NOEUD(vertices->get_lien_topologie(),x,y,z,vertices->get_origine()); |
2009 |
|
|
mainew->ajouter_mg_noeud(newno); |
2010 |
|
|
vertices->change_nouveau_numero(newno->get_id()); // what does this do? |
2011 |
|
|
} |
2012 |
|
|
} |
2013 |
sattarpa |
596 |
|
2014 |
sattarpa |
554 |
LISTE_MG_SEGMENT::iterator itSeg; |
2015 |
|
|
for (MG_SEGMENT * segment =mai->get_premier_segment(itSeg); segment; segment=mai->get_suivant_segment(itSeg)) |
2016 |
|
|
{ |
2017 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topseg=segment->get_lien_topologie(); |
2018 |
|
|
MG_FACE* faceseg=(MG_FACE*) (segment->get_lien_topologie()); |
2019 |
sattarpa |
596 |
//if (faceseg->get_id()!=76 && topseg->get_dimension()!=3) |
2020 |
|
|
if(faceseg->get_id()!=5 && topseg->get_dimension()!=3) //e2 |
2021 |
sattarpa |
554 |
{ |
2022 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(segment->get_noeud1()->get_nouveau_numero()); |
2023 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(segment->get_noeud2()->get_nouveau_numero()); |
2024 |
|
|
MG_SEGMENT *seg=new MG_SEGMENT(segment->get_lien_topologie(),no1,no2,segment->get_origine()); |
2025 |
|
|
mainew->ajouter_mg_segment(seg); |
2026 |
|
|
} |
2027 |
|
|
} |
2028 |
sattarpa |
596 |
|
2029 |
sattarpa |
554 |
LISTE_MG_TRIANGLE::iterator itTri; |
2030 |
|
|
for (MG_TRIANGLE * triangle =mai->get_premier_triangle(itTri); triangle; triangle=mai->get_suivant_triangle(itTri)) |
2031 |
|
|
{ |
2032 |
|
|
MG_ELEMENT_TOPOLOGIQUE *toptri=triangle->get_lien_topologie(); |
2033 |
|
|
MG_FACE* facetri=(MG_FACE*) (triangle->get_lien_topologie()); |
2034 |
sattarpa |
596 |
// if (facetri->get_id()!=76 && toptri->get_dimension()!=3) |
2035 |
|
|
if (facetri->get_id()!=5 && toptri->get_dimension()!=3) //e2 |
2036 |
sattarpa |
554 |
{ |
2037 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(triangle->get_noeud1()->get_nouveau_numero()); |
2038 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(triangle->get_noeud2()->get_nouveau_numero()); |
2039 |
|
|
MG_NOEUD* no3=mainew->get_mg_noeudid(triangle->get_noeud3()->get_nouveau_numero()); |
2040 |
|
|
mainew->ajouter_mg_triangle(triangle->get_lien_topologie(),no1,no2,no3,triangle->get_origine()); |
2041 |
|
|
} |
2042 |
|
|
} |
2043 |
sattarpa |
596 |
newgest->enregistrer(outputfilename); |
2044 |
sattarpa |
554 |
//gest.enregistrer("deformedcad_sansscannedpart.magic"); |
2045 |
|
|
|
2046 |
|
|
} |
2047 |
sattarpa |
596 |
void CRIAQOPERATORS::msh2dmakerfrommsh3d(char* outputfilename,int meshno,char* magicfilename) |
2048 |
sattarpa |
554 |
{ |
2049 |
|
|
//to make a 2D mesh out of 3D mesh :) |
2050 |
|
|
/* |
2051 |
|
|
MG_MAILLAGE* mainew=mai->dupliquer(&gest); |
2052 |
|
|
LISTE_MG_TETRA::iterator ittet; |
2053 |
|
|
for(MG_TETRA* ) |
2054 |
|
|
{ |
2055 |
|
|
|
2056 |
|
|
} |
2057 |
|
|
|
2058 |
|
|
cout<<"mainew->get_nb_mg_noeud()= "<<mainew->get_nb_mg_noeud()<<endl; |
2059 |
|
|
cout<<"mainew->get_nb_mg_segment()= "<<mainew->get_nb_mg_segment()<<endl; |
2060 |
|
|
cout<<"mainew->get_nb_mg_triangle()= "<<mainew->get_nb_mg_triangle()<<endl; |
2061 |
|
|
cout<<"mainew->get_nb_mg_tetra()= "<<mainew->get_nb_mg_tetra()<<endl; |
2062 |
|
|
|
2063 |
|
|
LISTE_MG_TRIANGLE::iterator ittri; |
2064 |
|
|
for (MG_TRIANGLE* triangle=mainew->get_premier_triangle(ittri);triangle!=NULL;triangle=mainew->get_suivant_triangle(ittri)) |
2065 |
|
|
{ |
2066 |
|
|
MG_ELEMENT_TOPOLOGIQUE *top=triangle->get_lien_topologie(); |
2067 |
|
|
int topdimension=top->get_dimension(); |
2068 |
|
|
if (topdimension==3) |
2069 |
|
|
mainew->supprimer_mg_triangleid(triangle->get_id()); |
2070 |
|
|
} |
2071 |
|
|
|
2072 |
|
|
LISTE_MG_TETRA::iterator ittet; |
2073 |
|
|
for (MG_TETRA* tetra=mainew->get_premier_tetra(ittet);tetra!=NULL;tetra=mainew->get_suivant_tetra(ittet)) |
2074 |
|
|
mainew->supprimer_mg_tetraid(tetra->get_id()); |
2075 |
|
|
//MG_FACE* face=geo->get_mg_faceid(5); |
2076 |
|
|
|
2077 |
|
|
|
2078 |
|
|
LISTE_MG_SEGMENT::iterator itseg; |
2079 |
|
|
for (MG_SEGMENT* segment=mainew->get_premier_segment(itseg);segment!=NULL;segment=mainew->get_suivant_segment(itseg)) |
2080 |
|
|
{ |
2081 |
|
|
MG_FACE* faceseg=(MG_FACE*) (segment->get_lien_topologie()); |
2082 |
|
|
if (faceseg->get_id()!=181) |
2083 |
|
|
mainew->supprimer_mg_segmentid(segment->get_id()); |
2084 |
|
|
|
2085 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topseg=segment->get_lien_topologie(); |
2086 |
|
|
if(topseg->get_dimension()==3) |
2087 |
|
|
cout<<"topseg->get_dimension()==3"<<endl; |
2088 |
|
|
} |
2089 |
|
|
|
2090 |
|
|
LISTE_MG_NOEUD::iterator itnod; |
2091 |
|
|
for (MG_NOEUD* vertices=mainew->get_premier_noeud(itnod);vertices!=NULL;vertices=mainew->get_suivant_noeud(itnod)) |
2092 |
|
|
{ |
2093 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topnd=vertices->get_lien_topologie(); |
2094 |
|
|
MG_FACE* facevert=(MG_FACE*) (vertices->get_lien_topologie()); |
2095 |
|
|
//if (facevert->get_id()!=181) |
2096 |
|
|
if (topnd->get_dimension()==0) |
2097 |
|
|
mainew->supprimer_mg_segmentid(vertices->get_id()); |
2098 |
|
|
} |
2099 |
|
|
|
2100 |
|
|
for (MG_TRIANGLE* triangle=mainew->get_premier_triangle(ittri);triangle!=NULL;triangle=mainew->get_suivant_triangle(ittri)) |
2101 |
|
|
{ |
2102 |
|
|
MG_FACE* facetri=(MG_FACE*) (triangle->get_lien_topologie()); |
2103 |
|
|
if (facetri->get_id()!=181) |
2104 |
|
|
mainew->supprimer_mg_triangleid(triangle->get_id()); |
2105 |
|
|
} |
2106 |
|
|
*/ |
2107 |
sattarpa |
596 |
|
2108 |
|
|
MG_FILE gest(magicfilename); |
2109 |
|
|
MG_MAILLAGE* mai; |
2110 |
|
|
if (meshno==0) mai=gest.get_mg_maillage(meshno); else mai=gest.get_mg_maillageid(meshno); |
2111 |
sattarpa |
554 |
MG_GESTIONNAIRE* newgest=new MG_GESTIONNAIRE(); |
2112 |
|
|
MG_GEOMETRIE* geonew=mai->get_mg_geometrie(); |
2113 |
|
|
newgest->ajouter_mg_geometrie(geonew); |
2114 |
|
|
MG_MAILLAGE* mainew=new MG_MAILLAGE(geonew); |
2115 |
|
|
newgest->ajouter_mg_maillage(mainew); |
2116 |
|
|
|
2117 |
|
|
LISTE_MG_NOEUD::iterator itNod; |
2118 |
|
|
for (MG_NOEUD* nd=mai->get_premier_noeud(itNod);nd!=NULL;nd=mai->get_suivant_noeud(itNod)) |
2119 |
|
|
{ |
2120 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topnd=nd->get_lien_topologie(); |
2121 |
|
|
if(topnd->get_dimension()<3) |
2122 |
|
|
{ |
2123 |
|
|
double x=nd->get_x(); |
2124 |
|
|
double y=nd->get_y(); |
2125 |
|
|
double z=nd->get_z(); |
2126 |
|
|
MG_NOEUD *newno=new MG_NOEUD(nd->get_lien_topologie(),x,y,z,nd->get_origine()); |
2127 |
|
|
mainew->ajouter_mg_noeud(newno); |
2128 |
|
|
nd->change_nouveau_numero(newno->get_id()); |
2129 |
|
|
} |
2130 |
|
|
} |
2131 |
|
|
LISTE_MG_SEGMENT::iterator itSeg; |
2132 |
|
|
for (MG_SEGMENT* segment =mai->get_premier_segment(itSeg); segment; segment=mai->get_suivant_segment(itSeg)) |
2133 |
|
|
{ |
2134 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topseg=segment->get_lien_topologie(); |
2135 |
|
|
if(topseg->get_dimension()<3) |
2136 |
|
|
{ |
2137 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(segment->get_noeud1()->get_nouveau_numero()); |
2138 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(segment->get_noeud2()->get_nouveau_numero()); |
2139 |
|
|
MG_SEGMENT *seg=new MG_SEGMENT(segment->get_lien_topologie(),no1,no2,segment->get_origine()); |
2140 |
|
|
mainew->ajouter_mg_segment(seg); |
2141 |
|
|
} |
2142 |
|
|
} |
2143 |
|
|
LISTE_MG_TRIANGLE::iterator itTri; |
2144 |
|
|
for (MG_TRIANGLE * triangle =mai->get_premier_triangle(itTri); triangle; triangle=mai->get_suivant_triangle(itTri)) |
2145 |
|
|
{ |
2146 |
|
|
MG_ELEMENT_TOPOLOGIQUE *toptri=triangle->get_lien_topologie(); |
2147 |
|
|
if(toptri->get_dimension()<3) |
2148 |
|
|
{ |
2149 |
|
|
MG_NOEUD* no1=mainew->get_mg_noeudid(triangle->get_noeud1()->get_nouveau_numero()); |
2150 |
|
|
MG_NOEUD* no2=mainew->get_mg_noeudid(triangle->get_noeud2()->get_nouveau_numero()); |
2151 |
|
|
MG_NOEUD* no3=mainew->get_mg_noeudid(triangle->get_noeud3()->get_nouveau_numero()); |
2152 |
|
|
mainew->ajouter_mg_triangle(triangle->get_lien_topologie(),no1,no2,no3,triangle->get_origine()); |
2153 |
|
|
} |
2154 |
|
|
} |
2155 |
sattarpa |
596 |
newgest->enregistrer(outputfilename); |
2156 |
sattarpa |
554 |
} |
2157 |
sattarpa |
596 |
void CRIAQOPERATORS::bumpmaker(char* outputfilename,int bumpndid, double bumptip,int meshno,char* magicfilename) |
2158 |
sattarpa |
554 |
{ |
2159 |
|
|
MG_FILE gest(magicfilename); |
2160 |
|
|
//MG_GEOMETRIE* geo=gest.get_mg_geometrie(0); |
2161 |
|
|
MG_MAILLAGE* mai; |
2162 |
|
|
if (meshno==0) mai=gest.get_mg_maillage(meshno); else mai=gest.get_mg_maillageid(meshno); |
2163 |
|
|
//MG_FILE gest((char*)"scnsurf_smplwithpocket_3d_13mm_64mmdeform.magic"); |
2164 |
|
|
//MG_GEOMETRIE* geo=gest.get_mg_geometrieid(1); |
2165 |
|
|
//MG_MAILLAGE* mai=gest.get_mg_maillageid(2); |
2166 |
|
|
MG_NOEUD* bptipnd; |
2167 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> usednd; |
2168 |
|
|
LISTE_MG_NOEUD::iterator itnod; |
2169 |
|
|
for (MG_NOEUD* nd=mai->get_premier_noeud(itnod);nd!=NULL;nd=mai->get_suivant_noeud(itnod)) |
2170 |
|
|
{ |
2171 |
|
|
MG_ELEMENT_TOPOLOGIQUE *topnd=nd->get_lien_topologie(); |
2172 |
|
|
if (topnd->get_dimension() <3 && nd->get_id()==bumpndid) |
2173 |
|
|
{ |
2174 |
|
|
bptipnd=nd; |
2175 |
|
|
double new_xyz[3]; |
2176 |
|
|
new_xyz[0]=nd->get_x(); new_xyz[1]=nd->get_y(); new_xyz[2]=nd->get_z()+bumptip; |
2177 |
|
|
nd->change_coord(new_xyz); |
2178 |
|
|
usednd.ajouter(nd); |
2179 |
|
|
} |
2180 |
|
|
} |
2181 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> usedndnd; |
2182 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> neignd; |
2183 |
|
|
for(int ineignd=0;ineignd<bptipnd->get_lien_segment()->get_nb();ineignd++) |
2184 |
|
|
{ |
2185 |
|
|
MG_SEGMENT* segnei=bptipnd->get_lien_segment()->get(ineignd); |
2186 |
|
|
if(segnei->get_noeud1()!=bptipnd) neignd.ajouter(segnei->get_noeud1()); |
2187 |
|
|
else if(segnei->get_noeud2()!=bptipnd) neignd.ajouter(segnei->get_noeud2()); |
2188 |
|
|
} |
2189 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itneignd; |
2190 |
|
|
for (MG_NOEUD* nd=neignd.get_premier(itneignd);nd!=NULL;nd=neignd.get_suivant(itneignd)) |
2191 |
|
|
{ |
2192 |
|
|
double new_xyz[3]; |
2193 |
|
|
new_xyz[0]=nd->get_x(); new_xyz[1]=nd->get_y(); new_xyz[2]=nd->get_z()+(bumptip*3./4.); |
2194 |
|
|
nd->change_coord(new_xyz); |
2195 |
|
|
usednd.ajouter(nd); |
2196 |
|
|
usedndnd.ajouter(nd); |
2197 |
|
|
} |
2198 |
|
|
|
2199 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> neignd1; |
2200 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> usedndnd1; |
2201 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itusednd; |
2202 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itusedndnd; |
2203 |
|
|
for(MG_NOEUD* nd=usedndnd.get_premier(itusedndnd);nd!=NULL;nd=usedndnd.get_suivant(itusedndnd)) |
2204 |
|
|
{ |
2205 |
|
|
for(int ineignd=0;ineignd<nd->get_lien_segment()->get_nb();ineignd++) |
2206 |
|
|
{ |
2207 |
|
|
MG_SEGMENT* segnei=nd->get_lien_segment()->get(ineignd); |
2208 |
|
|
int sgnd1=0; |
2209 |
|
|
int sgnd2=0; |
2210 |
|
|
for(MG_NOEUD* nd1=usednd.get_premier(itusednd);nd1!=NULL;nd1=usednd.get_suivant(itusednd)) |
2211 |
|
|
{ |
2212 |
|
|
if(segnei->get_noeud1()==nd1) sgnd1++; |
2213 |
|
|
} |
2214 |
|
|
for(MG_NOEUD* nd1=usednd.get_premier(itusednd);nd1!=NULL;nd1=usednd.get_suivant(itusednd)) |
2215 |
|
|
{ |
2216 |
|
|
if(segnei->get_noeud2()==nd1) sgnd2++; |
2217 |
|
|
} |
2218 |
|
|
if(sgnd1==0) neignd1.ajouter(segnei->get_noeud1()); |
2219 |
|
|
else if(sgnd2==0) neignd1.ajouter(segnei->get_noeud2()); |
2220 |
|
|
} |
2221 |
|
|
} |
2222 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itneignd1; |
2223 |
|
|
for (MG_NOEUD* nd=neignd1.get_premier(itneignd1);nd!=NULL;nd=neignd1.get_suivant(itneignd1)) |
2224 |
|
|
{ |
2225 |
|
|
double new_xyz[3]; |
2226 |
|
|
new_xyz[0]=nd->get_x(); new_xyz[1]=nd->get_y(); new_xyz[2]=nd->get_z()+(bumptip*2./4.); |
2227 |
|
|
nd->change_coord(new_xyz); |
2228 |
|
|
usednd.ajouter(nd); |
2229 |
|
|
usedndnd1.ajouter(nd); |
2230 |
|
|
} |
2231 |
|
|
|
2232 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*> neignd2; |
2233 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itusedndnd1; |
2234 |
|
|
for(MG_NOEUD* nd=usedndnd1.get_premier(itusedndnd1);nd!=NULL;nd=usedndnd1.get_suivant(itusedndnd1)) |
2235 |
|
|
{ |
2236 |
|
|
for(int ineignd=0;ineignd<nd->get_lien_segment()->get_nb();ineignd++) |
2237 |
|
|
{ |
2238 |
|
|
MG_SEGMENT* segnei=nd->get_lien_segment()->get(ineignd); |
2239 |
|
|
int sgnd1=0; |
2240 |
|
|
int sgnd2=0; |
2241 |
|
|
for(MG_NOEUD* nd1=usednd.get_premier(itusednd);nd1!=NULL;nd1=usednd.get_suivant(itusednd)) |
2242 |
|
|
{ |
2243 |
|
|
if(segnei->get_noeud1()==nd1) sgnd1++; |
2244 |
|
|
} |
2245 |
|
|
for(MG_NOEUD* nd1=usednd.get_premier(itusednd);nd1!=NULL;nd1=usednd.get_suivant(itusednd)) |
2246 |
|
|
{ |
2247 |
|
|
if(segnei->get_noeud2()==nd1) sgnd2++; |
2248 |
|
|
} |
2249 |
|
|
if(sgnd1==0) neignd2.ajouter(segnei->get_noeud1()); |
2250 |
|
|
else if(sgnd2==0) neignd2.ajouter(segnei->get_noeud2()); |
2251 |
|
|
} |
2252 |
|
|
} |
2253 |
|
|
TPL_MAP_ENTITE<MG_NOEUD*>::ITERATEUR itneignd2; |
2254 |
|
|
for (MG_NOEUD* nd=neignd2.get_premier(itneignd2);nd!=NULL;nd=neignd2.get_suivant(itneignd2)) |
2255 |
|
|
{ |
2256 |
|
|
double new_xyz[3]; |
2257 |
|
|
new_xyz[0]=nd->get_x(); new_xyz[1]=nd->get_y(); new_xyz[2]=nd->get_z()+(bumptip*1./4.); |
2258 |
|
|
nd->change_coord(new_xyz); |
2259 |
|
|
} |
2260 |
|
|
|
2261 |
|
|
|
2262 |
|
|
//gest.enregistrer("scnsurf_smplwithpocket_3d_13mm_64mmdeform_withbump5mm.magic"); |
2263 |
|
|
gest.enregistrer(outputfilename); |
2264 |
|
|
} |
2265 |
sattarpa |
596 |
int CRIAQOPERATORS::import_triangulation_gnif(char* outputfilename,char* triangulationfile) |
2266 |
|
|
{ |
2267 |
|
|
FILE* in=fopen(triangulationfile,"rt"); |
2268 |
|
|
if (in==NULL) return 0; |
2269 |
sattarpa |
554 |
|
2270 |
|
|
|
2271 |
sattarpa |
596 |
MG_GESTIONNAIRE gesttmp; |
2272 |
|
|
MG_MAILLAGE* mai=new MG_MAILLAGE(NULL); |
2273 |
|
|
gesttmp.ajouter_mg_maillage(mai); |
2274 |
|
|
char mess[500]; |
2275 |
sattarpa |
554 |
|
2276 |
sattarpa |
596 |
double xmax=-1e308; |
2277 |
|
|
double xmin=1e308; |
2278 |
|
|
double ymax=-1e308; |
2279 |
|
|
double ymin=1e308; |
2280 |
|
|
double zmax=-1e308; |
2281 |
|
|
double zmin=1e308; |
2282 |
|
|
while (!feof(in)) |
2283 |
|
|
{ |
2284 |
|
|
double x,y,z; |
2285 |
|
|
char nom[20]; |
2286 |
|
|
char *res=fgets(mess,500,in); |
2287 |
|
|
if (feof(in)) break; |
2288 |
sattarpa |
655 |
if(res!=NULL) |
2289 |
|
|
{ |
2290 |
sattarpa |
658 |
sscanf(mess,"%le %le %le",&x,&y,&z); |
2291 |
sattarpa |
596 |
if (x<xmin) xmin=x; |
2292 |
|
|
if (x>xmax) xmax=x; |
2293 |
|
|
if (y<ymin) ymin=y; |
2294 |
|
|
if (y>ymax) ymax=y; |
2295 |
|
|
if (z<zmin) zmin=z; |
2296 |
|
|
if (z>zmax) zmax=z; |
2297 |
|
|
if (feof(in)) return 1; |
2298 |
|
|
MG_NOEUD* noeud1=mai->ajouter_mg_noeud(NULL,x,y,z,TRIANGULATION); |
2299 |
|
|
noeud1->change_nouveau_numero(-1); |
2300 |
|
|
res=fgets(mess,500,in); |
2301 |
|
|
if (feof(in)) break; |
2302 |
sattarpa |
658 |
sscanf(mess,"%le %le %le",&x,&y,&z); |
2303 |
sattarpa |
596 |
if (x<xmin) xmin=x; |
2304 |
|
|
if (x>xmax) xmax=x; |
2305 |
|
|
if (y<ymin) ymin=y; |
2306 |
|
|
if (y>ymax) ymax=y; |
2307 |
|
|
if (z<zmin) zmin=z; |
2308 |
|
|
if (z>zmax) zmax=z; |
2309 |
|
|
if (feof(in)) return 1; |
2310 |
|
|
res=fgets(mess,500,in); |
2311 |
|
|
if (feof(in)) break; |
2312 |
|
|
MG_NOEUD* noeud2=mai->ajouter_mg_noeud(NULL,x,y,z,TRIANGULATION); |
2313 |
|
|
noeud2->change_nouveau_numero(-1); |
2314 |
sattarpa |
658 |
sscanf(mess,"%le %le %le",&x,&y,&z); |
2315 |
sattarpa |
596 |
if (x<xmin) xmin=x; |
2316 |
|
|
if (x>xmax) xmax=x; |
2317 |
|
|
if (y<ymin) ymin=y; |
2318 |
|
|
if (y>ymax) ymax=y; |
2319 |
|
|
if (z<zmin) zmin=z; |
2320 |
|
|
if (z>zmax) zmax=z; |
2321 |
|
|
if (feof(in)) return 1; |
2322 |
|
|
MG_NOEUD* noeud3=mai->ajouter_mg_noeud(NULL,x,y,z,TRIANGULATION); |
2323 |
|
|
noeud3->change_nouveau_numero(-1); |
2324 |
|
|
mai->ajouter_mg_triangle(NULL,noeud1,noeud2,noeud3,TRIANGULATION); |
2325 |
sattarpa |
655 |
} |
2326 |
sattarpa |
596 |
} |
2327 |
|
|
fclose(in); |
2328 |
|
|
//to merge the nodes of each triangulation which are close (the same) |
2329 |
|
|
double eps=1e-4; |
2330 |
|
|
BOITE_3D boite(xmin,ymin,zmin,xmax,ymax,zmax); |
2331 |
|
|
double rayon=boite.get_rayon()*1.1; |
2332 |
|
|
double x=boite.get_xcentre(); |
2333 |
|
|
double y=boite.get_ycentre(); |
2334 |
|
|
double z=boite.get_zcentre(); |
2335 |
|
|
boite.reinit(x-rayon,y-rayon,z-rayon,x+rayon,y+rayon,z+rayon); |
2336 |
|
|
TPL_GRILLE<MG_NOEUD*> grille; |
2337 |
|
|
int nb_noeud=mai->get_nb_mg_noeud(); |
2338 |
|
|
int pas=(int)(pow(nb_noeud,0.33333333333333333))+1; |
2339 |
|
|
grille.initialiser(boite.get_xmin(),boite.get_ymin(),boite.get_zmin(),boite.get_xmax(),boite.get_ymax(),boite.get_zmax(),pas,pas,pas); |
2340 |
|
|
std::vector<MG_NOEUD*> lst_noeud; |
2341 |
|
|
LISTE_MG_NOEUD::iterator it; |
2342 |
|
|
int i=0; |
2343 |
|
|
for (MG_NOEUD* noeud=mai->get_premier_noeud(it);noeud!=NULL;noeud=mai->get_suivant_noeud(it)) |
2344 |
|
|
{ |
2345 |
|
|
//MG_NOEUD* noeud=mai->get_mg_noeud(i); |
2346 |
|
|
grille.inserer(noeud); |
2347 |
|
|
noeud->change_nouveau_numero(i); |
2348 |
|
|
lst_noeud.insert(lst_noeud.end(),noeud); |
2349 |
|
|
i++; |
2350 |
|
|
} |
2351 |
sattarpa |
554 |
|
2352 |
sattarpa |
596 |
int nb_cell=grille.get_nb_cellule(); |
2353 |
|
|
for (int i=0;i<nb_cell;i++) |
2354 |
|
|
{ |
2355 |
|
|
TPL_CELLULE_GRILLE<MG_NOEUD*> *cell=grille.get_cellule(i); |
2356 |
|
|
int nb_noeud_cell=cell->get_nb_entite(); |
2357 |
|
|
for (int j=0;j<nb_noeud_cell;j++) |
2358 |
|
|
{ |
2359 |
|
|
MG_NOEUD* noeud1=cell->get_entite(j); |
2360 |
|
|
// if (noeud1->get_nouveau_numero()!=(-1)) continue; |
2361 |
|
|
// noeud1->change_nouveau_numero(noeud1->get_id()); |
2362 |
|
|
double *xyz1=noeud1->get_coord(); |
2363 |
|
|
int nb=noeud1->get_lien_segment()->get_nb(); |
2364 |
|
|
double longref=0.; |
2365 |
|
|
for (int jj=0;jj<nb;jj++) |
2366 |
|
|
longref=longref+noeud1->get_lien_segment()->get(jj)->get_longueur(); |
2367 |
|
|
longref=longref/nb; |
2368 |
|
|
for (int k=j+1;k<nb_noeud_cell;k++) |
2369 |
|
|
{ |
2370 |
|
|
MG_NOEUD* noeud2=cell->get_entite(k); |
2371 |
|
|
double *xyz2=noeud2->get_coord(); |
2372 |
|
|
OT_VECTEUR_3D vec(xyz1,xyz2); |
2373 |
|
|
double longueur=vec.get_longueur(); |
2374 |
|
|
if (longueur<eps*longref) |
2375 |
|
|
{ |
2376 |
|
|
lst_noeud[noeud2->get_nouveau_numero()]=noeud1; |
2377 |
|
|
} |
2378 |
|
|
} |
2379 |
|
|
} |
2380 |
|
|
} |
2381 |
|
|
MG_GESTIONNAIRE gest; |
2382 |
|
|
MG_MAILLAGE* mai2=new MG_MAILLAGE(NULL); |
2383 |
|
|
gest.ajouter_mg_maillage(mai2); |
2384 |
|
|
for (int i=0;i<nb_noeud;i++) |
2385 |
|
|
{ |
2386 |
|
|
MG_NOEUD* noeud=lst_noeud[i]; |
2387 |
|
|
MG_NOEUD* nvnoeud; |
2388 |
|
|
if (noeud->get_nouveau_numero()==i) nvnoeud=mai2->ajouter_mg_noeud(NULL,noeud->get_x(),noeud->get_y(),noeud->get_z(),TRIANGULATION); |
2389 |
|
|
else nvnoeud=lst_noeud[noeud->get_nouveau_numero()]; |
2390 |
|
|
lst_noeud[i]=nvnoeud; |
2391 |
|
|
} |
2392 |
|
|
int nb_tri=mai->get_nb_mg_triangle(); |
2393 |
|
|
for (int i=0;i<nb_tri;i++) |
2394 |
|
|
{ |
2395 |
|
|
MG_TRIANGLE* tri=mai->get_mg_triangle(i); |
2396 |
|
|
MG_NOEUD* noeud1=tri->get_noeud1(); |
2397 |
|
|
MG_NOEUD* noeud2=tri->get_noeud2(); |
2398 |
|
|
MG_NOEUD* noeud3=tri->get_noeud3(); |
2399 |
|
|
mai2->ajouter_mg_triangle(NULL,lst_noeud[noeud1->get_nouveau_numero()],lst_noeud[noeud2->get_nouveau_numero()],lst_noeud[noeud3->get_nouveau_numero()],TRIANGULATION); |
2400 |
|
|
} |
2401 |
|
|
gest.enregistrer(outputfilename); |
2402 |
|
|
return 1; |
2403 |
|
|
} |