2 // C++ : Gestion des Quadrangles
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/ or email : webmaster.salome@opencascade.com
22 #include "HexQuad.hxx"
24 #include "HexDocument.hxx"
25 #include "HexHexa.hxx"
26 #include "HexElements.hxx"
27 #include "HexGlobale.hxx"
29 #include "HexXmlWriter.hxx"
30 #include "HexNewShape.hxx"
31 #include "HexFaceShape.hxx"
37 // ======================================================== Constructeur
38 Quad::Quad (Vertex* va, Vertex* vb, Vertex* vc, Vertex* vd)
39 : EltBase (va->dad(), EL_QUAD)
46 q_orientation = Q_UNDEFINED;
48 for (int nro=0 ; nro<QUAD4 ; nro++)
50 q_edge [nro] = new Edge (q_vertex[nro],
51 q_vertex[(nro+1) MODULO QUAD4]);
53 if (BadElement (q_vertex [nro]) || BadElement (q_edge [nro]))
56 for (int nv=nro+1 ; nv<QUAD4 ; nv++)
57 if (q_vertex[nv] == q_vertex[nro])
61 if (el_root != NULL && el_status==HOK)
62 el_root->addQuad (this);
65 // ======================================================== Constructeur bis
66 Quad::Quad (Edge* ea, Edge* eb, Edge* ec, Edge* ed)
67 : EltBase (ea->dad(), EL_QUAD)
74 q_orientation = Q_UNDEFINED;
76 for (int nro=0 ; nro<QUAD4 ; nro++)
78 int prec = (nro+1) MODULO QUAD4;
81 if (BadElement (q_edge[nro]))
85 for (int nv=nro+1 ; nv<QUAD4 ; nv++)
86 if (q_edge[nv] == q_edge[nro])
88 int nc = q_edge[nro] -> inter (q_edge[prec]);
90 node = q_edge[nro]->getVertex (nc);
94 q_vertex [prec] = node;
99 printf (" +++++++++++++++++++++++++++++++++++++++++++ \n");
100 printf (" +++ Quadrangle impossible \n");
101 printf (" +++++++++++++++++++++++++++++++++++++++++++ \n");
103 printf (" +++++++++++++++++++++++++++++++++++++++++++ \n");
105 for (int ned=0; ned<QUAD4; ned++)
107 q_edge[ned]->dumpPlus ();
109 HexDump (q_vertex[0]);
110 HexDump (q_vertex[1]);
111 HexDump (q_vertex[2]);
112 HexDump (q_vertex[3]);
114 printf (" +++++++++++++++++++++++++++++++++++++++++++ \n");
115 fatal_error ("Quadrangle impossible");
118 if (el_root != NULL && el_status==HOK)
119 el_root->addQuad (this);
122 // ======================================================== Constructeur ter
123 Quad::Quad (Quad* other)
124 : EltBase (other->dad(), EL_QUAD)
126 for (int nro=0 ; nro<QUAD4 ; nro++)
129 q_vertex [nro] = NULL;
131 q_orientation = Q_UNDEFINED;
134 if (el_root != NULL && el_status==HOK)
135 el_root->addQuad (this);
137 // ============================================================ getEdge
138 Edge* Quad::getEdge (int nro)
141 if (nro >=0 && nro < QUAD4 && el_status == HOK && q_edge [nro]->isValid())
144 DumpStart ("getEdge", nro);
148 // ============================================================ getVertex
149 Vertex* Quad::getVertex (int nro)
152 if (nro >=0 && nro < QUAD4 && el_status == HOK && q_vertex [nro]->isValid())
153 elt = q_vertex [nro];
155 DumpStart ("getVertex", nro);
159 // ========================================================= majReferences
160 void Quad::majReferences ()
162 for (int nro=0 ; nro<QUAD4 ; nro++)
163 q_edge [nro] -> addParent (this);
165 // ========================================================= getParent
166 Hexa* Quad::getParent (int nro)
168 return static_cast <Hexa*> (getFather (nro));
170 // ======================================================== anaMerge
171 int Quad::anaMerge (Vertex* v1, Vertex* v2, Vertex* tv1[], Edge* te1[])
174 for (int nro=0 ; orig == NOTHING && nro < QUAD4 ; nro++)
175 if (q_vertex [nro] == v1)
181 int nsp1 = (orig+1) MODULO QUAD4;
182 int nsm1 = (orig+QUAD4-1) MODULO QUAD4;
184 if (q_vertex [nsp1] == v2)
186 for (int nro=0 ; nro < QUAD4 ; nro++)
188 tv1 [nro] = q_vertex [(orig+nro) MODULO QUAD4];
189 te1 [nro] = q_edge [(orig+nro) MODULO QUAD4];
192 else if (q_vertex [nsm1] == v2)
194 for (int nro=0 ; nro < QUAD4 ; nro++)
196 tv1 [nro] = q_vertex [(orig+QUAD4-nro) MODULO QUAD4];
197 te1 [nro] = q_edge [(orig+QUAD4-nro) MODULO QUAD4];
205 // ======================================================== ordoVertex
206 int Quad::ordoVertex (Vertex* v1, Vertex* v2, Vertex* tver[])
209 for (int nro=0 ; orig == NOTHING && nro < QUAD4 ; nro++)
210 if (q_vertex [nro] == v1)
216 int nsp1 = (orig+1) MODULO QUAD4;
217 int nsm1 = (orig+QUAD4-1) MODULO QUAD4;
219 if (q_vertex [nsp1] == v2)
221 for (int nro=0 ; nro < QUAD4 ; nro++)
222 tver [nro] = q_vertex [(orig+nro) MODULO QUAD4];
224 else if (q_vertex [nsm1] == v2)
226 for (int nro=0 ; nro < QUAD4 ; nro++)
227 tver [nro] = q_vertex [(orig+QUAD4-nro) MODULO QUAD4];
234 // ======================================================== ordonner
235 int Quad::ordonner (Vertex* v1, Vertex* v2, Vertex* tver[], Edge* ted[])
237 tver [0] = tver [1] = tver [2] = tver [3] = NULL;
238 ted [0] = ted [1] = ted [2] = ted [3] = NULL;
240 int ier = ordoVertex (v1, v2, tver);
244 for (int nro=0 ; nro < QUAD4 ; nro++)
245 ted [nro] = findEdge (tver[nro], tver [(nro+1) MODULO QUAD4]);
249 // ======================================================== getBrother
250 Quad* Quad::getBrother (StrOrient* orient)
252 /* *****************************
253 printf (" getBrother ");
255 printf (" .. Base : ");
256 orient->v21->printName();
257 orient->v22->printName();
258 printf ("dir=%d, arete=", orient->dir);
259 ***************************** */
261 int n21 = indexVertex (orient->v21);
262 int n22 = indexVertex (orient->v22);
264 int sens = n22 - n21;
265 if (sens > 1) sens -= QUAD4;
266 if (sens < -1) sens += QUAD4;
267 if (sens*sens !=1) return NULL;
271 case OR_LEFT : n22 = n21 - sens;
273 case OR_RIGHT : n21 = n22 + sens;
275 case OR_FRONT : n21 += 2;
281 n21 = (n21 + QUAD4) MODULO QUAD4;
282 n22 = (n22 + QUAD4) MODULO QUAD4;
284 orient->v21 = q_vertex [n21];
285 orient->v22 = q_vertex [n22];
287 Edge* arete = findEdge (orient->v21, orient->v22);
288 // arete->printName("\n");
290 int nbfreres = arete->getNbrParents ();
292 for (int nq = 0 ; nq < nbfreres ; nq++)
294 Quad* next = arete->getParent (nq);
295 if (next!=NULL && next != this )
297 int nbp = next->getNbrParents();
298 Hexa* dad = next->getParent(0);
299 int mark = next->getMark();
300 int mark2 = dad ? dad->getMark() : IS_NONE;
302 if (nbp <= 1 && mark2 != IS_MARRIED && mark == IS_NONE)
304 // if (nbp <= 1 && mark == IS_NONE)
310 // ======================================================== coupler
311 int Quad::coupler (Quad* other, StrOrient* orient, Elements* table)
316 Hexa* hexa = other->getParent(0);
318 setMark (IS_MARRIED);
319 other->setMark (IS_MARRIED);
321 hexa->setMark (IS_MARRIED);
323 for (int ned = 0 ; ned < QUAD4 ; ned++)
325 Edge* arete = q_edge[ned];
326 int nbfreres = arete ->getNbrParents ();
327 for (int nq = 0 ; nq < nbfreres ; nq++)
329 Quad* next = arete->getParent (nq);
330 if (next!=NULL && next != this && next->getMark() > 0)
332 StrOrient new_ori (orient);
333 new_ori.dir = OR_FRONT;
334 Vertex* va = arete->getVertex (V_AMONT);
335 Vertex* vb = arete->getVertex (V_AVAL);
337 // On voit si un point de repere est conserve
338 if (va == orient->v11)
341 new_ori.dir += OR_LEFT;
343 else if (vb == orient->v11)
346 new_ori.dir += OR_LEFT;
349 if (va == orient->v12)
352 new_ori.dir += OR_RIGHT;
354 else if (vb == orient->v12)
357 new_ori.dir += OR_RIGHT;
360 if (new_ori.dir == OR_FRONT)
362 if (definedBy (va, orient->v11))
374 int nro = next->getMark ();
375 Quad* beauf = other->getBrother (&new_ori);
376 int ier = table->coupler (nro, beauf, &new_ori);
379 ier = next->coupler (beauf, &new_ori, table);
387 // ======================================================== getOpposVertex
388 Vertex* Quad::getOpposVertex (Vertex* start)
390 int na = indexVertex (start);
393 return q_vertex [(na+2) MODULO QUAD4];
395 // ======================================================== getOpposEdge
396 Edge* Quad::getOpposEdge (Edge* start, int& sens)
399 int na = indexVertex (start->getVertex (V_AMONT));
400 int nb = indexVertex (start->getVertex (V_AVAL));
402 Vertex* vaprim = q_vertex [(nb+2) MODULO QUAD4];
403 Vertex* vbprim = q_vertex [(na+2) MODULO QUAD4];
405 for (int ned = 0 ; ned < QUAD4 ; ned++)
407 if ( q_edge[ned]->getVertex(V_AMONT) == vaprim
408 && q_edge[ned]->getVertex(V_AVAL ) == vbprim)
413 else if ( q_edge[ned]->getVertex(V_AMONT) == vbprim
414 && q_edge[ned]->getVertex(V_AVAL ) == vaprim)
420 // TODO : traiter l'erreur
421 cout << " ... Probleme dans Quad::getOpposedEdge :" << endl;
422 HexDisplay (el_name);
430 for (int ned = 0 ; ned < QUAD4 ; ned++)
435 // ========================================================= saveXml
436 void Quad::saveXml (XmlWriter* xml)
441 for (int nro=0 ; nro<QUAD4 ; nro++)
443 if (nro>0) edges += " ";
444 edges += q_edge[nro]->getName(buffer);
447 xml->openMark ("Quad");
448 xml->addAttribute ("id", getName (buffer));
449 xml->addAttribute ("edges", edges);
451 xml->addAttribute ("name", el_name);
454 int nbass = tab_assoc.size();
455 for (int nro=0 ; nro<nbass ; nro++)
456 if (tab_assoc[nro] != NULL)
457 tab_assoc[nro]->saveXml (xml);
459 // ======================================================== replaceEdge
460 void Quad::replaceEdge (Edge* old, Edge* par)
462 for (int nro=0 ; nro<QUAD4 ; nro++)
464 if (q_edge[nro]==old)
471 printf (" [%d], ", nro);
472 old->printName (" est remplace par ");
473 par->printName ("\n");
478 // ======================================================== replaceVertex
479 void Quad::replaceVertex (Vertex* old, Vertex* par)
481 for (int nro=0 ; nro<QUAD4 ; nro++)
483 if (q_vertex [nro]==old)
485 q_vertex [nro] = par;
490 printf (" [%d], ", nro);
491 old->printName (" est remplace par ");
492 par->printName ("\n");
497 // ======================================================== dump
503 printf ("*** deleted ***)\n");
507 for (int nro=0 ; nro<QUAD4 ; nro++)
508 PrintName (q_edge[nro]);
512 for (int nro=0 ; nro<QUAD4 ; nro++)
513 PrintName (q_vertex[nro]);
518 // ======================================================== dumpPlus
519 void Quad::dumpPlus ()
525 for (int nro=0 ; nro < QUAD4 ; nro++)
527 Vertex* pv = q_vertex[nro];
532 printf ( " (%g, %g, %g)\n", pv->getX(), pv->getY(), pv->getZ());
540 // ======================================================== getOpposEdge (2)
541 Edge* Quad::getOpposEdge (Edge* start)
543 int na = indexEdge (start);
546 return q_edge [(na+2) MODULO QUAD4];
548 // ======================================================== getPerpendicular
549 Edge* Quad::getPerpendicular (Edge* arete, Vertex* node)
551 int na = indexEdge (arete);
555 int nv = arete->index (node);
558 Edge* perp = q_edge [(na+1) MODULO QUAD4];
560 nv = perp->index (node);
564 perp = q_edge [(na+3) MODULO QUAD4];
565 nv = perp->index (node);
571 static cpchar t_ori[] = {"Q_INSIDE", "Q_DIRECT", "Q_INVERSE", "Q_UNDEF"};
572 // ======================================================== setOrientation
573 void Quad::setOrientation (int ori)
576 if (db && (ori==Q_DIRECT || ori==Q_INVERSE))
577 printf (" %s = %s\n", el_name.c_str(), t_ori [ q_orientation ]);
579 // ======================================================== setOrientation
580 int Quad::setOrientation ()
582 q_orientation = Q_INSIDE;
583 if (getNbrParents() != 1)
584 return q_orientation;
586 Real3 cg, orig, pi, pj, vi, vj, vk;
588 Hexa* hexa = getParent(0);
589 hexa->getCenter (cg);
591 /********************************************************************
594 for (int np=0 ; np < QUAD4 ; np++)
596 q_vertex [np ] -> getPoint (orig);
597 q_vertex [(np+1) % 4] -> getPoint (pi);
598 q_vertex [(np+3) % 4] -> getPoint (pj);
600 calc_vecteur (orig, pi, vi);
601 calc_vecteur (orig, pj, vj);
602 calc_vecteur (orig, cg, vk);
603 double pmixte = prod_mixte (vi, vj, vk);
604 q_orientation = pmixte > ZEROR ? Q_DIRECT : Q_INVERSE;
605 if (pmixte>0) printf (">");
611 ******************************************************************* */
612 q_vertex [0] -> getPoint (orig);
613 q_vertex [1] -> getPoint (pi);
614 q_vertex [3] -> getPoint (pj);
616 calc_vecteur (orig, pi, vi);
617 calc_vecteur (orig, pj, vj);
618 calc_vecteur (cg, orig, vk);
620 double pmixte = prod_mixte (vi, vj, vk);
621 q_orientation = pmixte > ZEROR ? Q_DIRECT : Q_INVERSE;
623 printf (" %s := %s\n", el_name.c_str(), t_ori [ q_orientation ]);
624 return q_orientation;
626 // ========================================================== clearAssociation
627 void Quad::clearAssociation ()
630 is_associated = false;
632 // ========================================================== addAssociation
633 int Quad::addAssociation (NewShape* geom, int subid)
638 FaceShape* face = geom->findFace (subid);
639 int ier = addAssociation (face);
643 // ========================================================== addAssociation
644 int Quad::addAssociation (FaceShape* face)
649 face->addAssociation (this);
650 tab_assoc.push_back (face);
651 is_associated = true;
654 // ========================================================== getAssociation
655 FaceShape* Quad::getAssociation (int nro)
657 if (nro < 0 || nro >= (int)tab_assoc.size())
660 return tab_assoc [nro];
662 // ======================================================== commonEdge
663 Edge* Quad::commonEdge (Quad* other)
665 for (int ne1=0 ; ne1<QUAD4 ; ne1++)
666 for (int ne2=0 ; ne2<QUAD4 ; ne2++)
667 if (q_edge [ne1] == other->q_edge [ne2])
672 // ======================================================== Inter
673 int Quad::inter (Quad* other, int& nother)
675 for (int ne1=0 ; ne1<QUAD4 ; ne1++)
676 for (int ne2=0 ; ne2<QUAD4 ; ne2++)
677 if (q_edge [ne1] == other->q_edge [ne2])
686 // ======================================================== Inter (2)
687 Edge* Quad::inter (Quad* other)
689 for (int ne1=0 ; ne1<QUAD4 ; ne1++)
690 for (int ne2=0 ; ne2<QUAD4 ; ne2++)
691 if (q_edge [ne1] == other->q_edge [ne2])
695 // ============================================================ definedBy (v)
696 bool Quad::definedBy (Vertex* v1, Vertex* v2)
698 for (int n1=0 ; n1< QUAD4 ; n1++)
699 if (v1 == q_vertex[n1] && v2 == q_vertex[(n1+2) MODULO QUAD4])
704 // ============================================================ definedBy (e)
705 bool Quad::definedBy (Edge* e1, Edge* e2)
707 if (e1==e2 || BadElement (e1) || BadElement (e2))
710 bool f1=false, f2=false;
711 for (int ned=0 ; ned< QUAD4 ; ned++)
712 if (e1 == q_edge[ned]) f1 = true;
713 else if (e2 == q_edge[ned]) f2 = true;
714 // if (e1 == q_edge[ned] && e2 == q_edge[(ned+2) MODULO QUAD4]) return true;
718 // =============================================================== findEdge
719 Edge* Quad::findEdge (Vertex* v1, Vertex* v2)
721 for (int nro=0 ; nro< QUAD4 ; nro++)
723 Vertex* va = q_edge[nro]->getVertex(V_AMONT) ;
724 Vertex* vb = q_edge[nro]->getVertex(V_AVAL) ;
725 if ((v1==va && v2==vb) || (v1==vb && v2==va))
731 // =============================================================== indexVertex
732 int Quad::indexVertex (Vertex* elt)
734 for (int n1=0 ; n1< QUAD4 ; n1++)
735 if (elt == q_vertex[n1])
740 // =============================================================== indexEdge
741 int Quad::indexEdge (Edge* elt)
743 for (int n1=0 ; n1< QUAD4 ; n1++)
744 if (elt == q_edge[n1])
749 // =============================================================== setColor
750 void Quad::setColor (double val)
752 for (int n1=0 ; n1< QUAD4 ; n1++)
753 q_vertex[n1] -> setColor (val);
755 // =============================================================== duplicate
756 void Quad::duplicate ()
758 q_orientation = Q_UNDEFINED;
759 q_clone = new Quad (GetClone (q_edge [E_A]),
760 GetClone (q_edge [E_B]),
761 GetClone (q_edge [E_C]),
762 GetClone (q_edge [E_D]));
763 q_clone->tab_assoc = tab_assoc;
765 // ============================================================ nearestVertex
766 Vertex* Quad::nearestVertex (Vertex* other)
768 if (BadElement (other))
773 int nbre = countVertex ();
774 for (int nro=0 ; nro<nbre ; nro++)
776 Vertex* vert = getVertex (nro);
777 double dist = other->dist2 (vert);
786 // =============================================================== reorienter
787 void Quad::reorienter ()
789 if (q_orientation != Q_INVERSE)
792 Edge* edge = q_edge [E_B];
793 q_edge [E_B] = q_edge [E_D];
796 q_vertex [E_A] = q_edge [E_D]->commonVertex(q_edge [E_A]);
797 q_vertex [E_B] = q_edge [E_A]->commonVertex(q_edge [E_B]);
798 q_vertex [E_C] = q_edge [E_B]->commonVertex(q_edge [E_C]);
799 q_vertex [E_D] = q_edge [E_C]->commonVertex(q_edge [E_D]);
802 printf (" %s est reoriente\n", el_name.c_str());
803 q_orientation = Q_DIRECT;