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 if (BadElement (q_edge[nro]))
82 for (int nv=nro+1 ; nv<QUAD4 ; nv++)
83 if (q_edge[nv] == q_edge[nro])
90 // Cond necessaire : ea disjoint de ec (opposes)
91 int nc = ea->inter (ec);
114 for (int nro=0 ; nro<QUAD4 ; nro++)
116 int prec = (nro+1) MODULO QUAD4;
118 int nc = q_edge[nro] -> inter (q_edge[prec]);
120 node = q_edge[nro]->getVertex (nc);
123 q_vertex [prec] = node;
128 printf (" +++++++++++++++++++++++++++++++++++++++++++ \n");
129 printf (" +++ Quadrangle impossible \n");
130 printf (" +++++++++++++++++++++++++++++++++++++++++++ \n");
132 printf (" +++++++++++++++++++++++++++++++++++++++++++ \n");
134 for (int ned=0; ned<QUAD4; ned++)
136 q_edge[ned]->dumpPlus ();
138 HexDump (q_vertex[0]);
139 HexDump (q_vertex[1]);
140 HexDump (q_vertex[2]);
141 HexDump (q_vertex[3]);
143 printf (" +++++++++++++++++++++++++++++++++++++++++++ \n");
144 fatal_error ("Quadrangle impossible");
147 if (el_root != NULL && el_status==HOK)
148 el_root->addQuad (this);
151 // ======================================================== Constructeur ter
152 Quad::Quad (Quad* other)
153 : EltBase (other->dad(), EL_QUAD)
155 for (int nro=0 ; nro<QUAD4 ; nro++)
158 q_vertex [nro] = NULL;
160 q_orientation = Q_UNDEFINED;
163 if (el_root != NULL && el_status==HOK)
164 el_root->addQuad (this);
166 // ============================================================ getEdge
167 Edge* Quad::getEdge (int nro)
170 if (nro >=0 && nro < QUAD4 && el_status == HOK && q_edge [nro]->isValid())
173 DumpStart ("getEdge", nro);
177 // ============================================================ getVertex
178 Vertex* Quad::getVertex (int nro)
181 if (nro >=0 && nro < QUAD4 && el_status == HOK && q_vertex [nro]->isValid())
182 elt = q_vertex [nro];
184 DumpStart ("getVertex", nro);
188 // ========================================================= majReferences
189 void Quad::majReferences ()
191 for (int nro=0 ; nro<QUAD4 ; nro++)
192 q_edge [nro] -> addParent (this);
194 // ========================================================= getParent
195 Hexa* Quad::getParent (int nro)
197 return static_cast <Hexa*> (getFather (nro));
199 // ======================================================== anaMerge
200 int Quad::anaMerge (Vertex* v1, Vertex* v2, Vertex* tv1[], Edge* te1[])
203 for (int nro=0 ; orig == NOTHING && nro < QUAD4 ; nro++)
204 if (q_vertex [nro] == v1)
210 int nsp1 = (orig+1) MODULO QUAD4;
211 int nsm1 = (orig+QUAD4-1) MODULO QUAD4;
213 if (q_vertex [nsp1] == v2)
215 for (int nro=0 ; nro < QUAD4 ; nro++)
217 tv1 [nro] = q_vertex [(orig+nro) MODULO QUAD4];
218 te1 [nro] = q_edge [(orig+nro) MODULO QUAD4];
221 else if (q_vertex [nsm1] == v2)
223 for (int nro=0 ; nro < QUAD4 ; nro++)
225 tv1 [nro] = q_vertex [(orig+QUAD4-nro) MODULO QUAD4];
226 te1 [nro] = q_edge [(orig+QUAD4-nro) MODULO QUAD4];
234 // ======================================================== ordoVertex
235 int Quad::ordoVertex (Vertex* v1, Vertex* v2, Vertex* tver[])
238 for (int nro=0 ; orig == NOTHING && nro < QUAD4 ; nro++)
239 if (q_vertex [nro] == v1)
245 int nsp1 = (orig+1) MODULO QUAD4;
246 int nsm1 = (orig+QUAD4-1) MODULO QUAD4;
248 if (q_vertex [nsp1] == v2)
250 for (int nro=0 ; nro < QUAD4 ; nro++)
251 tver [nro] = q_vertex [(orig+nro) MODULO QUAD4];
253 else if (q_vertex [nsm1] == v2)
255 for (int nro=0 ; nro < QUAD4 ; nro++)
256 tver [nro] = q_vertex [(orig+QUAD4-nro) MODULO QUAD4];
263 // ======================================================== ordonner
264 int Quad::ordonner (Vertex* v1, Vertex* v2, Vertex* tver[], Edge* ted[])
266 tver [0] = tver [1] = tver [2] = tver [3] = NULL;
267 ted [0] = ted [1] = ted [2] = ted [3] = NULL;
269 int ier = ordoVertex (v1, v2, tver);
273 for (int nro=0 ; nro < QUAD4 ; nro++)
274 ted [nro] = findEdge (tver[nro], tver [(nro+1) MODULO QUAD4]);
278 // ======================================================== getBrother
279 Quad* Quad::getBrother (StrOrient* orient)
281 /* *****************************
282 printf (" getBrother ");
284 printf (" .. Base : ");
285 orient->v21->printName();
286 orient->v22->printName();
287 printf ("dir=%d, arete=", orient->dir);
288 ***************************** */
290 int n21 = indexVertex (orient->v21);
291 int n22 = indexVertex (orient->v22);
293 int sens = n22 - n21;
294 if (sens > 1) sens -= QUAD4;
295 if (sens < -1) sens += QUAD4;
296 if (sens*sens !=1) return NULL;
300 case OR_LEFT : n22 = n21 - sens;
302 case OR_RIGHT : n21 = n22 + sens;
304 case OR_FRONT : n21 += 2;
310 n21 = (n21 + QUAD4) MODULO QUAD4;
311 n22 = (n22 + QUAD4) MODULO QUAD4;
313 orient->v21 = q_vertex [n21];
314 orient->v22 = q_vertex [n22];
316 Edge* arete = findEdge (orient->v21, orient->v22);
317 // arete->printName("\n");
319 int nbfreres = arete->getNbrParents ();
321 for (int nq = 0 ; nq < nbfreres ; nq++)
323 Quad* next = arete->getParent (nq);
324 if (next!=NULL && next != this )
326 int nbp = next->getNbrParents();
327 Hexa* dad = next->getParent(0);
328 int mark = next->getMark();
329 int mark2 = dad ? dad->getMark() : IS_NONE;
331 if (nbp <= 1 && mark2 != IS_MARRIED && mark == IS_NONE)
333 // if (nbp <= 1 && mark == IS_NONE)
339 // ======================================================== coupler
340 int Quad::coupler (Quad* other, StrOrient* orient, Elements* table)
345 Hexa* hexa = other->getParent(0);
347 setMark (IS_MARRIED);
348 other->setMark (IS_MARRIED);
350 hexa->setMark (IS_MARRIED);
352 for (int ned = 0 ; ned < QUAD4 ; ned++)
354 Edge* arete = q_edge[ned];
355 int nbfreres = arete ->getNbrParents ();
356 for (int nq = 0 ; nq < nbfreres ; nq++)
358 Quad* next = arete->getParent (nq);
359 if (next!=NULL && next != this && next->getMark() > 0)
361 StrOrient new_ori (orient);
362 new_ori.dir = OR_FRONT;
363 Vertex* va = arete->getVertex (V_AMONT);
364 Vertex* vb = arete->getVertex (V_AVAL);
366 // On voit si un point de repere est conserve
367 if (va == orient->v11)
370 new_ori.dir += OR_LEFT;
372 else if (vb == orient->v11)
375 new_ori.dir += OR_LEFT;
378 if (va == orient->v12)
381 new_ori.dir += OR_RIGHT;
383 else if (vb == orient->v12)
386 new_ori.dir += OR_RIGHT;
389 if (new_ori.dir == OR_FRONT)
391 if (definedBy (va, orient->v11))
403 int nro = next->getMark ();
404 Quad* beauf = other->getBrother (&new_ori);
405 int ier = table->coupler (nro, beauf, &new_ori);
408 ier = next->coupler (beauf, &new_ori, table);
416 // ======================================================== getOpposVertex
417 Vertex* Quad::getOpposVertex (Vertex* start)
419 int na = indexVertex (start);
422 return q_vertex [(na+2) MODULO QUAD4];
424 // ======================================================== getOpposEdge
425 Edge* Quad::getOpposEdge (Edge* start, int& sens)
428 int na = indexVertex (start->getVertex (V_AMONT));
429 int nb = indexVertex (start->getVertex (V_AVAL));
431 Vertex* vaprim = q_vertex [(nb+2) MODULO QUAD4];
432 Vertex* vbprim = q_vertex [(na+2) MODULO QUAD4];
434 for (int ned = 0 ; ned < QUAD4 ; ned++)
436 if ( q_edge[ned]->getVertex(V_AMONT) == vaprim
437 && q_edge[ned]->getVertex(V_AVAL ) == vbprim)
442 else if ( q_edge[ned]->getVertex(V_AMONT) == vbprim
443 && q_edge[ned]->getVertex(V_AVAL ) == vaprim)
449 // TODO : traiter l'erreur
450 cout << " ... Probleme dans Quad::getOpposedEdge :" << endl;
451 HexDisplay (el_name);
459 for (int ned = 0 ; ned < QUAD4 ; ned++)
464 // ========================================================= saveXml
465 void Quad::saveXml (XmlWriter* xml)
470 for (int nro=0 ; nro<QUAD4 ; nro++)
472 if (nro>0) edges += " ";
473 edges += q_edge[nro]->getName(buffer);
476 xml->openMark ("Quad");
477 xml->addAttribute ("id", getName (buffer));
478 xml->addAttribute ("edges", edges);
480 xml->addAttribute ("name", el_name);
483 int nbass = tab_assoc.size();
484 for (int nro=0 ; nro<nbass ; nro++)
485 if (tab_assoc[nro] != NULL)
486 tab_assoc[nro]->saveXml (xml);
488 // ======================================================== replaceEdge
489 void Quad::replaceEdge (Edge* old, Edge* par)
491 for (int nro=0 ; nro<QUAD4 ; nro++)
493 if (q_edge[nro]==old)
500 printf (" [%d], ", nro);
501 old->printName (" est remplace par ");
502 par->printName ("\n");
507 // ======================================================== replaceVertex
508 void Quad::replaceVertex (Vertex* old, Vertex* par)
510 for (int nro=0 ; nro<QUAD4 ; nro++)
512 if (q_vertex [nro]==old)
514 q_vertex [nro] = par;
519 printf (" [%d], ", nro);
520 old->printName (" est remplace par ");
521 par->printName ("\n");
526 // ======================================================== dump
532 printf ("*** deleted ***)\n");
536 for (int nro=0 ; nro<QUAD4 ; nro++)
537 PrintName (q_edge[nro]);
541 for (int nro=0 ; nro<QUAD4 ; nro++)
542 PrintName (q_vertex[nro]);
547 // ======================================================== dumpPlus
548 void Quad::dumpPlus ()
554 for (int nro=0 ; nro < QUAD4 ; nro++)
556 Vertex* pv = q_vertex[nro];
561 printf ( " (%g, %g, %g)\n", pv->getX(), pv->getY(), pv->getZ());
569 // ======================================================== getOpposEdge (2)
570 Edge* Quad::getOpposEdge (Edge* start)
572 int na = indexEdge (start);
575 return q_edge [(na+2) MODULO QUAD4];
577 // ======================================================== getPerpendicular
578 Edge* Quad::getPerpendicular (Edge* arete, Vertex* node)
580 int na = indexEdge (arete);
584 int nv = arete->index (node);
587 Edge* perp = q_edge [(na+1) MODULO QUAD4];
589 nv = perp->index (node);
593 perp = q_edge [(na+3) MODULO QUAD4];
594 nv = perp->index (node);
600 static cpchar t_ori[] = {"Q_INSIDE", "Q_DIRECT", "Q_INVERSE", "Q_UNDEF"};
601 // ======================================================== setOrientation
602 void Quad::setOrientation (int ori)
605 if (db && (ori==Q_DIRECT || ori==Q_INVERSE))
606 printf (" %s = %s\n", el_name.c_str(), t_ori [ q_orientation ]);
608 // ======================================================== setOrientation
609 int Quad::setOrientation ()
611 q_orientation = Q_INSIDE;
612 if (getNbrParents() != 1)
613 return q_orientation;
615 Real3 cg, orig, pi, pj, vi, vj, vk;
617 Hexa* hexa = getParent(0);
618 hexa->getCenter (cg);
620 /********************************************************************
623 for (int np=0 ; np < QUAD4 ; np++)
625 q_vertex [np ] -> getPoint (orig);
626 q_vertex [(np+1) % 4] -> getPoint (pi);
627 q_vertex [(np+3) % 4] -> getPoint (pj);
629 calc_vecteur (orig, pi, vi);
630 calc_vecteur (orig, pj, vj);
631 calc_vecteur (orig, cg, vk);
632 double pmixte = prod_mixte (vi, vj, vk);
633 q_orientation = pmixte > ZEROR ? Q_DIRECT : Q_INVERSE;
634 if (pmixte>0) printf (">");
640 ******************************************************************* */
641 q_vertex [0] -> getPoint (orig);
642 q_vertex [1] -> getPoint (pi);
643 q_vertex [3] -> getPoint (pj);
645 calc_vecteur (orig, pi, vi);
646 calc_vecteur (orig, pj, vj);
647 calc_vecteur (cg, orig, vk);
649 double pmixte = prod_mixte (vi, vj, vk);
650 q_orientation = pmixte > ZEROR ? Q_DIRECT : Q_INVERSE;
652 printf (" %s := %s\n", el_name.c_str(), t_ori [ q_orientation ]);
653 return q_orientation;
655 // ========================================================== clearAssociation
656 void Quad::clearAssociation ()
659 is_associated = false;
661 // ========================================================== addAssociation
662 int Quad::addAssociation (NewShape* geom, int subid)
667 FaceShape* face = geom->findFace (subid);
668 int ier = addAssociation (face);
672 // ========================================================== addAssociation
673 int Quad::addAssociation (FaceShape* face)
678 face->addAssociation (this);
679 tab_assoc.push_back (face);
680 is_associated = true;
683 // ========================================================== getAssociation
684 FaceShape* Quad::getAssociation (int nro)
686 if (nro < 0 || nro >= (int)tab_assoc.size())
689 return tab_assoc [nro];
691 // ======================================================== commonEdge
692 Edge* Quad::commonEdge (Quad* other)
694 for (int ne1=0 ; ne1<QUAD4 ; ne1++)
695 for (int ne2=0 ; ne2<QUAD4 ; ne2++)
696 if (q_edge [ne1] == other->q_edge [ne2])
701 // ======================================================== Inter
702 int Quad::inter (Quad* other, int& nother)
704 for (int ne1=0 ; ne1<QUAD4 ; ne1++)
705 for (int ne2=0 ; ne2<QUAD4 ; ne2++)
706 if (q_edge [ne1] == other->q_edge [ne2])
715 // ======================================================== Inter (2)
716 Edge* Quad::inter (Quad* other)
718 for (int ne1=0 ; ne1<QUAD4 ; ne1++)
719 for (int ne2=0 ; ne2<QUAD4 ; ne2++)
720 if (q_edge [ne1] == other->q_edge [ne2])
724 // ============================================================ definedBy (v)
725 bool Quad::definedBy (Vertex* v1, Vertex* v2)
727 for (int n1=0 ; n1< QUAD4 ; n1++)
728 if (v1 == q_vertex[n1] && v2 == q_vertex[(n1+2) MODULO QUAD4])
733 // ============================================================ definedBy (e)
734 bool Quad::definedBy (Edge* e1, Edge* e2)
736 if (e1==e2 || BadElement (e1) || BadElement (e2))
739 bool f1=false, f2=false;
740 for (int ned=0 ; ned< QUAD4 ; ned++)
741 if (e1 == q_edge[ned]) f1 = true;
742 else if (e2 == q_edge[ned]) f2 = true;
743 // if (e1 == q_edge[ned] && e2 == q_edge[(ned+2) MODULO QUAD4]) return true;
747 // =============================================================== findEdge
748 Edge* Quad::findEdge (Vertex* v1, Vertex* v2)
750 for (int nro=0 ; nro< QUAD4 ; nro++)
752 Vertex* va = q_edge[nro]->getVertex(V_AMONT) ;
753 Vertex* vb = q_edge[nro]->getVertex(V_AVAL) ;
754 if ((v1==va && v2==vb) || (v1==vb && v2==va))
760 // =============================================================== indexVertex
761 int Quad::indexVertex (Vertex* elt)
763 for (int n1=0 ; n1< QUAD4 ; n1++)
764 if (elt == q_vertex[n1])
769 // =============================================================== indexEdge
770 int Quad::indexEdge (Edge* elt)
772 for (int n1=0 ; n1< QUAD4 ; n1++)
773 if (elt == q_edge[n1])
778 // =============================================================== setColor
779 void Quad::setColor (double val)
781 for (int n1=0 ; n1< QUAD4 ; n1++)
782 q_vertex[n1] -> setColor (val);
784 // =============================================================== duplicate
785 void Quad::duplicate ()
787 q_orientation = Q_UNDEFINED;
788 q_clone = new Quad (GetClone (q_edge [E_A]),
789 GetClone (q_edge [E_B]),
790 GetClone (q_edge [E_C]),
791 GetClone (q_edge [E_D]));
792 q_clone->tab_assoc = tab_assoc;
794 // ============================================================ nearestVertex
795 Vertex* Quad::nearestVertex (Vertex* other)
797 if (BadElement (other))
802 int nbre = countVertex ();
803 for (int nro=0 ; nro<nbre ; nro++)
805 Vertex* vert = getVertex (nro);
806 double dist = other->dist2 (vert);
815 // =============================================================== reorienter
816 void Quad::reorienter ()
818 if (q_orientation != Q_INVERSE)
821 Edge* edge = q_edge [E_B];
822 q_edge [E_B] = q_edge [E_D];
825 q_vertex [E_A] = q_edge [E_D]->commonVertex(q_edge [E_A]);
826 q_vertex [E_B] = q_edge [E_A]->commonVertex(q_edge [E_B]);
827 q_vertex [E_C] = q_edge [E_B]->commonVertex(q_edge [E_C]);
828 q_vertex [E_D] = q_edge [E_C]->commonVertex(q_edge [E_D]);
831 printf (" %s est reoriente\n", el_name.c_str());
832 q_orientation = Q_DIRECT;
834 // =============================================================== getCenter
835 double* Quad::getCenter (double* center)
837 center[dir_x] = center[dir_y] = center[dir_z] = 0;
838 if (BadElement (this))
841 for (int nv=0 ; nv<QUAD4 ; nv++)
843 if (BadElement (q_vertex [nv]))
845 center [dir_x] += q_vertex[nv]->getX();
846 center [dir_y] += q_vertex[nv]->getY();
847 center [dir_z] += q_vertex[nv]->getZ();
851 // =============================================================== getCenter
852 double Quad::dist2 (double* point)
856 double d2 = carre (point[dir_x] - center[dir_x])
857 + carre (point[dir_y] - center[dir_y])
858 + carre (point[dir_z] - center[dir_z]) ;
861 // =============================================================== getCenter
862 Hexa* Quad::opposedHexa (Hexa* hexa)
864 int nbre = getNbrParents ();
865 for (int nro=0 ; nro <nbre ; ++nro)
867 Hexa* dad = getParent (nro);
868 if (dad!= NULL && dad->isValid() && dad != hexa)