2 // C++ : Gestion des aretes
4 // Copyright (C) 2009-2013 CEA/DEN, EDF R&D
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/
21 // or email : webmaster.salome@opencascade.com
23 #include "HexEdge.hxx"
24 #include "HexVertex.hxx"
25 #include "HexQuad.hxx"
27 #include "HexPropagation.hxx"
28 #include "HexXmlWriter.hxx"
29 #include "HexNewShape.hxx"
30 #include "HexAssoEdge.hxx"
31 #include "HexVertexShape.hxx"
33 static int niveau = 0;
37 static bool db = on_debug();
39 void geom_dump_asso (Edge* edge);
41 // ======================================================== Constructeur
42 Edge::Edge (Vertex* va, Vertex* vb)
43 : EltBase (va->dad(), EL_EDGE)
45 e_vertex [V_AMONT] = va;
46 e_vertex [V_AVAL ] = vb;
55 else if (BadElement (va) || BadElement (vb))
67 el_root->addEdge (this);
70 // ======================================================== Constructeur 2
71 Edge::Edge (Edge* other)
72 : EltBase (other->dad(), EL_EDGE)
74 e_vertex [V_AMONT] = e_vertex [V_AVAL ] = NULL;
75 if (BadElement (other))
84 el_root->addEdge (this);
86 // ======================================================== majReferences
87 void Edge::majReferences ()
89 e_vertex [V_AMONT]->addParent (this);
90 e_vertex [V_AVAL ]->addParent (this);
92 // ======================================================== anaMerge
93 int Edge::anaMerge (Vertex* orig, Vertex* tv1[])
97 if (orig == e_vertex [V_AMONT])
98 tv1 [1] = e_vertex[V_AVAL];
99 else if (orig == e_vertex [V_AVAL])
100 tv1 [1] = e_vertex[V_AMONT];
106 // ========================================================= propager
107 void Edge::propager (Propagation* prop, int groupe, int sens)
109 setPropag (groupe, sens>0);
110 prop->addEdge (this);
113 int nbquads = getNbrParents ();
114 for (int nq=0 ; nq<nbquads ; nq++)
116 Quad* quad = getParent (nq);
117 if (quad!=NULL && quad->hasParents())
121 printf ("Prop : niv=%d edge=", niveau);
123 printf ("parent=%d quad=", nq);
124 quad->printName ("\n");
129 Edge* arete = quad->getOpposEdge (this, meme);
130 if (arete != NULL && arete->getPropag () < 0)
131 arete->propager (prop, groupe, meme*sens);
136 // ========================================================= setPropag
137 void Edge::setPropag (int nro, bool sens)
144 int prems = sens ? 0 : 1;
145 Vertex* v1 = getVertex ( prems);
146 Vertex* v2 = getVertex (1-prems);
148 cout << " setPropag " << el_name
150 << " = (" << v1->getName() << ", " << v2->getName()
151 << ") = (" << v2->getX() - v1->getX()
152 << ", " << v2->getY() - v1->getY()
153 << ", " << v2->getZ() - v1->getZ()
156 // ========================================================= getParent
157 Quad* Edge::getParent (int nro)
159 return static_cast <Quad*> (getFather (nro));
161 // ========================================================= saveXml
162 void Edge::saveXml (XmlWriter* xml)
165 string vertices = e_vertex [V_AMONT]->getName(buffer);
167 vertices += e_vertex [V_AVAL ]->getName(buffer);
169 xml->openMark ("Edge");
170 xml->addAttribute ("id", getName (buffer));
171 xml->addAttribute ("vertices", vertices);
173 xml->addAttribute ("name", el_name);
176 int nbass = tab_assoc.size();
177 for (int nro=0 ; nro<nbass ; nro++)
178 if (tab_assoc[nro] != NULL)
179 tab_assoc[nro]->saveXml (xml);
181 // ======================================================== replaceVertex
182 void Edge::replaceVertex (Vertex* old, Vertex* par)
184 for (int nro=0 ; nro<QUAD4 ; nro++)
186 if (e_vertex[nro]==old)
193 printf (" [%d], ", nro);
194 old->printName (" est remplace par ");
195 par->printName ("\n");
200 // ======================================================== dump
206 printf ("*** deleted ***)\n");
210 e_vertex[V_AMONT]->printName(", ");
211 e_vertex[V_AVAL] ->printName(")");
214 char signe = e_way ? '+' : '-';
215 printf (", Prop= %c%d", signe, e_propag);
220 // ======================================================== dumpAsso
221 void Edge::dumpAsso ()
225 printName(" = *** deleted **\n");
229 geom_dump_asso (this);
231 // ======================================================== dumpPlus
232 void Edge::dumpPlus ()
235 for (int nro=0 ; nro < V_TWO ; nro++)
237 Vertex* pv = e_vertex[nro];
242 printf (" (%g, %g, %g)\n", pv->getX(), pv->getY(), pv->getZ());
250 // ======================================================== makeDefinition
251 string Edge::makeDefinition ()
253 string definition = el_name;
255 definition += " = (";
256 definition += e_vertex [V_AMONT]->getName();
258 definition += e_vertex [V_AVAL]->getName();
263 // ===================================================== addAssociation
264 int Edge::addAssociation (EdgeShape* gline, double deb, double fin)
269 gline->addAssociation (this);
270 AssoEdge* asso = new AssoEdge (gline, deb, fin);
271 tab_assoc.push_back (asso);
275 cout << " Edge " << el_name
276 << " = (" << e_vertex[V_AMONT]->getName()
277 << " , " << e_vertex[V_AVAL ]->getName()
278 << ") addAssociation " << gline->getName ()
279 << " (" << deb << ", " << fin << ")"
281 PutCoord (asso->getOrigin ());
282 PutCoord (asso->getExtrem ());
284 is_associated = true;
287 // ========================================================== addAssociation
288 int Edge::addAssociation (NewShape* geom, int subid, double deb, double fin)
292 if (el_root->debug ())
293 cout << " Edge " << el_name << " addAssociation of NULL ignored"
298 EdgeShape* gline = geom->findEdge (subid);
299 int ier = addAssociation (gline, deb, fin);
302 // ================================================== clearAssociation
303 void Edge::clearAssociation ()
305 int nombre = tab_assoc.size ();
306 for (int nro=0 ; nro<nombre ; nro++)
308 delete tab_assoc [nro];
312 is_associated = false;
314 // ================================================== getAssociation
315 AssoEdge* Edge::getAssociation (int nro)
317 if (nro<0 || nro >= (int)tab_assoc.size())
320 return tab_assoc [nro];
322 // =============================================================== getVertex
323 Vertex* Edge::getVertex(int nro)
326 if (nro >=0 && nro < V_TWO && el_status == HOK
327 && e_vertex [nro]->isValid())
328 elt = e_vertex [nro];
332 // =============================================================== index
333 int Edge::index (Vertex* node)
335 return node == NULL ? NOTHING
336 : node == e_vertex[V_AMONT] ? V_AMONT
337 : node == e_vertex[V_AVAL ] ? V_AVAL : NOTHING;
339 // ============================================================= opposedVertex
340 Vertex* Edge::opposedVertex (Vertex* sommet)
342 int nro = index (sommet);
343 return nro<0 ? NULL : e_vertex[1-nro];
345 // ============================================================= commonVertex
346 Vertex* Edge::commonVertex (Edge* other)
348 int nro = inter (other);
349 return nro<0 ? NULL : e_vertex[nro];
351 // ============================================================= commonPoint
352 double* Edge::commonPoint (Edge* other, double point[])
354 Vertex* commun = commonVertex (other);
357 point[dir_x] = point[dir_y] = point[dir_z] = 0;
361 commun->getPoint (point);
364 // =============================================================== inter
365 int Edge::inter (Edge* other)
368 return inter (other, nro);
370 // =============================================================== inter
371 int Edge::inter (Edge* other, int& nother)
373 for (int ni=0 ; ni<V_TWO ; ni++)
374 for (int nj=0 ; nj<V_TWO ; nj++)
375 if (e_vertex[ni] == other->e_vertex[nj])
384 // =============================================================== definedBy
385 bool Edge::definedBy (Vertex* v1, Vertex* v2)
387 bool rep = (v1 == e_vertex[V_AMONT] && v2 == e_vertex[V_AVAL ])
388 || (v1 == e_vertex[V_AVAL ] && v2 == e_vertex[V_AMONT]);
391 // =============================================================== setColor
392 void Edge::setColor (double val)
394 e_vertex [V_AMONT]->setColor (val);
395 e_vertex [V_AVAL ]->setColor (val);
397 // =============================================================== duplicate
398 void Edge::duplicate ()
400 e_clone = new Edge (GetClone (e_vertex [V_AMONT]),
401 GetClone (e_vertex [V_AVAL ]));
403 // e_clone->tab_shapes = tab_shapes;
404 e_clone->tab_assoc = tab_assoc;
406 // =============================================================== getVector
407 double* Edge::getVector (double vecteur[])
410 if (e_vertex[V_AMONT]==NULL || e_vertex[V_AVAL]==NULL)
412 vecteur [dir_x] = vecteur [dir_y] = vecteur [dir_z] = 0;
416 vecteur[dir_x] = e_vertex[V_AVAL]->getX() - e_vertex[V_AMONT]->getX();
417 vecteur[dir_y] = e_vertex[V_AVAL]->getY() - e_vertex[V_AMONT]->getY();
418 vecteur[dir_z] = e_vertex[V_AVAL]->getZ() - e_vertex[V_AMONT]->getZ();
422 // ========================================================== checkAssociation
423 int Edge::checkAssociation ()
425 int nombre = tab_assoc.size();
429 Real3 ver_assoc [V_TWO];
430 int arc [V_TWO], sens [V_TWO];
431 for (int nro=0 ; nro<V_TWO ; ++nro)
433 arc [nro] = sens [nro] = NOTHING;
434 e_vertex[nro]->getAssoCoord (ver_assoc[nro]);
438 for (int nass=0 ; nass<nombre ; ++nass)
440 AssoEdge* asso = tab_assoc[nass];
441 for (int nro = V_AMONT ; nro<=V_AVAL ; ++nro)
443 int rep = asso->onExtremity (ver_assoc[nro]);
446 if (arc[nro] != NOTHING)
448 if (ier==HOK) cout << endl;
449 cout << " Association Edge " << el_name
450 << " : Le vertex " << e_vertex[nro]->getName()
451 << " : Le vertex " << e_vertex[nro]->getName()
452 << " Touche les lignes " << arc [nro]
453 << " et " << nass << endl;
462 for (int nro=0 ; nro<V_TWO ; ++nro)
464 if (arc [nro] == NOTHING)
466 if (ier==HOK) cout << endl;
467 cout << " Association Edge " << el_name
468 << " : Le vertex nro " << nro
469 << " = " << e_vertex[nro]->getName()
470 << " est isole" << endl;
471 PutCoord (ver_assoc[nro]);
478 cout << " ** Controle associations (" << nombre << ") edge " << el_name
479 << " = (" << e_vertex[V_AMONT]->getName()
480 << " , " << e_vertex[V_AVAL ]->getName()
483 for (int nv=0 ; nv<2 ; ++nv)
485 Vertex* node = e_vertex[nv];
486 cout << node->getName() << " = (" << node->getX()
487 << ", " << node->getY() << ", " << node->getZ()
488 << ") -> "<< ver_assoc [nv][0] << ", " << ver_assoc [nv][1]
489 << ", " << ver_assoc [nv][2] << ")" << endl;
492 for (int nass=0 ; nass<nombre ; ++nass)
494 AssoEdge* asso = tab_assoc[nass];
495 cout << " " << nass << " :";
501 // ========================================================== getAssoLen
502 double Edge::getAssoLen ()
504 int nombre = tab_assoc.size();
509 e_vertex [V_AMONT]-> getAssoCoord (p1);
510 e_vertex [V_AVAL ]-> getAssoCoord (p2);
511 longueur = calc_distance (p1, p2);
515 for (int nass=0 ; nass<nombre ; ++nass)
516 longueur += tab_assoc[nass]->length ();
521 // ========================================================= getLength
522 double Edge::getLength ()
525 e_vertex [V_AMONT]-> getAssoCoord (p1);
526 e_vertex [V_AVAL ]-> getAssoCoord (p2);
527 double longueur = calc_distance (p1, p2);
530 // ========================================================= findAssociation
531 int Edge::findAssociation (NewShape* geom)
537 e_vertex [V_AMONT]-> getAssoCoord (point);
538 e_vertex [V_AVAL ]-> getAssoCoord (p2);
540 EdgeShape* gline = geom->findEdge (point, p2);
543 cout << " *** FindAssociation " << el_name << endl;
544 for (int nv=0 ; nv < V_TWO ; ++nv)
546 e_vertex [nv]-> getAssoCoord (point);
547 VertexShape* shape = geom->findVertex (point);
548 cout << " *** Vertex nro " << nv;
551 cout << " absent : ";
556 cout << " : Subid = " << shape->getIdent() << endl;
563 addAssociation (gline, 0, 1);
564 return gline->getIdent();
566 // ========================================================= setAssociation
567 int Edge::setAssociation (NewShape* geom, int subid)
571 if (el_root->debug ())
572 cout << " Edge " << el_name << " addAssociation of NULL ignored"
577 EdgeShape* gline = geom->findEdge (subid);
580 if (el_root->debug ())
581 cout << " Edge " << el_name << " addAssociation bad subid : "
586 Real3 p1, p2, pa, pb;
587 gline->getCoords (p1, p2);
588 e_vertex [V_AMONT]-> getAssoCoord (pa);
589 e_vertex [V_AVAL ]-> getAssoCoord (pb);
591 double da1 = calc_d2 (pa, p1);
592 double da2 = calc_d2 (pa, p2);
593 double db1 = calc_d2 (pb, p1);
594 double db2 = calc_d2 (pb, p2);
596 cout << "setAssociation " << el_name << " :" <<endl;
598 if (da2 < da1 && db1 < db2)
600 e_vertex [V_AMONT]->setAssociation (p2);
601 e_vertex [V_AVAL ]->setAssociation (p1);
605 e_vertex [V_AMONT]->setAssociation (p1);
606 e_vertex [V_AVAL ]->setAssociation (p2);
611 int ier = addAssociation (gline, 0, 1);