CAD4FE/src/CAD4FE_mailleur2d.cpp

//------------------------------------------------------------
//------------------------------------------------------------
//  MAGiC
//  Jean Christophe Cuillière et Vincent FRANCOIS
//  Département de Génie Mécanique - UQTR
//------------------------------------------------------------
//  Le projet MAGIC est un projet de recherche du département
//  de génie mécanique de l'Université du Québec à
//  Trois Rivières
//  Les librairies ne peuvent être utilisées sans l'accord
//  des auteurs (contact : francois@uqtr.ca)
//------------------------------------------------------------
//------------------------------------------------------------
//
//       mailleur2d.cpp
//
//------------------------------------------------------------
//------------------------------------------------------------
//  COPYRIGHT 2000
//  Version du 02/03/2006 à 11H23
//------------------------------------------------------------
//------------------------------------------------------------


#include "gestionversion.h"
#include "CAD4FE_mailleur2d.h"
#include "ot_mathematique.h"
//#include "message.h"
//#include "affiche.h"
#include <fstream>
#include <math.h>
#include <time.h>

#include <CAD4FE_MCEdge.h>   
#include <CAD4FE_PolyCurve.h>
#include <CAD4FE_MCVertex.h>
#include "CAD4FE_geometric_tools.h"
#include "CAD4FE_InventorText_MG_MAILLAGE.h"
#include "CAD4FE_InventorText_MCSegment.h"
#include "CAD4FE_OptimizeEdgeSwap.h"

using namespace CAD4FE;

MAILLEUR2D::MAILLEUR2D(MG_MAILLAGE* mgmai,MG_GEOMETRIE *mggeo,MCFace* __mcFace,FCT_TAILLE* fct_taille):MAILLEUR(),mg_maillage(mgmai),mg_geometrie(mggeo),_mcFace(__mcFace),metrique(fct_taille)
{
    strcpy(filenameNbTriangles,getenv("TEMP"));
    strcat(filenameNbTriangles,"CAD4FE_mailleur2d.txt");
}


MAILLEUR2D::~MAILLEUR2D()
{
}


void MAILLEUR2D::maille(void)
{
if (_mcFace!=NULL) maille(_mcFace);
else
 {
// Il faudrait mailler les MC Face de la géométrie :
// A faire : une fonction qui parcours les MCFace de la géométrie  
/* int nb_face=mg_geometrie->get_nb_mg_face();
 for (int i=0;i<nb_face;i++)
     {
     MG_FACE* mgface=mg_geometrie->get_mg_face(i);
     maille(mgface);
     }             */
 }
}

void MAILLEUR2D::maille(MCFace * __mcFace)
{
creation_metrique=0;
lst_tri_qual.clear();
//afficheur << MAILLAGEFACE << mgface->get_id() << endaff;
initialise_frontiere(__mcFace);
cree_grille(__mcFace);
initialise_front(__mcFace);

if (metrique==NULL)
   {
        printf("Mailleur2D::Maille --> Abandon: \nLa fonction carte de taille doit être spécifiée !\n");
        return; 
   }
progresse_front(__mcFace);
export_ivanim_all_faces();
    if (debug){
        char filename1[5000];
        strcpy(filename1,getenv("TEMP"));
        strcat(filename1,"\\void_2D.mai");
        ofstream o4(filename1,ios::out|ios::trunc);
        o4.precision(16);
        o4.setf(ios::showpoint);
        mg_maillage->enregistrer_sous_mesh_2D(o4);

        std::ofstream file;
        char filename2[5000];
        strcpy(filename2,getenv("TEMP"));
        strcat(filename2,"\\CAD4FE_Mesher.iv");
        file.open(filename2);
        CAD4FE::InventorText_MG_MAILLAGE ivTextRefTess (mg_maillage);
        ivTextRefTess.ShowFaceSegments = true;
        ivTextRefTess.ShowSegmentId = false;
        ivTextRefTess.ShowTriangleId = false;
        ivTextRefTess.ShowNodeId = false;
        ivTextRefTess.InverseTriangleNormals = true;
        ivTextRefTess.TriangleColor=1;
        file << ivTextRefTess.GetText();
        file << "\n}\n";
        file.close();
    }        
      if ( 0 )
      {
          std::ofstream file;
          char filename2[5000];
          strcpy(filename2,getenv("TEMP"));
          strcat(filename2,"\\CAD4FE_Mesher_MCSegments.iv");
          file.open(filename2);
          InventorText_MG_MAILLAGE meshIvText (mg_maillage);
          meshIvText.ShowFaceSegments = true;
          meshIvText.ShowSegmentId = true;
          meshIvText.ShowTriangleId = true;
          meshIvText.ShowNodeId = true;
          meshIvText.InverseTriangleNormals = true;
          meshIvText.TriangleColor=1;
          file<<meshIvText.GetText();

          file <<  "DrawStyle {\nstyle LINES\nlineWidth 2\npointSize 3\n}\n";
          LISTE_MG_SEGMENT::iterator itSegment;
          for (MG_SEGMENT * seg = mg_maillage->get_premier_segment(itSegment); seg; seg = mg_maillage->get_suivant_segment(itSegment))
          {
              if (seg->get_lien_topologie()->get_dimension() == 1)
                  file << "BaseColor { \n rgb   0.0 0.0 0.9\n }\n";
              if (seg->get_lien_topologie()->get_dimension() == 2)
                  file << "BaseColor { \n rgb   0.0 0.0 0.0\n }\n";
              MCSegment * mcSeg = (MCSegment *) seg;
              InventorText_MCSegment mcSegTxt (mcSeg);
              file << mcSegTxt.GetText();
          }
        
          file << "\n}\n";
          file.close();
      }
    
optimise_bascule_segment(__mcFace);
optimise(__mcFace);

    {
         std::ofstream file(filenameNbTriangles);
         file.clear();
         file.flush();
         file.close();
     }


if (creation_metrique==1)
   {
      delete metrique;
      metrique=NULL;
   }
delete grille_de_segment;
delete grille_de_frontiere;
delete grille_de_front;
segment_frontiere.vide();
noeud_frontiere.vide();
//ofstream o3("test_2D.mai",ios::out|ios::trunc);
//o3.precision(16);
//o3.setf(ios::showpoint);
//mg_maillage->enregistrer_sous_mesh_2D(o3);
}

