| 1 |
//------------------------------------------------------------
|
| 2 |
//------------------------------------------------------------
|
| 3 |
// MAGiC
|
| 4 |
// Jean Christophe Cuilli�re et Vincent FRANCOIS
|
| 5 |
// D�partement de G�nie M�canique - UQTR
|
| 6 |
//------------------------------------------------------------
|
| 7 |
// Le projet MAGIC est un projet de recherche du d�partement
|
| 8 |
// de g�nie m�canique de l'Universit� du Qu�bec �
|
| 9 |
// Trois Rivi�res
|
| 10 |
// Les librairies ne peuvent �tre utilis�es sans l'accord
|
| 11 |
// des auteurs (contact : francois@uqtr.ca)
|
| 12 |
//------------------------------------------------------------
|
| 13 |
//------------------------------------------------------------
|
| 14 |
//
|
| 15 |
// mailleur.cpp
|
| 16 |
//
|
| 17 |
//------------------------------------------------------------
|
| 18 |
//------------------------------------------------------------
|
| 19 |
// COPYRIGHT 2000
|
| 20 |
// Version du 02/03/2006 � 11H23
|
| 21 |
//------------------------------------------------------------
|
| 22 |
//------------------------------------------------------------
|
| 23 |
|
| 24 |
|
| 25 |
#include "gestionversion.h"
|
| 26 |
#include "mailleur_delaunay.h"
|
| 27 |
#include "mailleur3d_optimisation.h"
|
| 28 |
#include "dly_noeud.h"
|
| 29 |
#include "dly_tetra.h"
|
| 30 |
#include "dly_triangle.h"
|
| 31 |
#include "dly_segment.h"
|
| 32 |
#include "mg_maillage.h"
|
| 33 |
#include "robustPredicates.h"
|
| 34 |
#include <algorithm>
|
| 35 |
#include <math.h>
|
| 36 |
#include "mg_gestionnaire.h"
|
| 37 |
#include "ot_cpu.h"
|
| 38 |
#include "m3d_noeud.h"
|
| 39 |
#include "m3d_tetra.h"
|
| 40 |
#include "const.h"
|
| 41 |
|
| 42 |
|
| 43 |
|
| 44 |
MAILLEUR_DELAUNAY::MAILLEUR_DELAUNAY(MG_MAILLAGE* m,FCT_GENERATEUR_3D<4> *cartetmp,double crit_arret,class OT_CPU* comp):MAILLEUR(comp),carte(cartetmp),mai(m),critere_arret(crit_arret),niveau_optimisation(2)
|
| 45 |
{
|
| 46 |
robustPredicates::exactinit();
|
| 47 |
}
|
| 48 |
|
| 49 |
MAILLEUR_DELAUNAY::~MAILLEUR_DELAUNAY()
|
| 50 |
{
|
| 51 |
for (int i=0;i<tabnoeud.size();i++)
|
| 52 |
delete tabnoeud[i];
|
| 53 |
for (int i=0;i<tabtri.size();i++)
|
| 54 |
delete tabtri[i];
|
| 55 |
for (int i=0;i<tabtet.size();i++)
|
| 56 |
delete tabtet[i];
|
| 57 |
}
|
| 58 |
|
| 59 |
void MAILLEUR_DELAUNAY::maille(class MG_GROUPE_TOPOLOGIQUE* mggt)
|
| 60 |
{
|
| 61 |
affiche("Initialisation Delaunay");
|
| 62 |
initialise_maillage();
|
| 63 |
if (compteur!=NULL) compteur->ajouter_etape("Initialisation maillage");
|
| 64 |
|
| 65 |
affiche("Maillage");
|
| 66 |
raffine_maillage();
|
| 67 |
if (compteur!=NULL) compteur->ajouter_etape("Insertion de points");
|
| 68 |
|
| 69 |
affiche("Création du maillage final");
|
| 70 |
transfert_maillage(&tabnoeud,NULL,&tabtet);
|
| 71 |
if (compteur!=NULL) compteur->ajouter_etape("Création du maillage");
|
| 72 |
|
| 73 |
|
| 74 |
affiche("Optimisation de maillage");
|
| 75 |
MAILLEUR3D_OPTIMISATION opt(mai,niveau_optimisation);
|
| 76 |
opt.active_affichage(affiche2);
|
| 77 |
opt.optimise(NULL);
|
| 78 |
if (compteur!=NULL) compteur->ajouter_etape("Optimisation du maillage");
|
| 79 |
affiche("Fin Delaunay");
|
| 80 |
}
|
| 81 |
|
| 82 |
void MAILLEUR_DELAUNAY::change_niveau_optimisation(int num)
|
| 83 |
{
|
| 84 |
niveau_optimisation=num;
|
| 85 |
}
|
| 86 |
|
| 87 |
void MAILLEUR_DELAUNAY::raffine_maillage(void)
|
| 88 |
{
|
| 89 |
while ((*(front_trie.begin())).first>critere_arret)
|
| 90 |
//for (int jj=0;jj<10000;jj++)
|
| 91 |
{
|
| 92 |
// std::multimap<double, DLY_TETRA*, std::greater<double> >::iterator it=front.begin();
|
| 93 |
std::multimap<double, DLY_SEGMENT*, std::greater<double> >::iterator it=front_trie.begin();
|
| 94 |
//DLY_TETRA* tet=(*it).second;
|
| 95 |
DLY_SEGMENT* seg=(*it).second;
|
| 96 |
DLY_TETRA* tet=seg->get_tetra_feuille();
|
| 97 |
std::vector<double> lstptdecoup;
|
| 98 |
seg->decoupe_noeud(lstptdecoup);
|
| 99 |
int nbptdecoup=lstptdecoup.size()/3;
|
| 100 |
for (int j=0;j<nbptdecoup;j++)
|
| 101 |
{
|
| 102 |
double x=lstptdecoup[3*j];
|
| 103 |
double y=lstptdecoup[3*j+1];
|
| 104 |
double z=lstptdecoup[3*j+2];
|
| 105 |
DLY_TETRA* tetbase=get_tetra(tet,x,y,z);
|
| 106 |
std::vector<DLY_TETRA*> tetdetruit;
|
| 107 |
std::vector<DLY_TETRA*> tetcree;
|
| 108 |
std::vector<DLY_TRIANGLE*> basetri;
|
| 109 |
ajoute_tetra_cavite(tetbase,tetdetruit,basetri);
|
| 110 |
for (int i=0;i<tetdetruit.size();i++)
|
| 111 |
{
|
| 112 |
DLY_TETRA* tettmp=tetdetruit[i];
|
| 113 |
if (tettmp->get_voisin1()!=NULL)
|
| 114 |
{
|
| 115 |
std::vector<DLY_TETRA*>::iterator itv2=find(tetdetruit.begin(),tetdetruit.end(),tettmp->get_voisin1());
|
| 116 |
if (itv2==tetdetruit.end())
|
| 117 |
if (tettmp->get_voisin1()->point_dans_le_tetra(x,y,z)!=0)
|
| 118 |
ajoute_tetra_cavite(tettmp->get_voisin1(),tetdetruit,basetri);
|
| 119 |
}
|
| 120 |
if (tettmp->get_voisin2()!=NULL)
|
| 121 |
{
|
| 122 |
std::vector<DLY_TETRA*>::iterator itv2=find(tetdetruit.begin(),tetdetruit.end(),tettmp->get_voisin2());
|
| 123 |
if (itv2==tetdetruit.end())
|
| 124 |
if (tettmp->get_voisin2()->point_dans_le_tetra(x,y,z)!=0)
|
| 125 |
ajoute_tetra_cavite(tettmp->get_voisin2(),tetdetruit,basetri);
|
| 126 |
}
|
| 127 |
if (tettmp->get_voisin3()!=NULL)
|
| 128 |
{
|
| 129 |
std::vector<DLY_TETRA*>::iterator itv2=find(tetdetruit.begin(),tetdetruit.end(),tettmp->get_voisin3());
|
| 130 |
if (itv2==tetdetruit.end())
|
| 131 |
if (tettmp->get_voisin3()->point_dans_le_tetra(x,y,z)!=0)
|
| 132 |
ajoute_tetra_cavite(tettmp->get_voisin3(),tetdetruit,basetri);
|
| 133 |
}
|
| 134 |
if (tettmp->get_voisin4()!=NULL)
|
| 135 |
{
|
| 136 |
std::vector<DLY_TETRA*>::iterator itv2=find(tetdetruit.begin(),tetdetruit.end(),tettmp->get_voisin4());
|
| 137 |
if (itv2==tetdetruit.end())
|
| 138 |
if (tettmp->get_voisin4()->point_dans_le_tetra(x,y,z)!=0)
|
| 139 |
ajoute_tetra_cavite(tettmp->get_voisin4(),tetdetruit,basetri);
|
| 140 |
}
|
| 141 |
}
|
| 142 |
int nbtetrabase=tetdetruit.size();
|
| 143 |
for (int i=0;i<tetdetruit.size();i++)
|
| 144 |
{
|
| 145 |
DLY_TETRA* tettmp=tetdetruit[i];
|
| 146 |
if (tettmp->get_voisin1()!=NULL)
|
| 147 |
{
|
| 148 |
std::vector<DLY_TETRA*>::iterator itv2=find(tetdetruit.begin(),tetdetruit.end(),tettmp->get_voisin1());
|
| 149 |
if (itv2==tetdetruit.end())
|
| 150 |
if (tettmp->get_voisin1()->point_dans_la_sphere(x,y,z)!=0)
|
| 151 |
ajoute_tetra_cavite(tettmp->get_voisin1(),tetdetruit,basetri);
|
| 152 |
}
|
| 153 |
if (tettmp->get_voisin2()!=NULL)
|
| 154 |
{
|
| 155 |
std::vector<DLY_TETRA*>::iterator itv2=find(tetdetruit.begin(),tetdetruit.end(),tettmp->get_voisin2());
|
| 156 |
if (itv2==tetdetruit.end())
|
| 157 |
if (tettmp->get_voisin2()->point_dans_la_sphere(x,y,z)!=0)
|
| 158 |
ajoute_tetra_cavite(tettmp->get_voisin2(),tetdetruit,basetri);
|
| 159 |
}
|
| 160 |
if (tettmp->get_voisin3()!=NULL)
|
| 161 |
{
|
| 162 |
std::vector<DLY_TETRA*>::iterator itv2=find(tetdetruit.begin(),tetdetruit.end(),tettmp->get_voisin3());
|
| 163 |
if (itv2==tetdetruit.end())
|
| 164 |
if (tettmp->get_voisin3()->point_dans_la_sphere(x,y,z)!=0)
|
| 165 |
ajoute_tetra_cavite(tettmp->get_voisin3(),tetdetruit,basetri);
|
| 166 |
}
|
| 167 |
if (tettmp->get_voisin4()!=NULL)
|
| 168 |
{
|
| 169 |
std::vector<DLY_TETRA*>::iterator itv2=find(tetdetruit.begin(),tetdetruit.end(),tettmp->get_voisin4());
|
| 170 |
if (itv2==tetdetruit.end())
|
| 171 |
if (tettmp->get_voisin4()->point_dans_la_sphere(x,y,z)!=0)
|
| 172 |
ajoute_tetra_cavite(tettmp->get_voisin4(),tetdetruit,basetri);
|
| 173 |
}
|
| 174 |
}
|
| 175 |
|
| 176 |
|
| 177 |
|
| 178 |
|
| 179 |
int res=0;
|
| 180 |
do
|
| 181 |
{
|
| 182 |
res=modifie_cavite(tetdetruit,basetri,nbtetrabase,x,y,z);
|
| 183 |
}
|
| 184 |
while (res==0);
|
| 185 |
|
| 186 |
|
| 187 |
|
| 188 |
|
| 189 |
for (int i=0;i<tetdetruit.size();i++)
|
| 190 |
{
|
| 191 |
/*std::multimap<double, DLY_TETRA*, std::greater<double> >::iterator it2=front.find(tetdetruit[i]->get_critere_subdivision());
|
| 192 |
while ((*it2).second!=tetdetruit[i])
|
| 193 |
it2++;
|
| 194 |
front.erase(it2);*/
|
| 195 |
retirer_front(tetdetruit[i]->get_segment1());
|
| 196 |
retirer_front(tetdetruit[i]->get_segment2());
|
| 197 |
retirer_front(tetdetruit[i]->get_segment3());
|
| 198 |
retirer_front(tetdetruit[i]->get_segment4());
|
| 199 |
retirer_front(tetdetruit[i]->get_segment5());
|
| 200 |
retirer_front(tetdetruit[i]->get_segment6());
|
| 201 |
|
| 202 |
}
|
| 203 |
DLY_NOEUD* no=new DLY_NOEUD(tabnoeud.size(),x,y,z);
|
| 204 |
tabnoeud.push_back(no);
|
| 205 |
for (int i=0;i<basetri.size();i++)
|
| 206 |
{
|
| 207 |
int frontiere=basetri[i]->est_frontiere();
|
| 208 |
int coplanaire=basetri[i]->est_coplanaire(no->get_x(),no->get_y(),no->get_z());
|
| 209 |
if ((frontiere==0) || ((frontiere==1) && (coplanaire==0)))
|
| 210 |
{
|
| 211 |
DLY_TETRA* tetnv=cree_tetra(basetri[i]->get_noeud1(),basetri[i]->get_noeud2(),basetri[i]->get_noeud3(),no);
|
| 212 |
tetcree.push_back(tetnv);
|
| 213 |
}
|
| 214 |
}
|
| 215 |
double volold=0.;
|
| 216 |
double volnew=0.;
|
| 217 |
/*for (int i=0;i<tetdetruit.size();i++)
|
| 218 |
volold=volold+tetdetruit[i]->calcul_volume(NULL,0);
|
| 219 |
for (int i=0;i<tetcree.size();i++)
|
| 220 |
volnew=volnew+tetcree[i]->calcul_volume(NULL,0);
|
| 221 |
if (fabs(volold-volnew)>0.000000000001*volold)
|
| 222 |
//std::cout << volold << " remplacé par " << volnew << " Étape " << jj << " " << j << std::endl;
|
| 223 |
*/
|
| 224 |
for (int i=0;i<tetdetruit.size();i++)
|
| 225 |
tetdetruit[i]->ajoute_fils(tetcree);
|
| 226 |
for (int i=0;i<tetcree.size();i++)
|
| 227 |
{
|
| 228 |
mise_a_jour_voisin(tetcree[i]);
|
| 229 |
if (tetcree[i]->get_voisin1()!=NULL) mise_a_jour_voisin(tetcree[i]->get_voisin1());
|
| 230 |
if (tetcree[i]->get_voisin2()!=NULL) mise_a_jour_voisin(tetcree[i]->get_voisin2());
|
| 231 |
if (tetcree[i]->get_voisin3()!=NULL) mise_a_jour_voisin(tetcree[i]->get_voisin3());
|
| 232 |
if (tetcree[i]->get_voisin4()!=NULL) mise_a_jour_voisin(tetcree[i]->get_voisin4());
|
| 233 |
}
|
| 234 |
/* for (int i=0;i<tabtet.size();i++)
|
| 235 |
{
|
| 236 |
DLY_TETRA* tet=tabtet[i];
|
| 237 |
if (tet->get_feuille()==0) continue;
|
| 238 |
if (tet->get_voisin1()!=NULL)
|
| 239 |
if (tet->get_voisin1()->get_feuille()==0)
|
| 240 |
{
|
| 241 |
std::cout << "bug1 " << jj << " "<< j<< std::endl;
|
| 242 |
return;
|
| 243 |
}
|
| 244 |
if (tet->get_voisin2()!=NULL)
|
| 245 |
if (tet->get_voisin2()->get_feuille()==0)
|
| 246 |
{
|
| 247 |
std::cout << "bug2 " << jj << " "<< j<< std::endl;
|
| 248 |
return;
|
| 249 |
}
|
| 250 |
if (tet->get_voisin3()!=NULL)
|
| 251 |
if (tet->get_voisin3()->get_feuille()==0)
|
| 252 |
{
|
| 253 |
std::cout << "bug3 "<< jj << " "<< j << std::endl;
|
| 254 |
return;
|
| 255 |
}
|
| 256 |
if (tet->get_voisin4()!=NULL)
|
| 257 |
if (tet->get_voisin4()->get_feuille()==0)
|
| 258 |
{
|
| 259 |
std::cout << "bug4 "<< jj << " "<< j << std::endl;
|
| 260 |
return;
|
| 261 |
}
|
| 262 |
|
| 263 |
}*/
|
| 264 |
/* mai=new MG_MAILLAGE(NULL);
|
| 265 |
MG_GESTIONNAIRE g;
|
| 266 |
g.ajouter_mg_maillage(mai);
|
| 267 |
transfert_maillage(&tabnoeud,NULL,&tabtet);
|
| 268 |
g.enregistrer("test.magic");*/
|
| 269 |
|
| 270 |
}
|
| 271 |
}
|
| 272 |
}
|
| 273 |
|
| 274 |
void MAILLEUR_DELAUNAY::ajouter_front(double crit,DLY_SEGMENT* seg)
|
| 275 |
{
|
| 276 |
if (crit>critere_arret)
|
| 277 |
{
|
| 278 |
std::pair<const unsigned long long,DLY_SEGMENT*> tmp((const unsigned long long)seg,seg);
|
| 279 |
std::pair<std::map<const unsigned long long,DLY_SEGMENT*>::iterator,bool> res=front.insert(tmp);
|
| 280 |
if (res.second==true)
|
| 281 |
{
|
| 282 |
seg->change_critere(crit);
|
| 283 |
std::pair<double,DLY_SEGMENT*> tmp2(crit,seg);
|
| 284 |
front_trie.insert(tmp2);
|
| 285 |
}
|
| 286 |
}
|
| 287 |
}
|
| 288 |
void MAILLEUR_DELAUNAY::retirer_front(DLY_SEGMENT* seg)
|
| 289 |
{
|
| 290 |
std::map<const unsigned long long,DLY_SEGMENT*>::iterator it=front.find((const unsigned long long)seg);
|
| 291 |
if (it==front.end()) return;
|
| 292 |
front.erase(it);
|
| 293 |
std::multimap<double,DLY_SEGMENT*,std::greater<double> >::iterator it2=front_trie.find(seg->get_critere());
|
| 294 |
while ((*it2).second!=seg)
|
| 295 |
it2++;
|
| 296 |
front_trie.erase(it2);
|
| 297 |
}
|
| 298 |
int MAILLEUR_DELAUNAY::modifie_cavite(std::vector<DLY_TETRA*> &cavite,std::vector<DLY_TRIANGLE*> &basetri,int nbbase,double x, double y,double z)
|
| 299 |
{
|
| 300 |
std::map<unsigned long long,DLY_TETRA*> tetasupprimercavite;
|
| 301 |
for (int i=0;i<basetri.size();i++)
|
| 302 |
{
|
| 303 |
DLY_TRIANGLE* tri=basetri[i];
|
| 304 |
DLY_TETRA* inte=NULL;
|
| 305 |
DLY_TETRA* exte=NULL;
|
| 306 |
for (int j=0;j<tri->get_nb_tetra();j++)
|
| 307 |
{
|
| 308 |
DLY_TETRA* tet=tri->get_tetra(j);
|
| 309 |
if (tet->get_feuille()==1)
|
| 310 |
{
|
| 311 |
std::vector<DLY_TETRA*>::iterator it=find(cavite.begin(),cavite.end(),tet);
|
| 312 |
if (it==cavite.end()) exte=tet;
|
| 313 |
else inte=tet;
|
| 314 |
}
|
| 315 |
}
|
| 316 |
double nor[3];
|
| 317 |
int base=0;
|
| 318 |
for (int j=0;j<nbbase;j++)
|
| 319 |
if (inte==cavite[j]) base=1;
|
| 320 |
if (base==1) continue;
|
| 321 |
if (inte->get_triangle1()==tri) inte->get_normal1(nor);
|
| 322 |
if (inte->get_triangle2()==tri) inte->get_normal2(nor);
|
| 323 |
if (inte->get_triangle3()==tri) inte->get_normal3(nor);
|
| 324 |
if (inte->get_triangle4()==tri) inte->get_normal4(nor);
|
| 325 |
nor[0]=-nor[0];
|
| 326 |
nor[1]=-nor[1];
|
| 327 |
nor[2]=-nor[2];
|
| 328 |
double xyzo[3];
|
| 329 |
tri->get_noeud1()->get_coord(xyzo);
|
| 330 |
OT_VECTEUR_3D vecdir(x-xyzo[0],y-xyzo[1],z-xyzo[2]);
|
| 331 |
OT_VECTEUR_3D normal(nor);
|
| 332 |
vecdir.norme();
|
| 333 |
double ps=vecdir*normal;
|
| 334 |
if (ps<0.000000001)
|
| 335 |
{
|
| 336 |
tri->est_frontiere();
|
| 337 |
//retire_tetra_cavite(inte,cavite,basetri);
|
| 338 |
unsigned long long adresse=(unsigned long long)inte;
|
| 339 |
tetasupprimercavite.insert(std::pair<unsigned long long,DLY_TETRA*>(adresse,inte));
|
| 340 |
|
| 341 |
}
|
| 342 |
}
|
| 343 |
int nbtetasupprimer=tetasupprimercavite.size();
|
| 344 |
if (nbtetasupprimer==0) return 1;
|
| 345 |
for (std::map<unsigned long long,DLY_TETRA*>::iterator it=tetasupprimercavite.begin();it!=tetasupprimercavite.end();it++)
|
| 346 |
retire_tetra_cavite((*it).second,cavite,basetri);
|
| 347 |
|
| 348 |
return 0;
|
| 349 |
}
|
| 350 |
|
| 351 |
|
| 352 |
void MAILLEUR_DELAUNAY::retire_tetra_cavite(DLY_TETRA* tet,std::vector<DLY_TETRA*> &cavite,std::vector<DLY_TRIANGLE*> &basetri)
|
| 353 |
{
|
| 354 |
std::vector<DLY_TETRA*>::iterator it=find(cavite.begin(),cavite.end(),tet);
|
| 355 |
cavite.erase(it);
|
| 356 |
std::vector<DLY_TRIANGLE*>::iterator itv=find(basetri.begin(),basetri.end(),tet->get_triangle1());
|
| 357 |
if (itv==basetri.end()) basetri.push_back(tet->get_triangle1());
|
| 358 |
else basetri.erase(itv);
|
| 359 |
itv=find(basetri.begin(),basetri.end(),tet->get_triangle2());
|
| 360 |
if (itv==basetri.end()) basetri.push_back(tet->get_triangle2());
|
| 361 |
else basetri.erase(itv);
|
| 362 |
itv=find(basetri.begin(),basetri.end(),tet->get_triangle3());
|
| 363 |
if (itv==basetri.end()) basetri.push_back(tet->get_triangle3());
|
| 364 |
else basetri.erase(itv);
|
| 365 |
itv=find(basetri.begin(),basetri.end(),tet->get_triangle4());
|
| 366 |
if (itv==basetri.end()) basetri.push_back(tet->get_triangle4());
|
| 367 |
else basetri.erase(itv);
|
| 368 |
}
|
| 369 |
|
| 370 |
void MAILLEUR_DELAUNAY::ajoute_tetra_cavite(DLY_TETRA* tet,std::vector<DLY_TETRA*> &cavite,std::vector<DLY_TRIANGLE*> &basetri)
|
| 371 |
{
|
| 372 |
cavite.push_back(tet);
|
| 373 |
std::vector<DLY_TRIANGLE*>::iterator itv=find(basetri.begin(),basetri.end(),tet->get_triangle1());
|
| 374 |
if (itv==basetri.end()) basetri.push_back(tet->get_triangle1());
|
| 375 |
else basetri.erase(itv);
|
| 376 |
itv=find(basetri.begin(),basetri.end(),tet->get_triangle2());
|
| 377 |
if (itv==basetri.end()) basetri.push_back(tet->get_triangle2());
|
| 378 |
else basetri.erase(itv);
|
| 379 |
itv=find(basetri.begin(),basetri.end(),tet->get_triangle3());
|
| 380 |
if (itv==basetri.end()) basetri.push_back(tet->get_triangle3());
|
| 381 |
else basetri.erase(itv);
|
| 382 |
itv=find(basetri.begin(),basetri.end(),tet->get_triangle4());
|
| 383 |
if (itv==basetri.end()) basetri.push_back(tet->get_triangle4());
|
| 384 |
else basetri.erase(itv);
|
| 385 |
}
|
| 386 |
|
| 387 |
void MAILLEUR_DELAUNAY::initialise_maillage(void)
|
| 388 |
{
|
| 389 |
double param[32];
|
| 390 |
int nb_cellule=carte->get_nb_cellule();
|
| 391 |
carte->get_information(0,0,param);
|
| 392 |
double xmin=param[0]+0.005*(param[1]-param[0]);
|
| 393 |
double ymin=param[8]+0.005*(param[10]-param[8]);
|
| 394 |
double zmin=param[16]+0.005*(param[20]-param[16]);
|
| 395 |
carte->get_information(nb_cellule-1,0,param);
|
| 396 |
double xmax=param[1]-0.005*(param[1]-param[0]);
|
| 397 |
double ymax=param[10]-0.005*(param[10]-param[8]);
|
| 398 |
double zmax=param[20]-0.005*(param[20]-param[16]);
|
| 399 |
DLY_NOEUD* no1=new DLY_NOEUD(tabnoeud.size(),xmin,ymin,zmin);
|
| 400 |
tabnoeud.push_back(no1);
|
| 401 |
DLY_NOEUD* no2=new DLY_NOEUD(tabnoeud.size(),xmin,ymax,zmin);
|
| 402 |
tabnoeud.push_back(no2);
|
| 403 |
DLY_NOEUD* no3=new DLY_NOEUD(tabnoeud.size(),xmax,ymax,zmin);
|
| 404 |
tabnoeud.push_back(no3);
|
| 405 |
DLY_NOEUD* no4=new DLY_NOEUD(tabnoeud.size(),xmax,ymin,zmin);
|
| 406 |
tabnoeud.push_back(no4);
|
| 407 |
DLY_NOEUD* no5=new DLY_NOEUD(tabnoeud.size(),xmin,ymin,zmax);
|
| 408 |
tabnoeud.push_back(no5);
|
| 409 |
DLY_NOEUD* no6=new DLY_NOEUD(tabnoeud.size(),xmin,ymax,zmax);
|
| 410 |
tabnoeud.push_back(no6);
|
| 411 |
DLY_NOEUD* no7=new DLY_NOEUD(tabnoeud.size(),xmax,ymax,zmax);
|
| 412 |
tabnoeud.push_back(no7);
|
| 413 |
DLY_NOEUD* no8=new DLY_NOEUD(tabnoeud.size(),xmax,ymin,zmax);
|
| 414 |
tabnoeud.push_back(no8);
|
| 415 |
DLY_TETRA* tet1=cree_tetra(no2,no1,no3,no6);
|
| 416 |
DLY_TETRA* tet2=cree_tetra(no3,no1,no4,no5);
|
| 417 |
DLY_TETRA* tet3=cree_tetra(no3,no1,no5,no6);
|
| 418 |
DLY_TETRA* tet4=cree_tetra(no8,no5,no7,no4);
|
| 419 |
DLY_TETRA* tet5=cree_tetra(no7,no5,no6,no3);
|
| 420 |
DLY_TETRA* tet6=cree_tetra(no4,no3,no5,no7);
|
| 421 |
mise_a_jour_voisin(tet1);
|
| 422 |
mise_a_jour_voisin(tet2);
|
| 423 |
mise_a_jour_voisin(tet3);
|
| 424 |
mise_a_jour_voisin(tet4);
|
| 425 |
mise_a_jour_voisin(tet5);
|
| 426 |
mise_a_jour_voisin(tet6);
|
| 427 |
char message[255];
|
| 428 |
sprintf(message," Volume espace : %lf",(xmax-xmin)*(ymax-ymin)*(zmax-zmin));
|
| 429 |
if (affichageactif) affiche(message);
|
| 430 |
}
|
| 431 |
void MAILLEUR_DELAUNAY::mise_a_jour_voisin(DLY_TETRA* tet)
|
| 432 |
{
|
| 433 |
int nb=tet->get_triangle1()->get_nb_tetra();
|
| 434 |
for (int i=0;i<nb;i++)
|
| 435 |
{
|
| 436 |
DLY_TETRA* tetmp=tet->get_triangle1()->get_tetra(i);
|
| 437 |
if (tetmp->get_feuille()==1)
|
| 438 |
if (tetmp!=tet) tet->change_voisin1(tetmp);
|
| 439 |
}
|
| 440 |
nb=tet->get_triangle2()->get_nb_tetra();
|
| 441 |
for (int i=0;i<nb;i++)
|
| 442 |
{
|
| 443 |
DLY_TETRA* tetmp=tet->get_triangle2()->get_tetra(i);
|
| 444 |
if (tetmp->get_feuille()==1)
|
| 445 |
if (tetmp!=tet) tet->change_voisin2(tetmp);
|
| 446 |
}
|
| 447 |
nb=tet->get_triangle3()->get_nb_tetra();
|
| 448 |
for (int i=0;i<nb;i++)
|
| 449 |
{
|
| 450 |
DLY_TETRA* tetmp=tet->get_triangle3()->get_tetra(i);
|
| 451 |
if (tetmp->get_feuille()==1)
|
| 452 |
if (tetmp!=tet) tet->change_voisin3(tetmp);
|
| 453 |
}
|
| 454 |
nb=tet->get_triangle4()->get_nb_tetra();
|
| 455 |
for (int i=0;i<nb;i++)
|
| 456 |
{
|
| 457 |
DLY_TETRA* tetmp=tet->get_triangle4()->get_tetra(i);
|
| 458 |
if (tetmp->get_feuille()==1)
|
| 459 |
if (tetmp!=tet) tet->change_voisin4(tetmp);
|
| 460 |
}
|
| 461 |
}
|
| 462 |
|
| 463 |
|
| 464 |
DLY_TETRA* MAILLEUR_DELAUNAY::cree_tetra(DLY_NOEUD* n1,DLY_NOEUD* n2,DLY_NOEUD* n3,DLY_NOEUD* n4)
|
| 465 |
{
|
| 466 |
double xyz1[3],xyz2[3],xyz3[3],xyz4[3];
|
| 467 |
n1->get_coord(xyz1);
|
| 468 |
n2->get_coord(xyz2);
|
| 469 |
n3->get_coord(xyz3);
|
| 470 |
n4->get_coord(xyz4);
|
| 471 |
double qual=OPERATEUR::qualite_tetra(xyz1,xyz2,xyz3,xyz4);
|
| 472 |
DLY_TETRA* tet;
|
| 473 |
if (!(qual>0.))
|
| 474 |
{
|
| 475 |
DLY_NOEUD* ntmp=n1;
|
| 476 |
n1=n2;
|
| 477 |
n2=ntmp;
|
| 478 |
}
|
| 479 |
tet=new DLY_TETRA(n1,n2,n3,n4,fabs(qual));
|
| 480 |
tabtet.push_back(tet);
|
| 481 |
tet->change_triangle1(get_triangle(n1,n2,n3));
|
| 482 |
tet->change_triangle2(get_triangle(n1,n2,n4));
|
| 483 |
tet->change_triangle3(get_triangle(n1,n3,n4));
|
| 484 |
tet->change_triangle4(get_triangle(n2,n3,n4));
|
| 485 |
tet->change_segment1(get_segment(n1,n2));
|
| 486 |
tet->change_segment2(get_segment(n1,n3));
|
| 487 |
tet->change_segment3(get_segment(n1,n4));
|
| 488 |
tet->change_segment4(get_segment(n2,n3));
|
| 489 |
tet->change_segment5(get_segment(n2,n4));
|
| 490 |
tet->change_segment6(get_segment(n3,n4));
|
| 491 |
// std::pair<double,DLY_TETRA*> tmp(tet->get_critere_subdivision(),tet);
|
| 492 |
ajouter_front(tet->get_segment1()->calcul_longueur(carte,1),tet->get_segment1());
|
| 493 |
ajouter_front(tet->get_segment2()->calcul_longueur(carte,1),tet->get_segment2());
|
| 494 |
ajouter_front(tet->get_segment3()->calcul_longueur(carte,1),tet->get_segment3());
|
| 495 |
ajouter_front(tet->get_segment4()->calcul_longueur(carte,1),tet->get_segment4());
|
| 496 |
ajouter_front(tet->get_segment5()->calcul_longueur(carte,1),tet->get_segment5());
|
| 497 |
ajouter_front(tet->get_segment6()->calcul_longueur(carte,1),tet->get_segment6());
|
| 498 |
return tet;
|
| 499 |
}
|
| 500 |
DLY_SEGMENT* MAILLEUR_DELAUNAY::get_segment(DLY_NOEUD* n1,DLY_NOEUD* n2)
|
| 501 |
{
|
| 502 |
|
| 503 |
DLY_NOEUD* no;
|
| 504 |
if (n1->get_num()<n2->get_num()) no=n1;
|
| 505 |
else no=n2;
|
| 506 |
DLY_SEGMENT* seg=no->get_lien_segment(n1,n2);
|
| 507 |
if (seg==NULL)
|
| 508 |
{
|
| 509 |
seg=new DLY_SEGMENT(n1,n2);
|
| 510 |
tabseg.push_back(seg);
|
| 511 |
no->insere_lien_segment(seg);
|
| 512 |
}
|
| 513 |
return seg;
|
| 514 |
}
|
| 515 |
|
| 516 |
DLY_TRIANGLE* MAILLEUR_DELAUNAY::get_triangle(DLY_NOEUD* n1,DLY_NOEUD* n2,DLY_NOEUD* n3)
|
| 517 |
{
|
| 518 |
DLY_NOEUD* no;
|
| 519 |
if (n1->get_num()<n2->get_num()) no=n1;
|
| 520 |
else no=n2;
|
| 521 |
if (n3->get_num()<no->get_num()) no=n3;
|
| 522 |
DLY_TRIANGLE* tri=no->get_lien_triangle(n1,n2,n3);
|
| 523 |
if (tri==NULL)
|
| 524 |
{
|
| 525 |
tri=new DLY_TRIANGLE(n1,n2,n3);
|
| 526 |
tabtri.push_back(tri);
|
| 527 |
no->insere_lien_triangle(tri);
|
| 528 |
}
|
| 529 |
return tri;
|
| 530 |
}
|
| 531 |
|
| 532 |
|
| 533 |
DLY_TETRA* MAILLEUR_DELAUNAY::get_tetra(double x,double y,double z)
|
| 534 |
{
|
| 535 |
DLY_TETRA* tet;
|
| 536 |
tet=get_tetra(tabtet[0],x,y,z);
|
| 537 |
if (tet!=NULL) return tet;
|
| 538 |
tet=get_tetra(tabtet[1],x,y,z);
|
| 539 |
if (tet!=NULL) return tet;
|
| 540 |
tet=get_tetra(tabtet[2],x,y,z);
|
| 541 |
if (tet!=NULL) return tet;
|
| 542 |
tet=get_tetra(tabtet[3],x,y,z);
|
| 543 |
if (tet!=NULL) return tet;
|
| 544 |
tet=get_tetra(tabtet[4],x,y,z);
|
| 545 |
if (tet!=NULL) return tet;
|
| 546 |
tet=get_tetra(tabtet[5],x,y,z);
|
| 547 |
if (tet!=NULL) return tet;
|
| 548 |
return NULL;
|
| 549 |
}
|
| 550 |
|
| 551 |
DLY_TETRA* MAILLEUR_DELAUNAY::get_tetra(DLY_TETRA* tet,double x,double y,double z)
|
| 552 |
{
|
| 553 |
if (tet->point_dans_le_tetra(x,y,z))
|
| 554 |
{
|
| 555 |
if (tet->get_feuille()==1) return tet;
|
| 556 |
int nb=tet->get_nb_fils();
|
| 557 |
for (int i=0;i<nb;i++)
|
| 558 |
{
|
| 559 |
DLY_TETRA* tetrep=get_tetra(tet->get_fils(i),x,y,z);
|
| 560 |
if (tetrep!=NULL) return tetrep;
|
| 561 |
}
|
| 562 |
}
|
| 563 |
return NULL;
|
| 564 |
}
|
| 565 |
|
| 566 |
|
| 567 |
void MAILLEUR_DELAUNAY::transfert_maillage(std::vector<DLY_NOEUD*> *tabn,std::vector<DLY_TRIANGLE*> *tabe2d,std::vector<DLY_TETRA*> *tabe3d)
|
| 568 |
{
|
| 569 |
for (int i=0;i<tabn->size();i++)
|
| 570 |
{
|
| 571 |
DLY_NOEUD *no=(*tabn)[i];
|
| 572 |
M3D_NOEUD* noeud=new M3D_NOEUD(NULL,no->get_x(),no->get_y(),no->get_z(),MAILLEUR_AUTO);
|
| 573 |
mai->ajouter_mg_noeud(noeud);
|
| 574 |
no->change_noeud(noeud);
|
| 575 |
noeud->etat_actif();
|
| 576 |
}
|
| 577 |
if (tabe2d!=NULL)
|
| 578 |
{
|
| 579 |
for (int i=0;i<tabe2d->size();i++)
|
| 580 |
{
|
| 581 |
DLY_TRIANGLE* tri=(*tabe2d)[i];
|
| 582 |
if (tri->est_frontiere())
|
| 583 |
MG_TRIANGLE *mgtri=mai->ajouter_mg_triangle(NULL,tri->get_noeud1()->get_noeud(),tri->get_noeud2()->get_noeud(),tri->get_noeud3()->get_noeud(),MAILLEUR_AUTO);
|
| 584 |
}
|
| 585 |
}
|
| 586 |
else
|
| 587 |
{
|
| 588 |
double vol=0.;
|
| 589 |
double nbmaitheo=0;
|
| 590 |
for (int i=0;i<tabe3d->size();i++)
|
| 591 |
{
|
| 592 |
DLY_TETRA* tet=(*tabe3d)[i];
|
| 593 |
if (tet->get_feuille()==1)
|
| 594 |
{
|
| 595 |
MG_TRIANGLE* mgtriangle1=mai->get_mg_triangle(tet->get_noeud1()->get_noeud()->get_id(),tet->get_noeud3()->get_noeud()->get_id(),tet->get_noeud2()->get_noeud()->get_id());
|
| 596 |
MG_TRIANGLE* mgtriangle2=mai->get_mg_triangle(tet->get_noeud1()->get_noeud()->get_id(),tet->get_noeud2()->get_noeud()->get_id(),tet->get_noeud4()->get_noeud()->get_id());
|
| 597 |
MG_TRIANGLE* mgtriangle3=mai->get_mg_triangle(tet->get_noeud2()->get_noeud()->get_id(),tet->get_noeud3()->get_noeud()->get_id(),tet->get_noeud4()->get_noeud()->get_id());
|
| 598 |
MG_TRIANGLE* mgtriangle4=mai->get_mg_triangle(tet->get_noeud1()->get_noeud()->get_id(),tet->get_noeud4()->get_noeud()->get_id(),tet->get_noeud3()->get_noeud()->get_id());
|
| 599 |
if (mgtriangle1==NULL) mgtriangle1=mai->ajouter_mg_triangle(NULL,tet->get_noeud1()->get_noeud(),tet->get_noeud3()->get_noeud(),tet->get_noeud2()->get_noeud(),MAILLEUR_AUTO);
|
| 600 |
if (mgtriangle2==NULL) mgtriangle2=mai->ajouter_mg_triangle(NULL,tet->get_noeud1()->get_noeud(),tet->get_noeud2()->get_noeud(),tet->get_noeud4()->get_noeud(),MAILLEUR_AUTO);
|
| 601 |
if (mgtriangle3==NULL) mgtriangle3=mai->ajouter_mg_triangle(NULL,tet->get_noeud2()->get_noeud(),tet->get_noeud3()->get_noeud(),tet->get_noeud4()->get_noeud(),MAILLEUR_AUTO);
|
| 602 |
if (mgtriangle4==NULL) mgtriangle4=mai->ajouter_mg_triangle(NULL,tet->get_noeud1()->get_noeud(),tet->get_noeud4()->get_noeud(),tet->get_noeud3()->get_noeud(),MAILLEUR_AUTO);
|
| 603 |
M3D_TETRA* mgtet=mgtet=new M3D_TETRA(NULL,tet->get_noeud1()->get_noeud(),tet->get_noeud2()->get_noeud(),tet->get_noeud3()->get_noeud(),tet->get_noeud4()->get_noeud(),mgtriangle1,mgtriangle2,mgtriangle3,mgtriangle4,MAILLEUR_AUTO);
|
| 604 |
mai->ajouter_mg_tetra(mgtet);
|
| 605 |
int tabnoeud[4]={0,0,0,0};
|
| 606 |
if (tet->get_triangle1()->est_frontiere()) {tabnoeud[0]=1;tabnoeud[1]=1;tabnoeud[2]=1;}
|
| 607 |
if (tet->get_triangle2()->est_frontiere()) {tabnoeud[0]=1;tabnoeud[1]=1;tabnoeud[3]=1;}
|
| 608 |
if (tet->get_triangle3()->est_frontiere()) {tabnoeud[0]=1;tabnoeud[2]=1;tabnoeud[3]=1;}
|
| 609 |
if (tet->get_triangle4()->est_frontiere()) {tabnoeud[1]=1;tabnoeud[2]=1;tabnoeud[3]=1;}
|
| 610 |
if (tabnoeud[0]==1) ((M3D_NOEUD*)mgtet->get_noeud1())->etat_inactif();
|
| 611 |
if (tabnoeud[1]==1) ((M3D_NOEUD*)mgtet->get_noeud2())->etat_inactif();
|
| 612 |
if (tabnoeud[2]==1) ((M3D_NOEUD*)mgtet->get_noeud3())->etat_inactif();
|
| 613 |
if (tabnoeud[3]==1) ((M3D_NOEUD*)mgtet->get_noeud4())->etat_inactif();
|
| 614 |
|
| 615 |
vol=vol+tet->calcul_volume(NULL,0);
|
| 616 |
nbmaitheo=nbmaitheo+tet->calcul_volume(carte,0);
|
| 617 |
}
|
| 618 |
}
|
| 619 |
LISTE_MG_SEGMENT::iterator it;
|
| 620 |
for (MG_SEGMENT *seg=mai->get_premier_segment(it);seg;seg=mai->get_suivant_segment(it))
|
| 621 |
{
|
| 622 |
M3D_NOEUD* no1=(M3D_NOEUD*)seg->get_noeud1();
|
| 623 |
M3D_NOEUD* no2=(M3D_NOEUD*)seg->get_noeud2();
|
| 624 |
seg->change_dimension_topo_null(3);
|
| 625 |
if (no1->get_etat()==INACTIF)
|
| 626 |
if (no2->get_etat()==INACTIF)
|
| 627 |
{
|
| 628 |
OT_VECTEUR_3D vec(no1->get_coord(),no2->get_coord());
|
| 629 |
vec.norme();
|
| 630 |
OT_VECTEUR_3D vecx(1.,0.,0.);
|
| 631 |
OT_VECTEUR_3D vecy(0.,1.,0.);
|
| 632 |
OT_VECTEUR_3D vecz(0.,0.,1.);
|
| 633 |
if (fabs(vecx*vec)<1e-10) seg->change_dimension_topo_null(2);
|
| 634 |
else if (fabs(vecy*vec)<1e-10) seg->change_dimension_topo_null(2);
|
| 635 |
else if (fabs(vecz*vec)<1e-10) seg->change_dimension_topo_null(2);
|
| 636 |
}
|
| 637 |
|
| 638 |
}
|
| 639 |
char message[255];
|
| 640 |
sprintf(message," Volume maille : %lf",vol);
|
| 641 |
if (affichageactif) affiche(message);
|
| 642 |
nbmaitheo=12.*nbmaitheo/sqrt(2);
|
| 643 |
double erreur=nbmaitheo-mai->get_nb_mg_tetra();
|
| 644 |
erreur=erreur/mai->get_nb_mg_tetra();
|
| 645 |
sprintf(message," Nombre de maille theorique : %d, Nombre de maille pratique %d, erreur %.2lf%%",(int)nbmaitheo,mai->get_nb_mg_tetra(),erreur);
|
| 646 |
if (affichageactif) affiche(message);
|
| 647 |
}
|
| 648 |
|
| 649 |
}
|
| 650 |
|
| 651 |
|
| 652 |
int MAILLEUR_DELAUNAY::est_de_delaunay(void)
|
| 653 |
{
|
| 654 |
for (int i=0;i<tabtet.size();i++)
|
| 655 |
{
|
| 656 |
DLY_TETRA* tet=tabtet[i];
|
| 657 |
for (int j=0;j<tabnoeud.size();j++)
|
| 658 |
{
|
| 659 |
DLY_NOEUD* no=tabnoeud[j];
|
| 660 |
if (no!=tet->get_noeud1())
|
| 661 |
if (no!=tet->get_noeud2())
|
| 662 |
if (no!=tet->get_noeud3())
|
| 663 |
if (no!=tet->get_noeud4())
|
| 664 |
{
|
| 665 |
int num=tet->point_dans_la_sphere(no->get_x(),no->get_y(),no->get_z()>1);
|
| 666 |
if (num>1)
|
| 667 |
return 0;
|
| 668 |
|
| 669 |
}
|
| 670 |
}
|
| 671 |
}
|
| 672 |
return 1;
|
| 673 |
}
|
