1 // Copyright (C) 2007-2013 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.
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),
94 myQuadType(QUAD_STANDARD),
97 MESSAGE("StdMeshers_Quadrangle_2D::StdMeshers_Quadrangle_2D");
98 _name = "Quadrangle_2D";
99 _shapeType = (1 << TopAbs_FACE);
100 _compatibleHypothesis.push_back("QuadrangleParams");
101 _compatibleHypothesis.push_back("QuadranglePreference");
102 _compatibleHypothesis.push_back("TrianglePreference");
103 _compatibleHypothesis.push_back("ViscousLayers2D");
106 //=============================================================================
110 //=============================================================================
112 StdMeshers_Quadrangle_2D::~StdMeshers_Quadrangle_2D()
114 MESSAGE("StdMeshers_Quadrangle_2D::~StdMeshers_Quadrangle_2D");
117 //=============================================================================
121 //=============================================================================
123 bool StdMeshers_Quadrangle_2D::CheckHypothesis
125 const TopoDS_Shape& aShape,
126 SMESH_Hypothesis::Hypothesis_Status& aStatus)
129 myQuadType = QUAD_STANDARD;
130 myQuadranglePreference = false;
131 myTrianglePreference = false;
132 myHelper = (SMESH_MesherHelper*)NULL;
137 aStatus = SMESH_Hypothesis::HYP_OK;
139 const list <const SMESHDS_Hypothesis * >& hyps =
140 GetUsedHypothesis(aMesh, aShape, false);
141 const SMESHDS_Hypothesis * aHyp = 0;
143 bool isFirstParams = true;
145 // First assigned hypothesis (if any) is processed now
146 if (hyps.size() > 0) {
148 if (strcmp("QuadrangleParams", aHyp->GetName()) == 0)
150 myParams = (const StdMeshers_QuadrangleParams*)aHyp;
151 myTriaVertexID = myParams->GetTriaVertex();
152 myQuadType = myParams->GetQuadType();
153 if (myQuadType == QUAD_QUADRANGLE_PREF ||
154 myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
155 myQuadranglePreference = true;
156 else if (myQuadType == QUAD_TRIANGLE_PREF)
157 myTrianglePreference = true;
159 else if (strcmp("QuadranglePreference", aHyp->GetName()) == 0) {
160 isFirstParams = false;
161 myQuadranglePreference = true;
163 else if (strcmp("TrianglePreference", aHyp->GetName()) == 0){
164 isFirstParams = false;
165 myTrianglePreference = true;
168 isFirstParams = false;
172 // Second(last) assigned hypothesis (if any) is processed now
173 if (hyps.size() > 1) {
176 if (strcmp("QuadranglePreference", aHyp->GetName()) == 0) {
177 myQuadranglePreference = true;
178 myTrianglePreference = false;
179 myQuadType = QUAD_STANDARD;
181 else if (strcmp("TrianglePreference", aHyp->GetName()) == 0){
182 myQuadranglePreference = false;
183 myTrianglePreference = true;
184 myQuadType = QUAD_STANDARD;
188 const StdMeshers_QuadrangleParams* aHyp2 =
189 (const StdMeshers_QuadrangleParams*)aHyp;
190 myTriaVertexID = aHyp2->GetTriaVertex();
192 if (!myQuadranglePreference && !myTrianglePreference) { // priority of hypos
193 myQuadType = aHyp2->GetQuadType();
194 if (myQuadType == QUAD_QUADRANGLE_PREF ||
195 myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
196 myQuadranglePreference = true;
197 else if (myQuadType == QUAD_TRIANGLE_PREF)
198 myTrianglePreference = true;
206 //=============================================================================
210 //=============================================================================
212 bool StdMeshers_Quadrangle_2D::Compute (SMESH_Mesh& aMesh,
213 const TopoDS_Shape& aShape)
215 const TopoDS_Face& F = TopoDS::Face(aShape);
216 aMesh.GetSubMesh( F );
218 // do not initialize my fields before this as StdMeshers_ViscousLayers2D
219 // can call Compute() recursively
220 SMESH_ProxyMesh::Ptr proxyMesh = StdMeshers_ViscousLayers2D::Compute( aMesh, F );
224 myProxyMesh = proxyMesh;
226 SMESH_MesherHelper helper (aMesh);
229 _quadraticMesh = myHelper->IsQuadraticSubMesh(aShape);
230 myNeedSmooth = false;
232 FaceQuadStruct::Ptr quad = CheckNbEdges( aMesh, F, /*considerMesh=*/true );
236 myQuadList.push_back( quad );
238 if ( !getEnforcedUV() )
241 updateDegenUV( quad );
243 int n1 = quad->side[0].NbPoints();
244 int n2 = quad->side[1].NbPoints();
245 int n3 = quad->side[2].NbPoints();
246 int n4 = quad->side[3].NbPoints();
248 enum { NOT_COMPUTED = -1, COMPUTE_FAILED = 0, COMPUTE_OK = 1 };
249 int res = NOT_COMPUTED;
250 if (myQuadranglePreference)
252 int nfull = n1+n2+n3+n4;
253 if ((nfull % 2) == 0 && ((n1 != n3) || (n2 != n4)))
255 // special path genarating only quandrangle faces
256 res = computeQuadPref( aMesh, F, quad );
259 else if (myQuadType == QUAD_REDUCED)
263 int n13tmp = n13/2; n13tmp = n13tmp*2;
264 int n24tmp = n24/2; n24tmp = n24tmp*2;
265 if ((n1 == n3 && n2 != n4 && n24tmp == n24) ||
266 (n2 == n4 && n1 != n3 && n13tmp == n13))
268 res = computeReduced( aMesh, F, quad );
272 if ( n1 != n3 && n2 != n4 )
273 error( COMPERR_WARNING,
274 "To use 'Reduced' transition, "
275 "two opposite sides should have same number of segments, "
276 "but actual number of segments is different on all sides. "
277 "'Standard' transion has been used.");
279 error( COMPERR_WARNING,
280 "To use 'Reduced' transition, "
281 "two opposite sides should have an even difference in number of segments. "
282 "'Standard' transion has been used.");
286 if ( res == NOT_COMPUTED )
288 if ( n1 != n3 || n2 != n4 )
289 res = computeTriangles( aMesh, F, quad );
291 res = computeQuadDominant( aMesh, F );
294 if ( res == COMPUTE_OK && myNeedSmooth )
297 return ( res == COMPUTE_OK );
300 //================================================================================
302 * \brief Compute quadrangles and triangles on the quad
304 //================================================================================
306 bool StdMeshers_Quadrangle_2D::computeTriangles(SMESH_Mesh& aMesh,
307 const TopoDS_Face& aFace,
308 FaceQuadStruct::Ptr quad)
310 int nb = quad->side[0].grid->NbPoints();
311 int nr = quad->side[1].grid->NbPoints();
312 int nt = quad->side[2].grid->NbPoints();
313 int nl = quad->side[3].grid->NbPoints();
315 // rotate the quad to have nbNodeOut sides on TOP [and LEFT]
317 quad->shift( nl > nr ? 3 : 2, true );
319 quad->shift( 1, true );
321 quad->shift( nt > nb ? 0 : 3, true );
323 if ( !setNormalizedGrid( quad ))
326 if ( quad->nbNodeOut( QUAD_TOP_SIDE ))
328 splitQuad( quad, 0, quad->jSize-2 );
330 if ( quad->nbNodeOut( QUAD_BOTTOM_SIDE )) // this should not happen
332 splitQuad( quad, 0, 1 );
334 FaceQuadStruct::Ptr newQuad = myQuadList.back();
335 if ( quad != newQuad ) // split done
338 FaceQuadStruct::Ptr botQuad = // a bottom part
339 ( quad->side[ QUAD_LEFT_SIDE ].from == 0 ) ? quad : newQuad;
340 if ( botQuad->nbNodeOut( QUAD_LEFT_SIDE ) > 0 )
341 botQuad->side[ QUAD_LEFT_SIDE ].to += botQuad->nbNodeOut( QUAD_LEFT_SIDE );
342 else if ( botQuad->nbNodeOut( QUAD_RIGHT_SIDE ) > 0 )
343 botQuad->side[ QUAD_RIGHT_SIDE ].to += botQuad->nbNodeOut( QUAD_RIGHT_SIDE );
345 // make quad be a greatest one
346 if ( quad->side[ QUAD_LEFT_SIDE ].NbPoints() == 2 ||
347 quad->side[ QUAD_RIGHT_SIDE ].NbPoints() == 2 )
349 if ( !setNormalizedGrid( quad ))
353 if ( quad->nbNodeOut( QUAD_RIGHT_SIDE ))
355 splitQuad( quad, quad->iSize-2, 0 );
357 if ( quad->nbNodeOut( QUAD_LEFT_SIDE ))
359 splitQuad( quad, 1, 0 );
362 return computeQuadDominant( aMesh, aFace );
365 //================================================================================
367 * \brief Compute quadrangles and possibly triangles on all quads of myQuadList
369 //================================================================================
371 bool StdMeshers_Quadrangle_2D::computeQuadDominant(SMESH_Mesh& aMesh,
372 const TopoDS_Face& aFace)
374 if ( !addEnforcedNodes() )
377 std::list< FaceQuadStruct::Ptr >::iterator quad = myQuadList.begin();
378 for ( ; quad != myQuadList.end(); ++quad )
379 if ( !computeQuadDominant( aMesh, aFace, *quad ))
385 //================================================================================
387 * \brief Compute quadrangles and possibly triangles
389 //================================================================================
391 bool StdMeshers_Quadrangle_2D::computeQuadDominant(SMESH_Mesh& aMesh,
392 const TopoDS_Face& aFace,
393 FaceQuadStruct::Ptr quad)
395 // --- set normalized grid on unit square in parametric domain
397 if ( !setNormalizedGrid( quad ))
400 // --- create nodes on points, and create quadrangles
402 int nbhoriz = quad->iSize;
403 int nbvertic = quad->jSize;
405 // internal mesh nodes
406 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
407 Handle(Geom_Surface) S = BRep_Tool::Surface(aFace);
408 int i,j, geomFaceID = meshDS->ShapeToIndex(aFace);
409 for (i = 1; i < nbhoriz - 1; i++)
410 for (j = 1; j < nbvertic - 1; j++)
412 UVPtStruct& uvPnt = quad->UVPt( i, j );
413 gp_Pnt P = S->Value( uvPnt.u, uvPnt.v );
414 uvPnt.node = meshDS->AddNode(P.X(), P.Y(), P.Z());
415 meshDS->SetNodeOnFace( uvPnt.node, geomFaceID, uvPnt.u, uvPnt.v );
421 // --.--.--.--.--.-- nbvertic
427 // ---.----.----.--- 0
428 // 0 > > > > > > > > nbhoriz
433 int iup = nbhoriz - 1;
434 if (quad->nbNodeOut(3)) { ilow++; } else { if (quad->nbNodeOut(1)) iup--; }
437 int jup = nbvertic - 1;
438 if (quad->nbNodeOut(0)) { jlow++; } else { if (quad->nbNodeOut(2)) jup--; }
440 // regular quadrangles
441 for (i = ilow; i < iup; i++) {
442 for (j = jlow; j < jup; j++) {
443 const SMDS_MeshNode *a, *b, *c, *d;
444 a = quad->uv_grid[ j * nbhoriz + i ].node;
445 b = quad->uv_grid[ j * nbhoriz + i + 1].node;
446 c = quad->uv_grid[(j + 1) * nbhoriz + i + 1].node;
447 d = quad->uv_grid[(j + 1) * nbhoriz + i ].node;
448 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
450 meshDS->SetMeshElementOnShape(face, geomFaceID);
455 // Boundary elements (must always be on an outer boundary of the FACE)
457 const vector<UVPtStruct>& uv_e0 = quad->side[0].grid->GetUVPtStruct();
458 const vector<UVPtStruct>& uv_e1 = quad->side[1].grid->GetUVPtStruct();
459 const vector<UVPtStruct>& uv_e2 = quad->side[2].grid->GetUVPtStruct();
460 const vector<UVPtStruct>& uv_e3 = quad->side[3].grid->GetUVPtStruct();
462 if (uv_e0.empty() || uv_e1.empty() || uv_e2.empty() || uv_e3.empty())
463 return error(COMPERR_BAD_INPUT_MESH);
465 double eps = Precision::Confusion();
467 int nbdown = (int) uv_e0.size();
468 int nbup = (int) uv_e2.size();
469 int nbright = (int) uv_e1.size();
470 int nbleft = (int) uv_e3.size();
472 if (quad->nbNodeOut(0) && nbvertic == 2) // this should not occure
476 // |___|___|___|___|___|___|
478 // |___|___|___|___|___|___|
480 // |___|___|___|___|___|___| __ first row of the regular grid
481 // . . . . . . . . . __ down edge nodes
483 // >->->->->->->->->->->->-> -- direction of processing
485 int g = 0; // number of last processed node in the regular grid
487 // number of last node of the down edge to be processed
488 int stop = nbdown - 1;
489 // if right edge is out, we will stop at a node, previous to the last one
490 //if (quad->nbNodeOut(1)) stop--;
491 if ( quad->nbNodeOut( QUAD_RIGHT_SIDE ))
492 quad->UVPt( nbhoriz-1, 1 ).node = uv_e1[1].node;
493 if ( quad->nbNodeOut( QUAD_LEFT_SIDE ))
494 quad->UVPt( 0, 1 ).node = uv_e3[1].node;
496 // for each node of the down edge find nearest node
497 // in the first row of the regular grid and link them
498 for (i = 0; i < stop; i++) {
499 const SMDS_MeshNode *a, *b, *c, *d;
501 b = uv_e0[i + 1].node;
502 gp_Pnt pb (b->X(), b->Y(), b->Z());
504 // find node c in the regular grid, which will be linked with node b
507 // right bound reached, link with the rightmost node
509 c = quad->uv_grid[nbhoriz + iup].node;
512 // find in the grid node c, nearest to the b
513 double mind = RealLast();
514 for (int k = g; k <= iup; k++) {
516 const SMDS_MeshNode *nk;
517 if (k < ilow) // this can be, if left edge is out
518 nk = uv_e3[1].node; // get node from the left edge
520 nk = quad->uv_grid[nbhoriz + k].node; // get one of middle nodes
522 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
523 double dist = pb.Distance(pnk);
524 if (dist < mind - eps) {
534 if (near == g) { // make triangle
535 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
536 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
538 else { // make quadrangle
542 d = quad->uv_grid[nbhoriz + near - 1].node;
543 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
545 if (!myTrianglePreference){
546 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
547 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
550 splitQuadFace(meshDS, geomFaceID, a, b, c, d);
553 // if node d is not at position g - make additional triangles
555 for (int k = near - 1; k > g; k--) {
556 c = quad->uv_grid[nbhoriz + k].node;
560 d = quad->uv_grid[nbhoriz + k - 1].node;
561 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
562 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
569 if (quad->nbNodeOut(2) && nbvertic == 2)
573 // <-<-<-<-<-<-<-<-<-<-<-<-< -- direction of processing
575 // . . . . . . . . . __ up edge nodes
576 // ___ ___ ___ ___ ___ ___ __ first row of the regular grid
578 // |___|___|___|___|___|___|
580 // |___|___|___|___|___|___|
583 int g = nbhoriz - 1; // last processed node in the regular grid
589 // if left edge is out, we will stop at a second node
590 //if (quad->nbNodeOut(3)) stop++;
591 if ( quad->nbNodeOut( QUAD_RIGHT_SIDE ))
592 quad->UVPt( nbhoriz-1, 0 ).node = uv_e1[ nbright-2 ].node;
593 if ( quad->nbNodeOut( QUAD_LEFT_SIDE ))
594 quad->UVPt( 0, 0 ).node = uv_e3[ nbleft-2 ].node;
596 // for each node of the up edge find nearest node
597 // in the first row of the regular grid and link them
598 for (i = nbup - 1; i > stop; i--) {
599 const SMDS_MeshNode *a, *b, *c, *d;
601 b = uv_e2[i - 1].node;
602 gp_Pnt pb (b->X(), b->Y(), b->Z());
604 // find node c in the grid, which will be linked with node b
606 if (i == stop + 1) { // left bound reached, link with the leftmost node
607 c = quad->uv_grid[nbhoriz*(nbvertic - 2) + ilow].node;
610 // find node c in the grid, nearest to the b
611 double mind = RealLast();
612 for (int k = g; k >= ilow; k--) {
613 const SMDS_MeshNode *nk;
615 nk = uv_e1[nbright - 2].node;
617 nk = quad->uv_grid[nbhoriz*(nbvertic - 2) + k].node;
618 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
619 double dist = pb.Distance(pnk);
620 if (dist < mind - eps) {
630 if (near == g) { // make triangle
631 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
632 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
634 else { // make quadrangle
636 d = uv_e1[nbright - 2].node;
638 d = quad->uv_grid[nbhoriz*(nbvertic - 2) + near + 1].node;
639 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
640 if (!myTrianglePreference){
641 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
642 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
645 splitQuadFace(meshDS, geomFaceID, a, b, c, d);
648 if (near + 1 < g) { // if d is not at g - make additional triangles
649 for (int k = near + 1; k < g; k++) {
650 c = quad->uv_grid[nbhoriz*(nbvertic - 2) + k].node;
652 d = uv_e1[nbright - 2].node;
654 d = quad->uv_grid[nbhoriz*(nbvertic - 2) + k + 1].node;
655 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
656 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
665 // right or left boundary quadrangles
666 if (quad->nbNodeOut( QUAD_RIGHT_SIDE ) && nbhoriz == 2) // this should not occure
668 int g = 0; // last processed node in the grid
669 int stop = nbright - 1;
671 if (quad->side[ QUAD_RIGHT_SIDE ].from != i ) i++;
672 if (quad->side[ QUAD_RIGHT_SIDE ].to != stop ) stop--;
673 for ( ; i < stop; i++) {
674 const SMDS_MeshNode *a, *b, *c, *d;
676 b = uv_e1[i + 1].node;
677 gp_Pnt pb (b->X(), b->Y(), b->Z());
679 // find node c in the grid, nearest to the b
681 if (i == stop - 1) { // up bondary reached
682 c = quad->uv_grid[nbhoriz*(jup + 1) - 2].node;
685 double mind = RealLast();
686 for (int k = g; k <= jup; k++) {
687 const SMDS_MeshNode *nk;
689 nk = uv_e0[nbdown - 2].node;
691 nk = quad->uv_grid[nbhoriz*(k + 1) - 2].node;
692 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
693 double dist = pb.Distance(pnk);
694 if (dist < mind - eps) {
704 if (near == g) { // make triangle
705 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
706 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
708 else { // make quadrangle
710 d = uv_e0[nbdown - 2].node;
712 d = quad->uv_grid[nbhoriz*near - 2].node;
713 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
715 if (!myTrianglePreference){
716 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
717 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
720 splitQuadFace(meshDS, geomFaceID, a, b, c, d);
723 if (near - 1 > g) { // if d not is at g - make additional triangles
724 for (int k = near - 1; k > g; k--) {
725 c = quad->uv_grid[nbhoriz*(k + 1) - 2].node;
727 d = uv_e0[nbdown - 2].node;
729 d = quad->uv_grid[nbhoriz*k - 2].node;
730 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
731 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
738 if (quad->nbNodeOut(3) && nbhoriz == 2) {
739 // MESSAGE("left edge is out");
740 int g = nbvertic - 1; // last processed node in the grid
742 i = quad->side[ QUAD_LEFT_SIDE ].to-1; // nbleft - 1;
743 for (; i > stop; i--) {
744 const SMDS_MeshNode *a, *b, *c, *d;
746 b = uv_e3[i - 1].node;
747 gp_Pnt pb (b->X(), b->Y(), b->Z());
749 // find node c in the grid, nearest to the b
751 if (i == stop + 1) { // down bondary reached
752 c = quad->uv_grid[nbhoriz*jlow + 1].node;
755 double mind = RealLast();
756 for (int k = g; k >= jlow; k--) {
757 const SMDS_MeshNode *nk;
761 nk = quad->uv_grid[nbhoriz*k + 1].node;
762 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
763 double dist = pb.Distance(pnk);
764 if (dist < mind - eps) {
774 if (near == g) { // make triangle
775 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
776 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
778 else { // make quadrangle
782 d = quad->uv_grid[nbhoriz*(near + 1) + 1].node;
783 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
784 if (!myTrianglePreference){
785 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
786 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
789 splitQuadFace(meshDS, geomFaceID, a, b, c, d);
792 if (near + 1 < g) { // if d not is at g - make additional triangles
793 for (int k = near + 1; k < g; k++) {
794 c = quad->uv_grid[nbhoriz*k + 1].node;
798 d = quad->uv_grid[nbhoriz*(k + 1) + 1].node;
799 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
800 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
814 //=============================================================================
818 //=============================================================================
820 bool StdMeshers_Quadrangle_2D::Evaluate(SMESH_Mesh& aMesh,
821 const TopoDS_Shape& aFace,
822 MapShapeNbElems& aResMap)
825 aMesh.GetSubMesh(aFace);
827 std::vector<int> aNbNodes(4);
828 bool IsQuadratic = false;
829 if (!checkNbEdgesForEvaluate(aMesh, aFace, aResMap, aNbNodes, IsQuadratic)) {
830 std::vector<int> aResVec(SMDSEntity_Last);
831 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
832 SMESH_subMesh * sm = aMesh.GetSubMesh(aFace);
833 aResMap.insert(std::make_pair(sm,aResVec));
834 SMESH_ComputeErrorPtr& smError = sm->GetComputeError();
835 smError.reset(new SMESH_ComputeError(COMPERR_ALGO_FAILED,"Submesh can not be evaluated",this));
839 if (myQuadranglePreference) {
840 int n1 = aNbNodes[0];
841 int n2 = aNbNodes[1];
842 int n3 = aNbNodes[2];
843 int n4 = aNbNodes[3];
844 int nfull = n1+n2+n3+n4;
847 if (nfull==ntmp && ((n1!=n3) || (n2!=n4))) {
848 // special path for using only quandrangle faces
849 return evaluateQuadPref(aMesh, aFace, aNbNodes, aResMap, IsQuadratic);
854 int nbdown = aNbNodes[0];
855 int nbup = aNbNodes[2];
857 int nbright = aNbNodes[1];
858 int nbleft = aNbNodes[3];
860 int nbhoriz = Min(nbdown, nbup);
861 int nbvertic = Min(nbright, nbleft);
863 int dh = Max(nbdown, nbup) - nbhoriz;
864 int dv = Max(nbright, nbleft) - nbvertic;
871 int nbNodes = (nbhoriz-2)*(nbvertic-2);
872 //int nbFaces3 = dh + dv + kdh*(nbvertic-1)*2 + kdv*(nbhoriz-1)*2;
873 int nbFaces3 = dh + dv;
874 //if (kdh==1 && kdv==1) nbFaces3 -= 2;
875 //if (dh>0 && dv>0) nbFaces3 -= 2;
876 //int nbFaces4 = (nbhoriz-1-kdh)*(nbvertic-1-kdv);
877 int nbFaces4 = (nbhoriz-1)*(nbvertic-1);
879 std::vector<int> aVec(SMDSEntity_Last);
880 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aVec[i] = 0;
882 aVec[SMDSEntity_Quad_Triangle] = nbFaces3;
883 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces4;
884 int nbbndedges = nbdown + nbup + nbright + nbleft -4;
885 int nbintedges = (nbFaces4*4 + nbFaces3*3 - nbbndedges) / 2;
886 aVec[SMDSEntity_Node] = nbNodes + nbintedges;
887 if (aNbNodes.size()==5) {
888 aVec[SMDSEntity_Quad_Triangle] = nbFaces3 + aNbNodes[3] -1;
889 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces4 - aNbNodes[3] +1;
893 aVec[SMDSEntity_Node] = nbNodes;
894 aVec[SMDSEntity_Triangle] = nbFaces3;
895 aVec[SMDSEntity_Quadrangle] = nbFaces4;
896 if (aNbNodes.size()==5) {
897 aVec[SMDSEntity_Triangle] = nbFaces3 + aNbNodes[3] - 1;
898 aVec[SMDSEntity_Quadrangle] = nbFaces4 - aNbNodes[3] + 1;
901 SMESH_subMesh * sm = aMesh.GetSubMesh(aFace);
902 aResMap.insert(std::make_pair(sm,aVec));
908 //================================================================================
910 * \brief Return true if only two given edges meat at their common vertex
912 //================================================================================
914 static bool twoEdgesMeatAtVertex(const TopoDS_Edge& e1,
915 const TopoDS_Edge& e2,
919 if (!TopExp::CommonVertex(e1, e2, v))
921 TopTools_ListIteratorOfListOfShape ancestIt(mesh.GetAncestors(v));
922 for (; ancestIt.More() ; ancestIt.Next())
923 if (ancestIt.Value().ShapeType() == TopAbs_EDGE)
924 if (!e1.IsSame(ancestIt.Value()) && !e2.IsSame(ancestIt.Value()))
929 //=============================================================================
933 //=============================================================================
935 FaceQuadStruct::Ptr StdMeshers_Quadrangle_2D::CheckNbEdges(SMESH_Mesh & aMesh,
936 const TopoDS_Shape & aShape,
937 const bool considerMesh)
939 if ( !myQuadList.empty() && myQuadList.front()->face.IsSame( aShape ))
940 return myQuadList.front();
942 TopoDS_Face F = TopoDS::Face(aShape);
943 if ( F.Orientation() >= TopAbs_INTERNAL ) F.Orientation( TopAbs_FORWARD );
944 const bool ignoreMediumNodes = _quadraticMesh;
946 // verify 1 wire only, with 4 edges
947 list< TopoDS_Edge > edges;
948 list< int > nbEdgesInWire;
949 int nbWire = SMESH_Block::GetOrderedEdges (F, edges, nbEdgesInWire);
951 error(COMPERR_BAD_SHAPE, TComm("Wrong number of wires: ") << nbWire);
952 return FaceQuadStruct::Ptr();
955 // find corner vertices of the quad
956 vector<TopoDS_Vertex> corners;
957 int nbDegenEdges, nbSides = getCorners( F, aMesh, edges, corners, nbDegenEdges, considerMesh );
960 return FaceQuadStruct::Ptr();
962 FaceQuadStruct::Ptr quad( new FaceQuadStruct );
963 quad->side.reserve(nbEdgesInWire.front());
966 list< TopoDS_Edge >::iterator edgeIt = edges.begin();
967 if ( nbSides == 3 ) // 3 sides and corners[0] is a vertex with myTriaVertexID
969 for ( int iSide = 0; iSide < 3; ++iSide )
971 list< TopoDS_Edge > sideEdges;
972 TopoDS_Vertex nextSideV = corners[( iSide + 1 ) % 3 ];
973 while ( edgeIt != edges.end() &&
974 !nextSideV.IsSame( SMESH_MesherHelper::IthVertex( 0, *edgeIt )))
975 if ( SMESH_Algo::isDegenerated( *edgeIt ))
978 sideEdges.push_back( *edgeIt++ );
979 if ( !sideEdges.empty() )
980 quad->side.push_back( StdMeshers_FaceSide::New(F, sideEdges, &aMesh, iSide < QUAD_TOP_SIDE,
981 ignoreMediumNodes, myProxyMesh));
985 const vector<UVPtStruct>& UVPSleft = quad->side[0].GetUVPtStruct(true,0);
986 /* vector<UVPtStruct>& UVPStop = */quad->side[1].GetUVPtStruct(false,1);
987 /* vector<UVPtStruct>& UVPSright = */quad->side[2].GetUVPtStruct(true,1);
988 const SMDS_MeshNode* aNode = UVPSleft[0].node;
989 gp_Pnt2d aPnt2d = UVPSleft[0].UV();
990 quad->side.push_back( StdMeshers_FaceSide::New( quad->side[1].grid.get(), aNode, &aPnt2d ));
991 myNeedSmooth = ( nbDegenEdges > 0 );
996 myNeedSmooth = ( corners.size() == 4 && nbDegenEdges > 0 );
997 int iSide = 0, nbUsedDegen = 0, nbLoops = 0;
998 for ( ; edgeIt != edges.end(); ++nbLoops )
1000 list< TopoDS_Edge > sideEdges;
1001 TopoDS_Vertex nextSideV = corners[( iSide + 1 - nbUsedDegen ) % corners.size() ];
1002 while ( edgeIt != edges.end() &&
1003 !nextSideV.IsSame( myHelper->IthVertex( 0, *edgeIt )))
1005 if ( SMESH_Algo::isDegenerated( *edgeIt ) )
1009 ++edgeIt; // no side on the degenerated EDGE
1013 if ( sideEdges.empty() )
1016 sideEdges.push_back( *edgeIt++ ); // a degenerated side
1021 break; // do not append a degenerated EDGE to a regular side
1027 sideEdges.push_back( *edgeIt++ );
1030 if ( !sideEdges.empty() )
1032 quad->side.push_back( StdMeshers_FaceSide::New( F, sideEdges, &aMesh, iSide < QUAD_TOP_SIDE,
1033 ignoreMediumNodes, myProxyMesh ));
1036 else if ( !SMESH_Algo::isDegenerated( *edgeIt ) && // closed EDGE
1037 myHelper->IthVertex( 0, *edgeIt ).IsSame( myHelper->IthVertex( 1, *edgeIt )))
1039 quad->side.push_back( StdMeshers_FaceSide::New( F, *edgeIt++, &aMesh, iSide < QUAD_TOP_SIDE,
1040 ignoreMediumNodes, myProxyMesh));
1043 if ( quad->side.size() == 4 )
1047 error(TComm("Bug: infinite loop in StdMeshers_Quadrangle_2D::CheckNbEdges()"));
1052 if ( quad && quad->side.size() != 4 )
1054 error(TComm("Bug: ") << quad->side.size() << " sides found instead of 4");
1063 //=============================================================================
1067 //=============================================================================
1069 bool StdMeshers_Quadrangle_2D::checkNbEdgesForEvaluate(SMESH_Mesh& aMesh,
1070 const TopoDS_Shape & aShape,
1071 MapShapeNbElems& aResMap,
1072 std::vector<int>& aNbNodes,
1076 const TopoDS_Face & F = TopoDS::Face(aShape);
1078 // verify 1 wire only, with 4 edges
1079 list< TopoDS_Edge > edges;
1080 list< int > nbEdgesInWire;
1081 int nbWire = SMESH_Block::GetOrderedEdges (F, edges, nbEdgesInWire);
1089 list< TopoDS_Edge >::iterator edgeIt = edges.begin();
1090 SMESH_subMesh * sm = aMesh.GetSubMesh(*edgeIt);
1091 MapShapeNbElemsItr anIt = aResMap.find(sm);
1092 if (anIt==aResMap.end()) {
1095 std::vector<int> aVec = (*anIt).second;
1096 IsQuadratic = (aVec[SMDSEntity_Quad_Edge] > aVec[SMDSEntity_Edge]);
1097 if (nbEdgesInWire.front() == 3) { // exactly 3 edges
1098 if (myTriaVertexID>0) {
1099 SMESHDS_Mesh* meshDS = aMesh.GetMeshDS();
1100 TopoDS_Vertex V = TopoDS::Vertex(meshDS->IndexToShape(myTriaVertexID));
1102 TopoDS_Edge E1,E2,E3;
1103 for (; edgeIt != edges.end(); ++edgeIt) {
1104 TopoDS_Edge E = TopoDS::Edge(*edgeIt);
1105 TopoDS_Vertex VF, VL;
1106 TopExp::Vertices(E, VF, VL, true);
1109 else if (VL.IsSame(V))
1114 SMESH_subMesh * sm = aMesh.GetSubMesh(E1);
1115 MapShapeNbElemsItr anIt = aResMap.find(sm);
1116 if (anIt==aResMap.end()) return false;
1117 std::vector<int> aVec = (*anIt).second;
1119 aNbNodes[0] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1121 aNbNodes[0] = aVec[SMDSEntity_Node] + 2;
1122 sm = aMesh.GetSubMesh(E2);
1123 anIt = aResMap.find(sm);
1124 if (anIt==aResMap.end()) return false;
1125 aVec = (*anIt).second;
1127 aNbNodes[1] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1129 aNbNodes[1] = aVec[SMDSEntity_Node] + 2;
1130 sm = aMesh.GetSubMesh(E3);
1131 anIt = aResMap.find(sm);
1132 if (anIt==aResMap.end()) return false;
1133 aVec = (*anIt).second;
1135 aNbNodes[2] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1137 aNbNodes[2] = aVec[SMDSEntity_Node] + 2;
1138 aNbNodes[3] = aNbNodes[1];
1144 if (nbEdgesInWire.front() == 4) { // exactly 4 edges
1145 for (; edgeIt != edges.end(); edgeIt++) {
1146 SMESH_subMesh * sm = aMesh.GetSubMesh(*edgeIt);
1147 MapShapeNbElemsItr anIt = aResMap.find(sm);
1148 if (anIt==aResMap.end()) {
1151 std::vector<int> aVec = (*anIt).second;
1153 aNbNodes[nbSides] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1155 aNbNodes[nbSides] = aVec[SMDSEntity_Node] + 2;
1159 else if (nbEdgesInWire.front() > 4) { // more than 4 edges - try to unite some
1160 list< TopoDS_Edge > sideEdges;
1161 while (!edges.empty()) {
1163 sideEdges.splice(sideEdges.end(), edges, edges.begin()); // edges.front() -> sideEdges.end()
1164 bool sameSide = true;
1165 while (!edges.empty() && sameSide) {
1166 sameSide = SMESH_Algo::IsContinuous(sideEdges.back(), edges.front());
1168 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1170 if (nbSides == 0) { // go backward from the first edge
1172 while (!edges.empty() && sameSide) {
1173 sameSide = SMESH_Algo::IsContinuous(sideEdges.front(), edges.back());
1175 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
1178 list<TopoDS_Edge>::iterator ite = sideEdges.begin();
1179 aNbNodes[nbSides] = 1;
1180 for (; ite!=sideEdges.end(); ite++) {
1181 SMESH_subMesh * sm = aMesh.GetSubMesh(*ite);
1182 MapShapeNbElemsItr anIt = aResMap.find(sm);
1183 if (anIt==aResMap.end()) {
1186 std::vector<int> aVec = (*anIt).second;
1188 aNbNodes[nbSides] += (aVec[SMDSEntity_Node]-1)/2 + 1;
1190 aNbNodes[nbSides] += aVec[SMDSEntity_Node] + 1;
1194 // issue 20222. Try to unite only edges shared by two same faces
1197 SMESH_Block::GetOrderedEdges (F, edges, nbEdgesInWire);
1198 while (!edges.empty()) {
1200 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1201 bool sameSide = true;
1202 while (!edges.empty() && sameSide) {
1204 SMESH_Algo::IsContinuous(sideEdges.back(), edges.front()) &&
1205 twoEdgesMeatAtVertex(sideEdges.back(), edges.front(), aMesh);
1207 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1209 if (nbSides == 0) { // go backward from the first edge
1211 while (!edges.empty() && sameSide) {
1213 SMESH_Algo::IsContinuous(sideEdges.front(), edges.back()) &&
1214 twoEdgesMeatAtVertex(sideEdges.front(), edges.back(), aMesh);
1216 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
1219 list<TopoDS_Edge>::iterator ite = sideEdges.begin();
1220 aNbNodes[nbSides] = 1;
1221 for (; ite!=sideEdges.end(); ite++) {
1222 SMESH_subMesh * sm = aMesh.GetSubMesh(*ite);
1223 MapShapeNbElemsItr anIt = aResMap.find(sm);
1224 if (anIt==aResMap.end()) {
1227 std::vector<int> aVec = (*anIt).second;
1229 aNbNodes[nbSides] += (aVec[SMDSEntity_Node]-1)/2 + 1;
1231 aNbNodes[nbSides] += aVec[SMDSEntity_Node] + 1;
1239 nbSides = nbEdgesInWire.front();
1240 error(COMPERR_BAD_SHAPE, TComm("Face must have 4 sides but not ") << nbSides);
1248 //=============================================================================
1252 //=============================================================================
1255 StdMeshers_Quadrangle_2D::CheckAnd2Dcompute (SMESH_Mesh & aMesh,
1256 const TopoDS_Shape & aShape,
1257 const bool CreateQuadratic)
1259 _quadraticMesh = CreateQuadratic;
1261 FaceQuadStruct::Ptr quad = CheckNbEdges(aMesh, aShape);
1264 // set normalized grid on unit square in parametric domain
1265 if ( ! setNormalizedGrid( quad ))
1273 inline const vector<UVPtStruct>& getUVPtStructIn(FaceQuadStruct::Ptr& quad, int i, int nbSeg)
1275 bool isXConst = (i == QUAD_BOTTOM_SIDE || i == QUAD_TOP_SIDE);
1276 double constValue = (i == QUAD_BOTTOM_SIDE || i == QUAD_LEFT_SIDE) ? 0 : 1;
1278 quad->nbNodeOut(i) ?
1279 quad->side[i].grid->SimulateUVPtStruct(nbSeg,isXConst,constValue) :
1280 quad->side[i].grid->GetUVPtStruct (isXConst,constValue);
1282 inline gp_UV calcUV(double x, double y,
1283 const gp_UV& a0,const gp_UV& a1,const gp_UV& a2,const gp_UV& a3,
1284 const gp_UV& p0,const gp_UV& p1,const gp_UV& p2,const gp_UV& p3)
1287 ((1 - y) * p0 + x * p1 + y * p2 + (1 - x) * p3 ) -
1288 ((1 - x) * (1 - y) * a0 + x * (1 - y) * a1 + x * y * a2 + (1 - x) * y * a3);
1292 //=============================================================================
1296 //=============================================================================
1298 bool StdMeshers_Quadrangle_2D::setNormalizedGrid (FaceQuadStruct::Ptr quad)
1300 if ( !quad->uv_grid.empty() )
1303 // Algorithme décrit dans "Génération automatique de maillages"
1304 // P.L. GEORGE, MASSON, § 6.4.1 p. 84-85
1305 // traitement dans le domaine paramétrique 2d u,v
1306 // transport - projection sur le carré unité
1309 // |<----north-2-------^ a3 -------------> a2
1311 // west-3 east-1 =right | |
1315 // v----south-0--------> a0 -------------> a1
1319 const FaceQuadStruct::Side & bSide = quad->side[0];
1320 const FaceQuadStruct::Side & rSide = quad->side[1];
1321 const FaceQuadStruct::Side & tSide = quad->side[2];
1322 const FaceQuadStruct::Side & lSide = quad->side[3];
1324 int nbhoriz = Min( bSide.NbPoints(), tSide.NbPoints() );
1325 int nbvertic = Min( rSide.NbPoints(), lSide.NbPoints() );
1327 if ( myQuadList.size() == 1 )
1329 // all sub-quads must have NO sides with nbNodeOut > 0
1330 quad->nbNodeOut(0) = Max( 0, bSide.grid->NbPoints() - tSide.grid->NbPoints() );
1331 quad->nbNodeOut(1) = Max( 0, rSide.grid->NbPoints() - lSide.grid->NbPoints() );
1332 quad->nbNodeOut(2) = Max( 0, tSide.grid->NbPoints() - bSide.grid->NbPoints() );
1333 quad->nbNodeOut(3) = Max( 0, lSide.grid->NbPoints() - rSide.grid->NbPoints() );
1335 const vector<UVPtStruct>& uv_e0 = bSide.GetUVPtStruct();
1336 const vector<UVPtStruct>& uv_e1 = rSide.GetUVPtStruct();
1337 const vector<UVPtStruct>& uv_e2 = tSide.GetUVPtStruct();
1338 const vector<UVPtStruct>& uv_e3 = lSide.GetUVPtStruct();
1339 if (uv_e0.empty() || uv_e1.empty() || uv_e2.empty() || uv_e3.empty())
1340 //return error("Can't find nodes on sides");
1341 return error(COMPERR_BAD_INPUT_MESH);
1343 quad->uv_grid.resize( nbvertic * nbhoriz );
1344 quad->iSize = nbhoriz;
1345 quad->jSize = nbvertic;
1346 UVPtStruct *uv_grid = & quad->uv_grid[0];
1348 quad->uv_box.Clear();
1350 // copy data of face boundary
1352 FaceQuadStruct::SideIterator sideIter;
1356 const double x0 = bSide.First().normParam;
1357 const double dx = bSide.Last().normParam - bSide.First().normParam;
1358 for ( sideIter.Init( bSide ); sideIter.More(); sideIter.Next() ) {
1359 sideIter.UVPt().x = ( sideIter.UVPt().normParam - x0 ) / dx;
1360 sideIter.UVPt().y = 0.;
1361 uv_grid[ j * nbhoriz + sideIter.Count() ] = sideIter.UVPt();
1362 quad->uv_box.Add( sideIter.UVPt().UV() );
1366 const int i = nbhoriz - 1;
1367 const double y0 = rSide.First().normParam;
1368 const double dy = rSide.Last().normParam - rSide.First().normParam;
1369 sideIter.Init( rSide );
1370 if ( quad->UVPt( i, sideIter.Count() ).node )
1371 sideIter.Next(); // avoid copying from a split emulated side
1372 for ( ; sideIter.More(); sideIter.Next() ) {
1373 sideIter.UVPt().x = 1.;
1374 sideIter.UVPt().y = ( sideIter.UVPt().normParam - y0 ) / dy;
1375 uv_grid[ sideIter.Count() * nbhoriz + i ] = sideIter.UVPt();
1376 quad->uv_box.Add( sideIter.UVPt().UV() );
1380 const int j = nbvertic - 1;
1381 const double x0 = tSide.First().normParam;
1382 const double dx = tSide.Last().normParam - tSide.First().normParam;
1383 int i = 0, nb = nbhoriz;
1384 sideIter.Init( tSide );
1385 if ( quad->UVPt( nb-1, j ).node ) --nb; // avoid copying from a split emulated side
1386 for ( ; i < nb; i++, sideIter.Next()) {
1387 sideIter.UVPt().x = ( sideIter.UVPt().normParam - x0 ) / dx;
1388 sideIter.UVPt().y = 1.;
1389 uv_grid[ j * nbhoriz + i ] = sideIter.UVPt();
1390 quad->uv_box.Add( sideIter.UVPt().UV() );
1395 const double y0 = lSide.First().normParam;
1396 const double dy = lSide.Last().normParam - lSide.First().normParam;
1397 int j = 0, nb = nbvertic;
1398 sideIter.Init( lSide );
1399 if ( quad->UVPt( i, j ).node )
1400 ++j, sideIter.Next(); // avoid copying from a split emulated side
1401 if ( quad->UVPt( i, nb-1 ).node )
1403 for ( ; j < nb; j++, sideIter.Next()) {
1404 sideIter.UVPt().x = 0.;
1405 sideIter.UVPt().y = ( sideIter.UVPt().normParam - y0 ) / dy;
1406 uv_grid[ j * nbhoriz + i ] = sideIter.UVPt();
1407 quad->uv_box.Add( sideIter.UVPt().UV() );
1411 // normalized 2d parameters on grid
1413 for (int i = 1; i < nbhoriz-1; i++)
1415 const double x0 = quad->UVPt( i, 0 ).x;
1416 const double x1 = quad->UVPt( i, nbvertic-1 ).x;
1417 for (int j = 1; j < nbvertic-1; j++)
1419 const double y0 = quad->UVPt( 0, j ).y;
1420 const double y1 = quad->UVPt( nbhoriz-1, j ).y;
1421 // --- intersection : x=x0+(y0+x(y1-y0))(x1-x0)
1422 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1423 double y = y0 + x * (y1 - y0);
1424 int ij = j * nbhoriz + i;
1427 uv_grid[ij].node = NULL;
1431 // projection on 2d domain (u,v)
1433 gp_UV a0 = quad->UVPt( 0, 0 ).UV();
1434 gp_UV a1 = quad->UVPt( nbhoriz-1, 0 ).UV();
1435 gp_UV a2 = quad->UVPt( nbhoriz-1, nbvertic-1 ).UV();
1436 gp_UV a3 = quad->UVPt( 0, nbvertic-1 ).UV();
1438 for (int i = 1; i < nbhoriz-1; i++)
1440 gp_UV p0 = quad->UVPt( i, 0 ).UV();
1441 gp_UV p2 = quad->UVPt( i, nbvertic-1 ).UV();
1442 for (int j = 1; j < nbvertic-1; j++)
1444 gp_UV p1 = quad->UVPt( nbhoriz-1, j ).UV();
1445 gp_UV p3 = quad->UVPt( 0, j ).UV();
1447 int ij = j * nbhoriz + i;
1448 double x = uv_grid[ij].x;
1449 double y = uv_grid[ij].y;
1451 gp_UV uv = calcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1453 uv_grid[ij].u = uv.X();
1454 uv_grid[ij].v = uv.Y();
1460 //=======================================================================
1461 //function : ShiftQuad
1462 //purpose : auxilary function for computeQuadPref
1463 //=======================================================================
1465 void StdMeshers_Quadrangle_2D::shiftQuad(FaceQuadStruct::Ptr& quad, const int num )
1467 quad->shift( num, /*ori=*/true, /*keepGrid=*/myQuadList.size() > 1 );
1470 //================================================================================
1472 * \brief Rotate sides of a quad by given nb of quartes
1473 * \param nb - number of rotation quartes
1474 * \param ori - to keep orientation of sides as in an unit quad or not
1475 * \param keepGrid - if \c true Side::grid is not changed, Side::from and Side::to
1476 * are altered instead
1478 //================================================================================
1480 void FaceQuadStruct::shift( size_t nb, bool ori, bool keepGrid )
1482 if ( nb == 0 ) return;
1484 vector< Side > newSides( side.size() );
1485 vector< Side* > sidePtrs( side.size() );
1486 for (int i = QUAD_BOTTOM_SIDE; i < NB_QUAD_SIDES; ++i)
1488 int id = (i + nb) % NB_QUAD_SIDES;
1491 bool wasForward = (i < QUAD_TOP_SIDE);
1492 bool newForward = (id < QUAD_TOP_SIDE);
1493 if ( wasForward != newForward )
1494 side[ i ].Reverse( keepGrid );
1496 newSides[ id ] = side[ i ];
1497 sidePtrs[ i ] = & side[ i ];
1499 // make newSides refer newSides via Side::Contact's
1500 for ( size_t i = 0; i < newSides.size(); ++i )
1502 FaceQuadStruct::Side& ns = newSides[ i ];
1503 for ( size_t iC = 0; iC < ns.contacts.size(); ++iC )
1505 FaceQuadStruct::Side* oSide = ns.contacts[iC].other_side;
1506 vector< Side* >::iterator sIt = std::find( sidePtrs.begin(), sidePtrs.end(), oSide );
1507 if ( sIt != sidePtrs.end() )
1508 ns.contacts[iC].other_side = & newSides[ *sIt - sidePtrs[0] ];
1511 newSides.swap( side );
1516 //=======================================================================
1518 //purpose : auxilary function for computeQuadPref
1519 //=======================================================================
1521 static gp_UV calcUV(double x0, double x1, double y0, double y1,
1522 FaceQuadStruct::Ptr& quad,
1523 const gp_UV& a0, const gp_UV& a1,
1524 const gp_UV& a2, const gp_UV& a3)
1526 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1527 double y = y0 + x * (y1 - y0);
1529 gp_UV p0 = quad->side[QUAD_BOTTOM_SIDE].grid->Value2d(x).XY();
1530 gp_UV p1 = quad->side[QUAD_RIGHT_SIDE ].grid->Value2d(y).XY();
1531 gp_UV p2 = quad->side[QUAD_TOP_SIDE ].grid->Value2d(x).XY();
1532 gp_UV p3 = quad->side[QUAD_LEFT_SIDE ].grid->Value2d(y).XY();
1534 gp_UV uv = calcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1539 //=======================================================================
1540 //function : calcUV2
1541 //purpose : auxilary function for computeQuadPref
1542 //=======================================================================
1544 static gp_UV calcUV2(double x, double y,
1545 FaceQuadStruct::Ptr& quad,
1546 const gp_UV& a0, const gp_UV& a1,
1547 const gp_UV& a2, const gp_UV& a3)
1549 gp_UV p0 = quad->side[QUAD_BOTTOM_SIDE].grid->Value2d(x).XY();
1550 gp_UV p1 = quad->side[QUAD_RIGHT_SIDE ].grid->Value2d(y).XY();
1551 gp_UV p2 = quad->side[QUAD_TOP_SIDE ].grid->Value2d(x).XY();
1552 gp_UV p3 = quad->side[QUAD_LEFT_SIDE ].grid->Value2d(y).XY();
1554 gp_UV uv = calcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1560 //=======================================================================
1562 * Create only quandrangle faces
1564 //=======================================================================
1566 bool StdMeshers_Quadrangle_2D::computeQuadPref (SMESH_Mesh & aMesh,
1567 const TopoDS_Face& aFace,
1568 FaceQuadStruct::Ptr quad)
1570 const bool OldVersion = (myQuadType == QUAD_QUADRANGLE_PREF_REVERSED);
1571 const bool WisF = true;
1573 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
1574 Handle(Geom_Surface) S = BRep_Tool::Surface(aFace);
1575 int i,j, geomFaceID = meshDS->ShapeToIndex(aFace);
1577 int nb = quad->side[0].NbPoints();
1578 int nr = quad->side[1].NbPoints();
1579 int nt = quad->side[2].NbPoints();
1580 int nl = quad->side[3].NbPoints();
1581 int dh = abs(nb-nt);
1582 int dv = abs(nr-nl);
1584 if ( myForcedPnts.empty() )
1586 // rotate sides to be as in the picture below and to have
1587 // dh >= dv and nt > nb
1589 shiftQuad( quad, ( nt > nb ) ? 0 : 2 );
1591 shiftQuad( quad, ( nr > nl ) ? 1 : 3 );
1595 // rotate the quad to have nt > nb [and nr > nl]
1597 shiftQuad ( quad, nr > nl ? 1 : 2 );
1599 shiftQuad( quad, nb == nt ? 1 : 0 );
1601 shiftQuad( quad, 3 );
1604 nb = quad->side[0].NbPoints();
1605 nr = quad->side[1].NbPoints();
1606 nt = quad->side[2].NbPoints();
1607 nl = quad->side[3].NbPoints();
1610 int nbh = Max(nb,nt);
1611 int nbv = Max(nr,nl);
1615 // Orientation of face and 3 main domain for future faces
1616 // ----------- Old version ---------------
1622 // left | |__| | rigth
1629 // ----------- New version ---------------
1635 // left |/________\| rigth
1643 const int bfrom = quad->side[0].from;
1644 const int rfrom = quad->side[1].from;
1645 const int tfrom = quad->side[2].from;
1646 const int lfrom = quad->side[3].from;
1648 const vector<UVPtStruct>& uv_eb_vec = quad->side[0].GetUVPtStruct(true,0);
1649 const vector<UVPtStruct>& uv_er_vec = quad->side[1].GetUVPtStruct(false,1);
1650 const vector<UVPtStruct>& uv_et_vec = quad->side[2].GetUVPtStruct(true,1);
1651 const vector<UVPtStruct>& uv_el_vec = quad->side[3].GetUVPtStruct(false,0);
1652 if (uv_eb_vec.empty() ||
1653 uv_er_vec.empty() ||
1654 uv_et_vec.empty() ||
1656 return error(COMPERR_BAD_INPUT_MESH);
1658 FaceQuadStruct::SideIterator uv_eb, uv_er, uv_et, uv_el;
1659 uv_eb.Init( quad->side[0] );
1660 uv_er.Init( quad->side[1] );
1661 uv_et.Init( quad->side[2] );
1662 uv_el.Init( quad->side[3] );
1664 gp_UV a0,a1,a2,a3, p0,p1,p2,p3, uv;
1667 a0 = uv_eb[ 0 ].UV();
1668 a1 = uv_er[ 0 ].UV();
1669 a2 = uv_er[ nr-1 ].UV();
1670 a3 = uv_et[ 0 ].UV();
1672 if ( !myForcedPnts.empty() )
1674 if ( dv != 0 && dh != 0 ) // here myQuadList.size() == 1
1676 const int dmin = Min( dv, dh );
1678 // Make a side separating domains L and Cb
1679 StdMeshers_FaceSidePtr sideLCb;
1680 UVPtStruct p3dom; // a point where 3 domains meat
1682 vector<UVPtStruct> pointsLCb( dmin+1 ); // 1--------1
1683 pointsLCb[0] = uv_eb[0]; // | | |
1684 for ( int i = 1; i <= dmin; ++i ) // | |Ct|
1686 x = uv_et[ i ].normParam; // | |__|
1687 y = uv_er[ i ].normParam; // | / |
1688 p0 = quad->side[0].grid->Value2d( x ).XY(); // | / Cb |dmin
1689 p1 = uv_er[ i ].UV(); // |/ |
1690 p2 = uv_et[ i ].UV(); // 0--------0
1691 p3 = quad->side[3].grid->Value2d( y ).XY();
1692 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1693 pointsLCb[ i ].u = uv.X();
1694 pointsLCb[ i ].v = uv.Y();
1696 sideLCb = StdMeshers_FaceSide::New( pointsLCb, aFace );
1697 p3dom = pointsLCb.back();
1699 // Make a side separating domains L and Ct
1700 StdMeshers_FaceSidePtr sideLCt;
1702 vector<UVPtStruct> pointsLCt( nl );
1703 pointsLCt[0] = p3dom;
1704 pointsLCt.back() = uv_et[ dmin ];
1705 x = uv_et[ dmin ].normParam;
1706 p0 = quad->side[0].grid->Value2d( x ).XY();
1707 p2 = uv_et[ dmin ].UV();
1708 double y0 = uv_er[ dmin ].normParam;
1709 for ( int i = 1; i < nl-1; ++i )
1711 y = y0 + i / ( nl-1. ) * ( 1. - y0 );
1712 p1 = quad->side[1].grid->Value2d( y ).XY();
1713 p3 = quad->side[3].grid->Value2d( y ).XY();
1714 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1715 pointsLCt[ i ].u = uv.X();
1716 pointsLCt[ i ].v = uv.Y();
1718 sideLCt = StdMeshers_FaceSide::New( pointsLCt, aFace );
1720 // Make a side separating domains Cb and Ct
1721 StdMeshers_FaceSidePtr sideCbCt;
1723 vector<UVPtStruct> pointsCbCt( nb );
1724 pointsCbCt[0] = p3dom;
1725 pointsCbCt.back() = uv_er[ dmin ];
1726 y = uv_er[ dmin ].normParam;
1727 p1 = uv_er[ dmin ].UV();
1728 p3 = quad->side[3].grid->Value2d( y ).XY();
1729 double x0 = uv_et[ dmin ].normParam;
1730 for ( int i = 1; i < nb-1; ++i )
1732 x = x0 + i / ( nb-1. ) * ( 1. - x0 );
1733 p2 = quad->side[2].grid->Value2d( x ).XY();
1734 p0 = quad->side[0].grid->Value2d( x ).XY();
1735 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1736 pointsCbCt[ i ].u = uv.X();
1737 pointsCbCt[ i ].v = uv.Y();
1739 sideCbCt = StdMeshers_FaceSide::New( pointsCbCt, aFace );
1742 FaceQuadStruct* qCb = new FaceQuadStruct( quad->face, "Cb" );
1743 myQuadList.push_back( FaceQuadStruct::Ptr( qCb ));
1744 qCb->side.resize(4);
1745 qCb->side[0] = quad->side[0];
1746 qCb->side[1] = quad->side[1];
1747 qCb->side[2] = sideCbCt;
1748 qCb->side[3] = sideLCb;
1749 qCb->side[1].to = dmin+1;
1751 FaceQuadStruct* qL = new FaceQuadStruct( quad->face, "L" );
1752 myQuadList.push_back( FaceQuadStruct::Ptr( qL ));
1754 qL->side[0] = sideLCb;
1755 qL->side[1] = sideLCt;
1756 qL->side[2] = quad->side[2];
1757 qL->side[3] = quad->side[3];
1758 qL->side[2].to = dmin+1;
1759 // Make Ct from the main quad
1760 FaceQuadStruct::Ptr qCt = quad;
1761 qCt->side[0] = sideCbCt;
1762 qCt->side[3] = sideLCt;
1763 qCt->side[1].from = dmin;
1764 qCt->side[2].from = dmin;
1765 qCt->uv_grid.clear();
1769 qCb->side[3].AddContact( dmin, & qCb->side[2], 0 );
1770 qCb->side[3].AddContact( dmin, & qCt->side[3], 0 );
1771 qCt->side[3].AddContact( 0, & qCt->side[0], 0 );
1772 qCt->side[0].AddContact( 0, & qL ->side[0], dmin );
1773 qL ->side[0].AddContact( dmin, & qL ->side[1], 0 );
1774 qL ->side[0].AddContact( dmin, & qCb->side[2], 0 );
1777 return computeQuadDominant( aMesh, aFace );
1779 return computeQuadPref( aMesh, aFace, qCt );
1781 } // if ( dv != 0 && dh != 0 )
1783 const int db = quad->side[0].IsReversed() ? -1 : +1;
1784 const int dr = quad->side[1].IsReversed() ? -1 : +1;
1785 const int dt = quad->side[2].IsReversed() ? -1 : +1;
1786 const int dl = quad->side[3].IsReversed() ? -1 : +1;
1788 // Case dv == 0, here possibly myQuadList.size() > 1
1800 const int lw = dh/2; // lateral width
1804 double lL = quad->side[3].Length();
1805 double lLwL = quad->side[2].Length( tfrom,
1806 tfrom + ( lw ) * dt );
1807 yCbL = lLwL / ( lLwL + lL );
1809 double lR = quad->side[1].Length();
1810 double lLwR = quad->side[2].Length( tfrom + ( lw + nb-1 ) * dt,
1811 tfrom + ( lw + nb-1 + lw ) * dt);
1812 yCbR = lLwR / ( lLwR + lR );
1814 // Make sides separating domains Cb and L and R
1815 StdMeshers_FaceSidePtr sideLCb, sideRCb;
1816 UVPtStruct pTBL, pTBR; // points where 3 domains meat
1818 vector<UVPtStruct> pointsLCb( lw+1 ), pointsRCb( lw+1 );
1819 pointsLCb[0] = uv_eb[ 0 ];
1820 pointsRCb[0] = uv_eb[ nb-1 ];
1821 for ( int i = 1, i2 = nt-2; i <= lw; ++i, --i2 )
1823 x = quad->side[2].Param( i );
1825 p0 = quad->side[0].Value2d( x );
1826 p1 = quad->side[1].Value2d( y );
1827 p2 = uv_et[ i ].UV();
1828 p3 = quad->side[3].Value2d( y );
1829 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1830 pointsLCb[ i ].u = uv.X();
1831 pointsLCb[ i ].v = uv.Y();
1832 pointsLCb[ i ].x = x;
1834 x = quad->side[2].Param( i2 );
1836 p1 = quad->side[1].Value2d( y );
1837 p0 = quad->side[0].Value2d( x );
1838 p2 = uv_et[ i2 ].UV();
1839 p3 = quad->side[3].Value2d( y );
1840 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1841 pointsRCb[ i ].u = uv.X();
1842 pointsRCb[ i ].v = uv.Y();
1843 pointsRCb[ i ].x = x;
1845 sideLCb = StdMeshers_FaceSide::New( pointsLCb, aFace );
1846 sideRCb = StdMeshers_FaceSide::New( pointsRCb, aFace );
1847 pTBL = pointsLCb.back();
1848 pTBR = pointsRCb.back();
1850 // Make sides separating domains Ct and L and R
1851 StdMeshers_FaceSidePtr sideLCt, sideRCt;
1853 vector<UVPtStruct> pointsLCt( nl ), pointsRCt( nl );
1854 pointsLCt[0] = pTBL;
1855 pointsLCt.back() = uv_et[ lw ];
1856 pointsRCt[0] = pTBR;
1857 pointsRCt.back() = uv_et[ lw + nb - 1 ];
1859 p0 = quad->side[0].Value2d( x );
1860 p2 = uv_et[ lw ].UV();
1861 int iR = lw + nb - 1;
1863 gp_UV p0R = quad->side[0].Value2d( xR );
1864 gp_UV p2R = uv_et[ iR ].UV();
1865 for ( int i = 1; i < nl-1; ++i )
1867 y = yCbL + ( 1. - yCbL ) * i / (nl-1.);
1868 p1 = quad->side[1].Value2d( y );
1869 p3 = quad->side[3].Value2d( y );
1870 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1871 pointsLCt[ i ].u = uv.X();
1872 pointsLCt[ i ].v = uv.Y();
1874 y = yCbR + ( 1. - yCbR ) * i / (nl-1.);
1875 p1 = quad->side[1].Value2d( y );
1876 p3 = quad->side[3].Value2d( y );
1877 uv = calcUV( xR,y, a0,a1,a2,a3, p0R,p1,p2R,p3 );
1878 pointsRCt[ i ].u = uv.X();
1879 pointsRCt[ i ].v = uv.Y();
1881 sideLCt = StdMeshers_FaceSide::New( pointsLCt, aFace );
1882 sideRCt = StdMeshers_FaceSide::New( pointsRCt, aFace );
1884 // Make a side separating domains Cb and Ct
1885 StdMeshers_FaceSidePtr sideCbCt;
1887 vector<UVPtStruct> pointsCbCt( nb );
1888 pointsCbCt[0] = pTBL;
1889 pointsCbCt.back() = pTBR;
1890 p1 = quad->side[1].Value2d( yCbR );
1891 p3 = quad->side[3].Value2d( yCbL );
1892 for ( int i = 1; i < nb-1; ++i )
1894 x = quad->side[2].Param( i + lw );
1895 y = yCbL + ( yCbR - yCbL ) * i / (nb-1.);
1896 p2 = uv_et[ i + lw ].UV();
1897 p0 = quad->side[0].Value2d( x );
1898 uv = calcUV( x,y, a0,a1,a2,a3, p0,p1,p2,p3 );
1899 pointsCbCt[ i ].u = uv.X();
1900 pointsCbCt[ i ].v = uv.Y();
1902 sideCbCt = StdMeshers_FaceSide::New( pointsCbCt, aFace );
1905 FaceQuadStruct* qCb = new FaceQuadStruct( quad->face, "Cb" );
1906 myQuadList.push_back( FaceQuadStruct::Ptr( qCb ));
1907 qCb->side.resize(4);
1908 qCb->side[0] = quad->side[0];
1909 qCb->side[1] = sideRCb;
1910 qCb->side[2] = sideCbCt;
1911 qCb->side[3] = sideLCb;
1913 FaceQuadStruct* qL = new FaceQuadStruct( quad->face, "L" );
1914 myQuadList.push_back( FaceQuadStruct::Ptr( qL ));
1916 qL->side[0] = sideLCb;
1917 qL->side[1] = sideLCt;
1918 qL->side[2] = quad->side[2];
1919 qL->side[3] = quad->side[3];
1920 qL->side[2].to = ( lw + 1 ) * dt + tfrom;
1922 FaceQuadStruct* qR = new FaceQuadStruct( quad->face, "R" );
1923 myQuadList.push_back( FaceQuadStruct::Ptr( qR ));
1925 qR->side[0] = sideRCb;
1926 qR->side[0].from = lw;
1927 qR->side[0].to = -1;
1928 qR->side[0].di = -1;
1929 qR->side[1] = quad->side[1];
1930 qR->side[2] = quad->side[2];
1931 qR->side[2].from = ( lw + nb-1 ) * dt + tfrom;
1932 qR->side[3] = sideRCt;
1933 // Make Ct from the main quad
1934 FaceQuadStruct::Ptr qCt = quad;
1935 qCt->side[0] = sideCbCt;
1936 qCt->side[1] = sideRCt;
1937 qCt->side[2].from = ( lw ) * dt + tfrom;
1938 qCt->side[2].to = ( lw + nb ) * dt + tfrom;
1939 qCt->side[3] = sideLCt;
1940 qCt->uv_grid.clear();
1944 qCb->side[3].AddContact( lw, & qCb->side[2], 0 );
1945 qCb->side[3].AddContact( lw, & qCt->side[3], 0 );
1946 qCt->side[3].AddContact( 0, & qCt->side[0], 0 );
1947 qCt->side[0].AddContact( 0, & qL ->side[0], lw );
1948 qL ->side[0].AddContact( lw, & qL ->side[1], 0 );
1949 qL ->side[0].AddContact( lw, & qCb->side[2], 0 );
1951 qCb->side[1].AddContact( lw, & qCb->side[2], nb-1 );
1952 qCb->side[1].AddContact( lw, & qCt->side[1], 0 );
1953 qCt->side[0].AddContact( nb-1, & qCt->side[1], 0 );
1954 qCt->side[0].AddContact( nb-1, & qR ->side[0], lw );
1955 qR ->side[3].AddContact( 0, & qR ->side[0], lw );
1956 qR ->side[3].AddContact( 0, & qCb->side[2], nb-1 );
1958 return computeQuadDominant( aMesh, aFace );
1960 } // if ( !myForcedPnts.empty() )
1971 // arrays for normalized params
1972 TColStd_SequenceOfReal npb, npr, npt, npl;
1973 for (i=0; i<nb; i++) {
1974 npb.Append(uv_eb[i].normParam);
1976 for (i=0; i<nr; i++) {
1977 npr.Append(uv_er[i].normParam);
1979 for (i=0; i<nt; i++) {
1980 npt.Append(uv_et[i].normParam);
1982 for (i=0; i<nl; i++) {
1983 npl.Append(uv_el[i].normParam);
1988 // add some params to right and left after the first param
1991 double dpr = (npr.Value(2) - npr.Value(1))/(dr+1);
1992 for (i=1; i<=dr; i++) {
1993 npr.InsertAfter(1,npr.Value(2)-dpr);
1997 dpr = (npl.Value(2) - npl.Value(1))/(dl+1);
1998 for (i=1; i<=dl; i++) {
1999 npl.InsertAfter(1,npl.Value(2)-dpr);
2003 int nnn = Min(nr,nl);
2004 // auxilary sequence of XY for creation nodes
2005 // in the bottom part of central domain
2006 // Length of UVL and UVR must be == nbv-nnn
2007 TColgp_SequenceOfXY UVL, UVR, UVT;
2010 // step1: create faces for left domain
2011 StdMeshers_Array2OfNode NodesL(1,dl+1,1,nl);
2013 for (j=1; j<=nl; j++)
2014 NodesL.SetValue(1,j,uv_el[j-1].node);
2017 for (i=1; i<=dl; i++)
2018 NodesL.SetValue(i+1,nl,uv_et[i].node);
2019 // create and add needed nodes
2020 TColgp_SequenceOfXY UVtmp;
2021 for (i=1; i<=dl; i++) {
2022 double x0 = npt.Value(i+1);
2025 double y0 = npl.Value(i+1);
2026 double y1 = npr.Value(i+1);
2027 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2028 gp_Pnt P = S->Value(UV.X(),UV.Y());
2029 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2030 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2031 NodesL.SetValue(i+1,1,N);
2032 if (UVL.Length()<nbv-nnn) UVL.Append(UV);
2034 for (j=2; j<nl; j++) {
2035 double y0 = npl.Value(dl+j);
2036 double y1 = npr.Value(dl+j);
2037 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2038 gp_Pnt P = S->Value(UV.X(),UV.Y());
2039 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2040 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2041 NodesL.SetValue(i+1,j,N);
2042 if (i==dl) UVtmp.Append(UV);
2045 for (i=1; i<=UVtmp.Length() && UVL.Length()<nbv-nnn; i++) {
2046 UVL.Append(UVtmp.Value(i));
2049 for (i=1; i<=dl; i++) {
2050 for (j=1; j<nl; j++) {
2053 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i+1,j),
2054 NodesL.Value(i+1,j+1), NodesL.Value(i,j+1));
2055 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2061 // fill UVL using c2d
2062 for (i=1; i<npl.Length() && UVL.Length()<nbv-nnn; i++) {
2063 UVL.Append(gp_UV (uv_el[i].u, uv_el[i].v));
2067 // step2: create faces for right domain
2068 StdMeshers_Array2OfNode NodesR(1,dr+1,1,nr);
2070 for (j=1; j<=nr; j++)
2071 NodesR.SetValue(1,j,uv_er[nr-j].node);
2074 for (i=1; i<=dr; i++)
2075 NodesR.SetValue(i+1,1,uv_et[nt-1-i].node);
2076 // create and add needed nodes
2077 TColgp_SequenceOfXY UVtmp;
2078 for (i=1; i<=dr; i++) {
2079 double x0 = npt.Value(nt-i);
2082 double y0 = npl.Value(i+1);
2083 double y1 = npr.Value(i+1);
2084 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2085 gp_Pnt P = S->Value(UV.X(),UV.Y());
2086 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2087 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2088 NodesR.SetValue(i+1,nr,N);
2089 if (UVR.Length()<nbv-nnn) UVR.Append(UV);
2091 for (j=2; j<nr; j++) {
2092 double y0 = npl.Value(nbv-j+1);
2093 double y1 = npr.Value(nbv-j+1);
2094 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2095 gp_Pnt P = S->Value(UV.X(),UV.Y());
2096 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2097 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2098 NodesR.SetValue(i+1,j,N);
2099 if (i==dr) UVtmp.Prepend(UV);
2102 for (i=1; i<=UVtmp.Length() && UVR.Length()<nbv-nnn; i++) {
2103 UVR.Append(UVtmp.Value(i));
2106 for (i=1; i<=dr; i++) {
2107 for (j=1; j<nr; j++) {
2110 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i+1,j),
2111 NodesR.Value(i+1,j+1), NodesR.Value(i,j+1));
2112 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2118 // fill UVR using c2d
2119 for (i=1; i<npr.Length() && UVR.Length()<nbv-nnn; i++) {
2120 UVR.Append(gp_UV(uv_er[i].u, uv_er[i].v));
2124 // step3: create faces for central domain
2125 StdMeshers_Array2OfNode NodesC(1,nb,1,nbv);
2126 // add first line using NodesL
2127 for (i=1; i<=dl+1; i++)
2128 NodesC.SetValue(1,i,NodesL(i,1));
2129 for (i=2; i<=nl; i++)
2130 NodesC.SetValue(1,dl+i,NodesL(dl+1,i));
2131 // add last line using NodesR
2132 for (i=1; i<=dr+1; i++)
2133 NodesC.SetValue(nb,i,NodesR(i,nr));
2134 for (i=1; i<nr; i++)
2135 NodesC.SetValue(nb,dr+i+1,NodesR(dr+1,nr-i));
2136 // add top nodes (last columns)
2137 for (i=dl+2; i<nbh-dr; i++)
2138 NodesC.SetValue(i-dl,nbv,uv_et[i-1].node);
2139 // add bottom nodes (first columns)
2140 for (i=2; i<nb; i++)
2141 NodesC.SetValue(i,1,uv_eb[i-1].node);
2143 // create and add needed nodes
2144 // add linear layers
2145 for (i=2; i<nb; i++) {
2146 double x0 = npt.Value(dl+i);
2148 for (j=1; j<nnn; j++) {
2149 double y0 = npl.Value(nbv-nnn+j);
2150 double y1 = npr.Value(nbv-nnn+j);
2151 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2152 gp_Pnt P = S->Value(UV.X(),UV.Y());
2153 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2154 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2155 NodesC.SetValue(i,nbv-nnn+j,N);
2160 // add diagonal layers
2161 gp_UV A2 = UVR.Value(nbv-nnn);
2162 gp_UV A3 = UVL.Value(nbv-nnn);
2163 for (i=1; i<nbv-nnn; i++) {
2164 gp_UV p1 = UVR.Value(i);
2165 gp_UV p3 = UVL.Value(i);
2166 double y = i / double(nbv-nnn);
2167 for (j=2; j<nb; j++) {
2168 double x = npb.Value(j);
2169 gp_UV p0( uv_eb[j-1].u, uv_eb[j-1].v );
2170 gp_UV p2 = UVT.Value( j-1 );
2171 gp_UV UV = calcUV(x, y, a0, a1, A2, A3, p0,p1,p2,p3 );
2172 gp_Pnt P = S->Value(UV.X(),UV.Y());
2173 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2174 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(),UV.Y());
2175 NodesC.SetValue(j,i+1,N);
2179 for (i=1; i<nb; i++) {
2180 for (j=1; j<nbv; j++) {
2183 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
2184 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
2185 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2191 else { // New version (!OldVersion)
2192 // step1: create faces for bottom rectangle domain
2193 StdMeshers_Array2OfNode NodesBRD(1,nb,1,nnn-1);
2194 // fill UVL and UVR using c2d
2195 for (j=0; j<nb; j++) {
2196 NodesBRD.SetValue(j+1,1,uv_eb[j].node);
2198 for (i=1; i<nnn-1; i++) {
2199 NodesBRD.SetValue(1,i+1,uv_el[i].node);
2200 NodesBRD.SetValue(nb,i+1,uv_er[i].node);
2201 for (j=2; j<nb; j++) {
2202 double x = npb.Value(j);
2203 double y = (1-x) * npl.Value(i+1) + x * npr.Value(i+1);
2204 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2205 gp_Pnt P = S->Value(UV.X(),UV.Y());
2206 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2207 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(),UV.Y());
2208 NodesBRD.SetValue(j,i+1,N);
2211 for (j=1; j<nnn-1; j++) {
2212 for (i=1; i<nb; i++) {
2215 myHelper->AddFace(NodesBRD.Value(i,j), NodesBRD.Value(i+1,j),
2216 NodesBRD.Value(i+1,j+1), NodesBRD.Value(i,j+1));
2217 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2221 int drl = abs(nr-nl);
2222 // create faces for region C
2223 StdMeshers_Array2OfNode NodesC(1,nb,1,drl+1+addv);
2224 // add nodes from previous region
2225 for (j=1; j<=nb; j++) {
2226 NodesC.SetValue(j,1,NodesBRD.Value(j,nnn-1));
2228 if ((drl+addv) > 0) {
2233 TColgp_SequenceOfXY UVtmp;
2234 double drparam = npr.Value(nr) - npr.Value(nnn-1);
2235 double dlparam = npl.Value(nnn) - npl.Value(nnn-1);
2237 for (i=1; i<=drl; i++) {
2238 // add existed nodes from right edge
2239 NodesC.SetValue(nb,i+1,uv_er[nnn+i-2].node);
2240 //double dtparam = npt.Value(i+1);
2241 y1 = npr.Value(nnn+i-1); // param on right edge
2242 double dpar = (y1 - npr.Value(nnn-1))/drparam;
2243 y0 = npl.Value(nnn-1) + dpar*dlparam; // param on left edge
2244 double dy = y1 - y0;
2245 for (j=1; j<nb; j++) {
2246 double x = npt.Value(i+1) + npb.Value(j)*(1-npt.Value(i+1));
2247 double y = y0 + dy*x;
2248 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2249 gp_Pnt P = S->Value(UV.X(),UV.Y());
2250 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2251 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2252 NodesC.SetValue(j,i+1,N);
2255 double dy0 = (1-y0)/(addv+1);
2256 double dy1 = (1-y1)/(addv+1);
2257 for (i=1; i<=addv; i++) {
2258 double yy0 = y0 + dy0*i;
2259 double yy1 = y1 + dy1*i;
2260 double dyy = yy1 - yy0;
2261 for (j=1; j<=nb; j++) {
2262 double x = npt.Value(i+1+drl) +
2263 npb.Value(j) * (npt.Value(nt-i) - npt.Value(i+1+drl));
2264 double y = yy0 + dyy*x;
2265 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2266 gp_Pnt P = S->Value(UV.X(),UV.Y());
2267 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2268 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2269 NodesC.SetValue(j,i+drl+1,N);
2276 TColgp_SequenceOfXY UVtmp;
2277 double dlparam = npl.Value(nl) - npl.Value(nnn-1);
2278 double drparam = npr.Value(nnn) - npr.Value(nnn-1);
2279 double y0 = npl.Value(nnn-1);
2280 double y1 = npr.Value(nnn-1);
2281 for (i=1; i<=drl; i++) {
2282 // add existed nodes from right edge
2283 NodesC.SetValue(1,i+1,uv_el[nnn+i-2].node);
2284 y0 = npl.Value(nnn+i-1); // param on left edge
2285 double dpar = (y0 - npl.Value(nnn-1))/dlparam;
2286 y1 = npr.Value(nnn-1) + dpar*drparam; // param on right edge
2287 double dy = y1 - y0;
2288 for (j=2; j<=nb; j++) {
2289 double x = npb.Value(j)*npt.Value(nt-i);
2290 double y = y0 + dy*x;
2291 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2292 gp_Pnt P = S->Value(UV.X(),UV.Y());
2293 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2294 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2295 NodesC.SetValue(j,i+1,N);
2298 double dy0 = (1-y0)/(addv+1);
2299 double dy1 = (1-y1)/(addv+1);
2300 for (i=1; i<=addv; i++) {
2301 double yy0 = y0 + dy0*i;
2302 double yy1 = y1 + dy1*i;
2303 double dyy = yy1 - yy0;
2304 for (j=1; j<=nb; j++) {
2305 double x = npt.Value(i+1) +
2306 npb.Value(j) * (npt.Value(nt-i-drl) - npt.Value(i+1));
2307 double y = yy0 + dyy*x;
2308 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
2309 gp_Pnt P = S->Value(UV.X(),UV.Y());
2310 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2311 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2312 NodesC.SetValue(j,i+drl+1,N);
2317 for (j=1; j<=drl+addv; j++) {
2318 for (i=1; i<nb; i++) {
2321 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
2322 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
2323 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2328 StdMeshers_Array2OfNode NodesLast(1,nt,1,2);
2329 for (i=1; i<=nt; i++) {
2330 NodesLast.SetValue(i,2,uv_et[i-1].node);
2333 for (i=n1; i<drl+addv+1; i++) {
2335 NodesLast.SetValue(nnn,1,NodesC.Value(1,i));
2337 for (i=1; i<=nb; i++) {
2339 NodesLast.SetValue(nnn,1,NodesC.Value(i,drl+addv+1));
2341 for (i=drl+addv; i>=n2; i--) {
2343 NodesLast.SetValue(nnn,1,NodesC.Value(nb,i));
2345 for (i=1; i<nt; i++) {
2348 myHelper->AddFace(NodesLast.Value(i,1), NodesLast.Value(i+1,1),
2349 NodesLast.Value(i+1,2), NodesLast.Value(i,2));
2350 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2353 } // if ((drl+addv) > 0)
2355 } // end new version implementation
2362 //=======================================================================
2364 * Evaluate only quandrangle faces
2366 //=======================================================================
2368 bool StdMeshers_Quadrangle_2D::evaluateQuadPref(SMESH_Mesh & aMesh,
2369 const TopoDS_Shape& aShape,
2370 std::vector<int>& aNbNodes,
2371 MapShapeNbElems& aResMap,
2374 // Auxilary key in order to keep old variant
2375 // of meshing after implementation new variant
2376 // for bug 0016220 from Mantis.
2377 bool OldVersion = false;
2378 if (myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
2381 const TopoDS_Face& F = TopoDS::Face(aShape);
2382 Handle(Geom_Surface) S = BRep_Tool::Surface(F);
2384 int nb = aNbNodes[0];
2385 int nr = aNbNodes[1];
2386 int nt = aNbNodes[2];
2387 int nl = aNbNodes[3];
2388 int dh = abs(nb-nt);
2389 int dv = abs(nr-nl);
2393 // it is a base case => not shift
2396 // we have to shift on 2
2405 // we have to shift quad on 1
2412 // we have to shift quad on 3
2422 int nbh = Max(nb,nt);
2423 int nbv = Max(nr,nl);
2438 // add some params to right and left after the first param
2445 int nnn = Min(nr,nl);
2450 // step1: create faces for left domain
2452 nbNodes += dl*(nl-1);
2453 nbFaces += dl*(nl-1);
2455 // step2: create faces for right domain
2457 nbNodes += dr*(nr-1);
2458 nbFaces += dr*(nr-1);
2460 // step3: create faces for central domain
2461 nbNodes += (nb-2)*(nnn-1) + (nbv-nnn-1)*(nb-2);
2462 nbFaces += (nb-1)*(nbv-1);
2464 else { // New version (!OldVersion)
2465 nbNodes += (nnn-2)*(nb-2);
2466 nbFaces += (nnn-2)*(nb-1);
2467 int drl = abs(nr-nl);
2468 nbNodes += drl*(nb-1) + addv*nb;
2469 nbFaces += (drl+addv)*(nb-1) + (nt-1);
2470 } // end new version implementation
2472 std::vector<int> aVec(SMDSEntity_Last);
2473 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aVec[i] = 0;
2475 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces;
2476 aVec[SMDSEntity_Node] = nbNodes + nbFaces*4;
2477 if (aNbNodes.size()==5) {
2478 aVec[SMDSEntity_Quad_Triangle] = aNbNodes[3] - 1;
2479 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces - aNbNodes[3] + 1;
2483 aVec[SMDSEntity_Node] = nbNodes;
2484 aVec[SMDSEntity_Quadrangle] = nbFaces;
2485 if (aNbNodes.size()==5) {
2486 aVec[SMDSEntity_Triangle] = aNbNodes[3] - 1;
2487 aVec[SMDSEntity_Quadrangle] = nbFaces - aNbNodes[3] + 1;
2490 SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
2491 aResMap.insert(std::make_pair(sm,aVec));
2496 //=============================================================================
2497 /*! Split quadrangle in to 2 triangles by smallest diagonal
2500 //=============================================================================
2502 void StdMeshers_Quadrangle_2D::splitQuadFace(SMESHDS_Mesh * theMeshDS,
2504 const SMDS_MeshNode* theNode1,
2505 const SMDS_MeshNode* theNode2,
2506 const SMDS_MeshNode* theNode3,
2507 const SMDS_MeshNode* theNode4)
2509 SMDS_MeshFace* face;
2510 if ( SMESH_TNodeXYZ( theNode1 ).SquareDistance( theNode3 ) >
2511 SMESH_TNodeXYZ( theNode2 ).SquareDistance( theNode4 ) )
2513 face = myHelper->AddFace(theNode2, theNode4 , theNode1);
2514 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2515 face = myHelper->AddFace(theNode2, theNode3, theNode4);
2516 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2520 face = myHelper->AddFace(theNode1, theNode2 ,theNode3);
2521 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2522 face = myHelper->AddFace(theNode1, theNode3, theNode4);
2523 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2529 enum uvPos { UV_A0, UV_A1, UV_A2, UV_A3, UV_B, UV_R, UV_T, UV_L, UV_SIZE };
2531 inline SMDS_MeshNode* makeNode( UVPtStruct & uvPt,
2533 FaceQuadStruct::Ptr& quad,
2535 SMESH_MesherHelper* helper,
2536 Handle(Geom_Surface) S)
2538 const vector<UVPtStruct>& uv_eb = quad->side[QUAD_BOTTOM_SIDE].GetUVPtStruct();
2539 const vector<UVPtStruct>& uv_et = quad->side[QUAD_TOP_SIDE ].GetUVPtStruct();
2540 double rBot = ( uv_eb.size() - 1 ) * uvPt.normParam;
2541 double rTop = ( uv_et.size() - 1 ) * uvPt.normParam;
2542 int iBot = int( rBot );
2543 int iTop = int( rTop );
2544 double xBot = uv_eb[ iBot ].normParam + ( rBot - iBot ) * ( uv_eb[ iBot+1 ].normParam - uv_eb[ iBot ].normParam );
2545 double xTop = uv_et[ iTop ].normParam + ( rTop - iTop ) * ( uv_et[ iTop+1 ].normParam - uv_et[ iTop ].normParam );
2546 double x = xBot + y * ( xTop - xBot );
2548 gp_UV uv = calcUV(/*x,y=*/x, y,
2549 /*a0,...=*/UVs[UV_A0], UVs[UV_A1], UVs[UV_A2], UVs[UV_A3],
2550 /*p0=*/quad->side[QUAD_BOTTOM_SIDE].grid->Value2d( x ).XY(),
2552 /*p2=*/quad->side[QUAD_TOP_SIDE ].grid->Value2d( x ).XY(),
2553 /*p3=*/UVs[ UV_L ]);
2554 gp_Pnt P = S->Value( uv.X(), uv.Y() );
2557 return helper->AddNode(P.X(), P.Y(), P.Z(), 0, uv.X(), uv.Y() );
2560 void reduce42( const vector<UVPtStruct>& curr_base,
2561 vector<UVPtStruct>& next_base,
2563 int & next_base_len,
2564 FaceQuadStruct::Ptr& quad,
2567 SMESH_MesherHelper* helper,
2568 Handle(Geom_Surface)& S)
2570 // add one "HH": nodes a,b,c,d,e and faces 1,2,3,4,5,6
2572 // .-----a-----b i + 1
2583 const SMDS_MeshNode*& Na = next_base[ ++next_base_len ].node;
2585 Na = makeNode( next_base[ next_base_len ], y, quad, UVs, helper, S );
2588 const SMDS_MeshNode*& Nb = next_base[ ++next_base_len ].node;
2590 Nb = makeNode( next_base[ next_base_len ], y, quad, UVs, helper, S );
2593 double u = (curr_base[j + 2].u + next_base[next_base_len - 2].u) / 2.0;
2594 double v = (curr_base[j + 2].v + next_base[next_base_len - 2].v) / 2.0;
2595 gp_Pnt P = S->Value(u,v);
2596 SMDS_MeshNode* Nc = helper->AddNode(P.X(), P.Y(), P.Z(), 0, u, v);
2599 u = (curr_base[j + 2].u + next_base[next_base_len - 1].u) / 2.0;
2600 v = (curr_base[j + 2].v + next_base[next_base_len - 1].v) / 2.0;
2602 SMDS_MeshNode* Nd = helper->AddNode(P.X(), P.Y(), P.Z(), 0, u, v);
2605 u = (curr_base[j + 2].u + next_base[next_base_len].u) / 2.0;
2606 v = (curr_base[j + 2].v + next_base[next_base_len].v) / 2.0;
2608 SMDS_MeshNode* Ne = helper->AddNode(P.X(), P.Y(), P.Z(), 0, u, v);
2611 helper->AddFace(curr_base[j + 0].node,
2612 curr_base[j + 1].node, Nc,
2613 next_base[next_base_len - 2].node);
2615 helper->AddFace(curr_base[j + 1].node,
2616 curr_base[j + 2].node, Nd, Nc);
2618 helper->AddFace(curr_base[j + 2].node,
2619 curr_base[j + 3].node, Ne, Nd);
2621 helper->AddFace(curr_base[j + 3].node,
2622 curr_base[j + 4].node, Nb, Ne);
2624 helper->AddFace(Nc, Nd, Na, next_base[next_base_len - 2].node);
2626 helper->AddFace(Nd, Ne, Nb, Na);
2629 void reduce31( const vector<UVPtStruct>& curr_base,
2630 vector<UVPtStruct>& next_base,
2632 int & next_base_len,
2633 FaceQuadStruct::Ptr& quad,
2636 SMESH_MesherHelper* helper,
2637 Handle(Geom_Surface)& S)
2639 // add one "H": nodes b,c,e and faces 1,2,4,5
2641 // .---------b i + 1
2652 const SMDS_MeshNode*& Nb = next_base[ ++next_base_len ].node;
2654 Nb = makeNode( next_base[ next_base_len ], y, quad, UVs, helper, S );
2657 double u1 = (curr_base[ j ].u + next_base[ next_base_len-1 ].u ) / 2.0;
2658 double u2 = (curr_base[ j+3 ].u + next_base[ next_base_len ].u ) / 2.0;
2659 double u3 = (u2 - u1) / 3.0;
2661 double v1 = (curr_base[ j ].v + next_base[ next_base_len-1 ].v ) / 2.0;
2662 double v2 = (curr_base[ j+3 ].v + next_base[ next_base_len ].v ) / 2.0;
2663 double v3 = (v2 - v1) / 3.0;
2667 gp_Pnt P = S->Value(u,v);
2668 SMDS_MeshNode* Nc = helper->AddNode( P.X(), P.Y(), P.Z(), 0, u, v );
2673 SMDS_MeshNode* Ne = helper->AddNode( P.X(), P.Y(), P.Z(), 0, u, v );
2677 helper->AddFace( curr_base[ j + 0 ].node,
2678 curr_base[ j + 1 ].node,
2680 next_base[ next_base_len - 1 ].node);
2682 helper->AddFace( curr_base[ j + 1 ].node,
2683 curr_base[ j + 2 ].node, Ne, Nc);
2685 helper->AddFace( curr_base[ j + 2 ].node,
2686 curr_base[ j + 3 ].node, Nb, Ne);
2688 helper->AddFace(Nc, Ne, Nb,
2689 next_base[ next_base_len - 1 ].node);
2692 typedef void (* PReduceFunction) ( const vector<UVPtStruct>& curr_base,
2693 vector<UVPtStruct>& next_base,
2695 int & next_base_len,
2696 FaceQuadStruct::Ptr & quad,
2699 SMESH_MesherHelper* helper,
2700 Handle(Geom_Surface)& S);
2704 //=======================================================================
2706 * Implementation of Reduced algorithm (meshing with quadrangles only)
2708 //=======================================================================
2710 bool StdMeshers_Quadrangle_2D::computeReduced (SMESH_Mesh & aMesh,
2711 const TopoDS_Face& aFace,
2712 FaceQuadStruct::Ptr quad)
2714 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
2715 Handle(Geom_Surface) S = BRep_Tool::Surface(aFace);
2716 int i,j,geomFaceID = meshDS->ShapeToIndex(aFace);
2718 int nb = quad->side[0].NbPoints(); // bottom
2719 int nr = quad->side[1].NbPoints(); // right
2720 int nt = quad->side[2].NbPoints(); // top
2721 int nl = quad->side[3].NbPoints(); // left
2723 // Simple Reduce 10->8->6->4 (3 steps) Multiple Reduce 10->4 (1 step)
2725 // .-----.-----.-----.-----. .-----.-----.-----.-----.
2726 // | / \ | / \ | | / \ | / \ |
2727 // | / .--.--. \ | | / \ | / \ |
2728 // | / / | \ \ | | / .----.----. \ |
2729 // .---.---.---.---.---.---. | / / \ | / \ \ |
2730 // | / / \ | / \ \ | | / / \ | / \ \ |
2731 // | / / .-.-. \ \ | | / / .---.---. \ \ |
2732 // | / / / | \ \ \ | | / / / \ | / \ \ \ |
2733 // .--.--.--.--.--.--.--.--. | / / / \ | / \ \ \ |
2734 // | / / / \ | / \ \ \ | | / / / .-.-. \ \ \ |
2735 // | / / / .-.-. \ \ \ | | / / / / | \ \ \ \ |
2736 // | / / / / | \ \ \ \ | | / / / / | \ \ \ \ |
2737 // .-.-.-.--.--.--.--.-.-.-. .-.-.-.--.--.--.--.-.-.-.
2739 bool MultipleReduce = false;
2751 else if (nb == nt) {
2752 nr1 = nb; // and == nt
2766 // number of rows and columns
2767 int nrows = nr1 - 1;
2768 int ncol_top = nt1 - 1;
2769 int ncol_bot = nb1 - 1;
2770 // number of rows needed to reduce ncol_bot to ncol_top using simple 3->1 "tree" (see below)
2772 int( ceil( log( double(ncol_bot) / ncol_top) / log( 3.))); // = log x base 3
2773 if ( nrows < nrows_tree31 )
2775 MultipleReduce = true;
2776 error( COMPERR_WARNING,
2777 SMESH_Comment("To use 'Reduced' transition, "
2778 "number of face rows should be at least ")
2779 << nrows_tree31 << ". Actual number of face rows is " << nrows << ". "
2780 "'Quadrangle preference (reversed)' transion has been used.");
2784 if (MultipleReduce) { // == computeQuadPref QUAD_QUADRANGLE_PREF_REVERSED
2785 //==================================================
2786 int dh = abs(nb-nt);
2787 int dv = abs(nr-nl);
2791 // it is a base case => not shift quad but may be replacement is need
2795 // we have to shift quad on 2
2801 // we have to shift quad on 1
2805 // we have to shift quad on 3
2810 nb = quad->side[0].NbPoints();
2811 nr = quad->side[1].NbPoints();
2812 nt = quad->side[2].NbPoints();
2813 nl = quad->side[3].NbPoints();
2816 int nbh = Max(nb,nt);
2817 int nbv = Max(nr,nl);
2830 const vector<UVPtStruct>& uv_eb = quad->side[0].GetUVPtStruct(true,0);
2831 const vector<UVPtStruct>& uv_er = quad->side[1].GetUVPtStruct(false,1);
2832 const vector<UVPtStruct>& uv_et = quad->side[2].GetUVPtStruct(true,1);
2833 const vector<UVPtStruct>& uv_el = quad->side[3].GetUVPtStruct(false,0);
2835 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
2836 return error(COMPERR_BAD_INPUT_MESH);
2838 // arrays for normalized params
2839 TColStd_SequenceOfReal npb, npr, npt, npl;
2840 for (j = 0; j < nb; j++) {
2841 npb.Append(uv_eb[j].normParam);
2843 for (i = 0; i < nr; i++) {
2844 npr.Append(uv_er[i].normParam);
2846 for (j = 0; j < nt; j++) {
2847 npt.Append(uv_et[j].normParam);
2849 for (i = 0; i < nl; i++) {
2850 npl.Append(uv_el[i].normParam);
2854 // orientation of face and 3 main domain for future faces
2860 // left | | | | rigth
2867 // add some params to right and left after the first param
2870 double dpr = (npr.Value(2) - npr.Value(1))/(dr+1);
2871 for (i=1; i<=dr; i++) {
2872 npr.InsertAfter(1,npr.Value(2)-dpr);
2876 dpr = (npl.Value(2) - npl.Value(1))/(dl+1);
2877 for (i=1; i<=dl; i++) {
2878 npl.InsertAfter(1,npl.Value(2)-dpr);
2881 gp_XY a0 (uv_eb.front().u, uv_eb.front().v);
2882 gp_XY a1 (uv_eb.back().u, uv_eb.back().v);
2883 gp_XY a2 (uv_et.back().u, uv_et.back().v);
2884 gp_XY a3 (uv_et.front().u, uv_et.front().v);
2886 int nnn = Min(nr,nl);
2887 // auxilary sequence of XY for creation of nodes
2888 // in the bottom part of central domain
2889 // it's length must be == nbv-nnn-1
2890 TColgp_SequenceOfXY UVL;
2891 TColgp_SequenceOfXY UVR;
2892 //==================================================
2894 // step1: create faces for left domain
2895 StdMeshers_Array2OfNode NodesL(1,dl+1,1,nl);
2897 for (j=1; j<=nl; j++)
2898 NodesL.SetValue(1,j,uv_el[j-1].node);
2901 for (i=1; i<=dl; i++)
2902 NodesL.SetValue(i+1,nl,uv_et[i].node);
2903 // create and add needed nodes
2904 TColgp_SequenceOfXY UVtmp;
2905 for (i=1; i<=dl; i++) {
2906 double x0 = npt.Value(i+1);
2909 double y0 = npl.Value(i+1);
2910 double y1 = npr.Value(i+1);
2911 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2912 gp_Pnt P = S->Value(UV.X(),UV.Y());
2913 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2914 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2915 NodesL.SetValue(i+1,1,N);
2916 if (UVL.Length()<nbv-nnn-1) UVL.Append(UV);
2918 for (j=2; j<nl; j++) {
2919 double y0 = npl.Value(dl+j);
2920 double y1 = npr.Value(dl+j);
2921 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2922 gp_Pnt P = S->Value(UV.X(),UV.Y());
2923 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2924 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2925 NodesL.SetValue(i+1,j,N);
2926 if (i==dl) UVtmp.Append(UV);
2929 for (i=1; i<=UVtmp.Length() && UVL.Length()<nbv-nnn-1; i++) {
2930 UVL.Append(UVtmp.Value(i));
2933 for (i=1; i<=dl; i++) {
2934 for (j=1; j<nl; j++) {
2936 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i+1,j),
2937 NodesL.Value(i+1,j+1), NodesL.Value(i,j+1));
2938 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2943 // fill UVL using c2d
2944 for (i=1; i<npl.Length() && UVL.Length()<nbv-nnn-1; i++) {
2945 UVL.Append(gp_UV (uv_el[i].u, uv_el[i].v));
2949 // step2: create faces for right domain
2950 StdMeshers_Array2OfNode NodesR(1,dr+1,1,nr);
2952 for (j=1; j<=nr; j++)
2953 NodesR.SetValue(1,j,uv_er[nr-j].node);
2956 for (i=1; i<=dr; i++)
2957 NodesR.SetValue(i+1,1,uv_et[nt-1-i].node);
2958 // create and add needed nodes
2959 TColgp_SequenceOfXY UVtmp;
2960 for (i=1; i<=dr; i++) {
2961 double x0 = npt.Value(nt-i);
2964 double y0 = npl.Value(i+1);
2965 double y1 = npr.Value(i+1);
2966 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2967 gp_Pnt P = S->Value(UV.X(),UV.Y());
2968 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2969 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2970 NodesR.SetValue(i+1,nr,N);
2971 if (UVR.Length()<nbv-nnn-1) UVR.Append(UV);
2973 for (j=2; j<nr; j++) {
2974 double y0 = npl.Value(nbv-j+1);
2975 double y1 = npr.Value(nbv-j+1);
2976 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2977 gp_Pnt P = S->Value(UV.X(),UV.Y());
2978 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2979 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2980 NodesR.SetValue(i+1,j,N);
2981 if (i==dr) UVtmp.Prepend(UV);
2984 for (i=1; i<=UVtmp.Length() && UVR.Length()<nbv-nnn-1; i++) {
2985 UVR.Append(UVtmp.Value(i));
2988 for (i=1; i<=dr; i++) {
2989 for (j=1; j<nr; j++) {
2991 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i+1,j),
2992 NodesR.Value(i+1,j+1), NodesR.Value(i,j+1));
2993 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2998 // fill UVR using c2d
2999 for (i=1; i<npr.Length() && UVR.Length()<nbv-nnn-1; i++) {
3000 UVR.Append(gp_UV(uv_er[i].u, uv_er[i].v));
3004 // step3: create faces for central domain
3005 StdMeshers_Array2OfNode NodesC(1,nb,1,nbv);
3006 // add first line using NodesL
3007 for (i=1; i<=dl+1; i++)
3008 NodesC.SetValue(1,i,NodesL(i,1));
3009 for (i=2; i<=nl; i++)
3010 NodesC.SetValue(1,dl+i,NodesL(dl+1,i));
3011 // add last line using NodesR
3012 for (i=1; i<=dr+1; i++)
3013 NodesC.SetValue(nb,i,NodesR(i,nr));
3014 for (i=1; i<nr; i++)
3015 NodesC.SetValue(nb,dr+i+1,NodesR(dr+1,nr-i));
3016 // add top nodes (last columns)
3017 for (i=dl+2; i<nbh-dr; i++)
3018 NodesC.SetValue(i-dl,nbv,uv_et[i-1].node);
3019 // add bottom nodes (first columns)
3020 for (i=2; i<nb; i++)
3021 NodesC.SetValue(i,1,uv_eb[i-1].node);
3023 // create and add needed nodes
3024 // add linear layers
3025 for (i=2; i<nb; i++) {
3026 double x0 = npt.Value(dl+i);
3028 for (j=1; j<nnn; j++) {
3029 double y0 = npl.Value(nbv-nnn+j);
3030 double y1 = npr.Value(nbv-nnn+j);
3031 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
3032 gp_Pnt P = S->Value(UV.X(),UV.Y());
3033 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
3034 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
3035 NodesC.SetValue(i,nbv-nnn+j,N);
3038 // add diagonal layers
3039 for (i=1; i<nbv-nnn; i++) {
3040 double du = UVR.Value(i).X() - UVL.Value(i).X();
3041 double dv = UVR.Value(i).Y() - UVL.Value(i).Y();
3042 for (j=2; j<nb; j++) {
3043 double u = UVL.Value(i).X() + du*npb.Value(j);
3044 double v = UVL.Value(i).Y() + dv*npb.Value(j);
3045 gp_Pnt P = S->Value(u,v);
3046 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
3047 meshDS->SetNodeOnFace(N, geomFaceID, u, v);
3048 NodesC.SetValue(j,i+1,N);
3052 for (i=1; i<nb; i++) {
3053 for (j=1; j<nbv; j++) {
3055 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
3056 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
3057 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
3060 } // end Multiple Reduce implementation
3061 else { // Simple Reduce (!MultipleReduce)
3062 //=========================================================
3065 // it is a base case => not shift quad
3066 //shiftQuad(quad,0,true);
3069 // we have to shift quad on 2
3075 // we have to shift quad on 1
3079 // we have to shift quad on 3
3084 nb = quad->side[0].NbPoints();
3085 nr = quad->side[1].NbPoints();
3086 nt = quad->side[2].NbPoints();
3087 nl = quad->side[3].NbPoints();
3089 // number of rows and columns
3090 int nrows = nr - 1; // and also == nl - 1
3091 int ncol_top = nt - 1;
3092 int ncol_bot = nb - 1;
3093 int npair_top = ncol_top / 2;
3094 // maximum number of bottom elements for "linear" simple reduce 4->2
3095 int max_lin42 = ncol_top + npair_top * 2 * nrows;
3096 // maximum number of bottom elements for "linear" simple reduce 3->1
3097 int max_lin31 = ncol_top + ncol_top * 2 * nrows;
3098 // maximum number of bottom elements for "tree" simple reduce 4->2
3100 // number of rows needed to reduce ncol_bot to ncol_top using simple 4->2 "tree"
3101 int nrows_tree42 = int( log( (double)(ncol_bot / ncol_top) )/log((double)2) ); // needed to avoid overflow at pow(2) while computing max_tree42
3102 if (nrows_tree42 < nrows) {
3103 max_tree42 = npair_top * pow(2.0, nrows + 1);
3104 if ( ncol_top > npair_top * 2 ) {
3105 int delta = ncol_bot - max_tree42;
3106 for (int irow = 1; irow < nrows; irow++) {
3107 int nfour = delta / 4;
3110 if (delta <= (ncol_top - npair_top * 2))
3111 max_tree42 = ncol_bot;
3114 // maximum number of bottom elements for "tree" simple reduce 3->1
3115 //int max_tree31 = ncol_top * pow(3.0, nrows);
3116 bool is_lin_31 = false;
3117 bool is_lin_42 = false;
3118 bool is_tree_31 = false;
3119 bool is_tree_42 = false;
3120 int max_lin = max_lin42;
3121 if (ncol_bot > max_lin42) {
3122 if (ncol_bot <= max_lin31) {
3124 max_lin = max_lin31;
3128 // if ncol_bot is a 3*n or not 2*n
3129 if ((ncol_bot/3)*3 == ncol_bot || (ncol_bot/2)*2 != ncol_bot) {
3131 max_lin = max_lin31;
3137 if (ncol_bot > max_lin) { // not "linear"
3138 is_tree_31 = (ncol_bot > max_tree42);
3139 if (ncol_bot <= max_tree42) {
3140 if ((ncol_bot/3)*3 == ncol_bot || (ncol_bot/2)*2 != ncol_bot) {
3149 const vector<UVPtStruct>& uv_eb = quad->side[0].GetUVPtStruct(true,0);
3150 const vector<UVPtStruct>& uv_er = quad->side[1].GetUVPtStruct(false,1);
3151 const vector<UVPtStruct>& uv_et = quad->side[2].GetUVPtStruct(true,1);
3152 const vector<UVPtStruct>& uv_el = quad->side[3].GetUVPtStruct(false,0);
3154 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
3155 return error(COMPERR_BAD_INPUT_MESH);
3157 myHelper->SetElementsOnShape( true );
3159 gp_UV uv[ UV_SIZE ];
3160 uv[ UV_A0 ].SetCoord( uv_eb.front().u, uv_eb.front().v);
3161 uv[ UV_A1 ].SetCoord( uv_eb.back().u, uv_eb.back().v );
3162 uv[ UV_A2 ].SetCoord( uv_et.back().u, uv_et.back().v );
3163 uv[ UV_A3 ].SetCoord( uv_et.front().u, uv_et.front().v);
3165 vector<UVPtStruct> curr_base = uv_eb, next_base;
3167 UVPtStruct nullUVPtStruct; nullUVPtStruct.node = 0;
3169 int curr_base_len = nb;
3170 int next_base_len = 0;
3173 { // ------------------------------------------------------------------
3174 // New algorithm implemented by request of IPAL22856
3175 // "2D quadrangle mesher of reduced type works wrong"
3176 // http://bugtracker.opencascade.com/show_bug.cgi?id=22856
3178 // the algorithm is following: all reduces are centred in horizontal
3179 // direction and are distributed among all rows
3181 if (ncol_bot > max_tree42) {
3185 if ((ncol_top/3)*3 == ncol_top ) {
3193 const int col_top_size = is_lin_42 ? 2 : 1;
3194 const int col_base_size = is_lin_42 ? 4 : 3;
3196 // Compute nb of "columns" (like in "linear" simple reducing) in all rows
3198 vector<int> nb_col_by_row;
3200 int delta_all = nb - nt;
3201 int delta_one_col = nrows * 2;
3202 int nb_col = delta_all / delta_one_col;
3203 int remainder = delta_all - nb_col * delta_one_col;
3204 if (remainder > 0) {
3207 if ( nb_col * col_top_size >= nt ) // == "tree" reducing situation
3209 // top row is full (all elements reduced), add "columns" one by one
3210 // in rows below until all bottom elements are reduced
3211 nb_col = ( nt - 1 ) / col_top_size;
3212 nb_col_by_row.resize( nrows, nb_col );
3213 int nbrows_not_full = nrows - 1;
3214 int cur_top_size = nt - 1;
3215 remainder = delta_all - nb_col * delta_one_col;
3216 while ( remainder > 0 )
3218 delta_one_col = nbrows_not_full * 2;
3219 int nb_col_add = remainder / delta_one_col;
3220 cur_top_size += 2 * nb_col_by_row[ nbrows_not_full ];
3221 int nb_col_free = cur_top_size / col_top_size - nb_col_by_row[ nbrows_not_full-1 ];
3222 if ( nb_col_add > nb_col_free )
3223 nb_col_add = nb_col_free;
3224 for ( int irow = 0; irow < nbrows_not_full; ++irow )
3225 nb_col_by_row[ irow ] += nb_col_add;
3227 remainder -= nb_col_add * delta_one_col;
3230 else // == "linear" reducing situation
3232 nb_col_by_row.resize( nrows, nb_col );
3234 for ( int irow = remainder / 2; irow < nrows; ++irow )
3235 nb_col_by_row[ irow ]--;
3240 PReduceFunction reduceFunction = & ( is_lin_42 ? reduce42 : reduce31 );
3242 const int reduce_grp_size = is_lin_42 ? 4 : 3;
3244 for (i = 1; i < nr; i++) // layer by layer
3246 nb_col = nb_col_by_row[ i-1 ];
3247 int nb_next = curr_base_len - nb_col * 2;
3248 if (nb_next < nt) nb_next = nt;
3250 const double y = uv_el[ i ].normParam;
3252 if ( i + 1 == nr ) // top
3259 next_base.resize( nb_next, nullUVPtStruct );
3260 next_base.front() = uv_el[i];
3261 next_base.back() = uv_er[i];
3263 // compute normalized param u
3264 double du = 1. / ( nb_next - 1 );
3265 next_base[0].normParam = 0.;
3266 for ( j = 1; j < nb_next; ++j )
3267 next_base[j].normParam = next_base[j-1].normParam + du;
3269 uv[ UV_L ].SetCoord( next_base.front().u, next_base.front().v );
3270 uv[ UV_R ].SetCoord( next_base.back().u, next_base.back().v );
3272 int free_left = ( curr_base_len - 1 - nb_col * col_base_size ) / 2;
3273 int free_middle = curr_base_len - 1 - nb_col * col_base_size - 2 * free_left;
3275 // not reduced left elements
3276 for (j = 0; j < free_left; j++)
3279 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3281 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3283 myHelper->AddFace(curr_base[ j ].node,
3284 curr_base[ j+1 ].node,
3286 next_base[ next_base_len-1 ].node);
3289 for (int icol = 1; icol <= nb_col; icol++)
3292 reduceFunction( curr_base, next_base, j, next_base_len, quad, uv, y, myHelper, S );
3294 j += reduce_grp_size;
3296 // elements in the middle of "columns" added for symmetry
3297 if ( free_middle > 0 && ( nb_col % 2 == 0 ) && icol == nb_col / 2 )
3299 for (int imiddle = 1; imiddle <= free_middle; imiddle++) {
3300 // f (i + 1, j + imiddle)
3301 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3303 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3305 myHelper->AddFace(curr_base[ j-1+imiddle ].node,
3306 curr_base[ j +imiddle ].node,
3308 next_base[ next_base_len-1 ].node);
3314 // not reduced right elements
3315 for (; j < curr_base_len-1; j++) {
3317 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3319 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3321 myHelper->AddFace(curr_base[ j ].node,
3322 curr_base[ j+1 ].node,
3324 next_base[ next_base_len-1 ].node);
3327 curr_base_len = next_base_len + 1;
3329 curr_base.swap( next_base );
3333 else if ( is_tree_42 || is_tree_31 )
3335 // "tree" simple reduce "42": 2->4->8->16->32->...
3337 // .-------------------------------.-------------------------------. nr
3339 // | \ .---------------.---------------. / |
3341 // .---------------.---------------.---------------.---------------.
3342 // | \ | / | \ | / |
3343 // | \ .-------.-------. / | \ .-------.-------. / |
3344 // | | | | | | | | |
3345 // .-------.-------.-------.-------.-------.-------.-------.-------. i
3346 // |\ | /|\ | /|\ | /|\ | /|
3347 // | \.---.---./ | \.---.---./ | \.---.---./ | \.---.---./ |
3348 // | | | | | | | | | | | | | | | | |
3349 // .---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.
3350 // |\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|
3351 // | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. |
3352 // | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
3353 // .-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-. 1
3356 // "tree" simple reduce "31": 1->3->9->27->...
3358 // .-----------------------------------------------------. nr
3360 // | .-----------------. |
3362 // .-----------------.-----------------.-----------------.
3363 // | \ / | \ / | \ / |
3364 // | .-----. | .-----. | .-----. | i
3365 // | | | | | | | | | |
3366 // .-----.-----.-----.-----.-----.-----.-----.-----.-----.
3367 // |\ /|\ /|\ /|\ /|\ /|\ /|\ /|\ /|\ /|
3368 // | .-. | .-. | .-. | .-. | .-. | .-. | .-. | .-. | .-. |
3369 // | | | | | | | | | | | | | | | | | | | | | | | | | | | |
3370 // .-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-. 1
3373 PReduceFunction reduceFunction = & ( is_tree_42 ? reduce42 : reduce31 );
3375 const int reduce_grp_size = is_tree_42 ? 4 : 3;
3377 for (i = 1; i < nr; i++) // layer by layer
3379 // to stop reducing, if number of nodes reaches nt
3380 int delta = curr_base_len - nt;
3382 // to calculate normalized parameter, we must know number of points in next layer
3383 int nb_reduce_groups = (curr_base_len - 1) / reduce_grp_size;
3384 int nb_next = nb_reduce_groups * (reduce_grp_size-2) + (curr_base_len - nb_reduce_groups*reduce_grp_size);
3385 if (nb_next < nt) nb_next = nt;
3387 const double y = uv_el[ i ].normParam;
3389 if ( i + 1 == nr ) // top
3396 next_base.resize( nb_next, nullUVPtStruct );
3397 next_base.front() = uv_el[i];
3398 next_base.back() = uv_er[i];
3400 // compute normalized param u
3401 double du = 1. / ( nb_next - 1 );
3402 next_base[0].normParam = 0.;
3403 for ( j = 1; j < nb_next; ++j )
3404 next_base[j].normParam = next_base[j-1].normParam + du;
3406 uv[ UV_L ].SetCoord( next_base.front().u, next_base.front().v );
3407 uv[ UV_R ].SetCoord( next_base.back().u, next_base.back().v );
3409 for (j = 0; j+reduce_grp_size < curr_base_len && delta > 0; j+=reduce_grp_size, delta-=2)
3411 reduceFunction( curr_base, next_base, j, next_base_len, quad, uv, y, myHelper, S );
3414 // not reduced side elements (if any)
3415 for (; j < curr_base_len-1; j++)
3418 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3420 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3422 myHelper->AddFace(curr_base[ j ].node,
3423 curr_base[ j+1 ].node,
3425 next_base[ next_base_len-1 ].node);
3427 curr_base_len = next_base_len + 1;
3429 curr_base.swap( next_base );
3431 } // end "tree" simple reduce
3433 else if ( is_lin_42 || is_lin_31 ) {
3434 // "linear" simple reduce "31": 2->6->10->14
3436 // .-----------------------------.-----------------------------. nr
3438 // | .---------. | .---------. |
3440 // .---------.---------.---------.---------.---------.---------.
3441 // | / \ / \ | / \ / \ |
3442 // | / .-----. \ | / .-----. \ | i
3443 // | / | | \ | / | | \ |
3444 // .-----.-----.-----.-----.-----.-----.-----.-----.-----.-----.
3445 // | / / \ / \ \ | / / \ / \ \ |
3446 // | / / .-. \ \ | / / .-. \ \ |
3447 // | / / / \ \ \ | / / / \ \ \ |
3448 // .--.----.---.-----.---.-----.-.--.----.---.-----.---.-----.-. 1
3451 // "linear" simple reduce "42": 4->8->12->16
3453 // .---------------.---------------.---------------.---------------. nr
3454 // | \ | / | \ | / |
3455 // | \ .-------.-------. / | \ .-------.-------. / |
3456 // | | | | | | | | |
3457 // .-------.-------.-------.-------.-------.-------.-------.-------.
3458 // | / \ | / \ | / \ | / \ |
3459 // | / \.----.----./ \ | / \.----.----./ \ | i
3460 // | / | | | \ | / | | | \ |
3461 // .-----.----.----.----.----.-----.-----.----.----.----.----.-----.
3462 // | / / \ | / \ \ | / / \ | / \ \ |
3463 // | / / .-.-. \ \ | / / .-.-. \ \ |
3464 // | / / / | \ \ \ | / / / | \ \ \ |
3465 // .---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.---. 1
3468 // nt = 5, nb = 7, nr = 4
3469 //int delta_all = 2;
3470 //int delta_one_col = 6;
3472 //int remainder = 2;
3473 //if (remainder > 0) nb_col++;
3475 //int free_left = 1;
3477 //int free_middle = 4;
3479 int delta_all = nb - nt;
3480 int delta_one_col = (nr - 1) * 2;
3481 int nb_col = delta_all / delta_one_col;
3482 int remainder = delta_all - nb_col * delta_one_col;
3483 if (remainder > 0) {
3486 const int col_top_size = is_lin_42 ? 2 : 1;
3487 int free_left = ((nt - 1) - nb_col * col_top_size) / 2;
3488 free_left += nr - 2;
3489 int free_middle = (nr - 2) * 2;
3490 if (remainder > 0 && nb_col == 1) {
3491 int nb_rows_short_col = remainder / 2;
3492 int nb_rows_thrown = (nr - 1) - nb_rows_short_col;
3493 free_left -= nb_rows_thrown;
3496 // nt = 5, nb = 17, nr = 4
3497 //int delta_all = 12;
3498 //int delta_one_col = 6;
3500 //int remainder = 0;
3501 //int free_left = 2;
3502 //int free_middle = 4;
3504 PReduceFunction reduceFunction = & ( is_lin_42 ? reduce42 : reduce31 );
3506 const int reduce_grp_size = is_lin_42 ? 4 : 3;
3508 for (i = 1; i < nr; i++, free_middle -= 2, free_left -= 1) // layer by layer
3510 // to calculate normalized parameter, we must know number of points in next layer
3511 int nb_next = curr_base_len - nb_col * 2;
3512 if (remainder > 0 && i > remainder / 2)
3513 // take into account short "column"
3515 if (nb_next < nt) nb_next = nt;
3517 const double y = uv_el[ i ].normParam;
3519 if ( i + 1 == nr ) // top
3526 next_base.resize( nb_next, nullUVPtStruct );
3527 next_base.front() = uv_el[i];
3528 next_base.back() = uv_er[i];
3530 // compute normalized param u
3531 double du = 1. / ( nb_next - 1 );
3532 next_base[0].normParam = 0.;
3533 for ( j = 1; j < nb_next; ++j )
3534 next_base[j].normParam = next_base[j-1].normParam + du;
3536 uv[ UV_L ].SetCoord( next_base.front().u, next_base.front().v );
3537 uv[ UV_R ].SetCoord( next_base.back().u, next_base.back().v );
3539 // not reduced left elements
3540 for (j = 0; j < free_left; j++)
3543 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3545 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3547 myHelper->AddFace(curr_base[ j ].node,
3548 curr_base[ j+1 ].node,
3550 next_base[ next_base_len-1 ].node);
3553 for (int icol = 1; icol <= nb_col; icol++) {
3555 if (remainder > 0 && icol == nb_col && i > remainder / 2)
3556 // stop short "column"
3560 reduceFunction( curr_base, next_base, j, next_base_len, quad, uv, y, myHelper, S );
3562 j += reduce_grp_size;
3564 // not reduced middle elements
3565 if (icol < nb_col) {
3566 if (remainder > 0 && icol == nb_col - 1 && i > remainder / 2)
3567 // pass middle elements before stopped short "column"
3570 int free_add = free_middle;
3571 if (remainder > 0 && icol == nb_col - 1)
3572 // next "column" is short
3573 free_add -= (nr - 1) - (remainder / 2);
3575 for (int imiddle = 1; imiddle <= free_add; imiddle++) {
3576 // f (i + 1, j + imiddle)
3577 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3579 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3581 myHelper->AddFace(curr_base[ j-1+imiddle ].node,
3582 curr_base[ j +imiddle ].node,
3584 next_base[ next_base_len-1 ].node);
3590 // not reduced right elements
3591 for (; j < curr_base_len-1; j++) {
3593 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3595 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3597 myHelper->AddFace(curr_base[ j ].node,
3598 curr_base[ j+1 ].node,
3600 next_base[ next_base_len-1 ].node);
3603 curr_base_len = next_base_len + 1;
3605 curr_base.swap( next_base );
3608 } // end "linear" simple reduce
3613 } // end Simple Reduce implementation
3619 //================================================================================
3620 namespace // data for smoothing
3623 // --------------------------------------------------------------------------------
3625 * \brief Structure used to check validity of node position after smoothing.
3626 * It holds two nodes connected to a smoothed node and belonging to
3633 TTriangle( TSmoothNode* n1=0, TSmoothNode* n2=0 ): _n1(n1), _n2(n2) {}
3635 inline bool IsForward( gp_UV uv ) const;
3637 // --------------------------------------------------------------------------------
3639 * \brief Data of a smoothed node
3645 vector< TTriangle > _triangles; // if empty, then node is not movable
3647 // --------------------------------------------------------------------------------
3648 inline bool TTriangle::IsForward( gp_UV uv ) const
3650 gp_Vec2d v1( uv, _n1->_uv ), v2( uv, _n2->_uv );
3656 //================================================================================
3658 * \brief Set UV of nodes on degenerated VERTEXes in the middle of degenerated EDGE
3660 * WARNING: this method must be called AFTER retrieving UVPtStruct's from quad
3662 //================================================================================
3664 void StdMeshers_Quadrangle_2D::updateDegenUV(FaceQuadStruct::Ptr quad)
3668 // Set UV of nodes on degenerated VERTEXes in the middle of degenerated EDGE
3669 // --------------------------------------------------------------------------
3670 for ( unsigned i = 0; i < quad->side.size(); ++i )
3672 const vector<UVPtStruct>& uvVec = quad->side[i].GetUVPtStruct();
3674 // find which end of the side is on degenerated shape
3676 if ( myHelper->IsDegenShape( uvVec[0].node->getshapeId() ))
3678 else if ( myHelper->IsDegenShape( uvVec.back().node->getshapeId() ))
3679 degenInd = uvVec.size() - 1;
3683 // find another side sharing the degenerated shape
3684 bool isPrev = ( degenInd == 0 );
3685 if ( i >= QUAD_TOP_SIDE )
3687 int i2 = ( isPrev ? ( i + 3 ) : ( i + 1 )) % 4;
3688 const vector<UVPtStruct>& uvVec2 = quad->side[ i2 ].GetUVPtStruct();
3690 if ( uvVec[ degenInd ].node == uvVec2.front().node )
3692 else if ( uvVec[ degenInd ].node == uvVec2.back().node )
3693 degenInd2 = uvVec2.size() - 1;
3695 throw SALOME_Exception( LOCALIZED( "Logical error" ));
3697 // move UV in the middle
3698 uvPtStruct& uv1 = const_cast<uvPtStruct&>( uvVec [ degenInd ]);
3699 uvPtStruct& uv2 = const_cast<uvPtStruct&>( uvVec2[ degenInd2 ]);
3700 uv1.u = uv2.u = 0.5 * ( uv1.u + uv2.u );
3701 uv1.v = uv2.v = 0.5 * ( uv1.v + uv2.v );
3704 else if ( quad->side.size() == 4 && myQuadType == QUAD_STANDARD)
3706 // Set number of nodes on a degenerated side to be same as on an opposite side
3707 // ----------------------------------------------------------------------------
3708 for ( unsigned i = 0; i < quad->side.size(); ++i )
3710 StdMeshers_FaceSidePtr degSide = quad->side[i];
3711 if ( !myHelper->IsDegenShape( degSide->EdgeID(0) ))
3713 StdMeshers_FaceSidePtr oppSide = quad->side[( i+2 ) % quad->side.size() ];
3714 if ( degSide->NbSegments() == oppSide->NbSegments() )
3717 // make new side data
3718 const vector<UVPtStruct>& uvVecDegOld = degSide->GetUVPtStruct();
3719 const SMDS_MeshNode* n = uvVecDegOld[0].node;
3720 Handle(Geom2d_Curve) c2d = degSide->Curve2d(0);
3721 double f = degSide->FirstU(0), l = degSide->LastU(0);
3722 gp_Pnt2d p1 = uvVecDegOld.front().UV();
3723 gp_Pnt2d p2 = uvVecDegOld.back().UV();
3725 quad->side[i] = StdMeshers_FaceSide::New( oppSide.get(), n, &p1, &p2, c2d, f, l );
3729 //================================================================================
3731 * \brief Perform smoothing of 2D elements on a FACE with ignored degenerated EDGE
3733 //================================================================================
3735 void StdMeshers_Quadrangle_2D::smooth (FaceQuadStruct::Ptr quad)
3737 if ( !myNeedSmooth ) return;
3739 // Get nodes to smooth
3741 // TODO: do not smooth fixed nodes
3743 typedef map< const SMDS_MeshNode*, TSmoothNode, TIDCompare > TNo2SmooNoMap;
3744 TNo2SmooNoMap smooNoMap;
3746 const TopoDS_Face& geomFace = TopoDS::Face( myHelper->GetSubShape() );
3747 Handle(Geom_Surface) surface = BRep_Tool::Surface( geomFace );
3748 double U1, U2, V1, V2;
3749 surface->Bounds(U1, U2, V1, V2);
3750 GeomAPI_ProjectPointOnSurf proj;
3751 proj.Init( surface, U1, U2, V1, V2, BRep_Tool::Tolerance( geomFace ) );
3753 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
3754 SMESHDS_SubMesh* fSubMesh = meshDS->MeshElements( geomFace );
3755 SMDS_NodeIteratorPtr nIt = fSubMesh->GetNodes();
3756 while ( nIt->more() ) // loop on nodes bound to a FACE
3758 const SMDS_MeshNode* node = nIt->next();
3759 TSmoothNode & sNode = smooNoMap[ node ];
3760 sNode._uv = myHelper->GetNodeUV( geomFace, node );
3761 sNode._xyz = SMESH_TNodeXYZ( node );
3763 // set sNode._triangles
3764 SMDS_ElemIteratorPtr fIt = node->GetInverseElementIterator( SMDSAbs_Face );
3765 while ( fIt->more() )
3767 const SMDS_MeshElement* face = fIt->next();
3768 const int nbN = face->NbCornerNodes();
3769 const int nInd = face->GetNodeIndex( node );
3770 const int prevInd = myHelper->WrapIndex( nInd - 1, nbN );
3771 const int nextInd = myHelper->WrapIndex( nInd + 1, nbN );
3772 const SMDS_MeshNode* prevNode = face->GetNode( prevInd );
3773 const SMDS_MeshNode* nextNode = face->GetNode( nextInd );
3774 sNode._triangles.push_back( TTriangle( & smooNoMap[ prevNode ],
3775 & smooNoMap[ nextNode ]));
3778 // set _uv of smooth nodes on FACE boundary
3779 for ( unsigned i = 0; i < quad->side.size(); ++i )
3781 const vector<UVPtStruct>& uvVec = quad->side[i].GetUVPtStruct();
3782 for ( unsigned j = 0; j < uvVec.size(); ++j )
3784 TSmoothNode & sNode = smooNoMap[ uvVec[j].node ];
3785 sNode._uv = uvVec[j].UV();
3786 sNode._xyz = SMESH_TNodeXYZ( uvVec[j].node );
3790 // define refernce orientation in 2D
3791 TNo2SmooNoMap::iterator n2sn = smooNoMap.begin();
3792 for ( ; n2sn != smooNoMap.end(); ++n2sn )
3793 if ( !n2sn->second._triangles.empty() )
3795 if ( n2sn == smooNoMap.end() ) return;
3796 const TSmoothNode & sampleNode = n2sn->second;
3797 const bool refForward = ( sampleNode._triangles[0].IsForward( sampleNode._uv ));
3801 for ( int iLoop = 0; iLoop < 5; ++iLoop )
3803 for ( n2sn = smooNoMap.begin(); n2sn != smooNoMap.end(); ++n2sn )
3805 TSmoothNode& sNode = n2sn->second;
3806 if ( sNode._triangles.empty() )
3807 continue; // not movable node
3810 bool isValid = false;
3811 bool use3D = ( iLoop > 2 ); // 3 loops in 2D and 2, in 3D
3815 // compute a new XYZ
3816 gp_XYZ newXYZ (0,0,0);
3817 for ( unsigned i = 0; i < sNode._triangles.size(); ++i )
3818 newXYZ += sNode._triangles[i]._n1->_xyz;
3819 newXYZ /= sNode._triangles.size();
3821 // compute a new UV by projection
3822 proj.Perform( newXYZ );
3823 isValid = ( proj.IsDone() && proj.NbPoints() > 0 );
3826 // check validity of the newUV
3827 Quantity_Parameter u,v;
3828 proj.LowerDistanceParameters( u, v );
3829 newUV.SetCoord( u, v );
3830 for ( unsigned i = 0; i < sNode._triangles.size() && isValid; ++i )
3831 isValid = ( sNode._triangles[i].IsForward( newUV ) == refForward );
3836 // compute a new UV by averaging
3837 newUV.SetCoord(0.,0.);
3838 for ( unsigned i = 0; i < sNode._triangles.size(); ++i )
3839 newUV += sNode._triangles[i]._n1->_uv;
3840 newUV /= sNode._triangles.size();
3842 // check validity of the newUV
3844 for ( unsigned i = 0; i < sNode._triangles.size() && isValid; ++i )
3845 isValid = ( sNode._triangles[i].IsForward( newUV ) == refForward );
3850 sNode._xyz = surface->Value( newUV.X(), newUV.Y() ).XYZ();
3855 // Set new XYZ to the smoothed nodes
3857 for ( n2sn = smooNoMap.begin(); n2sn != smooNoMap.end(); ++n2sn )
3859 TSmoothNode& sNode = n2sn->second;
3860 if ( sNode._triangles.empty() )
3861 continue; // not movable node
3863 SMDS_MeshNode* node = const_cast< SMDS_MeshNode*>( n2sn->first );
3864 gp_Pnt xyz = surface->Value( sNode._uv.X(), sNode._uv.Y() );
3865 meshDS->MoveNode( node, xyz.X(), xyz.Y(), xyz.Z() );
3868 node->SetPosition( SMDS_PositionPtr( new SMDS_FacePosition( sNode._uv.X(), sNode._uv.Y() )));
3871 // Move medium nodes in quadratic mesh
3872 if ( _quadraticMesh )
3874 const TLinkNodeMap& links = myHelper->GetTLinkNodeMap();
3875 TLinkNodeMap::const_iterator linkIt = links.begin();
3876 for ( ; linkIt != links.end(); ++linkIt )
3878 const SMESH_TLink& link = linkIt->first;
3879 SMDS_MeshNode* node = const_cast< SMDS_MeshNode*>( linkIt->second );
3881 if ( node->getshapeId() != myHelper->GetSubShapeID() )
3882 continue; // medium node is on EDGE or VERTEX
3884 gp_XY uv1 = myHelper->GetNodeUV( geomFace, link.node1(), node );
3885 gp_XY uv2 = myHelper->GetNodeUV( geomFace, link.node2(), node );
3887 gp_XY uv = myHelper->GetMiddleUV( surface, uv1, uv2 );
3888 node->SetPosition( SMDS_PositionPtr( new SMDS_FacePosition( uv.X(), uv.Y() )));
3890 gp_Pnt xyz = surface->Value( uv.X(), uv.Y() );
3891 meshDS->MoveNode( node, xyz.X(), xyz.Y(), xyz.Z() );
3896 /*//================================================================================
3898 * \brief Finds vertices at the most sharp face corners
3899 * \param [in] theFace - the FACE
3900 * \param [in,out] theWire - the ordered edges of the face. It can be modified to
3901 * have the first VERTEX of the first EDGE in \a vertices
3902 * \param [out] theVertices - the found corner vertices in the order corresponding to
3903 * the order of EDGEs in \a theWire
3904 * \param [out] theNbDegenEdges - nb of degenerated EDGEs in theFace
3905 * \param [in] theConsiderMesh - if \c true, only meshed VERTEXes are considered
3906 * as possible corners
3907 * \return int - number of quad sides found: 0, 3 or 4
3909 //================================================================================
3911 int StdMeshers_Quadrangle_2D::getCorners(const TopoDS_Face& theFace,
3912 SMESH_Mesh & theMesh,
3913 std::list<TopoDS_Edge>& theWire,
3914 std::vector<TopoDS_Vertex>& theVertices,
3915 int & theNbDegenEdges,
3916 const bool theConsiderMesh)
3918 theNbDegenEdges = 0;
3920 SMESH_MesherHelper helper( theMesh );
3922 // sort theVertices by angle
3923 multimap<double, TopoDS_Vertex> vertexByAngle;
3924 TopTools_DataMapOfShapeReal angleByVertex;
3925 TopoDS_Edge prevE = theWire.back();
3926 if ( SMESH_Algo::isDegenerated( prevE ))
3928 list<TopoDS_Edge>::reverse_iterator edge = ++theWire.rbegin();
3929 while ( SMESH_Algo::isDegenerated( *edge ))
3931 if ( edge == theWire.rend() )
3935 list<TopoDS_Edge>::iterator edge = theWire.begin();
3936 for ( ; edge != theWire.end(); ++edge )
3938 if ( SMESH_Algo::isDegenerated( *edge ))
3943 TopoDS_Vertex v = helper.IthVertex( 0, *edge );
3944 if ( !theConsiderMesh || SMESH_Algo::VertexNode( v, helper.GetMeshDS() ))
3946 double angle = SMESH_MesherHelper::GetAngle( prevE, *edge, theFace );
3947 vertexByAngle.insert( make_pair( angle, v ));
3948 angleByVertex.Bind( v, angle );
3953 // find out required nb of corners (3 or 4)
3955 TopoDS_Shape triaVertex = helper.GetMeshDS()->IndexToShape( myTriaVertexID );
3956 if ( !triaVertex.IsNull() &&
3957 triaVertex.ShapeType() == TopAbs_VERTEX &&
3958 helper.IsSubShape( triaVertex, theFace ) &&
3959 ( vertexByAngle.size() != 4 || vertexByAngle.begin()->first < 5 * M_PI/180. ))
3962 triaVertex.Nullify();
3964 // check nb of available corners
3965 if ( nbCorners == 3 )
3967 if ( vertexByAngle.size() < 3 )
3968 return error(COMPERR_BAD_SHAPE,
3969 TComm("Face must have 3 sides but not ") << vertexByAngle.size() );
3973 if ( vertexByAngle.size() == 3 && theNbDegenEdges == 0 )
3975 if ( myTriaVertexID < 1 )
3976 return error(COMPERR_BAD_PARMETERS,
3977 "No Base vertex provided for a trilateral geometrical face");
3979 TComm comment("Invalid Base vertex: ");
3980 comment << myTriaVertexID << " its ID is not among [ ";
3981 multimap<double, TopoDS_Vertex>::iterator a2v = vertexByAngle.begin();
3982 comment << helper.GetMeshDS()->ShapeToIndex( a2v->second ) << ", "; a2v++;
3983 comment << helper.GetMeshDS()->ShapeToIndex( a2v->second ) << ", "; a2v++;
3984 comment << helper.GetMeshDS()->ShapeToIndex( a2v->second ) << " ]";
3985 return error(COMPERR_BAD_PARMETERS, comment );
3987 if ( vertexByAngle.size() + ( theNbDegenEdges > 0 ) < 4 &&
3988 vertexByAngle.size() + theNbDegenEdges != 4 )
3989 return error(COMPERR_BAD_SHAPE,
3990 TComm("Face must have 4 sides but not ") << vertexByAngle.size() );
3993 // put all corner vertices in a map
3994 TopTools_MapOfShape vMap;
3995 if ( nbCorners == 3 )
3996 vMap.Add( triaVertex );
3997 multimap<double, TopoDS_Vertex>::reverse_iterator a2v = vertexByAngle.rbegin();
3998 for ( ; a2v != vertexByAngle.rend() && vMap.Extent() < nbCorners; ++a2v )
3999 vMap.Add( (*a2v).second );
4001 // check if there are possible variations in choosing corners
4002 bool isThereVariants = false;
4003 if ( vertexByAngle.size() > nbCorners )
4005 double lostAngle = a2v->first;
4006 double lastAngle = ( --a2v, a2v->first );
4007 isThereVariants = ( lostAngle * 1.1 >= lastAngle );
4010 // make theWire begin from a corner vertex or triaVertex
4011 if ( nbCorners == 3 )
4012 while ( !triaVertex.IsSame( ( helper.IthVertex( 0, theWire.front() ))) ||
4013 SMESH_Algo::isDegenerated( theWire.front() ))
4014 theWire.splice( theWire.end(), theWire, theWire.begin() );
4016 while ( !vMap.Contains( helper.IthVertex( 0, theWire.front() )) ||
4017 SMESH_Algo::isDegenerated( theWire.front() ))
4018 theWire.splice( theWire.end(), theWire, theWire.begin() );
4020 // fill the result vector and prepare for its refinement
4021 theVertices.clear();
4022 vector< double > angles;
4023 vector< TopoDS_Edge > edgeVec;
4024 vector< int > cornerInd, nbSeg;
4025 angles.reserve( vertexByAngle.size() );
4026 edgeVec.reserve( vertexByAngle.size() );
4027 nbSeg.reserve( vertexByAngle.size() );
4028 cornerInd.reserve( nbCorners );
4029 for ( edge = theWire.begin(); edge != theWire.end(); ++edge )
4031 if ( SMESH_Algo::isDegenerated( *edge ))
4033 TopoDS_Vertex v = helper.IthVertex( 0, *edge );
4034 bool isCorner = vMap.Contains( v );
4037 theVertices.push_back( v );
4038 cornerInd.push_back( angles.size() );
4040 angles.push_back( angleByVertex.IsBound( v ) ? angleByVertex( v ) : -M_PI );
4041 edgeVec.push_back( *edge );
4042 if ( theConsiderMesh && isThereVariants )
4044 if ( SMESHDS_SubMesh* sm = helper.GetMeshDS()->MeshElements( *edge ))
4045 nbSeg.push_back( sm->NbNodes() + 1 );
4047 nbSeg.push_back( 0 );
4051 // refine the result vector - make sides elual by length if
4052 // there are several equal angles
4053 if ( isThereVariants )
4055 if ( nbCorners == 3 )
4056 angles[0] = 2 * M_PI; // not to move the base triangle VERTEX
4058 set< int > refinedCorners;
4059 for ( size_t iC = 0; iC < cornerInd.size(); ++iC )
4061 int iV = cornerInd[iC];
4062 if ( !refinedCorners.insert( iV ).second )
4064 list< int > equalVertices;
4065 equalVertices.push_back( iV );
4066 int nbC[2] = { 0, 0 };
4067 // find equal angles backward and forward from the iV-th corner vertex
4068 for ( int isFwd = 0; isFwd < 2; ++isFwd )
4070 int dV = isFwd ? +1 : -1;
4071 int iCNext = helper.WrapIndex( iC + dV, cornerInd.size() );
4072 int iVNext = helper.WrapIndex( iV + dV, angles.size() );
4073 while ( iVNext != iV )
4075 bool equal = Abs( angles[iV] - angles[iVNext] ) < 0.1 * angles[iV];
4077 equalVertices.insert( isFwd ? equalVertices.end() : equalVertices.begin(), iVNext );
4078 if ( iVNext == cornerInd[ iCNext ])
4083 refinedCorners.insert( cornerInd[ iCNext ] );
4084 iCNext = helper.WrapIndex( iCNext + dV, cornerInd.size() );
4086 iVNext = helper.WrapIndex( iVNext + dV, angles.size() );
4089 // move corners to make sides equal by length
4090 int nbEqualV = equalVertices.size();
4091 int nbExcessV = nbEqualV - ( 1 + nbC[0] + nbC[1] );
4092 if ( nbExcessV > 0 )
4094 // calculate normalized length of each side enclosed between neighbor equalVertices
4095 vector< double > curLengths;
4096 double totalLen = 0;
4097 vector< int > evVec( equalVertices.begin(), equalVertices.end() );
4099 int iE = cornerInd[ helper.WrapIndex( iC - nbC[0] - 1, cornerInd.size() )];
4100 int iEEnd = cornerInd[ helper.WrapIndex( iC + nbC[1] + 1, cornerInd.size() )];
4101 while ( curLengths.size() < nbEqualV + 1 )
4103 curLengths.push_back( totalLen );
4105 curLengths.back() += SMESH_Algo::EdgeLength( edgeVec[ iE ]);
4106 iE = helper.WrapIndex( iE + 1, edgeVec.size());
4107 if ( iEV < evVec.size() && iE == evVec[ iEV++ ] )
4110 while( iE != iEEnd );
4111 totalLen = curLengths.back();
4113 curLengths.resize( equalVertices.size() );
4114 for ( size_t iS = 0; iS < curLengths.size(); ++iS )
4115 curLengths[ iS ] /= totalLen;
4117 // find equalVertices most close to the ideal sub-division of all sides
4119 int iCorner = helper.WrapIndex( iC - nbC[0], cornerInd.size() );
4120 int nbSides = 2 + nbC[0] + nbC[1];
4121 for ( int iS = 1; iS < nbSides; ++iS, ++iBestEV )
4123 double idealLen = iS / double( nbSides );
4124 double d, bestDist = 1.;
4125 for ( iEV = iBestEV; iEV < curLengths.size(); ++iEV )
4126 if (( d = Abs( idealLen - curLengths[ iEV ])) < bestDist )
4131 if ( iBestEV > iS-1 + nbExcessV )
4132 iBestEV = iS-1 + nbExcessV;
4133 theVertices[ iCorner ] = helper.IthVertex( 0, edgeVec[ evVec[ iBestEV ]]);
4134 iCorner = helper.WrapIndex( iCorner + 1, cornerInd.size() );
4143 //================================================================================
4145 * \brief Constructor of a side of quad
4147 //================================================================================
4149 FaceQuadStruct::Side::Side(StdMeshers_FaceSidePtr theGrid)
4150 : grid(theGrid), nbNodeOut(0), from(0), to(theGrid ? theGrid->NbPoints() : 0 ), di(1)
4154 //=============================================================================
4156 * \brief Constructor of a quad
4158 //=============================================================================
4160 FaceQuadStruct::FaceQuadStruct(const TopoDS_Face& F, const std::string& theName)
4161 : face( F ), name( theName )
4166 //================================================================================
4168 * \brief Fills myForcedPnts
4170 //================================================================================
4172 bool StdMeshers_Quadrangle_2D::getEnforcedUV()
4174 myForcedPnts.clear();
4175 if ( !myParams ) return true; // missing hypothesis
4177 std::vector< TopoDS_Shape > shapes;
4178 std::vector< gp_Pnt > points;
4179 myParams->GetEnforcedNodes( shapes, points );
4181 TopTools_IndexedMapOfShape vMap;
4182 for ( size_t i = 0; i < shapes.size(); ++i )
4183 if ( !shapes[i].IsNull() )
4184 TopExp::MapShapes( shapes[i], TopAbs_VERTEX, vMap );
4186 size_t nbPoints = points.size();
4187 for ( int i = 1; i <= vMap.Extent(); ++i )
4188 points.push_back( BRep_Tool::Pnt( TopoDS::Vertex( vMap( i ))));
4190 // find out if all points must be in the FACE, which is so if
4191 // myParams is a local hypothesis on the FACE being meshed
4192 bool isStrictCheck = false;
4194 SMESH_HypoFilter paramFilter( SMESH_HypoFilter::Is( myParams ));
4195 TopoDS_Shape assignedTo;
4196 if ( myHelper->GetMesh()->GetHypothesis( myHelper->GetSubShape(),
4200 isStrictCheck = ( assignedTo.IsSame( myHelper->GetSubShape() ));
4203 multimap< double, ForcedPoint > sortedFP; // sort points by distance from EDGEs
4205 Standard_Real u1,u2,v1,v2;
4206 const TopoDS_Face& face = TopoDS::Face( myHelper->GetSubShape() );
4207 const double tol = BRep_Tool::Tolerance( face );
4208 Handle(Geom_Surface) surf = BRep_Tool::Surface( face );
4209 surf->Bounds( u1,u2,v1,v2 );
4210 GeomAPI_ProjectPointOnSurf project;
4211 project.Init(surf, u1,u2, v1,v2, tol );
4213 BRepBndLib::Add( face, bbox );
4214 double farTol = 0.01 * sqrt( bbox.SquareExtent() );
4216 for ( size_t iP = 0; iP < points.size(); ++iP )
4218 project.Perform( points[ iP ]);
4219 if ( !project.IsDone() )
4221 if ( isStrictCheck && iP < nbPoints )
4223 (TComm("Projection of an enforced point to the face failed - (")
4224 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4227 if ( project.LowerDistance() > farTol )
4229 if ( isStrictCheck && iP < nbPoints )
4231 (COMPERR_BAD_PARMETERS, TComm("An enforced point is too far from the face, dist = ")
4232 << project.LowerDistance() << " - ("
4233 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4236 Quantity_Parameter u, v;
4237 project.LowerDistanceParameters(u, v);
4238 gp_Pnt2d uv( u, v );
4239 BRepClass_FaceClassifier clsf ( face, uv, tol );
4240 switch ( clsf.State() ) {
4243 double edgeDist = ( Min( Abs( u - u1 ), Abs( u - u2 )) +
4244 Min( Abs( v - v1 ), Abs( v - v2 )));
4247 fp.xyz = points[ iP ].XYZ();
4248 if ( iP >= nbPoints )
4249 fp.vertex = TopoDS::Vertex( vMap( iP - nbPoints + 1 ));
4251 sortedFP.insert( make_pair( edgeDist, fp ));
4256 if ( isStrictCheck && iP < nbPoints )
4258 (COMPERR_BAD_PARMETERS, TComm("An enforced point is out of the face boundary - ")
4259 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4264 if ( isStrictCheck && iP < nbPoints )
4266 (COMPERR_BAD_PARMETERS, TComm("An enforced point is on the face boundary - ")
4267 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4272 if ( isStrictCheck && iP < nbPoints )
4274 (TComm("Classification of an enforced point ralative to the face boundary failed - ")
4275 << points[ iP ].X() << ", "<< points[ iP ].Y() << ", "<< points[ iP ].Z() << " )");
4280 multimap< double, ForcedPoint >::iterator d2uv = sortedFP.begin();
4281 for ( ; d2uv != sortedFP.end(); ++d2uv )
4282 myForcedPnts.push_back( (*d2uv).second );
4287 //================================================================================
4289 * \brief Splits quads by adding points of enforced nodes and create nodes on
4290 * the sides shared by quads
4292 //================================================================================
4294 bool StdMeshers_Quadrangle_2D::addEnforcedNodes()
4296 // if ( myForcedPnts.empty() )
4299 // make a map of quads sharing a side
4300 map< StdMeshers_FaceSidePtr, vector< FaceQuadStruct::Ptr > > quadsBySide;
4301 list< FaceQuadStruct::Ptr >::iterator quadIt = myQuadList.begin();
4302 for ( ; quadIt != myQuadList.end(); ++quadIt )
4303 for ( size_t iSide = 0; iSide < (*quadIt)->side.size(); ++iSide )
4305 if ( !setNormalizedGrid( *quadIt ))
4307 quadsBySide[ (*quadIt)->side[iSide] ].push_back( *quadIt );
4310 SMESH_Mesh* mesh = myHelper->GetMesh();
4311 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
4312 const TopoDS_Face& face = TopoDS::Face( myHelper->GetSubShape() );
4313 Handle(Geom_Surface) surf = BRep_Tool::Surface( face );
4315 for ( size_t iFP = 0; iFP < myForcedPnts.size(); ++iFP )
4317 bool isNodeEnforced = false;
4319 // look for a quad enclosing a enforced point
4320 for ( quadIt = myQuadList.begin(); quadIt != myQuadList.end(); ++quadIt )
4322 FaceQuadStruct::Ptr quad = *quadIt;
4323 if ( !setNormalizedGrid( *quadIt ))
4326 if ( !quad->findCell( myForcedPnts[ iFP ], i, j ))
4329 // a grid cell is found, select a node of the cell to move
4330 // to the enforced point to and to split the quad at
4331 multimap< double, pair< int, int > > ijByDist;
4332 for ( int di = 0; di < 2; ++di )
4333 for ( int dj = 0; dj < 2; ++dj )
4335 double dist2 = ( myForcedPnts[ iFP ].uv - quad->UVPt( i+di,j+dj ).UV() ).SquareModulus();
4336 ijByDist.insert( make_pair( dist2, make_pair( di,dj )));
4338 // try all nodes starting from the closest one
4339 set< FaceQuadStruct::Ptr > changedQuads;
4340 multimap< double, pair< int, int > >::iterator d2ij = ijByDist.begin();
4341 for ( ; !isNodeEnforced && d2ij != ijByDist.end(); ++d2ij )
4343 int di = d2ij->second.first;
4344 int dj = d2ij->second.second;
4346 // check if a node is at a side
4348 if ( dj== 0 && j == 0 )
4349 iSide = QUAD_BOTTOM_SIDE;
4350 else if ( dj == 1 && j+2 == quad->jSize )
4351 iSide = QUAD_TOP_SIDE;
4352 else if ( di == 0 && i == 0 )
4353 iSide = QUAD_LEFT_SIDE;
4354 else if ( di == 1 && i+2 == quad->iSize )
4355 iSide = QUAD_RIGHT_SIDE;
4357 if ( iSide > -1 ) // ----- node is at a side
4359 FaceQuadStruct::Side& side = quad->side[ iSide ];
4360 // check if this node can be moved
4361 if ( quadsBySide[ side ].size() < 2 )
4362 continue; // its a face boundary -> can't move the node
4364 int quadNodeIndex = ( iSide % 2 ) ? j : i;
4365 int sideNodeIndex = side.ToSideIndex( quadNodeIndex );
4366 if ( side.IsForced( sideNodeIndex ))
4368 // the node is already moved to another enforced point
4369 isNodeEnforced = quad->isEqual( myForcedPnts[ iFP ], i, j );
4372 // make a node of a side forced
4373 vector<UVPtStruct>& points = (vector<UVPtStruct>&) side.GetUVPtStruct();
4374 points[ sideNodeIndex ].u = myForcedPnts[ iFP ].U();
4375 points[ sideNodeIndex ].v = myForcedPnts[ iFP ].V();
4377 updateSideUV( side, sideNodeIndex, quadsBySide );
4379 // update adjacent sides
4380 set< StdMeshers_FaceSidePtr > updatedSides;
4381 updatedSides.insert( side );
4382 for ( size_t i = 0; i < side.contacts.size(); ++i )
4383 if ( side.contacts[i].point == sideNodeIndex )
4385 const vector< FaceQuadStruct::Ptr >& adjQuads =
4386 quadsBySide[ *side.contacts[i].other_side ];
4387 if ( adjQuads.size() > 1 &&
4388 updatedSides.insert( * side.contacts[i].other_side ).second )
4390 updateSideUV( *side.contacts[i].other_side,
4391 side.contacts[i].other_point,
4394 changedQuads.insert( adjQuads.begin(), adjQuads.end() );
4396 const vector< FaceQuadStruct::Ptr >& adjQuads = quadsBySide[ side ];
4397 changedQuads.insert( adjQuads.begin(), adjQuads.end() );
4399 isNodeEnforced = true;
4401 else // ------------------ node is inside the quad
4405 // make a new side passing through IJ node and split the quad
4406 int indForced, iNewSide;
4407 if ( quad->iSize < quad->jSize ) // split vertically
4409 quad->updateUV( myForcedPnts[ iFP ].uv, i, j, /*isVert=*/true );
4411 iNewSide = splitQuad( quad, i, 0 );
4415 quad->updateUV( myForcedPnts[ iFP ].uv, i, j, /*isVert=*/false );
4417 iNewSide = splitQuad( quad, 0, j );
4419 FaceQuadStruct::Ptr newQuad = myQuadList.back();
4420 FaceQuadStruct::Side& newSide = newQuad->side[ iNewSide ];
4422 newSide.forced_nodes.insert( indForced );
4423 quad->side[( iNewSide+2 ) % 4 ].forced_nodes.insert( indForced );
4425 quadsBySide[ newSide ].push_back( quad );
4426 quadsBySide[ newQuad->side[0] ].push_back( newQuad );
4427 quadsBySide[ newQuad->side[1] ].push_back( newQuad );
4428 quadsBySide[ newQuad->side[2] ].push_back( newQuad );
4429 quadsBySide[ newQuad->side[3] ].push_back( newQuad );
4431 isNodeEnforced = true;
4433 } // end of "node is inside the quad"
4435 } // loop on nodes of the cell
4437 // remove out-of-date uv grid of changedQuads
4438 set< FaceQuadStruct::Ptr >::iterator qIt = changedQuads.begin();
4439 for ( ; qIt != changedQuads.end(); ++qIt )
4440 (*qIt)->uv_grid.clear();
4442 if ( isNodeEnforced )
4447 if ( !isNodeEnforced )
4449 if ( !myForcedPnts[ iFP ].vertex.IsNull() )
4450 return error(TComm("Unable to move any node to vertex #")
4451 <<myHelper->GetMeshDS()->ShapeToIndex( myForcedPnts[ iFP ].vertex ));
4453 return error(TComm("Unable to move any node to point ( ")
4454 << myForcedPnts[iFP].xyz.X() << ", "
4455 << myForcedPnts[iFP].xyz.Y() << ", "
4456 << myForcedPnts[iFP].xyz.Z() << " )");
4459 } // loop on enforced points
4461 // Compute nodes on all sides, where not yet present
4463 for ( quadIt = myQuadList.begin(); quadIt != myQuadList.end(); ++quadIt )
4465 FaceQuadStruct::Ptr quad = *quadIt;
4466 for ( int iSide = 0; iSide < 4; ++iSide )
4468 FaceQuadStruct::Side & side = quad->side[ iSide ];
4469 if ( side.nbNodeOut > 0 )
4470 continue; // emulated side
4471 vector< FaceQuadStruct::Ptr >& quadVec = quadsBySide[ side ];
4472 if ( quadVec.size() <= 1 )
4473 continue; // outer side
4475 bool missedNodesOnSide = false;
4476 const vector<UVPtStruct>& points = side.grid->GetUVPtStruct();
4477 for ( size_t iC = 0; iC < side.contacts.size(); ++iC )
4479 const vector<UVPtStruct>& oGrid = side.contacts[iC].other_side->grid->GetUVPtStruct();
4480 const UVPtStruct& uvPt = points[ side.contacts[iC].point ];
4481 if ( side.contacts[iC].other_point >= oGrid.size() ||
4482 side.contacts[iC].point >= points.size() )
4483 throw SALOME_Exception( "StdMeshers_Quadrangle_2D::addEnforcedNodes(): wrong contact" );
4484 if ( oGrid[ side.contacts[iC].other_point ].node )
4485 (( UVPtStruct& ) uvPt).node = oGrid[ side.contacts[iC].other_point ].node;
4487 for ( size_t iP = 0; iP < points.size(); ++iP )
4488 if ( !points[ iP ].node )
4490 UVPtStruct& uvPnt = ( UVPtStruct& ) points[ iP ];
4491 gp_Pnt P = surf->Value( uvPnt.u, uvPnt.v );
4492 uvPnt.node = meshDS->AddNode(P.X(), P.Y(), P.Z());
4493 meshDS->SetNodeOnFace( uvPnt.node, myHelper->GetSubShapeID(), uvPnt.u, uvPnt.v );
4494 missedNodesOnSide = true;
4496 if ( missedNodesOnSide )
4498 // clear uv_grid where nodes are missing
4499 for ( size_t iQ = 0; iQ < quadVec.size(); ++iQ )
4500 quadVec[ iQ ]->uv_grid.clear();
4508 //================================================================================
4510 * \brief Splits a quad at I or J. Returns an index of a new side in the new quad
4512 //================================================================================
4514 int StdMeshers_Quadrangle_2D::splitQuad(FaceQuadStruct::Ptr quad, int I, int J)
4516 FaceQuadStruct* newQuad = new FaceQuadStruct( quad->face );
4517 myQuadList.push_back( FaceQuadStruct::Ptr( newQuad ));
4519 vector<UVPtStruct> points;
4522 points.reserve( quad->jSize );
4523 for ( int jP = 0; jP < quad->jSize; ++jP )
4524 points.push_back( quad->UVPt( I, jP ));
4526 newQuad->side.resize( 4 );
4527 newQuad->side[ QUAD_BOTTOM_SIDE ] = quad->side[ QUAD_BOTTOM_SIDE ];
4528 newQuad->side[ QUAD_RIGHT_SIDE ] = quad->side[ QUAD_RIGHT_SIDE ];
4529 newQuad->side[ QUAD_TOP_SIDE ] = quad->side[ QUAD_TOP_SIDE ];
4530 newQuad->side[ QUAD_LEFT_SIDE ] = StdMeshers_FaceSide::New( points, quad->face );
4532 FaceQuadStruct::Side& newSide = newQuad->side[ QUAD_LEFT_SIDE ];
4533 FaceQuadStruct::Side& newSide2 = quad->side [ QUAD_RIGHT_SIDE ];
4535 quad->side[ QUAD_RIGHT_SIDE ] = newSide;
4537 int iBot = quad->side[ QUAD_BOTTOM_SIDE ].ToSideIndex( I );
4538 int iTop = quad->side[ QUAD_TOP_SIDE ].ToSideIndex( I );
4540 newSide.AddContact ( 0, & quad->side[ QUAD_BOTTOM_SIDE ], iBot );
4541 newSide2.AddContact( 0, & quad->side[ QUAD_BOTTOM_SIDE ], iBot );
4542 newSide.AddContact ( quad->jSize - 1, & quad->side[ QUAD_TOP_SIDE ], iTop );
4543 newSide2.AddContact( quad->jSize - 1, & quad->side[ QUAD_TOP_SIDE ], iTop );
4544 // cout << "Contact: L " << &newSide << " "<< newSide.NbPoints()
4545 // << " R " << &newSide2 << " "<< newSide2.NbPoints()
4546 // << " B " << &quad->side[ QUAD_BOTTOM_SIDE ] << " "<< quad->side[ QUAD_BOTTOM_SIDE].NbPoints()
4547 // << " T " << &quad->side[ QUAD_TOP_SIDE ] << " "<< quad->side[ QUAD_TOP_SIDE].NbPoints()<< endl;
4549 newQuad->side[ QUAD_BOTTOM_SIDE ].from = iBot;
4550 newQuad->side[ QUAD_TOP_SIDE ].from = iTop;
4551 newQuad->name = ( TComm("Right of I=") << I );
4553 quad->side[ QUAD_BOTTOM_SIDE ].to = iBot + 1;
4554 quad->side[ QUAD_TOP_SIDE ].to = iTop + 1;
4555 quad->uv_grid.clear();
4557 return QUAD_LEFT_SIDE;
4559 else if ( J > 0 ) //// split horizontally, a new quad is below an old one
4561 points.reserve( quad->iSize );
4562 for ( int iP = 0; iP < quad->iSize; ++iP )
4563 points.push_back( quad->UVPt( iP, J ));
4565 newQuad->side.resize( 4 );
4566 newQuad->side[ QUAD_BOTTOM_SIDE ] = quad->side[ QUAD_BOTTOM_SIDE ];
4567 newQuad->side[ QUAD_RIGHT_SIDE ] = quad->side[ QUAD_RIGHT_SIDE ];
4568 newQuad->side[ QUAD_TOP_SIDE ] = StdMeshers_FaceSide::New( points, quad->face );
4569 newQuad->side[ QUAD_LEFT_SIDE ] = quad->side[ QUAD_LEFT_SIDE ];
4571 FaceQuadStruct::Side& newSide = newQuad->side[ QUAD_TOP_SIDE ];
4572 FaceQuadStruct::Side& newSide2 = quad->side [ QUAD_BOTTOM_SIDE ];
4574 quad->side[ QUAD_BOTTOM_SIDE ] = newSide;
4576 int iLft = quad->side[ QUAD_LEFT_SIDE ].ToSideIndex( J );
4577 int iRgt = quad->side[ QUAD_RIGHT_SIDE ].ToSideIndex( J );
4579 newSide.AddContact ( 0, & quad->side[ QUAD_LEFT_SIDE ], iLft );
4580 newSide2.AddContact( 0, & quad->side[ QUAD_LEFT_SIDE ], iLft );
4581 newSide.AddContact ( quad->iSize - 1, & quad->side[ QUAD_RIGHT_SIDE ], iRgt );
4582 newSide2.AddContact( quad->iSize - 1, & quad->side[ QUAD_RIGHT_SIDE ], iRgt );
4583 // cout << "Contact: T " << &newSide << " "<< newSide.NbPoints()
4584 // << " B " << &newSide2 << " "<< newSide2.NbPoints()
4585 // << " L " << &quad->side[ QUAD_LEFT_SIDE ] << " "<< quad->side[ QUAD_LEFT_SIDE].NbPoints()
4586 // << " R " << &quad->side[ QUAD_RIGHT_SIDE ] << " "<< quad->side[ QUAD_RIGHT_SIDE].NbPoints()<< endl;
4588 newQuad->side[ QUAD_RIGHT_SIDE ].to = iRgt+1;
4589 newQuad->side[ QUAD_LEFT_SIDE ].to = iLft+1;
4590 newQuad->name = ( TComm("Below J=") << J );
4592 quad->side[ QUAD_RIGHT_SIDE ].from = iRgt;
4593 quad->side[ QUAD_LEFT_SIDE ].from = iLft;
4594 quad->uv_grid.clear();
4596 return QUAD_TOP_SIDE;
4600 //================================================================================
4602 * \brief Updates UV of a side after moving its node
4604 //================================================================================
4606 void StdMeshers_Quadrangle_2D::updateSideUV( FaceQuadStruct::Side& side,
4608 const TQuadsBySide& quadsBySide,
4613 side.forced_nodes.insert( iForced );
4615 // update parts of the side before and after iForced
4617 set<int>::iterator iIt = side.forced_nodes.upper_bound( iForced );
4618 int iEnd = Min( side.NbPoints()-1, ( iIt == side.forced_nodes.end() ) ? int(1e7) : *iIt );
4619 if ( iForced + 1 < iEnd )
4620 updateSideUV( side, iForced, quadsBySide, &iEnd );
4622 iIt = side.forced_nodes.lower_bound( iForced );
4623 int iBeg = Max( 0, ( iIt == side.forced_nodes.begin() ) ? 0 : *--iIt );
4624 if ( iForced - 1 > iBeg )
4625 updateSideUV( side, iForced, quadsBySide, &iBeg );
4630 const int iFrom = Min ( iForced, *iNext );
4631 const int iTo = Max ( iForced, *iNext ) + 1;
4632 const int sideSize = iTo - iFrom;
4634 vector<UVPtStruct> points[4]; // side points of a temporary quad
4636 // from the quads get grid points adjacent to the side
4637 // to make two sides of a temporary quad
4638 vector< FaceQuadStruct::Ptr > quads = quadsBySide.find( side )->second; // copy!
4639 for ( int is2nd = 0; is2nd < 2; ++is2nd )
4641 points[ is2nd ].reserve( sideSize );
4643 while ( points[is2nd].size() < sideSize )
4645 int iCur = iFrom + points[is2nd].size() - int( !points[is2nd].empty() );
4647 // look for a quad adjacent to iCur-th point of the side
4648 for ( size_t iQ = 0; iQ < quads.size(); ++iQ )
4650 FaceQuadStruct::Ptr q = quads[ iQ ];
4654 for ( iS = 0; iS < q->side.size(); ++iS )
4655 if ( side.grid == q->side[ iS ].grid )
4658 if ( !q->side[ iS ].IsReversed() )
4659 isOut = ( q->side[ iS ].from > iCur || q->side[ iS ].to-1 <= iCur );
4661 isOut = ( q->side[ iS ].to >= iCur || q->side[ iS ].from <= iCur );
4664 if ( !setNormalizedGrid( q ))
4667 // found - copy points
4669 if ( iS % 2 ) // right or left
4671 i = ( iS == QUAD_LEFT_SIDE ) ? 1 : q->iSize-2;
4672 j = q->side[ iS ].ToQuadIndex( iCur );
4674 dj = ( q->side[ iS ].IsReversed() ) ? -1 : +1;
4675 nb = ( q->side[ iS ].IsReversed() ) ? j+1 : q->jSize-j;
4677 else // bottom or top
4679 i = q->side[ iS ].ToQuadIndex( iCur );
4680 j = ( iS == QUAD_BOTTOM_SIDE ) ? 1 : q->jSize-2;
4681 di = ( q->side[ iS ].IsReversed() ) ? -1 : +1;
4683 nb = ( q->side[ iS ].IsReversed() ) ? i+1 : q->iSize-i;
4685 if ( !points[is2nd].empty() )
4687 gp_UV lastUV = points[is2nd].back().UV();
4688 gp_UV quadUV = q->UVPt( i, j ).UV();
4689 if ( ( lastUV - quadUV ).SquareModulus() > 1e-10 )
4690 continue; // quad is on the other side of the side
4691 i += di; j += dj; --nb;
4693 for ( ; nb > 0 ; --nb )
4695 points[ is2nd ].push_back( q->UVPt( i, j ));
4696 if ( points[is2nd].size() >= sideSize )
4700 quads[ iQ ].reset(); // not to use this quad anymore
4702 if ( points[is2nd].size() >= sideSize )
4706 if ( nbLoops++ > quads.size() )
4707 throw SALOME_Exception( "StdMeshers_Quadrangle_2D::updateSideUV() bug: infinite loop" );
4709 } // while ( points[is2nd].size() < sideSize )
4710 } // two loops to fill points[0] and points[1]
4712 // points for other pair of opposite sides of the temporary quad
4714 enum { L,R,B,T }; // side index of points[]
4716 points[B].push_back( points[L].front() );
4717 points[B].push_back( side.GetUVPtStruct()[ iFrom ]);
4718 points[B].push_back( points[R].front() );
4720 points[T].push_back( points[L].back() );
4721 points[T].push_back( side.GetUVPtStruct()[ iTo-1 ]);
4722 points[T].push_back( points[R].back() );
4724 // make the temporary quad
4725 FaceQuadStruct::Ptr tmpQuad
4726 ( new FaceQuadStruct( TopoDS::Face( myHelper->GetSubShape() ), "tmpQuad"));
4727 tmpQuad->side.push_back( StdMeshers_FaceSide::New( points[B] )); // bottom
4728 tmpQuad->side.push_back( StdMeshers_FaceSide::New( points[R] )); // right
4729 tmpQuad->side.push_back( StdMeshers_FaceSide::New( points[T] ));
4730 tmpQuad->side.push_back( StdMeshers_FaceSide::New( points[L] ));
4732 // compute new UV of the side
4733 setNormalizedGrid( tmpQuad );
4734 gp_UV uv = tmpQuad->UVPt(1,0).UV();
4735 tmpQuad->updateUV( uv, 1,0, /*isVertical=*/true );
4737 // update UV of the side
4738 vector<UVPtStruct>& sidePoints = (vector<UVPtStruct>&) side.GetUVPtStruct();
4739 for ( int i = iFrom; i < iTo; ++i )
4741 const uvPtStruct& uvPt = tmpQuad->UVPt( 1, i-iFrom );
4742 sidePoints[ i ].u = uvPt.u;
4743 sidePoints[ i ].v = uvPt.v;
4747 //================================================================================
4749 * \brief Finds indices of a grid quad enclosing the given enforced UV
4751 //================================================================================
4753 bool FaceQuadStruct::findCell( const gp_XY& UV, int & I, int & J )
4755 // setNormalizedGrid() must be called before!
4756 if ( uv_box.IsOut( UV ))
4759 // find an approximate position
4760 double x = 0.5, y = 0.5;
4761 gp_XY t0 = UVPt( iSize - 1, 0 ).UV();
4762 gp_XY t1 = UVPt( 0, jSize - 1 ).UV();
4763 gp_XY t2 = UVPt( 0, 0 ).UV();
4764 SMESH_MeshAlgos::GetBarycentricCoords( UV, t0, t1, t2, x, y );
4765 x = Min( 1., Max( 0., x ));
4766 y = Min( 1., Max( 0., y ));
4768 // precise the position
4769 normPa2IJ( x,y, I,J );
4770 if ( !isNear( UV, I,J ))
4772 // look for the most close IJ by traversing uv_grid in the middle
4773 double dist2, minDist2 = ( UV - UVPt( I,J ).UV() ).SquareModulus();
4774 for ( int isU = 0; isU < 2; ++isU )
4776 int ind1 = isU ? 0 : iSize / 2;
4777 int ind2 = isU ? jSize / 2 : 0;
4778 int di1 = isU ? Max( 2, iSize / 20 ) : 0;
4779 int di2 = isU ? 0 : Max( 2, jSize / 20 );
4780 int i,nb = isU ? iSize / di1 : jSize / di2;
4781 for ( i = 0; i < nb; ++i, ind1 += di1, ind2 += di2 )
4782 if (( dist2 = ( UV - UVPt( ind1,ind2 ).UV() ).SquareModulus() ) < minDist2 )
4786 if ( isNear( UV, I,J ))
4788 minDist2 = ( UV - UVPt( I,J ).UV() ).SquareModulus();
4791 if ( !isNear( UV, I,J, Max( iSize, jSize ) /2 ))
4797 //================================================================================
4799 * \brief Find indices (i,j) of a point in uv_grid by normalized parameters (x,y)
4801 //================================================================================
4803 void FaceQuadStruct::normPa2IJ(double X, double Y, int & I, int & J )
4806 I = Min( int ( iSize * X ), iSize - 2 );
4807 J = Min( int ( jSize * Y ), jSize - 2 );
4813 while ( X <= UVPt( I,J ).x && I != 0 )
4815 while ( X > UVPt( I+1,J ).x && I+2 < iSize )
4817 while ( Y <= UVPt( I,J ).y && J != 0 )
4819 while ( Y > UVPt( I,J+1 ).y && J+2 < jSize )
4821 } while ( oldI != I || oldJ != J );
4824 //================================================================================
4826 * \brief Looks for UV in quads around a given (I,J) and precise (I,J)
4828 //================================================================================
4830 bool FaceQuadStruct::isNear( const gp_XY& UV, int & I, int & J, int nbLoops )
4832 if ( I+1 >= iSize ) I = iSize - 2;
4833 if ( J+1 >= jSize ) J = jSize - 2;
4836 gp_XY uvI, uvJ, uv0, uv1;
4837 for ( int iLoop = 0; iLoop < nbLoops; ++iLoop )
4839 int oldI = I, oldJ = J;
4841 uvI = UVPt( I+1, J ).UV();
4842 uvJ = UVPt( I, J+1 ).UV();
4843 uv0 = UVPt( I, J ).UV();
4844 SMESH_MeshAlgos::GetBarycentricCoords( UV, uvI, uvJ, uv0, bcI, bcJ );
4845 if ( bcI >= 0. && bcJ >= 0. && bcI + bcJ <= 1.)
4848 if ( I > 0 && bcI < 0. ) --I;
4849 if ( I+2 < iSize && bcI > 1. ) ++I;
4850 if ( J > 0 && bcJ < 0. ) --J;
4851 if ( J+2 < jSize && bcJ > 1. ) ++J;
4853 uv1 = UVPt( I+1,J+1).UV();
4854 if ( I != oldI || J != oldJ )
4856 uvI = UVPt( I+1, J ).UV();
4857 uvJ = UVPt( I, J+1 ).UV();
4859 SMESH_MeshAlgos::GetBarycentricCoords( UV, uvI, uvJ, uv1, bcI, bcJ );
4860 if ( bcI >= 0. && bcJ >= 0. && bcI + bcJ <= 1.)
4863 if ( I > 0 && bcI > 1. ) --I;
4864 if ( I+2 < iSize && bcI < 0. ) ++I;
4865 if ( J > 0 && bcJ > 1. ) --J;
4866 if ( J+2 < jSize && bcJ < 0. ) ++J;
4868 if ( I == oldI && J == oldJ )
4871 if ( iLoop+1 == nbLoops )
4873 uvI = UVPt( I+1, J ).UV();
4874 uvJ = UVPt( I, J+1 ).UV();
4875 uv0 = UVPt( I, J ).UV();
4876 SMESH_MeshAlgos::GetBarycentricCoords( UV, uvI, uvJ, uv0, bcI, bcJ );
4877 if ( bcI >= 0. && bcJ >= 0. && bcI + bcJ <= 1.)
4880 uv1 = UVPt( I+1,J+1).UV();
4881 SMESH_MeshAlgos::GetBarycentricCoords( UV, uvI, uvJ, uv1, bcI, bcJ );
4882 if ( bcI >= 0. && bcJ >= 0. && bcI + bcJ <= 1.)
4889 //================================================================================
4891 * \brief Checks if a given UV is equal to a given grid point
4893 //================================================================================
4895 bool FaceQuadStruct::isEqual( const gp_XY& UV, int I, int J )
4897 TopLoc_Location loc;
4898 Handle(Geom_Surface) surf = BRep_Tool::Surface( face, loc );
4899 gp_Pnt p1 = surf->Value( UV.X(), UV.Y() );
4900 gp_Pnt p2 = surf->Value( UVPt( I,J ).u, UVPt( I,J ).v );
4902 double dist2 = 1e100;
4903 for ( int di = -1; di < 2; di += 2 )
4906 if ( i < 0 || i+1 >= iSize ) continue;
4907 for ( int dj = -1; dj < 2; dj += 2 )
4910 if ( j < 0 || j+1 >= jSize ) continue;
4913 p2.SquareDistance( surf->Value( UVPt( i,j ).u, UVPt( i,j ).v )));
4916 double tol2 = dist2 / 1000.;
4917 return p1.SquareDistance( p2 ) < tol2;
4920 //================================================================================
4922 * \brief Recompute UV of grid points around a moved point in one direction
4924 //================================================================================
4926 void FaceQuadStruct::updateUV( const gp_XY& UV, int I, int J, bool isVertical )
4928 UVPt( I, J ).u = UV.X();
4929 UVPt( I, J ).v = UV.Y();
4934 if ( J+1 < jSize-1 )
4936 gp_UV a0 = UVPt( 0, J ).UV();
4937 gp_UV a1 = UVPt( iSize-1, J ).UV();
4938 gp_UV a2 = UVPt( iSize-1, jSize-1 ).UV();
4939 gp_UV a3 = UVPt( 0, jSize-1 ).UV();
4941 gp_UV p0 = UVPt( I, J ).UV();
4942 gp_UV p2 = UVPt( I, jSize-1 ).UV();
4943 const double y0 = UVPt( I, J ).y, dy = 1. - y0;
4944 for (int j = J+1; j < jSize-1; j++)
4946 gp_UV p1 = UVPt( iSize-1, j ).UV();
4947 gp_UV p3 = UVPt( 0, j ).UV();
4949 UVPtStruct& uvPt = UVPt( I, j );
4950 gp_UV uv = calcUV( uvPt.x, ( uvPt.y - y0 ) / dy, a0,a1,a2,a3, p0,p1,p2,p3);
4958 gp_UV a0 = UVPt( 0, 0 ).UV();
4959 gp_UV a1 = UVPt( iSize-1, 0 ).UV();
4960 gp_UV a2 = UVPt( iSize-1, J ).UV();
4961 gp_UV a3 = UVPt( 0, J ).UV();
4963 gp_UV p0 = UVPt( I, 0 ).UV();
4964 gp_UV p2 = UVPt( I, J ).UV();
4965 const double y0 = 0., dy = UVPt( I, J ).y - y0;
4966 for (int j = 1; j < J; j++)
4968 gp_UV p1 = UVPt( iSize-1, j ).UV();
4969 gp_UV p3 = UVPt( 0, j ).UV();
4971 UVPtStruct& uvPt = UVPt( I, j );
4972 gp_UV uv = calcUV( uvPt.x, ( uvPt.y - y0 ) / dy, a0,a1,a2,a3, p0,p1,p2,p3);
4978 else // horizontally
4983 gp_UV a0 = UVPt( 0, 0 ).UV();
4984 gp_UV a1 = UVPt( I, 0 ).UV();
4985 gp_UV a2 = UVPt( I, jSize-1 ).UV();
4986 gp_UV a3 = UVPt( 0, jSize-1 ).UV();
4988 gp_UV p1 = UVPt( I, J ).UV();
4989 gp_UV p3 = UVPt( 0, J ).UV();
4990 const double x0 = 0., dx = UVPt( I, J ).x - x0;
4991 for (int i = 1; i < I; i++)
4993 gp_UV p0 = UVPt( i, 0 ).UV();
4994 gp_UV p2 = UVPt( i, jSize-1 ).UV();
4996 UVPtStruct& uvPt = UVPt( i, J );
4997 gp_UV uv = calcUV(( uvPt.x - x0 ) / dx , uvPt.y, a0,a1,a2,a3, p0,p1,p2,p3);
5003 if ( I+1 < iSize-1 )
5005 gp_UV a0 = UVPt( I, 0 ).UV();
5006 gp_UV a1 = UVPt( iSize-1, 0 ).UV();
5007 gp_UV a2 = UVPt( iSize-1, jSize-1 ).UV();
5008 gp_UV a3 = UVPt( I, jSize-1 ).UV();
5010 gp_UV p1 = UVPt( iSize-1, J ).UV();
5011 gp_UV p3 = UVPt( I, J ).UV();
5012 const double x0 = UVPt( I, J ).x, dx = 1. - x0;
5013 for (int i = I+1; i < iSize-1; i++)
5015 gp_UV p0 = UVPt( i, 0 ).UV();
5016 gp_UV p2 = UVPt( i, jSize-1 ).UV();
5018 UVPtStruct& uvPt = UVPt( i, J );
5019 gp_UV uv = calcUV(( uvPt.x - x0 ) / dx , uvPt.y, a0,a1,a2,a3, p0,p1,p2,p3);
5027 //================================================================================
5029 * \brief Side copying
5031 //================================================================================
5033 FaceQuadStruct::Side& FaceQuadStruct::Side::operator=(const Side& otherSide)
5035 grid = otherSide.grid;
5036 from = otherSide.from;
5039 forced_nodes = otherSide.forced_nodes;
5040 contacts = otherSide.contacts;
5041 nbNodeOut = otherSide.nbNodeOut;
5043 for ( size_t iC = 0; iC < contacts.size(); ++iC )
5045 FaceQuadStruct::Side* oSide = contacts[iC].other_side;
5046 for ( size_t iOC = 0; iOC < oSide->contacts.size(); ++iOC )
5047 if ( oSide->contacts[iOC].other_side == & otherSide )
5049 // cout << "SHIFT old " << &otherSide << " " << otherSide.NbPoints()
5050 // << " -> new " << this << " " << this->NbPoints() << endl;
5051 oSide->contacts[iOC].other_side = this;
5056 //================================================================================
5058 * \brief Converts node index of a quad to node index of this side
5060 //================================================================================
5062 int FaceQuadStruct::Side::ToSideIndex( int quadNodeIndex ) const
5064 return from + di * quadNodeIndex;
5067 //================================================================================
5069 * \brief Converts node index of this side to node index of a quad
5071 //================================================================================
5073 int FaceQuadStruct::Side::ToQuadIndex( int sideNodeIndex ) const
5075 return ( sideNodeIndex - from ) * di;
5078 //================================================================================
5080 * \brief Reverse the side
5082 //================================================================================
5084 bool FaceQuadStruct::Side::Reverse(bool keepGrid)
5092 std::swap( from, to );
5102 //================================================================================
5104 * \brief Checks if a node is enforced
5105 * \param [in] nodeIndex - an index of a node in a size
5106 * \return bool - \c true if the node is forced
5108 //================================================================================
5110 bool FaceQuadStruct::Side::IsForced( int nodeIndex ) const
5112 if ( nodeIndex < 0 || nodeIndex >= grid->NbPoints() )
5113 throw SALOME_Exception( " FaceQuadStruct::Side::IsForced(): wrong index" );
5115 if ( forced_nodes.count( nodeIndex ) )
5118 for ( size_t i = 0; i < this->contacts.size(); ++i )
5119 if ( contacts[ i ].point == nodeIndex &&
5120 contacts[ i ].other_side->forced_nodes.count( contacts[ i ].other_point ))
5126 //================================================================================
5128 * \brief Sets up a contact between this and another side
5130 //================================================================================
5132 void FaceQuadStruct::Side::AddContact( int ip, Side* side, int iop )
5134 if ( ip >= GetUVPtStruct().size() ||
5135 iop >= side->GetUVPtStruct().size() )
5136 throw SALOME_Exception( "FaceQuadStruct::Side::AddContact(): wrong point" );
5138 contacts.resize( contacts.size() + 1 );
5139 Contact& c = contacts.back();
5141 c.other_side = side;
5142 c.other_point = iop;
5145 side->contacts.resize( side->contacts.size() + 1 );
5146 Contact& c = side->contacts.back();
5148 c.other_side = this;
5153 //================================================================================
5155 * \brief Returns a normalized parameter of a point indexed within a quadrangle
5157 //================================================================================
5159 double FaceQuadStruct::Side::Param( int i ) const
5161 const vector<UVPtStruct>& points = GetUVPtStruct();
5162 return (( points[ from + i * di ].normParam - points[ from ].normParam ) /
5163 ( points[ to - 1 * di ].normParam - points[ from ].normParam ));
5166 //================================================================================
5168 * \brief Returns UV by a parameter normalized within a quadrangle
5170 //================================================================================
5172 gp_XY FaceQuadStruct::Side::Value2d( double x ) const
5174 const vector<UVPtStruct>& points = GetUVPtStruct();
5175 double u = ( points[ from ].normParam +
5176 x * ( points[ to-di ].normParam - points[ from ].normParam ));
5177 return grid->Value2d( u ).XY();
5180 //================================================================================
5182 * \brief Returns side length
5184 //================================================================================
5186 double FaceQuadStruct::Side::Length(int theFrom, int theTo) const
5188 if ( IsReversed() != ( theTo < theFrom ))
5189 std::swap( theTo, theFrom );
5191 const vector<UVPtStruct>& points = GetUVPtStruct();
5193 if ( theFrom == theTo && theTo == -1 )
5194 r = Abs( First().normParam -
5195 Last ().normParam );
5196 else if ( IsReversed() )
5197 r = Abs( points[ Max( to, theTo+1 ) ].normParam -
5198 points[ Min( from, theFrom ) ].normParam );
5200 r = Abs( points[ Min( to, theTo-1 ) ].normParam -
5201 points[ Max( from, theFrom ) ].normParam );
5202 return r * grid->Length();