void MAILLEUR2D::export_ivanim()
{                              
        MG_MAILLAGE * _mesh = mg_maillage;

        std::string filename = "c:\\gilles\\out_";
        filename += std::string(_mcFace->get_idoriginal())+".ivanim";

        std::ofstream out(filename.c_str());
        float sleepTime = .1;

        out << "sleepTime " << sleepTime<<" \n";
        out << "groupTriang 5 \n";

        std::set <MG_ARETE*> lst_mg_edges;
        std::set <MG_SOMMET*> lst_mg_vertices;
        unsigned nb_loop = _mcFace->get_nb_mg_boucle();
        for (unsigned it_loop = 0; it_loop < nb_loop; it_loop++)
        {
                MG_BOUCLE * loop = _mcFace->get_mg_boucle(it_loop);
                unsigned nb_edge = loop->get_nb_mg_coarete();

                for (unsigned it_edge = 0; it_edge < nb_edge; it_edge++)
                {
                        MG_ARETE * edge = (MG_ARETE*)loop->get_mg_coarete(it_edge)->get_arete();
                        lst_mg_edges.insert(edge);

                        lst_mg_vertices.insert ((MG_SOMMET*)edge->get_cosommet1()->get_sommet());
                        lst_mg_vertices.insert ((MG_SOMMET*)edge->get_cosommet2()->get_sommet());
                }
        }
                              
        LISTE_MG_TRIANGLE::iterator itTriang;
        std::set <MG_NOEUD*>lst_mg_noeud;
        for (MG_TRIANGLE * triangle = _mesh->get_premier_triangle(itTriang); triangle; triangle = _mesh->get_suivant_triangle(itTriang))
        {
            if (triangle->get_lien_topologie() == NULL || triangle->get_lien_topologie()->get_dimension() > 2
            || (MG_FACE*)triangle->get_lien_topologie() != _mcFace)
                continue;

            MG_NOEUD * nos[3]={triangle->get_noeud1(),triangle->get_noeud2(),triangle->get_noeud3()};
            for (int i=0; i<3; i++)
            {
                MG_NOEUD * no = nos[i];
                if (lst_mg_noeud.find(no) == lst_mg_noeud.end())
                {
                    lst_mg_noeud.insert(no);
                    out << "add coord " << no->get_id() ;
                    out << " " << no->get_x();
                    out << " " << no->get_y() ;
                    out << " " << no->get_z() << " \n";
                }
            }
        }

        LISTE_MG_NOEUD::iterator itNo;
        int i=0;
        for (MG_NOEUD * no = _mesh->get_premier_noeud(itNo); no; no=_mesh->get_suivant_noeud(itNo))
        {
            if (lst_mg_noeud.find(no) == lst_mg_noeud.end())
            {
                if (no->get_lien_topologie() != NULL && no->get_lien_topologie()->get_dimension() == 0
                    && lst_mg_vertices.find((MG_SOMMET*)no->get_lien_topologie()) != lst_mg_vertices.end())
                    out << "add node " << no->get_id()<<" \n";
            }
        }


        LISTE_MG_SEGMENT::iterator itSegment;
        for (MG_SEGMENT * seg = _mesh->get_premier_segment(itSegment); seg; seg = _mesh->get_suivant_segment(itSegment))
        {
            if (seg->get_lien_topologie() == NULL || seg->get_lien_topologie()->get_dimension() != 1 ||
                lst_mg_edges.find((MG_ARETE*)seg->get_lien_topologie()) == lst_mg_edges.end())
                continue;
            out << "add segment " << seg->get_id() << " ";
            out << seg->get_noeud1()->get_id() << " ";
            out << seg->get_noeud2()->get_id() << " \n";
        }

        for (MG_TRIANGLE * triangle = _mesh->get_premier_triangle(itTriang); triangle; triangle = _mesh->get_suivant_triangle(itTriang))
        {
            if (triangle->get_lien_topologie() == NULL || triangle->get_lien_topologie()->get_dimension() > 2
            || (MG_FACE*)triangle->get_lien_topologie() != _mcFace)
                continue;
            out << "add triangle " << triangle->get_id() << " ";
            out << triangle->get_noeud1()->get_id() << " ";
            out << triangle->get_noeud3()->get_id() << " ";
            out << triangle->get_noeud2()->get_id() << " \n";
        }
/*

void MAILLEUR2D::export_ivanim2()
        for (std::set <MG_ARETE*>::iterator it_mg_edges = lst_mg_edges.begin(); it_mg_edges != lst_mg_edges.end(); it_mg_edges++)
        {
            MG_ARETE * edge  = *it_mg_edges;
            TPL_SET<MG_ELEMENT_MAILLAGE*> * lien_maillage = edge->get_lien_maillage();
            TPL_SET<MG_ELEMENT_MAILLAGE*>::ITERATEUR it;
            MG_ELEMENT_MAILLAGE* element;
            int nb = lien_maillage->get_nb();
            int i=0;
            for (element = lien_maillage->get_premier(it); i++ < nb && element ; element = lien_maillage->get_suivant(it) )
            {
                MG_SEGMENT * seg = (MG_SEGMENT *)element;
                if (mg_maillage->contient(seg) == 0) continue;
                out << "add segment " << seg->get_id() << " ";
                out << seg->get_noeud1()->get_id() << " ";
                out << seg->get_noeud2()->get_id() << " \n";
            }
        }

        for (std::set <MG_SOMMET*>::iterator it_mg_vertices = lst_mg_vertices.begin(); it_mg_vertices != lst_mg_vertices.end(); it_mg_vertices++)
        {
            MG_SOMMET * vertex  = *it_mg_vertices;
            TPL_SET<MG_ELEMENT_MAILLAGE*> * lien_maillage = vertex->get_lien_maillage();
            TPL_SET<MG_ELEMENT_MAILLAGE*>::ITERATEUR it;
            MG_ELEMENT_MAILLAGE* element;
            int nb = lien_maillage->get_nb();
            int i=0;
            for (element = lien_maillage->get_premier(it); i++ < nb && element ; element = lien_maillage->get_suivant(it) )
            {
                MG_NOEUD * node = (MG_NOEUD *)element;
                if (mg_maillage->contient(node) == 0) continue;
            }
        }   */
        /*
        std::map < MG_NOEUD * , unsigned int > indices;
        LISTE_MG_NOEUD::iterator itNo;
        int i=0;
        for (MG_NOEUD * no = _mesh->get_premier_noeud(itNo); no; no=_mesh->get_suivant_noeud(itNo))
        {
                out << "add coord " << no->get_id() ;
                out << " " << no->get_x();
                out << " " << no->get_y() ;
                out << " " << no->get_z() << " \n";
                if (no->get_lien_topologie() != NULL && no->get_lien_topologie()->get_dimension() == 0)
                    out << "add node " << no->get_id()<<" \n";
        }

        LISTE_MG_SEGMENT::iterator itSegment;
        for (MG_SEGMENT * seg = _mesh->get_premier_segment(itSegment); seg; seg = _mesh->get_suivant_segment(itSegment))
        {
            if (seg->get_lien_topologie() == NULL || seg->get_lien_topologie()->get_dimension() != 1)
                continue;
            out << "add segment " << seg->get_id() << " ";
            out << seg->get_noeud1()->get_id() << " ";
            out << seg->get_noeud2()->get_id() << " \n";
        }      */

       /*LISTE_MG_TRIANGLE::iterator itTriang;
        for (MG_TRIANGLE * triangle = _mesh->get_premier_triangle(itTriang); triangle; triangle = _mesh->get_suivant_triangle(itTriang))
        {
            if (triangle->get_lien_topologie() == NULL || triangle->get_lien_topologie()->get_dimension() > 2)
                continue;
            out << "add triangle " << triangle->get_id() << " ";
            out << triangle->get_noeud1()->get_id() << " ";
            out << triangle->get_noeud3()->get_id() << " ";
            out << triangle->get_noeud2()->get_id() << " \n";
        }              */

        out.close();
}


