mailleur2d.h

Aller à la documentation de ce fichier.

//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//  MAGiC
//####//  Jean Christophe Cuilliere et Vincent FRANCOIS
//####//  Departement de Genie Mecanique - UQTR
//####//------------------------------------------------------------
//####//  MAGIC est un projet de recherche de l equipe ERICCA
//####//  du departement de genie mecanique de l Universite du Quebec a Trois Rivieres
//####//  http://www.uqtr.ca/ericca
//####//  http://www.uqtr.ca/
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//
//####//       mailleur2d.h
//####//
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//    COPYRIGHT 2000-2024
//####//  jeu 13 jun 2024 11:58:56 EDT
//####//------------------------------------------------------------
//####//------------------------------------------------------------
#ifndef _MAILLEUR2D_
#define _MAILLEUR2D_
 
 
 
 
 
#include <map>
 
 
#include "mg_front_2D.h"
#include "ot_decalage_parametre.h"
#include "mg_geometrie.h"
#include "mg_maillage.h"
#include "mg_face.h"
#include "mailleur.h"
#include "tpl_octree.h"
#include "tpl_liste_entite.h"
#include "fct_taille.h"
 
 
 
 
 
 
 
 
class  MAILLEUR2D:public MAILLEUR
{
public :
    typedef std::multimap<double,MG_FRONT_2D*,std::less<double> > FRONT;
 
 
    MAILLEUR2D(MG_MAILLAGE* mgmai,MG_GEOMETRIE *mggeo,FCT_TAILLE* fct_taille,MG_FACE* mgface=NULL);
    ~MAILLEUR2D();
 
 
 
    int maille(MG_GROUPE_TOPOLOGIQUE* mggt=NULL);
    int maille(MG_FACE* mgface,TPL_LISTE_ENTITE<MG_SEGMENT*> *lstseg=NULL,TPL_LISTE_ENTITE<MG_TRIANGLE*> *lsttri=NULL);
    void change_niveau_optimisation(int num);
    int get_niveau_optimisation(void);
 
 
private :
    
 
    void initialise_frontiere(MG_FACE* mgface);
    void cree_ntree(MG_FACE* mgface);
    void initialise_front(MG_FACE* mgface,TPL_MAP_ENTITE<MG_SOMMET*> &liste_pole);
    int progresse_front(MG_FACE* mgface);
    void traite_pole(MG_FACE* mgface,TPL_MAP_ENTITE<MG_SOMMET*> &liste_pole);
 
    void verifie_coin_sommet(MG_FACE* mgface,TPL_LISTE_ENTITE<MG_TRIANGLE*> *lstaffectecoin);
 
    void insere_contrainte_segment(MG_FACE* mgface,TPL_LISTE_ENTITE<MG_SEGMENT*> *lstseg);
    void insere_contrainte_triangle(MG_FACE* mgface,TPL_LISTE_ENTITE<MG_TRIANGLE*> *lsttri);
 
    int traite_front(int type_front,MG_FACE *mgface,MG_FRONT_2D* ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
    int traite_front_cas_front_3(MG_FACE *mgface,MG_FRONT_2D* ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
    int traite_front_cas_front_4(MG_FACE *mgface,MG_FRONT_2D* ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
    int traite_front_cas_ferme_cavite(MG_FACE *mgface,MG_FRONT_2D* ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
    int traite_front_cas_ferme_cavite_p(MG_FACE *mgface,MG_FRONT_2D* ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
    int traite_front_cas_ferme_cavite_s(MG_FACE *mgface,MG_FRONT_2D* ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
    int traite_front_cas_general(MG_FACE *mgface,MG_FRONT_2D* ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
 
    int noeud_est_dans_triangle(MG_NOEUD* noeud,MG_TRIANGLE *triangle);
    int noeud_est_dans_triangle(MG_NOEUD* noeud,MG_NOEUD *noeud1,MG_NOEUD *noeud2,MG_NOEUD *noeud3);
    int triangle_est_dans_bon_sens(MG_FACE* face,MG_NOEUD* noeud1,MG_NOEUD *noeud2,MG_NOEUD *noeud3);
    int genere_noeud(MG_FACE* mgface,MG_FRONT_2D* front,MG_FRONT_2D **front_rencontre,MG_NOEUD **noeud);
    int insere_segment(MG_FACE *mgface,MG_SEGMENT **nv_segment,MG_NOEUD* noeud1,MG_NOEUD* noeud2,int type_verication);
    void supprime_segment(MG_SEGMENT* mgsegment);
    MG_TRIANGLE* insere_triangle(MG_ELEMENT_TOPOLOGIQUE* topo,class MG_NOEUD *mgnoeud1,class MG_NOEUD *mgnoeud2,class MG_NOEUD *mgnoeud3);
 
 
    int intersection_segment_segment(MG_NOEUD* noeud1,MG_NOEUD* noeud2,MG_NOEUD* noeud3,MG_NOEUD* noeud4);
    int examine_solution(double sol1,double sol2,int type);
 
   
    
    MG_FRONT_2D* ajouter_front(FRONT& front,MG_NOEUD* noeud1,MG_NOEUD* noeud2,MG_SEGMENT* segment);
    void ajouter_front(FRONT& front,MG_FRONT_2D *ft);
    MG_FRONT_2D* get_front(FRONT& front,unsigned int num);
    unsigned int get_nb_front(FRONT& front);
    void supprimer_front(MG_FRONT_2D* ft);
    void echange_de_front(FRONT& front_original,FRONT& front_destination,MG_FRONT_2D* ft);
    void enregistre_front(char *nom,int dimension=3);
 
    MG_MAILLAGE* mg_maillage;
    MG_GEOMETRIE* mg_geometrie;
    MG_FACE* mg_face;
    FCT_TAILLE *metrique;
    double periode_u;
    double periode_v;
    int niveau_optimisation;
    OT_DECALAGE_PARAMETRE *decalage;
 
    TPL_LISTE_ENTITE<MG_SEGMENT*> segment_frontiere;
    TPL_LISTE_ENTITE<MG_NOEUD*> noeud_frontiere;
    TPL_NTREE_FCT<MG_SEGMENT*,FCT_TAILLE> *ntree_de_segment;
    TPL_OCTREE<MG_FRONT_2D*,MG_NOEUD*> *ntree_de_front;
    FRONT front_courant;
    FRONT front_attente;
    double umin,vmin,umax,vmax;
   
    
};
 
 
 
 
 
 
#endif