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_Mesh.hxx"
37 #include "SMESH_MesherHelper.hxx"
38 #include "SMESH_subMesh.hxx"
39 #include "StdMeshers_FaceSide.hxx"
40 #include "StdMeshers_QuadrangleParams.hxx"
41 #include "StdMeshers_ViscousLayers2D.hxx"
43 #include <BRep_Tool.hxx>
44 #include <GeomAPI_ProjectPointOnSurf.hxx>
45 #include <Geom_Surface.hxx>
46 #include <NCollection_DefineArray2.hxx>
47 #include <Precision.hxx>
48 #include <Quantity_Parameter.hxx>
49 #include <TColStd_SequenceOfInteger.hxx>
50 #include <TColStd_SequenceOfReal.hxx>
51 #include <TColgp_SequenceOfXY.hxx>
53 #include <TopExp_Explorer.hxx>
54 #include <TopTools_DataMapOfShapeReal.hxx>
55 #include <TopTools_ListIteratorOfListOfShape.hxx>
56 #include <TopTools_MapOfShape.hxx>
59 #include "utilities.h"
60 #include "Utils_ExceptHandlers.hxx"
62 #ifndef StdMeshers_Array2OfNode_HeaderFile
63 #define StdMeshers_Array2OfNode_HeaderFile
64 typedef const SMDS_MeshNode* SMDS_MeshNodePtr;
65 DEFINE_BASECOLLECTION (StdMeshers_BaseCollectionNodePtr, SMDS_MeshNodePtr)
66 DEFINE_ARRAY2(StdMeshers_Array2OfNode,
67 StdMeshers_BaseCollectionNodePtr, SMDS_MeshNodePtr)
73 typedef SMESH_Comment TComm;
75 //=============================================================================
79 //=============================================================================
81 StdMeshers_Quadrangle_2D::StdMeshers_Quadrangle_2D (int hypId, int studyId,
83 : SMESH_2D_Algo(hypId, studyId, gen),
84 myQuadranglePreference(false),
85 myTrianglePreference(false),
88 myQuadType(QUAD_STANDARD),
91 MESSAGE("StdMeshers_Quadrangle_2D::StdMeshers_Quadrangle_2D");
92 _name = "Quadrangle_2D";
93 _shapeType = (1 << TopAbs_FACE);
94 _compatibleHypothesis.push_back("QuadrangleParams");
95 _compatibleHypothesis.push_back("QuadranglePreference");
96 _compatibleHypothesis.push_back("TrianglePreference");
97 _compatibleHypothesis.push_back("ViscousLayers2D");
100 //=============================================================================
104 //=============================================================================
106 StdMeshers_Quadrangle_2D::~StdMeshers_Quadrangle_2D()
108 MESSAGE("StdMeshers_Quadrangle_2D::~StdMeshers_Quadrangle_2D");
111 //=============================================================================
115 //=============================================================================
117 bool StdMeshers_Quadrangle_2D::CheckHypothesis
119 const TopoDS_Shape& aShape,
120 SMESH_Hypothesis::Hypothesis_Status& aStatus)
123 myQuadType = QUAD_STANDARD;
124 myQuadranglePreference = false;
125 myTrianglePreference = false;
126 myQuadStruct.reset();
130 aStatus = SMESH_Hypothesis::HYP_OK;
132 const list <const SMESHDS_Hypothesis * >& hyps =
133 GetUsedHypothesis(aMesh, aShape, false);
134 const SMESHDS_Hypothesis * aHyp = 0;
136 bool isFirstParams = true;
138 // First assigned hypothesis (if any) is processed now
139 if (hyps.size() > 0) {
141 if (strcmp("QuadrangleParams", aHyp->GetName()) == 0) {
142 const StdMeshers_QuadrangleParams* aHyp1 =
143 (const StdMeshers_QuadrangleParams*)aHyp;
144 myTriaVertexID = aHyp1->GetTriaVertex();
145 myQuadType = aHyp1->GetQuadType();
146 if (myQuadType == QUAD_QUADRANGLE_PREF ||
147 myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
148 myQuadranglePreference = true;
149 else if (myQuadType == QUAD_TRIANGLE_PREF)
150 myTrianglePreference = true;
152 else if (strcmp("QuadranglePreference", aHyp->GetName()) == 0) {
153 isFirstParams = false;
154 myQuadranglePreference = true;
156 else if (strcmp("TrianglePreference", aHyp->GetName()) == 0){
157 isFirstParams = false;
158 myTrianglePreference = true;
161 isFirstParams = false;
165 // Second(last) assigned hypothesis (if any) is processed now
166 if (hyps.size() > 1) {
169 if (strcmp("QuadranglePreference", aHyp->GetName()) == 0) {
170 myQuadranglePreference = true;
171 myTrianglePreference = false;
172 myQuadType = QUAD_STANDARD;
174 else if (strcmp("TrianglePreference", aHyp->GetName()) == 0){
175 myQuadranglePreference = false;
176 myTrianglePreference = true;
177 myQuadType = QUAD_STANDARD;
181 const StdMeshers_QuadrangleParams* aHyp2 =
182 (const StdMeshers_QuadrangleParams*)aHyp;
183 myTriaVertexID = aHyp2->GetTriaVertex();
185 if (!myQuadranglePreference && !myTrianglePreference) { // priority of hypos
186 myQuadType = aHyp2->GetQuadType();
187 if (myQuadType == QUAD_QUADRANGLE_PREF ||
188 myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
189 myQuadranglePreference = true;
190 else if (myQuadType == QUAD_TRIANGLE_PREF)
191 myTrianglePreference = true;
199 //=============================================================================
203 //=============================================================================
205 bool StdMeshers_Quadrangle_2D::Compute (SMESH_Mesh& aMesh,
206 const TopoDS_Shape& aShape)
208 const TopoDS_Face& F = TopoDS::Face(aShape);
209 aMesh.GetSubMesh( F );
211 SMESH_MesherHelper helper (aMesh);
214 myProxyMesh = StdMeshers_ViscousLayers2D::Compute( aMesh, F );
218 _quadraticMesh = myHelper->IsQuadraticSubMesh(aShape);
219 myNeedSmooth = false;
221 FaceQuadStruct::Ptr quad = CheckNbEdges( aMesh, F, /*considerMesh=*/true );
226 enum { NOT_COMPUTED = -1, COMPUTE_FAILED = 0, COMPUTE_OK = 1 };
227 int res = NOT_COMPUTED;
228 if (myQuadranglePreference)
230 int n1 = quad->side[0]->NbPoints();
231 int n2 = quad->side[1]->NbPoints();
232 int n3 = quad->side[2]->NbPoints();
233 int n4 = quad->side[3]->NbPoints();
234 int nfull = n1+n2+n3+n4;
237 if (nfull == ntmp && ((n1 != n3) || (n2 != n4)))
239 // special path genarating only quandrangle faces
240 res = computeQuadPref( aMesh, F, quad );
243 else if (myQuadType == QUAD_REDUCED)
245 int n1 = quad->side[0]->NbPoints();
246 int n2 = quad->side[1]->NbPoints();
247 int n3 = quad->side[2]->NbPoints();
248 int n4 = quad->side[3]->NbPoints();
251 int n13tmp = n13/2; n13tmp = n13tmp*2;
252 int n24tmp = n24/2; n24tmp = n24tmp*2;
253 if ((n1 == n3 && n2 != n4 && n24tmp == n24) ||
254 (n2 == n4 && n1 != n3 && n13tmp == n13))
256 res = computeReduced( aMesh, F, quad );
260 if ( n1 != n3 && n2 != n4 )
261 error( COMPERR_WARNING,
262 "To use 'Reduced' transition, "
263 "two opposite sides should have same number of segments, "
264 "but actual number of segments is different on all sides. "
265 "'Standard' transion has been used.");
267 error( COMPERR_WARNING,
268 "To use 'Reduced' transition, "
269 "two opposite sides should have an even difference in number of segments. "
270 "'Standard' transion has been used.");
274 if ( res == NOT_COMPUTED )
276 res = computeQuadDominant( aMesh, F, quad );
279 if ( res == COMPUTE_OK && myNeedSmooth )
282 return ( res == COMPUTE_OK );
285 //================================================================================
287 * \brief Compute quadrangles and possibly triangles
289 //================================================================================
291 bool StdMeshers_Quadrangle_2D::computeQuadDominant(SMESH_Mesh& aMesh,
292 const TopoDS_Face& aFace,
293 FaceQuadStruct::Ptr quad)
295 // set normalized grid on unit square in parametric domain
297 if (!setNormalizedGrid(aMesh, aFace, quad))
300 // --- compute 3D values on points, store points & quadrangles
302 int nbdown = quad->side[0]->NbPoints();
303 int nbup = quad->side[2]->NbPoints();
305 int nbright = quad->side[1]->NbPoints();
306 int nbleft = quad->side[3]->NbPoints();
308 int nbhoriz = Min(nbdown, nbup);
309 int nbvertic = Min(nbright, nbleft);
311 // internal mesh nodes
312 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
313 Handle(Geom_Surface) S = BRep_Tool::Surface(aFace);
314 int i, j, geomFaceID = meshDS->ShapeToIndex(aFace);
315 for (i = 1; i < nbhoriz - 1; i++) {
316 for (j = 1; j < nbvertic - 1; j++) {
317 int ij = j * nbhoriz + i;
318 double u = quad->uv_grid[ij].u;
319 double v = quad->uv_grid[ij].v;
320 gp_Pnt P = S->Value(u, v);
321 SMDS_MeshNode * node = meshDS->AddNode(P.X(), P.Y(), P.Z());
322 meshDS->SetNodeOnFace(node, geomFaceID, u, v);
323 quad->uv_grid[ij].node = node;
330 // --.--.--.--.--.-- nbvertic
336 // ---.----.----.--- 0
337 // 0 > > > > > > > > nbhoriz
343 int iup = nbhoriz - 1;
344 if (quad->isEdgeOut[3]) { ilow++; } else { if (quad->isEdgeOut[1]) iup--; }
347 int jup = nbvertic - 1;
348 if (quad->isEdgeOut[0]) { jlow++; } else { if (quad->isEdgeOut[2]) jup--; }
350 // regular quadrangles
351 for (i = ilow; i < iup; i++) {
352 for (j = jlow; j < jup; j++) {
353 const SMDS_MeshNode *a, *b, *c, *d;
354 a = quad->uv_grid[j * nbhoriz + i ].node;
355 b = quad->uv_grid[j * nbhoriz + i + 1].node;
356 c = quad->uv_grid[(j + 1) * nbhoriz + i + 1].node;
357 d = quad->uv_grid[(j + 1) * nbhoriz + i ].node;
358 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
360 meshDS->SetMeshElementOnShape(face, geomFaceID);
365 const vector<UVPtStruct>& uv_e0 = quad->side[0]->GetUVPtStruct(true,0);
366 const vector<UVPtStruct>& uv_e1 = quad->side[1]->GetUVPtStruct(false,1);
367 const vector<UVPtStruct>& uv_e2 = quad->side[2]->GetUVPtStruct(true,1);
368 const vector<UVPtStruct>& uv_e3 = quad->side[3]->GetUVPtStruct(false,0);
370 if (uv_e0.empty() || uv_e1.empty() || uv_e2.empty() || uv_e3.empty())
371 return error(COMPERR_BAD_INPUT_MESH);
373 double eps = Precision::Confusion();
375 // Boundary quadrangles
377 if (quad->isEdgeOut[0]) {
380 // |___|___|___|___|___|___|
382 // |___|___|___|___|___|___|
384 // |___|___|___|___|___|___| __ first row of the regular grid
385 // . . . . . . . . . __ down edge nodes
387 // >->->->->->->->->->->->-> -- direction of processing
389 int g = 0; // number of last processed node in the regular grid
391 // number of last node of the down edge to be processed
392 int stop = nbdown - 1;
393 // if right edge is out, we will stop at a node, previous to the last one
394 if (quad->isEdgeOut[1]) stop--;
396 // for each node of the down edge find nearest node
397 // in the first row of the regular grid and link them
398 for (i = 0; i < stop; i++) {
399 const SMDS_MeshNode *a, *b, *c, *d;
401 b = uv_e0[i + 1].node;
402 gp_Pnt pb (b->X(), b->Y(), b->Z());
404 // find node c in the regular grid, which will be linked with node b
407 // right bound reached, link with the rightmost node
409 c = quad->uv_grid[nbhoriz + iup].node;
412 // find in the grid node c, nearest to the b
413 double mind = RealLast();
414 for (int k = g; k <= iup; k++) {
416 const SMDS_MeshNode *nk;
417 if (k < ilow) // this can be, if left edge is out
418 nk = uv_e3[1].node; // get node from the left edge
420 nk = quad->uv_grid[nbhoriz + k].node; // get one of middle nodes
422 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
423 double dist = pb.Distance(pnk);
424 if (dist < mind - eps) {
434 if (near == g) { // make triangle
435 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
436 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
438 else { // make quadrangle
442 d = quad->uv_grid[nbhoriz + near - 1].node;
443 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
445 if (!myTrianglePreference){
446 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
447 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
450 splitQuad(meshDS, geomFaceID, a, b, c, d);
453 // if node d is not at position g - make additional triangles
455 for (int k = near - 1; k > g; k--) {
456 c = quad->uv_grid[nbhoriz + k].node;
460 d = quad->uv_grid[nbhoriz + k - 1].node;
461 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
462 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
469 if (quad->isEdgeOut[2]) {
472 // <-<-<-<-<-<-<-<-<-<-<-<-< -- direction of processing
474 // . . . . . . . . . __ up edge nodes
475 // ___ ___ ___ ___ ___ ___ __ first row of the regular grid
477 // |___|___|___|___|___|___|
479 // |___|___|___|___|___|___|
482 int g = nbhoriz - 1; // last processed node in the regular grid
485 // if left edge is out, we will stop at a second node
486 if (quad->isEdgeOut[3]) stop++;
488 // for each node of the up edge find nearest node
489 // in the first row of the regular grid and link them
490 for (i = nbup - 1; i > stop; i--) {
491 const SMDS_MeshNode *a, *b, *c, *d;
493 b = uv_e2[i - 1].node;
494 gp_Pnt pb (b->X(), b->Y(), b->Z());
496 // find node c in the grid, which will be linked with node b
498 if (i == stop + 1) { // left bound reached, link with the leftmost node
499 c = quad->uv_grid[nbhoriz*(nbvertic - 2) + ilow].node;
502 // find node c in the grid, nearest to the b
503 double mind = RealLast();
504 for (int k = g; k >= ilow; k--) {
505 const SMDS_MeshNode *nk;
507 nk = uv_e1[nbright - 2].node;
509 nk = quad->uv_grid[nbhoriz*(nbvertic - 2) + k].node;
510 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
511 double dist = pb.Distance(pnk);
512 if (dist < mind - eps) {
522 if (near == g) { // make triangle
523 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
524 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
526 else { // make quadrangle
528 d = uv_e1[nbright - 2].node;
530 d = quad->uv_grid[nbhoriz*(nbvertic - 2) + near + 1].node;
531 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
532 if (!myTrianglePreference){
533 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
534 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
537 splitQuad(meshDS, geomFaceID, a, b, c, d);
540 if (near + 1 < g) { // if d not is at g - make additional triangles
541 for (int k = near + 1; k < g; k++) {
542 c = quad->uv_grid[nbhoriz*(nbvertic - 2) + k].node;
544 d = uv_e1[nbright - 2].node;
546 d = quad->uv_grid[nbhoriz*(nbvertic - 2) + k + 1].node;
547 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
548 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
557 // right or left boundary quadrangles
558 if (quad->isEdgeOut[1]) {
559 // MESSAGE("right edge is out");
560 int g = 0; // last processed node in the grid
561 int stop = nbright - 1;
562 if (quad->isEdgeOut[2]) stop--;
563 for (i = 0; i < stop; i++) {
564 const SMDS_MeshNode *a, *b, *c, *d;
566 b = uv_e1[i + 1].node;
567 gp_Pnt pb (b->X(), b->Y(), b->Z());
569 // find node c in the grid, nearest to the b
571 if (i == stop - 1) { // up bondary reached
572 c = quad->uv_grid[nbhoriz*(jup + 1) - 2].node;
575 double mind = RealLast();
576 for (int k = g; k <= jup; k++) {
577 const SMDS_MeshNode *nk;
579 nk = uv_e0[nbdown - 2].node;
581 nk = quad->uv_grid[nbhoriz*(k + 1) - 2].node;
582 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
583 double dist = pb.Distance(pnk);
584 if (dist < mind - eps) {
594 if (near == g) { // make triangle
595 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
596 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
598 else { // make quadrangle
600 d = uv_e0[nbdown - 2].node;
602 d = quad->uv_grid[nbhoriz*near - 2].node;
603 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
605 if (!myTrianglePreference){
606 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
607 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
610 splitQuad(meshDS, geomFaceID, a, b, c, d);
613 if (near - 1 > g) { // if d not is at g - make additional triangles
614 for (int k = near - 1; k > g; k--) {
615 c = quad->uv_grid[nbhoriz*(k + 1) - 2].node;
617 d = uv_e0[nbdown - 2].node;
619 d = quad->uv_grid[nbhoriz*k - 2].node;
620 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
621 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
628 if (quad->isEdgeOut[3]) {
629 // MESSAGE("left edge is out");
630 int g = nbvertic - 1; // last processed node in the grid
632 if (quad->isEdgeOut[0]) stop++;
633 for (i = nbleft - 1; i > stop; i--) {
634 const SMDS_MeshNode *a, *b, *c, *d;
636 b = uv_e3[i - 1].node;
637 gp_Pnt pb (b->X(), b->Y(), b->Z());
639 // find node c in the grid, nearest to the b
641 if (i == stop + 1) { // down bondary reached
642 c = quad->uv_grid[nbhoriz*jlow + 1].node;
645 double mind = RealLast();
646 for (int k = g; k >= jlow; k--) {
647 const SMDS_MeshNode *nk;
651 nk = quad->uv_grid[nbhoriz*k + 1].node;
652 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
653 double dist = pb.Distance(pnk);
654 if (dist < mind - eps) {
664 if (near == g) { // make triangle
665 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
666 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
668 else { // make quadrangle
672 d = quad->uv_grid[nbhoriz*(near + 1) + 1].node;
673 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
674 if (!myTrianglePreference){
675 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
676 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
679 splitQuad(meshDS, geomFaceID, a, b, c, d);
682 if (near + 1 < g) { // if d not is at g - make additional triangles
683 for (int k = near + 1; k < g; k++) {
684 c = quad->uv_grid[nbhoriz*k + 1].node;
688 d = quad->uv_grid[nbhoriz*(k + 1) + 1].node;
689 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
690 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
704 //=============================================================================
708 //=============================================================================
710 bool StdMeshers_Quadrangle_2D::Evaluate(SMESH_Mesh& aMesh,
711 const TopoDS_Shape& aFace,
712 MapShapeNbElems& aResMap)
715 aMesh.GetSubMesh(aFace);
717 std::vector<int> aNbNodes(4);
718 bool IsQuadratic = false;
719 if (!checkNbEdgesForEvaluate(aMesh, aFace, aResMap, aNbNodes, IsQuadratic)) {
720 std::vector<int> aResVec(SMDSEntity_Last);
721 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
722 SMESH_subMesh * sm = aMesh.GetSubMesh(aFace);
723 aResMap.insert(std::make_pair(sm,aResVec));
724 SMESH_ComputeErrorPtr& smError = sm->GetComputeError();
725 smError.reset(new SMESH_ComputeError(COMPERR_ALGO_FAILED,"Submesh can not be evaluated",this));
729 if (myQuadranglePreference) {
730 int n1 = aNbNodes[0];
731 int n2 = aNbNodes[1];
732 int n3 = aNbNodes[2];
733 int n4 = aNbNodes[3];
734 int nfull = n1+n2+n3+n4;
737 if (nfull==ntmp && ((n1!=n3) || (n2!=n4))) {
738 // special path for using only quandrangle faces
739 return evaluateQuadPref(aMesh, aFace, aNbNodes, aResMap, IsQuadratic);
744 int nbdown = aNbNodes[0];
745 int nbup = aNbNodes[2];
747 int nbright = aNbNodes[1];
748 int nbleft = aNbNodes[3];
750 int nbhoriz = Min(nbdown, nbup);
751 int nbvertic = Min(nbright, nbleft);
753 int dh = Max(nbdown, nbup) - nbhoriz;
754 int dv = Max(nbright, nbleft) - nbvertic;
761 int nbNodes = (nbhoriz-2)*(nbvertic-2);
762 //int nbFaces3 = dh + dv + kdh*(nbvertic-1)*2 + kdv*(nbhoriz-1)*2;
763 int nbFaces3 = dh + dv;
764 //if (kdh==1 && kdv==1) nbFaces3 -= 2;
765 //if (dh>0 && dv>0) nbFaces3 -= 2;
766 //int nbFaces4 = (nbhoriz-1-kdh)*(nbvertic-1-kdv);
767 int nbFaces4 = (nbhoriz-1)*(nbvertic-1);
769 std::vector<int> aVec(SMDSEntity_Last);
770 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aVec[i] = 0;
772 aVec[SMDSEntity_Quad_Triangle] = nbFaces3;
773 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces4;
774 int nbbndedges = nbdown + nbup + nbright + nbleft -4;
775 int nbintedges = (nbFaces4*4 + nbFaces3*3 - nbbndedges) / 2;
776 aVec[SMDSEntity_Node] = nbNodes + nbintedges;
777 if (aNbNodes.size()==5) {
778 aVec[SMDSEntity_Quad_Triangle] = nbFaces3 + aNbNodes[3] -1;
779 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces4 - aNbNodes[3] +1;
783 aVec[SMDSEntity_Node] = nbNodes;
784 aVec[SMDSEntity_Triangle] = nbFaces3;
785 aVec[SMDSEntity_Quadrangle] = nbFaces4;
786 if (aNbNodes.size()==5) {
787 aVec[SMDSEntity_Triangle] = nbFaces3 + aNbNodes[3] - 1;
788 aVec[SMDSEntity_Quadrangle] = nbFaces4 - aNbNodes[3] + 1;
791 SMESH_subMesh * sm = aMesh.GetSubMesh(aFace);
792 aResMap.insert(std::make_pair(sm,aVec));
798 //================================================================================
800 * \brief Return true if only two given edges meat at their common vertex
802 //================================================================================
804 static bool twoEdgesMeatAtVertex(const TopoDS_Edge& e1,
805 const TopoDS_Edge& e2,
809 if (!TopExp::CommonVertex(e1, e2, v))
811 TopTools_ListIteratorOfListOfShape ancestIt(mesh.GetAncestors(v));
812 for (; ancestIt.More() ; ancestIt.Next())
813 if (ancestIt.Value().ShapeType() == TopAbs_EDGE)
814 if (!e1.IsSame(ancestIt.Value()) && !e2.IsSame(ancestIt.Value()))
819 //=============================================================================
823 //=============================================================================
825 FaceQuadStruct::Ptr StdMeshers_Quadrangle_2D::CheckNbEdges(SMESH_Mesh & aMesh,
826 const TopoDS_Shape & aShape,
827 const bool considerMesh)
829 if ( myQuadStruct && myQuadStruct->face.IsSame( aShape ))
832 TopoDS_Face F = TopoDS::Face(aShape);
833 if ( F.Orientation() >= TopAbs_INTERNAL ) F.Orientation( TopAbs_FORWARD );
834 const bool ignoreMediumNodes = _quadraticMesh;
836 // verify 1 wire only, with 4 edges
837 list< TopoDS_Edge > edges;
838 list< int > nbEdgesInWire;
839 int nbWire = SMESH_Block::GetOrderedEdges (F, edges, nbEdgesInWire);
841 error(COMPERR_BAD_SHAPE, TComm("Wrong number of wires: ") << nbWire);
842 return FaceQuadStruct::Ptr();
845 // find corner vertices of the quad
846 vector<TopoDS_Vertex> corners;
847 int nbDegenEdges, nbSides = getCorners( F, aMesh, edges, corners, nbDegenEdges, considerMesh );
850 return FaceQuadStruct::Ptr();
852 FaceQuadStruct::Ptr quad( new FaceQuadStruct );
854 quad->side.reserve(nbEdgesInWire.front());
857 list< TopoDS_Edge >::iterator edgeIt = edges.begin();
858 if ( nbSides == 3 ) // 3 sides and corners[0] is a vertex with myTriaVertexID
860 for ( int iSide = 0; iSide < 3; ++iSide )
862 list< TopoDS_Edge > sideEdges;
863 TopoDS_Vertex nextSideV = corners[( iSide + 1 ) % 3 ];
864 while ( edgeIt != edges.end() &&
865 !nextSideV.IsSame( SMESH_MesherHelper::IthVertex( 0, *edgeIt )))
866 if ( SMESH_Algo::isDegenerated( *edgeIt ))
869 sideEdges.push_back( *edgeIt++ );
870 if ( !sideEdges.empty() )
871 quad->side.push_back(new StdMeshers_FaceSide(F, sideEdges, &aMesh, iSide < QUAD_TOP_SIDE,
872 ignoreMediumNodes, myProxyMesh));
876 const vector<UVPtStruct>& UVPSleft = quad->side[0]->GetUVPtStruct(true,0);
877 /* vector<UVPtStruct>& UVPStop = */quad->side[1]->GetUVPtStruct(false,1);
878 /* vector<UVPtStruct>& UVPSright = */quad->side[2]->GetUVPtStruct(true,1);
879 const SMDS_MeshNode* aNode = UVPSleft[0].node;
880 gp_Pnt2d aPnt2d(UVPSleft[0].u, UVPSleft[0].v);
881 quad->side.push_back(new StdMeshers_FaceSide(quad->side[1], aNode, &aPnt2d));
882 myNeedSmooth = ( nbDegenEdges > 0 );
887 myNeedSmooth = ( corners.size() == 4 && nbDegenEdges > 0 );
888 int iSide = 0, nbUsedDegen = 0, nbLoops = 0;
889 for ( ; edgeIt != edges.end(); ++nbLoops )
891 list< TopoDS_Edge > sideEdges;
892 TopoDS_Vertex nextSideV = corners[( iSide + 1 - nbUsedDegen ) % corners.size() ];
893 while ( edgeIt != edges.end() &&
894 !nextSideV.IsSame( myHelper->IthVertex( 0, *edgeIt )))
896 if ( SMESH_Algo::isDegenerated( *edgeIt ) )
900 ++edgeIt; // no side on the degenerated EDGE
904 if ( sideEdges.empty() )
907 sideEdges.push_back( *edgeIt++ ); // a degenerated side
912 break; // do not append a degenerated EDGE to a regular side
918 sideEdges.push_back( *edgeIt++ );
921 if ( !sideEdges.empty() )
923 quad->side.push_back(new StdMeshers_FaceSide(F, sideEdges, &aMesh, iSide < QUAD_TOP_SIDE,
924 ignoreMediumNodes, myProxyMesh));
927 else if ( !SMESH_Algo::isDegenerated( *edgeIt ) && // closed EDGE
928 myHelper->IthVertex( 0, *edgeIt ).IsSame( myHelper->IthVertex( 1, *edgeIt )))
930 quad->side.push_back(new StdMeshers_FaceSide(F, *edgeIt++, &aMesh, iSide < QUAD_TOP_SIDE,
931 ignoreMediumNodes, myProxyMesh));
934 if ( quad->side.size() == 4 )
938 error(TComm("Bug: infinite loop in StdMeshers_Quadrangle_2D::CheckNbEdges()"));
943 if ( quad && quad->side.size() != 4 )
945 error(TComm("Bug: ") << quad->side.size() << " sides found instead of 4");
954 //=============================================================================
958 //=============================================================================
960 bool StdMeshers_Quadrangle_2D::checkNbEdgesForEvaluate(SMESH_Mesh& aMesh,
961 const TopoDS_Shape & aShape,
962 MapShapeNbElems& aResMap,
963 std::vector<int>& aNbNodes,
967 const TopoDS_Face & F = TopoDS::Face(aShape);
969 // verify 1 wire only, with 4 edges
970 list< TopoDS_Edge > edges;
971 list< int > nbEdgesInWire;
972 int nbWire = SMESH_Block::GetOrderedEdges (F, edges, nbEdgesInWire);
980 list< TopoDS_Edge >::iterator edgeIt = edges.begin();
981 SMESH_subMesh * sm = aMesh.GetSubMesh(*edgeIt);
982 MapShapeNbElemsItr anIt = aResMap.find(sm);
983 if (anIt==aResMap.end()) {
986 std::vector<int> aVec = (*anIt).second;
987 IsQuadratic = (aVec[SMDSEntity_Quad_Edge] > aVec[SMDSEntity_Edge]);
988 if (nbEdgesInWire.front() == 3) { // exactly 3 edges
989 if (myTriaVertexID>0) {
990 SMESHDS_Mesh* meshDS = aMesh.GetMeshDS();
991 TopoDS_Vertex V = TopoDS::Vertex(meshDS->IndexToShape(myTriaVertexID));
993 TopoDS_Edge E1,E2,E3;
994 for (; edgeIt != edges.end(); ++edgeIt) {
995 TopoDS_Edge E = TopoDS::Edge(*edgeIt);
996 TopoDS_Vertex VF, VL;
997 TopExp::Vertices(E, VF, VL, true);
1000 else if (VL.IsSame(V))
1005 SMESH_subMesh * sm = aMesh.GetSubMesh(E1);
1006 MapShapeNbElemsItr anIt = aResMap.find(sm);
1007 if (anIt==aResMap.end()) return false;
1008 std::vector<int> aVec = (*anIt).second;
1010 aNbNodes[0] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1012 aNbNodes[0] = aVec[SMDSEntity_Node] + 2;
1013 sm = aMesh.GetSubMesh(E2);
1014 anIt = aResMap.find(sm);
1015 if (anIt==aResMap.end()) return false;
1016 aVec = (*anIt).second;
1018 aNbNodes[1] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1020 aNbNodes[1] = aVec[SMDSEntity_Node] + 2;
1021 sm = aMesh.GetSubMesh(E3);
1022 anIt = aResMap.find(sm);
1023 if (anIt==aResMap.end()) return false;
1024 aVec = (*anIt).second;
1026 aNbNodes[2] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1028 aNbNodes[2] = aVec[SMDSEntity_Node] + 2;
1029 aNbNodes[3] = aNbNodes[1];
1035 if (nbEdgesInWire.front() == 4) { // exactly 4 edges
1036 for (; edgeIt != edges.end(); edgeIt++) {
1037 SMESH_subMesh * sm = aMesh.GetSubMesh(*edgeIt);
1038 MapShapeNbElemsItr anIt = aResMap.find(sm);
1039 if (anIt==aResMap.end()) {
1042 std::vector<int> aVec = (*anIt).second;
1044 aNbNodes[nbSides] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1046 aNbNodes[nbSides] = aVec[SMDSEntity_Node] + 2;
1050 else if (nbEdgesInWire.front() > 4) { // more than 4 edges - try to unite some
1051 list< TopoDS_Edge > sideEdges;
1052 while (!edges.empty()) {
1054 sideEdges.splice(sideEdges.end(), edges, edges.begin()); // edges.front() -> sideEdges.end()
1055 bool sameSide = true;
1056 while (!edges.empty() && sameSide) {
1057 sameSide = SMESH_Algo::IsContinuous(sideEdges.back(), edges.front());
1059 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1061 if (nbSides == 0) { // go backward from the first edge
1063 while (!edges.empty() && sameSide) {
1064 sameSide = SMESH_Algo::IsContinuous(sideEdges.front(), edges.back());
1066 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
1069 list<TopoDS_Edge>::iterator ite = sideEdges.begin();
1070 aNbNodes[nbSides] = 1;
1071 for (; ite!=sideEdges.end(); ite++) {
1072 SMESH_subMesh * sm = aMesh.GetSubMesh(*ite);
1073 MapShapeNbElemsItr anIt = aResMap.find(sm);
1074 if (anIt==aResMap.end()) {
1077 std::vector<int> aVec = (*anIt).second;
1079 aNbNodes[nbSides] += (aVec[SMDSEntity_Node]-1)/2 + 1;
1081 aNbNodes[nbSides] += aVec[SMDSEntity_Node] + 1;
1085 // issue 20222. Try to unite only edges shared by two same faces
1088 SMESH_Block::GetOrderedEdges (F, edges, nbEdgesInWire);
1089 while (!edges.empty()) {
1091 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1092 bool sameSide = true;
1093 while (!edges.empty() && sameSide) {
1095 SMESH_Algo::IsContinuous(sideEdges.back(), edges.front()) &&
1096 twoEdgesMeatAtVertex(sideEdges.back(), edges.front(), aMesh);
1098 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1100 if (nbSides == 0) { // go backward from the first edge
1102 while (!edges.empty() && sameSide) {
1104 SMESH_Algo::IsContinuous(sideEdges.front(), edges.back()) &&
1105 twoEdgesMeatAtVertex(sideEdges.front(), edges.back(), aMesh);
1107 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
1110 list<TopoDS_Edge>::iterator ite = sideEdges.begin();
1111 aNbNodes[nbSides] = 1;
1112 for (; ite!=sideEdges.end(); ite++) {
1113 SMESH_subMesh * sm = aMesh.GetSubMesh(*ite);
1114 MapShapeNbElemsItr anIt = aResMap.find(sm);
1115 if (anIt==aResMap.end()) {
1118 std::vector<int> aVec = (*anIt).second;
1120 aNbNodes[nbSides] += (aVec[SMDSEntity_Node]-1)/2 + 1;
1122 aNbNodes[nbSides] += aVec[SMDSEntity_Node] + 1;
1130 nbSides = nbEdgesInWire.front();
1131 error(COMPERR_BAD_SHAPE, TComm("Face must have 4 sides but not ") << nbSides);
1139 //=============================================================================
1143 //=============================================================================
1146 StdMeshers_Quadrangle_2D::CheckAnd2Dcompute (SMESH_Mesh & aMesh,
1147 const TopoDS_Shape & aShape,
1148 const bool CreateQuadratic)
1150 _quadraticMesh = CreateQuadratic;
1152 FaceQuadStruct::Ptr quad = CheckNbEdges(aMesh, aShape);
1155 // set normalized grid on unit square in parametric domain
1156 if ( ! setNormalizedGrid( aMesh, TopoDS::Face( aShape ), quad))
1162 //=============================================================================
1166 //=============================================================================
1168 faceQuadStruct::~faceQuadStruct()
1170 for (size_t i = 0; i < side.size(); i++) {
1173 for (size_t j = i+1; j < side.size(); j++)
1174 if ( side[i] == side[j] )
1188 inline const vector<UVPtStruct>& getUVPtStructIn(FaceQuadStruct::Ptr& quad, int i, int nbSeg)
1190 bool isXConst = (i == QUAD_BOTTOM_SIDE || i == QUAD_TOP_SIDE);
1191 double constValue = (i == QUAD_BOTTOM_SIDE || i == QUAD_LEFT_SIDE) ? 0 : 1;
1193 quad->isEdgeOut[i] ?
1194 quad->side[i]->SimulateUVPtStruct(nbSeg,isXConst,constValue) :
1195 quad->side[i]->GetUVPtStruct(isXConst,constValue);
1197 inline gp_UV calcUV(double x, double y,
1198 const gp_UV& a0,const gp_UV& a1,const gp_UV& a2,const gp_UV& a3,
1199 const gp_UV& p0,const gp_UV& p1,const gp_UV& p2,const gp_UV& p3)
1202 ((1 - y) * p0 + x * p1 + y * p2 + (1 - x) * p3 ) -
1203 ((1 - x) * (1 - y) * a0 + x * (1 - y) * a1 + x * y * a2 + (1 - x) * y * a3);
1207 //=============================================================================
1211 //=============================================================================
1213 bool StdMeshers_Quadrangle_2D::setNormalizedGrid (SMESH_Mesh & aMesh,
1214 const TopoDS_Face& aFace,
1215 FaceQuadStruct::Ptr & quad)
1217 // Algorithme décrit dans "Génération automatique de maillages"
1218 // P.L. GEORGE, MASSON, § 6.4.1 p. 84-85
1219 // traitement dans le domaine paramétrique 2d u,v
1220 // transport - projection sur le carré unité
1223 // |<----north-2-------^ a3 -------------> a2
1225 // west-3 east-1 =right | |
1229 // v----south-0--------> a0 -------------> a1
1234 updateDegenUV( quad );
1236 int nbhoriz = Min(quad->side[0]->NbPoints(), quad->side[2]->NbPoints());
1237 int nbvertic = Min(quad->side[1]->NbPoints(), quad->side[3]->NbPoints());
1239 quad->isEdgeOut[0] = (quad->side[0]->NbPoints() > quad->side[2]->NbPoints());
1240 quad->isEdgeOut[1] = (quad->side[1]->NbPoints() > quad->side[3]->NbPoints());
1241 quad->isEdgeOut[2] = (quad->side[2]->NbPoints() > quad->side[0]->NbPoints());
1242 quad->isEdgeOut[3] = (quad->side[3]->NbPoints() > quad->side[1]->NbPoints());
1244 UVPtStruct *uv_grid = quad->uv_grid = new UVPtStruct[nbvertic * nbhoriz];
1246 const vector<UVPtStruct>& uv_e0 = getUVPtStructIn(quad, 0, nbhoriz - 1);
1247 const vector<UVPtStruct>& uv_e1 = getUVPtStructIn(quad, 1, nbvertic - 1);
1248 const vector<UVPtStruct>& uv_e2 = getUVPtStructIn(quad, 2, nbhoriz - 1);
1249 const vector<UVPtStruct>& uv_e3 = getUVPtStructIn(quad, 3, nbvertic - 1);
1251 if (uv_e0.empty() || uv_e1.empty() || uv_e2.empty() || uv_e3.empty())
1252 //return error("Can't find nodes on sides");
1253 return error(COMPERR_BAD_INPUT_MESH);
1255 // copy data of face boundary
1258 for (int i = 0; i < nbhoriz; i++) // down
1259 uv_grid[ j * nbhoriz + i ] = uv_e0[i];
1262 const int i = nbhoriz - 1;
1263 for (int j = 0; j < nbvertic; j++) // right
1264 uv_grid[ j * nbhoriz + i ] = uv_e1[j];
1267 const int j = nbvertic - 1;
1268 for (int i = 0; i < nbhoriz; i++) // up
1269 uv_grid[ j * nbhoriz + i ] = uv_e2[i];
1273 for (int j = 0; j < nbvertic; j++) // left
1274 uv_grid[ j * nbhoriz + i ] = uv_e3[j];
1277 // normalized 2d parameters on grid
1279 for (int i = 0; i < nbhoriz; i++) {
1280 for (int j = 0; j < nbvertic; j++) {
1281 int ij = j * nbhoriz + i;
1282 // --- droite i cste : x = x0 + y(x1-x0)
1283 double x0 = uv_e0[i].normParam; // bas - sud
1284 double x1 = uv_e2[i].normParam; // haut - nord
1285 // --- droite j cste : y = y0 + x(y1-y0)
1286 double y0 = uv_e3[j].normParam; // gauche - ouest
1287 double y1 = uv_e1[j].normParam; // droite - est
1288 // --- intersection : x=x0+(y0+x(y1-y0))(x1-x0)
1289 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1290 double y = y0 + x * (y1 - y0);
1296 // projection on 2d domain (u,v)
1298 gp_UV a0 (uv_e0.front().u, uv_e0.front().v);
1299 gp_UV a1 (uv_e0.back().u, uv_e0.back().v );
1300 gp_UV a2 (uv_e2.back().u, uv_e2.back().v );
1301 gp_UV a3 (uv_e2.front().u, uv_e2.front().v);
1303 for (int i = 0; i < nbhoriz; i++)
1305 gp_UV p0( uv_e0[i].u, uv_e0[i].v );
1306 gp_UV p2( uv_e2[i].u, uv_e2[i].v );
1307 for (int j = 0; j < nbvertic; j++)
1309 gp_UV p1( uv_e1[j].u, uv_e1[j].v );
1310 gp_UV p3( uv_e3[j].u, uv_e3[j].v );
1312 int ij = j * nbhoriz + i;
1313 double x = uv_grid[ij].x;
1314 double y = uv_grid[ij].y;
1316 gp_UV uv = calcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1318 uv_grid[ij].u = uv.X();
1319 uv_grid[ij].v = uv.Y();
1325 //=======================================================================
1326 //function : ShiftQuad
1327 //purpose : auxilary function for computeQuadPref
1328 //=======================================================================
1330 static void shiftQuad(FaceQuadStruct::Ptr& quad, const int num)
1332 quad->shift( num, /*ori=*/true );
1335 //================================================================================
1337 * \brief Rotate sides of a quad by nb
1338 * \param nb - number of rotation quartes
1339 * \param ori - to keep orientation of sides as in an unit quad or not
1341 //================================================================================
1343 void FaceQuadStruct::shift( size_t nb, bool ori )
1345 if ( nb == 0 ) return;
1346 StdMeshers_FaceSide* sideArr[4] = { side[0], side[1], side[2], side[3] };
1347 for (int i = QUAD_BOTTOM_SIDE; i < NB_QUAD_SIDES; ++i) {
1348 int id = (i + nb) % NB_QUAD_SIDES;
1349 bool wasForward = (i < QUAD_TOP_SIDE);
1350 bool newForward = (id < QUAD_TOP_SIDE);
1351 if (ori && wasForward != newForward)
1352 sideArr[ i ]->Reverse();
1353 side[ id ] = sideArr[ i ];
1357 //=======================================================================
1359 //purpose : auxilary function for computeQuadPref
1360 //=======================================================================
1362 static gp_UV calcUV(double x0, double x1, double y0, double y1,
1363 FaceQuadStruct::Ptr& quad,
1364 const gp_UV& a0, const gp_UV& a1,
1365 const gp_UV& a2, const gp_UV& a3)
1367 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1368 double y = y0 + x * (y1 - y0);
1370 gp_UV p0 = quad->side[QUAD_BOTTOM_SIDE]->Value2d(x).XY();
1371 gp_UV p1 = quad->side[QUAD_RIGHT_SIDE ]->Value2d(y).XY();
1372 gp_UV p2 = quad->side[QUAD_TOP_SIDE ]->Value2d(x).XY();
1373 gp_UV p3 = quad->side[QUAD_LEFT_SIDE ]->Value2d(y).XY();
1375 gp_UV uv = calcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1380 //=======================================================================
1381 //function : calcUV2
1382 //purpose : auxilary function for computeQuadPref
1383 //=======================================================================
1385 static gp_UV calcUV2(double x, double y,
1386 FaceQuadStruct::Ptr& quad,
1387 const gp_UV& a0, const gp_UV& a1,
1388 const gp_UV& a2, const gp_UV& a3)
1390 gp_UV p0 = quad->side[QUAD_BOTTOM_SIDE]->Value2d(x).XY();
1391 gp_UV p1 = quad->side[QUAD_RIGHT_SIDE ]->Value2d(y).XY();
1392 gp_UV p2 = quad->side[QUAD_TOP_SIDE ]->Value2d(x).XY();
1393 gp_UV p3 = quad->side[QUAD_LEFT_SIDE ]->Value2d(y).XY();
1395 gp_UV uv = calcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1401 //=======================================================================
1403 * Create only quandrangle faces
1405 //=======================================================================
1407 bool StdMeshers_Quadrangle_2D::computeQuadPref (SMESH_Mesh & aMesh,
1408 const TopoDS_Face& aFace,
1409 FaceQuadStruct::Ptr quad)
1411 // Auxilary key in order to keep old variant
1412 // of meshing after implementation new variant
1413 // for bug 0016220 from Mantis.
1414 bool OldVersion = (myQuadType == QUAD_QUADRANGLE_PREF_REVERSED);
1416 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
1417 Handle(Geom_Surface) S = BRep_Tool::Surface(aFace);
1419 int i,j,geomFaceID = meshDS->ShapeToIndex(aFace);
1421 updateDegenUV( quad );
1423 int nb = quad->side[0]->NbPoints();
1424 int nr = quad->side[1]->NbPoints();
1425 int nt = quad->side[2]->NbPoints();
1426 int nl = quad->side[3]->NbPoints();
1427 int dh = abs(nb-nt);
1428 int dv = abs(nr-nl);
1430 // rotate sides to be as in the picture below and to have
1431 // dh >= dv and nt > nb
1433 shiftQuad( quad, ( nt > nb ) ? 0 : 2 );
1435 shiftQuad( quad, ( nr > nl ) ? 1 : 3 );
1437 nb = quad->side[0]->NbPoints();
1438 nr = quad->side[1]->NbPoints();
1439 nt = quad->side[2]->NbPoints();
1440 nl = quad->side[3]->NbPoints();
1443 int nbh = Max(nb,nt);
1444 int nbv = Max(nr,nl);
1448 // Orientation of face and 3 main domain for future faces
1449 // ----------- Old version ---------------
1455 // left | |__| | rigth
1462 // ----------- New version ---------------
1468 // left |/________\| rigth
1484 const vector<UVPtStruct>& uv_eb = quad->side[0]->GetUVPtStruct(true,0);
1485 const vector<UVPtStruct>& uv_er = quad->side[1]->GetUVPtStruct(false,1);
1486 const vector<UVPtStruct>& uv_et = quad->side[2]->GetUVPtStruct(true,1);
1487 const vector<UVPtStruct>& uv_el = quad->side[3]->GetUVPtStruct(false,0);
1489 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
1490 return error(COMPERR_BAD_INPUT_MESH);
1494 // dh/2, Min(nb,nt), dh - dh/2, dv
1497 // arrays for normalized params
1498 TColStd_SequenceOfReal npb, npr, npt, npl;
1499 for (i=0; i<nb; i++) {
1500 npb.Append(uv_eb[i].normParam);
1502 for (i=0; i<nr; i++) {
1503 npr.Append(uv_er[i].normParam);
1505 for (i=0; i<nt; i++) {
1506 npt.Append(uv_et[i].normParam);
1508 for (i=0; i<nl; i++) {
1509 npl.Append(uv_el[i].normParam);
1514 // add some params to right and left after the first param
1517 double dpr = (npr.Value(2) - npr.Value(1))/(dr+1);
1518 for (i=1; i<=dr; i++) {
1519 npr.InsertAfter(1,npr.Value(2)-dpr);
1523 dpr = (npl.Value(2) - npl.Value(1))/(dl+1);
1524 for (i=1; i<=dl; i++) {
1525 npl.InsertAfter(1,npl.Value(2)-dpr);
1529 gp_XY a0(uv_eb.front().u, uv_eb.front().v);
1530 gp_XY a1(uv_eb.back().u, uv_eb.back().v);
1531 gp_XY a2(uv_et.back().u, uv_et.back().v);
1532 gp_XY a3(uv_et.front().u, uv_et.front().v);
1534 int nnn = Min(nr,nl);
1535 // auxilary sequence of XY for creation nodes
1536 // in the bottom part of central domain
1537 // Length of UVL and UVR must be == nbv-nnn
1538 TColgp_SequenceOfXY UVL, UVR, UVT;
1541 // step1: create faces for left domain
1542 StdMeshers_Array2OfNode NodesL(1,dl+1,1,nl);
1544 for (j=1; j<=nl; j++)
1545 NodesL.SetValue(1,j,uv_el[j-1].node);
1548 for (i=1; i<=dl; i++)
1549 NodesL.SetValue(i+1,nl,uv_et[i].node);
1550 // create and add needed nodes
1551 TColgp_SequenceOfXY UVtmp;
1552 for (i=1; i<=dl; i++) {
1553 double x0 = npt.Value(i+1);
1556 double y0 = npl.Value(i+1);
1557 double y1 = npr.Value(i+1);
1558 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1559 gp_Pnt P = S->Value(UV.X(),UV.Y());
1560 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1561 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1562 NodesL.SetValue(i+1,1,N);
1563 if (UVL.Length()<nbv-nnn) UVL.Append(UV);
1565 for (j=2; j<nl; j++) {
1566 double y0 = npl.Value(dl+j);
1567 double y1 = npr.Value(dl+j);
1568 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1569 gp_Pnt P = S->Value(UV.X(),UV.Y());
1570 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1571 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1572 NodesL.SetValue(i+1,j,N);
1573 if (i==dl) UVtmp.Append(UV);
1576 for (i=1; i<=UVtmp.Length() && UVL.Length()<nbv-nnn; i++) {
1577 UVL.Append(UVtmp.Value(i));
1580 for (i=1; i<=dl; i++) {
1581 for (j=1; j<nl; j++) {
1584 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i+1,j),
1585 NodesL.Value(i+1,j+1), NodesL.Value(i,j+1));
1586 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1590 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i,j+1),
1591 NodesL.Value(i+1,j+1), NodesL.Value(i+1,j));
1592 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1598 // fill UVL using c2d
1599 for (i=1; i<npl.Length() && UVL.Length()<nbv-nnn; i++) {
1600 UVL.Append(gp_UV (uv_el[i].u, uv_el[i].v));
1604 // step2: create faces for right domain
1605 StdMeshers_Array2OfNode NodesR(1,dr+1,1,nr);
1607 for (j=1; j<=nr; j++)
1608 NodesR.SetValue(1,j,uv_er[nr-j].node);
1611 for (i=1; i<=dr; i++)
1612 NodesR.SetValue(i+1,1,uv_et[nt-1-i].node);
1613 // create and add needed nodes
1614 TColgp_SequenceOfXY UVtmp;
1615 for (i=1; i<=dr; i++) {
1616 double x0 = npt.Value(nt-i);
1619 double y0 = npl.Value(i+1);
1620 double y1 = npr.Value(i+1);
1621 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1622 gp_Pnt P = S->Value(UV.X(),UV.Y());
1623 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1624 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1625 NodesR.SetValue(i+1,nr,N);
1626 if (UVR.Length()<nbv-nnn) UVR.Append(UV);
1628 for (j=2; j<nr; j++) {
1629 double y0 = npl.Value(nbv-j+1);
1630 double y1 = npr.Value(nbv-j+1);
1631 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1632 gp_Pnt P = S->Value(UV.X(),UV.Y());
1633 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1634 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1635 NodesR.SetValue(i+1,j,N);
1636 if (i==dr) UVtmp.Prepend(UV);
1639 for (i=1; i<=UVtmp.Length() && UVR.Length()<nbv-nnn; i++) {
1640 UVR.Append(UVtmp.Value(i));
1643 for (i=1; i<=dr; i++) {
1644 for (j=1; j<nr; j++) {
1647 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i+1,j),
1648 NodesR.Value(i+1,j+1), NodesR.Value(i,j+1));
1649 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1653 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i,j+1),
1654 NodesR.Value(i+1,j+1), NodesR.Value(i+1,j));
1655 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1661 // fill UVR using c2d
1662 for (i=1; i<npr.Length() && UVR.Length()<nbv-nnn; i++) {
1663 UVR.Append(gp_UV(uv_er[i].u, uv_er[i].v));
1667 // step3: create faces for central domain
1668 StdMeshers_Array2OfNode NodesC(1,nb,1,nbv);
1669 // add first line using NodesL
1670 for (i=1; i<=dl+1; i++)
1671 NodesC.SetValue(1,i,NodesL(i,1));
1672 for (i=2; i<=nl; i++)
1673 NodesC.SetValue(1,dl+i,NodesL(dl+1,i));
1674 // add last line using NodesR
1675 for (i=1; i<=dr+1; i++)
1676 NodesC.SetValue(nb,i,NodesR(i,nr));
1677 for (i=1; i<nr; i++)
1678 NodesC.SetValue(nb,dr+i+1,NodesR(dr+1,nr-i));
1679 // add top nodes (last columns)
1680 for (i=dl+2; i<nbh-dr; i++)
1681 NodesC.SetValue(i-dl,nbv,uv_et[i-1].node);
1682 // add bottom nodes (first columns)
1683 for (i=2; i<nb; i++)
1684 NodesC.SetValue(i,1,uv_eb[i-1].node);
1686 // create and add needed nodes
1687 // add linear layers
1688 for (i=2; i<nb; i++) {
1689 double x0 = npt.Value(dl+i);
1691 for (j=1; j<nnn; j++) {
1692 double y0 = npl.Value(nbv-nnn+j);
1693 double y1 = npr.Value(nbv-nnn+j);
1694 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1695 gp_Pnt P = S->Value(UV.X(),UV.Y());
1696 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1697 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1698 NodesC.SetValue(i,nbv-nnn+j,N);
1703 // add diagonal layers
1704 gp_UV A2 = UVR.Value(nbv-nnn);
1705 gp_UV A3 = UVL.Value(nbv-nnn);
1706 for (i=1; i<nbv-nnn; i++) {
1707 gp_UV p1 = UVR.Value(i);
1708 gp_UV p3 = UVL.Value(i);
1709 double y = i / double(nbv-nnn);
1710 for (j=2; j<nb; j++) {
1711 double x = npb.Value(j);
1712 gp_UV p0( uv_eb[j-1].u, uv_eb[j-1].v );
1713 gp_UV p2 = UVT.Value( j-1 );
1714 gp_UV UV = calcUV(x, y, a0, a1, A2, A3, p0,p1,p2,p3 );
1715 gp_Pnt P = S->Value(UV.X(),UV.Y());
1716 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1717 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(),UV.Y());
1718 NodesC.SetValue(j,i+1,N);
1722 for (i=1; i<nb; i++) {
1723 for (j=1; j<nbv; j++) {
1726 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
1727 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
1728 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1732 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i,j+1),
1733 NodesC.Value(i+1,j+1), NodesC.Value(i+1,j));
1734 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1740 else { // New version (!OldVersion)
1741 // step1: create faces for bottom rectangle domain
1742 StdMeshers_Array2OfNode NodesBRD(1,nb,1,nnn-1);
1743 // fill UVL and UVR using c2d
1744 for (j=0; j<nb; j++) {
1745 NodesBRD.SetValue(j+1,1,uv_eb[j].node);
1747 for (i=1; i<nnn-1; i++) {
1748 NodesBRD.SetValue(1,i+1,uv_el[i].node);
1749 NodesBRD.SetValue(nb,i+1,uv_er[i].node);
1750 for (j=2; j<nb; j++) {
1751 double x = npb.Value(j);
1752 double y = (1-x) * npl.Value(i+1) + x * npr.Value(i+1);
1753 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
1754 gp_Pnt P = S->Value(UV.X(),UV.Y());
1755 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1756 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(),UV.Y());
1757 NodesBRD.SetValue(j,i+1,N);
1760 for (j=1; j<nnn-1; j++) {
1761 for (i=1; i<nb; i++) {
1764 myHelper->AddFace(NodesBRD.Value(i,j), NodesBRD.Value(i+1,j),
1765 NodesBRD.Value(i+1,j+1), NodesBRD.Value(i,j+1));
1766 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1770 myHelper->AddFace(NodesBRD.Value(i,j), NodesBRD.Value(i,j+1),
1771 NodesBRD.Value(i+1,j+1), NodesBRD.Value(i+1,j));
1772 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1776 int drl = abs(nr-nl);
1777 // create faces for region C
1778 StdMeshers_Array2OfNode NodesC(1,nb,1,drl+1+addv);
1779 // add nodes from previous region
1780 for (j=1; j<=nb; j++) {
1781 NodesC.SetValue(j,1,NodesBRD.Value(j,nnn-1));
1783 if ((drl+addv) > 0) {
1788 TColgp_SequenceOfXY UVtmp;
1789 double drparam = npr.Value(nr) - npr.Value(nnn-1);
1790 double dlparam = npl.Value(nnn) - npl.Value(nnn-1);
1792 for (i=1; i<=drl; i++) {
1793 // add existed nodes from right edge
1794 NodesC.SetValue(nb,i+1,uv_er[nnn+i-2].node);
1795 //double dtparam = npt.Value(i+1);
1796 y1 = npr.Value(nnn+i-1); // param on right edge
1797 double dpar = (y1 - npr.Value(nnn-1))/drparam;
1798 y0 = npl.Value(nnn-1) + dpar*dlparam; // param on left edge
1799 double dy = y1 - y0;
1800 for (j=1; j<nb; j++) {
1801 double x = npt.Value(i+1) + npb.Value(j)*(1-npt.Value(i+1));
1802 double y = y0 + dy*x;
1803 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
1804 gp_Pnt P = S->Value(UV.X(),UV.Y());
1805 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1806 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1807 NodesC.SetValue(j,i+1,N);
1810 double dy0 = (1-y0)/(addv+1);
1811 double dy1 = (1-y1)/(addv+1);
1812 for (i=1; i<=addv; i++) {
1813 double yy0 = y0 + dy0*i;
1814 double yy1 = y1 + dy1*i;
1815 double dyy = yy1 - yy0;
1816 for (j=1; j<=nb; j++) {
1817 double x = npt.Value(i+1+drl) +
1818 npb.Value(j) * (npt.Value(nt-i) - npt.Value(i+1+drl));
1819 double y = yy0 + dyy*x;
1820 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
1821 gp_Pnt P = S->Value(UV.X(),UV.Y());
1822 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1823 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1824 NodesC.SetValue(j,i+drl+1,N);
1831 TColgp_SequenceOfXY UVtmp;
1832 double dlparam = npl.Value(nl) - npl.Value(nnn-1);
1833 double drparam = npr.Value(nnn) - npr.Value(nnn-1);
1834 double y0 = npl.Value(nnn-1);
1835 double y1 = npr.Value(nnn-1);
1836 for (i=1; i<=drl; i++) {
1837 // add existed nodes from right edge
1838 NodesC.SetValue(1,i+1,uv_el[nnn+i-2].node);
1839 y0 = npl.Value(nnn+i-1); // param on left edge
1840 double dpar = (y0 - npl.Value(nnn-1))/dlparam;
1841 y1 = npr.Value(nnn-1) + dpar*drparam; // param on right edge
1842 double dy = y1 - y0;
1843 for (j=2; j<=nb; j++) {
1844 double x = npb.Value(j)*npt.Value(nt-i);
1845 double y = y0 + dy*x;
1846 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
1847 gp_Pnt P = S->Value(UV.X(),UV.Y());
1848 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1849 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1850 NodesC.SetValue(j,i+1,N);
1853 double dy0 = (1-y0)/(addv+1);
1854 double dy1 = (1-y1)/(addv+1);
1855 for (i=1; i<=addv; i++) {
1856 double yy0 = y0 + dy0*i;
1857 double yy1 = y1 + dy1*i;
1858 double dyy = yy1 - yy0;
1859 for (j=1; j<=nb; j++) {
1860 double x = npt.Value(i+1) +
1861 npb.Value(j) * (npt.Value(nt-i-drl) - npt.Value(i+1));
1862 double y = yy0 + dyy*x;
1863 gp_UV UV = calcUV2(x, y, quad, a0, a1, a2, a3);
1864 gp_Pnt P = S->Value(UV.X(),UV.Y());
1865 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1866 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1867 NodesC.SetValue(j,i+drl+1,N);
1872 for (j=1; j<=drl+addv; j++) {
1873 for (i=1; i<nb; i++) {
1876 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
1877 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
1878 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1882 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i,j+1),
1883 NodesC.Value(i+1,j+1), NodesC.Value(i+1,j));
1884 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1889 StdMeshers_Array2OfNode NodesLast(1,nt,1,2);
1890 for (i=1; i<=nt; i++) {
1891 NodesLast.SetValue(i,2,uv_et[i-1].node);
1894 for (i=n1; i<drl+addv+1; i++) {
1896 NodesLast.SetValue(nnn,1,NodesC.Value(1,i));
1898 for (i=1; i<=nb; i++) {
1900 NodesLast.SetValue(nnn,1,NodesC.Value(i,drl+addv+1));
1902 for (i=drl+addv; i>=n2; i--) {
1904 NodesLast.SetValue(nnn,1,NodesC.Value(nb,i));
1906 for (i=1; i<nt; i++) {
1909 myHelper->AddFace(NodesLast.Value(i,1), NodesLast.Value(i+1,1),
1910 NodesLast.Value(i+1,2), NodesLast.Value(i,2));
1911 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1915 myHelper->AddFace(NodesLast.Value(i,1), NodesLast.Value(i,2),
1916 NodesLast.Value(i+1,2), NodesLast.Value(i+1,2));
1917 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1920 } // if ((drl+addv) > 0)
1922 } // end new version implementation
1929 //=======================================================================
1931 * Evaluate only quandrangle faces
1933 //=======================================================================
1935 bool StdMeshers_Quadrangle_2D::evaluateQuadPref(SMESH_Mesh & aMesh,
1936 const TopoDS_Shape& aShape,
1937 std::vector<int>& aNbNodes,
1938 MapShapeNbElems& aResMap,
1941 // Auxilary key in order to keep old variant
1942 // of meshing after implementation new variant
1943 // for bug 0016220 from Mantis.
1944 bool OldVersion = false;
1945 if (myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
1948 const TopoDS_Face& F = TopoDS::Face(aShape);
1949 Handle(Geom_Surface) S = BRep_Tool::Surface(F);
1951 int nb = aNbNodes[0];
1952 int nr = aNbNodes[1];
1953 int nt = aNbNodes[2];
1954 int nl = aNbNodes[3];
1955 int dh = abs(nb-nt);
1956 int dv = abs(nr-nl);
1960 // it is a base case => not shift
1963 // we have to shift on 2
1972 // we have to shift quad on 1
1979 // we have to shift quad on 3
1989 int nbh = Max(nb,nt);
1990 int nbv = Max(nr,nl);
2005 // add some params to right and left after the first param
2012 int nnn = Min(nr,nl);
2017 // step1: create faces for left domain
2019 nbNodes += dl*(nl-1);
2020 nbFaces += dl*(nl-1);
2022 // step2: create faces for right domain
2024 nbNodes += dr*(nr-1);
2025 nbFaces += dr*(nr-1);
2027 // step3: create faces for central domain
2028 nbNodes += (nb-2)*(nnn-1) + (nbv-nnn-1)*(nb-2);
2029 nbFaces += (nb-1)*(nbv-1);
2031 else { // New version (!OldVersion)
2032 nbNodes += (nnn-2)*(nb-2);
2033 nbFaces += (nnn-2)*(nb-1);
2034 int drl = abs(nr-nl);
2035 nbNodes += drl*(nb-1) + addv*nb;
2036 nbFaces += (drl+addv)*(nb-1) + (nt-1);
2037 } // end new version implementation
2039 std::vector<int> aVec(SMDSEntity_Last);
2040 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aVec[i] = 0;
2042 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces;
2043 aVec[SMDSEntity_Node] = nbNodes + nbFaces*4;
2044 if (aNbNodes.size()==5) {
2045 aVec[SMDSEntity_Quad_Triangle] = aNbNodes[3] - 1;
2046 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces - aNbNodes[3] + 1;
2050 aVec[SMDSEntity_Node] = nbNodes;
2051 aVec[SMDSEntity_Quadrangle] = nbFaces;
2052 if (aNbNodes.size()==5) {
2053 aVec[SMDSEntity_Triangle] = aNbNodes[3] - 1;
2054 aVec[SMDSEntity_Quadrangle] = nbFaces - aNbNodes[3] + 1;
2057 SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
2058 aResMap.insert(std::make_pair(sm,aVec));
2063 //=============================================================================
2064 /*! Split quadrangle in to 2 triangles by smallest diagonal
2067 //=============================================================================
2069 void StdMeshers_Quadrangle_2D::splitQuad(SMESHDS_Mesh * theMeshDS,
2071 const SMDS_MeshNode* theNode1,
2072 const SMDS_MeshNode* theNode2,
2073 const SMDS_MeshNode* theNode3,
2074 const SMDS_MeshNode* theNode4)
2076 SMDS_MeshFace* face;
2077 if ( SMESH_TNodeXYZ( theNode1 ).SquareDistance( theNode3 ) >
2078 SMESH_TNodeXYZ( theNode2 ).SquareDistance( theNode4 ) )
2080 face = myHelper->AddFace(theNode2, theNode4 , theNode1);
2081 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2082 face = myHelper->AddFace(theNode2, theNode3, theNode4);
2083 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2087 face = myHelper->AddFace(theNode1, theNode2 ,theNode3);
2088 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2089 face = myHelper->AddFace(theNode1, theNode3, theNode4);
2090 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2096 enum uvPos { UV_A0, UV_A1, UV_A2, UV_A3, UV_B, UV_R, UV_T, UV_L, UV_SIZE };
2098 inline SMDS_MeshNode* makeNode( UVPtStruct & uvPt,
2100 FaceQuadStruct::Ptr& quad,
2102 SMESH_MesherHelper* helper,
2103 Handle(Geom_Surface) S)
2105 const vector<UVPtStruct>& uv_eb = quad->side[QUAD_BOTTOM_SIDE]->GetUVPtStruct();
2106 const vector<UVPtStruct>& uv_et = quad->side[QUAD_TOP_SIDE ]->GetUVPtStruct();
2107 double rBot = ( uv_eb.size() - 1 ) * uvPt.normParam;
2108 double rTop = ( uv_et.size() - 1 ) * uvPt.normParam;
2109 int iBot = int( rBot );
2110 int iTop = int( rTop );
2111 double xBot = uv_eb[ iBot ].normParam + ( rBot - iBot ) * ( uv_eb[ iBot+1 ].normParam - uv_eb[ iBot ].normParam );
2112 double xTop = uv_et[ iTop ].normParam + ( rTop - iTop ) * ( uv_et[ iTop+1 ].normParam - uv_et[ iTop ].normParam );
2113 double x = xBot + y * ( xTop - xBot );
2115 gp_UV uv = calcUV(/*x,y=*/x, y,
2116 /*a0,...=*/UVs[UV_A0], UVs[UV_A1], UVs[UV_A2], UVs[UV_A3],
2117 /*p0=*/quad->side[QUAD_BOTTOM_SIDE]->Value2d( x ).XY(),
2119 /*p2=*/quad->side[QUAD_TOP_SIDE ]->Value2d( x ).XY(),
2120 /*p3=*/UVs[ UV_L ]);
2121 gp_Pnt P = S->Value( uv.X(), uv.Y() );
2124 return helper->AddNode(P.X(), P.Y(), P.Z(), 0, uv.X(), uv.Y() );
2127 void reduce42( const vector<UVPtStruct>& curr_base,
2128 vector<UVPtStruct>& next_base,
2130 int & next_base_len,
2131 FaceQuadStruct::Ptr& quad,
2134 SMESH_MesherHelper* helper,
2135 Handle(Geom_Surface)& S)
2137 // add one "HH": nodes a,b,c,d,e and faces 1,2,3,4,5,6
2139 // .-----a-----b i + 1
2150 const SMDS_MeshNode*& Na = next_base[ ++next_base_len ].node;
2152 Na = makeNode( next_base[ next_base_len ], y, quad, UVs, helper, S );
2155 const SMDS_MeshNode*& Nb = next_base[ ++next_base_len ].node;
2157 Nb = makeNode( next_base[ next_base_len ], y, quad, UVs, helper, S );
2160 double u = (curr_base[j + 2].u + next_base[next_base_len - 2].u) / 2.0;
2161 double v = (curr_base[j + 2].v + next_base[next_base_len - 2].v) / 2.0;
2162 gp_Pnt P = S->Value(u,v);
2163 SMDS_MeshNode* Nc = helper->AddNode(P.X(), P.Y(), P.Z(), 0, u, v);
2166 u = (curr_base[j + 2].u + next_base[next_base_len - 1].u) / 2.0;
2167 v = (curr_base[j + 2].v + next_base[next_base_len - 1].v) / 2.0;
2169 SMDS_MeshNode* Nd = helper->AddNode(P.X(), P.Y(), P.Z(), 0, u, v);
2172 u = (curr_base[j + 2].u + next_base[next_base_len].u) / 2.0;
2173 v = (curr_base[j + 2].v + next_base[next_base_len].v) / 2.0;
2175 SMDS_MeshNode* Ne = helper->AddNode(P.X(), P.Y(), P.Z(), 0, u, v);
2178 helper->AddFace(curr_base[j + 0].node,
2179 curr_base[j + 1].node, Nc,
2180 next_base[next_base_len - 2].node);
2182 helper->AddFace(curr_base[j + 1].node,
2183 curr_base[j + 2].node, Nd, Nc);
2185 helper->AddFace(curr_base[j + 2].node,
2186 curr_base[j + 3].node, Ne, Nd);
2188 helper->AddFace(curr_base[j + 3].node,
2189 curr_base[j + 4].node, Nb, Ne);
2191 helper->AddFace(Nc, Nd, Na, next_base[next_base_len - 2].node);
2193 helper->AddFace(Nd, Ne, Nb, Na);
2196 void reduce31( const vector<UVPtStruct>& curr_base,
2197 vector<UVPtStruct>& next_base,
2199 int & next_base_len,
2200 FaceQuadStruct::Ptr& quad,
2203 SMESH_MesherHelper* helper,
2204 Handle(Geom_Surface)& S)
2206 // add one "H": nodes b,c,e and faces 1,2,4,5
2208 // .---------b i + 1
2219 const SMDS_MeshNode*& Nb = next_base[ ++next_base_len ].node;
2221 Nb = makeNode( next_base[ next_base_len ], y, quad, UVs, helper, S );
2224 double u1 = (curr_base[ j ].u + next_base[ next_base_len-1 ].u ) / 2.0;
2225 double u2 = (curr_base[ j+3 ].u + next_base[ next_base_len ].u ) / 2.0;
2226 double u3 = (u2 - u1) / 3.0;
2228 double v1 = (curr_base[ j ].v + next_base[ next_base_len-1 ].v ) / 2.0;
2229 double v2 = (curr_base[ j+3 ].v + next_base[ next_base_len ].v ) / 2.0;
2230 double v3 = (v2 - v1) / 3.0;
2234 gp_Pnt P = S->Value(u,v);
2235 SMDS_MeshNode* Nc = helper->AddNode( P.X(), P.Y(), P.Z(), 0, u, v );
2240 SMDS_MeshNode* Ne = helper->AddNode( P.X(), P.Y(), P.Z(), 0, u, v );
2244 helper->AddFace( curr_base[ j + 0 ].node,
2245 curr_base[ j + 1 ].node,
2247 next_base[ next_base_len - 1 ].node);
2249 helper->AddFace( curr_base[ j + 1 ].node,
2250 curr_base[ j + 2 ].node, Ne, Nc);
2252 helper->AddFace( curr_base[ j + 2 ].node,
2253 curr_base[ j + 3 ].node, Nb, Ne);
2255 helper->AddFace(Nc, Ne, Nb,
2256 next_base[ next_base_len - 1 ].node);
2259 typedef void (* PReduceFunction) ( const vector<UVPtStruct>& curr_base,
2260 vector<UVPtStruct>& next_base,
2262 int & next_base_len,
2263 FaceQuadStruct::Ptr & quad,
2266 SMESH_MesherHelper* helper,
2267 Handle(Geom_Surface)& S);
2271 //=======================================================================
2273 * Implementation of Reduced algorithm (meshing with quadrangles only)
2275 //=======================================================================
2277 bool StdMeshers_Quadrangle_2D::computeReduced (SMESH_Mesh & aMesh,
2278 const TopoDS_Face& aFace,
2279 FaceQuadStruct::Ptr quad)
2281 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
2282 Handle(Geom_Surface) S = BRep_Tool::Surface(aFace);
2283 int i,j,geomFaceID = meshDS->ShapeToIndex(aFace);
2285 int nb = quad->side[0]->NbPoints(); // bottom
2286 int nr = quad->side[1]->NbPoints(); // right
2287 int nt = quad->side[2]->NbPoints(); // top
2288 int nl = quad->side[3]->NbPoints(); // left
2290 // Simple Reduce 10->8->6->4 (3 steps) Multiple Reduce 10->4 (1 step)
2292 // .-----.-----.-----.-----. .-----.-----.-----.-----.
2293 // | / \ | / \ | | / \ | / \ |
2294 // | / .--.--. \ | | / \ | / \ |
2295 // | / / | \ \ | | / .----.----. \ |
2296 // .---.---.---.---.---.---. | / / \ | / \ \ |
2297 // | / / \ | / \ \ | | / / \ | / \ \ |
2298 // | / / .-.-. \ \ | | / / .---.---. \ \ |
2299 // | / / / | \ \ \ | | / / / \ | / \ \ \ |
2300 // .--.--.--.--.--.--.--.--. | / / / \ | / \ \ \ |
2301 // | / / / \ | / \ \ \ | | / / / .-.-. \ \ \ |
2302 // | / / / .-.-. \ \ \ | | / / / / | \ \ \ \ |
2303 // | / / / / | \ \ \ \ | | / / / / | \ \ \ \ |
2304 // .-.-.-.--.--.--.--.-.-.-. .-.-.-.--.--.--.--.-.-.-.
2306 bool MultipleReduce = false;
2318 else if (nb == nt) {
2319 nr1 = nb; // and == nt
2333 // number of rows and columns
2334 int nrows = nr1 - 1;
2335 int ncol_top = nt1 - 1;
2336 int ncol_bot = nb1 - 1;
2337 // number of rows needed to reduce ncol_bot to ncol_top using simple 3->1 "tree" (see below)
2339 int( ceil( log( double(ncol_bot) / ncol_top) / log( 3.))); // = log x base 3
2340 if ( nrows < nrows_tree31 )
2342 MultipleReduce = true;
2343 error( COMPERR_WARNING,
2344 SMESH_Comment("To use 'Reduced' transition, "
2345 "number of face rows should be at least ")
2346 << nrows_tree31 << ". Actual number of face rows is " << nrows << ". "
2347 "'Quadrangle preference (reversed)' transion has been used.");
2351 if (MultipleReduce) { // == computeQuadPref QUAD_QUADRANGLE_PREF_REVERSED
2352 //==================================================
2353 int dh = abs(nb-nt);
2354 int dv = abs(nr-nl);
2358 // it is a base case => not shift quad but may be replacement is need
2362 // we have to shift quad on 2
2368 // we have to shift quad on 1
2372 // we have to shift quad on 3
2377 nb = quad->side[0]->NbPoints();
2378 nr = quad->side[1]->NbPoints();
2379 nt = quad->side[2]->NbPoints();
2380 nl = quad->side[3]->NbPoints();
2383 int nbh = Max(nb,nt);
2384 int nbv = Max(nr,nl);
2397 const vector<UVPtStruct>& uv_eb = quad->side[0]->GetUVPtStruct(true,0);
2398 const vector<UVPtStruct>& uv_er = quad->side[1]->GetUVPtStruct(false,1);
2399 const vector<UVPtStruct>& uv_et = quad->side[2]->GetUVPtStruct(true,1);
2400 const vector<UVPtStruct>& uv_el = quad->side[3]->GetUVPtStruct(false,0);
2402 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
2403 return error(COMPERR_BAD_INPUT_MESH);
2405 updateDegenUV( quad );
2407 // arrays for normalized params
2408 TColStd_SequenceOfReal npb, npr, npt, npl;
2409 for (j = 0; j < nb; j++) {
2410 npb.Append(uv_eb[j].normParam);
2412 for (i = 0; i < nr; i++) {
2413 npr.Append(uv_er[i].normParam);
2415 for (j = 0; j < nt; j++) {
2416 npt.Append(uv_et[j].normParam);
2418 for (i = 0; i < nl; i++) {
2419 npl.Append(uv_el[i].normParam);
2423 // orientation of face and 3 main domain for future faces
2429 // left | | | | rigth
2436 // add some params to right and left after the first param
2439 double dpr = (npr.Value(2) - npr.Value(1))/(dr+1);
2440 for (i=1; i<=dr; i++) {
2441 npr.InsertAfter(1,npr.Value(2)-dpr);
2445 dpr = (npl.Value(2) - npl.Value(1))/(dl+1);
2446 for (i=1; i<=dl; i++) {
2447 npl.InsertAfter(1,npl.Value(2)-dpr);
2450 gp_XY a0 (uv_eb.front().u, uv_eb.front().v);
2451 gp_XY a1 (uv_eb.back().u, uv_eb.back().v);
2452 gp_XY a2 (uv_et.back().u, uv_et.back().v);
2453 gp_XY a3 (uv_et.front().u, uv_et.front().v);
2455 int nnn = Min(nr,nl);
2456 // auxilary sequence of XY for creation of nodes
2457 // in the bottom part of central domain
2458 // it's length must be == nbv-nnn-1
2459 TColgp_SequenceOfXY UVL;
2460 TColgp_SequenceOfXY UVR;
2461 //==================================================
2463 // step1: create faces for left domain
2464 StdMeshers_Array2OfNode NodesL(1,dl+1,1,nl);
2466 for (j=1; j<=nl; j++)
2467 NodesL.SetValue(1,j,uv_el[j-1].node);
2470 for (i=1; i<=dl; i++)
2471 NodesL.SetValue(i+1,nl,uv_et[i].node);
2472 // create and add needed nodes
2473 TColgp_SequenceOfXY UVtmp;
2474 for (i=1; i<=dl; i++) {
2475 double x0 = npt.Value(i+1);
2478 double y0 = npl.Value(i+1);
2479 double y1 = npr.Value(i+1);
2480 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2481 gp_Pnt P = S->Value(UV.X(),UV.Y());
2482 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2483 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2484 NodesL.SetValue(i+1,1,N);
2485 if (UVL.Length()<nbv-nnn-1) UVL.Append(UV);
2487 for (j=2; j<nl; j++) {
2488 double y0 = npl.Value(dl+j);
2489 double y1 = npr.Value(dl+j);
2490 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2491 gp_Pnt P = S->Value(UV.X(),UV.Y());
2492 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2493 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2494 NodesL.SetValue(i+1,j,N);
2495 if (i==dl) UVtmp.Append(UV);
2498 for (i=1; i<=UVtmp.Length() && UVL.Length()<nbv-nnn-1; i++) {
2499 UVL.Append(UVtmp.Value(i));
2502 for (i=1; i<=dl; i++) {
2503 for (j=1; j<nl; j++) {
2505 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i+1,j),
2506 NodesL.Value(i+1,j+1), NodesL.Value(i,j+1));
2507 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2512 // fill UVL using c2d
2513 for (i=1; i<npl.Length() && UVL.Length()<nbv-nnn-1; i++) {
2514 UVL.Append(gp_UV (uv_el[i].u, uv_el[i].v));
2518 // step2: create faces for right domain
2519 StdMeshers_Array2OfNode NodesR(1,dr+1,1,nr);
2521 for (j=1; j<=nr; j++)
2522 NodesR.SetValue(1,j,uv_er[nr-j].node);
2525 for (i=1; i<=dr; i++)
2526 NodesR.SetValue(i+1,1,uv_et[nt-1-i].node);
2527 // create and add needed nodes
2528 TColgp_SequenceOfXY UVtmp;
2529 for (i=1; i<=dr; i++) {
2530 double x0 = npt.Value(nt-i);
2533 double y0 = npl.Value(i+1);
2534 double y1 = npr.Value(i+1);
2535 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2536 gp_Pnt P = S->Value(UV.X(),UV.Y());
2537 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2538 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2539 NodesR.SetValue(i+1,nr,N);
2540 if (UVR.Length()<nbv-nnn-1) UVR.Append(UV);
2542 for (j=2; j<nr; j++) {
2543 double y0 = npl.Value(nbv-j+1);
2544 double y1 = npr.Value(nbv-j+1);
2545 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2546 gp_Pnt P = S->Value(UV.X(),UV.Y());
2547 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2548 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2549 NodesR.SetValue(i+1,j,N);
2550 if (i==dr) UVtmp.Prepend(UV);
2553 for (i=1; i<=UVtmp.Length() && UVR.Length()<nbv-nnn-1; i++) {
2554 UVR.Append(UVtmp.Value(i));
2557 for (i=1; i<=dr; i++) {
2558 for (j=1; j<nr; j++) {
2560 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i+1,j),
2561 NodesR.Value(i+1,j+1), NodesR.Value(i,j+1));
2562 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2567 // fill UVR using c2d
2568 for (i=1; i<npr.Length() && UVR.Length()<nbv-nnn-1; i++) {
2569 UVR.Append(gp_UV(uv_er[i].u, uv_er[i].v));
2573 // step3: create faces for central domain
2574 StdMeshers_Array2OfNode NodesC(1,nb,1,nbv);
2575 // add first line using NodesL
2576 for (i=1; i<=dl+1; i++)
2577 NodesC.SetValue(1,i,NodesL(i,1));
2578 for (i=2; i<=nl; i++)
2579 NodesC.SetValue(1,dl+i,NodesL(dl+1,i));
2580 // add last line using NodesR
2581 for (i=1; i<=dr+1; i++)
2582 NodesC.SetValue(nb,i,NodesR(i,nr));
2583 for (i=1; i<nr; i++)
2584 NodesC.SetValue(nb,dr+i+1,NodesR(dr+1,nr-i));
2585 // add top nodes (last columns)
2586 for (i=dl+2; i<nbh-dr; i++)
2587 NodesC.SetValue(i-dl,nbv,uv_et[i-1].node);
2588 // add bottom nodes (first columns)
2589 for (i=2; i<nb; i++)
2590 NodesC.SetValue(i,1,uv_eb[i-1].node);
2592 // create and add needed nodes
2593 // add linear layers
2594 for (i=2; i<nb; i++) {
2595 double x0 = npt.Value(dl+i);
2597 for (j=1; j<nnn; j++) {
2598 double y0 = npl.Value(nbv-nnn+j);
2599 double y1 = npr.Value(nbv-nnn+j);
2600 gp_UV UV = calcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2601 gp_Pnt P = S->Value(UV.X(),UV.Y());
2602 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2603 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2604 NodesC.SetValue(i,nbv-nnn+j,N);
2607 // add diagonal layers
2608 for (i=1; i<nbv-nnn; i++) {
2609 double du = UVR.Value(i).X() - UVL.Value(i).X();
2610 double dv = UVR.Value(i).Y() - UVL.Value(i).Y();
2611 for (j=2; j<nb; j++) {
2612 double u = UVL.Value(i).X() + du*npb.Value(j);
2613 double v = UVL.Value(i).Y() + dv*npb.Value(j);
2614 gp_Pnt P = S->Value(u,v);
2615 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2616 meshDS->SetNodeOnFace(N, geomFaceID, u, v);
2617 NodesC.SetValue(j,i+1,N);
2621 for (i=1; i<nb; i++) {
2622 for (j=1; j<nbv; j++) {
2624 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
2625 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
2626 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2629 } // end Multiple Reduce implementation
2630 else { // Simple Reduce (!MultipleReduce)
2631 //=========================================================
2634 // it is a base case => not shift quad
2635 //shiftQuad(quad,0,true);
2638 // we have to shift quad on 2
2644 // we have to shift quad on 1
2648 // we have to shift quad on 3
2653 nb = quad->side[0]->NbPoints();
2654 nr = quad->side[1]->NbPoints();
2655 nt = quad->side[2]->NbPoints();
2656 nl = quad->side[3]->NbPoints();
2658 // number of rows and columns
2659 int nrows = nr - 1; // and also == nl - 1
2660 int ncol_top = nt - 1;
2661 int ncol_bot = nb - 1;
2662 int npair_top = ncol_top / 2;
2663 // maximum number of bottom elements for "linear" simple reduce 4->2
2664 int max_lin42 = ncol_top + npair_top * 2 * nrows;
2665 // maximum number of bottom elements for "linear" simple reduce 3->1
2666 int max_lin31 = ncol_top + ncol_top * 2 * nrows;
2667 // maximum number of bottom elements for "tree" simple reduce 4->2
2669 // number of rows needed to reduce ncol_bot to ncol_top using simple 4->2 "tree"
2670 int nrows_tree42 = int( log( (double)(ncol_bot / ncol_top) )/log((double)2) ); // needed to avoid overflow at pow(2) while computing max_tree42
2671 if (nrows_tree42 < nrows) {
2672 max_tree42 = npair_top * pow(2.0, nrows + 1);
2673 if ( ncol_top > npair_top * 2 ) {
2674 int delta = ncol_bot - max_tree42;
2675 for (int irow = 1; irow < nrows; irow++) {
2676 int nfour = delta / 4;
2679 if (delta <= (ncol_top - npair_top * 2))
2680 max_tree42 = ncol_bot;
2683 // maximum number of bottom elements for "tree" simple reduce 3->1
2684 //int max_tree31 = ncol_top * pow(3.0, nrows);
2685 bool is_lin_31 = false;
2686 bool is_lin_42 = false;
2687 bool is_tree_31 = false;
2688 bool is_tree_42 = false;
2689 int max_lin = max_lin42;
2690 if (ncol_bot > max_lin42) {
2691 if (ncol_bot <= max_lin31) {
2693 max_lin = max_lin31;
2697 // if ncol_bot is a 3*n or not 2*n
2698 if ((ncol_bot/3)*3 == ncol_bot || (ncol_bot/2)*2 != ncol_bot) {
2700 max_lin = max_lin31;
2706 if (ncol_bot > max_lin) { // not "linear"
2707 is_tree_31 = (ncol_bot > max_tree42);
2708 if (ncol_bot <= max_tree42) {
2709 if ((ncol_bot/3)*3 == ncol_bot || (ncol_bot/2)*2 != ncol_bot) {
2718 const vector<UVPtStruct>& uv_eb = quad->side[0]->GetUVPtStruct(true,0);
2719 const vector<UVPtStruct>& uv_er = quad->side[1]->GetUVPtStruct(false,1);
2720 const vector<UVPtStruct>& uv_et = quad->side[2]->GetUVPtStruct(true,1);
2721 const vector<UVPtStruct>& uv_el = quad->side[3]->GetUVPtStruct(false,0);
2723 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
2724 return error(COMPERR_BAD_INPUT_MESH);
2726 myHelper->SetElementsOnShape( true );
2728 gp_UV uv[ UV_SIZE ];
2729 uv[ UV_A0 ].SetCoord( uv_eb.front().u, uv_eb.front().v);
2730 uv[ UV_A1 ].SetCoord( uv_eb.back().u, uv_eb.back().v );
2731 uv[ UV_A2 ].SetCoord( uv_et.back().u, uv_et.back().v );
2732 uv[ UV_A3 ].SetCoord( uv_et.front().u, uv_et.front().v);
2734 vector<UVPtStruct> curr_base = uv_eb, next_base;
2736 UVPtStruct nullUVPtStruct; nullUVPtStruct.node = 0;
2738 int curr_base_len = nb;
2739 int next_base_len = 0;
2742 { // ------------------------------------------------------------------
2743 // New algorithm implemented by request of IPAL22856
2744 // "2D quadrangle mesher of reduced type works wrong"
2745 // http://bugtracker.opencascade.com/show_bug.cgi?id=22856
2747 // the algorithm is following: all reduces are centred in horizontal
2748 // direction and are distributed among all rows
2750 if (ncol_bot > max_tree42) {
2754 if ((ncol_top/3)*3 == ncol_top ) {
2762 const int col_top_size = is_lin_42 ? 2 : 1;
2763 const int col_base_size = is_lin_42 ? 4 : 3;
2765 // Compute nb of "columns" (like in "linear" simple reducing) in all rows
2767 vector<int> nb_col_by_row;
2769 int delta_all = nb - nt;
2770 int delta_one_col = nrows * 2;
2771 int nb_col = delta_all / delta_one_col;
2772 int remainder = delta_all - nb_col * delta_one_col;
2773 if (remainder > 0) {
2776 if ( nb_col * col_top_size >= nt ) // == "tree" reducing situation
2778 // top row is full (all elements reduced), add "columns" one by one
2779 // in rows below until all bottom elements are reduced
2780 nb_col = ( nt - 1 ) / col_top_size;
2781 nb_col_by_row.resize( nrows, nb_col );
2782 int nbrows_not_full = nrows - 1;
2783 int cur_top_size = nt - 1;
2784 remainder = delta_all - nb_col * delta_one_col;
2785 while ( remainder > 0 )
2787 delta_one_col = nbrows_not_full * 2;
2788 int nb_col_add = remainder / delta_one_col;
2789 cur_top_size += 2 * nb_col_by_row[ nbrows_not_full ];
2790 int nb_col_free = cur_top_size / col_top_size - nb_col_by_row[ nbrows_not_full-1 ];
2791 if ( nb_col_add > nb_col_free )
2792 nb_col_add = nb_col_free;
2793 for ( int irow = 0; irow < nbrows_not_full; ++irow )
2794 nb_col_by_row[ irow ] += nb_col_add;
2796 remainder -= nb_col_add * delta_one_col;
2799 else // == "linear" reducing situation
2801 nb_col_by_row.resize( nrows, nb_col );
2803 for ( int irow = remainder / 2; irow < nrows; ++irow )
2804 nb_col_by_row[ irow ]--;
2809 PReduceFunction reduceFunction = & ( is_lin_42 ? reduce42 : reduce31 );
2811 const int reduce_grp_size = is_lin_42 ? 4 : 3;
2813 for (i = 1; i < nr; i++) // layer by layer
2815 nb_col = nb_col_by_row[ i-1 ];
2816 int nb_next = curr_base_len - nb_col * 2;
2817 if (nb_next < nt) nb_next = nt;
2819 const double y = uv_el[ i ].normParam;
2821 if ( i + 1 == nr ) // top
2828 next_base.resize( nb_next, nullUVPtStruct );
2829 next_base.front() = uv_el[i];
2830 next_base.back() = uv_er[i];
2832 // compute normalized param u
2833 double du = 1. / ( nb_next - 1 );
2834 next_base[0].normParam = 0.;
2835 for ( j = 1; j < nb_next; ++j )
2836 next_base[j].normParam = next_base[j-1].normParam + du;
2838 uv[ UV_L ].SetCoord( next_base.front().u, next_base.front().v );
2839 uv[ UV_R ].SetCoord( next_base.back().u, next_base.back().v );
2841 int free_left = ( curr_base_len - 1 - nb_col * col_base_size ) / 2;
2842 int free_middle = curr_base_len - 1 - nb_col * col_base_size - 2 * free_left;
2844 // not reduced left elements
2845 for (j = 0; j < free_left; j++)
2848 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
2850 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
2852 myHelper->AddFace(curr_base[ j ].node,
2853 curr_base[ j+1 ].node,
2855 next_base[ next_base_len-1 ].node);
2858 for (int icol = 1; icol <= nb_col; icol++)
2861 reduceFunction( curr_base, next_base, j, next_base_len, quad, uv, y, myHelper, S );
2863 j += reduce_grp_size;
2865 // elements in the middle of "columns" added for symmetry
2866 if ( free_middle > 0 && ( nb_col % 2 == 0 ) && icol == nb_col / 2 )
2868 for (int imiddle = 1; imiddle <= free_middle; imiddle++) {
2869 // f (i + 1, j + imiddle)
2870 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
2872 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
2874 myHelper->AddFace(curr_base[ j-1+imiddle ].node,
2875 curr_base[ j +imiddle ].node,
2877 next_base[ next_base_len-1 ].node);
2883 // not reduced right elements
2884 for (; j < curr_base_len-1; j++) {
2886 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
2888 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
2890 myHelper->AddFace(curr_base[ j ].node,
2891 curr_base[ j+1 ].node,
2893 next_base[ next_base_len-1 ].node);
2896 curr_base_len = next_base_len + 1;
2898 curr_base.swap( next_base );
2902 else if ( is_tree_42 || is_tree_31 )
2904 // "tree" simple reduce "42": 2->4->8->16->32->...
2906 // .-------------------------------.-------------------------------. nr
2908 // | \ .---------------.---------------. / |
2910 // .---------------.---------------.---------------.---------------.
2911 // | \ | / | \ | / |
2912 // | \ .-------.-------. / | \ .-------.-------. / |
2913 // | | | | | | | | |
2914 // .-------.-------.-------.-------.-------.-------.-------.-------. i
2915 // |\ | /|\ | /|\ | /|\ | /|
2916 // | \.---.---./ | \.---.---./ | \.---.---./ | \.---.---./ |
2917 // | | | | | | | | | | | | | | | | |
2918 // .---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.
2919 // |\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|
2920 // | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. |
2921 // | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
2922 // .-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-. 1
2925 // "tree" simple reduce "31": 1->3->9->27->...
2927 // .-----------------------------------------------------. nr
2929 // | .-----------------. |
2931 // .-----------------.-----------------.-----------------.
2932 // | \ / | \ / | \ / |
2933 // | .-----. | .-----. | .-----. | i
2934 // | | | | | | | | | |
2935 // .-----.-----.-----.-----.-----.-----.-----.-----.-----.
2936 // |\ /|\ /|\ /|\ /|\ /|\ /|\ /|\ /|\ /|
2937 // | .-. | .-. | .-. | .-. | .-. | .-. | .-. | .-. | .-. |
2938 // | | | | | | | | | | | | | | | | | | | | | | | | | | | |
2939 // .-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-. 1
2942 PReduceFunction reduceFunction = & ( is_tree_42 ? reduce42 : reduce31 );
2944 const int reduce_grp_size = is_tree_42 ? 4 : 3;
2946 for (i = 1; i < nr; i++) // layer by layer
2948 // to stop reducing, if number of nodes reaches nt
2949 int delta = curr_base_len - nt;
2951 // to calculate normalized parameter, we must know number of points in next layer
2952 int nb_reduce_groups = (curr_base_len - 1) / reduce_grp_size;
2953 int nb_next = nb_reduce_groups * (reduce_grp_size-2) + (curr_base_len - nb_reduce_groups*reduce_grp_size);
2954 if (nb_next < nt) nb_next = nt;
2956 const double y = uv_el[ i ].normParam;
2958 if ( i + 1 == nr ) // top
2965 next_base.resize( nb_next, nullUVPtStruct );
2966 next_base.front() = uv_el[i];
2967 next_base.back() = uv_er[i];
2969 // compute normalized param u
2970 double du = 1. / ( nb_next - 1 );
2971 next_base[0].normParam = 0.;
2972 for ( j = 1; j < nb_next; ++j )
2973 next_base[j].normParam = next_base[j-1].normParam + du;
2975 uv[ UV_L ].SetCoord( next_base.front().u, next_base.front().v );
2976 uv[ UV_R ].SetCoord( next_base.back().u, next_base.back().v );
2978 for (j = 0; j+reduce_grp_size < curr_base_len && delta > 0; j+=reduce_grp_size, delta-=2)
2980 reduceFunction( curr_base, next_base, j, next_base_len, quad, uv, y, myHelper, S );
2983 // not reduced side elements (if any)
2984 for (; j < curr_base_len-1; j++)
2987 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
2989 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
2991 myHelper->AddFace(curr_base[ j ].node,
2992 curr_base[ j+1 ].node,
2994 next_base[ next_base_len-1 ].node);
2996 curr_base_len = next_base_len + 1;
2998 curr_base.swap( next_base );
3000 } // end "tree" simple reduce
3002 else if ( is_lin_42 || is_lin_31 ) {
3003 // "linear" simple reduce "31": 2->6->10->14
3005 // .-----------------------------.-----------------------------. nr
3007 // | .---------. | .---------. |
3009 // .---------.---------.---------.---------.---------.---------.
3010 // | / \ / \ | / \ / \ |
3011 // | / .-----. \ | / .-----. \ | i
3012 // | / | | \ | / | | \ |
3013 // .-----.-----.-----.-----.-----.-----.-----.-----.-----.-----.
3014 // | / / \ / \ \ | / / \ / \ \ |
3015 // | / / .-. \ \ | / / .-. \ \ |
3016 // | / / / \ \ \ | / / / \ \ \ |
3017 // .--.----.---.-----.---.-----.-.--.----.---.-----.---.-----.-. 1
3020 // "linear" simple reduce "42": 4->8->12->16
3022 // .---------------.---------------.---------------.---------------. nr
3023 // | \ | / | \ | / |
3024 // | \ .-------.-------. / | \ .-------.-------. / |
3025 // | | | | | | | | |
3026 // .-------.-------.-------.-------.-------.-------.-------.-------.
3027 // | / \ | / \ | / \ | / \ |
3028 // | / \.----.----./ \ | / \.----.----./ \ | i
3029 // | / | | | \ | / | | | \ |
3030 // .-----.----.----.----.----.-----.-----.----.----.----.----.-----.
3031 // | / / \ | / \ \ | / / \ | / \ \ |
3032 // | / / .-.-. \ \ | / / .-.-. \ \ |
3033 // | / / / | \ \ \ | / / / | \ \ \ |
3034 // .---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.---. 1
3037 // nt = 5, nb = 7, nr = 4
3038 //int delta_all = 2;
3039 //int delta_one_col = 6;
3041 //int remainder = 2;
3042 //if (remainder > 0) nb_col++;
3044 //int free_left = 1;
3046 //int free_middle = 4;
3048 int delta_all = nb - nt;
3049 int delta_one_col = (nr - 1) * 2;
3050 int nb_col = delta_all / delta_one_col;
3051 int remainder = delta_all - nb_col * delta_one_col;
3052 if (remainder > 0) {
3055 const int col_top_size = is_lin_42 ? 2 : 1;
3056 int free_left = ((nt - 1) - nb_col * col_top_size) / 2;
3057 free_left += nr - 2;
3058 int free_middle = (nr - 2) * 2;
3059 if (remainder > 0 && nb_col == 1) {
3060 int nb_rows_short_col = remainder / 2;
3061 int nb_rows_thrown = (nr - 1) - nb_rows_short_col;
3062 free_left -= nb_rows_thrown;
3065 // nt = 5, nb = 17, nr = 4
3066 //int delta_all = 12;
3067 //int delta_one_col = 6;
3069 //int remainder = 0;
3070 //int free_left = 2;
3071 //int free_middle = 4;
3073 PReduceFunction reduceFunction = & ( is_lin_42 ? reduce42 : reduce31 );
3075 const int reduce_grp_size = is_lin_42 ? 4 : 3;
3077 for (i = 1; i < nr; i++, free_middle -= 2, free_left -= 1) // layer by layer
3079 // to calculate normalized parameter, we must know number of points in next layer
3080 int nb_next = curr_base_len - nb_col * 2;
3081 if (remainder > 0 && i > remainder / 2)
3082 // take into account short "column"
3084 if (nb_next < nt) nb_next = nt;
3086 const double y = uv_el[ i ].normParam;
3088 if ( i + 1 == nr ) // top
3095 next_base.resize( nb_next, nullUVPtStruct );
3096 next_base.front() = uv_el[i];
3097 next_base.back() = uv_er[i];
3099 // compute normalized param u
3100 double du = 1. / ( nb_next - 1 );
3101 next_base[0].normParam = 0.;
3102 for ( j = 1; j < nb_next; ++j )
3103 next_base[j].normParam = next_base[j-1].normParam + du;
3105 uv[ UV_L ].SetCoord( next_base.front().u, next_base.front().v );
3106 uv[ UV_R ].SetCoord( next_base.back().u, next_base.back().v );
3108 // not reduced left elements
3109 for (j = 0; j < free_left; j++)
3112 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3114 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3116 myHelper->AddFace(curr_base[ j ].node,
3117 curr_base[ j+1 ].node,
3119 next_base[ next_base_len-1 ].node);
3122 for (int icol = 1; icol <= nb_col; icol++) {
3124 if (remainder > 0 && icol == nb_col && i > remainder / 2)
3125 // stop short "column"
3129 reduceFunction( curr_base, next_base, j, next_base_len, quad, uv, y, myHelper, S );
3131 j += reduce_grp_size;
3133 // not reduced middle elements
3134 if (icol < nb_col) {
3135 if (remainder > 0 && icol == nb_col - 1 && i > remainder / 2)
3136 // pass middle elements before stopped short "column"
3139 int free_add = free_middle;
3140 if (remainder > 0 && icol == nb_col - 1)
3141 // next "column" is short
3142 free_add -= (nr - 1) - (remainder / 2);
3144 for (int imiddle = 1; imiddle <= free_add; imiddle++) {
3145 // f (i + 1, j + imiddle)
3146 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3148 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3150 myHelper->AddFace(curr_base[ j-1+imiddle ].node,
3151 curr_base[ j +imiddle ].node,
3153 next_base[ next_base_len-1 ].node);
3159 // not reduced right elements
3160 for (; j < curr_base_len-1; j++) {
3162 const SMDS_MeshNode*& Nf = next_base[++next_base_len].node;
3164 Nf = makeNode( next_base[ next_base_len ], y, quad, uv, myHelper, S );
3166 myHelper->AddFace(curr_base[ j ].node,
3167 curr_base[ j+1 ].node,
3169 next_base[ next_base_len-1 ].node);
3172 curr_base_len = next_base_len + 1;
3174 curr_base.swap( next_base );
3177 } // end "linear" simple reduce
3182 } // end Simple Reduce implementation
3188 //================================================================================
3189 namespace // data for smoothing
3192 // --------------------------------------------------------------------------------
3194 * \brief Structure used to check validity of node position after smoothing.
3195 * It holds two nodes connected to a smoothed node and belonging to
3202 TTriangle( TSmoothNode* n1=0, TSmoothNode* n2=0 ): _n1(n1), _n2(n2) {}
3204 inline bool IsForward( gp_UV uv ) const;
3206 // --------------------------------------------------------------------------------
3208 * \brief Data of a smoothed node
3214 vector< TTriangle > _triangles; // if empty, then node is not movable
3216 // --------------------------------------------------------------------------------
3217 inline bool TTriangle::IsForward( gp_UV uv ) const
3219 gp_Vec2d v1( uv, _n1->_uv ), v2( uv, _n2->_uv );
3225 //================================================================================
3227 * \brief Set UV of nodes on degenerated VERTEXes in the middle of degenerated EDGE
3229 * WARNING: this method must be called AFTER retrieving UVPtStruct's from quad
3231 //================================================================================
3233 void StdMeshers_Quadrangle_2D::updateDegenUV(FaceQuadStruct::Ptr quad)
3237 // Set UV of nodes on degenerated VERTEXes in the middle of degenerated EDGE
3238 // --------------------------------------------------------------------------
3239 for ( unsigned i = 0; i < quad->side.size(); ++i )
3241 StdMeshers_FaceSide* side = quad->side[i];
3242 const vector<UVPtStruct>& uvVec = side->GetUVPtStruct();
3244 // find which end of the side is on degenerated shape
3246 if ( myHelper->IsDegenShape( uvVec[0].node->getshapeId() ))
3248 else if ( myHelper->IsDegenShape( uvVec.back().node->getshapeId() ))
3249 degenInd = uvVec.size() - 1;
3253 // find another side sharing the degenerated shape
3254 bool isPrev = ( degenInd == 0 );
3255 if ( i >= QUAD_TOP_SIDE )
3257 int i2 = ( isPrev ? ( i + 3 ) : ( i + 1 )) % 4;
3258 StdMeshers_FaceSide* side2 = quad->side[ i2 ];
3259 const vector<UVPtStruct>& uvVec2 = side2->GetUVPtStruct();
3261 if ( uvVec[ degenInd ].node == uvVec2[0].node )
3263 else if ( uvVec[ degenInd ].node == uvVec2.back().node )
3264 degenInd2 = uvVec2.size() - 1;
3266 throw SALOME_Exception( LOCALIZED( "Logical error" ));
3268 // move UV in the middle
3269 uvPtStruct& uv1 = const_cast<uvPtStruct&>( uvVec [ degenInd ]);
3270 uvPtStruct& uv2 = const_cast<uvPtStruct&>( uvVec2[ degenInd2 ]);
3271 uv1.u = uv2.u = 0.5 * ( uv1.u + uv2.u );
3272 uv1.v = uv2.v = 0.5 * ( uv1.v + uv2.v );
3275 else if ( quad->side.size() == 4 )
3277 // Set number of nodes on a degenerated side to be same as on an opposite side
3278 // ----------------------------------------------------------------------------
3279 for ( unsigned i = 0; i < quad->side.size(); ++i )
3281 StdMeshers_FaceSide* degSide = quad->side[i];
3282 if ( !myHelper->IsDegenShape( degSide->EdgeID(0) ))
3284 StdMeshers_FaceSide* oppSide = quad->side[( i+2 ) % quad->side.size() ];
3285 if ( degSide->NbSegments() == oppSide->NbSegments() )
3288 // make new side data
3289 const vector<UVPtStruct>& uvVecDegOld = degSide->GetUVPtStruct();
3290 const SMDS_MeshNode* n = uvVecDegOld[0].node;
3291 Handle(Geom2d_Curve) c2d = degSide->Curve2d(0);
3292 double f = degSide->FirstU(0), l = degSide->LastU(0);
3293 gp_Pnt2d p1( uvVecDegOld.front().u, uvVecDegOld.front().v );
3294 gp_Pnt2d p2( uvVecDegOld.back().u, uvVecDegOld.back().v );
3297 quad->side[i] = new StdMeshers_FaceSide( oppSide, n, &p1, &p2, c2d, f, l );
3301 //================================================================================
3303 * \brief Perform smoothing of 2D elements on a FACE with ignored degenerated EDGE
3305 //================================================================================
3307 void StdMeshers_Quadrangle_2D::smooth (FaceQuadStruct::Ptr quad)
3309 if ( !myNeedSmooth ) return;
3311 // Get nodes to smooth
3313 typedef map< const SMDS_MeshNode*, TSmoothNode, TIDCompare > TNo2SmooNoMap;
3314 TNo2SmooNoMap smooNoMap;
3316 const TopoDS_Face& geomFace = TopoDS::Face( myHelper->GetSubShape() );
3317 Handle(Geom_Surface) surface = BRep_Tool::Surface( geomFace );
3318 double U1, U2, V1, V2;
3319 surface->Bounds(U1, U2, V1, V2);
3320 GeomAPI_ProjectPointOnSurf proj;
3321 proj.Init( surface, U1, U2, V1, V2, BRep_Tool::Tolerance( geomFace ) );
3323 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
3324 SMESHDS_SubMesh* fSubMesh = meshDS->MeshElements( geomFace );
3325 SMDS_NodeIteratorPtr nIt = fSubMesh->GetNodes();
3326 while ( nIt->more() ) // loop on nodes bound to a FACE
3328 const SMDS_MeshNode* node = nIt->next();
3329 TSmoothNode & sNode = smooNoMap[ node ];
3330 sNode._uv = myHelper->GetNodeUV( geomFace, node );
3331 sNode._xyz = SMESH_TNodeXYZ( node );
3333 // set sNode._triangles
3334 SMDS_ElemIteratorPtr fIt = node->GetInverseElementIterator( SMDSAbs_Face );
3335 while ( fIt->more() )
3337 const SMDS_MeshElement* face = fIt->next();
3338 const int nbN = face->NbCornerNodes();
3339 const int nInd = face->GetNodeIndex( node );
3340 const int prevInd = myHelper->WrapIndex( nInd - 1, nbN );
3341 const int nextInd = myHelper->WrapIndex( nInd + 1, nbN );
3342 const SMDS_MeshNode* prevNode = face->GetNode( prevInd );
3343 const SMDS_MeshNode* nextNode = face->GetNode( nextInd );
3344 sNode._triangles.push_back( TTriangle( & smooNoMap[ prevNode ],
3345 & smooNoMap[ nextNode ]));
3348 // set _uv of smooth nodes on FACE boundary
3349 for ( unsigned i = 0; i < quad->side.size(); ++i )
3351 const vector<UVPtStruct>& uvVec = quad->side[i]->GetUVPtStruct();
3352 for ( unsigned j = 0; j < uvVec.size(); ++j )
3354 TSmoothNode & sNode = smooNoMap[ uvVec[j].node ];
3355 sNode._uv.SetCoord( uvVec[j].u, uvVec[j].v );
3356 sNode._xyz = SMESH_TNodeXYZ( uvVec[j].node );
3360 // define refernce orientation in 2D
3361 TNo2SmooNoMap::iterator n2sn = smooNoMap.begin();
3362 for ( ; n2sn != smooNoMap.end(); ++n2sn )
3363 if ( !n2sn->second._triangles.empty() )
3365 if ( n2sn == smooNoMap.end() ) return;
3366 const TSmoothNode & sampleNode = n2sn->second;
3367 const bool refForward = ( sampleNode._triangles[0].IsForward( sampleNode._uv ));
3371 for ( int iLoop = 0; iLoop < 5; ++iLoop )
3373 for ( n2sn = smooNoMap.begin(); n2sn != smooNoMap.end(); ++n2sn )
3375 TSmoothNode& sNode = n2sn->second;
3376 if ( sNode._triangles.empty() )
3377 continue; // not movable node
3380 bool isValid = false;
3381 bool use3D = ( iLoop > 2 ); // 3 loops in 2D and 2, in 3D
3385 // compute a new XYZ
3386 gp_XYZ newXYZ (0,0,0);
3387 for ( unsigned i = 0; i < sNode._triangles.size(); ++i )
3388 newXYZ += sNode._triangles[i]._n1->_xyz;
3389 newXYZ /= sNode._triangles.size();
3391 // compute a new UV by projection
3392 proj.Perform( newXYZ );
3393 isValid = ( proj.IsDone() && proj.NbPoints() > 0 );
3396 // check validity of the newUV
3397 Quantity_Parameter u,v;
3398 proj.LowerDistanceParameters( u, v );
3399 newUV.SetCoord( u, v );
3400 for ( unsigned i = 0; i < sNode._triangles.size() && isValid; ++i )
3401 isValid = ( sNode._triangles[i].IsForward( newUV ) == refForward );
3406 // compute a new UV by averaging
3407 newUV.SetCoord(0.,0.);
3408 for ( unsigned i = 0; i < sNode._triangles.size(); ++i )
3409 newUV += sNode._triangles[i]._n1->_uv;
3410 newUV /= sNode._triangles.size();
3412 // check validity of the newUV
3414 for ( unsigned i = 0; i < sNode._triangles.size() && isValid; ++i )
3415 isValid = ( sNode._triangles[i].IsForward( newUV ) == refForward );
3420 sNode._xyz = surface->Value( newUV.X(), newUV.Y() ).XYZ();
3425 // Set new XYZ to the smoothed nodes
3427 for ( n2sn = smooNoMap.begin(); n2sn != smooNoMap.end(); ++n2sn )
3429 TSmoothNode& sNode = n2sn->second;
3430 if ( sNode._triangles.empty() )
3431 continue; // not movable node
3433 SMDS_MeshNode* node = const_cast< SMDS_MeshNode*>( n2sn->first );
3434 gp_Pnt xyz = surface->Value( sNode._uv.X(), sNode._uv.Y() );
3435 meshDS->MoveNode( node, xyz.X(), xyz.Y(), xyz.Z() );
3438 node->SetPosition( SMDS_PositionPtr( new SMDS_FacePosition( sNode._uv.X(), sNode._uv.Y() )));
3441 // Move medium nodes in quadratic mesh
3442 if ( _quadraticMesh )
3444 const TLinkNodeMap& links = myHelper->GetTLinkNodeMap();
3445 TLinkNodeMap::const_iterator linkIt = links.begin();
3446 for ( ; linkIt != links.end(); ++linkIt )
3448 const SMESH_TLink& link = linkIt->first;
3449 SMDS_MeshNode* node = const_cast< SMDS_MeshNode*>( linkIt->second );
3451 if ( node->getshapeId() != myHelper->GetSubShapeID() )
3452 continue; // medium node is on EDGE or VERTEX
3454 gp_XY uv1 = myHelper->GetNodeUV( geomFace, link.node1(), node );
3455 gp_XY uv2 = myHelper->GetNodeUV( geomFace, link.node2(), node );
3457 gp_XY uv = myHelper->GetMiddleUV( surface, uv1, uv2 );
3458 node->SetPosition( SMDS_PositionPtr( new SMDS_FacePosition( uv.X(), uv.Y() )));
3460 gp_Pnt xyz = surface->Value( uv.X(), uv.Y() );
3461 meshDS->MoveNode( node, xyz.X(), xyz.Y(), xyz.Z() );
3466 /*//================================================================================
3468 * \brief Finds vertices at the most sharp face corners
3469 * \param [in] theFace - the FACE
3470 * \param [in,out] theWire - the ordered edges of the face. It can be modified to
3471 * have the first VERTEX of the first EDGE in \a vertices
3472 * \param [out] theVertices - the found corner vertices in the order corresponding to
3473 * the order of EDGEs in \a theWire
3474 * \param [out] theNbDegenEdges - nb of degenerated EDGEs in theFace
3475 * \param [in] theConsiderMesh - if \c true, only meshed VERTEXes are considered
3476 * as possible corners
3477 * \return int - number of quad sides found: 0, 3 or 4
3479 //================================================================================
3481 int StdMeshers_Quadrangle_2D::getCorners(const TopoDS_Face& theFace,
3482 SMESH_Mesh & theMesh,
3483 std::list<TopoDS_Edge>& theWire,
3484 std::vector<TopoDS_Vertex>& theVertices,
3485 int & theNbDegenEdges,
3486 const bool theConsiderMesh)
3488 theNbDegenEdges = 0;
3490 SMESH_MesherHelper helper( theMesh );
3492 // sort theVertices by angle
3493 multimap<double, TopoDS_Vertex> vertexByAngle;
3494 TopTools_DataMapOfShapeReal angleByVertex;
3495 TopoDS_Edge prevE = theWire.back();
3496 if ( SMESH_Algo::isDegenerated( prevE ))
3498 list<TopoDS_Edge>::reverse_iterator edge = ++theWire.rbegin();
3499 while ( SMESH_Algo::isDegenerated( *edge ))
3501 if ( edge == theWire.rend() )
3505 list<TopoDS_Edge>::iterator edge = theWire.begin();
3506 for ( ; edge != theWire.end(); ++edge )
3508 if ( SMESH_Algo::isDegenerated( *edge ))
3513 TopoDS_Vertex v = helper.IthVertex( 0, *edge );
3514 if ( !theConsiderMesh || SMESH_Algo::VertexNode( v, helper.GetMeshDS() ))
3516 double angle = SMESH_MesherHelper::GetAngle( prevE, *edge, theFace );
3517 vertexByAngle.insert( make_pair( angle, v ));
3518 angleByVertex.Bind( v, angle );
3523 // find out required nb of corners (3 or 4)
3525 TopoDS_Shape triaVertex = helper.GetMeshDS()->IndexToShape( myTriaVertexID );
3526 if ( !triaVertex.IsNull() &&
3527 triaVertex.ShapeType() == TopAbs_VERTEX &&
3528 helper.IsSubShape( triaVertex, theFace ))
3531 triaVertex.Nullify();
3533 // check nb of available corners
3534 if ( nbCorners == 3 )
3536 if ( vertexByAngle.size() < 3 )
3537 return error(COMPERR_BAD_SHAPE,
3538 TComm("Face must have 3 sides but not ") << vertexByAngle.size() );
3542 if ( vertexByAngle.size() == 3 && theNbDegenEdges == 0 )
3544 if ( myTriaVertexID < 1 )
3545 return error(COMPERR_BAD_PARMETERS,
3546 "No Base vertex provided for a trilateral geometrical face");
3548 TComm comment("Invalid Base vertex: ");
3549 comment << myTriaVertexID << " its ID is not among [ ";
3550 multimap<double, TopoDS_Vertex>::iterator a2v = vertexByAngle.begin();
3551 comment << helper.GetMeshDS()->ShapeToIndex( a2v->second ) << ", "; a2v++;
3552 comment << helper.GetMeshDS()->ShapeToIndex( a2v->second ) << ", "; a2v++;
3553 comment << helper.GetMeshDS()->ShapeToIndex( a2v->second ) << " ]";
3554 return error(COMPERR_BAD_PARMETERS, comment );
3556 if ( vertexByAngle.size() + ( theNbDegenEdges > 0 ) < 4 &&
3557 vertexByAngle.size() + theNbDegenEdges != 4 )
3558 return error(COMPERR_BAD_SHAPE,
3559 TComm("Face must have 4 sides but not ") << vertexByAngle.size() );
3562 // put all corner vertices in a map
3563 TopTools_MapOfShape vMap;
3564 if ( nbCorners == 3 )
3565 vMap.Add( triaVertex );
3566 multimap<double, TopoDS_Vertex>::reverse_iterator a2v = vertexByAngle.rbegin();
3567 for ( ; a2v != vertexByAngle.rend() && vMap.Extent() < nbCorners; ++a2v )
3568 vMap.Add( (*a2v).second );
3570 // check if there are possible variations in choosing corners
3571 bool isThereVariants = false;
3572 if ( vertexByAngle.size() > nbCorners )
3574 double lostAngle = a2v->first;
3575 double lastAngle = ( --a2v, a2v->first );
3576 isThereVariants = ( lostAngle * 1.1 >= lastAngle );
3579 // make theWire begin from a corner vertex or triaVertex
3580 if ( nbCorners == 3 )
3581 while ( !triaVertex.IsSame( ( helper.IthVertex( 0, theWire.front() ))) ||
3582 SMESH_Algo::isDegenerated( theWire.front() ))
3583 theWire.splice( theWire.end(), theWire, theWire.begin() );
3585 while ( !vMap.Contains( helper.IthVertex( 0, theWire.front() )) ||
3586 SMESH_Algo::isDegenerated( theWire.front() ))
3587 theWire.splice( theWire.end(), theWire, theWire.begin() );
3589 // fill the result vector and prepare for its refinement
3590 theVertices.clear();
3591 vector< double > angles;
3592 vector< TopoDS_Edge > edgeVec;
3593 vector< int > cornerInd, nbSeg;
3594 angles.reserve( vertexByAngle.size() );
3595 edgeVec.reserve( vertexByAngle.size() );
3596 nbSeg.reserve( vertexByAngle.size() );
3597 cornerInd.reserve( nbCorners );
3598 for ( edge = theWire.begin(); edge != theWire.end(); ++edge )
3600 if ( SMESH_Algo::isDegenerated( *edge ))
3602 TopoDS_Vertex v = helper.IthVertex( 0, *edge );
3603 bool isCorner = vMap.Contains( v );
3606 theVertices.push_back( v );
3607 cornerInd.push_back( angles.size() );
3609 angles.push_back( angleByVertex.IsBound( v ) ? angleByVertex( v ) : -M_PI );
3610 edgeVec.push_back( *edge );
3611 if ( theConsiderMesh && isThereVariants )
3613 if ( SMESHDS_SubMesh* sm = helper.GetMeshDS()->MeshElements( *edge ))
3614 nbSeg.push_back( sm->NbNodes() + 1 );
3616 nbSeg.push_back( 0 );
3620 // refine the result vector - make sides elual by length if
3621 // there are several equal angles
3622 if ( isThereVariants )
3624 if ( nbCorners == 3 )
3625 angles[0] = 2 * M_PI; // not to move the base triangle VERTEX
3627 set< int > refinedCorners;
3628 for ( size_t iC = 0; iC < cornerInd.size(); ++iC )
3630 int iV = cornerInd[iC];
3631 if ( !refinedCorners.insert( iV ).second )
3633 list< int > equalVertices;
3634 equalVertices.push_back( iV );
3635 int nbC[2] = { 0, 0 };
3636 // find equal angles backward and forward from the iV-th corner vertex
3637 for ( int isFwd = 0; isFwd < 2; ++isFwd )
3639 int dV = isFwd ? +1 : -1;
3640 int iCNext = helper.WrapIndex( iC + dV, cornerInd.size() );
3641 int iVNext = helper.WrapIndex( iV + dV, angles.size() );
3642 while ( iVNext != iV )
3644 bool equal = Abs( angles[iV] - angles[iVNext] ) < 0.1 * angles[iV];
3646 equalVertices.insert( isFwd ? equalVertices.end() : equalVertices.begin(), iVNext );
3647 if ( iVNext == cornerInd[ iCNext ])
3652 refinedCorners.insert( cornerInd[ iCNext ] );
3653 iCNext = helper.WrapIndex( iCNext + dV, cornerInd.size() );
3655 iVNext = helper.WrapIndex( iVNext + dV, angles.size() );
3658 // move corners to make sides equal by length
3659 int nbEqualV = equalVertices.size();
3660 int nbExcessV = nbEqualV - ( 1 + nbC[0] + nbC[1] );
3661 if ( nbExcessV > 0 )
3663 // calculate normalized length of each side enclosed between neighbor equalVertices
3664 vector< double > curLengths;
3665 double totalLen = 0;
3666 vector< int > evVec( equalVertices.begin(), equalVertices.end() );
3668 int iE = cornerInd[ helper.WrapIndex( iC - nbC[0] - 1, cornerInd.size() )];
3669 int iEEnd = cornerInd[ helper.WrapIndex( iC + nbC[1] + 1, cornerInd.size() )];
3670 while ( curLengths.size() < nbEqualV + 1 )
3672 curLengths.push_back( totalLen );
3674 curLengths.back() += SMESH_Algo::EdgeLength( edgeVec[ iE ]);
3675 iE = helper.WrapIndex( iE + 1, edgeVec.size());
3676 if ( iEV < evVec.size() && iE == evVec[ iEV++ ] )
3679 while( iE != iEEnd );
3680 totalLen = curLengths.back();
3682 curLengths.resize( equalVertices.size() );
3683 for ( size_t iS = 0; iS < curLengths.size(); ++iS )
3684 curLengths[ iS ] /= totalLen;
3686 // find equalVertices most close to the ideal sub-division of all sides
3688 int iCorner = helper.WrapIndex( iC - nbC[0], cornerInd.size() );
3689 int nbSides = 2 + nbC[0] + nbC[1];
3690 for ( int iS = 1; iS < nbSides; ++iS, ++iBestEV )
3692 double idealLen = iS / double( nbSides );
3693 double d, bestDist = 1.;
3694 for ( iEV = iBestEV; iEV < curLengths.size(); ++iEV )
3695 if (( d = Abs( idealLen - curLengths[ iEV ])) < bestDist )
3700 if ( iBestEV > iS-1 + nbExcessV )
3701 iBestEV = iS-1 + nbExcessV;
3702 theVertices[ iCorner ] = helper.IthVertex( 0, edgeVec[ evVec[ iBestEV ]]);
3703 iCorner = helper.WrapIndex( iCorner + 1, cornerInd.size() );