void MAILLEUR2D::export_ivanim_all_faces()
{
        MG_MAILLAGE * _mesh = mg_maillage;

        std::ofstream out("c:\\gilles\\out.ivanim");
        float sleepTime = .1;

        out << "sleepTime " << sleepTime<<" \n";
        out << "groupTriang 5 \n";

        std::map < MG_NOEUD * , unsigned int > indices;
        LISTE_MG_NOEUD::iterator itNo;
        int i=0;
        for (MG_NOEUD * no = _mesh->get_premier_noeud(itNo); no; no=_mesh->get_suivant_noeud(itNo))
        {
                out << "add coord " << no->get_id() ;
                out << " " << no->get_x();
                out << " " << no->get_y() ;
                out << " " << no->get_z() << " \n";
                if (no->get_lien_topologie() != NULL && no->get_lien_topologie()->get_dimension() == 0)
                    out << "add node " << no->get_id()<<" \n";
        }

        LISTE_MG_SEGMENT::iterator itSegment;
        for (MG_SEGMENT * seg = _mesh->get_premier_segment(itSegment); seg; seg = _mesh->get_suivant_segment(itSegment))
        {
            if (seg->get_lien_topologie() == NULL || seg->get_lien_topologie()->get_dimension() != 1)
                continue;
            out << "add segment " << seg->get_id() << " ";
            out << seg->get_noeud1()->get_id() << " ";
            out << seg->get_noeud2()->get_id() << " \n";
        }

        LISTE_MG_TRIANGLE::iterator itTriang;
        for (MG_TRIANGLE * triangle = _mesh->get_premier_triangle(itTriang); triangle; triangle = _mesh->get_suivant_triangle(itTriang))
        {
            if (triangle->get_lien_topologie() == NULL || triangle->get_lien_topologie()->get_dimension() > 2)
                continue;
            out << "add triangle " << triangle->get_id() << " ";
            out << triangle->get_noeud1()->get_id() << " ";
            out << triangle->get_noeud3()->get_id() << " ";
            out << triangle->get_noeud2()->get_id() << " \n";
        }

        out.close();
}

void MAILLEUR2D::initialise_frontiere(MCFace* __mcFace)
{
int nb_boucle=__mcFace->get_nb_mg_boucle();
for (int i=0;i<nb_boucle;i++)
 {
 MG_BOUCLE* mgboucle=__mcFace->get_mg_boucle(i);
 int nb_coarete=mgboucle->get_nb_mg_coarete();
 for (int j=0;j<nb_coarete;j++)
    {
       MG_COARETE* coarete=mgboucle->get_mg_coarete(j);
       MCEdge* mgarete=(MCEdge*)coarete->get_arete();
       int nb_segment=mgarete->get_lien_maillage()->get_nb();
       for (int k=0;k<nb_segment;k++)
          {
          refresh();
          MG_SEGMENT* mgsegment=(MG_SEGMENT*)mgarete->get_lien_maillage()->get(k);
          MG_SEGMENT* mgsegtemp=(MG_SEGMENT*)mg_maillage->get_mg_segmentid(mgsegment->get_id());
          if (mgsegtemp==NULL) continue;
          MCSegment * mcSegment = (MCSegment*) mgsegment;
          MCNode* mcNode=(MCNode*)mcSegment->get_noeud1();
          segment_frontiere.ajouter(mcSegment);
          noeud_frontiere.ajouter(mcNode);
          mcNode=(MCNode*)mcSegment->get_noeud2();
          if (!noeud_frontiere.est_dans_la_liste(mcNode));
                {
                noeud_frontiere.ajouter(mcNode);
                }
          }

    }
 }


}

void MAILLEUR2D::cree_grille(MCFace* __mcFace)
{
    double bounding_box[6]={1E308,1E308,1E308,-1E308,-1E308,-1E308};
    TPL_SET<MG_ELEMENT_MAILLAGE*>::ITERATEUR itElem;
    for (MG_ELEMENT_MAILLAGE* elem = __mcFace->get_lien_maillage()->get_premier(itElem);
        elem; elem = __mcFace->get_lien_maillage()->get_suivant(itElem))
    {
        MG_TRIANGLE * triang = (MG_TRIANGLE *) elem;
        MG_NOEUD * n[3];
        n[0] = triang->get_noeud1();
        n[1] = triang->get_noeud2();
        n[2] = triang->get_noeud3();
        for (unsigned int i=0; i<3; i++)
        {
            for (unsigned int j=0; j<3; j++)
            {
                if (n[i]->get_coord()[j] < bounding_box[j])
                    bounding_box[j] = n[i]->get_coord()[j];
                if (n[i]->get_coord()[j] > bounding_box[j+3])
                    bounding_box[j+3] = n[i]->get_coord()[j];
            }
        }
    }

    double xyz_taille [3];
    for (unsigned int i=0; i<3; i++)
        xyz_taille[i] = (bounding_box[i]+bounding_box[i+3])*.5;

    double taille;
    double density_tensor[9];
    metrique->evaluer(xyz_taille, density_tensor);
    taille = pow(density_tensor[0],-0.5);
    
    int nb_cellule[3];
    for (unsigned i = 0; i < 3; i++)
        {
                double taille_cellule = taille;

                if ( taille_cellule != 0 )
                    nb_cellule[i] = (bounding_box[i+3]-bounding_box[i])/taille_cellule;
                else
                    nb_cellule[i] = 1;
                
                if (nb_cellule[i] == 0)
                    nb_cellule[i] ++;
        }

    const double NB_MAX_CELL = 200000;
    double alpha = NB_MAX_CELL / (nb_cellule[0]*nb_cellule[1]*nb_cellule[2]);
    if (alpha < 1)
    {
        for (unsigned i = 0; i < 3; i++)
        {
            nb_cellule[i] = (int)((double)nb_cellule[i])*pow(alpha,.33);
            if ( nb_cellule[i] == 0 )
                nb_cellule[i] = 1;
        }
        printf("Nb cells = %d\n", nb_cellule[0]*nb_cellule[1]*nb_cellule[2]);
    }

    // increase grid's size by 100% of mesh size
    for (int i=0; i<3; i++)
        bounding_box[i] -= taille*1.0;
    for (int i=0; i<3; i++)
        bounding_box[i+3] += taille*1.0;

    grille_de_segment = new TPL_GRILLE<MCSegment*>;
    grille_de_segment->initialiser(bounding_box[0], bounding_box[1], bounding_box[2], bounding_box[3], bounding_box[4], bounding_box[5], nb_cellule[0], nb_cellule[1], nb_cellule[2]);
    grille_de_frontiere = new TPL_GRILLE<MCSegment*>;
    grille_de_frontiere->initialiser(bounding_box[0], bounding_box[1], bounding_box[2], bounding_box[3], bounding_box[4], bounding_box[5], nb_cellule[0], nb_cellule[1], nb_cellule[2]);
    grille_de_front = new TPL_GRILLE<MG_FRONT_2D*>;
    grille_de_front->initialiser(bounding_box[0], bounding_box[1], bounding_box[2], bounding_box[3], bounding_box[4], bounding_box[5], nb_cellule[0], nb_cellule[1], nb_cellule[2]);
}

