| 1 |
|
5 |
//------------------------------------------------------------
|
| 2 |
|
|
//------------------------------------------------------------
|
| 3 |
|
|
// MAGiC
|
| 4 |
francois |
331 |
// Jean Christophe Cuilli�re et Vincent FRANCOIS
|
| 5 |
|
|
// D�partement de G�nie M�canique - UQTR
|
| 6 |
|
5 |
//------------------------------------------------------------
|
| 7 |
francois |
331 |
// 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 |
|
5 |
// des auteurs (contact : francois@uqtr.ca)
|
| 12 |
|
|
//------------------------------------------------------------
|
| 13 |
|
|
//------------------------------------------------------------
|
| 14 |
|
|
//
|
| 15 |
|
|
// mailleur2d_outil.cpp
|
| 16 |
|
|
//
|
| 17 |
|
|
//------------------------------------------------------------
|
| 18 |
|
|
//------------------------------------------------------------
|
| 19 |
|
|
// COPYRIGHT 2000
|
| 20 |
francois |
331 |
// Version du 02/03/2006 � 11H23
|
| 21 |
|
5 |
//------------------------------------------------------------
|
| 22 |
|
|
//------------------------------------------------------------
|
| 23 |
|
|
|
| 24 |
|
|
|
| 25 |
|
|
#include "gestionversion.h"
|
| 26 |
|
|
#include <math.h>
|
| 27 |
|
|
#include "mailleur2d.h"
|
| 28 |
|
|
#include "ot_mathematique.h"
|
| 29 |
francois |
481 |
#include "ot_boite_2d.h"
|
| 30 |
|
5 |
#include "tpl_map_entite.h"
|
| 31 |
|
|
#include "m3d_triangle.h"
|
| 32 |
|
|
|
| 33 |
|
|
|
| 34 |
|
|
|
| 35 |
|
|
|
| 36 |
|
|
|
| 37 |
|
|
|
| 38 |
|
|
int MAILLEUR2D::noeud_est_dans_triangle(MG_NOEUD* noeud,MG_TRIANGLE *triangle)
|
| 39 |
|
|
{
|
| 40 |
|
|
return noeud_est_dans_triangle(noeud,triangle->get_noeud1(),triangle->get_noeud2(),triangle->get_noeud3());
|
| 41 |
|
|
}
|
| 42 |
|
|
|
| 43 |
|
|
|
| 44 |
|
|
int MAILLEUR2D::noeud_est_dans_triangle(MG_NOEUD* noeud,MG_NOEUD *noeud1,MG_NOEUD *noeud2,MG_NOEUD *noeud3)
|
| 45 |
|
|
{
|
| 46 |
|
|
double du=decalage->calcul_decalage_parametre_u(noeud1->get_u());
|
| 47 |
|
|
double dv=decalage->calcul_decalage_parametre_v(noeud1->get_v());
|
| 48 |
|
|
|
| 49 |
|
|
double u1=decalage->decalage_parametre_u(noeud1->get_u(),du);
|
| 50 |
|
|
double v1=decalage->decalage_parametre_v(noeud1->get_v(),dv);
|
| 51 |
|
|
double u2=decalage->decalage_parametre_u(noeud2->get_u(),du);
|
| 52 |
|
|
double v2=decalage->decalage_parametre_v(noeud2->get_v(),dv);
|
| 53 |
|
|
double u3=decalage->decalage_parametre_u(noeud3->get_u(),du);
|
| 54 |
|
|
double v3=decalage->decalage_parametre_v(noeud3->get_v(),dv);
|
| 55 |
|
|
double u=decalage->decalage_parametre_u(noeud->get_u(),du);
|
| 56 |
|
|
double v=decalage->decalage_parametre_v(noeud->get_v(),dv);
|
| 57 |
|
|
double eps=0.0001;
|
| 58 |
|
|
double delta=(u2-u1)*(v3-v1)-(v2-v1)*(u3-u1);
|
| 59 |
|
|
double precision=std::max(fabs(u1),fabs(v1));
|
| 60 |
|
|
precision=std::max(precision,fabs(u2));
|
| 61 |
|
|
precision=std::max(precision,fabs(v2));
|
| 62 |
|
|
precision=std::max(precision,fabs(u3));
|
| 63 |
|
|
precision=std::max(precision,fabs(v3));
|
| 64 |
|
|
precision=std::max(precision,fabs(u));
|
| 65 |
|
|
precision=std::max(precision,fabs(v));
|
| 66 |
|
|
if (OPERATEUR::egal(delta,0.0,precision*eps)) return(0);
|
| 67 |
|
|
double xsi=1.0/delta*((v3-v1)*(u-u1)-(u3-u1)*(v-v1));
|
| 68 |
|
|
double eta=1.0/delta*((u2-u1)*(v-v1)-(v2-v1)*(u-u1));
|
| 69 |
|
|
if (!((eta > eps) && (xsi > eps) && ((eta+xsi) < 1.0-eps))) return(0);
|
| 70 |
|
|
return (1);
|
| 71 |
|
|
}
|
| 72 |
|
|
|
| 73 |
|
|
|
| 74 |
|
|
|
| 75 |
|
|
|
| 76 |
|
|
|
| 77 |
|
|
|
| 78 |
|
|
int MAILLEUR2D::insere_segment(MG_FACE *mgface,MG_SEGMENT **nv_segment,MG_NOEUD* noeud1,MG_NOEUD* noeud2,int type_validation)
|
| 79 |
|
|
{
|
| 80 |
|
|
|
| 81 |
|
|
double du=decalage->calcul_decalage_parametre_u(noeud1->get_u());
|
| 82 |
|
|
double dv=decalage->calcul_decalage_parametre_v(noeud1->get_v());
|
| 83 |
|
|
double u1=decalage->decalage_parametre_u(noeud1->get_u(),du);
|
| 84 |
|
|
double v1=decalage->decalage_parametre_v(noeud1->get_v(),dv);
|
| 85 |
|
|
double u2=decalage->decalage_parametre_u(noeud2->get_u(),du);
|
| 86 |
|
|
double v2=decalage->decalage_parametre_v(noeud2->get_v(),dv);
|
| 87 |
|
|
double ui=0.5*(u1+u2);
|
| 88 |
|
|
double vi=0.5*(v1+v2);
|
| 89 |
|
|
double uii=decalage->decalage_parametre_u(ui,-du);
|
| 90 |
|
|
double vii=decalage->decalage_parametre_v(vi,-dv);
|
| 91 |
|
|
double longueur=sqrt((u2-u1)*(u2-u1)+(v2-v1)*(v2-v1));
|
| 92 |
|
|
|
| 93 |
|
|
if (type_validation==TOUS_SEGMENT)
|
| 94 |
|
|
{
|
| 95 |
|
|
TPL_MAP_ENTITE<MG_SEGMENT*> liste_trouvee;
|
| 96 |
|
|
quadtree_de_segment->rechercher(uii,vii,longueur/2.,liste_trouvee);
|
| 97 |
|
|
for (int j=0;j<liste_trouvee.get_nb();j++)
|
| 98 |
|
|
{
|
| 99 |
|
|
MG_SEGMENT* mgsegment=liste_trouvee.get(j);
|
| 100 |
|
|
if ( ((noeud1==mgsegment->get_noeud1()) && (noeud2==mgsegment->get_noeud2())) || ((noeud1==mgsegment->get_noeud2()) && (noeud2==mgsegment->get_noeud1())))
|
| 101 |
|
|
return(0);
|
| 102 |
|
|
int res=intersection_segment_segment(noeud1,noeud2,mgsegment->get_noeud1(),mgsegment->get_noeud2());
|
| 103 |
|
|
if (res!=0)
|
| 104 |
|
|
return(0);
|
| 105 |
|
|
}
|
| 106 |
|
|
}
|
| 107 |
|
|
if (type_validation==TOUS_FRONT)
|
| 108 |
|
|
{
|
| 109 |
|
|
TPL_MAP_ENTITE<MG_FRONT_2D*> liste_trouvee;
|
| 110 |
|
|
quadtree_de_front->rechercher(uii,vii,longueur/2.,liste_trouvee);
|
| 111 |
|
|
for (int j=0;j<liste_trouvee.get_nb();j++)
|
| 112 |
|
|
{
|
| 113 |
|
|
MG_FRONT_2D* ft=liste_trouvee.get(j);
|
| 114 |
|
|
MG_SEGMENT* mgsegment=ft->get_segment();
|
| 115 |
|
|
if ( ((noeud1==mgsegment->get_noeud1()) && (noeud2==mgsegment->get_noeud2())) || ((noeud1==mgsegment->get_noeud2()) && (noeud2==mgsegment->get_noeud1())))
|
| 116 |
|
|
return(0);
|
| 117 |
|
|
int res=intersection_segment_segment(noeud1,noeud2,mgsegment->get_noeud1(),mgsegment->get_noeud2());
|
| 118 |
|
|
if (res!=0)
|
| 119 |
|
|
return(0);
|
| 120 |
|
|
}
|
| 121 |
|
|
}
|
| 122 |
|
|
|
| 123 |
francois |
35 |
MG_SEGMENT* mgsegment=mg_maillage->ajouter_mg_segment(mgface,noeud1,noeud2,MAILLEUR_AUTO);
|
| 124 |
|
5 |
quadtree_de_segment->inserer(mgsegment);
|
| 125 |
|
|
*nv_segment=mgsegment;
|
| 126 |
|
|
return(1);
|
| 127 |
|
|
}
|
| 128 |
|
|
|
| 129 |
|
|
|
| 130 |
|
|
void MAILLEUR2D::supprime_segment(MG_SEGMENT* mgsegment)
|
| 131 |
|
|
{
|
| 132 |
|
|
quadtree_de_segment->supprimer(mgsegment);
|
| 133 |
|
|
mg_maillage->supprimer_mg_segmentid(mgsegment->get_id());
|
| 134 |
|
|
}
|
| 135 |
|
|
|
| 136 |
|
|
|
| 137 |
|
|
int MAILLEUR2D::genere_noeud(MG_FACE* mgface,MG_FRONT_2D* front,MG_FRONT_2D **front_rencontre,MG_NOEUD **noeud_rencontre)
|
| 138 |
|
|
{
|
| 139 |
|
|
OT_VECTEUR_3D w(0.,0.,1.);
|
| 140 |
|
|
MG_NOEUD* noeud1=front->get_noeud1();
|
| 141 |
|
|
MG_NOEUD* noeud2=front->get_noeud2();
|
| 142 |
|
|
double du=decalage->calcul_decalage_parametre_u(noeud1->get_u());
|
| 143 |
|
|
double dv=decalage->calcul_decalage_parametre_v(noeud1->get_v());
|
| 144 |
|
|
double u1=decalage->decalage_parametre_u(noeud1->get_u(),du);
|
| 145 |
|
|
double v1=decalage->decalage_parametre_v(noeud1->get_v(),dv);
|
| 146 |
|
|
double u2=decalage->decalage_parametre_u(noeud2->get_u(),du);
|
| 147 |
|
|
double v2=decalage->decalage_parametre_v(noeud2->get_v(),dv);
|
| 148 |
|
|
|
| 149 |
francois |
532 |
double longueur_segment=metrique->calcule_longueur_segment_metrique(mgface,front->get_segment(),decalage,pas);
|
| 150 |
|
5 |
double longueur_desiree=0.8660254037844386*(MAILLEUR2D::priorite_metrique+longueur_segment-longueur_segment*MAILLEUR2D::priorite_metrique);
|
| 151 |
|
|
longueur_desiree=longueur_desiree/front->get_ifail();
|
| 152 |
|
|
|
| 153 |
|
|
|
| 154 |
|
|
double umilieu=0.5*(u1+u2);
|
| 155 |
|
|
double vmilieu=0.5*(v1+v2);
|
| 156 |
|
|
double param_milieu[2]={umilieu-du,vmilieu-dv};
|
| 157 |
|
|
double E,F,G;
|
| 158 |
|
|
|
| 159 |
|
|
mgface->get_EFG(param_milieu,E,F,G);
|
| 160 |
|
|
double deno=E*(u2-u1)*(u2-u1)+G*(v2-v1)*(v2-v1)+2*F*(u2-u1)*(v2-v1);
|
| 161 |
|
|
double nume=(v2-v1)*(u2-u1)*(E-G)+F*((v2-v1)*(v2-v1)-(u2-u1)*(u2-u1));
|
| 162 |
|
|
double teta=atan(nume/deno);
|
| 163 |
|
|
|
| 164 |
|
|
|
| 165 |
francois |
532 |
double udecale;
|
| 166 |
|
|
double vdecale;
|
| 167 |
|
|
metrique->ajuste_distance_metrique(mgface,u1,v1,u2,v2,udecale,vdecale,longueur_desiree,du,dv,teta,pas);
|
| 168 |
|
5 |
double u=decalage->decalage_parametre_u(udecale,-du);
|
| 169 |
|
|
double v=decalage->decalage_parametre_v(vdecale,-dv);
|
| 170 |
|
|
double param_noeud_cree[2]={u,v};
|
| 171 |
|
|
|
| 172 |
|
|
|
| 173 |
|
|
// recherhce des element du front proche de u,v;
|
| 174 |
|
|
TPL_MAP_ENTITE<MG_FRONT_2D*> liste_trouvee;
|
| 175 |
|
|
|
| 176 |
|
|
double umin=std::min(u1,u2);
|
| 177 |
|
|
umin=std::min(umin,udecale);
|
| 178 |
|
|
double umax=std::max(u1,u2);
|
| 179 |
|
|
umax=std::max(umax,udecale);
|
| 180 |
|
|
double vmin=std::min(v1,v2);
|
| 181 |
|
|
vmin=std::min(vmin,vdecale);
|
| 182 |
|
|
double vmax=std::max(v1,v2);
|
| 183 |
|
|
vmax=std::max(vmax,vdecale);
|
| 184 |
|
|
BOITE_2D boite_recherche(umin,vmin,umax,vmax);
|
| 185 |
|
|
double longueur_recherche=boite_recherche.get_rayon()*2.;
|
| 186 |
|
|
|
| 187 |
|
|
quadtree_de_front->rechercher(u,v,longueur_recherche,liste_trouvee);
|
| 188 |
|
|
int nb_entite=liste_trouvee.get_nb();
|
| 189 |
|
|
|
| 190 |
|
|
double distance_reference = -1.;
|
| 191 |
|
|
double angle_reference=2.*M_PI;
|
| 192 |
|
|
unsigned long id_noeud_reference = 0;
|
| 193 |
|
|
MG_FRONT_2D* front_reference=NULL;
|
| 194 |
|
|
|
| 195 |
|
|
for (int i=0;i<nb_entite;i++)
|
| 196 |
|
|
{
|
| 197 |
|
|
MG_FRONT_2D* front_courant=liste_trouvee.get(i);
|
| 198 |
|
|
MG_NOEUD* noeud_front1=front_courant->get_noeud1();
|
| 199 |
|
|
MG_NOEUD* noeud_front2=front_courant->get_noeud2();
|
| 200 |
|
|
double unoeudfront1=decalage->decalage_parametre_u(noeud_front1->get_u(),du);
|
| 201 |
|
|
double vnoeudfront1=decalage->decalage_parametre_v(noeud_front1->get_v(),dv);
|
| 202 |
|
|
double unoeudfront2=decalage->decalage_parametre_u(noeud_front2->get_u(),du);
|
| 203 |
|
|
double vnoeudfront2=decalage->decalage_parametre_v(noeud_front2->get_v(),dv);
|
| 204 |
francois |
532 |
double distance_noeudfront1=metrique->calcule_distance_metrique(mgface,udecale,vdecale,unoeudfront1,vnoeudfront1,du,dv,pas);
|
| 205 |
|
5 |
if ((distance_noeudfront1<distance_reference) || (distance_reference<0.) || (id_noeud_reference==noeud_front1->get_id()))
|
| 206 |
|
|
if (noeud_front1->get_id()!=noeud1->get_id())
|
| 207 |
|
|
if (noeud_front1->get_id()!=noeud2->get_id())
|
| 208 |
|
|
if (id_noeud_reference==noeud_front1->get_id())
|
| 209 |
|
|
{
|
| 210 |
|
|
refresh();
|
| 211 |
|
|
OT_VECTEUR_3D vecteur_baseu(u1-unoeudfront1,v1-vnoeudfront1,0.);
|
| 212 |
|
|
OT_VECTEUR_3D vecteur_front(unoeudfront2-unoeudfront1,vnoeudfront2-vnoeudfront1,0.);
|
| 213 |
|
|
OT_VECTEUR_3D vecteur_basev=w&vecteur_baseu;
|
| 214 |
|
|
vecteur_baseu.norme();
|
| 215 |
|
|
vecteur_basev.norme();
|
| 216 |
|
|
vecteur_front.norme();
|
| 217 |
|
|
double cosangle=vecteur_baseu*vecteur_front;
|
| 218 |
|
|
double sinangle=vecteur_basev*vecteur_front;
|
| 219 |
|
|
sinangle=-sinangle;
|
| 220 |
|
|
if (cosangle>1.) cosangle=1.;
|
| 221 |
|
|
if (cosangle<-1.) cosangle=(-1.);
|
| 222 |
|
|
double angle=acos(cosangle);
|
| 223 |
|
|
if (sinangle<(-0.0001)) angle=(-angle);
|
| 224 |
|
|
if (angle<0.) angle=angle+2.*M_PI;
|
| 225 |
|
|
if (angle<angle_reference)
|
| 226 |
|
|
{
|
| 227 |
|
|
angle_reference=angle;
|
| 228 |
|
|
front_reference=front_courant;
|
| 229 |
|
|
}
|
| 230 |
|
|
}
|
| 231 |
|
|
else
|
| 232 |
|
|
{
|
| 233 |
|
|
refresh();
|
| 234 |
|
|
OT_VECTEUR_3D vecteur_baseu(u1-unoeudfront1,v1-vnoeudfront1,0.);
|
| 235 |
|
|
OT_VECTEUR_3D vecteur_front(unoeudfront2-unoeudfront1,vnoeudfront2-vnoeudfront1,0.);
|
| 236 |
|
|
OT_VECTEUR_3D vecteur_basev=w&vecteur_baseu;
|
| 237 |
|
|
vecteur_baseu.norme();
|
| 238 |
|
|
vecteur_basev.norme();
|
| 239 |
|
|
vecteur_front.norme();
|
| 240 |
|
|
double cosangle=vecteur_baseu*vecteur_front;
|
| 241 |
|
|
double sinangle=vecteur_basev*vecteur_front;
|
| 242 |
|
|
sinangle=-sinangle;
|
| 243 |
|
|
if (cosangle>1.) cosangle=1.;
|
| 244 |
|
|
if (cosangle<-1.) cosangle=(-1.);
|
| 245 |
|
|
double angle=acos(cosangle);
|
| 246 |
|
|
if (sinangle<(-0.0001)) angle=(-angle);
|
| 247 |
|
|
if (angle<0.) angle=angle+2.*M_PI;
|
| 248 |
|
|
distance_reference=distance_noeudfront1;
|
| 249 |
|
|
angle_reference=angle;
|
| 250 |
|
|
id_noeud_reference=noeud_front1->get_id();
|
| 251 |
|
|
front_reference=front_courant;
|
| 252 |
|
|
}
|
| 253 |
|
|
}
|
| 254 |
|
|
|
| 255 |
|
|
if ((front_reference!=NULL) && (distance_reference<longueur_desiree*2./sqrt(3)))
|
| 256 |
|
|
{
|
| 257 |
|
|
MG_NOEUD* noeud=mg_maillage->get_mg_noeudid(id_noeud_reference);
|
| 258 |
|
|
double uref=decalage->decalage_parametre_u(noeud->get_u(),du);
|
| 259 |
|
|
double vref=decalage->decalage_parametre_v(noeud->get_v(),dv);
|
| 260 |
francois |
532 |
double distance=metrique->calcule_distance_metrique(mgface,umilieu,vmilieu,uref,vref,du,dv,pas);
|
| 261 |
|
5 |
if (distance<1.5*longueur_desiree)
|
| 262 |
|
|
{
|
| 263 |
|
|
(*front_rencontre)=front_reference;
|
| 264 |
|
|
(*noeud_rencontre)=noeud;
|
| 265 |
|
|
return FRONT_RENCONTRE;
|
| 266 |
|
|
}
|
| 267 |
|
|
}
|
| 268 |
|
|
double coord[3];
|
| 269 |
|
|
mgface->evaluer(param_noeud_cree,coord);
|
| 270 |
francois |
35 |
MG_NOEUD* noeud=mg_maillage->ajouter_mg_noeud(mgface,coord[0],coord[1],coord[2],MAILLEUR_AUTO);
|
| 271 |
|
5 |
noeud->change_u(param_noeud_cree[0]);
|
| 272 |
|
|
noeud->change_v(param_noeud_cree[1]);
|
| 273 |
|
|
(*noeud_rencontre)=noeud;
|
| 274 |
|
|
(*front_rencontre)=NULL;
|
| 275 |
|
|
return NOEUD_CREE;
|
| 276 |
|
|
}
|
| 277 |
|
|
|
| 278 |
|
|
|
| 279 |
|
|
|
| 280 |
|
|
|
| 281 |
|
|
|
| 282 |
|
|
|
| 283 |
|
|
|
| 284 |
|
|
|
| 285 |
|
|
|
| 286 |
|
|
|
| 287 |
|
|
MG_TRIANGLE* MAILLEUR2D::insere_triangle(MG_ELEMENT_TOPOLOGIQUE* topo,class MG_NOEUD *mgnoeud1,class MG_NOEUD *mgnoeud2,class MG_NOEUD *mgnoeud3)
|
| 288 |
|
|
{
|
| 289 |
|
|
MG_SEGMENT* mgsegment1=mg_maillage->get_mg_segment(mgnoeud1->get_id(),mgnoeud2->get_id());
|
| 290 |
|
|
MG_SEGMENT* mgsegment2=mg_maillage->get_mg_segment(mgnoeud2->get_id(),mgnoeud3->get_id());
|
| 291 |
|
|
MG_SEGMENT* mgsegment3=mg_maillage->get_mg_segment(mgnoeud3->get_id(),mgnoeud1->get_id());
|
| 292 |
francois |
35 |
if (mgsegment1==NULL) mgsegment1=mg_maillage->ajouter_mg_segment(topo,mgnoeud1,mgnoeud2,MAILLEUR_AUTO);
|
| 293 |
|
|
if (mgsegment2==NULL) mgsegment2=mg_maillage->ajouter_mg_segment(topo,mgnoeud2,mgnoeud3,MAILLEUR_AUTO);
|
| 294 |
|
|
if (mgsegment3==NULL) mgsegment3=mg_maillage->ajouter_mg_segment(topo,mgnoeud3,mgnoeud1,MAILLEUR_AUTO);
|
| 295 |
francois |
54 |
M3D_TRIANGLE* mtriangle=new M3D_TRIANGLE(topo,mgnoeud1,mgnoeud2,mgnoeud3,mgsegment1,mgsegment2,mgsegment3,MAILLEUR_AUTO);
|
| 296 |
|
5 |
mg_maillage->ajouter_mg_triangle(mtriangle);
|
| 297 |
|
|
double qual=OPERATEUR::qualite_triangle(mgnoeud1->get_coord(),mgnoeud2->get_coord(),mgnoeud3->get_coord());
|
| 298 |
|
|
mtriangle->change_qualite(qual);
|
| 299 |
|
|
std::pair<const double,M3D_TRIANGLE*> tmp(mtriangle->get_qualite(),mtriangle);
|
| 300 |
|
|
return mtriangle;
|
| 301 |
|
|
}
|
| 302 |
|
|
|
| 303 |
|
|
int MAILLEUR2D::triangle_est_dans_bon_sens(MG_FACE* face,MG_NOEUD* noeud1,MG_NOEUD *noeud2,MG_NOEUD *noeud3)
|
| 304 |
|
|
{
|
| 305 |
|
|
double* xyz1=noeud1->get_coord();
|
| 306 |
|
|
double* xyz2=noeud2->get_coord();
|
| 307 |
|
|
double* xyz3=noeud3->get_coord();
|
| 308 |
|
|
OT_VECTEUR_3D n1n3(xyz1,xyz3);
|
| 309 |
|
|
OT_VECTEUR_3D n1n2(xyz1,xyz2);
|
| 310 |
|
|
double uv[2];
|
| 311 |
|
|
face->inverser(uv,xyz1);
|
| 312 |
|
|
double n[3];
|
| 313 |
|
|
face->calcul_normale_unitaire(uv,n);
|
| 314 |
|
|
OT_VECTEUR_3D nmat=n&n1n3;
|
| 315 |
|
|
nmat.norme();
|
| 316 |
|
|
n1n2.norme();
|
| 317 |
|
|
if (nmat*n1n2<0) return 0;
|
| 318 |
|
|
return 1;
|
| 319 |
|
|
}
|
| 320 |
|
|
|
| 321 |
|
|
|
| 322 |
|
|
|
| 323 |
|
|
|
| 324 |
|
|
|
| 325 |
|
|
|
| 326 |
|
|
|
| 327 |
|
|
// PARTIE DE CODE RECUPERER DE MON PROJET DE DEA
|
| 328 |
|
|
// TRES ILLISIBLE MAIS FONCTIONNEL
|
| 329 |
|
|
// POIL AU MARRON
|
| 330 |
|
|
|
| 331 |
|
|
#define PSCA(a,b) (a[0]*b[0]+a[1]*b[1]+a[2]*b[2])
|
| 332 |
|
|
#define EGAL(x,y,eps) (float)fabs((double)(x-y))<eps
|
| 333 |
|
|
#define DETER(a,b,c,d) (a*d-b*c)
|
| 334 |
|
|
|
| 335 |
|
|
int MAILLEUR2D::intersection_segment_segment(MG_NOEUD* noeud1,MG_NOEUD* noeud2,MG_NOEUD* noeud3,MG_NOEUD* noeud4)
|
| 336 |
|
|
{
|
| 337 |
|
|
|
| 338 |
|
|
double du=decalage->calcul_decalage_parametre_u(noeud1->get_u());
|
| 339 |
|
|
double dv=decalage->calcul_decalage_parametre_v(noeud1->get_v());
|
| 340 |
|
|
double ua=decalage->decalage_parametre_u(noeud1->get_u(),du);
|
| 341 |
|
|
double va=decalage->decalage_parametre_v(noeud1->get_v(),dv);
|
| 342 |
|
|
double ub=decalage->decalage_parametre_u(noeud2->get_u(),du);
|
| 343 |
|
|
double vb=decalage->decalage_parametre_v(noeud2->get_v(),dv);
|
| 344 |
|
|
double um=decalage->decalage_parametre_u(noeud3->get_u(),du);
|
| 345 |
|
|
double vm=decalage->decalage_parametre_v(noeud3->get_v(),dv);
|
| 346 |
|
|
double un=decalage->decalage_parametre_u(noeud4->get_u(),du);
|
| 347 |
|
|
double vn=decalage->decalage_parametre_v(noeud4->get_v(),dv);
|
| 348 |
|
|
double ab[3];
|
| 349 |
|
|
double nm[3];
|
| 350 |
|
|
double am[3];
|
| 351 |
|
|
ab[0]=ub-ua;
|
| 352 |
|
|
ab[1]=vb-va;
|
| 353 |
|
|
ab[2]=0.;
|
| 354 |
|
|
nm[0]=um-un;
|
| 355 |
|
|
nm[1]=vm-vn;
|
| 356 |
|
|
nm[2]=0.;
|
| 357 |
|
|
am[0]=um-ua;
|
| 358 |
|
|
am[1]=vm-va;
|
| 359 |
|
|
am[2]=0.;
|
| 360 |
|
|
int equation[4];
|
| 361 |
|
|
equation[0]=1; /* etat de l'equation 0 */
|
| 362 |
|
|
equation[1]=1;
|
| 363 |
|
|
equation[2]=1;
|
| 364 |
|
|
equation[3]=3; /* cette variable comporte le bilan du nombre d'equation */
|
| 365 |
|
|
double eps2=PSCA(ab,ab);
|
| 366 |
|
|
double eps=sqrt(eps2);
|
| 367 |
|
|
eps=eps*0.0001;
|
| 368 |
|
|
eps2=eps2*0.0001;
|
| 369 |
|
|
/* recherche du nombre d'equation -> inter franche ou para ou confondu */
|
| 370 |
|
|
if ( (EGAL(ab[0],0,eps)) && (EGAL(nm[0],0,eps)) )
|
| 371 |
|
|
if (EGAL(am[0],0,eps)) equation[0]=0; else return(0);
|
| 372 |
|
|
if ( (EGAL(ab[1],0,eps)) && (EGAL(nm[1],0,eps)) )
|
| 373 |
|
|
if (EGAL(am[1],0,eps)) equation[1]=0; else return(0);
|
| 374 |
|
|
if ( (EGAL(ab[2],0,eps)) && (EGAL(nm[2],0,eps)) )
|
| 375 |
|
|
if (EGAL(am[2],0,eps)) equation[2]=0; else return(0);
|
| 376 |
|
|
equation[3]=equation[0]+equation[1]+equation[2];
|
| 377 |
|
|
if (equation[3]==3)
|
| 378 |
|
|
{
|
| 379 |
|
|
double det=DETER(ab[0],nm[0],ab[1],nm[1]);
|
| 380 |
|
|
if (fabs(det)>eps2)
|
| 381 |
|
|
{
|
| 382 |
|
|
det=1/det;
|
| 383 |
|
|
double sol1=det*DETER(am[0],nm[0],am[1],nm[1]);
|
| 384 |
|
|
double sol2=det*DETER(ab[0],am[0],ab[1],am[1]);
|
| 385 |
|
|
if ( (float)fabs((double)(sol1*ab[2]-sol2*nm[2]-am[2]))>eps2) return(0);
|
| 386 |
|
|
return(examine_solution(sol1,sol2,1));
|
| 387 |
|
|
}
|
| 388 |
|
|
else
|
| 389 |
|
|
{
|
| 390 |
|
|
equation[0]=0;
|
| 391 |
|
|
equation[3]=2;
|
| 392 |
|
|
/* on verifie la compatibilite des deux equations dont le det est nul*/
|
| 393 |
|
|
double tmp;
|
| 394 |
|
|
if (ab[0]!=0) tmp=ab[1]*am[0]/ab[0]; else tmp=nm[1]*am[0]/nm[0];
|
| 395 |
|
|
if (!(EGAL(tmp,am[1],eps))) return(0);
|
| 396 |
|
|
}
|
| 397 |
|
|
}
|
| 398 |
|
|
if (equation[3]==2)
|
| 399 |
|
|
{
|
| 400 |
|
|
/* on repere les equations qui existent */
|
| 401 |
|
|
int ne1;
|
| 402 |
|
|
int ne2;
|
| 403 |
|
|
if (equation[0]!=0)
|
| 404 |
|
|
{
|
| 405 |
|
|
ne1=0;
|
| 406 |
|
|
if (equation[1]!=0) ne2=1; else ne2=2;
|
| 407 |
|
|
}
|
| 408 |
|
|
else
|
| 409 |
|
|
{
|
| 410 |
|
|
ne1=1;
|
| 411 |
|
|
ne2=2;
|
| 412 |
|
|
}
|
| 413 |
|
|
|
| 414 |
|
|
double det=DETER(ab[ne1],nm[ne1],ab[ne2],nm[ne2]);
|
| 415 |
|
|
if (fabs(det)>eps2)
|
| 416 |
|
|
{
|
| 417 |
|
|
det=1/det;
|
| 418 |
|
|
double sol1=det*DETER(am[ne1],nm[ne1],am[ne2],nm[ne2]);
|
| 419 |
|
|
double sol2=det*DETER(ab[ne1],am[ne1],ab[ne2],am[ne2]);
|
| 420 |
|
|
return(examine_solution(sol1,sol2,1));
|
| 421 |
|
|
}
|
| 422 |
|
|
else
|
| 423 |
|
|
{
|
| 424 |
|
|
equation[ne1]=0;
|
| 425 |
|
|
equation[3]=1;
|
| 426 |
|
|
/* on verifie la compatibilite des deux equations dont le det est nul */
|
| 427 |
|
|
double tmp;
|
| 428 |
|
|
if (ab[ne1]!=0) tmp=ab[ne2]*am[ne1]/ab[ne1]; else tmp=nm[ne2]*am[ne1]/nm[ne1];
|
| 429 |
|
|
if (!(EGAL(tmp,am[ne2],eps))) return(0);
|
| 430 |
|
|
}
|
| 431 |
|
|
|
| 432 |
|
|
}
|
| 433 |
|
|
if (equation[3]==1)
|
| 434 |
|
|
{
|
| 435 |
|
|
/* on repere l' equation qui existe */
|
| 436 |
|
|
int ne1;
|
| 437 |
|
|
if (equation[0]!=0) ne1=0; else
|
| 438 |
|
|
if (equation[1]!=0) ne1=1; else ne1=2;
|
| 439 |
|
|
double an[3];
|
| 440 |
|
|
an[0]=un-ua;
|
| 441 |
|
|
an[1]=vn-va;
|
| 442 |
|
|
an[2]=0.;
|
| 443 |
|
|
double tmp=1/ab[ne1];
|
| 444 |
|
|
double sol1=am[ne1]*tmp;
|
| 445 |
|
|
double sol2=an[ne1]*tmp;
|
| 446 |
|
|
return(examine_solution(sol1,sol2,2));
|
| 447 |
|
|
}
|
| 448 |
|
|
return(0);
|
| 449 |
|
|
}
|
| 450 |
|
|
|
| 451 |
|
|
|
| 452 |
|
|
|
| 453 |
|
|
int MAILLEUR2D::examine_solution(double sol1,double sol2,int type)
|
| 454 |
|
|
{
|
| 455 |
|
|
double epsilon=0.0001;
|
| 456 |
|
|
|
| 457 |
|
|
if (type==1)
|
| 458 |
|
|
{
|
| 459 |
|
|
if ( (sol1>epsilon) && ((sol1)<(1-epsilon)) && (sol2>epsilon) && ((sol2)<(1-epsilon)) ) return 1;
|
| 460 |
|
|
if ( ( (EGAL(sol1,0,epsilon)) || (EGAL(sol1,1,epsilon))) && ( (sol2>epsilon) && ((sol2)<(1-epsilon)) ) ) return 1;
|
| 461 |
|
|
if ( ( (EGAL(sol2,0,epsilon)) || (EGAL(sol2,1,epsilon))) && ( (sol1>epsilon) && ((sol1)<(1-epsilon)) ) ) return 1;
|
| 462 |
|
|
if ( (sol1>epsilon) && ((sol1)<(1-epsilon)) && (sol2>(-0.1-epsilon)) && ((sol2)<(1.1-epsilon)) ) return 1;
|
| 463 |
|
|
if ( (sol2>epsilon) && ((sol2)<(1-epsilon)) && (sol1>(-0.1-epsilon)) && ((sol1)<(1.1-epsilon)) ) return 1;
|
| 464 |
|
|
|
| 465 |
|
|
}
|
| 466 |
|
|
if (type==2)
|
| 467 |
|
|
{
|
| 468 |
|
|
if ( (sol1>epsilon) && ((sol1)<(1-epsilon)) ) return 1;
|
| 469 |
|
|
if ( (sol2>epsilon) && ((sol2)<(1-epsilon)) ) return 1;
|
| 470 |
|
|
if ( ((sol1)>(1+epsilon)) && ((-sol2)>epsilon) ) return 1;
|
| 471 |
|
|
if ( ((sol2)>(1+epsilon)) && ((-sol1)>epsilon) ) return 1;
|
| 472 |
|
|
}
|
| 473 |
|
|
return 0;
|
| 474 |
|
|
}
|
| 475 |
|
|
#undef EGAL
|
| 476 |
|
|
#undef PSCA
|
| 477 |
|
|
#undef DETER
|
| 478 |
|
|
///FIN DU CODE DE DEA
|
