MAGiC  V5.0
Mailleurs Automatiques de Géometries intégrés à la Cao
CAD4FE_OptimizeEdgeSwap.cpp
Aller à la documentation de ce fichier.
1 //####//------------------------------------------------------------
2 //####//------------------------------------------------------------
3 //####// MAGiC
4 //####// Jean Christophe Cuilliere et Vincent FRANCOIS
5 //####// Departement de Genie Mecanique - UQTR
6 //####//------------------------------------------------------------
7 //####// MAGIC est un projet de recherche de l equipe ERICCA
8 //####// du departement de genie mecanique de l Universite du Quebec a Trois Rivieres
9 //####// http://www.uqtr.ca/ericca
10 //####// http://www.uqtr.ca/
11 //####//------------------------------------------------------------
12 //####//------------------------------------------------------------
13 //####//
14 //####// CAD4FE_OptimizeEdgeSwap.cpp
15 //####//
16 //####//------------------------------------------------------------
17 //####//------------------------------------------------------------
18 //####// COPYRIGHT 2000-2024
19 //####// jeu 13 jun 2024 11:58:56 EDT
20 //####//------------------------------------------------------------
21 //####//------------------------------------------------------------
22 #include <set>
23 
24 #pragma hdrstop
25 
26 #include "gestionversion.h"
27 #include <math.h>
28 #include "CAD4FE_OptimizeEdgeSwap.h"
29 #include "ot_mathematique.h"
30 #include "ot_boite_2d.h"
31 #include "tpl_map_entite.h"
32 #include "CAD4FE_m3d_MCTriangle.h"
33 #include "mg_maillage.h"
34 
35 #include "CAD4FE_Intersection_MCSegment_MCSegment.h"
36 #include "CAD4FE_MCSegment_Middle.h"
37 #include "CAD4FE_MCSegment.h"
38 #include "CAD4FE_MCNode.h"
39 #include "ot_algorithme_geometrique.h"
40 #include "CAD4FE_Geometric_Tools.h"
41 
42 
43 #pragma package(smart_init)
44 
45 using namespace CAD4FE;
46 
47 OptimizeEdgeSwap::OptimizeEdgeSwap(MG_MAILLAGE* __mesh)
48 {
49  _mesh=__mesh;
50  maxDiedralAngle = 45*M_PI/180;
51 }
52 
53 MG_SEGMENT* OptimizeEdgeSwap::GetSegmentAfter(MG_TRIANGLE *__triangle, MG_SEGMENT *__segment)
54 {
55  if (__segment == __triangle->get_segment1())
56  return __triangle->get_segment2();
57  if (__segment == __triangle->get_segment2())
58  return __triangle->get_segment3();
59  if (__segment == __triangle->get_segment3())
60  return __triangle->get_segment1();
61  return NULL;
62 }
63 
64 MG_SEGMENT* OptimizeEdgeSwap::GetSegmentBefore(MG_TRIANGLE *__triangle, MG_SEGMENT *__segment)
65 {
66  if (__segment == __triangle->get_segment1())
67  return __triangle->get_segment3();
68  if (__segment == __triangle->get_segment2())
69  return __triangle->get_segment1();
70  if (__segment == __triangle->get_segment3())
71  return __triangle->get_segment2();
72  return NULL;
73 }
74 
75 int OptimizeEdgeSwap::CheckOverlapTriangle(MG_NOEUD * __tri[2][3])
76 {
77  for (int i=0;i<2;i++)
78  for (int j=0;j<3;j++)
79  {
80  MG_NOEUD ** t = __tri[(i+1)%2];
81  MG_NOEUD * v = __tri[i][j];
82 
83  if (t[0]==v||t[1]==v||t[2]==v) continue;
84 
85  double I[3],IT;
86  int res = OT_ALGORITHME_GEOMETRIQUE::project_PointTriangle(v->get_coord(),t[0]->get_coord(),t[1]->get_coord(),t[2]->get_coord(),I,&IT);
87  if (res != 0)
88  return res;
89  }
90  return 0;
91 }
92 
93 double OptimizeEdgeSwap::SwapScore(MG_SEGMENT *__segment)
94 {
95  return Swap(__segment,false);
96 }
97 
98 double OptimizeEdgeSwap::SwapSegment(MG_SEGMENT *__segment)
99 {
100  MG_TRIANGLE * triangle[2]={__segment->get_lien_triangle()->get(0),__segment->get_lien_triangle()->get(1)};
101  MG_NOEUD * no[4]; // no[]={A,C,B,D} where AB is the segment shared by both triangles AB, C and D nodes opposed to segment AB
102  no[2] = GetStartNode(triangle[0],__segment);
103  no[1] = GetNodeBefore(triangle[0],no[2]);
104  no[0] = GetNodeBefore(triangle[0],no[1]);
105  no[3] = GetNodeBefore(triangle[1],no[0]);
106  MG_SEGMENT * seg[4];
107  seg[0] = _mesh->get_mg_segment(no[0]->get_id(),no[1]->get_id()); // AC
108  seg[1] = _mesh->get_mg_segment(no[1]->get_id(),no[2]->get_id()); // CB
109  seg[2] = _mesh->get_mg_segment(no[2]->get_id(),no[3]->get_id()); // BD
110  seg[3] = _mesh->get_mg_segment(no[3]->get_id(),no[0]->get_id()); // DA
111 
112  double crit21 = OPERATEUR::qualite_triangle(no[1]->get_coord(),no[3]->get_coord(),no[0]->get_coord());
113  double crit22 = OPERATEUR::qualite_triangle(no[1]->get_coord(),no[2]->get_coord(),no[3]->get_coord());
114  MCSegment * swapSegment = new MCSegment(triangle[0]->get_lien_topologie(), (MCNode*)no[1], (MCNode*)no[3] );
115  if (swapSegment->GetRefFaceMapping().size() == 0)
116  {
117  delete swapSegment;
118  return 0;
119  }
120  _mesh->ajouter_mg_segment(swapSegment);
121  M3D_MCTriangle * newTriangle[2];
122  newTriangle[0] = new M3D_MCTriangle(triangle[0]->get_lien_topologie(), (MCNode*)no[1], (MCNode*)no[2], (MCNode*)no[3], (MCSegment*)seg[1], (MCSegment*)seg[2], swapSegment);
123  newTriangle[0]->change_qualite(crit21);
124  newTriangle[1] = new M3D_MCTriangle(triangle[0]->get_lien_topologie(), (MCNode*)no[3], (MCNode*)no[0], (MCNode*)no[1], (MCSegment*)seg[3], (MCSegment*)seg[0], swapSegment);
125  newTriangle[1]->change_qualite(crit22);
126  for (int i=0; i<2; i++)_mesh->ajouter_mg_triangle(newTriangle[i]);
127  for (int i=0; i<2; i++)_mesh->supprimer_mg_triangleid(triangle[i]->get_id());
128  _mesh->supprimer_mg_segmentid(__segment->get_id());
129 
130  return 1;
131 }
132 
133 /*double OptimizeEdgeSwap::Swap(MG_SEGMENT *__segment, bool __execute)
134 {
135  double score1;
136  if (__segment->get_lien_triangle()->get_nb() != 2)
137  {
138  return -1;
139  }
140  if (__segment->get_lien_triangle()->get(0)->get_lien_topologie() != __segment->get_lien_triangle()->get(1)->get_lien_topologie())
141  {
142  return -2;
143  }
144  if (__segment->get_lien_topologie()&&__segment->get_lien_topologie()->get_dimension()!=2)
145  {
146  return -3;
147  }
148 
149  MG_TRIANGLE * triangle[2]={__segment->get_lien_triangle()->get(0),__segment->get_lien_triangle()->get(1)};
150  MG_NOEUD * no[4]; // no[]={A,C,B,D} where AB is the segment shared by both triangles AB, C and D nodes opposed to segment AB
151  no[2] = GetStartNode(triangle[0],__segment);
152  no[1] = GetNodeBefore(triangle[0],no[2]);
153  no[0] = GetNodeBefore(triangle[0],no[1]);
154  no[3] = GetNodeBefore(triangle[1],no[0]);
155  MG_SEGMENT * seg[4];
156  seg[0] = _mesh->get_mg_segment(no[0]->get_id(),no[1]->get_id()); // AC
157  seg[1] = _mesh->get_mg_segment(no[1]->get_id(),no[2]->get_id()); // CB
158  seg[2] = _mesh->get_mg_segment(no[2]->get_id(),no[3]->get_id()); // BD
159  seg[3] = _mesh->get_mg_segment(no[3]->get_id(),no[0]->get_id()); // DA
160 
161  double crit11,crit12,crit21,crit22;
162  crit11 = OPERATEUR::qualite_triangle(no[0]->get_coord(),no[1]->get_coord(),no[2]->get_coord());
163  crit12 = OPERATEUR::qualite_triangle(no[2]->get_coord(),no[3]->get_coord(),no[0]->get_coord());
164  crit21 = OPERATEUR::qualite_triangle(no[1]->get_coord(),no[3]->get_coord(),no[0]->get_coord());
165  crit22 = OPERATEUR::qualite_triangle(no[1]->get_coord(),no[2]->get_coord(),no[3]->get_coord());
166 
167  double crit1=std::min(crit11,crit12);
168  double crit2=std::min(crit21,crit22);
169 
170  score1 = (crit1 > .5) ? -1 : (crit2-crit1);
171  if (score1 < 0) return score1;
172 
173  MG_NOEUD* tris2[2][3]={{no[3],no[1],no[2]},{no[1],no[3],no[0]}};
174  int testOverlapTriangles = CheckOverlapTriangle(tris2);
175  score1 = ( testOverlapTriangles != 0 ) ? -1 : score1;
176  if (score1 < 0) return score1;
177 
178  double diedralAngle2 = GeometricTools::ComputeDiedralAngle(tris2);
179  score1 = ( diedralAngle2 > maxDiedralAngle ) ? -1 : score1;
180  if (score1 < 0) return score1;
181 
182  if (__execute && score1 > 0)
183  {
184  double crit21 = OPERATEUR::qualite_triangle(no[1]->get_coord(),no[3]->get_coord(),no[0]->get_coord());
185  double crit22 = OPERATEUR::qualite_triangle(no[1]->get_coord(),no[2]->get_coord(),no[3]->get_coord());
186  MG_ELEMENT_TOPOLOGIQUE * topo = __segment->get_lien_triangle()->get(0)->get_lien_topologie() ;
187  MCSegment * swapSegment = new MCSegment(topo, (MCNode*)no[1], (MCNode*)no[3] );
188  _mesh->ajouter_mg_segment(swapSegment);
189  M3D_MCTriangle * newTriangle[2];
190  newTriangle[0] = new M3D_MCTriangle(topo, (MCNode*)no[1], (MCNode*)no[2], (MCNode*)no[3], (MCSegment*)seg[1], (MCSegment*)seg[2], swapSegment);
191  newTriangle[0]->change_qualite(crit21);
192  newTriangle[1] = new M3D_MCTriangle(topo, (MCNode*)no[3], (MCNode*)no[0], (MCNode*)no[1], (MCSegment*)seg[3], (MCSegment*)seg[0], swapSegment);
193  newTriangle[1]->change_qualite(crit22);
194  for (int i=0; i<2; i++)_mesh->ajouter_mg_triangle(newTriangle[i]);
195  for (int i=0; i<2; i++)_mesh->supprimer_mg_triangleid(triangle[i]->get_id());
196  _mesh->supprimer_mg_segmentid(__segment->get_id());
197  }
198 
199  return score1;
200 } */
201 
202 
203 double OptimizeEdgeSwap::Swap(MG_SEGMENT *__segment, bool __execute)
204 {
205  double score1;
206  if (__segment->get_lien_triangle()->get_nb() != 2)
207  {
208  return -1;
209  }
210  if (__segment->get_lien_triangle()->get(0)->get_lien_topologie() != __segment->get_lien_triangle()->get(1)->get_lien_topologie())
211  {
212  return -2;
213  }
214  if (__segment->get_lien_topologie()&&__segment->get_lien_topologie()->get_dimension()!=2)
215  {
216  return -3;
217  }
218 
219  MG_TRIANGLE * triangle[2]={__segment->get_lien_triangle()->get(0),__segment->get_lien_triangle()->get(1)};
220  MG_NOEUD * no[4]; // no[]={A,C,B,D} where AB is the segment shared by both triangles AB, C and D nodes opposed to segment AB
221  no[2] = GetStartNode(triangle[0],__segment);
222  no[1] = GetNodeBefore(triangle[0],no[2]);
223  no[0] = GetNodeBefore(triangle[0],no[1]);
224  no[3] = GetNodeBefore(triangle[1],no[0]);
225  MG_SEGMENT * seg[4];
226  seg[0] = _mesh->get_mg_segment(no[0]->get_id(),no[1]->get_id()); // AC
227  seg[1] = _mesh->get_mg_segment(no[1]->get_id(),no[2]->get_id()); // CB
228  seg[2] = _mesh->get_mg_segment(no[2]->get_id(),no[3]->get_id()); // BD
229  seg[3] = _mesh->get_mg_segment(no[3]->get_id(),no[0]->get_id()); // DA
230 
231  MG_NOEUD* tris[2][2][3]={{{no[2],no[3],no[0]},{no[0],no[1],no[2]}}, // triangles of the current configuration
232  {{no[3],no[1],no[2]},{no[1],no[3],no[0]}}}; // triangles of the candidate configuration (after segment swapping)
233 
234 
235  int testOverlapTriangles = CheckOverlapTriangle(tris[1]);
236  if (testOverlapTriangles) return -1;
237 
238  // projection des triangles sur le plan tangent
239  double crit[2][2];
240  double area[2][2];
241  for (int k=0;k<2;k++)
242  for (int i=0;i<2;i++)
243  {
244  OT_VECTEUR_3D normal[4];
245  MCFace * face = (MCFace *)triangle[i]->get_lien_topologie();
246  for (int j=0;j<3;j++)
247  ((MCNode*)tris[k][i][j])->NormalMCFace(face,normal[j]);
248  normal[3] = .3333*(normal[0]+normal[1]+normal[2]);
249  // frame (x,y,n)
250  OT_MATRICE_3D tangentPlane = GeometricTools::GetPlaneFrame(normal[3]);
251  OT_MATRICE_3D trf; tangentPlane.transpose(trf);
252  OT_VECTEUR_3D tpProjNodes[3];
253  for (int j=0;j<3;j++)
254  {
255  OT_VECTEUR_3D p(tris[k][i][j]->get_coord());
256  tpProjNodes[j] = trf*p;
257  // projection --> n component = 0
258  tpProjNodes[j][2] = 0;
259  }
260  crit[k][i]=OPERATEUR::qualite_triangle(tpProjNodes[0],tpProjNodes[1],tpProjNodes[2]);
261  area[k][i]=OT_ALGORITHME_GEOMETRIQUE::Area_Triangle(tpProjNodes[0],tpProjNodes[1],tpProjNodes[2]);
262  }
263  double crit1=std::min(crit[0][0],crit[0][1]);
264  double crit2=std::min(crit[1][0],crit[1][1]);
265 
266  // dist_P[i] = la distance entre la diagonale de la ieme configuration et la MCFace
267  // voir page 110 de these_jfl.pdf
268  double critGeomAccuracy[2];
269  {
270  MG_ELEMENT_TOPOLOGIQUE * topo = __segment->get_lien_triangle()->get(0)->get_lien_topologie() ;
271  MCSegment * AB = (MCSegment*)__segment;
272  MCNode Pgeo;
273  // MCSegment * CD = new MCSegment(topo, (MCNode*)no[1], (MCNode*)no[3] );
274  // CD->evaluer_geo(((area[0][0]*0+area[0][1]*1)/(area[0][0]+area[0][1])),P[0]);
275  {
276  double wA, wB;
277  wA=(AB->get_noeud1() == no[0])?0:1;
278  if(AB->get_orientation() == -1) wA=(wA==0)?1:0;
279  wB=(wA==0)?1:0;
280  AB->evaluer_geo(((area[1][0]*wA+area[1][1]*wB)/(area[1][0]+area[1][1])),&Pgeo);
281  }
282 
283  double P_Euclid[2][3];
284  for (int i=0;i<3;i++) {
285  P_Euclid[1][i]=((area[0][0]*no[1]->get_coord()[i]+area[0][1]*no[3]->get_coord()[i])/(area[0][0]+area[0][1]));
286  P_Euclid[0][i]=((area[1][0]*no[0]->get_coord()[i]+area[1][1]*no[2]->get_coord()[i])/(area[1][0]+area[1][1]));
287  }
288  double distP[2],segLength[2];
289  for (int i=0;i<2;i++)
290  distP[i]=OT_ALGORITHME_GEOMETRIQUE::VEC3_DISTANCE_VEC3(P_Euclid[i],Pgeo.get_coord());
291  for (int i=0;i<2;i++)
292  segLength[i]=OT_ALGORITHME_GEOMETRIQUE::VEC3_DISTANCE_VEC3(no[i]->get_coord(),no[i+2]->get_coord());
293  double maxDistP=.5*std::max(segLength[0],segLength[1]);
294  for (int i=0;i<2;i++)
295  if ( distP[i] < maxDistP )
296  critGeomAccuracy[i] = 1-distP[i]/maxDistP;
297  else
298  critGeomAccuracy[i] = 0;
299  }
300 
301  crit1 += critGeomAccuracy[0];
302  crit2 += critGeomAccuracy[1];
303 
304  if (__execute && crit2 > crit1 )
305  {
306  SwapSegment(__segment);
307  }
308 
309  return (crit2>crit1)?crit2:-1;
310 }
311 
312 
313 MG_NOEUD * OptimizeEdgeSwap::GetStartNode(MG_TRIANGLE *__t, MG_SEGMENT *__s)
314 {
315  MG_NOEUD *TN[3];
316  TN[0] = __t->get_noeud1();
317  TN[1] = __t->get_noeud2();
318  TN[2] = __t->get_noeud3();
319  for (int i=0; i<3; i++)
320  {
321  if (__s->get_noeud1() == TN[i])
322  {
323  if (__s->get_noeud2() == TN[(i+1)%3])
324  return __s->get_noeud1();
325  else
326  return __s->get_noeud2();
327  }
328  }
329  return NULL;
330 }
331 
332 MG_NOEUD * OptimizeEdgeSwap::GetNodeAfter(MG_TRIANGLE *__t, MG_NOEUD *__n)
333 {
334  MG_NOEUD *TN[3];
335  TN[0] = __t->get_noeud1();
336  TN[1] = __t->get_noeud2();
337  TN[2] = __t->get_noeud3();
338  for (int i=0; i<3; i++)
339  {
340  if (TN[i]==__n)
341  return TN[(i+1)%3];
342  }
343  return NULL;
344 }
345 
346 MG_NOEUD * OptimizeEdgeSwap::GetNodeBefore(MG_TRIANGLE *__t, MG_NOEUD *__n)
347 {
348  MG_NOEUD *TN[3];
349  TN[0] = __t->get_noeud1();
350  TN[1] = __t->get_noeud2();
351  TN[2] = __t->get_noeud3();
352  for (int i=0; i<3; i++)
353  {
354  if (TN[i]==__n)
355  return TN[(i+2)%3];
356  }
357  return NULL;
358 }
359 
360 MG_NOEUD * OptimizeEdgeSwap::GetOppositeNode(MG_TRIANGLE *__t, MG_SEGMENT *__s)
361 {
362  MG_NOEUD *TN[3];
363  TN[0] = __t->get_noeud1();
364  TN[1] = __t->get_noeud2();
365  TN[2] = __t->get_noeud3();
366  for (int i=0; i<3; i++)
367  if (TN[i] != __s->get_noeud1() && TN[i] != __s->get_noeud2())
368  return TN[i];
369  return NULL;
370 }
371 
372 void OptimizeEdgeSwap::RemoveVolumeMesh()
373 {
374  LISTE_MG_SEGMENT::iterator itSeg;
375  LISTE_MG_NOEUD::iterator itNo;
376  LISTE_MG_TRIANGLE::iterator itTri;
377  _mesh->supprimer_tout_mg_tetra();
378  for (MG_TRIANGLE * tri = _mesh->get_premier_triangle(itTri);tri; tri = _mesh->get_suivant_triangle(itTri))
379  {
380  if (tri->get_lien_topologie()->get_dimension()==3)
381  _mesh->supprimer_mg_triangleid(tri->get_id());
382  }
383  for (MG_SEGMENT * seg = _mesh->get_premier_segment(itSeg);seg; seg = _mesh->get_suivant_segment(itSeg))
384  {
385  if (seg->get_lien_topologie()->get_dimension()==3)
386  _mesh->supprimer_mg_segmentid(seg->get_id());
387  }
388  for (MG_NOEUD * no = _mesh->get_premier_noeud(itNo);no; no = _mesh->get_suivant_noeud(itNo))
389  {
390  if (no->get_lien_topologie()->get_dimension()==3)
391  _mesh->supprimer_mg_noeudid(no->get_id());
392  }
393 }
394 
395 int OptimizeEdgeSwap::Optimize(MG_FACE * __face)
396 {
397  int nbSwap = 0;
398  LISTE_MG_SEGMENT::iterator itSeg;
399  MG_SEGMENT * seg = _mesh->get_premier_segment(itSeg);
400  std::map<double, MG_SEGMENT*> lst;
401 
402  for (int j=0;j<3;j++)
403  {
404  lst.clear();
405  int tmpnbSwap = nbSwap;
406  for (seg = _mesh->get_premier_segment(itSeg);seg; seg = _mesh->get_suivant_segment(itSeg))
407  {
408  MG_ELEMENT_TOPOLOGIQUE * topo = seg->get_lien_topologie();
409  if (__face != NULL && topo != __face)
410  continue;
411  if (topo->get_dimension()!=2)
412  continue;
413  lst[SwapScore(seg)]=seg;
414  }
415 
416  for (std::map<double, MG_SEGMENT*>::reverse_iterator i=lst.rbegin();i!=lst.rend();i++)
417  {
418  double score1 = i->first;
419  seg=i->second;
420 
421  if (score1<0)
422  break;
423 
424  double score2 = SwapSegment(seg);
425  if (score2 > 0)
426  {
427  nbSwap++;
428  }
429  }
430  if (nbSwap-tmpnbSwap==0)
431  break;
432  }
433 
434  return nbSwap;
435 }
436 
437 int OptimizeEdgeSwap::OptimizeAllFaces()
438 {
439  return Optimize(0);
440 }
441 
CAD4FE::OptimizeEdgeSwap::SwapScore
double SwapScore(MG_SEGMENT *__segment)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:93
MG_TRIANGLE::get_segment1
virtual MG_SEGMENT * get_segment1(void)
Definition: mg_triangle.cpp:142
CAD4FE::OptimizeEdgeSwap::Swap
double Swap(MG_SEGMENT *, bool)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:203
MG_SEGMENT
Definition: mg_segment.h:38
CAD4FE::OptimizeEdgeSwap::GetNodeAfter
MG_NOEUD * GetNodeAfter(MG_TRIANGLE *__t, MG_NOEUD *__n)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:332
MG_MAILLAGE::get_premier_noeud
MG_NOEUD * get_premier_noeud(LISTE_MG_NOEUD::iterator &it)
Definition: mg_maillage.cpp:548
gestionversion.h
CAD4FE::OptimizeEdgeSwap::GetSegmentAfter
MG_SEGMENT * GetSegmentAfter(MG_TRIANGLE *, MG_SEGMENT *)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:53
MG_MAILLAGE::ajouter_mg_segment
MG_SEGMENT * ajouter_mg_segment(MG_ELEMENT_TOPOLOGIQUE *topo, class MG_NOEUD *mgnoeud1, class MG_NOEUD *mgnoeud2, int origine, double longue=0.0, unsigned long num=0)
Definition: mg_maillage.cpp:565
MG_SEGMENT::get_noeud2
virtual MG_NOEUD * get_noeud2(void)
Definition: mg_segment.cpp:113
MG_IDENTIFICATEUR::get_id
unsigned long get_id()
Definition: mg_identificateur.cpp:53
CAD4FE::MCSegment
Definition: CAD4FE_MCSegment.h:50
ot_boite_2d.h
CAD4FE::GeometricTools::GetPlaneFrame
static OT_MATRICE_3D GetPlaneFrame(OT_VECTEUR_3D &__planeNormal)
Definition: CAD4FE_Geometric_Tools.cpp:412
CAD4FE::OptimizeEdgeSwap::OptimizeEdgeSwap
OptimizeEdgeSwap(MG_MAILLAGE *)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:47
MG_MAILLAGE::supprimer_mg_segmentid
int supprimer_mg_segmentid(unsigned long num)
Definition: mg_maillage.cpp:652
CAD4FE::OptimizeEdgeSwap::GetStartNode
MG_NOEUD * GetStartNode(MG_TRIANGLE *__t, MG_SEGMENT *__s)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:313
MG_TRIANGLE::get_segment2
virtual MG_SEGMENT * get_segment2(void)
Definition: mg_triangle.cpp:147
OT_ALGORITHME_GEOMETRIQUE::project_PointTriangle
static int project_PointTriangle(double P0[3], double TV0[3], double TV1[3], double TV2[3], double I[3], double *IT=0)
Definition: ot_algorithme_geometrique.cpp:675
MG_ELEMENT_TOPOLOGIQUE::get_dimension
virtual int get_dimension(void)=0
MG_TRIANGLE
Definition: mg_triangle.h:38
MG_TRIANGLE::get_segment3
virtual MG_SEGMENT * get_segment3(void)
Definition: mg_triangle.cpp:152
OT_MATRICE_3D::transpose
void transpose(OT_MATRICE_3D &res) const
Definition: ot_mathematique.cpp:750
MG_MAILLAGE::get_premier_segment
MG_SEGMENT * get_premier_segment(LISTE_MG_SEGMENT::iterator &)
Definition: mg_maillage.cpp:630
CAD4FE::OptimizeEdgeSwap::_mesh
MG_MAILLAGE * _mesh
Definition: CAD4FE_OptimizeEdgeSwap.h:55
MG_MAILLAGE::supprimer_tout_mg_tetra
void supprimer_tout_mg_tetra(void)
Definition: mg_maillage.cpp:1359
CAD4FE::MCSegment::GetRefFaceMapping
FMap & GetRefFaceMapping()
Definition: CAD4FE_MCSegment.cpp:81
MG_ELEMENT_TOPOLOGIQUE
Definition: mg_element_topologique.h:51
CAD4FE_Intersection_MCSegment_MCSegment.h
CAD4FE_OptimizeEdgeSwap.h
OT_ALGORITHME_GEOMETRIQUE::Area_Triangle
static double Area_Triangle(double TV0[3], double TV1[3], double TV2[3])
Definition: ot_algorithme_geometrique.cpp:754
CAD4FE::OptimizeEdgeSwap::GetOppositeNode
MG_NOEUD * GetOppositeNode(MG_TRIANGLE *__t, MG_SEGMENT *__s)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:360
CAD4FE_MCSegment_Middle.h
MG_MAILLAGE::get_premier_triangle
MG_TRIANGLE * get_premier_triangle(LISTE_MG_TRIANGLE::iterator &it)
Definition: mg_maillage.cpp:912
MG_MAILLAGE::ajouter_mg_triangle
MG_TRIANGLE * ajouter_mg_triangle(MG_ELEMENT_TOPOLOGIQUE *topo, class MG_NOEUD *mgnoeud1, class MG_NOEUD *mgnoeud2, class MG_NOEUD *mgnoeud3, int origine, unsigned long num=0)
Definition: mg_maillage.cpp:731
MG_SEGMENT::get_lien_triangle
TPL_LISTE_ENTITE< class MG_TRIANGLE * > * get_lien_triangle(void)
Definition: mg_segment.cpp:243
MG_SEGMENT::get_noeud1
virtual MG_NOEUD * get_noeud1(void)
Definition: mg_segment.cpp:108
MG_MAILLAGE::supprimer_mg_triangleid
int supprimer_mg_triangleid(unsigned long num)
Definition: mg_maillage.cpp:820
CAD4FE::OptimizeEdgeSwap::GetSegmentBefore
MG_SEGMENT * GetSegmentBefore(MG_TRIANGLE *, MG_SEGMENT *)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:64
CAD4FE::OptimizeEdgeSwap::maxDiedralAngle
double maxDiedralAngle
Definition: CAD4FE_OptimizeEdgeSwap.h:52
MG_NOEUD
Definition: mg_noeud.h:41
OT_MATRICE_3D
Definition: ot_mathematique.h:160
CAD4FE::OptimizeEdgeSwap::CheckOverlapTriangle
int CheckOverlapTriangle(MG_NOEUD *__tri[2][3])
Definition: CAD4FE_OptimizeEdgeSwap.cpp:75
CAD4FE::M3D_MCTriangle
Definition: CAD4FE_m3d_MCTriangle.h:40
MG_MAILLAGE::get_suivant_segment
MG_SEGMENT * get_suivant_segment(LISTE_MG_SEGMENT::iterator &)
Definition: mg_maillage.cpp:638
MG_NOEUD::get_coord
virtual double * get_coord(void)
Definition: mg_noeud.cpp:92
tpl_map_entite.h
TPL_LISTE_ENTITE::get_nb
virtual int get_nb(void)
Definition: tpl_liste_entite.h:67
MG_TRIANGLE::get_noeud2
virtual MG_NOEUD * get_noeud2(void)
Definition: mg_triangle.cpp:131
TPL_LISTE_ENTITE::get
virtual X get(int num)
Definition: tpl_liste_entite.h:72
ot_mathematique.h
CAD4FE_MCSegment.h
CAD4FE::OptimizeEdgeSwap::Optimize
int Optimize(MG_FACE *__face)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:395
CAD4FE::M3D_MCTriangle::change_qualite
virtual void change_qualite(double val)
Definition: CAD4FE_m3d_MCTriangle.cpp:146
MG_MAILLAGE::get_mg_segment
MG_SEGMENT * get_mg_segment(unsigned int num)
Definition: mg_maillage.cpp:619
OT_VECTEUR_3D
Definition: ot_mathematique.h:94
CAD4FE_MCNode.h
CAD4FE::MCSegment::get_orientation
int get_orientation()
Definition: CAD4FE_MCSegment.cpp:146
MG_TRIANGLE::get_noeud1
virtual MG_NOEUD * get_noeud1(void)
Definition: mg_triangle.cpp:126
mg_maillage.h
CAD4FE_Geometric_Tools.h
CAD4FE::OptimizeEdgeSwap::SwapSegment
double SwapSegment(MG_SEGMENT *__segment)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:98
CAD4FE::OptimizeEdgeSwap::RemoveVolumeMesh
void RemoveVolumeMesh()
Definition: CAD4FE_OptimizeEdgeSwap.cpp:372
CAD4FE_m3d_MCTriangle.h
MG_MAILLAGE::supprimer_mg_noeudid
int supprimer_mg_noeudid(unsigned long num)
Definition: mg_maillage.cpp:482
MG_ELEMENT_MAILLAGE::get_lien_topologie
MG_ELEMENT_TOPOLOGIQUE * get_lien_topologie(void)
Definition: mg_element_maillage.cpp:51
ot_algorithme_geometrique.h
OPERATEUR::qualite_triangle
static double qualite_triangle(double *noeud1, double *noeud2, double *noeud3)
Definition: ot_mathematique.cpp:1647
MG_TRIANGLE::get_noeud3
virtual MG_NOEUD * get_noeud3(void)
Definition: mg_triangle.cpp:137
CAD4FE
Definition: CAD4FE_ClosestPoint_Segment_MG_ARETE.h:34
MG_MAILLAGE::get_suivant_triangle
MG_TRIANGLE * get_suivant_triangle(LISTE_MG_TRIANGLE::iterator &it)
Definition: mg_maillage.cpp:920
MG_MAILLAGE
Definition: mg_maillage.h:62
CAD4FE::MCNode
Definition: CAD4FE_MCNode.h:47
res
#define res(i, j)
CAD4FE::OptimizeEdgeSwap::OptimizeAllFaces
int OptimizeAllFaces()
Definition: CAD4FE_OptimizeEdgeSwap.cpp:437
MG_FACE
Definition: mg_face.h:34
CAD4FE::MCFace
Definition: CAD4FE_MCFace.h:50
MG_MAILLAGE::get_suivant_noeud
MG_NOEUD * get_suivant_noeud(LISTE_MG_NOEUD::iterator &it)
Definition: mg_maillage.cpp:556
OT_ALGORITHME_GEOMETRIQUE::VEC3_DISTANCE_VEC3
static double VEC3_DISTANCE_VEC3(double a[3], double b[3])
Definition: ot_algorithme_geometrique.h:127
CAD4FE::MCSegment::evaluer_geo
void evaluer_geo(double __t, MCNode *__result, double *tangent=0, double *curvature=0)
Definition: CAD4FE_MCSegment.cpp:119
CAD4FE::OptimizeEdgeSwap::GetNodeBefore
MG_NOEUD * GetNodeBefore(MG_TRIANGLE *__t, MG_NOEUD *__n)
Definition: CAD4FE_OptimizeEdgeSwap.cpp:346