void MAILLEUR2D::initialise_front(MCFace* __mcFace)
{
std::set<MCVertex*> isolatedInteriorVertices;
MG_FRONT_2D::initialise_compteur_id();
int nb_boucle=__mcFace->get_nb_mg_boucle();
for (int iboucle=0;iboucle<nb_boucle;iboucle++)
        {
        unsigned int nb_front_avant_cette_boucle=get_nb_front(front_courant);
        MG_BOUCLE* mgboucle=__mcFace->get_mg_boucle(iboucle);
        unsigned int nbcoaretetotale=mgboucle->get_nb_mg_coarete();
        MG_COARETE* mgcoarete=mgboucle->get_mg_coarete(0);
        MCNode* noeud_de_depart;
        int bon_noeud=0;
        int numnoeud=0;
        while (bon_noeud==0)
                {
                if (mgcoarete->get_orientation()==MEME_SENS) noeud_de_depart=(MCNode*)mgcoarete->get_arete()->get_cosommet1()->get_sommet()->get_lien_maillage()->get(numnoeud);
                else noeud_de_depart=(MCNode*)mgcoarete->get_arete()->get_cosommet2()->get_sommet()->get_lien_maillage()->get(numnoeud);
                MG_NOEUD* noeudtemp=mg_maillage->get_mg_noeudid(noeud_de_depart->get_id());
                if (noeudtemp==NULL) numnoeud++; else bon_noeud=1;
                }
        MG_FRONT_2D* premier_front;
        MCNode* noeud_courant=noeud_de_depart;
        MCSegment* segment_courant=NULL;
        MG_FRONT_2D* front_precedent=NULL;
        unsigned int nbcoaretetraite=0;

        if (nbcoaretetotale == 1 ) // this edge is a point isolated in the domain of a face
        {
            MCEdge * mcEdge = (MCEdge*)mgboucle->get_mg_coarete(0)->get_arete();
            if (mcEdge->GetPolyCurve()->get_longueur() == 0)
            {
                isolatedInteriorVertices.insert( (MCVertex*) mcEdge->get_cosommet1()->get_sommet() );
                continue;
            }
        }


        do
        {
           nbcoaretetraite++;    
           MCNode* noeud_d_arrivee;
           int bon_noeud=0;
           int numnoeud=0;
           while (bon_noeud==0)
                {
                if (mgcoarete->get_orientation()==MEME_SENS) noeud_d_arrivee=(MCNode*)mgcoarete->get_arete()->get_cosommet2()->get_sommet()->get_lien_maillage()->get(numnoeud);
                else noeud_d_arrivee=(MCNode*)mgcoarete->get_arete()->get_cosommet1()->get_sommet()->get_lien_maillage()->get(numnoeud);
                MG_NOEUD* noeudtemp=mg_maillage->get_mg_noeudid(noeud_d_arrivee->get_id());
                if (noeudtemp==NULL) numnoeud++; else bon_noeud=1;
                }
          MCEdge* mgarete=(MCEdge*)mgcoarete->get_arete();   
           segment_courant=NULL;
           int passe_aretefermee=0;
           do
               {
                  int trouve=0;
                  int i;
                  if ((mgcoarete->get_arete()->get_cosommet1()->get_sommet()==mgcoarete->get_arete()->get_cosommet2()->get_sommet())&&(passe_aretefermee==0))
                          {
                          passe_aretefermee=1;
                          MCSegment* mgsegment_depart1=NULL;
                          MCSegment* mgsegment_depart2=NULL;
                          TPL_SET<MG_ELEMENT_MAILLAGE*>::ITERATEUR it;
                          MCSegment* mgsegment=(MCSegment*)mgarete->get_lien_maillage()->get_premier(it);
                          do
                                  {
                                  if ((mgsegment->get_noeud1()==noeud_courant) || (mgsegment->get_noeud2()==noeud_courant)) mgsegment_depart1=mgsegment;
                                  mgsegment=(MCSegment*)mgarete->get_lien_maillage()->get_suivant(it);
                                  }
                          while (mgsegment_depart1==NULL);
                          do
                                  {
                                  if ((mgsegment->get_noeud1()==noeud_courant) || (mgsegment->get_noeud2()==noeud_courant)) mgsegment_depart2=mgsegment;
                                  mgsegment=(MCSegment*)mgarete->get_lien_maillage()->get_suivant(it);
                                  }
                          while (mgsegment_depart2==NULL);
                          MCNode* noeud1_2;
                          MCNode* noeud2_2;
                          if (mgsegment_depart1->get_noeud1()==noeud_courant) noeud1_2=(MCNode*)mgsegment_depart1->get_noeud2(); else  noeud1_2=(MCNode*)mgsegment_depart1->get_noeud1();
                          if (mgsegment_depart2->get_noeud1()==noeud_courant) noeud2_2=(MCNode*)mgsegment_depart2->get_noeud2(); else  noeud2_2=(MCNode*)mgsegment_depart2->get_noeud1();
                          OT_VECTEUR_3D vecteur1(noeud1_2->get_x()-noeud_courant->get_x(),noeud1_2->get_y()-noeud_courant->get_y(),noeud1_2->get_z()-noeud_courant->get_z());
                          double coo[3];
                          mgarete->deriver(mgarete->get_tmin(),coo);
                          OT_VECTEUR_3D tangeante(coo[0]*mgcoarete->get_orientation(),coo[1]*mgcoarete->get_orientation(),coo[2]*mgcoarete->get_orientation());
                          MCNode* noeud_suivant;
                          if (vecteur1*tangeante>0.)
                                {
                                mgsegment=mgsegment_depart1;
                                noeud_suivant=noeud1_2;
                                }
                          else
                                {
                                mgsegment=mgsegment_depart2;
                                noeud_suivant=noeud2_2;
                                }
                          MG_FRONT_2D* front=ajouter_front(front_courant,noeud_courant,noeud_suivant,mgsegment);
                          grille_de_segment->inserer(mgsegment);
                          if (get_nb_front(front_courant)==nb_front_avant_cette_boucle+1) premier_front=front;
                          front->changer_front_precedent(front_precedent);
                          front_precedent=front;
                          noeud_courant=noeud_suivant;
                          segment_courant=mgsegment;
                          }
                  else
                  {
                     trouve=0;
                     TPL_SET<MG_ELEMENT_MAILLAGE*>::ITERATEUR it;
                     MG_SEGMENT* mgsegment=(MG_SEGMENT*)mgarete->get_lien_maillage()->get_premier(it);
                     do
                        {
                           if ((mgsegment->get_noeud1()==noeud_courant) || (mgsegment->get_noeud2()==noeud_courant))
                              if (mgsegment!=segment_courant)
                                 {
                                 trouve=1;
                                 MCNode* noeud_suivant;
                                 if (mgsegment->get_noeud1()==noeud_courant) noeud_suivant=(MCNode*)mgsegment->get_noeud2();
                                 else if (mgsegment->get_noeud2()==noeud_courant) noeud_suivant=(MCNode*)mgsegment->get_noeud1();
                                 MG_FRONT_2D* front=ajouter_front(front_courant,noeud_courant,noeud_suivant,(MCSegment*)mgsegment);
                                 grille_de_segment->inserer((MCSegment*)mgsegment);
                                 if (get_nb_front(front_courant)==nb_front_avant_cette_boucle+1) premier_front=front;
                                 else front_precedent->changer_front_suivant(front);
                                 front->changer_front_precedent(front_precedent);
                                 front_precedent=front;
                                 noeud_courant=noeud_suivant;
                                 segment_courant=(MCSegment*)mgsegment;
                                 }
                           mgsegment=(MG_SEGMENT*)mgarete->get_lien_maillage()->get_suivant(it);
                           }
                     while (trouve==0);
                     }
                  }
           while (noeud_courant!=noeud_d_arrivee);

           int trouve=0;

           if (nbcoaretetraite != nbcoaretetotale)
               mgcoarete = mgboucle->get_mg_coarete(nbcoaretetraite);
           else
               mgcoarete = NULL;
        }
        while ( mgcoarete );
        front_precedent->changer_front_suivant(premier_front);
        premier_front->changer_front_precedent(front_precedent);
        }

    initialise_front (__mcFace, isolatedInteriorVertices);
}

