mailleur_auto/src/mailleur2d.h

//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//  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
Revision:	1158
Committed:	Thu Jun 13 22:18:49 2024 UTC (11 months ago) by francois
Content type:	text/plain
File size:	5053 byte(s)
Log Message:	compatibilité Ubuntu 22.04 Suppression des refeences à Windows Ajout d'une banière
#	User	Rev	Content
1	francois	1158	//####//------------------------------------------------------------
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			//####// mailleur2d.h
15			//####//
16			//####//------------------------------------------------------------
17			//####//------------------------------------------------------------
18			//####// COPYRIGHT 2000-2024
19			//####// jeu 13 jun 2024 11:58:56 EDT
20			//####//------------------------------------------------------------
21			//####//------------------------------------------------------------
22	francois	283	#ifndef _MAILLEUR2D_
23			#define _MAILLEUR2D_
24
25
26
27	francois	1158
28
29	francois	283	#include <map>
30
31	francois	1158
32	francois	283	#include "mg_front_2D.h"
33			#include "ot_decalage_parametre.h"
34	francois	632	#include "mg_geometrie.h"
35	francois	283	#include "mg_maillage.h"
36			#include "mg_face.h"
37			#include "mailleur.h"
38	francois	632	#include "tpl_octree.h"
39	francois	283	#include "tpl_liste_entite.h"
40	francois	632	#include "fct_taille.h"
41	francois	283
42
43
44
45
46
47	francois	632
48
49	francois	1158	class MAILLEUR2D:public MAILLEUR
50	francois	283	{
51			public :
52			typedef std::multimap<double,MG_FRONT_2D*,std::less<double> > FRONT;
53
54	francois	447
55	francois	446	MAILLEUR2D(MG_MAILLAGE* mgmai,MG_GEOMETRIE mggeo,FCT_TAILLE fct_taille,MG_FACE* mgface=NULL);
56	francois	283	~MAILLEUR2D();
57
58
59
60	couturad	966	int maille(MG_GROUPE_TOPOLOGIQUE* mggt=NULL);
61			int maille(MG_FACE* mgface,TPL_LISTE_ENTITE<MG_SEGMENT> lstseg=NULL,TPL_LISTE_ENTITE<MG_TRIANGLE> lsttri=NULL);
62	francois	447	void change_niveau_optimisation(int num);
63			int get_niveau_optimisation(void);
64	francois	283
65
66			private :
67	francois	446
68	francois	283
69			void initialise_frontiere(MG_FACE* mgface);
70	francois	632	void cree_ntree(MG_FACE* mgface);
71	francois	820	void initialise_front(MG_FACE* mgface,TPL_MAP_ENTITE<MG_SOMMET*> &liste_pole);
72	couturad	919	int progresse_front(MG_FACE* mgface);
73	francois	820	void traite_pole(MG_FACE* mgface,TPL_MAP_ENTITE<MG_SOMMET*> &liste_pole);
74	francois	283
75	francois	696	void verifie_coin_sommet(MG_FACE* mgface,TPL_LISTE_ENTITE<MG_TRIANGLE> lstaffectecoin);
76	francois	447
77	francois	283	void insere_contrainte_segment(MG_FACE* mgface,TPL_LISTE_ENTITE<MG_SEGMENT> lstseg);
78			void insere_contrainte_triangle(MG_FACE* mgface,TPL_LISTE_ENTITE<MG_TRIANGLE> lsttri);
79
80			int traite_front(int type_front,MG_FACE mgface,MG_FRONT_2D ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
81			int traite_front_cas_front_3(MG_FACE mgface,MG_FRONT_2D ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
82			int traite_front_cas_front_4(MG_FACE mgface,MG_FRONT_2D ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
83			int traite_front_cas_ferme_cavite(MG_FACE mgface,MG_FRONT_2D ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
84			int traite_front_cas_ferme_cavite_p(MG_FACE mgface,MG_FRONT_2D ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
85			int traite_front_cas_ferme_cavite_s(MG_FACE mgface,MG_FRONT_2D ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
86			int traite_front_cas_general(MG_FACE mgface,MG_FRONT_2D ftp,MG_FRONT_2D* ft,MG_FRONT_2D* fts);
87
88			int noeud_est_dans_triangle(MG_NOEUD* noeud,MG_TRIANGLE *triangle);
89			int noeud_est_dans_triangle(MG_NOEUD* noeud,MG_NOEUD noeud1,MG_NOEUD noeud2,MG_NOEUD *noeud3);
90			int triangle_est_dans_bon_sens(MG_FACE* face,MG_NOEUD* noeud1,MG_NOEUD noeud2,MG_NOEUD noeud3);
91			int genere_noeud(MG_FACE* mgface,MG_FRONT_2D* front,MG_FRONT_2D front_rencontre,MG_NOEUD noeud);
92			int insere_segment(MG_FACE mgface,MG_SEGMENT nv_segment,MG_NOEUD noeud1,MG_NOEUD* noeud2,int type_verication);
93			void supprime_segment(MG_SEGMENT* mgsegment);
94			MG_TRIANGLE* insere_triangle(MG_ELEMENT_TOPOLOGIQUE* topo,class MG_NOEUD mgnoeud1,class MG_NOEUD mgnoeud2,class MG_NOEUD *mgnoeud3);
95
96	francois	447
97	francois	283	int intersection_segment_segment(MG_NOEUD* noeud1,MG_NOEUD* noeud2,MG_NOEUD* noeud3,MG_NOEUD* noeud4);
98			int examine_solution(double sol1,double sol2,int type);
99
100	francois	532
101
102	francois	283	MG_FRONT_2D* ajouter_front(FRONT& front,MG_NOEUD* noeud1,MG_NOEUD* noeud2,MG_SEGMENT* segment);
103			void ajouter_front(FRONT& front,MG_FRONT_2D *ft);
104			MG_FRONT_2D* get_front(FRONT& front,unsigned int num);
105			unsigned int get_nb_front(FRONT& front);
106			void supprimer_front(MG_FRONT_2D* ft);
107			void echange_de_front(FRONT& front_original,FRONT& front_destination,MG_FRONT_2D* ft);
108	francois	1095	void enregistre_front(char *nom,int dimension=3);
109	francois	283
110			MG_MAILLAGE* mg_maillage;
111			MG_GEOMETRIE* mg_geometrie;
112			MG_FACE* mg_face;
113			FCT_TAILLE *metrique;
114			double periode_u;
115			double periode_v;
116	francois	447	int niveau_optimisation;
117	francois	283	OT_DECALAGE_PARAMETRE *decalage;
118
119			TPL_LISTE_ENTITE<MG_SEGMENT*> segment_frontiere;
120			TPL_LISTE_ENTITE<MG_NOEUD*> noeud_frontiere;
121	francois	632	TPL_NTREE_FCT<MG_SEGMENT,FCT_TAILLE> ntree_de_segment;
122			TPL_OCTREE<MG_FRONT_2D,MG_NOEUD> *ntree_de_front;
123	francois	283	FRONT front_courant;
124			FRONT front_attente;
125	francois	632	double umin,vmin,umax,vmax;
126	francois	447
127	francois	632
128	francois	283	};
129
130
131
132
133
134
135			#endif