1 // Copyright (C) 2007-2014 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
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, or (at your option) any later version.
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
23 // File : StdMeshers_Quadrangle_2D.cxx
24 // Author : Paul RASCLE, EDF
27 #include "StdMeshers_Quadrangle_2D.hxx"
29 #include "SMDS_EdgePosition.hxx"
30 #include "SMDS_FacePosition.hxx"
31 #include "SMDS_MeshElement.hxx"
32 #include "SMDS_MeshNode.hxx"
33 #include "SMESH_Block.hxx"
34 #include "SMESH_Comment.hxx"
35 #include "SMESH_Gen.hxx"
36 #include "SMESH_HypoFilter.hxx"
37 #include "SMESH_Mesh.hxx"
38 #include "SMESH_MeshAlgos.hxx"
39 #include "SMESH_MesherHelper.hxx"
40 #include "SMESH_subMesh.hxx"
41 #include "StdMeshers_FaceSide.hxx"
42 #include "StdMeshers_QuadrangleParams.hxx"
43 #include "StdMeshers_ViscousLayers2D.hxx"
45 #include <BRepBndLib.hxx>
46 #include <BRepClass_FaceClassifier.hxx>
47 #include <BRep_Tool.hxx>
48 #include <Bnd_Box.hxx>
49 #include <GeomAPI_ProjectPointOnSurf.hxx>
50 #include <Geom_Surface.hxx>
51 #include <NCollection_DefineArray2.hxx>
52 #include <Precision.hxx>
53 #include <Quantity_Parameter.hxx>
54 #include <TColStd_SequenceOfInteger.hxx>
55 #include <TColStd_SequenceOfReal.hxx>
56 #include <TColgp_SequenceOfXY.hxx>
58 #include <TopExp_Explorer.hxx>
59 #include <TopTools_DataMapOfShapeReal.hxx>
60 #include <TopTools_ListIteratorOfListOfShape.hxx>
61 #include <TopTools_MapOfShape.hxx>
64 #include "utilities.h"
65 #include "Utils_ExceptHandlers.hxx"
67 #ifndef StdMeshers_Array2OfNode_HeaderFile
68 #define StdMeshers_Array2OfNode_HeaderFile
69 typedef const SMDS_MeshNode* SMDS_MeshNodePtr;
70 DEFINE_BASECOLLECTION (StdMeshers_BaseCollectionNodePtr, SMDS_MeshNodePtr)
71 DEFINE_ARRAY2(StdMeshers_Array2OfNode,
72 StdMeshers_BaseCollectionNodePtr, SMDS_MeshNodePtr)
78 typedef SMESH_Comment TComm;
80 //=============================================================================
84 //=============================================================================
86 StdMeshers_Quadrangle_2D::StdMeshers_Quadrangle_2D (int hypId, int studyId,
88 : SMESH_2D_Algo(hypId, studyId, gen),
89 myQuadranglePreference(false),
90 myTrianglePreference(false),
95 myQuadType(QUAD_STANDARD),
98 MESSAGE("StdMeshers_Quadrangle_2D::StdMeshers_Quadrangle_2D");
99 _name = "Quadrangle_2D";
100 _shapeType = (1 << TopAbs_FACE);
101 _compatibleHypothesis.push_back("QuadrangleParams");
102 _compatibleHypothesis.push_back("QuadranglePreference");
103 _compatibleHypothesis.push_back("TrianglePreference");
104 _compatibleHypothesis.push_back("ViscousLayers2D");
107 //=============================================================================
111 //=============================================================================
113 StdMeshers_Quadrangle_2D::~StdMeshers_Quadrangle_2D()
115 MESSAGE("StdMeshers_Quadrangle_2D::~StdMeshers_Quadrangle_2D");
118 //=============================================================================
122 //=============================================================================
124 bool StdMeshers_Quadrangle_2D::CheckHypothesis
126 const TopoDS_Shape& aShape,
127 SMESH_Hypothesis::Hypothesis_Status& aStatus)
130 myQuadType = QUAD_STANDARD;
131 myQuadranglePreference = false;
132 myTrianglePreference = false;
133 myHelper = (SMESH_MesherHelper*)NULL;
138 aStatus = SMESH_Hypothesis::HYP_OK;
140 const list <const SMESHDS_Hypothesis * >& hyps =
141 GetUsedHypothesis(aMesh, aShape, false);
142 const SMESHDS_Hypothesis * aHyp = 0;
144 bool isFirstParams = true;
146 // First assigned hypothesis (if any) is processed now
147 if (hyps.size() > 0) {
149 if (strcmp("QuadrangleParams", aHyp->GetName()) == 0)
151 myParams = (const StdMeshers_QuadrangleParams*)aHyp;
152 myTriaVertexID = myParams->GetTriaVertex();
153 myQuadType = myParams->GetQuadType();
154 if (myQuadType == QUAD_QUADRANGLE_PREF ||
155 myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
156 myQuadranglePreference = true;
157 else if (myQuadType == QUAD_TRIANGLE_PREF)
158 myTrianglePreference = true;
160 else if (strcmp("QuadranglePreference", aHyp->GetName()) == 0) {
161 isFirstParams = false;
162 myQuadranglePreference = true;
164 else if (strcmp("TrianglePreference", aHyp->GetName()) == 0){
165 isFirstParams = false;
166 myTrianglePreference = true;
169 isFirstParams = false;
173 // Second(last) assigned hypothesis (if any) is processed now
174 if (hyps.size() > 1) {
177 if (strcmp("QuadranglePreference", aHyp->GetName()) == 0) {
178 myQuadranglePreference = true;
179 myTrianglePreference = false;
180 myQuadType = QUAD_STANDARD;
182 else if (strcmp("TrianglePreference", aHyp->GetName()) == 0){
183 myQuadranglePreference = false;
184 myTrianglePreference = true;
185 myQuadType = QUAD_STANDARD;
189 const StdMeshers_QuadrangleParams* aHyp2 =
190 (const StdMeshers_QuadrangleParams*)aHyp;
191 myTriaVertexID = aHyp2->GetTriaVertex();
193 if (!myQuadranglePreference && !myTrianglePreference) { // priority of hypos
194 myQuadType = aHyp2->GetQuadType();
195 if (myQuadType == QUAD_QUADRANGLE_PREF ||
196 myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
197 myQuadranglePreference = true;
198 else if (myQuadType == QUAD_TRIANGLE_PREF)
199 myTrianglePreference = true;
207 //=============================================================================
211 //=============================================================================
213 bool StdMeshers_Quadrangle_2D::Compute (SMESH_Mesh& aMesh,
214 const TopoDS_Shape& aShape)
216 const TopoDS_Face& F = TopoDS::Face(aShape);
217 aMesh.GetSubMesh( F );
219 // do not initialize my fields before this as StdMeshers_ViscousLayers2D
220 // can call Compute() recursively
221 SMESH_ProxyMesh::Ptr proxyMesh = StdMeshers_ViscousLayers2D::Compute( aMesh, F );
225 myProxyMesh = proxyMesh;
227 SMESH_MesherHelper helper (aMesh);
230 _quadraticMesh = myHelper->IsQuadraticSubMesh(aShape);
231 myNeedSmooth = false;
234 FaceQuadStruct::Ptr quad = CheckNbEdges( aMesh, F, /*considerMesh=*/true );
238 myQuadList.push_back( quad );
240 if ( !getEnforcedUV() )
243 updateDegenUV( quad );
245 int n1 = quad->side[0].NbPoints();
246 int n2 = quad->side[1].NbPoints();
247 int n3 = quad->side[2].NbPoints();
248 int n4 = quad->side[3].NbPoints();
250 enum { NOT_COMPUTED = -1, COMPUTE_FAILED = 0, COMPUTE_OK = 1 };
251 int res = NOT_COMPUTED;
252 if (myQuadranglePreference)
254 int nfull = n1+n2+n3+n4;
255 if ((nfull % 2) == 0 && ((n1 != n3) || (n2 != n4)))
257 // special path genarating only quandrangle faces
258 res = computeQuadPref( aMesh, F, quad );
261 else if (myQuadType == QUAD_REDUCED)
265 int n13tmp = n13/2; n13tmp = n13tmp*2;
266 int n24tmp = n24/2; n24tmp = n24tmp*2;
267 if ((n1 == n3 && n2 != n4 && n24tmp == n24) ||
268 (n2 == n4 && n1 != n3 && n13tmp == n13))
270 res = computeReduced( aMesh, F, quad );
274 if ( n1 != n3 && n2 != n4 )
275 error( COMPERR_WARNING,
276 "To use 'Reduced' transition, "
277 "two opposite sides should have same number of segments, "
278 "but actual number of segments is different on all sides. "
279 "'Standard' transion has been used.");
281 error( COMPERR_WARNING,
282 "To use 'Reduced' transition, "
283 "two opposite sides should have an even difference in number of segments. "
284 "'Standard' transion has been used.");
288 if ( res == NOT_COMPUTED )
290 if ( n1 != n3 || n2 != n4 )
291 res = computeTriangles( aMesh, F, quad );
293 res = computeQuadDominant( aMesh, F );
296 if ( res == COMPUTE_OK && myNeedSmooth )
299 if ( res == COMPUTE_OK )
302 return ( res == COMPUTE_OK );
305 //================================================================================
307 * \brief Compute quadrangles and triangles on the quad
309 //================================================================================
311 bool StdMeshers_Quadrangle_2D::computeTriangles(SMESH_Mesh& aMesh,
312 const TopoDS_Face& aFace,
313 FaceQuadStruct::Ptr quad)
315 int nb = quad->side[0].grid->NbPoints();
316 int nr = quad->side[1].grid->NbPoints();
317 int nt = quad->side[2].grid->NbPoints();
318 int nl = quad->side[3].grid->NbPoints();
320 // rotate the quad to have nbNodeOut sides on TOP [and LEFT]
322 quad->shift( nl > nr ? 3 : 2, true );
324 quad->shift( 1, true );
326 quad->shift( nt > nb ? 0 : 3, true );
328 if ( !setNormalizedGrid( quad ))
331 if ( quad->nbNodeOut( QUAD_TOP_SIDE ))
333 splitQuad( quad, 0, quad->jSize-2 );
335 if ( quad->nbNodeOut( QUAD_BOTTOM_SIDE )) // this should not happen
337 splitQuad( quad, 0, 1 );
339 FaceQuadStruct::Ptr newQuad = myQuadList.back();
340 if ( quad != newQuad ) // split done
342 { // update left side limit till where to make triangles
343 FaceQuadStruct::Ptr botQuad = // a bottom part
344 ( quad->side[ QUAD_LEFT_SIDE ].from == 0 ) ? quad : newQuad;
345 if ( botQuad->nbNodeOut( QUAD_LEFT_SIDE ) > 0 )
346 botQuad->side[ QUAD_LEFT_SIDE ].to += botQuad->nbNodeOut( QUAD_LEFT_SIDE );
347 else if ( botQuad->nbNodeOut( QUAD_RIGHT_SIDE ) > 0 )
348 botQuad->side[ QUAD_RIGHT_SIDE ].to += botQuad->nbNodeOut( QUAD_RIGHT_SIDE );
350 // make quad be a greatest one
351 if ( quad->side[ QUAD_LEFT_SIDE ].NbPoints() == 2 ||
352 quad->side[ QUAD_RIGHT_SIDE ].NbPoints() == 2 )
354 if ( !setNormalizedGrid( quad ))
358 if ( quad->nbNodeOut( QUAD_RIGHT_SIDE ))
360 splitQuad( quad, quad->iSize-2, 0 );
362 if ( quad->nbNodeOut( QUAD_LEFT_SIDE ))
364 splitQuad( quad, 1, 0 );
366 if ( quad->nbNodeOut( QUAD_TOP_SIDE ))
368 newQuad = myQuadList.back();
369 if ( newQuad == quad ) // too narrow to split
371 // update left side limit till where to make triangles
372 quad->side[ QUAD_LEFT_SIDE ].to--;
376 FaceQuadStruct::Ptr leftQuad =
377 ( quad->side[ QUAD_BOTTOM_SIDE ].from == 0 ) ? quad : newQuad;
378 leftQuad->nbNodeOut( QUAD_TOP_SIDE ) = 0;
383 if ( ! computeQuadDominant( aMesh, aFace ))
386 // try to fix zero-area triangles near straight-angle corners
391 //================================================================================
393 * \brief Compute quadrangles and possibly triangles on all quads of myQuadList
395 //================================================================================
397 bool StdMeshers_Quadrangle_2D::computeQuadDominant(SMESH_Mesh& aMesh,
398 const TopoDS_Face& aFace)
400 if ( !addEnforcedNodes() )
403 std::list< FaceQuadStruct::Ptr >::iterator quad = myQuadList.begin();
404 for ( ; quad != myQuadList.end(); ++quad )
405 if ( !computeQuadDominant( aMesh, aFace, *quad ))
411 //================================================================================
413 * \brief Compute quadrangles and possibly triangles
415 //================================================================================
417 bool StdMeshers_Quadrangle_2D::computeQuadDominant(SMESH_Mesh& aMesh,
418 const TopoDS_Face& aFace,
419 FaceQuadStruct::Ptr quad)
421 // --- set normalized grid on unit square in parametric domain
423 if ( !setNormalizedGrid( quad ))
426 // --- create nodes on points, and create quadrangles
428 int nbhoriz = quad->iSize;
429 int nbvertic = quad->jSize;
431 // internal mesh nodes
432 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
433 Handle(Geom_Surface) S = BRep_Tool::Surface(aFace);
434 int i,j, geomFaceID = meshDS->ShapeToIndex(aFace);
435 for (i = 1; i < nbhoriz - 1; i++)
436 for (j = 1; j < nbvertic - 1; j++)
438 UVPtStruct& uvPnt = quad->UVPt( i, j );
439 gp_Pnt P = S->Value( uvPnt.u, uvPnt.v );
440 uvPnt.node = meshDS->AddNode(P.X(), P.Y(), P.Z());
441 meshDS->SetNodeOnFace( uvPnt.node, geomFaceID, uvPnt.u, uvPnt.v );
447 // --.--.--.--.--.-- nbvertic
453 // ---.----.----.--- 0
454 // 0 > > > > > > > > nbhoriz
459 int iup = nbhoriz - 1;
460 if (quad->nbNodeOut(3)) { ilow++; } else { if (quad->nbNodeOut(1)) iup--; }
463 int jup = nbvertic - 1;
464 if (quad->nbNodeOut(0)) { jlow++; } else { if (quad->nbNodeOut(2)) jup--; }
466 // regular quadrangles
467 for (i = ilow; i < iup; i++) {
468 for (j = jlow; j < jup; j++) {
469 const SMDS_MeshNode *a, *b, *c, *d;
470 a = quad->uv_grid[ j * nbhoriz + i ].node;
471 b = quad->uv_grid[ j * nbhoriz + i + 1].node;
472 c = quad->uv_grid[(j + 1) * nbhoriz + i + 1].node;
473 d = quad->uv_grid[(j + 1) * nbhoriz + i ].node;
474 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
476 meshDS->SetMeshElementOnShape(face, geomFaceID);
481 // Boundary elements (must always be on an outer boundary of the FACE)
483 const vector<UVPtStruct>& uv_e0 = quad->side[0].grid->GetUVPtStruct();
484 const vector<UVPtStruct>& uv_e1 = quad->side[1].grid->GetUVPtStruct();
485 const vector<UVPtStruct>& uv_e2 = quad->side[2].grid->GetUVPtStruct();
486 const vector<UVPtStruct>& uv_e3 = quad->side[3].grid->GetUVPtStruct();
488 if (uv_e0.empty() || uv_e1.empty() || uv_e2.empty() || uv_e3.empty())
489 return error(COMPERR_BAD_INPUT_MESH);
491 double eps = Precision::Confusion();
493 int nbdown = (int) uv_e0.size();
494 int nbup = (int) uv_e2.size();
495 int nbright = (int) uv_e1.size();
496 int nbleft = (int) uv_e3.size();
498 if (quad->nbNodeOut(0) && nbvertic == 2) // this should not occure
502 // |___|___|___|___|___|___|
504 // |___|___|___|___|___|___|
506 // |___|___|___|___|___|___| __ first row of the regular grid
507 // . . . . . . . . . __ down edge nodes
509 // >->->->->->->->->->->->-> -- direction of processing
511 int g = 0; // number of last processed node in the regular grid
513 // number of last node of the down edge to be processed
514 int stop = nbdown - 1;
515 // if right edge is out, we will stop at a node, previous to the last one
516 //if (quad->nbNodeOut(1)) stop--;
517 if ( quad->nbNodeOut( QUAD_RIGHT_SIDE ))
518 quad->UVPt( nbhoriz-1, 1 ).node = uv_e1[1].node;
519 if ( quad->nbNodeOut( QUAD_LEFT_SIDE ))
520 quad->UVPt( 0, 1 ).node = uv_e3[1].node;
522 // for each node of the down edge find nearest node
523 // in the first row of the regular grid and link them
524 for (i = 0; i < stop; i++) {
525 const SMDS_MeshNode *a, *b, *c, *d;
527 b = uv_e0[i + 1].node;
528 gp_Pnt pb (b->X(), b->Y(), b->Z());
530 // find node c in the regular grid, which will be linked with node b
533 // right bound reached, link with the rightmost node
535 c = quad->uv_grid[nbhoriz + iup].node;
538 // find in the grid node c, nearest to the b
539 double mind = RealLast();
540 for (int k = g; k <= iup; k++) {
542 const SMDS_MeshNode *nk;
543 if (k < ilow) // this can be, if left edge is out
544 nk = uv_e3[1].node; // get node from the left edge
546 nk = quad->uv_grid[nbhoriz + k].node; // get one of middle nodes
548 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
549 double dist = pb.Distance(pnk);
550 if (dist < mind - eps) {
560 if (near == g) { // make triangle
561 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
562 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
564 else { // make quadrangle
568 d = quad->uv_grid[nbhoriz + near - 1].node;
569 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
571 if (!myTrianglePreference){
572 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
573 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
576 splitQuadFace(meshDS, geomFaceID, a, b, c, d);
579 // if node d is not at position g - make additional triangles
581 for (int k = near - 1; k > g; k--) {
582 c = quad->uv_grid[nbhoriz + k].node;
586 d = quad->uv_grid[nbhoriz + k - 1].node;
587 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
588 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
595 if (quad->nbNodeOut(2) && nbvertic == 2)
599 // <-<-<-<-<-<-<-<-<-<-<-<-< -- direction of processing
601 // . . . . . . . . . __ up edge nodes
602 // ___ ___ ___ ___ ___ ___ __ first row of the regular grid
604 // |___|___|___|___|___|___|
606 // |___|___|___|___|___|___|
609 int g = nbhoriz - 1; // last processed node in the regular grid
615 if ( quad->side[3].grid->Edge(0).IsNull() ) // left side is simulated one
617 // quad divided at I but not at J, as nbvertic==nbright==2
618 stop++; // we stop at a second node
622 if ( quad->nbNodeOut( QUAD_RIGHT_SIDE ))
623 quad->UVPt( nbhoriz-1, 0 ).node = uv_e1[ nbright-2 ].node;
624 if ( quad->nbNodeOut( QUAD_LEFT_SIDE ))
625 quad->UVPt( 0, 0 ).node = uv_e3[ nbleft-2 ].node;
627 if ( nbright > 2 ) // there was a split at J
628 quad->nbNodeOut( QUAD_LEFT_SIDE ) = 0;
630 const SMDS_MeshNode *a, *b, *c, *d;
632 // avoid creating zero-area triangles near a straight-angle corner
636 c = uv_e1[nbright-2].node;
637 SMESH_TNodeXYZ pa( a ), pb( b ), pc( c );
638 double area = 0.5 * (( pb - pa ) ^ ( pc - pa )).Modulus();
639 if ( Abs( area ) < 1e-20 )
642 d = quad->UVPt( g, nbvertic-2 ).node;
643 if ( myTrianglePreference )
645 if ( SMDS_MeshFace* face = myHelper->AddFace(a, d, c))
646 meshDS->SetMeshElementOnShape(face, geomFaceID);
650 if ( SMDS_MeshFace* face = myHelper->AddFace(a, b, d, c))
652 meshDS->SetMeshElementOnShape(face, geomFaceID);
653 SMESH_ComputeErrorPtr& err = aMesh.GetSubMesh( aFace )->GetComputeError();
654 if ( !err || err->IsOK() || err->myName < COMPERR_WARNING )
656 err.reset( new SMESH_ComputeError( COMPERR_WARNING,
657 "Bad quality quad created"));
658 err->myBadElements.push_back( face );
665 // for each node of the up edge find nearest node
666 // in the first row of the regular grid and link them
667 for ( ; i > stop; i--) {
669 b = uv_e2[i - 1].node;
670 gp_Pnt pb (b->X(), b->Y(), b->Z());
672 // find node c in the grid, which will be linked with node b
674 if (i == stop + 1) { // left bound reached, link with the leftmost node
675 c = quad->uv_grid[nbhoriz*(nbvertic - 2) + ilow].node;
678 // find node c in the grid, nearest to the b
679 double mind = RealLast();
680 for (int k = g; k >= ilow; k--) {
681 const SMDS_MeshNode *nk;
683 nk = uv_e1[nbright - 2].node;
685 nk = quad->uv_grid[nbhoriz*(nbvertic - 2) + k].node;
686 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
687 double dist = pb.Distance(pnk);
688 if (dist < mind - eps) {
698 if (near == g) { // make triangle
699 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
700 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
702 else { // make quadrangle
704 d = uv_e1[nbright - 2].node;
706 d = quad->uv_grid[nbhoriz*(nbvertic - 2) + near + 1].node;
707 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
708 if (!myTrianglePreference){
709 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
710 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
713 splitQuadFace(meshDS, geomFaceID, a, b, c, d);
716 if (near + 1 < g) { // if d is not at g - make additional triangles
717 for (int k = near + 1; k < g; k++) {
718 c = quad->uv_grid[nbhoriz*(nbvertic - 2) + k].node;
720 d = uv_e1[nbright - 2].node;
722 d = quad->uv_grid[nbhoriz*(nbvertic - 2) + k + 1].node;
723 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
724 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
733 // right or left boundary quadrangles
734 if (quad->nbNodeOut( QUAD_RIGHT_SIDE ) && nbhoriz == 2) // this should not occure
736 int g = 0; // last processed node in the grid
737 int stop = nbright - 1;
739 if (quad->side[ QUAD_RIGHT_SIDE ].from != i ) i++;
740 if (quad->side[ QUAD_RIGHT_SIDE ].to != stop ) stop--;
741 for ( ; i < stop; i++) {
742 const SMDS_MeshNode *a, *b, *c, *d;
744 b = uv_e1[i + 1].node;
745 gp_Pnt pb (b->X(), b->Y(), b->Z());
747 // find node c in the grid, nearest to the b
749 if (i == stop - 1) { // up bondary reached
750 c = quad->uv_grid[nbhoriz*(jup + 1) - 2].node;
753 double mind = RealLast();
754 for (int k = g; k <= jup; k++) {
755 const SMDS_MeshNode *nk;
757 nk = uv_e0[nbdown - 2].node;
759 nk = quad->uv_grid[nbhoriz*(k + 1) - 2].node;
760 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
761 double dist = pb.Distance(pnk);
762 if (dist < mind - eps) {
772 if (near == g) { // make triangle
773 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
774 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
776 else { // make quadrangle
778 d = uv_e0[nbdown - 2].node;
780 d = quad->uv_grid[nbhoriz*near - 2].node;
781 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
783 if (!myTrianglePreference){
784 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
785 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
788 splitQuadFace(meshDS, geomFaceID, a, b, c, d);
791 if (near - 1 > g) { // if d not is at g - make additional triangles
792 for (int k = near - 1; k > g; k--) {
793 c = quad->uv_grid[nbhoriz*(k + 1) - 2].node;
795 d = uv_e0[nbdown - 2].node;
797 d = quad->uv_grid[nbhoriz*k - 2].node;
798 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
799 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
806 if (quad->nbNodeOut(3) && nbhoriz == 2) {
807 // MESSAGE("left edge is out");
808 int g = nbvertic - 1; // last processed node in the grid
810 i = quad->side[ QUAD_LEFT_SIDE ].to-1; // nbleft - 1;
812 const SMDS_MeshNode *a, *b, *c, *d;
813 // avoid creating zero-area triangles near a straight-angle corner
817 c = quad->UVPt( 1, g ).node;
818 SMESH_TNodeXYZ pa( a ), pb( b ), pc( c );
819 double area = 0.5 * (( pb - pa ) ^ ( pc - pa )).Modulus();
820 if ( Abs( area ) < 1e-20 )
823 d = quad->UVPt( 1, g ).node;
824 if ( myTrianglePreference )
826 if ( SMDS_MeshFace* face = myHelper->AddFace(a, d, c))
827 meshDS->SetMeshElementOnShape(face, geomFaceID);
831 if ( SMDS_MeshFace* face = myHelper->AddFace(a, b, d, c))
833 meshDS->SetMeshElementOnShape(face, geomFaceID);
834 SMESH_ComputeErrorPtr& err = aMesh.GetSubMesh( aFace )->GetComputeError();
835 if ( !err || err->IsOK() || err->myName < COMPERR_WARNING )
837 err.reset( new SMESH_ComputeError( COMPERR_WARNING,
838 "Bad quality quad created"));
839 err->myBadElements.push_back( face );
846 for (; i > stop; i--) // loop on nodes on the left side
849 b = uv_e3[i - 1].node;
850 gp_Pnt pb (b->X(), b->Y(), b->Z());
852 // find node c in the grid, nearest to the b
854 if (i == stop + 1) { // down bondary reached
855 c = quad->uv_grid[nbhoriz*jlow + 1].node;
859 double mind = RealLast();
860 for (int k = g; k >= jlow; k--) {
861 const SMDS_MeshNode *nk;
863 nk = quad->uv_grid[nbhoriz*jup + 1].node; //uv_e2[1].node;
865 nk = quad->uv_grid[nbhoriz*k + 1].node;
866 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
867 double dist = pb.Distance(pnk);
868 if (dist < mind - eps) {
878 if (near == g) { // make triangle
879 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
880 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
882 else { // make quadrangle
884 d = quad->uv_grid[nbhoriz*jup + 1].node; //uv_e2[1].node;
886 d = quad->uv_grid[nbhoriz*(near + 1) + 1].node;
887 if (!myTrianglePreference) {
888 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
889 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
892 splitQuadFace(meshDS, geomFaceID, a, b, c, d);
895 if (near + 1 < g) { // if d not is at g - make additional triangles
896 for (int k = near + 1; k < g; k++) {
897 c = quad->uv_grid[nbhoriz*k + 1].node;
899 d = quad->uv_grid[nbhoriz*jup + 1].node; //uv_e2[1].node;
901 d = quad->uv_grid[nbhoriz*(k + 1) + 1].node;
902 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
903 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
917 //=============================================================================
921 //=============================================================================
923 bool StdMeshers_Quadrangle_2D::Evaluate(SMESH_Mesh& aMesh,
924 const TopoDS_Shape& aFace,
925 MapShapeNbElems& aResMap)
928 aMesh.GetSubMesh(aFace);
930 std::vector<int> aNbNodes(4);
931 bool IsQuadratic = false;
932 if (!checkNbEdgesForEvaluate(aMesh, aFace, aResMap, aNbNodes, IsQuadratic)) {
933 std::vector<int> aResVec(SMDSEntity_Last);
934 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
935 SMESH_subMesh * sm = aMesh.GetSubMesh(aFace);
936 aResMap.insert(std::make_pair(sm,aResVec));
937 SMESH_ComputeErrorPtr& smError = sm->GetComputeError();
938 smError.reset(new SMESH_ComputeError(COMPERR_ALGO_FAILED,"Submesh can not be evaluated",this));
942 if (myQuadranglePreference) {
943 int n1 = aNbNodes[0];
944 int n2 = aNbNodes[1];
945 int n3 = aNbNodes[2];
946 int n4 = aNbNodes[3];
947 int nfull = n1+n2+n3+n4;
950 if (nfull==ntmp && ((n1!=n3) || (n2!=n4))) {
951 // special path for using only quandrangle faces
952 return evaluateQuadPref(aMesh, aFace, aNbNodes, aResMap, IsQuadratic);
957 int nbdown = aNbNodes[0];
958 int nbup = aNbNodes[2];
960 int nbright = aNbNodes[1];
961 int nbleft = aNbNodes[3];
963 int nbhoriz = Min(nbdown, nbup);
964 int nbvertic = Min(nbright, nbleft);
966 int dh = Max(nbdown, nbup) - nbhoriz;
967 int dv = Max(nbright, nbleft) - nbvertic;
974 int nbNodes = (nbhoriz-2)*(nbvertic-2);
975 //int nbFaces3 = dh + dv + kdh*(nbvertic-1)*2 + kdv*(nbhoriz-1)*2;
976 int nbFaces3 = dh + dv;
977 //if (kdh==1 && kdv==1) nbFaces3 -= 2;
978 //if (dh>0 && dv>0) nbFaces3 -= 2;
979 //int nbFaces4 = (nbhoriz-1-kdh)*(nbvertic-1-kdv);
980 int nbFaces4 = (nbhoriz-1)*(nbvertic-1);
982 std::vector<int> aVec(SMDSEntity_Last);
983 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aVec[i] = 0;
985 aVec[SMDSEntity_Quad_Triangle] = nbFaces3;
986 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces4;
987 int nbbndedges = nbdown + nbup + nbright + nbleft -4;
988 int nbintedges = (nbFaces4*4 + nbFaces3*3 - nbbndedges) / 2;
989 aVec[SMDSEntity_Node] = nbNodes + nbintedges;
990 if (aNbNodes.size()==5) {
991 aVec[SMDSEntity_Quad_Triangle] = nbFaces3 + aNbNodes[3] -1;
992 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces4 - aNbNodes[3] +1;
996 aVec[SMDSEntity_Node] = nbNodes;
997 aVec[SMDSEntity_Triangle] = nbFaces3;
998 aVec[SMDSEntity_Quadrangle] = nbFaces4;
999 if (aNbNodes.size()==5) {
1000 aVec[SMDSEntity_Triangle] = nbFaces3 + aNbNodes[3] - 1;
1001 aVec[SMDSEntity_Quadrangle] = nbFaces4 - aNbNodes[3] + 1;
1004 SMESH_subMesh * sm = aMesh.GetSubMesh(aFace);
1005 aResMap.insert(std::make_pair(sm,aVec));
1010 //================================================================================
1012 * \brief Return true if the algorithm can mesh this shape
1013 * \param [in] aShape - shape to check
1014 * \param [in] toCheckAll - if true, this check returns OK if all shapes are OK,
1015 * else, returns OK if at least one shape is OK
1017 //================================================================================
1019 bool StdMeshers_Quadrangle_2D::IsApplicable( const TopoDS_Shape & aShape, bool toCheckAll )
1021 int nbFoundFaces = 0;
1022 for (TopExp_Explorer exp( aShape, TopAbs_FACE ); exp.More(); exp.Next(), ++nbFoundFaces )
1024 const TopoDS_Shape& aFace = exp.Current();
1025 int nbWire = SMESH_MesherHelper::Count( aFace, TopAbs_WIRE, false );
1026 if ( nbWire != 1 ) {
1027 if ( toCheckAll ) return false;
1031 int nbNoDegenEdges = 0;
1032 TopExp_Explorer eExp( aFace, TopAbs_EDGE );
1033 for ( ; eExp.More() && nbNoDegenEdges < 3; eExp.Next() ) {
1034 if ( !SMESH_Algo::isDegenerated( TopoDS::Edge( eExp.Current() )))
1037 if ( toCheckAll && nbNoDegenEdges < 3 ) return false;
1038 if ( !toCheckAll && nbNoDegenEdges >= 3 ) return true;
1040 return ( toCheckAll && nbFoundFaces != 0 );
1043 //================================================================================
1045 * \brief Return true if only two given edges meat at their common vertex
1047 //================================================================================
1049 static bool twoEdgesMeatAtVertex(const TopoDS_Edge& e1,
1050 const TopoDS_Edge& e2,
1054 if (!TopExp::CommonVertex(e1, e2, v))
1056 TopTools_ListIteratorOfListOfShape ancestIt(mesh.GetAncestors(v));
1057 for (; ancestIt.More() ; ancestIt.Next())
1058 if (ancestIt.Value().ShapeType() == TopAbs_EDGE)
1059 if (!e1.IsSame(ancestIt.Value()) && !e2.IsSame(ancestIt.Value()))
1064 //=============================================================================
1068 //=============================================================================
1070 FaceQuadStruct::Ptr StdMeshers_Quadrangle_2D::CheckNbEdges(SMESH_Mesh & aMesh,
1071 const TopoDS_Shape & aShape,
1072 const bool considerMesh)
1074 if ( !myQuadList.empty() && myQuadList.front()->face.IsSame( aShape ))
1075 return myQuadList.front();
1077 TopoDS_Face F = TopoDS::Face(aShape);
1078 if ( F.Orientation() >= TopAbs_INTERNAL ) F.Orientation( TopAbs_FORWARD );
1079 const bool ignoreMediumNodes = _quadraticMesh;
1081 // verify 1 wire only
1082 list< TopoDS_Edge > edges;
1083 list< int > nbEdgesInWire;
1084 int nbWire = SMESH_Block::GetOrderedEdges (F, edges, nbEdgesInWire);
1086 error(COMPERR_BAD_SHAPE, TComm("Wrong number of wires: ") << nbWire);
1087 return FaceQuadStruct::Ptr();
1090 // find corner vertices of the quad
1091 vector<TopoDS_Vertex> corners;
1092 int nbDegenEdges, nbSides = getCorners( F, aMesh, edges, corners, nbDegenEdges, considerMesh );
1095 return FaceQuadStruct::Ptr();
1097 FaceQuadStruct::Ptr quad( new FaceQuadStruct );
1098 quad->side.reserve(nbEdgesInWire.front());
1101 list< TopoDS_Edge >::iterator edgeIt = edges.begin();
1102 if ( nbSides == 3 ) // 3 sides and corners[0] is a vertex with myTriaVertexID
1104 for ( int iSide = 0; iSide < 3; ++iSide )
1106 list< TopoDS_Edge > sideEdges;
1107 TopoDS_Vertex nextSideV = corners[( iSide + 1 ) % 3 ];
1108 while ( edgeIt != edges.end() &&
1109 !nextSideV.IsSame( SMESH_MesherHelper::IthVertex( 0, *edgeIt )))
1110 if ( SMESH_Algo::isDegenerated( *edgeIt ))
1113 sideEdges.push_back( *edgeIt++ );
1114 if ( !sideEdges.empty() )
1115 quad->side.push_back( StdMeshers_FaceSide::New(F, sideEdges, &aMesh, iSide < QUAD_TOP_SIDE,
1116 ignoreMediumNodes, myProxyMesh));
1120 const vector<UVPtStruct>& UVPSleft = quad->side[0].GetUVPtStruct(true,0);
1121 /* vector<UVPtStruct>& UVPStop = */quad->side[1].GetUVPtStruct(false,1);
1122 /* vector<UVPtStruct>& UVPSright = */quad->side[2].GetUVPtStruct(true,1);
1123 const SMDS_MeshNode* aNode = UVPSleft[0].node;
1124 gp_Pnt2d aPnt2d = UVPSleft[0].UV();
1125 quad->side.push_back( StdMeshers_FaceSide::New( quad->side[1].grid.get(), aNode, &aPnt2d ));
1126 myNeedSmooth = ( nbDegenEdges > 0 );
1131 myNeedSmooth = ( corners.size() == 4 && nbDegenEdges > 0 );
1132 int iSide = 0, nbUsedDegen = 0, nbLoops = 0;
1133 for ( ; edgeIt != edges.end(); ++nbLoops )
1135 list< TopoDS_Edge > sideEdges;
1136 TopoDS_Vertex nextSideV = corners[( iSide + 1 - nbUsedDegen ) % corners.size() ];
1137 while ( edgeIt != edges.end() &&
1138 !nextSideV.IsSame( myHelper->IthVertex( 0, *edgeIt )))
1140 if ( SMESH_Algo::isDegenerated( *edgeIt ) )
1144 ++edgeIt; // no side on the degenerated EDGE
1148 if ( sideEdges.empty() )
1151 sideEdges.push_back( *edgeIt++ ); // a degenerated side
1156 break; // do not append a degenerated EDGE to a regular side
1162 sideEdges.push_back( *edgeIt++ );
1165 if ( !sideEdges.empty() )
1167 quad->side.push_back( StdMeshers_FaceSide::New( F, sideEdges, &aMesh, iSide < QUAD_TOP_SIDE,
1168 ignoreMediumNodes, myProxyMesh ));
1171 else if ( !SMESH_Algo::isDegenerated( *edgeIt ) && // closed EDGE
1172 myHelper->IthVertex( 0, *edgeIt ).IsSame( myHelper->IthVertex( 1, *edgeIt )))
1174 quad->side.push_back( StdMeshers_FaceSide::New( F, *edgeIt++, &aMesh, iSide < QUAD_TOP_SIDE,
1175 ignoreMediumNodes, myProxyMesh));
1178 if ( quad->side.size() == 4 )
1182 error(TComm("Bug: infinite loop in StdMeshers_Quadrangle_2D::CheckNbEdges()"));
1187 if ( quad && quad->side.size() != 4 )
1189 error(TComm("Bug: ") << quad->side.size() << " sides found instead of 4");
1198 //=============================================================================
1202 //=============================================================================
1204 bool StdMeshers_Quadrangle_2D::checkNbEdgesForEvaluate(SMESH_Mesh& aMesh,
1205 const TopoDS_Shape & aShape,
1206 MapShapeNbElems& aResMap,
1207 std::vector<int>& aNbNodes,
1211 const TopoDS_Face & F = TopoDS::Face(aShape);
1213 // verify 1 wire only, with 4 edges
1214 list< TopoDS_Edge > edges;
1215 list< int > nbEdgesInWire;
1216 int nbWire = SMESH_Block::GetOrderedEdges (F, edges, nbEdgesInWire);
1224 list< TopoDS_Edge >::iterator edgeIt = edges.begin();
1225 SMESH_subMesh * sm = aMesh.GetSubMesh(*edgeIt);
1226 MapShapeNbElemsItr anIt = aResMap.find(sm);
1227 if (anIt==aResMap.end()) {
1230 std::vector<int> aVec = (*anIt).second;
1231 IsQuadratic = (aVec[SMDSEntity_Quad_Edge] > aVec[SMDSEntity_Edge]);
1232 if (nbEdgesInWire.front() == 3) { // exactly 3 edges
1233 if (myTriaVertexID>0) {
1234 SMESHDS_Mesh* meshDS = aMesh.GetMeshDS();
1235 TopoDS_Vertex V = TopoDS::Vertex(meshDS->IndexToShape(myTriaVertexID));
1237 TopoDS_Edge E1,E2,E3;
1238 for (; edgeIt != edges.end(); ++edgeIt) {
1239 TopoDS_Edge E = TopoDS::Edge(*edgeIt);
1240 TopoDS_Vertex VF, VL;
1241 TopExp::Vertices(E, VF, VL, true);
1244 else if (VL.IsSame(V))
1249 SMESH_subMesh * sm = aMesh.GetSubMesh(E1);
1250 MapShapeNbElemsItr anIt = aResMap.find(sm);
1251 if (anIt==aResMap.end()) return false;
1252 std::vector<int> aVec = (*anIt).second;
1254 aNbNodes[0] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1256 aNbNodes[0] = aVec[SMDSEntity_Node] + 2;
1257 sm = aMesh.GetSubMesh(E2);
1258 anIt = aResMap.find(sm);
1259 if (anIt==aResMap.end()) return false;
1260 aVec = (*anIt).second;
1262 aNbNodes[1] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1264 aNbNodes[1] = aVec[SMDSEntity_Node] + 2;
1265 sm = aMesh.GetSubMesh(E3);
1266 anIt = aResMap.find(sm);
1267 if (anIt==aResMap.end()) return false;
1268 aVec = (*anIt).second;
1270 aNbNodes[2] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1272 aNbNodes[2] = aVec[SMDSEntity_Node] + 2;
1273 aNbNodes[3] = aNbNodes[1];
1279 if (nbEdgesInWire.front() == 4) { // exactly 4 edges
1280 for (; edgeIt != edges.end(); edgeIt++) {
1281 SMESH_subMesh * sm = aMesh.GetSubMesh(*edgeIt);
1282 MapShapeNbElemsItr anIt = aResMap.find(sm);
1283 if (anIt==aResMap.end()) {
1286 std::vector<int> aVec = (*anIt).second;
1288 aNbNodes[nbSides] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1290 aNbNodes[nbSides] = aVec[SMDSEntity_Node] + 2;
1294 else if (nbEdgesInWire.front() > 4) { // more than 4 edges - try to unite some
1295 list< TopoDS_Edge > sideEdges;
1296 while (!edges.empty()) {
1298 sideEdges.splice(sideEdges.end(), edges, edges.begin()); // edges.front() -> sideEdges.end()
1299 bool sameSide = true;
1300 while (!edges.empty() && sameSide) {
1301 sameSide = SMESH_Algo::IsContinuous(sideEdges.back(), edges.front());
1303 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1305 if (nbSides == 0) { // go backward from the first edge
1307 while (!edges.empty() && sameSide) {
1308 sameSide = SMESH_Algo::IsContinuous(sideEdges.front(), edges.back());
1310 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
1313 list<TopoDS_Edge>::iterator ite = sideEdges.begin();
1314 aNbNodes[nbSides] = 1;
1315 for (; ite!=sideEdges.end(); ite++) {
1316 SMESH_subMesh * sm = aMesh.GetSubMesh(*ite);
1317 MapShapeNbElemsItr anIt = aResMap.find(sm);
1318 if (anIt==aResMap.end()) {
1321 std::vector<int> aVec = (*anIt).second;
1323 aNbNodes[nbSides] += (aVec[SMDSEntity_Node]-1)/2 + 1;
1325 aNbNodes[nbSides] += aVec[SMDSEntity_Node] + 1;
1329 // issue 20222. Try to unite only edges shared by two same faces
1332 SMESH_Block::GetOrderedEdges (F, edges, nbEdgesInWire);
1333 while (!edges.empty()) {
1335 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1336 bool sameSide = true;
1337 while (!edges.empty() && sameSide) {
1339 SMESH_Algo::IsContinuous(sideEdges.back(), edges.front()) &&
1340 twoEdgesMeatAtVertex(sideEdges.back(), edges.front(), aMesh);
1342 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1344 if (nbSides == 0) { // go backward from the first edge
1346 while (!edges.empty() && sameSide) {
1348 SMESH_Algo::IsContinuous(sideEdges.front(), edges.back()) &&
1349 twoEdgesMeatAtVertex(sideEdges.front(), edges.back(), aMesh);
1351 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
1354 list<TopoDS_Edge>::iterator ite = sideEdges.begin();
1355 aNbNodes[nbSides] = 1;
1356 for (; ite!=sideEdges.end(); ite++) {
1357 SMESH_subMesh * sm = aMesh.GetSubMesh(*ite);
1358 MapShapeNbElemsItr anIt = aResMap.find(sm);
1359 if (anIt==aResMap.end()) {
1362 std::vector<int> aVec = (*anIt).second;
1364 aNbNodes[nbSides] += (aVec[SMDSEntity_Node]-1)/2 + 1;
1366 aNbNodes[nbSides] += aVec[SMDSEntity_Node] + 1;
1374 nbSides = nbEdgesInWire.front();
1375 error(COMPERR_BAD_SHAPE, TComm("Face must have 4 sides but not ") << nbSides);
1383 //=============================================================================
1387 //=============================================================================
1390 StdMeshers_Quadrangle_2D::CheckAnd2Dcompute (SMESH_Mesh & aMesh,
1391 const TopoDS_Shape & aShape,
1392 const bool CreateQuadratic)
1394 _quadraticMesh = CreateQuadratic;
1396 FaceQuadStruct::Ptr quad = CheckNbEdges(aMesh, aShape);
1399 // set normalized grid on unit square in parametric domain
1400 if ( ! setNormalizedGrid( quad ))
1408 inline const vector<UVPtStruct>& getUVPtStructIn(FaceQuadStruct::Ptr& quad, int i, int nbSeg)
1410 bool isXConst = (i == QUAD_BOTTOM_SIDE || i == QUAD_TOP_SIDE);
1411 double constValue = (i == QUAD_BOTTOM_SIDE || i == QUAD_LEFT_SIDE) ? 0 : 1;
1413 quad->nbNodeOut(i) ?
1414 quad->side[i].grid->SimulateUVPtStruct(nbSeg,isXConst,constValue) :
1415 quad->side[i].grid->GetUVPtStruct (isXConst,constValue);
1417 inline gp_UV calcUV(double x, double y,
1418 const gp_UV& a0,const gp_UV& a1,const gp_UV& a2,const gp_UV& a3,
1419 const gp_UV& p0,const gp_UV& p1,const gp_UV& p2,const gp_UV& p3)
1422 ((1 - y) * p0 + x * p1 + y * p2 + (1 - x) * p3 ) -
1423 ((1 - x) * (1 - y) * a0 + x * (1 - y) * a1 + x * y * a2 + (1 - x) * y * a3);
1427 //=============================================================================
1431 //=============================================================================
1433 bool StdMeshers_Quadrangle_2D::setNormalizedGrid (FaceQuadStruct::Ptr quad)
1435 if ( !quad->uv_grid.empty() )
1438 // Algorithme décrit dans "Génération automatique de maillages"
1439 // P.L. GEORGE, MASSON, § 6.4.1 p. 84-85
1440 // traitement dans le domaine paramétrique 2d u,v
1441 // transport - projection sur le carré unité
1444 // |<----north-2-------^ a3 -------------> a2
1446 // west-3 east-1 =right | |
1450 // v----south-0--------> a0 -------------> a1
1454 const FaceQuadStruct::Side & bSide = quad->side[0];
1455 const FaceQuadStruct::Side & rSide = quad->side[1];
1456 const FaceQuadStruct::Side & tSide = quad->side[2];
1457 const FaceQuadStruct::Side & lSide = quad->side[3];
1459 int nbhoriz = Min( bSide.NbPoints(), tSide.NbPoints() );
1460 int nbvertic = Min( rSide.NbPoints(), lSide.NbPoints() );
1462 if ( myQuadList.size() == 1 )
1464 // all sub-quads must have NO sides with nbNodeOut > 0
1465 quad->nbNodeOut(0) = Max( 0, bSide.grid->NbPoints() - tSide.grid->NbPoints() );
1466 quad->nbNodeOut(1) = Max( 0, rSide.grid->NbPoints() - lSide.grid->NbPoints() );
1467 quad->nbNodeOut(2) = Max( 0, tSide.grid->NbPoints() - bSide.grid->NbPoints() );
1468 quad->nbNodeOut(3) = Max( 0, lSide.grid->NbPoints() - rSide.grid->NbPoints() );
1470 const vector<UVPtStruct>& uv_e0 = bSide.GetUVPtStruct();
1471 const vector<UVPtStruct>& uv_e1 = rSide.GetUVPtStruct();
1472 const vector<UVPtStruct>& uv_e2 = tSide.GetUVPtStruct();
1473 const vector<UVPtStruct>& uv_e3 = lSide.GetUVPtStruct();
1474 if (uv_e0.empty() || uv_e1.empty() || uv_e2.empty() || uv_e3.empty())
1475 //return error("Can't find nodes on sides");
1476 return error(COMPERR_BAD_INPUT_MESH);
1478 quad->uv_grid.resize( nbvertic * nbhoriz );
1479 quad->iSize = nbhoriz;
1480 quad->jSize = nbvertic;
1481 UVPtStruct *uv_grid = & quad->uv_grid[0];
1483 quad->uv_box.Clear();
1485 // copy data of face boundary
1487 FaceQuadStruct::SideIterator sideIter;
1491 const double x0 = bSide.First().normParam;
1492 const double dx = bSide.Last().normParam - bSide.First().normParam;
1493 for ( sideIter.Init( bSide ); sideIter.More(); sideIter.Next() ) {
1494 sideIter.UVPt().x = ( sideIter.UVPt().normParam - x0 ) / dx;
1495 sideIter.UVPt().y = 0.;
1496 uv_grid[ j * nbhoriz + sideIter.Count() ] = sideIter.UVPt();
1497 quad->uv_box.Add( sideIter.UVPt().UV() );
1501 const int i = nbhoriz - 1;
1502 const double y0 = rSide.First().normParam;
1503 const double dy = rSide.Last().normParam - rSide.First().normParam;
1504 sideIter.Init( rSide );
1505 if ( quad->UVPt( i, sideIter.Count() ).node )
1506 sideIter.Next(); // avoid copying from a split emulated side
1507 for ( ; sideIter.More(); sideIter.Next() ) {
1508 sideIter.UVPt().x = 1.;
1509 sideIter.UVPt().y = ( sideIter.UVPt().normParam - y0 ) / dy;
1510 uv_grid[ sideIter.Count() * nbhoriz + i ] = sideIter.UVPt();
1511 quad->uv_box.Add( sideIter.UVPt().UV() );
1515 const int j = nbvertic - 1;
1516 const double x0 = tSide.First().normParam;
1517 const double dx = tSide.Last().normParam - tSide.First().normParam;
1518 int i = 0, nb = nbhoriz;
1519 sideIter.Init( tSide );
1520 if ( quad->UVPt( nb-1, j ).node ) --nb; // avoid copying from a split emulated side
1521 for ( ; i < nb; i++, sideIter.Next()) {
1522 sideIter.UVPt().x = ( sideIter.UVPt().normParam - x0 ) / dx;
1523 sideIter.UVPt().y = 1.;
1524 uv_grid[ j * nbhoriz + i ] = sideIter.UVPt();
1525 quad->uv_box.Add( sideIter.UVPt().UV() );
1530 const double y0 = lSide.First().normParam;
1531 const double dy = lSide.Last().normParam - lSide.First().normParam;
1532 int j = 0, nb = nbvertic;
1533 sideIter.Init( lSide );
1534 if ( quad->UVPt( i, j ).node )
1535 ++j, sideIter.Next(); // avoid copying from a split emulated side
1536 if ( quad->UVPt( i, nb-1 ).node )
1538 for ( ; j < nb; j++, sideIter.Next()) {
1539 sideIter.UVPt().x = 0.;
1540 sideIter.UVPt().y = ( sideIter.UVPt().normParam - y0 ) / dy;
1541 uv_grid[ j * nbhoriz + i ] = sideIter.UVPt();
1542 quad->uv_box.Add( sideIter.UVPt().UV() );
1546 // normalized 2d parameters on grid
1548 for (int i = 1; i < nbhoriz-1; i++)
1550 const double x0 = quad->UVPt( i, 0 ).x;
1551 const double x1 = quad->UVPt( i, nbvertic-1 ).x;
1552 for (int j = 1; j < nbvertic-1; j++)
1554 const double y0 = quad->UVPt( 0, j ).y;
1555 const double y1 = quad->UVPt( nbhoriz-1, j ).y;
1556 // --- intersection : x=x0+(y0+x(y1-y0))(x1-x0)
1557 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1558 double y = y0 + x * (y1 - y0);
1559 int ij = j * nbhoriz + i;
1562 uv_grid[ij].node = NULL;
1566 // projection on 2d domain (u,v)
1568 gp_UV a0 = quad->UVPt( 0, 0 ).UV();
1569 gp_UV a1 = quad->UVPt( nbhoriz-1, 0 ).UV();
1570 gp_UV a2 = quad->UVPt( nbhoriz-1, nbvertic-1 ).UV();
1571 gp_UV a3 = quad->UVPt( 0, nbvertic-1 ).UV();
1573 for (int i = 1; i < nbhoriz-1; i++)
1575 gp_UV p0 = quad->UVPt( i, 0 ).UV();
1576 gp_UV p2 = quad->UVPt( i, nbvertic-1 ).UV();
1577 for (int j = 1; j < nbvertic-1; j++)
1579 gp_UV p1 = quad->UVPt( nbhoriz-1, j ).UV();
1580 gp_UV p3 = quad->UVPt( 0, j ).UV();
1582 int ij = j * nbhoriz + i;
1583 double x = uv_grid[ij].x;
1584 double y = uv_grid[ij].y;
1586 gp_UV uv = calcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1588 uv_grid[ij].u = uv.X();
1589 uv_grid[ij].v = uv.Y();
1595 //=======================================================================
1596 //function : ShiftQuad
1597 //purpose : auxilary function for computeQuadPref
1598 //=======================================================================
1600 void StdMeshers_Quadrangle_2D::shiftQuad(FaceQuadStruct::Ptr& quad, const int num )
1602 quad->shift( num, /*ori=*/true, /*keepGrid=*/myQuadList.size() > 1 );
1605 //================================================================================
1607 * \brief Rotate sides of a quad by given nb of quartes
1608 * \param nb - number of rotation quartes
1609 * \param ori - to keep orientation of sides as in an unit quad or not
1610 * \param keepGrid - if \c true Side::grid is not changed, Side::from and Side::to
1611 * are altered instead
1613 //================================================================================
1615 void FaceQuadStruct::shift( size_t nb, bool ori, bool keepGrid )
1617 if ( nb == 0 ) return;
1619 vector< Side > newSides( side.size() );
1620 vector< Side* > sidePtrs( side.size() );
1621 for (int i = QUAD_BOTTOM_SIDE; i < NB_QUAD_SIDES; ++i)
1623 int id = (i + nb) % NB_QUAD_SIDES;
1626 bool wasForward = (i < QUAD_TOP_SIDE);
1627 bool newForward = (id < QUAD_TOP_SIDE);
1628 if ( wasForward != newForward )
1629 side[ i ].Reverse( keepGrid );
1631 newSides[ id ] = side[ i ];
1632 sidePtrs[ i ] = & side[ i ];
1634 // make newSides refer newSides via Side::Contact's
1635 for ( size_t i = 0; i < newSides.size(); ++i )
1637 FaceQuadStruct::Side& ns = newSides[ i ];
1638 for ( size_t iC = 0; iC < ns.contacts.size(); ++iC )
1640 FaceQuadStruct::Side* oSide = ns.contacts[iC].other_side;
1641 vector< Side* >::iterator sIt = std::find( sidePtrs.begin(), sidePtrs.end(), oSide );
1642 if ( sIt != sidePtrs.end() )
1643 ns.contacts[iC].other_side = & newSides[ *sIt - sidePtrs[0] ];
1646 newSides.swap( side );
1651 //=======================================================================
1653 //purpose : auxilary function for computeQuadPref
1654 //=======================================================================
1656 static gp_UV calcUV(double x0, double x1, double y0, double y1,
1657 FaceQuadStruct::Ptr& quad,
1658 const gp_UV& a0, const gp_UV& a1,
1659 const gp_UV& a2, const gp_UV& a3)
1661 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1662 double y = y0 + x * (y1 - y0);
1664 gp_UV p0 = quad->side[QUAD_BOTTOM_SIDE].grid->Value2d(x).XY();
1665 gp_UV p1 = quad->side[QUAD_RIGHT_SIDE ].grid->Value2d(y).XY();
1666 gp_UV p2 = quad->side[QUAD_TOP_SIDE ].grid->Value2d(x).XY();
1667 gp_UV p3 = quad->side[QUAD_LEFT_SIDE ].grid->Value2d(y).XY();
1669 gp_UV uv = calcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1674 //=======================================================================
1675 //function : calcUV2
1676 //purpose : auxilary function for computeQuadPref
1677 //=======================================================================
1679 static gp_UV calcUV2(double x, double y,
1680 FaceQuadStruct::Ptr& quad,
1681 const gp_UV& a0, const gp_UV& a1,
1682 const gp_UV& a2, const gp_UV& a3)
1684 gp_UV p0 = quad->side[QUAD_BOTTOM_SIDE].grid->Value2d(x).XY();
1685 gp_UV p1 = quad->side[QUAD_RIGHT_SIDE ].grid->Value2d(y).XY();
1686 gp_UV p2 = quad->side[QUAD_TOP_SIDE ].grid->Value2d(x).XY();
1687 gp_UV p3 = quad->side[QUAD_LEFT_SIDE ].grid->Value2d(y).XY();
1689 gp_UV uv = calcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1695 //=======================================================================
1697 * Create only quandrangle faces
1699 //=======================================================================
1701 bool StdMeshers_Quadrangle_2D::computeQuadPref (SMESH_Mesh & aMesh,
1702 const TopoDS_Face& aFace,
1703 FaceQuadStruct::Ptr quad)
1705 const bool OldVersion = (myQuadType == QUAD_QUADRANGLE_PREF_REVERSED);
1706 const bool WisF = true;
1708 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
1709 Handle(Geom_Surface) S = BRep_Tool::Surface(aFace);
1710 int i,j, geomFaceID = meshDS->ShapeToIndex(aFace);
1712 int nb = quad->side[0].NbPoints();
1713 int nr = quad->side[1].NbPoints();
1714 int nt = quad->side[2].NbPoints();
1715 int nl = quad->side[3].NbPoints();
1716 int dh = abs(nb-nt);
1717 int dv = abs(nr-nl);
1719 if ( myForcedPnts.empty() )
1721 // rotate sides to be as in the picture below and to have
1722 // dh >= dv and nt > nb
1724 shiftQuad( quad, ( nt > nb ) ? 0 : 2 );
1726 shiftQuad( quad, ( nr > nl ) ? 1 : 3 );
1730 // rotate the quad to have nt > nb [and nr > nl]
1732 shiftQuad ( quad, nr > nl ? 1 : 2 );
1734 shiftQuad( quad, nb == nt ? 1 : 0 );
1736 shiftQuad( quad, 3 );
1739 nb = quad->side[0].NbPoints();
1740 nr = quad->side[1].NbPoints();
1741 nt = quad->side[2].NbPoints();
1742 nl = quad->side[3].NbPoints();
1745 int nbh = Max(nb,nt);
1746 int nbv = Max(nr,nl);
1750 // Orientation of face and 3 main domain for future faces
1751 // ----------- Old version ---------------
1757 // left | |__| | rigth
1764 // ----------- New version ---------------
1770 // left |/________\| rigth
1778 const int bfrom = quad->side[0].from;
1779 const int rfrom = quad->side[1].from;
1780 const int tfrom = quad->side[2].from;
1781 const int lfrom = quad->side[3].from;
1783 const vector<UVPtStruct>& uv_eb_vec = quad->side[0].GetUVPtStruct(true,0);
1784 const vector<UVPtStruct>& uv_er_vec = quad->side[1].GetUVPtStruct(false,1);
1785 const vector<UVPtStruct>& uv_et_vec = quad->side[2].GetUVPtStruct(true,1);
1786 const vector<UVPtStruct>& uv_el_vec = quad->side[3].GetUVPtStruct(false,0);
1787 if (uv_eb_vec.empty() ||
1788 uv_er_vec.empty() ||
1789 uv_et_vec.empty() ||
1791 return error(COMPERR_BAD_INPUT_MESH);
1793 FaceQuadStruct::SideIterator uv_eb, uv_er, uv_et, uv_el;
1794 uv_eb.Init( quad->side[0] );
1795 uv_er.Init( quad->side[1] );
1796 uv_et.Init( quad->side[2] );
1797 uv_el.Init( quad->side[3] );
1799 gp_UV a0,a1,a2,a3, p0,p1,p2,p3, uv;
1802 a0 = uv_eb[ 0 ].UV();
1803 a1 = uv_er[ 0 ].UV();
1804 a2 = uv_er[ nr-1 ].UV();
1805 a3 = uv_et[ 0 ].UV();
1807 if ( !myForcedPnts.empty() )
1809 if ( dv != 0 && dh != 0 ) // here myQuadList.size() == 1
1811 const int dmin = Min( dv, dh );
1813 // Make a side separating domains L and Cb
1814 StdMeshers_FaceSidePtr sideLCb;
1815 UVPtStruct p3dom; // a point where 3 domains meat
1817 vector<UVPtStruct> pointsLCb( dmin+1 ); // 1--------1
1818 pointsLCb[0] = uv_eb[0]; // | | |
1819 for ( int i = 1; i <= dmin; ++i ) // | |Ct|
1821 x = uv_et[ i ].normParam; // | |__|
1822 y = uv_er[ i ].normParam; // | / |
1823 p0 = quad->side[0].grid->Value2d( x ).XY(); // | / Cb |dmin
1824 p1 = uv_er[ i ].UV(); // |/ |
1825 p2 = uv_et[ i ].UV(); // 0--------0
1826 p3 = quad->side[3].grid->Value2d( y ).XY();
1827 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1828 pointsLCb[ i ].u = uv.X();
1829 pointsLCb[ i ].v = uv.Y();
1831 sideLCb = StdMeshers_FaceSide::New( pointsLCb, aFace );
1832 p3dom = pointsLCb.back();
1834 // Make a side separating domains L and Ct
1835 StdMeshers_FaceSidePtr sideLCt;
1837 vector<UVPtStruct> pointsLCt( nl );
1838 pointsLCt[0] = p3dom;
1839 pointsLCt.back() = uv_et[ dmin ];
1840 x = uv_et[ dmin ].normParam;
1841 p0 = quad->side[0].grid->Value2d( x ).XY();
1842 p2 = uv_et[ dmin ].UV();
1843 double y0 = uv_er[ dmin ].normParam;
1844 for ( int i = 1; i < nl-1; ++i )
1846 y = y0 + i / ( nl-1. ) * ( 1. - y0 );
1847 p1 = quad->side[1].grid->Value2d( y ).XY();
1848 p3 = quad->side[3].grid->Value2d( y ).XY();
1849 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1850 pointsLCt[ i ].u = uv.X();
1851 pointsLCt[ i ].v = uv.Y();
1853 sideLCt = StdMeshers_FaceSide::New( pointsLCt, aFace );
1855 // Make a side separating domains Cb and Ct
1856 StdMeshers_FaceSidePtr sideCbCt;
1858 vector<UVPtStruct> pointsCbCt( nb );
1859 pointsCbCt[0] = p3dom;
1860 pointsCbCt.back() = uv_er[ dmin ];
1861 y = uv_er[ dmin ].normParam;
1862 p1 = uv_er[ dmin ].UV();
1863 p3 = quad->side[3].grid->Value2d( y ).XY();
1864 double x0 = uv_et[ dmin ].normParam;
1865 for ( int i = 1; i < nb-1; ++i )
1867 x = x0 + i / ( nb-1. ) * ( 1. - x0 );
1868 p2 = quad->side[2].grid->Value2d( x ).XY();
1869 p0 = quad->side[0].grid->Value2d( x ).XY();
1870 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1871 pointsCbCt[ i ].u = uv.X();
1872 pointsCbCt[ i ].v = uv.Y();
1874 sideCbCt = StdMeshers_FaceSide::New( pointsCbCt, aFace );
1877 FaceQuadStruct* qCb = new FaceQuadStruct( quad->face, "Cb" );
1878 myQuadList.push_back( FaceQuadStruct::Ptr( qCb ));
1879 qCb->side.resize(4);
1880 qCb->side[0] = quad->side[0];
1881 qCb->side[1] = quad->side[1];
1882 qCb->side[2] = sideCbCt;
1883 qCb->side[3] = sideLCb;
1884 qCb->side[1].to = dmin+1;
1886 FaceQuadStruct* qL = new FaceQuadStruct( quad->face, "L" );
1887 myQuadList.push_back( FaceQuadStruct::Ptr( qL ));
1889 qL->side[0] = sideLCb;
1890 qL->side[1] = sideLCt;
1891 qL->side[2] = quad->side[2];
1892 qL->side[3] = quad->side[3];
1893 qL->side[2].to = dmin+1;
1894 // Make Ct from the main quad
1895 FaceQuadStruct::Ptr qCt = quad;
1896 qCt->side[0] = sideCbCt;
1897 qCt->side[3] = sideLCt;
1898 qCt->side[1].from = dmin;
1899 qCt->side[2].from = dmin;
1900 qCt->uv_grid.clear();
1904 qCb->side[3].AddContact( dmin, & qCb->side[2], 0 );
1905 qCb->side[3].AddContact( dmin, & qCt->side[3], 0 );
1906 qCt->side[3].AddContact( 0, & qCt->side[0], 0 );
1907 qCt->side[0].AddContact( 0, & qL ->side[0], dmin );
1908 qL ->side[0].AddContact( dmin, & qL ->side[1], 0 );
1909 qL ->side[0].AddContact( dmin, & qCb->side[2], 0 );
1912 return computeQuadDominant( aMesh, aFace );
1914 return computeQuadPref( aMesh, aFace, qCt );
1916 } // if ( dv != 0 && dh != 0 )
1918 const int db = quad->side[0].IsReversed() ? -1 : +1;
1919 const int dr = quad->side[1].IsReversed() ? -1 : +1;
1920 const int dt = quad->side[2].IsReversed() ? -1 : +1;
1921 const int dl = quad->side[3].IsReversed() ? -1 : +1;
1923 // Case dv == 0, here possibly myQuadList.size() > 1
1935 const int lw = dh/2; // lateral width
1939 double lL = quad->side[3].Length();
1940 double lLwL = quad->side[2].Length( tfrom,
1941 tfrom + ( lw ) * dt );
1942 yCbL = lLwL / ( lLwL + lL );
1944 double lR = quad->side[1].Length();
1945 double lLwR = quad->side[2].Length( tfrom + ( lw + nb-1 ) * dt,
1946 tfrom + ( lw + nb-1 + lw ) * dt);
1947 yCbR = lLwR / ( lLwR + lR );
1949 // Make sides separating domains Cb and L and R
1950 StdMeshers_FaceSidePtr sideLCb, sideRCb;
1951 UVPtStruct pTBL, pTBR; // points where 3 domains meat
1953 vector<UVPtStruct> pointsLCb( lw+1 ), pointsRCb( lw+1 );
1954 pointsLCb[0] = uv_eb[ 0 ];
1955 pointsRCb[0] = uv_eb[ nb-1 ];
1956 for ( int i = 1, i2 = nt-2; i <= lw; ++i, --i2 )
1958 x = quad->side[2].Param( i );
1960 p0 = quad->side[0].Value2d( x );
1961 p1 = quad->side[1].Value2d( y );
1962 p2 = uv_et[ i ].UV();
1963 p3 = quad->side[3].Value2d( y );
1964 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1965 pointsLCb[ i ].u = uv.X();
1966 pointsLCb[ i ].v = uv.Y();
1967 pointsLCb[ i ].x = x;
1969 x = quad->side[2].Param( i2 );
1971 p1 = quad->side[1].Value2d( y );
1972 p0 = quad->side[0].Value2d( x );
1973 p2 = uv_et[ i2 ].UV();
1974 p3 = quad->side[3].Value2d( y );
1975 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1976 pointsRCb[ i ].u = uv.X();
1977 pointsRCb[ i ].v = uv.Y();
1978 pointsRCb[ i ].x = x;
1980 sideLCb = StdMeshers_FaceSide::New( pointsLCb, aFace );
1981 sideRCb = StdMeshers_FaceSide::New( pointsRCb, aFace );
1982 pTBL = pointsLCb.back();
1983 pTBR = pointsRCb.back();
1985 // Make sides separating domains Ct and L and R
1986 StdMeshers_FaceSidePtr sideLCt, sideRCt;
1988 vector<UVPtStruct> pointsLCt( nl ), pointsRCt( nl );
1989 pointsLCt[0] = pTBL;
1990 pointsLCt.back() = uv_et[ lw ];
1991 pointsRCt[0] = pTBR;
1992 pointsRCt.back() = uv_et[ lw + nb - 1 ];
1994 p0 = quad->side[0].Value2d( x );
1995 p2 = uv_et[ lw ].UV();
1996 int iR = lw + nb - 1;
1998 gp_UV p0R = quad->side[0].Value2d( xR );
1999 gp_UV p2R = uv_et[ iR ].UV();
2000 for ( int i = 1; i < nl-1; ++i )
2002 y = yCbL + ( 1. - yCbL ) * i / (nl-1.);
2003 p1 = quad->side[1].Value2d( y );
2004 p3 = quad->side[3].Value2d( y );
2005 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
2006 pointsLCt[ i ].u = uv.X();
2007 pointsLCt[ i ].v = uv.Y();
2009 y = yCbR + ( 1. - yCbR ) * i / (nl-1.);
2010 p1 = quad->side[1].Value2d( y );
2011 p3 = quad->side[3].Value2d( y );
2012 uv = calcUV( xR,y, a0,a1,a2,a3, p0R,p1,p2R,p3 );
2013 pointsRCt[ i ].u = uv.X();
2014 pointsRCt[ i ].v = uv.Y();
2016 sideLCt = StdMeshers_FaceSide::New( pointsLCt, aFace );
2017 sideRCt = StdMeshers_FaceSide::New( pointsRCt, aFace );
2019 // Make a side separating domains Cb and Ct
2020 StdMeshers_FaceSidePtr sideCbCt;
2022 vector<UVPtStruct> pointsCbCt( nb );
2023 pointsCbCt[0] = pTBL;
2024 pointsCbCt.back() = pTBR;
2025 p1 = quad->side[1].Value2d( yCbR );
2026 p3 = quad->side[3].Value2d( yCbL );
2027 for ( int i = 1; i < nb-1; ++i )
2029 x = quad->side[2].Param( i + lw );
2030 y = yCbL + ( yCbR - yCbL ) * i / (nb-1.);
2031 p2 = uv_et[ i + lw ].UV();
2032 p0 = quad->side[0].Value2d( x );
2033 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
2034 pointsCbCt[ i ].u = uv.X();
2035 pointsCbCt[ i ].v = uv.Y();
2037 sideCbCt = StdMeshers_FaceSide::New( pointsCbCt, aFace );
2040 FaceQuadStruct* qCb = new FaceQuadStruct( quad->face, "Cb" );
2041 myQuadList.push_back( FaceQuadStruct::Ptr( qCb ));
2042 qCb->side.resize(4);
2043 qCb->side[0] = quad->side[0];
2044 qCb->side[1] = sideRCb;
2045 qCb->side[2] = sideCbCt;
2046 qCb->side[3] = sideLCb;
2048 FaceQuadStruct* qL = new FaceQuadStruct( quad->face, "L" );
2049 myQuadList.push_back( FaceQuadStruct::Ptr( qL ));
2051 qL->side[0] = sideLCb;
2052 qL->side[1] = sideLCt;
2053 qL->side[2] = quad->side[2];
2054 qL->side[3] = quad->side[3];
2055 qL->side[2].to = ( lw + 1 ) * dt + tfrom;
2057 FaceQuadStruct* qR = new FaceQuadStruct( quad->face, "R" );
2058 myQuadList.push_back( FaceQuadStruct::Ptr( qR ));
2060 qR->side[0] = sideRCb;
2061 qR->side[0].from = lw;
2062 qR->side[0].to = -1;
2063 qR->side[0].di = -1;
2064 qR->side[1] = quad->side[1];
2065 qR->side[2] = quad->side[2];
2066 qR->side[2].from = ( lw + nb-1 ) * dt + tfrom;
2067 qR->side[3] = sideRCt;
2068 // Make Ct from the main quad
2069 FaceQuadStruct::Ptr qCt = quad;
2070 qCt->side[0] = sideCbCt;
2071 qCt->side[1] = sideRCt;
2072 qCt->side[2].from = ( lw ) * dt + tfrom;
2073 qCt->side[2].to = ( lw + nb ) * dt + tfrom;
2074 qCt->side[3] = sideLCt;
2075 qCt->uv_grid.clear();
2079 qCb->side[3].AddContact( lw, & qCb->side[2], 0 );
2080 qCb->side[3].AddContact( lw, & qCt->side[3], 0 );
2081 qCt->side[3].AddContact( 0, & qCt->side[0], 0 );
2082 qCt->side[0].AddContact( 0, & qL ->side[0], lw );
2083 qL ->side[0].AddContact( lw, & qL ->side[1], 0 );
2084 qL ->side[0].AddContact( lw, & qCb->side[2], 0 );
2086 qCb->side[1].AddContact( lw, & qCb->side[2], nb-1 );
2087 qCb->side[1].AddContact( lw, & qCt->side[1], 0 );
2088 qCt->side[0].AddContact( nb-1, & qCt->side[1], 0 );
2089 qCt->side[0].AddContact( nb-1, & qR ->side[0], lw );
2090 qR ->side[3].AddContact( 0, & qR ->side[0], lw );
2091 qR ->side[3].AddContact( 0, & qCb->side[2], nb-1 );
2093 return computeQuadDominant( aMesh, aFace );
2095 } // if ( !myForcedPnts.empty() )
2106 // arrays for normalized params
2107 TColStd_SequenceOfReal npb, npr, npt, npl;
2108 for (i=0; i<nb; i++) {
2109 npb.Append(uv_eb[i].normParam);
2111 for (i=0; i<nr; i++) {
2112 npr.Append(uv_er[i].normParam);
2114 for (i=0; i<nt; i++) {
2115 npt.Append(uv_et[i].normParam);
2117 for (i=0; i<nl; i++) {
2118 npl.Append(uv_el[i].normParam);
2123 // add some params to right and left after the first param
2126 double dpr = (npr.Value(2) - npr.Value(1))/(dr+1);
2127 for (i=1; i<=dr; i++) {
2128 npr.InsertAfter(1,npr.Value(2)-dpr);
2132 dpr = (npl.Value(2) - npl.Value(1))/(dl+1);
2133 for (i=1; i<=dl; i++) {
2134 npl.InsertAfter(1,npl.Value(2)-dpr);
2138 int nnn = Min(nr,nl);
2139 // auxilary sequence of XY for creation nodes
2140 // in the bottom part of central domain
2141 // Length of UVL and UVR must be == nbv-nnn
2142 TColgp_SequenceOfXY UVL, UVR, UVT;
2145 // step1: create faces for left domain
2146 StdMeshers_Array2OfNode NodesL(1,dl+1,1,nl);
2148 for (j=1; j<=nl; j++)
2149 NodesL.SetValue(1,j,uv_el[j-1].node);
2152 for (i=1; i<=dl; i++)
2153 NodesL.SetValue(i+1,nl,uv_et[i].node);
2154 // create and add needed nodes
2155 TColgp_SequenceOfXY UVtmp;
2156 for (i=1; i<=dl; i++) {
2157 double x0 = npt.Value(i+1);
2160 double y0 = npl.Value(i+1);
2161 double y1 = npr.Value(i+1);
2162 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2163 gp_Pnt P = S->Value(UV.X(),UV.Y());
2164 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2165 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2166 NodesL.SetValue(i+1,1,N);
2167 if (UVL.Length()<nbv-nnn) UVL.Append(UV);
2169 for (j=2; j<nl; j++) {
2170 double y0 = npl.Value(dl+j);
2171 double y1 = npr.Value(dl+j);
2172 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2173 gp_Pnt P = S->Value(UV.X(),UV.Y());
2174 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2175 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2176 NodesL.SetValue(i+1,j,N);
2177 if (i==dl) UVtmp.Append(UV);
2180 for (i=1; i<=UVtmp.Length() && UVL.Length()<nbv-nnn; i++) {
2181 UVL.Append(UVtmp.Value(i));
2184 for (i=1; i<=dl; i++) {
2185 for (j=1; j<nl; j++) {
2188 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i+1,j),
2189 NodesL.Value(i+1,j+1), NodesL.Value(i,j+1));
2190 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2196 // fill UVL using c2d
2197 for (i=1; i<npl.Length() && UVL.Length()<nbv-nnn; i++) {
2198 UVL.Append(gp_UV (uv_el[i].u, uv_el[i].v));
2202 // step2: create faces for right domain
2203 StdMeshers_Array2OfNode NodesR(1,dr+1,1,nr);
2205 for (j=1; j<=nr; j++)
2206 NodesR.SetValue(1,j,uv_er[nr-j].node);
2209 for (i=1; i<=dr; i++)
2210 NodesR.SetValue(i+1,1,uv_et[nt-1-i].node);
2211 // create and add needed nodes
2212 TColgp_SequenceOfXY UVtmp;
2213 for (i=1; i<=dr; i++) {
2214 double x0 = npt.Value(nt-i);
2217 double y0 = npl.Value(i+1);
2218 double y1 = npr.Value(i+1);
2219 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2220 gp_Pnt P = S->Value(UV.X(),UV.Y());
2221 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2222 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2223 NodesR.SetValue(i+1,nr,N);
2224 if (UVR.Length()<nbv-nnn) UVR.Append(UV);
2226 for (j=2; j<nr; j++) {
2227 double y0 = npl.Value(nbv-j+1);
2228 double y1 = npr.Value(nbv-j+1);
2229 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2230 gp_Pnt P = S->Value(UV.X(),UV.Y());
2231 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2232 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2233 NodesR.SetValue(i+1,j,N);
2234 if (i==dr) UVtmp.Prepend(UV);
2237 for (i=1; i<=UVtmp.Length() && UVR.Length()<nbv-nnn; i++) {
2238 UVR.Append(UVtmp.Value(i));
2241 for (i=1; i<=dr; i++) {
2242 for (j=1; j<nr; j++) {
2245 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i+1,j),
2246 NodesR.Value(i+1,j+1), NodesR.Value(i,j+1));
2247 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2253 // fill UVR using c2d
2254 for (i=1; i<npr.Length() && UVR.Length()<nbv-nnn; i++) {
2255 UVR.Append(gp_UV(uv_er[i].u, uv_er[i].v));
2259 // step3: create faces for central domain
2260 StdMeshers_Array2OfNode NodesC(1,nb,1,nbv);
2261 // add first line using NodesL
2262 for (i=1; i<=dl+1; i++)
2263 NodesC.SetValue(1,i,NodesL(i,1));
2264 for (i=2; i<=nl; i++)
2265 NodesC.SetValue(1,dl+i,NodesL(dl+1,i));
2266 // add last line using NodesR
2267 for (i=1; i<=dr+1; i++)
2268 NodesC.SetValue(nb,i,NodesR(i,nr));
2269 for (i=1; i<nr; i++)
2270 NodesC.SetValue(nb,dr+i+1,NodesR(dr+1,nr-i));
2271 // add top nodes (last columns)
2272 for (i=dl+2; i<nbh-dr; i++)
2273 NodesC.SetValue(i-dl,nbv,uv_et[i-1].node);
2274 // add bottom nodes (first columns)
2275 for (i=2; i<nb; i++)
2276 NodesC.SetValue(i,1,uv_eb[i-1].node);
2278 // create and add needed nodes
2279 // add linear layers
2280 for (i=2; i<nb; i++) {
2281 double x0 = npt.Value(dl+i);
2283 for (j=1; j<nnn; j++) {
2284 double y0 = npl.Value(nbv-nnn+j);
2285 double y1 = npr.Value(nbv-nnn+j);
2286 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2287 gp_Pnt P = S->Value(UV.X(),UV.Y());
2288 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2289 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2290 NodesC.SetValue(i,nbv-nnn+j,N);
2295 // add diagonal layers
2296 gp_UV A2 = UVR.Value(nbv-nnn);
2297 gp_UV A3 = UVL.Value(nbv-nnn);
2298 for (i=1; i<nbv-nnn; i++) {
2299 gp_UV p1 = UVR.Value(i);
2300 gp_UV p3 = UVL.Value(i);
2301 double y = i / double(nbv-nnn);
2302 for (j=2; j<nb; j++) {
2303 double x = npb.Value(j);
2304 gp_UV p0( uv_eb[j-1].u, uv_eb[j-1].v );
2305 gp_UV p2 = UVT.Value( j-1 );
2306 gp_UV UV = calcUV(x, y, a0, a1, A2, A3, p0,p1,p2,p3 );
2307 gp_Pnt P = S->Value(UV.X(),UV.Y());
2308 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2309 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(),UV.Y());
2310 NodesC.SetValue(j,i+1,N);
2314 for (i=1; i<nb; i++) {
2315 for (j=1; j<nbv; j++) {
2318 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
2319 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
2320 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2326 else { // New version (!OldVersion)
2327 // step1: create faces for bottom rectangle domain
2328 StdMeshers_Array2OfNode NodesBRD(1,nb,1,nnn-1);
2329 // fill UVL and UVR using c2d
2330 for (j=0; j<nb; j++) {
2331 NodesBRD.SetValue(j+1,1,uv_eb[j].node);
2333 for (i=1; i<nnn-1; i++) {
2334 NodesBRD.SetValue(1,i+1,uv_el[i].node);
2335 NodesBRD.SetValue(nb,i+1,uv_er[i].node);
2336 for (j=2; j<nb; j++) {
2337 double x = npb.Value(j);
2338 double y = (1-x) * npl.Value(i+1) + x * npr.Value(i+1);
2339 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2340 gp_Pnt P = S->Value(UV.X(),UV.Y());
2341 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2342 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(),UV.Y());
2343 NodesBRD.SetValue(j,i+1,N);
2346 for (j=1; j<nnn-1; j++) {
2347 for (i=1; i<nb; i++) {
2350 myHelper->AddFace(NodesBRD.Value(i,j), NodesBRD.Value(i+1,j),
2351 NodesBRD.Value(i+1,j+1), NodesBRD.Value(i,j+1));
2352 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2356 int drl = abs(nr-nl);
2357 // create faces for region C
2358 StdMeshers_Array2OfNode NodesC(1,nb,1,drl+1+addv);
2359 // add nodes from previous region
2360 for (j=1; j<=nb; j++) {
2361 NodesC.SetValue(j,1,NodesBRD.Value(j,nnn-1));
2363 if ((drl+addv) > 0) {
2368 TColgp_SequenceOfXY UVtmp;
2369 double drparam = npr.Value(nr) - npr.Value(nnn-1);
2370 double dlparam = npl.Value(nnn) - npl.Value(nnn-1);
2372 for (i=1; i<=drl; i++) {
2373 // add existed nodes from right edge
2374 NodesC.SetValue(nb,i+1,uv_er[nnn+i-2].node);
2375 //double dtparam = npt.Value(i+1);
2376 y1 = npr.Value(nnn+i-1); // param on right edge
2377 double dpar = (y1 - npr.Value(nnn-1))/drparam;
2378 y0 = npl.Value(nnn-1) + dpar*dlparam; // param on left edge
2379 double dy = y1 - y0;
2380 for (j=1; j<nb; j++) {
2381 double x = npt.Value(i+1) + npb.Value(j)*(1-npt.Value(i+1));
2382 double y = y0 + dy*x;
2383 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2384 gp_Pnt P = S->Value(UV.X(),UV.Y());
2385 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2386 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2387 NodesC.SetValue(j,i+1,N);
2390 double dy0 = (1-y0)/(addv+1);
2391 double dy1 = (1-y1)/(addv+1);
2392 for (i=1; i<=addv; i++) {
2393 double yy0 = y0 + dy0*i;
2394 double yy1 = y1 + dy1*i;
2395 double dyy = yy1 - yy0;
2396 for (j=1; j<=nb; j++) {
2397 double x = npt.Value(i+1+drl) +
2398 npb.Value(j) * (npt.Value(nt-i) - npt.Value(i+1+drl));
2399 double y = yy0 + dyy*x;
2400 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2401 gp_Pnt P = S->Value(UV.X(),UV.Y());
2402 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2403 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2404 NodesC.SetValue(j,i+drl+1,N);
2411 TColgp_SequenceOfXY UVtmp;
2412 double dlparam = npl.Value(nl) - npl.Value(nnn-1);
2413 double drparam = npr.Value(nnn) - npr.Value(nnn-1);
2414 double y0 = npl.Value(nnn-1);
2415 double y1 = npr.Value(nnn-1);
2416 for (i=1; i<=drl; i++) {
2417 // add existed nodes from right edge
2418 NodesC.SetValue(1,i+1,uv_el[nnn+i-2].node);
2419 y0 = npl.Value(nnn+i-1); // param on left edge
2420 double dpar = (y0 - npl.Value(nnn-1))/dlparam;
2421 y1 = npr.Value(nnn-1) + dpar*drparam; // param on right edge
2422 double dy = y1 - y0;
2423 for (j=2; j<=nb; j++) {
2424 double x = npb.Value(j)*npt.Value(nt-i);
2425 double y = y0 + dy*x;
2426 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2427 gp_Pnt P = S->Value(UV.X(),UV.Y());
2428 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2429 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2430 NodesC.SetValue(j,i+1,N);
2433 double dy0 = (1-y0)/(addv+1);
2434 double dy1 = (1-y1)/(addv+1);
2435 for (i=1; i<=addv; i++) {
2436 double yy0 = y0 + dy0*i;
2437 double yy1 = y1 + dy1*i;
2438 double dyy = yy1 - yy0;
2439 for (j=1; j<=nb; j++) {
2440 double x = npt.Value(i+1) +
2441 npb.Value(j) * (npt.Value(nt-i-drl) - npt.Value(i+1));
2442 double y = yy0 + dyy*x;
2443 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2444 gp_Pnt P = S->Value(UV.X(),UV.Y());
2445 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2446 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2447 NodesC.SetValue(j,i+drl+1,N);
2452 for (j=1; j<=drl+addv; j++) {
2453 for (i=1; i<nb; i++) {
2456 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
2457 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
2458 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2463 StdMeshers_Array2OfNode NodesLast(1,nt,1,2);
2464 for (i=1; i<=nt; i++) {
2465 NodesLast.SetValue(i,2,uv_et[i-1].node);
2468 for (i=n1; i<drl+addv+1; i++) {
2470 NodesLast.SetValue(nnn,1,NodesC.Value(1,i));
2472 for (i=1; i<=nb; i++) {
2474 NodesLast.SetValue(nnn,1,NodesC.Value(i,drl+addv+1));
2476 for (i=drl+addv; i>=n2; i--) {
2478 NodesLast.SetValue(nnn,1,NodesC.Value(nb,i));
2480 for (i=1; i<nt; i++) {
2483 myHelper->AddFace(NodesLast.Value(i,1), NodesLast.Value(i+1,1),
2484 NodesLast.Value(i+1,2), NodesLast.Value(i,2));
2485 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2488 } // if ((drl+addv) > 0)
2490 } // end new version implementation
2497 //=======================================================================
2499 * Evaluate only quandrangle faces
2501 //=======================================================================
2503 bool StdMeshers_Quadrangle_2D::evaluateQuadPref(SMESH_Mesh & aMesh,
2504 const TopoDS_Shape& aShape,
2505 std::vector<int>& aNbNodes,
2506 MapShapeNbElems& aResMap,
2509 // Auxilary key in order to keep old variant
2510 // of meshing after implementation new variant
2511 // for bug 0016220 from Mantis.
2512 bool OldVersion = false;
2513 if (myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
2516 const TopoDS_Face& F = TopoDS::Face(aShape);
2517 Handle(Geom_Surface) S = BRep_Tool::Surface(F);
2519 int nb = aNbNodes[0];
2520 int nr = aNbNodes[1];
2521 int nt = aNbNodes[2];
2522 int nl = aNbNodes[3];
2523 int dh = abs(nb-nt);
2524 int dv = abs(nr-nl);
2528 // it is a base case => not shift
2531 // we have to shift on 2
2540 // we have to shift quad on 1
2547 // we have to shift quad on 3
2557 int nbh = Max(nb,nt);
2558 int nbv = Max(nr,nl);
2573 // add some params to right and left after the first param
2580 int nnn = Min(nr,nl);
2585 // step1: create faces for left domain
2587 nbNodes += dl*(nl-1);
2588 nbFaces += dl*(nl-1);
2590 // step2: create faces for right domain
2592 nbNodes += dr*(nr-1);
2593 nbFaces += dr*(nr-1);
2595 // step3: create faces for central domain
2596 nbNodes += (nb-2)*(nnn-1) + (nbv-nnn-1)*(nb-2);
2597 nbFaces += (nb-1)*(nbv-1);
2599 else { // New version (!OldVersion)
2600 nbNodes += (nnn-2)*(nb-2);
2601 nbFaces += (nnn-2)*(nb-1);
2602 int drl = abs(nr-nl);
2603 nbNodes += drl*(nb-1) + addv*nb;
2604 nbFaces += (drl+addv)*(nb-1) + (nt-1);
2605 } // end new version implementation
2607 std::vector<int> aVec(SMDSEntity_Last);
2608 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aVec[i] = 0;
2610 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces;
2611 aVec[SMDSEntity_Node] = nbNodes + nbFaces*4;
2612 if (aNbNodes.size()==5) {
2613 aVec[SMDSEntity_Quad_Triangle] = aNbNodes[3] - 1;
2614 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces - aNbNodes[3] + 1;
2618 aVec[SMDSEntity_Node] = nbNodes;
2619 aVec[SMDSEntity_Quadrangle] = nbFaces;
2620 if (aNbNodes.size()==5) {
2621 aVec[SMDSEntity_Triangle] = aNbNodes[3] - 1;
2622 aVec[SMDSEntity_Quadrangle] = nbFaces - aNbNodes[3] + 1;
2625 SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
2626 aResMap.insert(std::make_pair(sm,aVec));
2631 //=============================================================================
2632 /*! Split quadrangle in to 2 triangles by smallest diagonal
2635 //=============================================================================
2637 void StdMeshers_Quadrangle_2D::splitQuadFace(SMESHDS_Mesh * theMeshDS,
2639 const SMDS_MeshNode* theNode1,
2640 const SMDS_MeshNode* theNode2,
2641 const SMDS_MeshNode* theNode3,
2642 const SMDS_MeshNode* theNode4)
2644 SMDS_MeshFace* face;
2645 if ( SMESH_TNodeXYZ( theNode1 ).SquareDistance( theNode3 ) >
2646 SMESH_TNodeXYZ( theNode2 ).SquareDistance( theNode4 ) )
2648 face = myHelper->AddFace(theNode2, theNode4 , theNode1);
2649 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2650 face = myHelper->AddFace(theNode2, theNode3, theNode4);
2651 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2655 face = myHelper->AddFace(theNode1, theNode2 ,theNode3);
2656 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2657 face = myHelper->AddFace(theNode1, theNode3, theNode4);
2658 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2664 enum uvPos { UV_A0, UV_A1, UV_A2, UV_A3, UV_B, UV_R, UV_T, UV_L, UV_SIZE };
2666 inline SMDS_MeshNode* makeNode( UVPtStruct & uvPt,
2668 FaceQuadStruct::Ptr& quad,
2670 SMESH_MesherHelper* helper,
2671 Handle(Geom_Surface) S)
2673 const vector<UVPtStruct>& uv_eb = quad->side[QUAD_BOTTOM_SIDE].GetUVPtStruct();
2674 const vector<UVPtStruct>& uv_et = quad->side[QUAD_TOP_SIDE ].GetUVPtStruct();
2675 double rBot = ( uv_eb.size() - 1 ) * uvPt.normParam;
2676 double rTop = ( uv_et.size() - 1 ) * uvPt.normParam;
2677 int iBot = int( rBot );
2678 int iTop = int( rTop );
2679 double xBot = uv_eb[ iBot ].normParam + ( rBot - iBot ) * ( uv_eb[ iBot+1 ].normParam - uv_eb[ iBot ].normParam );
2680 double xTop = uv_et[ iTop ].normParam + ( rTop - iTop ) * ( uv_et[ iTop+1 ].normParam - uv_et[ iTop ].normParam );
2681 double x = xBot + y * ( xTop - xBot );
2683 gp_UV uv = calcUV(/*x,y=*/x, y,
2684 /*a0,...=*/UVs[UV_A0], UVs[UV_A1], UVs[UV_A2], UVs[UV_A3],
2685 /*p0=*/quad->side[QUAD_BOTTOM_SIDE].grid->Value2d( x ).XY(),
2687 /*p2=*/quad->side[QUAD_TOP_SIDE ].grid->Value2d( x ).XY(),
2688 /*p3=*/UVs[ UV_L ]);
2689 gp_Pnt P = S->Value( uv.X(), uv.Y() );
2692 return helper->AddNode(P.X(), P.Y(), P.Z(), 0, uv.X(), uv.Y() );
2695 void reduce42( const vector<UVPtStruct>& curr_base,
2696 vector<UVPtStruct>& next_base,
2698 int & next_base_len,
2699 FaceQuadStruct::Ptr& quad,
2702 SMESH_MesherHelper* helper,
2703 Handle(Geom_Surface)& S)
2705 // add one "HH": nodes a,b,c,d,e and faces 1,2,3,4,5,6
2707 // .-----a-----b i + 1
2718 const SMDS_MeshNode*& Na = next_base[ ++next_base_len ].node;
2720 Na = makeNode( next_base[ next_base_len ], y, quad, UVs, helper, S );
2723 const SMDS_MeshNode*& Nb = next_base[ ++next_base_len ].node;
2725 Nb = makeNode( next_base[ next_base_len ], y, quad, UVs, helper, S );
2728 double u = (curr_base[j + 2].u + next_base[next_base_len - 2].u) / 2.0;
2729 double v = (curr_base[j + 2].v + next_base[next_base_len - 2].v) / 2.0;
2730 gp_Pnt P = S->Value(u,v);
2731 SMDS_MeshNode* Nc = helper->AddNode(P.X(), P.Y(), P.Z(), 0, u, v);
2734 u = (curr_base[j + 2].u + next_base[next_base_len - 1].u) / 2.0;
2735 v = (curr_base[j + 2].v + next_base[next_base_len - 1].v) / 2.0;
2737 SMDS_MeshNode* Nd = helper->AddNode(P.X(), P.Y(), P.Z(), 0, u, v);
2740 u = (curr_base[j + 2].u + next_base[next_base_len].u) / 2.0;
2741 v = (curr_base[j + 2].v + next_base[next_base_len].v) / 2.0;
2743 SMDS_MeshNode* Ne = helper->AddNode(P.X(), P.Y(), P.Z(), 0, u, v);
2746 helper->AddFace(curr_base[j + 0].node,
2747 curr_base[j + 1].node, Nc,
2748 next_base[next_base_len - 2].node);
2750 helper->AddFace(curr_base[j + 1].node,
2751 curr_base[j + 2].node, Nd, Nc);
2753 helper->AddFace(curr_base[j + 2].node,
2754 curr_base[j + 3].node, Ne, Nd);
2756 helper->AddFace(curr_base[j + 3].node,
2757 curr_base[j + 4].node, Nb, Ne);
2759 helper->AddFace(Nc, Nd, Na, next_base[next_base_len - 2].node);
2761 helper->AddFace(Nd, Ne, Nb, Na);
2764 void reduce31( const vector<UVPtStruct>& curr_base,
2765 vector<UVPtStruct>& next_base,
2767 int & next_base_len,
2768 FaceQuadStruct::Ptr& quad,
2771 SMESH_MesherHelper* helper,
2772 Handle(Geom_Surface)& S)
2774 // add one "H": nodes b,c,e and faces 1,2,4,5
2776 // .---------b i + 1
2787 const SMDS_MeshNode*& Nb = next_base[ ++next_base_len ].node;
2789 Nb = makeNode( next_base[ next_base_len ], y, quad, UVs, helper, S );
2792 double u1 = (curr_base[ j ].u + next_base[ next_base_len-1 ].u ) / 2.0;
2793 double u2 = (curr_base[ j+3 ].u + next_base[ next_base_len ].u ) / 2.0;
2794 double u3 = (u2 - u1) / 3.0;
2796 double v1 = (curr_base[ j ].v + next_base[ next_base_len-1 ].v ) / 2.0;
2797 double v2 = (curr_base[ j+3 ].v + next_base[ next_base_len ].v ) / 2.0;
2798 double v3 = (v2 - v1) / 3.0;
2802 gp_Pnt P = S->Value(u,v);
2803 SMDS_MeshNode* Nc = helper->AddNode( P.X(), P.Y(), P.Z(), 0, u, v );
2808 SMDS_MeshNode* Ne = helper->AddNode( P.X(), P.Y(), P.Z(), 0, u, v );
2812 helper->AddFace( curr_base[ j + 0 ].node,
2813 curr_base[ j + 1 ].node,
2815 next_base[ next_base_len - 1 ].node);
2817 helper->AddFace( curr_base[ j + 1 ].node,
2818 curr_base[ j + 2 ].node, Ne, Nc);
2820 helper->AddFace( curr_base[ j + 2 ].node,
2821 curr_base[ j + 3 ].node, Nb, Ne);
2823 helper->AddFace(Nc, Ne, Nb,
2824 next_base[ next_base_len - 1 ].node);
2827 typedef void (* PReduceFunction) ( const vector<UVPtStruct>& curr_base,
2828 vector<UVPtStruct>& next_base,
2830 int & next_base_len,
2831 FaceQuadStruct::Ptr & quad,
2834 SMESH_MesherHelper* helper,
2835 Handle(Geom_Surface)& S);
2839 //=======================================================================
2841 * Implementation of Reduced algorithm (meshing with quadrangles only)
2843 //=======================================================================
2845 bool StdMeshers_Quadrangle_2D::computeReduced (SMESH_Mesh & aMesh,
2846 const TopoDS_Face& aFace,
2847 FaceQuadStruct::Ptr quad)
2849 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
2850 Handle(Geom_Surface) S = BRep_Tool::Surface(aFace);
2851 int i,j,geomFaceID = meshDS->ShapeToIndex(aFace);
2853 int nb = quad->side[0].NbPoints(); // bottom
2854 int nr = quad->side[1].NbPoints(); // right
2855 int nt = quad->side[2].NbPoints(); // top
2856 int nl = quad->side[3].NbPoints(); // left
2858 // Simple Reduce 10->8->6->4 (3 steps) Multiple Reduce 10->4 (1 step)
2860 // .-----.-----.-----.-----. .-----.-----.-----.-----.
2861 // | / \ | / \ | | / \ | / \ |
2862 // | / .--.--. \ | | / \ | / \ |
2863 // | / / | \ \ | | / .----.----. \ |
2864 // .---.---.---.---.---.---. | / / \ | / \ \ |
2865 // | / / \ | / \ \ | | / / \ | / \ \ |
2866 // | / / .-.-. \ \ | | / / .---.---. \ \ |
2867 // | / / / | \ \ \ | | / / / \ | / \ \ \ |
2868 // .--.--.--.--.--.--.--.--. | / / / \ | / \ \ \ |
2869 // | / / / \ | / \ \ \ | | / / / .-.-. \ \ \ |
2870 // | / / / .-.-. \ \ \ | | / / / / | \ \ \ \ |
2871 // | / / / / | \ \ \ \ | | / / / / | \ \ \ \ |
2872 // .-.-.-.--.--.--.--.-.-.-. .-.-.-.--.--.--.--.-.-.-.
2874 bool MultipleReduce = false;
2886 else if (nb == nt) {
2887 nr1 = nb; // and == nt
2901 // number of rows and columns
2902 int nrows = nr1 - 1;
2903 int ncol_top = nt1 - 1;
2904 int ncol_bot = nb1 - 1;
2905 // number of rows needed to reduce ncol_bot to ncol_top using simple 3->1 "tree" (see below)
2907 int( ceil( log( double(ncol_bot) / ncol_top) / log( 3.))); // = log x base 3
2908 if ( nrows < nrows_tree31 )
2910 MultipleReduce = true;
2911 error( COMPERR_WARNING,
2912 SMESH_Comment("To use 'Reduced' transition, "
2913 "number of face rows should be at least ")
2914 << nrows_tree31 << ". Actual number of face rows is " << nrows << ". "
2915 "'Quadrangle preference (reversed)' transion has been used.");
2919 if (MultipleReduce) { // == computeQuadPref QUAD_QUADRANGLE_PREF_REVERSED
2920 //==================================================
2921 int dh = abs(nb-nt);
2922 int dv = abs(nr-nl);
2926 // it is a base case => not shift quad but may be replacement is need
2930 // we have to shift quad on 2
2936 // we have to shift quad on 1
2940 // we have to shift quad on 3
2945 nb = quad->side[0].NbPoints();
2946 nr = quad->side[1].NbPoints();
2947 nt = quad->side[2].NbPoints();
2948 nl = quad->side[3].NbPoints();
2951 int nbh = Max(nb,nt);
2952 int nbv = Max(nr,nl);
2965 const vector<UVPtStruct>& uv_eb = quad->side[0].GetUVPtStruct(true,0);
2966 const vector<UVPtStruct>& uv_er = quad->side[1].GetUVPtStruct(false,1);
2967 const vector<UVPtStruct>& uv_et = quad->side[2].GetUVPtStruct(true,1);
2968 const vector<UVPtStruct>& uv_el = quad->side[3].GetUVPtStruct(false,0);
2970 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
2971 return error(COMPERR_BAD_INPUT_MESH);
2973 // arrays for normalized params
2974 TColStd_SequenceOfReal npb, npr, npt, npl;
2975 for (j = 0; j < nb; j++) {
2976 npb.Append(uv_eb[j].normParam);
2978 for (i = 0; i < nr; i++) {
2979 npr.Append(uv_er[i].normParam);
2981 for (j = 0; j < nt; j++) {
2982 npt.Append(uv_et[j].normParam);
2984 for (i = 0; i < nl; i++) {
2985 npl.Append(uv_el[i].normParam);
2989 // orientation of face and 3 main domain for future faces
2995 // left | | | | rigth
3002 // add some params to right and left after the first param
3005 double dpr = (npr.Value(2) - npr.Value(1))/(dr+1);
3006 for (i=1; i<=dr; i++) {
3007 npr.InsertAfter(1,npr.Value(2)-dpr);
3011 dpr = (npl.Value(2) - npl.Value(1))/(dl+1);
3012 for (i=1; i<=dl; i++) {
3013 npl.InsertAfter(1,npl.Value(2)-dpr);
3016 gp_XY a0 (uv_eb.front().u, uv_eb.front().v);
3017 gp_XY a1 (uv_eb.back().u, uv_eb.back().v);
3018 gp_XY a2 (uv_et.back().u, uv_et.back().v);
3019 gp_XY a3 (uv_et.front().u, uv_et.front().v);
3021 int nnn = Min(nr,nl);
3022 // auxilary sequence of XY for creation of nodes
3023 // in the bottom part of central domain
3024 // it's length must be == nbv-nnn-1
3025 TColgp_SequenceOfXY UVL;
3026 TColgp_SequenceOfXY UVR;
3027 //==================================================
3029 // step1: create faces for left domain
3030 StdMeshers_Array2OfNode NodesL(1,dl+1,1,nl);
3032 for (j=1; j<=nl; j++)
3033 NodesL.SetValue(1,j,uv_el[j-1].node);
3036 for (i=1; i<=dl; i++)
3037 NodesL.SetValue(i+1,nl,uv_et[i].node);
3038 // create and add needed nodes
3039 TColgp_SequenceOfXY UVtmp;
3040 for (i=1; i<=dl; i++) {
3041 double x0 = npt.Value(i+1);
3044 double y0 = npl.Value(i+1);
3045 double y1 = npr.Value(i+1);
3046 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
3047 gp_Pnt P = S->Value(UV.X(),UV.Y());
3048 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
3049 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
3050 NodesL.SetValue(i+1,1,N);
3051 if (UVL.Length()<nbv-nnn-1) UVL.Append(UV);
3053 for (j=2; j<nl; j++) {
3054 double y0 = npl.Value(dl+j);
3055 double y1 = npr.Value(dl+j);
3056 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
3057 gp_Pnt P = S->Value(UV.X(),UV.Y());
3058 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
3059 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
3060 NodesL.SetValue(i+1,j,N);
3061 if (i==dl) UVtmp.Append(UV);
3064 for (i=1; i<=UVtmp.Length() && UVL.Length()<nbv-nnn-1; i++) {
3065 UVL.Append(UVtmp.Value(i));
3068 for (i=1; i<=dl; i++) {
3069 for (j=1; j<nl; j++) {
3071 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i+1,j),
3072 NodesL.Value(i+1,j+1), NodesL.Value(i,j+1));
3073 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
3078 // fill UVL using c2d
3079 for (i=1; i<npl.Length() && UVL.Length()<nbv-nnn-1; i++) {
3080 UVL.Append(gp_UV (uv_el[i].u, uv_el[i].v));
3084 // step2: create faces for right domain
3085 StdMeshers_Array2OfNode NodesR(1,dr+1,1,nr);
3087 for (j=1; j<=nr; j++)
3088 NodesR.SetValue(1,j,uv_er[nr-j].node);
3091 for (i=1; i<=dr; i++)
3092 NodesR.SetValue(i+1,1,uv_et[nt-1-i].node);
3093 // create and add needed nodes
3094 TColgp_SequenceOfXY UVtmp;
3095 for (i=1; i<=dr; i++) {
3096 double x0 = npt.Value(nt-i);
3099 double y0 = npl.Value(i+1);
3100 double y1 = npr.Value(i+1);
3101 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
3102 gp_Pnt P = S->Value(UV.X(),UV.Y());
3103 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
3104 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
3105 NodesR.SetValue(i+1,nr,N);
3106 if (UVR.Length()<nbv-nnn-1) UVR.Append(UV);
3108 for (j=2; j<nr; j++) {
3109 double y0 = npl.Value(nbv-j+1);
3110 double y1 = npr.Value(nbv-j+1);
3111 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
3112 gp_Pnt P = S->Value(UV.X(),UV.Y());
3113 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
3114 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
3115 NodesR.SetValue(i+1,j,N);
3116 if (i==dr) UVtmp.Prepend(UV);
3119 for (i=1; i<=UVtmp.Length() && UVR.Length()<nbv-nnn-1; i++) {
3120 UVR.Append(UVtmp.Value(i));
3123 for (i=1; i<=dr; i++) {
3124 for (j=1; j<nr; j++) {
3126 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i+1,j),
3127 NodesR.Value(i+1,j+1), NodesR.Value(i,j+1));
3128 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
3133 // fill UVR using c2d
3134 for (i=1; i<npr.Length() && UVR.Length()<nbv-nnn-1; i++) {
3135 UVR.Append(gp_UV(uv_er[i].u, uv_er[i].v));
3139 // step3: create faces for central domain
3140 StdMeshers_Array2OfNode NodesC(1,nb,1,nbv);
3141 // add first line using NodesL
3142 for (i=1; i<=dl+1; i++)
3143 NodesC.SetValue(1,i,NodesL(i,1));
3144 for (i=2; i<=nl; i++)
3145 NodesC.SetValue(1,dl+i,NodesL(dl+1,i));
3146 // add last line using NodesR
3147 for (i=1; i<=dr+1; i++)
3148 NodesC.SetValue(nb,i,NodesR(i,nr));
3149 for (i=1; i<nr; i++)
3150 NodesC.SetValue(nb,dr+i+1,NodesR(dr+1,nr-i));
3151 // add top nodes (last columns)
3152 for (i=dl+2; i<nbh-dr; i++)
3153 NodesC.SetValue(i-dl,nbv,uv_et[i-1].node);
3154 // add bottom nodes (first columns)
3155 for (i=2; i<nb; i++)
3156 NodesC.SetValue(i,1,uv_eb[i-1].node);
3158 // create and add needed nodes
3159 // add linear layers
3160 for (i=2; i<nb; i++) {
3161 double x0 = npt.Value(dl+i);
3163 for (j=1; j<nnn; j++) {
3164 double y0 = npl.Value(nbv-nnn+j);
3165 double y1 = npr.Value(nbv-nnn+j);
3166 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
3167 gp_Pnt P = S->Value(UV.X(),UV.Y());
3168 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
3169 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
3170 NodesC.SetValue(i,nbv-nnn+j,N);
3173 // add diagonal layers
3174 for (i=1; i<nbv-nnn; i++) {
3175 double du = UVR.Value(i).X() - UVL.Value(i).X();
3176 double dv = UVR.Value(i).Y() - UVL.Value(i).Y();
3177 for (j=2; j<nb; j++) {
3178 double u = UVL.Value(i).X() + du*npb.Value(j);
3179 double v = UVL.Value(i).Y() + dv*npb.Value(j);
3180 gp_Pnt P = S->Value(u,v);
3181 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
3182 meshDS->SetNodeOnFace(N, geomFaceID, u, v);
3183 NodesC.SetValue(j,i+1,N);
3187 for (i=1; i<nb; i++) {
3188 for (j=1; j<nbv; j++) {
3190 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
3191 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
3192 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
3195 } // end Multiple Reduce implementation
3196 else { // Simple Reduce (!MultipleReduce)
3197 //=========================================================
3200 // it is a base case => not shift quad
3201 //shiftQuad(quad,0,true);
3204 // we have to shift quad on 2
3210 // we have to shift quad on 1
3214 // we have to shift quad on 3
3219 nb = quad->side[0].NbPoints();
3220 nr = quad->side[1].NbPoints();
3221 nt = quad->side[2].NbPoints();
3222 nl = quad->side[3].NbPoints();
3224 // number of rows and columns
3225 int nrows = nr - 1; // and also == nl - 1
3226 int ncol_top = nt - 1;
3227 int ncol_bot = nb - 1;
3228 int npair_top = ncol_top / 2;
3229 // maximum number of bottom elements for "linear" simple reduce 4->2
3230 int max_lin42 = ncol_top + npair_top * 2 * nrows;
3231 // maximum number of bottom elements for "linear" simple reduce 3->1
3232 int max_lin31 = ncol_top + ncol_top * 2 * nrows;
3233 // maximum number of bottom elements for "tree" simple reduce 4->2
3235 // number of rows needed to reduce ncol_bot to ncol_top using simple 4->2 "tree"
3236 int nrows_tree42 = int( log( (double)(ncol_bot / ncol_top) )/log((double)2) ); // needed to avoid overflow at pow(2) while computing max_tree42
3237 if (nrows_tree42 < nrows) {
3238 max_tree42 = npair_top * pow(2.0, nrows + 1);
3239 if ( ncol_top > npair_top * 2 ) {
3240 int delta = ncol_bot - max_tree42;
3241 for (int irow = 1; irow < nrows; irow++) {
3242 int nfour = delta / 4;
3245 if (delta <= (ncol_top - npair_top * 2))
3246 max_tree42 = ncol_bot;
3249 // maximum number of bottom elements for "tree" simple reduce 3->1
3250 //int max_tree31 = ncol_top * pow(3.0, nrows);
3251 bool is_lin_31 = false;
3252 bool is_lin_42 = false;
3253 bool is_tree_31 = false;
3254 bool is_tree_42 = false;
3255 int max_lin = max_lin42;
3256 if (ncol_bot > max_lin42) {
3257 if (ncol_bot <= max_lin31) {
3259 max_lin = max_lin31;
3263 // if ncol_bot is a 3*n or not 2*n
3264 if ((ncol_bot/3)*3 == ncol_bot || (ncol_bot/2)*2 != ncol_bot) {
3266 max_lin = max_lin31;
3272 if (ncol_bot > max_lin) { // not "linear"
3273 is_tree_31 = (ncol_bot > max_tree42);
3274 if (ncol_bot <= max_tree42) {
3275 if ((ncol_bot/3)*3 == ncol_bot || (ncol_bot/2)*2 != ncol_bot) {
3284 const vector<UVPtStruct>& uv_eb = quad->side[0].GetUVPtStruct(true,0);
3285 const vector<UVPtStruct>& uv_er = quad->side[1].GetUVPtStruct(false,1);
3286 const vector<UVPtStruct>& uv_et = quad->side[2].GetUVPtStruct(true,1);
3287 const vector<UVPtStruct>& uv_el = quad->side[3].GetUVPtStruct(false,0);
3289 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
3290 return error(COMPERR_BAD_INPUT_MESH);
3292 myHelper->SetElementsOnShape( true );
3294 gp_UV uv[ UV_SIZE ];
3295 uv[ UV_A0 ].SetCoord( uv_eb.front().u, uv_eb.front().v);
3296 uv[ UV_A1 ].SetCoord( uv_eb.back().u, uv_eb.back().v );
3297 uv[ UV_A2 ].SetCoord( uv_et.back().u, uv_et.back().v );
3298 uv[ UV_A3 ].SetCoord( uv_et.front().u, uv_et.front().v);
3300 vector<UVPtStruct> curr_base = uv_eb, next_base;
3302 UVPtStruct nullUVPtStruct; nullUVPtStruct.node = 0;
3304 int curr_base_len = nb;
3305 int next_base_len = 0;
3308 { // ------------------------------------------------------------------
3309 // New algorithm implemented by request of IPAL22856
3310 // "2D quadrangle mesher of reduced type works wrong"
3311 // http://bugtracker.opencascade.com/show_bug.cgi?id=22856
3313 // the algorithm is following: all reduces are centred in horizontal
3314 // direction and are distributed among all rows
3316 if (ncol_bot > max_tree42) {
3320 if ((ncol_top/3)*3 == ncol_top ) {
3328 const int col_top_size = is_lin_42 ? 2 : 1;
3329 const int col_base_size = is_lin_42 ? 4 : 3;
3331 // Compute nb of "columns" (like in "linear" simple reducing) in all rows
3333 vector<int> nb_col_by_row;
3335 int delta_all = nb - nt;
3336 int delta_one_col = nrows * 2;
3337 int nb_col = delta_all / delta_one_col;
3338 int remainder = delta_all - nb_col * delta_one_col;
3339 if (remainder > 0) {
3342 if ( nb_col * col_top_size >= nt ) // == "tree" reducing situation
3344 // top row is full (all elements reduced), add "columns" one by one
3345 // in rows below until all bottom elements are reduced
3346 nb_col = ( nt - 1 ) / col_top_size;
3347 nb_col_by_row.resize( nrows, nb_col );
3348 int nbrows_not_full = nrows - 1;
3349 int cur_top_size = nt - 1;
3350 remainder = delta_all - nb_col * delta_one_col;
3351 while ( remainder > 0 )
3353 delta_one_col = nbrows_not_full * 2;
3354 int nb_col_add = remainder / delta_one_col;
3355 cur_top_size += 2 * nb_col_by_row[ nbrows_not_full ];
3356 int nb_col_free = cur_top_size / col_top_size - nb_col_by_row[ nbrows_not_full-1 ];
3357 if ( nb_col_add > nb_col_free )
3358 nb_col_add = nb_col_free;
3359 for ( int irow = 0; irow < nbrows_not_full; ++irow )
3360 nb_col_by_row[ irow ] += nb_col_add;
3362 remainder -= nb_col_add * delta_one_col;
3365 else // == "linear" reducing situation
3367 nb_col_by_row.resize( nrows, nb_col );
3369 for ( int irow = remainder / 2; irow < nrows; ++irow )
3370 nb_col_by_row[ irow ]--;
3375 PReduceFunction reduceFunction = & ( is_lin_42 ? reduce42 : reduce31 );
3377 const int reduce_grp_size = is_lin_42 ? 4 : 3;
3379 for (i = 1; i < nr; i++) // layer by layer
3381 nb_col = nb_col_by_row[ i-1 ];
3382 int nb_next = curr_base_len - nb_col * 2;
3383 if (nb_next < nt) nb_next = nt;
3385 const double y = uv_el[ i ].normParam;
3387 if ( i + 1 == nr ) // top
3394 next_base.resize( nb_next, nullUVPtStruct );
3395 next_base.front() = uv_el[i];
3396 next_base.back() = uv_er[i];
3398 // compute normalized param u
3399 double du = 1. / ( nb_next - 1 );
3400 next_base[0].normParam = 0.;
3401 for ( j = 1; j < nb_next; ++j )
3402 next_base[j].normParam = next_base[j-1].normParam + du;
3404 uv[ UV_L ].SetCoord( next_base.front().u, next_base.front().v );
3405 uv[ UV_R ].SetCoord( next_base.back().u, next_base.back().v );
3407 int free_left = ( curr_base_len - 1 - nb_col * col_base_size ) / 2;
3408 int free_middle = curr_base_len - 1 - nb_col * col_base_size - 2 * free_left;
3410 // not reduced left elements
3411 for (j = 0; j < free_left; j++)
3414 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3416 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3418 myHelper->AddFace(curr_base[ j ].node,
3419 curr_base[ j+1 ].node,
3421 next_base[ next_base_len-1 ].node);
3424 for (int icol = 1; icol <= nb_col; icol++)
3427 reduceFunction( curr_base, next_base, j, next_base_len, quad, uv, y, myHelper, S );
3429 j += reduce_grp_size;
3431 // elements in the middle of "columns" added for symmetry
3432 if ( free_middle > 0 && ( nb_col % 2 == 0 ) && icol == nb_col / 2 )
3434 for (int imiddle = 1; imiddle <= free_middle; imiddle++) {
3435 // f (i + 1, j + imiddle)
3436 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3438 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3440 myHelper->AddFace(curr_base[ j-1+imiddle ].node,
3441 curr_base[ j +imiddle ].node,
3443 next_base[ next_base_len-1 ].node);
3449 // not reduced right elements
3450 for (; j < curr_base_len-1; j++) {
3452 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3454 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3456 myHelper->AddFace(curr_base[ j ].node,
3457 curr_base[ j+1 ].node,
3459 next_base[ next_base_len-1 ].node);
3462 curr_base_len = next_base_len + 1;
3464 curr_base.swap( next_base );
3468 else if ( is_tree_42 || is_tree_31 )
3470 // "tree" simple reduce "42": 2->4->8->16->32->...
3472 // .-------------------------------.-------------------------------. nr
3474 // | \ .---------------.---------------. / |
3476 // .---------------.---------------.---------------.---------------.
3477 // | \ | / | \ | / |
3478 // | \ .-------.-------. / | \ .-------.-------. / |
3479 // | | | | | | | | |
3480 // .-------.-------.-------.-------.-------.-------.-------.-------. i
3481 // |\ | /|\ | /|\ | /|\ | /|
3482 // | \.---.---./ | \.---.---./ | \.---.---./ | \.---.---./ |
3483 // | | | | | | | | | | | | | | | | |
3484 // .---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.
3485 // |\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|
3486 // | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. |
3487 // | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
3488 // .-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-. 1
3491 // "tree" simple reduce "31": 1->3->9->27->...
3493 // .-----------------------------------------------------. nr
3495 // | .-----------------. |
3497 // .-----------------.-----------------.-----------------.
3498 // | \ / | \ / | \ / |
3499 // | .-----. | .-----. | .-----. | i
3500 // | | | | | | | | | |
3501 // .-----.-----.-----.-----.-----.-----.-----.-----.-----.
3502 // |\ /|\ /|\ /|\ /|\ /|\ /|\ /|\ /|\ /|
3503 // | .-. | .-. | .-. | .-. | .-. | .-. | .-. | .-. | .-. |
3504 // | | | | | | | | | | | | | | | | | | | | | | | | | | | |
3505 // .-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-. 1
3508 PReduceFunction reduceFunction = & ( is_tree_42 ? reduce42 : reduce31 );
3510 const int reduce_grp_size = is_tree_42 ? 4 : 3;
3512 for (i = 1; i < nr; i++) // layer by layer
3514 // to stop reducing, if number of nodes reaches nt
3515 int delta = curr_base_len - nt;
3517 // to calculate normalized parameter, we must know number of points in next layer
3518 int nb_reduce_groups = (curr_base_len - 1) / reduce_grp_size;
3519 int nb_next = nb_reduce_groups * (reduce_grp_size-2) + (curr_base_len - nb_reduce_groups*reduce_grp_size);
3520 if (nb_next < nt) nb_next = nt;
3522 const double y = uv_el[ i ].normParam;
3524 if ( i + 1 == nr ) // top
3531 next_base.resize( nb_next, nullUVPtStruct );
3532 next_base.front() = uv_el[i];
3533 next_base.back() = uv_er[i];
3535 // compute normalized param u
3536 double du = 1. / ( nb_next - 1 );
3537 next_base[0].normParam = 0.;
3538 for ( j = 1; j < nb_next; ++j )
3539 next_base[j].normParam = next_base[j-1].normParam + du;
3541 uv[ UV_L ].SetCoord( next_base.front().u, next_base.front().v );
3542 uv[ UV_R ].SetCoord( next_base.back().u, next_base.back().v );
3544 for (j = 0; j+reduce_grp_size < curr_base_len && delta > 0; j+=reduce_grp_size, delta-=2)
3546 reduceFunction( curr_base, next_base, j, next_base_len, quad, uv, y, myHelper, S );
3549 // not reduced side elements (if any)
3550 for (; j < curr_base_len-1; j++)
3553 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3555 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3557 myHelper->AddFace(curr_base[ j ].node,
3558 curr_base[ j+1 ].node,
3560 next_base[ next_base_len-1 ].node);
3562 curr_base_len = next_base_len + 1;
3564 curr_base.swap( next_base );
3566 } // end "tree" simple reduce
3568 else if ( is_lin_42 || is_lin_31 ) {
3569 // "linear" simple reduce "31": 2->6->10->14
3571 // .-----------------------------.-----------------------------. nr
3573 // | .---------. | .---------. |
3575 // .---------.---------.---------.---------.---------.---------.
3576 // | / \ / \ | / \ / \ |
3577 // | / .-----. \ | / .-----. \ | i
3578 // | / | | \ | / | | \ |
3579 // .-----.-----.-----.-----.-----.-----.-----.-----.-----.-----.
3580 // | / / \ / \ \ | / / \ / \ \ |
3581 // | / / .-. \ \ | / / .-. \ \ |
3582 // | / / / \ \ \ | / / / \ \ \ |
3583 // .--.----.---.-----.---.-----.-.--.----.---.-----.---.-----.-. 1
3586 // "linear" simple reduce "42": 4->8->12->16
3588 // .---------------.---------------.---------------.---------------. nr
3589 // | \ | / | \ | / |
3590 // | \ .-------.-------. / | \ .-------.-------. / |
3591 // | | | | | | | | |
3592 // .-------.-------.-------.-------.-------.-------.-------.-------.
3593 // | / \ | / \ | / \ | / \ |
3594 // | / \.----.----./ \ | / \.----.----./ \ | i
3595 // | / | | | \ | / | | | \ |
3596 // .-----.----.----.----.----.-----.-----.----.----.----.----.-----.
3597 // | / / \ | / \ \ | / / \ | / \ \ |
3598 // | / / .-.-. \ \ | / / .-.-. \ \ |
3599 // | / / / | \ \ \ | / / / | \ \ \ |
3600 // .---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.---. 1
3603 // nt = 5, nb = 7, nr = 4
3604 //int delta_all = 2;
3605 //int delta_one_col = 6;
3607 //int remainder = 2;
3608 //if (remainder > 0) nb_col++;
3610 //int free_left = 1;
3612 //int free_middle = 4;
3614 int delta_all = nb - nt;
3615 int delta_one_col = (nr - 1) * 2;
3616 int nb_col = delta_all / delta_one_col;
3617 int remainder = delta_all - nb_col * delta_one_col;
3618 if (remainder > 0) {
3621 const int col_top_size = is_lin_42 ? 2 : 1;
3622 int free_left = ((nt - 1) - nb_col * col_top_size) / 2;
3623 free_left += nr - 2;
3624 int free_middle = (nr - 2) * 2;
3625 if (remainder > 0 && nb_col == 1) {
3626 int nb_rows_short_col = remainder / 2;
3627 int nb_rows_thrown = (nr - 1) - nb_rows_short_col;
3628 free_left -= nb_rows_thrown;
3631 // nt = 5, nb = 17, nr = 4
3632 //int delta_all = 12;
3633 //int delta_one_col = 6;
3635 //int remainder = 0;
3636 //int free_left = 2;
3637 //int free_middle = 4;
3639 PReduceFunction reduceFunction = & ( is_lin_42 ? reduce42 : reduce31 );
3641 const int reduce_grp_size = is_lin_42 ? 4 : 3;
3643 for (i = 1; i < nr; i++, free_middle -= 2, free_left -= 1) // layer by layer
3645 // to calculate normalized parameter, we must know number of points in next layer
3646 int nb_next = curr_base_len - nb_col * 2;
3647 if (remainder > 0 && i > remainder / 2)
3648 // take into account short "column"
3650 if (nb_next < nt) nb_next = nt;
3652 const double y = uv_el[ i ].normParam;
3654 if ( i + 1 == nr ) // top
3661 next_base.resize( nb_next, nullUVPtStruct );
3662 next_base.front() = uv_el[i];
3663 next_base.back() = uv_er[i];
3665 // compute normalized param u
3666 double du = 1. / ( nb_next - 1 );
3667 next_base[0].normParam = 0.;
3668 for ( j = 1; j < nb_next; ++j )
3669 next_base[j].normParam = next_base[j-1].normParam + du;
3671 uv[ UV_L ].SetCoord( next_base.front().u, next_base.front().v );
3672 uv[ UV_R ].SetCoord( next_base.back().u, next_base.back().v );
3674 // not reduced left elements
3675 for (j = 0; j < free_left; j++)
3678 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3680 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3682 myHelper->AddFace(curr_base[ j ].node,
3683 curr_base[ j+1 ].node,
3685 next_base[ next_base_len-1 ].node);
3688 for (int icol = 1; icol <= nb_col; icol++) {
3690 if (remainder > 0 && icol == nb_col && i > remainder / 2)
3691 // stop short "column"
3695 reduceFunction( curr_base, next_base, j, next_base_len, quad, uv, y, myHelper, S );
3697 j += reduce_grp_size;
3699 // not reduced middle elements
3700 if (icol < nb_col) {
3701 if (remainder > 0 && icol == nb_col - 1 && i > remainder / 2)
3702 // pass middle elements before stopped short "column"
3705 int free_add = free_middle;
3706 if (remainder > 0 && icol == nb_col - 1)
3707 // next "column" is short
3708 free_add -= (nr - 1) - (remainder / 2);
3710 for (int imiddle = 1; imiddle <= free_add; imiddle++) {
3711 // f (i + 1, j + imiddle)
3712 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3714 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3716 myHelper->AddFace(curr_base[ j-1+imiddle ].node,
3717 curr_base[ j +imiddle ].node,
3719 next_base[ next_base_len-1 ].node);
3725 // not reduced right elements
3726 for (; j < curr_base_len-1; j++) {
3728 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3730 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3732 myHelper->AddFace(curr_base[ j ].node,
3733 curr_base[ j+1 ].node,
3735 next_base[ next_base_len-1 ].node);
3738 curr_base_len = next_base_len + 1;
3740 curr_base.swap( next_base );
3743 } // end "linear" simple reduce
3748 } // end Simple Reduce implementation
3754 //================================================================================
3755 namespace // data for smoothing
3758 // --------------------------------------------------------------------------------
3760 * \brief Structure used to check validity of node position after smoothing.
3761 * It holds two nodes connected to a smoothed node and belonging to
3768 TTriangle( TSmoothNode* n1=0, TSmoothNode* n2=0 ): _n1(n1), _n2(n2) {}
3770 inline bool IsForward( gp_UV uv ) const;
3772 // --------------------------------------------------------------------------------
3774 * \brief Data of a smoothed node
3780 vector< TTriangle > _triangles; // if empty, then node is not movable
3782 // --------------------------------------------------------------------------------
3783 inline bool TTriangle::IsForward( gp_UV uv ) const
3785 gp_Vec2d v1( uv, _n1->_uv ), v2( uv, _n2->_uv );
3789 //================================================================================
3791 * \brief Returns area of a triangle
3793 //================================================================================
3795 double getArea( const gp_UV uv1, const gp_UV uv2, const gp_UV uv3 )
3797 gp_XY v1 = uv1 - uv2, v2 = uv3 - uv2;
3803 //================================================================================
3805 * \brief Set UV of nodes on degenerated VERTEXes in the middle of degenerated EDGE
3807 * WARNING: this method must be called AFTER retrieving UVPtStruct's from quad
3809 //================================================================================
3811 void StdMeshers_Quadrangle_2D::updateDegenUV(FaceQuadStruct::Ptr quad)
3815 // Set UV of nodes on degenerated VERTEXes in the middle of degenerated EDGE
3816 // --------------------------------------------------------------------------
3817 for ( unsigned i = 0; i < quad->side.size(); ++i )
3819 const vector<UVPtStruct>& uvVec = quad->side[i].GetUVPtStruct();
3821 // find which end of the side is on degenerated shape
3823 if ( myHelper->IsDegenShape( uvVec[0].node->getshapeId() ))
3825 else if ( myHelper->IsDegenShape( uvVec.back().node->getshapeId() ))
3826 degenInd = uvVec.size() - 1;
3830 // find another side sharing the degenerated shape
3831 bool isPrev = ( degenInd == 0 );
3832 if ( i >= QUAD_TOP_SIDE )
3834 int i2 = ( isPrev ? ( i + 3 ) : ( i + 1 )) % 4;
3835 const vector<UVPtStruct>& uvVec2 = quad->side[ i2 ].GetUVPtStruct();
3837 if ( uvVec[ degenInd ].node == uvVec2.front().node )
3839 else if ( uvVec[ degenInd ].node == uvVec2.back().node )
3840 degenInd2 = uvVec2.size() - 1;
3842 throw SALOME_Exception( LOCALIZED( "Logical error" ));
3844 // move UV in the middle
3845 uvPtStruct& uv1 = const_cast<uvPtStruct&>( uvVec [ degenInd ]);
3846 uvPtStruct& uv2 = const_cast<uvPtStruct&>( uvVec2[ degenInd2 ]);
3847 uv1.u = uv2.u = 0.5 * ( uv1.u + uv2.u );
3848 uv1.v = uv2.v = 0.5 * ( uv1.v + uv2.v );
3851 else if ( quad->side.size() == 4 && myQuadType == QUAD_STANDARD)
3853 // Set number of nodes on a degenerated side to be same as on an opposite side
3854 // ----------------------------------------------------------------------------
3855 for ( unsigned i = 0; i < quad->side.size(); ++i )
3857 StdMeshers_FaceSidePtr degSide = quad->side[i];
3858 if ( !myHelper->IsDegenShape( degSide->EdgeID(0) ))
3860 StdMeshers_FaceSidePtr oppSide = quad->side[( i+2 ) % quad->side.size() ];
3861 if ( degSide->NbSegments() == oppSide->NbSegments() )
3864 // make new side data
3865 const vector<UVPtStruct>& uvVecDegOld = degSide->GetUVPtStruct();
3866 const SMDS_MeshNode* n = uvVecDegOld[0].node;
3867 Handle(Geom2d_Curve) c2d = degSide->Curve2d(0);
3868 double f = degSide->FirstU(0), l = degSide->LastU(0);
3869 gp_Pnt2d p1 = uvVecDegOld.front().UV();
3870 gp_Pnt2d p2 = uvVecDegOld.back().UV();
3872 quad->side[i] = StdMeshers_FaceSide::New( oppSide.get(), n, &p1, &p2, c2d, f, l );
3876 //================================================================================
3878 * \brief Perform smoothing of 2D elements on a FACE with ignored degenerated EDGE
3880 //================================================================================
3882 void StdMeshers_Quadrangle_2D::smooth (FaceQuadStruct::Ptr quad)
3884 if ( !myNeedSmooth ) return;
3886 // Get nodes to smooth
3888 // TODO: do not smooth fixed nodes
3890 typedef map< const SMDS_MeshNode*, TSmoothNode, TIDCompare > TNo2SmooNoMap;
3891 TNo2SmooNoMap smooNoMap;
3893 const TopoDS_Face& geomFace = TopoDS::Face( myHelper->GetSubShape() );
3894 Handle(Geom_Surface) surface = BRep_Tool::Surface( geomFace );
3895 double U1, U2, V1, V2;
3896 surface->Bounds(U1, U2, V1, V2);
3897 GeomAPI_ProjectPointOnSurf proj;
3898 proj.Init( surface, U1, U2, V1, V2, BRep_Tool::Tolerance( geomFace ) );
3900 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
3901 SMESHDS_SubMesh* fSubMesh = meshDS->MeshElements( geomFace );
3902 SMDS_NodeIteratorPtr nIt = fSubMesh->GetNodes();
3903 while ( nIt->more() ) // loop on nodes bound to a FACE
3905 const SMDS_MeshNode* node = nIt->next();
3906 TSmoothNode & sNode = smooNoMap[ node ];
3907 sNode._uv = myHelper->GetNodeUV( geomFace, node );
3908 sNode._xyz = SMESH_TNodeXYZ( node );
3910 // set sNode._triangles
3911 SMDS_ElemIteratorPtr fIt = node->GetInverseElementIterator( SMDSAbs_Face );
3912 while ( fIt->more() )
3914 const SMDS_MeshElement* face = fIt->next();
3915 const int nbN = face->NbCornerNodes();
3916 const int nInd = face->GetNodeIndex( node );
3917 const int prevInd = myHelper->WrapIndex( nInd - 1, nbN );
3918 const int nextInd = myHelper->WrapIndex( nInd + 1, nbN );
3919 const SMDS_MeshNode* prevNode = face->GetNode( prevInd );
3920 const SMDS_MeshNode* nextNode = face->GetNode( nextInd );
3921 sNode._triangles.push_back( TTriangle( & smooNoMap[ prevNode ],
3922 & smooNoMap[ nextNode ]));
3925 // set _uv of smooth nodes on FACE boundary
3926 for ( unsigned i = 0; i < quad->side.size(); ++i )
3928 const vector<UVPtStruct>& uvVec = quad->side[i].GetUVPtStruct();
3929 for ( unsigned j = 0; j < uvVec.size(); ++j )
3931 TSmoothNode & sNode = smooNoMap[ uvVec[j].node ];
3932 sNode._uv = uvVec[j].UV();
3933 sNode._xyz = SMESH_TNodeXYZ( uvVec[j].node );
3937 // define refernce orientation in 2D
3938 TNo2SmooNoMap::iterator n2sn = smooNoMap.begin();
3939 for ( ; n2sn != smooNoMap.end(); ++n2sn )
3940 if ( !n2sn->second._triangles.empty() )
3942 if ( n2sn == smooNoMap.end() ) return;
3943 const TSmoothNode & sampleNode = n2sn->second;
3944 const bool refForward = ( sampleNode._triangles[0].IsForward( sampleNode._uv ));
3948 for ( int iLoop = 0; iLoop < 5; ++iLoop )
3950 for ( n2sn = smooNoMap.begin(); n2sn != smooNoMap.end(); ++n2sn )
3952 TSmoothNode& sNode = n2sn->second;
3953 if ( sNode._triangles.empty() )
3954 continue; // not movable node
3957 bool isValid = false;
3958 bool use3D = ( iLoop > 2 ); // 3 loops in 2D and 2, in 3D
3962 // compute a new XYZ
3963 gp_XYZ newXYZ (0,0,0);
3964 for ( unsigned i = 0; i < sNode._triangles.size(); ++i )
3965 newXYZ += sNode._triangles[i]._n1->_xyz;
3966 newXYZ /= sNode._triangles.size();
3968 // compute a new UV by projection
3969 proj.Perform( newXYZ );
3970 isValid = ( proj.IsDone() && proj.NbPoints() > 0 );
3973 // check validity of the newUV
3974 Quantity_Parameter u,v;
3975 proj.LowerDistanceParameters( u, v );
3976 newUV.SetCoord( u, v );
3977 for ( unsigned i = 0; i < sNode._triangles.size() && isValid; ++i )
3978 isValid = ( sNode._triangles[i].IsForward( newUV ) == refForward );
3983 // compute a new UV by averaging
3984 newUV.SetCoord(0.,0.);
3985 for ( unsigned i = 0; i < sNode._triangles.size(); ++i )
3986 newUV += sNode._triangles[i]._n1->_uv;
3987 newUV /= sNode._triangles.size();
3989 // check validity of the newUV
3991 for ( unsigned i = 0; i < sNode._triangles.size() && isValid; ++i )
3992 isValid = ( sNode._triangles[i].IsForward( newUV ) == refForward );
3997 sNode._xyz = surface->Value( newUV.X(), newUV.Y() ).XYZ();
4002 // Set new XYZ to the smoothed nodes
4004 for ( n2sn = smooNoMap.begin(); n2sn != smooNoMap.end(); ++n2sn )
4006 TSmoothNode& sNode = n2sn->second;
4007 if ( sNode._triangles.empty() )
4008 continue; // not movable node
4010 SMDS_MeshNode* node = const_cast< SMDS_MeshNode*>( n2sn->first );
4011 gp_Pnt xyz = surface->Value( sNode._uv.X(), sNode._uv.Y() );
4012 meshDS->MoveNode( node, xyz.X(), xyz.Y(), xyz.Z() );
4015 node->SetPosition( SMDS_PositionPtr( new SMDS_FacePosition( sNode._uv.X(), sNode._uv.Y() )));
4018 // Move medium nodes in quadratic mesh
4019 if ( _quadraticMesh )
4021 const TLinkNodeMap& links = myHelper->GetTLinkNodeMap();
4022 TLinkNodeMap::const_iterator linkIt = links.begin();
4023 for ( ; linkIt != links.end(); ++linkIt )
4025 const SMESH_TLink& link = linkIt->first;
4026 SMDS_MeshNode* node = const_cast< SMDS_MeshNode*>( linkIt->second );
4028 if ( node->getshapeId() != myHelper->GetSubShapeID() )
4029 continue; // medium node is on EDGE or VERTEX
4031 gp_XY uv1 = myHelper->GetNodeUV( geomFace, link.node1(), node );
4032 gp_XY uv2 = myHelper->GetNodeUV( geomFace, link.node2(), node );
4034 gp_XY uv = myHelper->GetMiddleUV( surface, uv1, uv2 );
4035 node->SetPosition( SMDS_PositionPtr( new SMDS_FacePosition( uv.X(), uv.Y() )));
4037 gp_Pnt xyz = surface->Value( uv.X(), uv.Y() );
4038 meshDS->MoveNode( node, xyz.X(), xyz.Y(), xyz.Z() );
4043 //================================================================================
4045 * \brief Checks validity of generated faces
4047 //================================================================================
4049 bool StdMeshers_Quadrangle_2D::check()
4051 const bool isOK = true;
4052 if ( !myCheckOri || myQuadList.empty() || !myQuadList.front() || !myHelper )
4055 TopoDS_Face geomFace = TopoDS::Face( myHelper->GetSubShape() );
4056 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
4057 SMESHDS_SubMesh* fSubMesh = meshDS->MeshElements( geomFace );
4059 if ( geomFace.Orientation() >= TopAbs_INTERNAL ) geomFace.Orientation( TopAbs_FORWARD );
4061 // Get a reference orientation sign
4066 TSideVector wireVec =
4067 StdMeshers_FaceSide::GetFaceWires( geomFace, *myHelper->GetMesh(), true, err );
4068 StdMeshers_FaceSidePtr wire = wireVec[0];
4070 // find a right angle VERTEX
4072 double maxAngle = -1e100;
4073 for ( int i = 0; i < wire->NbEdges(); ++i )
4075 int iPrev = myHelper->WrapIndex( i-1, wire->NbEdges() );
4076 const TopoDS_Edge& e1 = wire->Edge( iPrev );
4077 const TopoDS_Edge& e2 = wire->Edge( i );
4078 double angle = myHelper->GetAngle( e1, e2, geomFace );
4079 if ( maxAngle < angle && angle < 0.9 * M_PI )
4085 if ( maxAngle < -2*M_PI ) return isOK;
4087 // get a sign of 2D area of a corner face
4089 int iPrev = myHelper->WrapIndex( iVertex-1, wire->NbEdges() );
4090 const TopoDS_Edge& e1 = wire->Edge( iPrev );
4091 const TopoDS_Edge& e2 = wire->Edge( iVertex );
4093 gp_Vec2d v1, v2; gp_Pnt2d p;
4096 bool rev = ( e1.Orientation() == TopAbs_REVERSED );
4097 Handle(Geom2d_Curve) c = BRep_Tool::CurveOnSurface( e1, geomFace, u[0], u[1] );
4098 c->D1( u[ !rev ], p, v1 );
4103 bool rev = ( e2.Orientation() == TopAbs_REVERSED );
4104 Handle(Geom2d_Curve) c = BRep_Tool::CurveOnSurface( e2, geomFace, u[0], u[1] );
4105 c->D1( u[ rev ], p, v2 );
4116 // Look for incorrectly oriented faces
4118 std::list<const SMDS_MeshElement*> badFaces;
4120 const SMDS_MeshNode* nn [ 8 ]; // 8 is just for safety
4122 SMDS_ElemIteratorPtr fIt = fSubMesh->GetElements();
4123 while ( fIt->more() ) // loop on faces bound to a FACE
4125 const SMDS_MeshElement* f = fIt->next();
4127 const int nbN = f->NbCornerNodes();
4128 for ( int i = 0; i < nbN; ++i )
4129 nn[ i ] = f->GetNode( i );
4131 const SMDS_MeshNode* nInFace = 0;
4132 if ( myHelper->HasSeam() )
4133 for ( int i = 0; i < nbN && !nInFace; ++i )
4134 if ( !myHelper->IsSeamShape( nn[i]->getshapeId() ))
4137 for ( int i = 0; i < nbN; ++i )
4138 uv[ i ] = myHelper->GetNodeUV( geomFace, nn[i], nInFace, &toCheckUV );
4143 double sign1 = getArea( uv[0], uv[1], uv[2] );
4144 double sign2 = getArea( uv[0], uv[2], uv[3] );
4145 if ( sign1 * sign2 < 0 )
4147 sign2 = getArea( uv[1], uv[2], uv[3] );
4148 sign1 = getArea( uv[1], uv[3], uv[0] );
4149 if ( sign1 * sign2 < 0 )
4150 continue; // this should not happen
4152 if ( sign1 * okSign < 0 )
4153 badFaces.push_back ( f );
4158 double sign = getArea( uv[0], uv[1], uv[2] );
4159 if ( sign * okSign < 0 )
4160 badFaces.push_back ( f );
4167 if ( !badFaces.empty() )
4169 SMESH_subMesh* fSM = myHelper->GetMesh()->GetSubMesh( geomFace );
4170 SMESH_ComputeErrorPtr& err = fSM->GetComputeError();
4171 err.reset ( new SMESH_ComputeError( COMPERR_ALGO_FAILED,
4172 "Inverted elements generated"));
4173 err->myBadElements.swap( badFaces );
4181 /*//================================================================================
4183 * \brief Finds vertices at the most sharp face corners
4184 * \param [in] theFace - the FACE
4185 * \param [in,out] theWire - the ordered edges of the face. It can be modified to
4186 * have the first VERTEX of the first EDGE in \a vertices
4187 * \param [out] theVertices - the found corner vertices in the order corresponding to
4188 * the order of EDGEs in \a theWire
4189 * \param [out] theNbDegenEdges - nb of degenerated EDGEs in theFace
4190 * \param [in] theConsiderMesh - if \c true, only meshed VERTEXes are considered
4191 * as possible corners
4192 * \return int - number of quad sides found: 0, 3 or 4
4194 //================================================================================
4196 int StdMeshers_Quadrangle_2D::getCorners(const TopoDS_Face& theFace,
4197 SMESH_Mesh & theMesh,
4198 std::list<TopoDS_Edge>& theWire,
4199 std::vector<TopoDS_Vertex>& theVertices,
4200 int & theNbDegenEdges,
4201 const bool theConsiderMesh)
4203 theNbDegenEdges = 0;
4205 SMESH_MesherHelper helper( theMesh );
4207 // sort theVertices by angle
4208 multimap<double, TopoDS_Vertex> vertexByAngle;
4209 TopTools_DataMapOfShapeReal angleByVertex;
4210 TopoDS_Edge prevE = theWire.back();
4211 if ( SMESH_Algo::isDegenerated( prevE ))
4213 list<TopoDS_Edge>::reverse_iterator edge = ++theWire.rbegin();
4214 while ( SMESH_Algo::isDegenerated( *edge ))
4216 if ( edge == theWire.rend() )
4220 list<TopoDS_Edge>::iterator edge = theWire.begin();
4221 for ( ; edge != theWire.end(); ++edge )
4223 if ( SMESH_Algo::isDegenerated( *edge ))
4228 TopoDS_Vertex v = helper.IthVertex( 0, *edge );
4229 if ( !theConsiderMesh || SMESH_Algo::VertexNode( v, helper.GetMeshDS() ))
4231 double angle = SMESH_MesherHelper::GetAngle( prevE, *edge, theFace );
4232 vertexByAngle.insert( make_pair( angle, v ));
4233 angleByVertex.Bind( v, angle );
4238 // find out required nb of corners (3 or 4)
4240 TopoDS_Shape triaVertex = helper.GetMeshDS()->IndexToShape( myTriaVertexID );
4241 if ( !triaVertex.IsNull() &&
4242 triaVertex.ShapeType() == TopAbs_VERTEX &&
4243 helper.IsSubShape( triaVertex, theFace ) &&
4244 ( vertexByAngle.size() != 4 || vertexByAngle.begin()->first < 5 * M_PI/180. ))
4247 triaVertex.Nullify();
4249 // check nb of available corners
4250 if ( nbCorners == 3 )
4252 if ( vertexByAngle.size() < 3 )
4253 return error(COMPERR_BAD_SHAPE,
4254 TComm("Face must have 3 sides but not ") << vertexByAngle.size() );
4258 if ( vertexByAngle.size() == 3 && theNbDegenEdges == 0 )
4260 if ( myTriaVertexID < 1 )
4261 return error(COMPERR_BAD_PARMETERS,
4262 "No Base vertex provided for a trilateral geometrical face");
4264 TComm comment("Invalid Base vertex: ");
4265 comment << myTriaVertexID << " its ID is not among [ ";
4266 multimap<double, TopoDS_Vertex>::iterator a2v = vertexByAngle.begin();
4267 comment << helper.GetMeshDS()->ShapeToIndex( a2v->second ) << ", "; a2v++;
4268 comment << helper.GetMeshDS()->ShapeToIndex( a2v->second ) << ", "; a2v++;
4269 comment << helper.GetMeshDS()->ShapeToIndex( a2v->second ) << " ]";
4270 return error(COMPERR_BAD_PARMETERS, comment );
4272 if ( vertexByAngle.size() + ( theNbDegenEdges > 0 ) < 4 &&
4273 vertexByAngle.size() + theNbDegenEdges != 4 )
4274 return error(COMPERR_BAD_SHAPE,
4275 TComm("Face must have 4 sides but not ") << vertexByAngle.size() );
4278 // put all corner vertices in a map
4279 TopTools_MapOfShape vMap;
4280 if ( nbCorners == 3 )
4281 vMap.Add( triaVertex );
4282 multimap<double, TopoDS_Vertex>::reverse_iterator a2v = vertexByAngle.rbegin();
4283 for ( ; a2v != vertexByAngle.rend() && vMap.Extent() < nbCorners; ++a2v )
4284 vMap.Add( (*a2v).second );
4286 // check if there are possible variations in choosing corners
4287 bool isThereVariants = false;
4288 if ( vertexByAngle.size() > nbCorners )
4290 double lostAngle = a2v->first;
4291 double lastAngle = ( --a2v, a2v->first );
4292 isThereVariants = ( lostAngle * 1.1 >= lastAngle );
4295 myCheckOri = ( vertexByAngle.size() > nbCorners ||
4296 vertexByAngle.begin()->first < 5.* M_PI/180 );
4298 // make theWire begin from a corner vertex or triaVertex
4299 if ( nbCorners == 3 )
4300 while ( !triaVertex.IsSame( ( helper.IthVertex( 0, theWire.front() ))) ||
4301 SMESH_Algo::isDegenerated( theWire.front() ))
4302 theWire.splice( theWire.end(), theWire, theWire.begin() );
4304 while ( !vMap.Contains( helper.IthVertex( 0, theWire.front() )) ||
4305 SMESH_Algo::isDegenerated( theWire.front() ))
4306 theWire.splice( theWire.end(), theWire, theWire.begin() );
4308 // fill the result vector and prepare for its refinement
4309 theVertices.clear();
4310 vector< double > angles;
4311 vector< TopoDS_Edge > edgeVec;
4312 vector< int > cornerInd, nbSeg;
4313 angles.reserve( vertexByAngle.size() );
4314 edgeVec.reserve( vertexByAngle.size() );
4315 nbSeg.reserve( vertexByAngle.size() );
4316 cornerInd.reserve( nbCorners );
4317 for ( edge = theWire.begin(); edge != theWire.end(); ++edge )
4319 if ( SMESH_Algo::isDegenerated( *edge ))
4321 TopoDS_Vertex v = helper.IthVertex( 0, *edge );
4322 bool isCorner = vMap.Contains( v );
4325 theVertices.push_back( v );
4326 cornerInd.push_back( angles.size() );
4328 angles.push_back( angleByVertex.IsBound( v ) ? angleByVertex( v ) : -M_PI );
4329 edgeVec.push_back( *edge );
4330 if ( theConsiderMesh && isThereVariants )
4332 if ( SMESHDS_SubMesh* sm = helper.GetMeshDS()->MeshElements( *edge ))
4333 nbSeg.push_back( sm->NbNodes() + 1 );
4335 nbSeg.push_back( 0 );
4339 // refine the result vector - make sides elual by length if
4340 // there are several equal angles
4341 if ( isThereVariants )
4343 if ( nbCorners == 3 )
4344 angles[0] = 2 * M_PI; // not to move the base triangle VERTEX
4346 set< int > refinedCorners;
4347 for ( size_t iC = 0; iC < cornerInd.size(); ++iC )
4349 int iV = cornerInd[iC];
4350 if ( !refinedCorners.insert( iV ).second )
4352 list< int > equalVertices;
4353 equalVertices.push_back( iV );
4354 int nbC[2] = { 0, 0 };
4355 // find equal angles backward and forward from the iV-th corner vertex
4356 for ( int isFwd = 0; isFwd < 2; ++isFwd )
4358 int dV = isFwd ? +1 : -1;
4359 int iCNext = helper.WrapIndex( iC + dV, cornerInd.size() );
4360 int iVNext = helper.WrapIndex( iV + dV, angles.size() );
4361 while ( iVNext != iV )
4363 bool equal = Abs( angles[iV] - angles[iVNext] ) < 0.1 * angles[iV];
4365 equalVertices.insert( isFwd ? equalVertices.end() : equalVertices.begin(), iVNext );
4366 if ( iVNext == cornerInd[ iCNext ])
4371 refinedCorners.insert( cornerInd[ iCNext ] );
4372 iCNext = helper.WrapIndex( iCNext + dV, cornerInd.size() );
4374 iVNext = helper.WrapIndex( iVNext + dV, angles.size() );
4377 // move corners to make sides equal by length
4378 int nbEqualV = equalVertices.size();
4379 int nbExcessV = nbEqualV - ( 1 + nbC[0] + nbC[1] );
4380 if ( nbExcessV > 0 )
4382 // calculate normalized length of each side enclosed between neighbor equalVertices
4383 vector< double > curLengths;
4384 double totalLen = 0;
4385 vector< int > evVec( equalVertices.begin(), equalVertices.end() );
4387 int iE = cornerInd[ helper.WrapIndex( iC - nbC[0] - 1, cornerInd.size() )];
4388 int iEEnd = cornerInd[ helper.WrapIndex( iC + nbC[1] + 1, cornerInd.size() )];
4389 while ( curLengths.size() < nbEqualV + 1 )
4391 curLengths.push_back( totalLen );
4393 curLengths.back() += SMESH_Algo::EdgeLength( edgeVec[ iE ]);
4394 iE = helper.WrapIndex( iE + 1, edgeVec.size());
4395 if ( iEV < evVec.size() && iE == evVec[ iEV++ ] )
4398 while( iE != iEEnd );
4399 totalLen = curLengths.back();
4401 curLengths.resize( equalVertices.size() );
4402 for ( size_t iS = 0; iS < curLengths.size(); ++iS )
4403 curLengths[ iS ] /= totalLen;
4405 // find equalVertices most close to the ideal sub-division of all sides
4407 int iCorner = helper.WrapIndex( iC - nbC[0], cornerInd.size() );
4408 int nbSides = 2 + nbC[0] + nbC[1];
4409 for ( int iS = 1; iS < nbSides; ++iS, ++iBestEV )
4411 double idealLen = iS / double( nbSides );
4412 double d, bestDist = 1.;
4413 for ( iEV = iBestEV; iEV < curLengths.size(); ++iEV )
4414 if (( d = Abs( idealLen - curLengths[ iEV ])) < bestDist )
4419 if ( iBestEV > iS-1 + nbExcessV )
4420 iBestEV = iS-1 + nbExcessV;
4421 theVertices[ iCorner ] = helper.IthVertex( 0, edgeVec[ evVec[ iBestEV ]]);
4422 iCorner = helper.WrapIndex( iCorner + 1, cornerInd.size() );
4431 //================================================================================
4433 * \brief Constructor of a side of quad
4435 //================================================================================
4437 FaceQuadStruct::Side::Side(StdMeshers_FaceSidePtr theGrid)
4438 : grid(theGrid), nbNodeOut(0), from(0), to(theGrid ? theGrid->NbPoints() : 0 ), di(1)
4442 //=============================================================================
4444 * \brief Constructor of a quad
4446 //=============================================================================
4448 FaceQuadStruct::FaceQuadStruct(const TopoDS_Face& F, const std::string& theName)
4449 : face( F ), name( theName )
4454 //================================================================================
4456 * \brief Fills myForcedPnts
4458 //================================================================================
4460 bool StdMeshers_Quadrangle_2D::getEnforcedUV()
4462 myForcedPnts.clear();
4463 if ( !myParams ) return true; // missing hypothesis
4465 std::vector< TopoDS_Shape > shapes;
4466 std::vector< gp_Pnt > points;
4467 myParams->GetEnforcedNodes( shapes, points );
4469 TopTools_IndexedMapOfShape vMap;
4470 for ( size_t i = 0; i < shapes.size(); ++i )
4471 if ( !shapes[i].IsNull() )
4472 TopExp::MapShapes( shapes[i], TopAbs_VERTEX, vMap );
4474 size_t nbPoints = points.size();
4475 for ( int i = 1; i <= vMap.Extent(); ++i )
4476 points.push_back( BRep_Tool::Pnt( TopoDS::Vertex( vMap( i ))));
4478 // find out if all points must be in the FACE, which is so if
4479 // myParams is a local hypothesis on the FACE being meshed
4480 bool isStrictCheck = false;
4482 SMESH_HypoFilter paramFilter( SMESH_HypoFilter::Is( myParams ));
4483 TopoDS_Shape assignedTo;
4484 if ( myHelper->GetMesh()->GetHypothesis( myHelper->GetSubShape(),
4488 isStrictCheck = ( assignedTo.IsSame( myHelper->GetSubShape() ));
4491 multimap< double, ForcedPoint > sortedFP; // sort points by distance from EDGEs
4493 Standard_Real u1,u2,v1,v2;
4494 const TopoDS_Face& face = TopoDS::Face( myHelper->GetSubShape() );
4495 const double tol = BRep_Tool::Tolerance( face );
4496 Handle(Geom_Surface) surf = BRep_Tool::Surface( face );
4497 surf->Bounds( u1,u2,v1,v2 );
4498 GeomAPI_ProjectPointOnSurf project;
4499 project.Init(surf, u1,u2, v1,v2, tol );
4501 BRepBndLib::Add( face, bbox );
4502 double farTol = 0.01 * sqrt( bbox.SquareExtent() );
4504 for ( size_t iP = 0; iP < points.size(); ++iP )
4506 project.Perform( points[ iP ]);
4507 if ( !project.IsDone() )
4509 if ( isStrictCheck && iP < nbPoints )
4511 (TComm("Projection of an enforced point to the face failed - (")
4512 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4515 if ( project.LowerDistance() > farTol )
4517 if ( isStrictCheck && iP < nbPoints )
4519 (COMPERR_BAD_PARMETERS, TComm("An enforced point is too far from the face, dist = ")
4520 << project.LowerDistance() << " - ("
4521 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4524 Quantity_Parameter u, v;
4525 project.LowerDistanceParameters(u, v);
4526 gp_Pnt2d uv( u, v );
4527 BRepClass_FaceClassifier clsf ( face, uv, tol );
4528 switch ( clsf.State() ) {
4531 double edgeDist = ( Min( Abs( u - u1 ), Abs( u - u2 )) +
4532 Min( Abs( v - v1 ), Abs( v - v2 )));
4535 fp.xyz = points[ iP ].XYZ();
4536 if ( iP >= nbPoints )
4537 fp.vertex = TopoDS::Vertex( vMap( iP - nbPoints + 1 ));
4539 sortedFP.insert( make_pair( edgeDist, fp ));
4544 if ( isStrictCheck && iP < nbPoints )
4546 (COMPERR_BAD_PARMETERS, TComm("An enforced point is out of the face boundary - ")
4547 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4552 if ( isStrictCheck && iP < nbPoints )
4554 (COMPERR_BAD_PARMETERS, TComm("An enforced point is on the face boundary - ")
4555 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4560 if ( isStrictCheck && iP < nbPoints )
4562 (TComm("Classification of an enforced point ralative to the face boundary failed - ")
4563 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4568 multimap< double, ForcedPoint >::iterator d2uv = sortedFP.begin();
4569 for ( ; d2uv != sortedFP.end(); ++d2uv )
4570 myForcedPnts.push_back( (*d2uv).second );
4575 //================================================================================
4577 * \brief Splits quads by adding points of enforced nodes and create nodes on
4578 * the sides shared by quads
4580 //================================================================================
4582 bool StdMeshers_Quadrangle_2D::addEnforcedNodes()
4584 // if ( myForcedPnts.empty() )
4587 // make a map of quads sharing a side
4588 map< StdMeshers_FaceSidePtr, vector< FaceQuadStruct::Ptr > > quadsBySide;
4589 list< FaceQuadStruct::Ptr >::iterator quadIt = myQuadList.begin();
4590 for ( ; quadIt != myQuadList.end(); ++quadIt )
4591 for ( size_t iSide = 0; iSide < (*quadIt)->side.size(); ++iSide )
4593 if ( !setNormalizedGrid( *quadIt ))
4595 quadsBySide[ (*quadIt)->side[iSide] ].push_back( *quadIt );
4598 SMESH_Mesh* mesh = myHelper->GetMesh();
4599 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
4600 const TopoDS_Face& face = TopoDS::Face( myHelper->GetSubShape() );
4601 Handle(Geom_Surface) surf = BRep_Tool::Surface( face );
4603 for ( size_t iFP = 0; iFP < myForcedPnts.size(); ++iFP )
4605 bool isNodeEnforced = false;
4607 // look for a quad enclosing a enforced point
4608 for ( quadIt = myQuadList.begin(); quadIt != myQuadList.end(); ++quadIt )
4610 FaceQuadStruct::Ptr quad = *quadIt;
4611 if ( !setNormalizedGrid( *quadIt ))
4614 if ( !quad->findCell( myForcedPnts[ iFP ], i, j ))
4617 // a grid cell is found, select a node of the cell to move
4618 // to the enforced point to and to split the quad at
4619 multimap< double, pair< int, int > > ijByDist;
4620 for ( int di = 0; di < 2; ++di )
4621 for ( int dj = 0; dj < 2; ++dj )
4623 double dist2 = ( myForcedPnts[ iFP ].uv - quad->UVPt( i+di,j+dj ).UV() ).SquareModulus();
4624 ijByDist.insert( make_pair( dist2, make_pair( di,dj )));
4626 // try all nodes starting from the closest one
4627 set< FaceQuadStruct::Ptr > changedQuads;
4628 multimap< double, pair< int, int > >::iterator d2ij = ijByDist.begin();
4629 for ( ; !isNodeEnforced && d2ij != ijByDist.end(); ++d2ij )
4631 int di = d2ij->second.first;
4632 int dj = d2ij->second.second;
4634 // check if a node is at a side
4636 if ( dj== 0 && j == 0 )
4637 iSide = QUAD_BOTTOM_SIDE;
4638 else if ( dj == 1 && j+2 == quad->jSize )
4639 iSide = QUAD_TOP_SIDE;
4640 else if ( di == 0 && i == 0 )
4641 iSide = QUAD_LEFT_SIDE;
4642 else if ( di == 1 && i+2 == quad->iSize )
4643 iSide = QUAD_RIGHT_SIDE;
4645 if ( iSide > -1 ) // ----- node is at a side
4647 FaceQuadStruct::Side& side = quad->side[ iSide ];
4648 // check if this node can be moved
4649 if ( quadsBySide[ side ].size() < 2 )
4650 continue; // its a face boundary -> can't move the node
4652 int quadNodeIndex = ( iSide % 2 ) ? j : i;
4653 int sideNodeIndex = side.ToSideIndex( quadNodeIndex );
4654 if ( side.IsForced( sideNodeIndex ))
4656 // the node is already moved to another enforced point
4657 isNodeEnforced = quad->isEqual( myForcedPnts[ iFP ], i, j );
4660 // make a node of a side forced
4661 vector<UVPtStruct>& points = (vector<UVPtStruct>&) side.GetUVPtStruct();
4662 points[ sideNodeIndex ].u = myForcedPnts[ iFP ].U();
4663 points[ sideNodeIndex ].v = myForcedPnts[ iFP ].V();
4665 updateSideUV( side, sideNodeIndex, quadsBySide );
4667 // update adjacent sides
4668 set< StdMeshers_FaceSidePtr > updatedSides;
4669 updatedSides.insert( side );
4670 for ( size_t i = 0; i < side.contacts.size(); ++i )
4671 if ( side.contacts[i].point == sideNodeIndex )
4673 const vector< FaceQuadStruct::Ptr >& adjQuads =
4674 quadsBySide[ *side.contacts[i].other_side ];
4675 if ( adjQuads.size() > 1 &&
4676 updatedSides.insert( * side.contacts[i].other_side ).second )
4678 updateSideUV( *side.contacts[i].other_side,
4679 side.contacts[i].other_point,
4682 changedQuads.insert( adjQuads.begin(), adjQuads.end() );
4684 const vector< FaceQuadStruct::Ptr >& adjQuads = quadsBySide[ side ];
4685 changedQuads.insert( adjQuads.begin(), adjQuads.end() );
4687 isNodeEnforced = true;
4689 else // ------------------ node is inside the quad
4693 // make a new side passing through IJ node and split the quad
4694 int indForced, iNewSide;
4695 if ( quad->iSize < quad->jSize ) // split vertically
4697 quad->updateUV( myForcedPnts[ iFP ].uv, i, j, /*isVert=*/true );
4699 iNewSide = splitQuad( quad, i, 0 );
4703 quad->updateUV( myForcedPnts[ iFP ].uv, i, j, /*isVert=*/false );
4705 iNewSide = splitQuad( quad, 0, j );
4707 FaceQuadStruct::Ptr newQuad = myQuadList.back();
4708 FaceQuadStruct::Side& newSide = newQuad->side[ iNewSide ];
4710 newSide.forced_nodes.insert( indForced );
4711 quad->side[( iNewSide+2 ) % 4 ].forced_nodes.insert( indForced );
4713 quadsBySide[ newSide ].push_back( quad );
4714 quadsBySide[ newQuad->side[0] ].push_back( newQuad );
4715 quadsBySide[ newQuad->side[1] ].push_back( newQuad );
4716 quadsBySide[ newQuad->side[2] ].push_back( newQuad );
4717 quadsBySide[ newQuad->side[3] ].push_back( newQuad );
4719 isNodeEnforced = true;
4721 } // end of "node is inside the quad"
4723 } // loop on nodes of the cell
4725 // remove out-of-date uv grid of changedQuads
4726 set< FaceQuadStruct::Ptr >::iterator qIt = changedQuads.begin();
4727 for ( ; qIt != changedQuads.end(); ++qIt )
4728 (*qIt)->uv_grid.clear();
4730 if ( isNodeEnforced )
4735 if ( !isNodeEnforced )
4737 if ( !myForcedPnts[ iFP ].vertex.IsNull() )
4738 return error(TComm("Unable to move any node to vertex #")
4739 <<myHelper->GetMeshDS()->ShapeToIndex( myForcedPnts[ iFP ].vertex ));
4741 return error(TComm("Unable to move any node to point ( ")
4742 << myForcedPnts[iFP].xyz.X() << ", "
4743 << myForcedPnts[iFP].xyz.Y() << ", "
4744 << myForcedPnts[iFP].xyz.Z() << " )");
4747 } // loop on enforced points
4749 // Compute nodes on all sides, where not yet present
4751 for ( quadIt = myQuadList.begin(); quadIt != myQuadList.end(); ++quadIt )
4753 FaceQuadStruct::Ptr quad = *quadIt;
4754 for ( int iSide = 0; iSide < 4; ++iSide )
4756 FaceQuadStruct::Side & side = quad->side[ iSide ];
4757 if ( side.nbNodeOut > 0 )
4758 continue; // emulated side
4759 vector< FaceQuadStruct::Ptr >& quadVec = quadsBySide[ side ];
4760 if ( quadVec.size() <= 1 )
4761 continue; // outer side
4763 bool missedNodesOnSide = false;
4764 const vector<UVPtStruct>& points = side.grid->GetUVPtStruct();
4765 for ( size_t iC = 0; iC < side.contacts.size(); ++iC )
4767 const vector<UVPtStruct>& oGrid = side.contacts[iC].other_side->grid->GetUVPtStruct();
4768 const UVPtStruct& uvPt = points[ side.contacts[iC].point ];
4769 if ( side.contacts[iC].other_point >= oGrid.size() ||
4770 side.contacts[iC].point >= points.size() )
4771 throw SALOME_Exception( "StdMeshers_Quadrangle_2D::addEnforcedNodes(): wrong contact" );
4772 if ( oGrid[ side.contacts[iC].other_point ].node )
4773 (( UVPtStruct& ) uvPt).node = oGrid[ side.contacts[iC].other_point ].node;
4775 for ( size_t iP = 0; iP < points.size(); ++iP )
4776 if ( !points[ iP ].node )
4778 UVPtStruct& uvPnt = ( UVPtStruct& ) points[ iP ];
4779 gp_Pnt P = surf->Value( uvPnt.u, uvPnt.v );
4780 uvPnt.node = meshDS->AddNode(P.X(), P.Y(), P.Z());
4781 meshDS->SetNodeOnFace( uvPnt.node, myHelper->GetSubShapeID(), uvPnt.u, uvPnt.v );
4782 missedNodesOnSide = true;
4784 if ( missedNodesOnSide )
4786 // clear uv_grid where nodes are missing
4787 for ( size_t iQ = 0; iQ < quadVec.size(); ++iQ )
4788 quadVec[ iQ ]->uv_grid.clear();
4796 //================================================================================
4798 * \brief Splits a quad at I or J. Returns an index of a new side in the new quad
4800 //================================================================================
4802 int StdMeshers_Quadrangle_2D::splitQuad(FaceQuadStruct::Ptr quad, int I, int J)
4804 FaceQuadStruct* newQuad = new FaceQuadStruct( quad->face );
4805 myQuadList.push_back( FaceQuadStruct::Ptr( newQuad ));
4807 vector<UVPtStruct> points;
4808 if ( I > 0 && I <= quad->iSize-2 )
4810 points.reserve( quad->jSize );
4811 for ( int jP = 0; jP < quad->jSize; ++jP )
4812 points.push_back( quad->UVPt( I, jP ));
4814 newQuad->side.resize( 4 );
4815 newQuad->side[ QUAD_BOTTOM_SIDE ] = quad->side[ QUAD_BOTTOM_SIDE ];
4816 newQuad->side[ QUAD_RIGHT_SIDE ] = quad->side[ QUAD_RIGHT_SIDE ];
4817 newQuad->side[ QUAD_TOP_SIDE ] = quad->side[ QUAD_TOP_SIDE ];
4818 newQuad->side[ QUAD_LEFT_SIDE ] = StdMeshers_FaceSide::New( points, quad->face );
4820 FaceQuadStruct::Side& newSide = newQuad->side[ QUAD_LEFT_SIDE ];
4821 FaceQuadStruct::Side& newSide2 = quad->side [ QUAD_RIGHT_SIDE ];
4823 quad->side[ QUAD_RIGHT_SIDE ] = newSide;
4825 int iBot = quad->side[ QUAD_BOTTOM_SIDE ].ToSideIndex( I );
4826 int iTop = quad->side[ QUAD_TOP_SIDE ].ToSideIndex( I );
4828 newSide.AddContact ( 0, & quad->side[ QUAD_BOTTOM_SIDE ], iBot );
4829 newSide2.AddContact( 0, & quad->side[ QUAD_BOTTOM_SIDE ], iBot );
4830 newSide.AddContact ( quad->jSize - 1, & quad->side[ QUAD_TOP_SIDE ], iTop );
4831 newSide2.AddContact( quad->jSize - 1, & quad->side[ QUAD_TOP_SIDE ], iTop );
4832 // cout << "Contact: L " << &newSide << " "<< newSide.NbPoints()
4833 // << " R " << &newSide2 << " "<< newSide2.NbPoints()
4834 // << " B " << &quad->side[ QUAD_BOTTOM_SIDE ] << " "<< quad->side[ QUAD_BOTTOM_SIDE].NbPoints()
4835 // << " T " << &quad->side[ QUAD_TOP_SIDE ] << " "<< quad->side[ QUAD_TOP_SIDE].NbPoints()<< endl;
4837 newQuad->side[ QUAD_BOTTOM_SIDE ].from = iBot;
4838 newQuad->side[ QUAD_TOP_SIDE ].from = iTop;
4839 newQuad->name = ( TComm("Right of I=") << I );
4841 quad->side[ QUAD_BOTTOM_SIDE ].to = iBot + 1;
4842 quad->side[ QUAD_TOP_SIDE ].to = iTop + 1;
4843 quad->uv_grid.clear();
4845 return QUAD_LEFT_SIDE;
4847 else if ( J > 0 && J <= quad->jSize-2 ) //// split horizontally, a new quad is below an old one
4849 points.reserve( quad->iSize );
4850 for ( int iP = 0; iP < quad->iSize; ++iP )
4851 points.push_back( quad->UVPt( iP, J ));
4853 newQuad->side.resize( 4 );
4854 newQuad->side[ QUAD_BOTTOM_SIDE ] = quad->side[ QUAD_BOTTOM_SIDE ];
4855 newQuad->side[ QUAD_RIGHT_SIDE ] = quad->side[ QUAD_RIGHT_SIDE ];
4856 newQuad->side[ QUAD_TOP_SIDE ] = StdMeshers_FaceSide::New( points, quad->face );
4857 newQuad->side[ QUAD_LEFT_SIDE ] = quad->side[ QUAD_LEFT_SIDE ];
4859 FaceQuadStruct::Side& newSide = newQuad->side[ QUAD_TOP_SIDE ];
4860 FaceQuadStruct::Side& newSide2 = quad->side [ QUAD_BOTTOM_SIDE ];
4862 quad->side[ QUAD_BOTTOM_SIDE ] = newSide;
4864 int iLft = quad->side[ QUAD_LEFT_SIDE ].ToSideIndex( J );
4865 int iRgt = quad->side[ QUAD_RIGHT_SIDE ].ToSideIndex( J );
4867 newSide.AddContact ( 0, & quad->side[ QUAD_LEFT_SIDE ], iLft );
4868 newSide2.AddContact( 0, & quad->side[ QUAD_LEFT_SIDE ], iLft );
4869 newSide.AddContact ( quad->iSize - 1, & quad->side[ QUAD_RIGHT_SIDE ], iRgt );
4870 newSide2.AddContact( quad->iSize - 1, & quad->side[ QUAD_RIGHT_SIDE ], iRgt );
4871 // cout << "Contact: T " << &newSide << " "<< newSide.NbPoints()
4872 // << " B " << &newSide2 << " "<< newSide2.NbPoints()
4873 // << " L " << &quad->side[ QUAD_LEFT_SIDE ] << " "<< quad->side[ QUAD_LEFT_SIDE].NbPoints()
4874 // << " R " << &quad->side[ QUAD_RIGHT_SIDE ] << " "<< quad->side[ QUAD_RIGHT_SIDE].NbPoints()<< endl;
4876 newQuad->side[ QUAD_RIGHT_SIDE ].to = iRgt+1;
4877 newQuad->side[ QUAD_LEFT_SIDE ].to = iLft+1;
4878 newQuad->name = ( TComm("Below J=") << J );
4880 quad->side[ QUAD_RIGHT_SIDE ].from = iRgt;
4881 quad->side[ QUAD_LEFT_SIDE ].from = iLft;
4882 quad->uv_grid.clear();
4884 return QUAD_TOP_SIDE;
4887 myQuadList.pop_back();
4891 //================================================================================
4893 * \brief Updates UV of a side after moving its node
4895 //================================================================================
4897 void StdMeshers_Quadrangle_2D::updateSideUV( FaceQuadStruct::Side& side,
4899 const TQuadsBySide& quadsBySide,
4904 side.forced_nodes.insert( iForced );
4906 // update parts of the side before and after iForced
4908 set<int>::iterator iIt = side.forced_nodes.upper_bound( iForced );
4909 int iEnd = Min( side.NbPoints()-1, ( iIt == side.forced_nodes.end() ) ? int(1e7) : *iIt );
4910 if ( iForced + 1 < iEnd )
4911 updateSideUV( side, iForced, quadsBySide, &iEnd );
4913 iIt = side.forced_nodes.lower_bound( iForced );
4914 int iBeg = Max( 0, ( iIt == side.forced_nodes.begin() ) ? 0 : *--iIt );
4915 if ( iForced - 1 > iBeg )
4916 updateSideUV( side, iForced, quadsBySide, &iBeg );
4921 const int iFrom = Min ( iForced, *iNext );
4922 const int iTo = Max ( iForced, *iNext ) + 1;
4923 const int sideSize = iTo - iFrom;
4925 vector<UVPtStruct> points[4]; // side points of a temporary quad
4927 // from the quads get grid points adjacent to the side
4928 // to make two sides of a temporary quad
4929 vector< FaceQuadStruct::Ptr > quads = quadsBySide.find( side )->second; // copy!
4930 for ( int is2nd = 0; is2nd < 2; ++is2nd )
4932 points[ is2nd ].reserve( sideSize );
4934 while ( points[is2nd].size() < sideSize )
4936 int iCur = iFrom + points[is2nd].size() - int( !points[is2nd].empty() );
4938 // look for a quad adjacent to iCur-th point of the side
4939 for ( size_t iQ = 0; iQ < quads.size(); ++iQ )
4941 FaceQuadStruct::Ptr q = quads[ iQ ];
4945 for ( iS = 0; iS < q->side.size(); ++iS )
4946 if ( side.grid == q->side[ iS ].grid )
4949 if ( !q->side[ iS ].IsReversed() )
4950 isOut = ( q->side[ iS ].from > iCur || q->side[ iS ].to-1 <= iCur );
4952 isOut = ( q->side[ iS ].to >= iCur || q->side[ iS ].from <= iCur );
4955 if ( !setNormalizedGrid( q ))
4958 // found - copy points
4960 if ( iS % 2 ) // right or left
4962 i = ( iS == QUAD_LEFT_SIDE ) ? 1 : q->iSize-2;
4963 j = q->side[ iS ].ToQuadIndex( iCur );
4965 dj = ( q->side[ iS ].IsReversed() ) ? -1 : +1;
4966 nb = ( q->side[ iS ].IsReversed() ) ? j+1 : q->jSize-j;
4968 else // bottom or top
4970 i = q->side[ iS ].ToQuadIndex( iCur );
4971 j = ( iS == QUAD_BOTTOM_SIDE ) ? 1 : q->jSize-2;
4972 di = ( q->side[ iS ].IsReversed() ) ? -1 : +1;
4974 nb = ( q->side[ iS ].IsReversed() ) ? i+1 : q->iSize-i;
4976 if ( !points[is2nd].empty() )
4978 gp_UV lastUV = points[is2nd].back().UV();
4979 gp_UV quadUV = q->UVPt( i, j ).UV();
4980 if ( ( lastUV - quadUV ).SquareModulus() > 1e-10 )
4981 continue; // quad is on the other side of the side
4982 i += di; j += dj; --nb;
4984 for ( ; nb > 0 ; --nb )
4986 points[ is2nd ].push_back( q->UVPt( i, j ));
4987 if ( points[is2nd].size() >= sideSize )
4991 quads[ iQ ].reset(); // not to use this quad anymore
4993 if ( points[is2nd].size() >= sideSize )
4997 if ( nbLoops++ > quads.size() )
4998 throw SALOME_Exception( "StdMeshers_Quadrangle_2D::updateSideUV() bug: infinite loop" );
5000 } // while ( points[is2nd].size() < sideSize )
5001 } // two loops to fill points[0] and points[1]
5003 // points for other pair of opposite sides of the temporary quad
5005 enum { L,R,B,T }; // side index of points[]
5007 points[B].push_back( points[L].front() );
5008 points[B].push_back( side.GetUVPtStruct()[ iFrom ]);
5009 points[B].push_back( points[R].front() );
5011 points[T].push_back( points[L].back() );
5012 points[T].push_back( side.GetUVPtStruct()[ iTo-1 ]);
5013 points[T].push_back( points[R].back() );
5015 // make the temporary quad
5016 FaceQuadStruct::Ptr tmpQuad
5017 ( new FaceQuadStruct( TopoDS::Face( myHelper->GetSubShape() ), "tmpQuad"));
5018 tmpQuad->side.push_back( StdMeshers_FaceSide::New( points[B] )); // bottom
5019 tmpQuad->side.push_back( StdMeshers_FaceSide::New( points[R] )); // right
5020 tmpQuad->side.push_back( StdMeshers_FaceSide::New( points[T] ));
5021 tmpQuad->side.push_back( StdMeshers_FaceSide::New( points[L] ));
5023 // compute new UV of the side
5024 setNormalizedGrid( tmpQuad );
5025 gp_UV uv = tmpQuad->UVPt(1,0).UV();
5026 tmpQuad->updateUV( uv, 1,0, /*isVertical=*/true );
5028 // update UV of the side
5029 vector<UVPtStruct>& sidePoints = (vector<UVPtStruct>&) side.GetUVPtStruct();
5030 for ( int i = iFrom; i < iTo; ++i )
5032 const uvPtStruct& uvPt = tmpQuad->UVPt( 1, i-iFrom );
5033 sidePoints[ i ].u = uvPt.u;
5034 sidePoints[ i ].v = uvPt.v;
5038 //================================================================================
5040 * \brief Finds indices of a grid quad enclosing the given enforced UV
5042 //================================================================================
5044 bool FaceQuadStruct::findCell( const gp_XY& UV, int & I, int & J )
5046 // setNormalizedGrid() must be called before!
5047 if ( uv_box.IsOut( UV ))
5050 // find an approximate position
5051 double x = 0.5, y = 0.5;
5052 gp_XY t0 = UVPt( iSize - 1, 0 ).UV();
5053 gp_XY t1 = UVPt( 0, jSize - 1 ).UV();
5054 gp_XY t2 = UVPt( 0, 0 ).UV();
5055 SMESH_MeshAlgos::GetBarycentricCoords( UV, t0, t1, t2, x, y );
5056 x = Min( 1., Max( 0., x ));
5057 y = Min( 1., Max( 0., y ));
5059 // precise the position
5060 normPa2IJ( x,y, I,J );
5061 if ( !isNear( UV, I,J ))
5063 // look for the most close IJ by traversing uv_grid in the middle
5064 double dist2, minDist2 = ( UV - UVPt( I,J ).UV() ).SquareModulus();
5065 for ( int isU = 0; isU < 2; ++isU )
5067 int ind1 = isU ? 0 : iSize / 2;
5068 int ind2 = isU ? jSize / 2 : 0;
5069 int di1 = isU ? Max( 2, iSize / 20 ) : 0;
5070 int di2 = isU ? 0 : Max( 2, jSize / 20 );
5071 int i,nb = isU ? iSize / di1 : jSize / di2;
5072 for ( i = 0; i < nb; ++i, ind1 += di1, ind2 += di2 )
5073 if (( dist2 = ( UV - UVPt( ind1,ind2 ).UV() ).SquareModulus() ) < minDist2 )
5077 if ( isNear( UV, I,J ))
5079 minDist2 = ( UV - UVPt( I,J ).UV() ).SquareModulus();
5082 if ( !isNear( UV, I,J, Max( iSize, jSize ) /2 ))
5088 //================================================================================
5090 * \brief Find indices (i,j) of a point in uv_grid by normalized parameters (x,y)
5092 //================================================================================
5094 void FaceQuadStruct::normPa2IJ(double X, double Y, int & I, int & J )
5097 I = Min( int ( iSize * X ), iSize - 2 );
5098 J = Min( int ( jSize * Y ), jSize - 2 );
5104 while ( X <= UVPt( I,J ).x && I != 0 )
5106 while ( X > UVPt( I+1,J ).x && I+2 < iSize )
5108 while ( Y <= UVPt( I,J ).y && J != 0 )
5110 while ( Y > UVPt( I,J+1 ).y && J+2 < jSize )
5112 } while ( oldI != I || oldJ != J );
5115 //================================================================================
5117 * \brief Looks for UV in quads around a given (I,J) and precise (I,J)
5119 //================================================================================
5121 bool FaceQuadStruct::isNear( const gp_XY& UV, int & I, int & J, int nbLoops )
5123 if ( I+1 >= iSize ) I = iSize - 2;
5124 if ( J+1 >= jSize ) J = jSize - 2;
5127 gp_XY uvI, uvJ, uv0, uv1;
5128 for ( int iLoop = 0; iLoop < nbLoops; ++iLoop )
5130 int oldI = I, oldJ = J;
5132 uvI = UVPt( I+1, J ).UV();
5133 uvJ = UVPt( I, J+1 ).UV();
5134 uv0 = UVPt( I, J ).UV();
5135 SMESH_MeshAlgos::GetBarycentricCoords( UV, uvI, uvJ, uv0, bcI, bcJ );
5136 if ( bcI >= 0. && bcJ >= 0. && bcI + bcJ <= 1.)
5139 if ( I > 0 && bcI < 0. ) --I;
5140 if ( I+2 < iSize && bcI > 1. ) ++I;
5141 if ( J > 0 && bcJ < 0. ) --J;
5142 if ( J+2 < jSize && bcJ > 1. ) ++J;
5144 uv1 = UVPt( I+1,J+1).UV();
5145 if ( I != oldI || J != oldJ )
5147 uvI = UVPt( I+1, J ).UV();
5148 uvJ = UVPt( I, J+1 ).UV();
5150 SMESH_MeshAlgos::GetBarycentricCoords( UV, uvI, uvJ, uv1, bcI, bcJ );
5151 if ( bcI >= 0. && bcJ >= 0. && bcI + bcJ <= 1.)
5154 if ( I > 0 && bcI > 1. ) --I;
5155 if ( I+2 < iSize && bcI < 0. ) ++I;
5156 if ( J > 0 && bcJ > 1. ) --J;
5157 if ( J+2 < jSize && bcJ < 0. ) ++J;
5159 if ( I == oldI && J == oldJ )
5162 if ( iLoop+1 == nbLoops )
5164 uvI = UVPt( I+1, J ).UV();
5165 uvJ = UVPt( I, J+1 ).UV();
5166 uv0 = UVPt( I, J ).UV();
5167 SMESH_MeshAlgos::GetBarycentricCoords( UV, uvI, uvJ, uv0, bcI, bcJ );
5168 if ( bcI >= 0. && bcJ >= 0. && bcI + bcJ <= 1.)
5171 uv1 = UVPt( I+1,J+1).UV();
5172 SMESH_MeshAlgos::GetBarycentricCoords( UV, uvI, uvJ, uv1, bcI, bcJ );
5173 if ( bcI >= 0. && bcJ >= 0. && bcI + bcJ <= 1.)
5180 //================================================================================
5182 * \brief Checks if a given UV is equal to a given grid point
5184 //================================================================================
5186 bool FaceQuadStruct::isEqual( const gp_XY& UV, int I, int J )
5188 TopLoc_Location loc;
5189 Handle(Geom_Surface) surf = BRep_Tool::Surface( face, loc );
5190 gp_Pnt p1 = surf->Value( UV.X(), UV.Y() );
5191 gp_Pnt p2 = surf->Value( UVPt( I,J ).u, UVPt( I,J ).v );
5193 double dist2 = 1e100;
5194 for ( int di = -1; di < 2; di += 2 )
5197 if ( i < 0 || i+1 >= iSize ) continue;
5198 for ( int dj = -1; dj < 2; dj += 2 )
5201 if ( j < 0 || j+1 >= jSize ) continue;
5204 p2.SquareDistance( surf->Value( UVPt( i,j ).u, UVPt( i,j ).v )));
5207 double tol2 = dist2 / 1000.;
5208 return p1.SquareDistance( p2 ) < tol2;
5211 //================================================================================
5213 * \brief Recompute UV of grid points around a moved point in one direction
5215 //================================================================================
5217 void FaceQuadStruct::updateUV( const gp_XY& UV, int I, int J, bool isVertical )
5219 UVPt( I, J ).u = UV.X();
5220 UVPt( I, J ).v = UV.Y();
5225 if ( J+1 < jSize-1 )
5227 gp_UV a0 = UVPt( 0, J ).UV();
5228 gp_UV a1 = UVPt( iSize-1, J ).UV();
5229 gp_UV a2 = UVPt( iSize-1, jSize-1 ).UV();
5230 gp_UV a3 = UVPt( 0, jSize-1 ).UV();
5232 gp_UV p0 = UVPt( I, J ).UV();
5233 gp_UV p2 = UVPt( I, jSize-1 ).UV();
5234 const double y0 = UVPt( I, J ).y, dy = 1. - y0;
5235 for (int j = J+1; j < jSize-1; j++)
5237 gp_UV p1 = UVPt( iSize-1, j ).UV();
5238 gp_UV p3 = UVPt( 0, j ).UV();
5240 UVPtStruct& uvPt = UVPt( I, j );
5241 gp_UV uv = calcUV( uvPt.x, ( uvPt.y - y0 ) / dy, a0,a1,a2,a3, p0,p1,p2,p3);
5249 gp_UV a0 = UVPt( 0, 0 ).UV();
5250 gp_UV a1 = UVPt( iSize-1, 0 ).UV();
5251 gp_UV a2 = UVPt( iSize-1, J ).UV();
5252 gp_UV a3 = UVPt( 0, J ).UV();
5254 gp_UV p0 = UVPt( I, 0 ).UV();
5255 gp_UV p2 = UVPt( I, J ).UV();
5256 const double y0 = 0., dy = UVPt( I, J ).y - y0;
5257 for (int j = 1; j < J; j++)
5259 gp_UV p1 = UVPt( iSize-1, j ).UV();
5260 gp_UV p3 = UVPt( 0, j ).UV();
5262 UVPtStruct& uvPt = UVPt( I, j );
5263 gp_UV uv = calcUV( uvPt.x, ( uvPt.y - y0 ) / dy, a0,a1,a2,a3, p0,p1,p2,p3);
5269 else // horizontally
5274 gp_UV a0 = UVPt( 0, 0 ).UV();
5275 gp_UV a1 = UVPt( I, 0 ).UV();
5276 gp_UV a2 = UVPt( I, jSize-1 ).UV();
5277 gp_UV a3 = UVPt( 0, jSize-1 ).UV();
5279 gp_UV p1 = UVPt( I, J ).UV();
5280 gp_UV p3 = UVPt( 0, J ).UV();
5281 const double x0 = 0., dx = UVPt( I, J ).x - x0;
5282 for (int i = 1; i < I; i++)
5284 gp_UV p0 = UVPt( i, 0 ).UV();
5285 gp_UV p2 = UVPt( i, jSize-1 ).UV();
5287 UVPtStruct& uvPt = UVPt( i, J );
5288 gp_UV uv = calcUV(( uvPt.x - x0 ) / dx , uvPt.y, a0,a1,a2,a3, p0,p1,p2,p3);
5294 if ( I+1 < iSize-1 )
5296 gp_UV a0 = UVPt( I, 0 ).UV();
5297 gp_UV a1 = UVPt( iSize-1, 0 ).UV();
5298 gp_UV a2 = UVPt( iSize-1, jSize-1 ).UV();
5299 gp_UV a3 = UVPt( I, jSize-1 ).UV();
5301 gp_UV p1 = UVPt( iSize-1, J ).UV();
5302 gp_UV p3 = UVPt( I, J ).UV();
5303 const double x0 = UVPt( I, J ).x, dx = 1. - x0;
5304 for (int i = I+1; i < iSize-1; i++)
5306 gp_UV p0 = UVPt( i, 0 ).UV();
5307 gp_UV p2 = UVPt( i, jSize-1 ).UV();
5309 UVPtStruct& uvPt = UVPt( i, J );
5310 gp_UV uv = calcUV(( uvPt.x - x0 ) / dx , uvPt.y, a0,a1,a2,a3, p0,p1,p2,p3);
5318 //================================================================================
5320 * \brief Side copying
5322 //================================================================================
5324 FaceQuadStruct::Side& FaceQuadStruct::Side::operator=(const Side& otherSide)
5326 grid = otherSide.grid;
5327 from = otherSide.from;
5330 forced_nodes = otherSide.forced_nodes;
5331 contacts = otherSide.contacts;
5332 nbNodeOut = otherSide.nbNodeOut;
5334 for ( size_t iC = 0; iC < contacts.size(); ++iC )
5336 FaceQuadStruct::Side* oSide = contacts[iC].other_side;
5337 for ( size_t iOC = 0; iOC < oSide->contacts.size(); ++iOC )
5338 if ( oSide->contacts[iOC].other_side == & otherSide )
5340 // cout << "SHIFT old " << &otherSide << " " << otherSide.NbPoints()
5341 // << " -> new " << this << " " << this->NbPoints() << endl;
5342 oSide->contacts[iOC].other_side = this;
5348 //================================================================================
5350 * \brief Converts node index of a quad to node index of this side
5352 //================================================================================
5354 int FaceQuadStruct::Side::ToSideIndex( int quadNodeIndex ) const
5356 return from + di * quadNodeIndex;
5359 //================================================================================
5361 * \brief Converts node index of this side to node index of a quad
5363 //================================================================================
5365 int FaceQuadStruct::Side::ToQuadIndex( int sideNodeIndex ) const
5367 return ( sideNodeIndex - from ) * di;
5370 //================================================================================
5372 * \brief Reverse the side
5374 //================================================================================
5376 bool FaceQuadStruct::Side::Reverse(bool keepGrid)
5384 std::swap( from, to );
5395 //================================================================================
5397 * \brief Checks if a node is enforced
5398 * \param [in] nodeIndex - an index of a node in a size
5399 * \return bool - \c true if the node is forced
5401 //================================================================================
5403 bool FaceQuadStruct::Side::IsForced( int nodeIndex ) const
5405 if ( nodeIndex < 0 || nodeIndex >= grid->NbPoints() )
5406 throw SALOME_Exception( " FaceQuadStruct::Side::IsForced(): wrong index" );
5408 if ( forced_nodes.count( nodeIndex ) )
5411 for ( size_t i = 0; i < this->contacts.size(); ++i )
5412 if ( contacts[ i ].point == nodeIndex &&
5413 contacts[ i ].other_side->forced_nodes.count( contacts[ i ].other_point ))
5419 //================================================================================
5421 * \brief Sets up a contact between this and another side
5423 //================================================================================
5425 void FaceQuadStruct::Side::AddContact( int ip, Side* side, int iop )
5427 if ( ip >= GetUVPtStruct().size() ||
5428 iop >= side->GetUVPtStruct().size() )
5429 throw SALOME_Exception( "FaceQuadStruct::Side::AddContact(): wrong point" );
5431 contacts.resize( contacts.size() + 1 );
5432 Contact& c = contacts.back();
5434 c.other_side = side;
5435 c.other_point = iop;
5438 side->contacts.resize( side->contacts.size() + 1 );
5439 Contact& c = side->contacts.back();
5441 c.other_side = this;
5446 //================================================================================
5448 * \brief Returns a normalized parameter of a point indexed within a quadrangle
5450 //================================================================================
5452 double FaceQuadStruct::Side::Param( int i ) const
5454 const vector<UVPtStruct>& points = GetUVPtStruct();
5455 return (( points[ from + i * di ].normParam - points[ from ].normParam ) /
5456 ( points[ to - 1 * di ].normParam - points[ from ].normParam ));
5459 //================================================================================
5461 * \brief Returns UV by a parameter normalized within a quadrangle
5463 //================================================================================
5465 gp_XY FaceQuadStruct::Side::Value2d( double x ) const
5467 const vector<UVPtStruct>& points = GetUVPtStruct();
5468 double u = ( points[ from ].normParam +
5469 x * ( points[ to-di ].normParam - points[ from ].normParam ));
5470 return grid->Value2d( u ).XY();
5473 //================================================================================
5475 * \brief Returns side length
5477 //================================================================================
5479 double FaceQuadStruct::Side::Length(int theFrom, int theTo) const
5481 if ( IsReversed() != ( theTo < theFrom ))
5482 std::swap( theTo, theFrom );
5484 const vector<UVPtStruct>& points = GetUVPtStruct();
5486 if ( theFrom == theTo && theTo == -1 )
5487 r = Abs( First().normParam -
5488 Last ().normParam );
5489 else if ( IsReversed() )
5490 r = Abs( points[ Max( to, theTo+1 ) ].normParam -
5491 points[ Min( from, theFrom ) ].normParam );
5493 r = Abs( points[ Min( to, theTo-1 ) ].normParam -
5494 points[ Max( from, theFrom ) ].normParam );
5495 return r * grid->Length();