void MAILLEUR2D::initialise_front (MCFace * __mcFace, std::set<MCVertex*> __isolatedInteriorVertices)
{
    for (std::set<MCVertex*>::iterator itV = __isolatedInteriorVertices.begin();
        itV != __isolatedInteriorVertices.end();
        itV ++ )
    {
        MCVertex * mcVertex = *itV;
        MCNode * mcNode = 0;
        TPL_SET<MG_ELEMENT_MAILLAGE*>::ITERATEUR it_elem;
        for (MG_ELEMENT_MAILLAGE* elem = mcVertex->get_lien_maillage()->get_premier(it_elem);
            elem;elem = mcVertex->get_lien_maillage()->get_suivant(it_elem))
            if (elem->get_type_entite()==IDMCNODE)
                mcNode = (MCNode*)elem;
        MG_FRONT_2D *front_rencontre;
        MCNode *noeud_solution;
        int solution = genere_noeud(__mcFace, mcNode, &front_rencontre, &noeud_solution);

        MCSegment* mgsegment;
        int ierr = insere_segment(__mcFace,&mgsegment,mcNode,noeud_solution,TOUS_FRONT);

        if (solution==FRONT_RENCONTRE)
        {
            MG_FRONT_2D *ft2=front_rencontre;
            MG_FRONT_2D *ft1=front_rencontre->get_front_precedent();
            MG_FRONT_2D *nv_ft1=ajouter_front(front_courant,noeud_solution,mcNode,mgsegment);
            MG_FRONT_2D *nv_ft2=ajouter_front(front_courant,mcNode,noeud_solution,mgsegment);
            nv_ft1->changer_front_precedent(ft1);
            ft1->changer_front_suivant(nv_ft1);
            nv_ft2->changer_front_precedent(nv_ft1);
            nv_ft1->changer_front_suivant(nv_ft2);
            nv_ft2->changer_front_suivant(ft2);
            ft2->changer_front_precedent(nv_ft2);
        }
        else if (solution==NOEUD_CREE)
        {
            MG_FRONT_2D *nv_ft1=ajouter_front(front_courant,noeud_solution,mcNode,mgsegment);
            MG_FRONT_2D *nv_ft2=ajouter_front(front_courant,mcNode,noeud_solution,mgsegment);
            nv_ft1->changer_front_suivant(nv_ft2);       
            nv_ft1->changer_front_precedent(nv_ft2);            
            nv_ft2->changer_front_suivant(nv_ft1);
            nv_ft2->changer_front_precedent(nv_ft1);
        }
    }
}

