| 1 |
francois |
283 |
|
| 2 |
|
|
#include <stdio.h> |
| 3 |
|
|
#include <math.h> |
| 4 |
|
|
#include "r3d_struct.h" |
| 5 |
|
|
#include "m3d_const.h" |
| 6 |
|
|
#include "prototype2.h" |
| 7 |
|
|
extern float elan ; |
| 8 |
|
|
extern GEST_MEM *gest_r ; |
| 9 |
|
|
int r3d_test2(FACE *face,float amin,int index,NOEUD **lis_possible,int *lis_signe,float *critere,float *coord,FACE **finter,int *nb_face,int *ierr) |
| 10 |
|
|
{ |
| 11 |
|
|
NOEUD *noe_p ; |
| 12 |
|
|
FACE *face1, *face2, *face3; |
| 13 |
|
|
NOEUD *nj1, *nj2, *nj3, *n1, *n2, *n3, *n4 ; |
| 14 |
|
|
int j1, j2, j3, num_c ; |
| 15 |
|
|
int min_j ; |
| 16 |
|
|
TETRAEDRE *tetra ; |
| 17 |
|
|
CONNEC *connec ; |
| 18 |
|
|
int nb_killed ; |
| 19 |
|
|
|
| 20 |
|
|
noe_p = (NOEUD*)lis_possible[index] ;/* adresse du noeud selecte */ |
| 21 |
|
|
|
| 22 |
|
|
*nb_face = 0 ; |
| 23 |
|
|
n1 = n2 = n3 = NULL ; |
| 24 |
|
|
/* point connectable ? */ |
| 25 |
|
|
if (noe_p->mark == KILLED) return(FAUX) ;/* point elimine */ |
| 26 |
|
|
/* point interieur = on pourrait le prendre par la suite */ |
| 27 |
|
|
/* |
| 28 |
|
|
if (noe_p->mark == NO_CONNEC) return(FAUX) ; |
| 29 |
|
|
*/ |
| 30 |
|
|
/* noeud au dessus */ |
| 31 |
|
|
if (lis_signe[index] == NEGATIF) return(FAUX) ; |
| 32 |
|
|
|
| 33 |
|
|
/* tetra aplati */ |
| 34 |
|
|
if (critere[index] < 0.001) return(FAUX) ; |
| 35 |
|
|
|
| 36 |
|
|
/* parcours de la liste des tetras detruites EVITER DE BOUCLER */ |
| 37 |
|
|
connec = (face->n1)->tete ; |
| 38 |
|
|
nb_killed = 0 ; |
| 39 |
|
|
while (connec!=NULL) |
| 40 |
|
|
{ |
| 41 |
|
|
tetra = connec->tetra ;/* tetra connecte au noeud */ |
| 42 |
|
|
if ((tetra->mark == KILLED) &&(gest_r->numele[4*(tetra->num) + 1]!=123456789)) |
| 43 |
|
|
{ |
| 44 |
|
|
if ( (tetra->face1->n1==face->n1) || (tetra->face1->n1==face->n2) || (tetra->face1->n1==face->n3) || (tetra->face1->n1==noe_p)) |
| 45 |
|
|
{ |
| 46 |
|
|
if ( (tetra->face1->n2==face->n1) || (tetra->face1->n2==face->n2) || (tetra->face1->n2==face->n3) |
| 47 |
|
|
|| (tetra->face1->n2==noe_p)) |
| 48 |
|
|
{ |
| 49 |
|
|
if ( (tetra->face1->n3==face->n1) || (tetra->face1->n3==face->n2) || (tetra->face1->n3==face->n3) |
| 50 |
|
|
|| (tetra->face1->n3==noe_p)) |
| 51 |
|
|
{ |
| 52 |
|
|
/* determination du 4 e noeud du tetra */ |
| 53 |
|
|
n4 = NULL ; |
| 54 |
|
|
if ( (tetra->face2->n1!=tetra->face1->n1) && (tetra->face2->n1!=tetra->face1->n2) |
| 55 |
|
|
&& (tetra->face2->n1!=tetra->face1->n3)) |
| 56 |
|
|
{ |
| 57 |
|
|
n4 = tetra->face2->n1 ; |
| 58 |
|
|
} |
| 59 |
|
|
else if ( (tetra->face2->n2!=tetra->face1->n1) && (tetra->face2->n2!=tetra->face1->n2) && |
| 60 |
|
|
(tetra->face2->n2!=tetra->face1->n3)) |
| 61 |
|
|
{ |
| 62 |
|
|
n4 = tetra->face2->n2 ; |
| 63 |
|
|
} |
| 64 |
|
|
else n4 = tetra->face2->n3 ; |
| 65 |
|
|
if ( (n4==face->n1) || (n4==face->n2) || (n4==face->n3) |
| 66 |
|
|
|| (n4==noe_p)) |
| 67 |
|
|
{ |
| 68 |
|
|
nb_killed ++; |
| 69 |
|
|
if (nb_killed>5) |
| 70 |
|
|
{ |
| 71 |
|
|
return(FAUX) ; |
| 72 |
|
|
} |
| 73 |
|
|
} |
| 74 |
|
|
} |
| 75 |
|
|
} |
| 76 |
|
|
} |
| 77 |
|
|
} |
| 78 |
|
|
connec = connec->suivant ; |
| 79 |
|
|
} |
| 80 |
|
|
/* les faces du tetra coupent-elles le front */ |
| 81 |
|
|
*ierr = FAUX ; |
| 82 |
|
|
if (r3d_cpfront2(coord,face,noe_p,finter,nb_face,ierr)) |
| 83 |
|
|
{ |
| 84 |
|
|
return(FAUX) ; |
| 85 |
|
|
} |
| 86 |
|
|
/* dernier test (30/10/1992) */ |
| 87 |
|
|
/* ************************** */ |
| 88 |
|
|
/* test d'existence des faces */ |
| 89 |
|
|
/* ************************** */ |
| 90 |
|
|
if (noe_p->mark == CARD_NULL) return(VRAI) ; |
| 91 |
|
|
nj1 = face->n1 ; |
| 92 |
|
|
nj2 = face->n2 ; |
| 93 |
|
|
nj3 = face->n3 ; |
| 94 |
|
|
j1 = nj1->num ; |
| 95 |
|
|
j2 = nj2->num ; |
| 96 |
|
|
j3 = nj3->num ; |
| 97 |
|
|
num_c = noe_p->num ; |
| 98 |
|
|
/* recherche de la face j3 j2 num_c */ |
| 99 |
|
|
min_j = min(j3,j2) ; |
| 100 |
|
|
min_j = min(min_j,num_c) ; |
| 101 |
|
|
if (min_j==j3) |
| 102 |
|
|
{ |
| 103 |
|
|
n1 = nj3 ; |
| 104 |
|
|
n2 = nj2 ; |
| 105 |
|
|
n3 = noe_p ; |
| 106 |
|
|
} |
| 107 |
|
|
if (min_j==j2) |
| 108 |
|
|
{ |
| 109 |
|
|
n1 = nj2 ; |
| 110 |
|
|
n2 = noe_p ; |
| 111 |
|
|
n3 = nj3 ; |
| 112 |
|
|
} |
| 113 |
|
|
if (min_j==num_c) |
| 114 |
|
|
{ |
| 115 |
|
|
n1 = noe_p ; |
| 116 |
|
|
n2 = nj3 ; |
| 117 |
|
|
n3 = nj2 ; |
| 118 |
|
|
} |
| 119 |
|
|
/* recherche de la face n1,n2,n3 */ |
| 120 |
|
|
face1 = r3d_recface2(coord,n1,n2,n3) ; |
| 121 |
|
|
if (face1!=NULL) |
| 122 |
|
|
{ |
| 123 |
|
|
/* on teste si la face a ete detruite */ |
| 124 |
|
|
if (face1->mark==KILLED) |
| 125 |
|
|
{ |
| 126 |
|
|
/* modif du 21-01-93 */ |
| 127 |
|
|
finter[(*nb_face)] = face1 ; |
| 128 |
|
|
(*nb_face)++ ; |
| 129 |
|
|
} |
| 130 |
|
|
} |
| 131 |
|
|
/* recherche de la face j1 j3 num_c */ |
| 132 |
|
|
min_j = min(j1,j3) ; |
| 133 |
|
|
min_j = min(min_j,num_c) ; |
| 134 |
|
|
if (min_j==j1) |
| 135 |
|
|
{ |
| 136 |
|
|
n1 = nj1 ; |
| 137 |
|
|
n2 = nj3 ; |
| 138 |
|
|
n3 = noe_p ; |
| 139 |
|
|
} |
| 140 |
|
|
if (min_j==j3) |
| 141 |
|
|
{ |
| 142 |
|
|
n1 = nj3 ; |
| 143 |
|
|
n2 = noe_p ; |
| 144 |
|
|
n3 = nj1 ; |
| 145 |
|
|
} |
| 146 |
|
|
if (min_j==num_c) |
| 147 |
|
|
{ |
| 148 |
|
|
n1 = noe_p ; |
| 149 |
|
|
n2 = nj1 ; |
| 150 |
|
|
n3 = nj3 ; |
| 151 |
|
|
} |
| 152 |
|
|
/* recherche de la face n1,n2,n3 */ |
| 153 |
|
|
face2 = r3d_recface2(coord,n1,n2,n3) ; |
| 154 |
|
|
if (face2!=NULL) |
| 155 |
|
|
{ |
| 156 |
|
|
/* on teste si la face a ete detruite */ |
| 157 |
|
|
if (face2->mark==KILLED) |
| 158 |
|
|
{ |
| 159 |
|
|
/* modif du 21-01-93 */ |
| 160 |
|
|
finter[(*nb_face)] = face2 ; |
| 161 |
|
|
(*nb_face)++ ; |
| 162 |
|
|
} |
| 163 |
|
|
} |
| 164 |
|
|
/* recherche de la face j2 j1 num_c */ |
| 165 |
|
|
min_j = min(j2,j1) ; |
| 166 |
|
|
min_j = min(min_j,num_c) ; |
| 167 |
|
|
if (min_j==j2) |
| 168 |
|
|
{ |
| 169 |
|
|
n1 = nj2 ; |
| 170 |
|
|
n2 = nj1 ; |
| 171 |
|
|
n3 = noe_p ; |
| 172 |
|
|
} |
| 173 |
|
|
if (min_j==j1) |
| 174 |
|
|
{ |
| 175 |
|
|
n1 = nj1 ; |
| 176 |
|
|
n2 = noe_p ; |
| 177 |
|
|
n3 = nj2 ; |
| 178 |
|
|
} |
| 179 |
|
|
if (min_j==num_c) |
| 180 |
|
|
{ |
| 181 |
|
|
n1 = noe_p ; |
| 182 |
|
|
n2 = nj2 ; |
| 183 |
|
|
n3 = nj1 ; |
| 184 |
|
|
} |
| 185 |
|
|
/* recherche de la face n1,n2,n3 */ |
| 186 |
|
|
face3 = r3d_recface2(coord,n1,n2,n3) ; |
| 187 |
|
|
if (face3!=NULL) |
| 188 |
|
|
{ |
| 189 |
|
|
/* on teste si la face a ete detruite */ |
| 190 |
|
|
if (face3->mark==KILLED) |
| 191 |
|
|
{ |
| 192 |
|
|
finter[(*nb_face)] = face3 ; |
| 193 |
|
|
(*nb_face)++ ; |
| 194 |
|
|
} |
| 195 |
|
|
} |
| 196 |
|
|
return(VRAI) ; |
| 197 |
|
|
} |