void MAILLEUR2D::progresse_front(MCFace * __mcFace)
{
int compteur=0;
int nbpas_compteur=100;
int compteur_min=100;
int compteur_min_oiv1=100;
int compteur_min_oiv2=9000000;
_nbTriangles[__mcFace] = 0;
clock_t compteur_temps, compteur_temps2;
compteur_temps = clock();

while (get_nb_front(front_courant)!=0)
 {

 compteur++;

 compteur_temps2 = clock();
 if (compteur_temps2-compteur_temps > CLOCKS_PER_SEC*.1)
 {
    std::ofstream file(filenameNbTriangles);

     file << "  id = " << __mcFace->get_id()<< " ";
     file << "nb triangles = "<<_nbTriangles[__mcFace]<< " ";
     file << "nb fronts = "<< get_nb_front(front_courant)+get_nb_front(front_attente);
     file.flush();
     file.close();
     compteur_temps = compteur_temps2;
 }

 if (debug && _nbTriangles[__mcFace] >= compteur_min && (_nbTriangles[__mcFace]%nbpas_compteur==0))
 {    
      if(0)
      {
          MG_FRONT_2D *f1=get_front(front_courant,0), *fc=f1;
          std::set < MG_FRONT_2D * > visited;
          unsigned cpt_front=0;
          while (cpt_front < get_nb_front(front_courant))
          {
              visited.insert (fc);
              unsigned id = fc->get_noeud1()->get_id();
              if (id == 60101 || id==60099)
              printf("* %d *, ",id);
              else
              printf("%d, ", id);
              fc = fc->get_front_suivant();
              if (visited.find(fc) != visited.end())
                  for (std::multimap<double,MG_FRONT_2D*>::iterator itFr=front_courant.begin();
                      itFr != front_courant.end();
                      itFr++)
                  if ( visited.find(itFr->second) == visited.end())
                  {
                      fc = itFr->second;
                      printf("--\n");
                      break;
                  }

              cpt_front++;
          } ;
          printf("\n\n");
      }
      
      {
          ofstream o4("c:\\temp\\void_2D.mai",ios::out|ios::trunc);
          o4.precision(16);
          o4.setf(ios::showpoint);
          mg_maillage->enregistrer_sous_mesh_2D(o4);
      }

      if ( _nbTriangles[__mcFace]>=compteur_min_oiv1)
      {
        char filename2[5000];
        sprintf(filename2,"%s\\CAD4FE_Mesher_%d.iv",getenv("TEMP"),_nbTriangles[__mcFace]);
        std::ofstream file(filename2);
          CAD4FE::InventorText_MG_MAILLAGE ivTextRefTess (mg_maillage);
          ivTextRefTess.ShowFaceSegments = true;
          ivTextRefTess.ShowSegmentId = false;
          ivTextRefTess.ShowTriangleId = false;
          ivTextRefTess.ShowNodeId = true;
          ivTextRefTess.InverseTriangleNormals = true;
          ivTextRefTess.TriangleColor=1;
          file << ivTextRefTess.GetText();
          file << "\n}\n";
          file.close();
      }
    
      if (compteur>=compteur_min_oiv2 )
      {
        char filename2[5000];
        strcpy(filename2,getenv("TEMP"));
        strcat(filename2,"\\CAD4FE_Mesher_MCSegments.iv");
        std::ofstream file(filename2);

          InventorText_MG_MAILLAGE meshIvText (mg_maillage);
          meshIvText.ShowFaceSegments = true;
          meshIvText.ShowSegmentId = true;
          meshIvText.ShowTriangleId = true;
          meshIvText.ShowNodeId = true;
          meshIvText.InverseTriangleNormals = true;
          meshIvText.TriangleColor=1;
          file<<meshIvText.GetText();

          file <<  "DrawStyle {\nstyle LINES\nlineWidth 2\npointSize 3\n}\n";
          LISTE_MG_SEGMENT::iterator itSegment;
          for (MG_SEGMENT * seg = mg_maillage->get_premier_segment(itSegment); seg; seg = mg_maillage->get_suivant_segment(itSegment))
          {
              if (seg->get_lien_topologie()->get_dimension() == 1)
                  file << "BaseColor { \n rgb   0.0 0.0 0.9\n }\n";
              if (seg->get_lien_topologie()->get_dimension() == 2)
                  file << "BaseColor { \n rgb   0.0 0.0 0.0\n }\n";
              MCSegment * mcSeg = (MCSegment *) seg;
              InventorText_MCSegment mcSegTxt (mcSeg);
              file << mcSegTxt.GetText();
          }
        
          file << "\n}\n";
          file.close();
      }
 }


 refresh();
 MG_FRONT_2D* ft=get_front(front_courant,0);
 MG_FRONT_2D* ftp=ft->get_front_precedent();
 MG_FRONT_2D* fts=ft->get_front_suivant();
 double eps=0.0001*ft->get_segment()->get_longueur();
 MCNode* nop=ftp->get_noeud1();
 MCNode* no1=ft->get_noeud1();
 MCNode* no2=ft->get_noeud2();
 MCNode* nos=fts->get_noeud2();
 /* angle precedent et angle suivant */
 OT_VECTEUR_3D n1n2(no1->get_coord(),no2->get_coord());
 OT_VECTEUR_3D n2s(no2->get_coord(),nos->get_coord());
 OT_VECTEUR_3D pn1(nop->get_coord(),no1->get_coord());
 n1n2.norme();
 n2s.norme();
 pn1.norme();
 double coo[3];                            
 int nbRefFaces;
 __mcFace->calcul_normale_unitaire(no1->GetRefFaceMapping(), coo, &nbRefFaces);
// MCFace_calcul_normale_unitaire(__mcFace,no1,coo);
 OT_VECTEUR_3D nplan(coo);
 OT_VECTEUR_3D n=nplan&n1n2;
 n.norme();
 double pcp=(-1)*(n1n2*pn1);
 double psp=(-1)*(n*pn1);
 int anglep;
 if ((pcp>=0.1786481777)&&(psp>eps)) anglep=1; else anglep=0;
// MCFace_calcul_normale_unitaire(__mcFace,no2,coo);            
 __mcFace->calcul_normale_unitaire(no2->GetRefFaceMapping(), coo, &nbRefFaces);
 OT_VECTEUR_3D nplan2(coo);
 n=nplan2&n1n2;
 n.norme();
 double pcs=(-1.)*(n1n2*n2s);
 double pss=n*n2s;
 int angles;
 if ((pcs>=0.1786481777)&&(pss>eps)) angles=1; else angles=0;
 int type_cas_front[10];
 if ( (ftp==fts->get_front_suivant()) && (no1!=nos) && (no2!=nop) ) type_cas_front[CAS_FRONT_3]=1; else type_cas_front[CAS_FRONT_3]=0;
 if (identifie_front_cas_front_3x(ftp,ft,fts)) type_cas_front[CAS_FRONT_3X]=1; else type_cas_front[CAS_FRONT_3X]=0;
 if ( ftp->get_front_precedent()==fts->get_front_suivant() && (nos!=no1) && (no2!=nop) ) type_cas_front[CAS_FRONT_4]=1; else type_cas_front[CAS_FRONT_4]=0;
 if ( (anglep==1) && (angles==1) ) type_cas_front[CAS_FERME_CAVITE]=1; else type_cas_front[CAS_FERME_CAVITE]=0;
 if ( anglep==1 ) type_cas_front[CAS_FERME_CAVITE_P]=1; else type_cas_front[CAS_FERME_CAVITE_P]=0;
 if ( angles==1 ) type_cas_front[CAS_FERME_CAVITE_S]=1; else type_cas_front[CAS_FERME_CAVITE_S]=0;
 type_cas_front[CAS_GENERAL]=1;
 int solution=PASTROUVE;
 if (type_cas_front[CAS_FRONT_3]) solution=traite_front(CAS_FRONT_3,__mcFace,ftp,ft,fts);
 if ((solution==PASTROUVE) && (type_cas_front[CAS_FRONT_3X])) solution=traite_front(CAS_FRONT_3X,__mcFace,ftp,ft,fts);
 if ((solution==PASTROUVE) && (type_cas_front[CAS_FRONT_4])) solution=traite_front(CAS_FRONT_4,__mcFace,ftp,ft,fts);
 if ((solution==PASTROUVE) && (type_cas_front[CAS_FERME_CAVITE])) solution=traite_front(CAS_FERME_CAVITE,__mcFace,ftp,ft,fts);
 if ((solution==PASTROUVE) && (type_cas_front[CAS_FERME_CAVITE_P])) solution=traite_front(CAS_FERME_CAVITE_P,__mcFace,ftp,ft,fts);
 if ((solution==PASTROUVE) && (type_cas_front[CAS_FERME_CAVITE_S])) solution=traite_front(CAS_FERME_CAVITE_S,__mcFace,ftp,ft,fts);
 if ((solution==PASTROUVE) && (type_cas_front[CAS_GENERAL]))
    {
       solution=traite_front(CAS_GENERAL,__mcFace,ftp,ft,fts);
       if ((solution!=PASTROUVE)&&(solution!=TROUVE))
          if (!type_cas_front[solution]) solution=traite_front(solution,__mcFace,ftp,ft,fts); else solution=PASTROUVE;
       if (solution==PASTROUVE)
          {
             echange_de_front(front_courant,front_attente,ft);
             ft->incremente_ifail();
             solution=TROUVE;
          }
    }
 if (get_nb_front(front_courant)==0) front_courant.swap(front_attente);
 }

  {                                                 
        std::ofstream file(filenameNbTriangles);
     file << "  id = " << __mcFace->get_id()<< " ";
     file << "nb triangles = "<<_nbTriangles[__mcFace]<< " ";
     file << "nb fronts = "<< get_nb_front(front_courant)+get_nb_front(front_attente);
     file.flush();
     file.close();
 }

}

void MAILLEUR2D::optimise_bascule_segment(MCFace* __mcFace)
{
    OptimizeEdgeSwap edgeSwapper(mg_maillage);
    edgeSwapper.Optimize(__mcFace);
    initialise_lst_tri_qual(__mcFace);
}

void MAILLEUR2D::initialise_lst_tri_qual(MCFace* __mcFace)
{
    lst_tri_qual.clear();
    lst_tri_qual2.clear();
    LISTE_MG_TRIANGLE::iterator itTri;
    for (M3D_MCTriangle * mtri = (M3D_MCTriangle *)mg_maillage->get_premier_triangle(itTri);mtri; mtri = (M3D_MCTriangle *)mg_maillage->get_suivant_triangle(itTri))
    {
        double qual=OPERATEUR::qualite_triangle(mtri->get_noeud1()->get_coord(),mtri->get_noeud2()->get_coord(),mtri->get_noeud3()->get_coord());
        mtri->change_qualite(qual);
        lst_tri_qual.insert(std::make_pair(mtri->get_qualite(),mtri));
    }
}

void MAILLEUR2D::optimise(MCFace* __mcFace)
{
initialise_lst_tri_qual(__mcFace);
std::set<MCSegment *> lstSegToUpdate;
for (int phase=0;phase<2;phase++)
        {
        ORDRE_TRIANGLE& lst=lst_tri_qual;
        if (phase==1)
                lst=lst_tri_qual2;
        int ok=0;
        do
                {
                ORDRE_TRIANGLE::iterator i=lst.begin();
                if (i==lst.end())
                        {
                        ok=1;
                        continue;
                        }
                M3D_MCTriangle* tri=(*i).second;
                if (tri->get_qualite()<0.5)
                        {
                        MCNode* no[3];
                        no[0]=(MCNode*)tri->get_noeud1();
                        no[1]=(MCNode*)tri->get_noeud2();
                        no[2]=(MCNode*)tri->get_noeud3();
                        double crit[3];//,u[3],v[3],x[3],y[3],z[3];
                        MCNode *noeud_optimal[3]={0,0,0};
                        int ierr=bouge_point(__mcFace,no[0],crit[0],&(noeud_optimal[0]));
                        if (ierr==0) crit[0]=0.;
                        ierr=bouge_point(__mcFace,no[1],crit[1],&(noeud_optimal[1]));
                        if (ierr==0) crit[1]=0.;
                        ierr=bouge_point(__mcFace,no[2],crit[2],&(noeud_optimal[2]));
                        if (ierr==0) crit[2]=0.;
                        double critopt=std::max(crit[0],crit[1]);
                        critopt=std::max(critopt,crit[2]);
                        int num=-1;
                        if (critopt>tri->get_qualite())
                                {
                                if (critopt==crit[0]) num=0;
                                if (critopt==crit[1]) num=1;
                                if (critopt==crit[2]) num=2;
                                }
                        if (num!=-1)
                                {
                                no[num]->CopyGeometry(*noeud_optimal[num]);
                                int nb_seg=no[num]->get_lien_segment()->get_nb();
                                // the geometry of adjacent segment (path in the reference BRep)
                                // must be updated according to the new position of the node
                                for (int i=0;i<nb_seg;i++)
                                    lstSegToUpdate.insert((MCSegment*)no[num]->get_lien_segment()->get(i));
                                int nb_tri=no[num]->get_lien_triangle()->get_nb();
                                for (int i=0;i<nb_tri;i++)
                                        {
                                        M3D_MCTriangle* mtri=(M3D_MCTriangle*)no[num]->get_lien_triangle()->get(i);
                                        double qual=OPERATEUR::qualite_triangle(mtri->get_noeud1()->get_coord(),mtri->get_noeud2()->get_coord(),mtri->get_noeud3()->get_coord());
                                        mtri->change_qualite(qual);
                                        }
                                }  
                        if (noeud_optimal[0]) delete noeud_optimal[0];
                        if (noeud_optimal[1]) delete noeud_optimal[1];    
                        if (noeud_optimal[2]) delete noeud_optimal[2];
                        }
                    else ok=1;
                    if ((tri->get_qualite()<0.5) && (phase==0))
                            {
                            std::pair<const double,M3D_MCTriangle*> tmp(1./tri->get_qualite(),tri);
                            lst_tri_qual2.insert(tmp);
                            }
                    lst.erase(i);
                }
        while (ok==0);
        }

        // update the geometry of segments which nodes have been moved
        for (std::set<MCSegment*>::iterator itSeg=lstSegToUpdate.begin();
            itSeg!=lstSegToUpdate.end();
            itSeg++)
        {
            MCSegment * seg = * itSeg;
            seg->UpdateGeometry();
        }
}


/*void MAILLEUR2D::optimise(MG_FACE* mgface)
{
for (int phase=0;phase<2;phase++)
        {
        ORDRE_TRIANGLE& lst=lst_tri_qual;
        if (phase==1)
                lst=lst_tri_qual2;
        int ok=0;
        do
                {
                ORDRE_TRIANGLE::iterator i=lst.begin();
                if (i==lst.end())
                        {
                        ok=1;
                        continue;
                        }
                M3D_MCTriangle* tri=(*i).second;
                if (tri->get_qualite()<0.5)
                        {
                        MG_NOEUD* no[3];
                        no[0]=tri->get_noeud1();
                        no[1]=tri->get_noeud2();
                        no[2]=tri->get_noeud3();
                        double crit[3],u[3],v[3],x[3],y[3],z[3];
                        int ierr=bouge_point(mgface,no[0],crit[0],u[0],v[0],x[0],y[0],z[0]);
                        if (ierr==0) crit[0]=0.;
                        ierr=bouge_point(mgface,no[1],crit[1],u[1],v[1],x[1],y[1],z[1]);
                        if (ierr==0) crit[1]=0.;
                        ierr=bouge_point(mgface,no[2],crit[2],u[2],v[2],x[2],y[2],z[2]);
                        if (ierr==0) crit[2]=0.;
                        double critopt=std::max(crit[0],crit[1]);
                        critopt=std::max(critopt,crit[2]);
                        int num=-1;
                        if (critopt>tri->get_qualite())
                                {
                                if (critopt==crit[0]) num=0;
                                if (critopt==crit[1]) num=1;
                                if (critopt==crit[2]) num=2;
                                }
                        if (num!=-1)
                                {
                                no[num]->change_u(u[num]);
                                no[num]->change_v(v[num]);
                                no[num]->change_x(x[num]);
                                no[num]->change_y(y[num]);
                                no[num]->change_z(z[num]);
                                int nb_tri=no[num]->get_lien_triangle()->get_nb();
                                for (int i=0;i<nb_tri;i++)
                                        {
                                        M3D_MCTriangle* mtri=(M3D_MCTriangle*)no[num]->get_lien_triangle()->get(i);
                                        double qual=OPERATEUR::qualite_triangle(mtri->get_noeud1()->get_coord(),mtri->get_noeud2()->get_coord(),mtri->get_noeud3()->get_coord());
                                        mtri->change_qualite(qual);
                                        }
                                }
                        }
                else ok=1;
                if ((tri->get_qualite()<0.5) && (phase==0))
                        {
                        std::pair<const double,M3D_MCTriangle*> tmp(1./tri->get_qualite(),tri);
                        lst_tri_qual2.insert(tmp);
                        }
                lst.erase(i);
                }
        while (ok==0);
        }
}    */


// FONCTIONS GERANT L ENTITE FRONT (ajout suppression et tout le bordel)
MG_FRONT_2D* MAILLEUR2D::ajouter_front(FRONT& front,MCNode* noeud1,MCNode* noeud2,MCSegment* segment)
{
MG_FRONT_2D* ft=new MG_FRONT_2D(noeud1,noeud2,segment);
ajouter_front(front,ft);
grille_de_front->inserer(ft);
return ft;
}

void MAILLEUR2D::ajouter_front(FRONT& front,MG_FRONT_2D *ft)
{
std::pair<const double,MG_FRONT_2D*> tmp(ft->get_segment()->get_longueur(),ft);
front.insert(tmp);
}

MG_FRONT_2D* MAILLEUR2D::get_front(FRONT& front,unsigned int num)
{
FRONT::iterator i=front.begin();
for (unsigned long j=0;j<num;j++) i++;
return ((*i).second);
}


unsigned int MAILLEUR2D::get_nb_front(FRONT& front)
{
return front.size();
}


MG_FRONT_2D * MAILLEUR2D::trouver_front(MG_NOEUD * no1, MG_NOEUD * no2)
{
    FRONT::iterator j;
    MG_FRONT_2D *ft = 0;
    for (j=front_courant.begin(); j!=front_courant.end(); j++)
    {
        MG_FRONT_2D * ftj = j->second;
        if ( ftj->get_noeud1() == no1 && ftj->get_noeud2() == no2 )
        {
            ft = ftj;
            break;
        }
    }
    if (ft == 0)
    for (j=front_attente.begin(); j!=front_attente.end(); j++)
    {
        MG_FRONT_2D * ftj = j->second;
        if ( ftj->get_noeud1() == no1 && ftj->get_noeud2() == no2 )
        {
            ft = ftj;
            break;
        }
    }
    return ft;
}

void MAILLEUR2D::supprimer_front(MG_FRONT_2D* ft)
{
grille_de_front->supprimer(ft);

FRONT::iterator j=front_courant.lower_bound(ft->get_segment()->get_longueur());
int ok=0;
if (j==front_courant.end()) ok=2;
while (ok==0&&(j!=front_courant.end()))
   {
      MG_FRONT_2D* fttmp=(*j).second;
      if (ft==fttmp) {ok=1;front_courant.erase(j);}
      if (fttmp->get_segment()->get_longueur()>ft->get_segment()->get_longueur()) ok=2;
      j++;
   }
if (ok!=1)
 {
  j=front_attente.lower_bound(ft->get_segment()->get_longueur());
  while (ft!=(*j).second) j++;
  front_attente.erase(j);
 }

delete ft;
}

void MAILLEUR2D::echange_de_front(FRONT& front_original,FRONT& front_destination,MG_FRONT_2D* ft)
{
FRONT::iterator j=front_original.lower_bound(ft->get_segment()->get_longueur());
while (ft!=(*j).second) j++;
front_original.erase(j);
ajouter_front(front_destination,ft);
}
Revision:	64
Committed:	Fri Feb 1 18:27:30 2008 UTC (17 years, 3 months ago) by foucault
Original Path:	*magic/lib/CAD4FE/CAD4FE/src/CAD4FE_mailleur2d.cpp*
File size:	48078 byte(s)
Log Message:	mise a jour final these Gilles Foucault