1 // Copyright (C) 2007-2012 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 "StdMeshers_FaceSide.hxx"
31 #include "StdMeshers_QuadrangleParams.hxx"
33 #include "SMESH_Gen.hxx"
34 #include "SMESH_Mesh.hxx"
35 #include "SMESH_subMesh.hxx"
36 #include "SMESH_MesherHelper.hxx"
37 #include "SMESH_Block.hxx"
38 #include "SMESH_Comment.hxx"
40 #include "SMDS_MeshElement.hxx"
41 #include "SMDS_MeshNode.hxx"
42 #include "SMDS_EdgePosition.hxx"
43 #include "SMDS_FacePosition.hxx"
45 #include <BRep_Tool.hxx>
46 #include <Geom_Surface.hxx>
47 #include <NCollection_DefineArray2.hxx>
48 #include <Precision.hxx>
49 #include <TColStd_SequenceOfReal.hxx>
50 #include <TColStd_SequenceOfInteger.hxx>
51 #include <TColgp_SequenceOfXY.hxx>
53 #include <TopExp_Explorer.hxx>
54 #include <TopTools_ListIteratorOfListOfShape.hxx>
55 #include <TopTools_MapOfShape.hxx>
58 #include "utilities.h"
59 #include "Utils_ExceptHandlers.hxx"
61 #ifndef StdMeshers_Array2OfNode_HeaderFile
62 #define StdMeshers_Array2OfNode_HeaderFile
63 typedef const SMDS_MeshNode* SMDS_MeshNodePtr;
64 DEFINE_BASECOLLECTION (StdMeshers_BaseCollectionNodePtr, SMDS_MeshNodePtr)
65 DEFINE_ARRAY2(StdMeshers_Array2OfNode,
66 StdMeshers_BaseCollectionNodePtr, SMDS_MeshNodePtr)
72 typedef SMESH_Comment TComm;
74 //=============================================================================
78 //=============================================================================
80 StdMeshers_Quadrangle_2D::StdMeshers_Quadrangle_2D (int hypId, int studyId,
82 : SMESH_2D_Algo(hypId, studyId, gen)
84 MESSAGE("StdMeshers_Quadrangle_2D::StdMeshers_Quadrangle_2D");
85 _name = "Quadrangle_2D";
86 _shapeType = (1 << TopAbs_FACE);
87 _compatibleHypothesis.push_back("QuadrangleParams");
88 _compatibleHypothesis.push_back("QuadranglePreference");
89 _compatibleHypothesis.push_back("TrianglePreference");
93 //=============================================================================
97 //=============================================================================
99 StdMeshers_Quadrangle_2D::~StdMeshers_Quadrangle_2D()
101 MESSAGE("StdMeshers_Quadrangle_2D::~StdMeshers_Quadrangle_2D");
104 //=============================================================================
108 //=============================================================================
110 bool StdMeshers_Quadrangle_2D::CheckHypothesis
112 const TopoDS_Shape& aShape,
113 SMESH_Hypothesis::Hypothesis_Status& aStatus)
116 aStatus = SMESH_Hypothesis::HYP_OK;
118 const list <const SMESHDS_Hypothesis * >& hyps =
119 GetUsedHypothesis(aMesh, aShape, false);
120 const SMESHDS_Hypothesis * aHyp = 0;
123 myQuadType = QUAD_STANDARD;
124 myQuadranglePreference = false;
125 myTrianglePreference = false;
127 bool isFirstParams = true;
129 // First assigned hypothesis (if any) is processed now
130 if (hyps.size() > 0) {
132 if (strcmp("QuadrangleParams", aHyp->GetName()) == 0) {
133 const StdMeshers_QuadrangleParams* aHyp1 =
134 (const StdMeshers_QuadrangleParams*)aHyp;
135 myTriaVertexID = aHyp1->GetTriaVertex();
136 myQuadType = aHyp1->GetQuadType();
137 if (myQuadType == QUAD_QUADRANGLE_PREF ||
138 myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
139 myQuadranglePreference = true;
140 else if (myQuadType == QUAD_TRIANGLE_PREF)
141 myTrianglePreference = true;
143 else if (strcmp("QuadranglePreference", aHyp->GetName()) == 0) {
144 isFirstParams = false;
145 myQuadranglePreference = true;
147 else if (strcmp("TrianglePreference", aHyp->GetName()) == 0){
148 isFirstParams = false;
149 myTrianglePreference = true;
152 isFirstParams = false;
156 // Second(last) assigned hypothesis (if any) is processed now
157 if (hyps.size() > 1) {
160 if (strcmp("QuadranglePreference", aHyp->GetName()) == 0) {
161 myQuadranglePreference = true;
162 myTrianglePreference = false;
163 myQuadType = QUAD_STANDARD;
165 else if (strcmp("TrianglePreference", aHyp->GetName()) == 0){
166 myQuadranglePreference = false;
167 myTrianglePreference = true;
168 myQuadType = QUAD_STANDARD;
172 const StdMeshers_QuadrangleParams* aHyp2 =
173 (const StdMeshers_QuadrangleParams*)aHyp;
174 myTriaVertexID = aHyp2->GetTriaVertex();
176 if (!myQuadranglePreference && !myTrianglePreference) { // priority of hypos
177 myQuadType = aHyp2->GetQuadType();
178 if (myQuadType == QUAD_QUADRANGLE_PREF ||
179 myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
180 myQuadranglePreference = true;
181 else if (myQuadType == QUAD_TRIANGLE_PREF)
182 myTrianglePreference = true;
190 //=============================================================================
194 //=============================================================================
196 bool StdMeshers_Quadrangle_2D::Compute (SMESH_Mesh& aMesh,
197 const TopoDS_Shape& aShape)// throw (SALOME_Exception)
199 // PAL14921. Enable catching std::bad_alloc and Standard_OutOfMemory outside
200 //Unexpect aCatchSalomeException);
202 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
203 aMesh.GetSubMesh(aShape);
205 SMESH_MesherHelper helper (aMesh);
208 _quadraticMesh = myHelper->IsQuadraticSubMesh(aShape);
209 myNeedSmooth = false;
211 FaceQuadStruct *quad = CheckNbEdges(aMesh, aShape);
212 std::auto_ptr<FaceQuadStruct> quadDeleter (quad); // to delete quad at exit from Compute()
216 if (myQuadranglePreference) {
217 int n1 = quad->side[0]->NbPoints();
218 int n2 = quad->side[1]->NbPoints();
219 int n3 = quad->side[2]->NbPoints();
220 int n4 = quad->side[3]->NbPoints();
221 int nfull = n1+n2+n3+n4;
224 if (nfull == ntmp && ((n1 != n3) || (n2 != n4))) {
225 // special path for using only quandrangle faces
226 bool ok = ComputeQuadPref(aMesh, aShape, quad);
227 if ( ok && myNeedSmooth )
232 else if (myQuadType == QUAD_REDUCED) {
233 int n1 = quad->side[0]->NbPoints();
234 int n2 = quad->side[1]->NbPoints();
235 int n3 = quad->side[2]->NbPoints();
236 int n4 = quad->side[3]->NbPoints();
239 int n13tmp = n13/2; n13tmp = n13tmp*2;
240 int n24tmp = n24/2; n24tmp = n24tmp*2;
241 if ((n1 == n3 && n2 != n4 && n24tmp == n24) ||
242 (n2 == n4 && n1 != n3 && n13tmp == n13)) {
243 bool ok = ComputeReduced(aMesh, aShape, quad);
244 if ( ok && myNeedSmooth )
250 // set normalized grid on unit square in parametric domain
252 if (!SetNormalizedGrid(aMesh, aShape, quad))
255 // --- compute 3D values on points, store points & quadrangles
257 int nbdown = quad->side[0]->NbPoints();
258 int nbup = quad->side[2]->NbPoints();
260 int nbright = quad->side[1]->NbPoints();
261 int nbleft = quad->side[3]->NbPoints();
263 int nbhoriz = Min(nbdown, nbup);
264 int nbvertic = Min(nbright, nbleft);
266 const TopoDS_Face& F = TopoDS::Face(aShape);
267 Handle(Geom_Surface) S = BRep_Tool::Surface(F);
269 // internal mesh nodes
270 int i, j, geomFaceID = meshDS->ShapeToIndex(F);
271 for (i = 1; i < nbhoriz - 1; i++) {
272 for (j = 1; j < nbvertic - 1; j++) {
273 int ij = j * nbhoriz + i;
274 double u = quad->uv_grid[ij].u;
275 double v = quad->uv_grid[ij].v;
276 gp_Pnt P = S->Value(u, v);
277 SMDS_MeshNode * node = meshDS->AddNode(P.X(), P.Y(), P.Z());
278 meshDS->SetNodeOnFace(node, geomFaceID, u, v);
279 quad->uv_grid[ij].node = node;
286 // --.--.--.--.--.-- nbvertic
292 // ---.----.----.--- 0
293 // 0 > > > > > > > > nbhoriz
299 int iup = nbhoriz - 1;
300 if (quad->isEdgeOut[3]) { ilow++; } else { if (quad->isEdgeOut[1]) iup--; }
303 int jup = nbvertic - 1;
304 if (quad->isEdgeOut[0]) { jlow++; } else { if (quad->isEdgeOut[2]) jup--; }
306 // regular quadrangles
307 for (i = ilow; i < iup; i++) {
308 for (j = jlow; j < jup; j++) {
309 const SMDS_MeshNode *a, *b, *c, *d;
310 a = quad->uv_grid[j * nbhoriz + i].node;
311 b = quad->uv_grid[j * nbhoriz + i + 1].node;
312 c = quad->uv_grid[(j + 1) * nbhoriz + i + 1].node;
313 d = quad->uv_grid[(j + 1) * nbhoriz + i].node;
314 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
316 meshDS->SetMeshElementOnShape(face, geomFaceID);
321 const vector<UVPtStruct>& uv_e0 = quad->side[0]->GetUVPtStruct(true,0);
322 const vector<UVPtStruct>& uv_e1 = quad->side[1]->GetUVPtStruct(false,1);
323 const vector<UVPtStruct>& uv_e2 = quad->side[2]->GetUVPtStruct(true,1);
324 const vector<UVPtStruct>& uv_e3 = quad->side[3]->GetUVPtStruct(false,0);
326 if (uv_e0.empty() || uv_e1.empty() || uv_e2.empty() || uv_e3.empty())
327 return error(COMPERR_BAD_INPUT_MESH);
329 double eps = Precision::Confusion();
331 // Boundary quadrangles
333 if (quad->isEdgeOut[0]) {
336 // |___|___|___|___|___|___|
338 // |___|___|___|___|___|___|
340 // |___|___|___|___|___|___| __ first row of the regular grid
341 // . . . . . . . . . __ down edge nodes
343 // >->->->->->->->->->->->-> -- direction of processing
345 int g = 0; // number of last processed node in the regular grid
347 // number of last node of the down edge to be processed
348 int stop = nbdown - 1;
349 // if right edge is out, we will stop at a node, previous to the last one
350 if (quad->isEdgeOut[1]) stop--;
352 // for each node of the down edge find nearest node
353 // in the first row of the regular grid and link them
354 for (i = 0; i < stop; i++) {
355 const SMDS_MeshNode *a, *b, *c, *d;
357 b = uv_e0[i + 1].node;
358 gp_Pnt pb (b->X(), b->Y(), b->Z());
360 // find node c in the regular grid, which will be linked with node b
363 // right bound reached, link with the rightmost node
365 c = quad->uv_grid[nbhoriz + iup].node;
368 // find in the grid node c, nearest to the b
369 double mind = RealLast();
370 for (int k = g; k <= iup; k++) {
372 const SMDS_MeshNode *nk;
373 if (k < ilow) // this can be, if left edge is out
374 nk = uv_e3[1].node; // get node from the left edge
376 nk = quad->uv_grid[nbhoriz + k].node; // get one of middle nodes
378 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
379 double dist = pb.Distance(pnk);
380 if (dist < mind - eps) {
390 if (near == g) { // make triangle
391 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
392 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
394 else { // make quadrangle
398 d = quad->uv_grid[nbhoriz + near - 1].node;
399 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
401 if (!myTrianglePreference){
402 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
403 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
406 SplitQuad(meshDS, geomFaceID, a, b, c, d);
409 // if node d is not at position g - make additional triangles
411 for (int k = near - 1; k > g; k--) {
412 c = quad->uv_grid[nbhoriz + k].node;
416 d = quad->uv_grid[nbhoriz + k - 1].node;
417 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
418 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
425 if (quad->isEdgeOut[2]) {
428 // <-<-<-<-<-<-<-<-<-<-<-<-< -- direction of processing
430 // . . . . . . . . . __ up edge nodes
431 // ___ ___ ___ ___ ___ ___ __ first row of the regular grid
433 // |___|___|___|___|___|___|
435 // |___|___|___|___|___|___|
438 int g = nbhoriz - 1; // last processed node in the regular grid
441 // if left edge is out, we will stop at a second node
442 if (quad->isEdgeOut[3]) stop++;
444 // for each node of the up edge find nearest node
445 // in the first row of the regular grid and link them
446 for (i = nbup - 1; i > stop; i--) {
447 const SMDS_MeshNode *a, *b, *c, *d;
449 b = uv_e2[i - 1].node;
450 gp_Pnt pb (b->X(), b->Y(), b->Z());
452 // find node c in the grid, which will be linked with node b
454 if (i == stop + 1) { // left bound reached, link with the leftmost node
455 c = quad->uv_grid[nbhoriz*(nbvertic - 2) + ilow].node;
458 // find node c in the grid, nearest to the b
459 double mind = RealLast();
460 for (int k = g; k >= ilow; k--) {
461 const SMDS_MeshNode *nk;
463 nk = uv_e1[nbright - 2].node;
465 nk = quad->uv_grid[nbhoriz*(nbvertic - 2) + k].node;
466 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
467 double dist = pb.Distance(pnk);
468 if (dist < mind - eps) {
478 if (near == g) { // make triangle
479 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
480 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
482 else { // make quadrangle
484 d = uv_e1[nbright - 2].node;
486 d = quad->uv_grid[nbhoriz*(nbvertic - 2) + near + 1].node;
487 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
488 if (!myTrianglePreference){
489 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
490 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
493 SplitQuad(meshDS, geomFaceID, a, b, c, d);
496 if (near + 1 < g) { // if d not is at g - make additional triangles
497 for (int k = near + 1; k < g; k++) {
498 c = quad->uv_grid[nbhoriz*(nbvertic - 2) + k].node;
500 d = uv_e1[nbright - 2].node;
502 d = quad->uv_grid[nbhoriz*(nbvertic - 2) + k + 1].node;
503 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
504 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
513 // right or left boundary quadrangles
514 if (quad->isEdgeOut[1]) {
515 // MESSAGE("right edge is out");
516 int g = 0; // last processed node in the grid
517 int stop = nbright - 1;
518 if (quad->isEdgeOut[2]) stop--;
519 for (i = 0; i < stop; i++) {
520 const SMDS_MeshNode *a, *b, *c, *d;
522 b = uv_e1[i + 1].node;
523 gp_Pnt pb (b->X(), b->Y(), b->Z());
525 // find node c in the grid, nearest to the b
527 if (i == stop - 1) { // up bondary reached
528 c = quad->uv_grid[nbhoriz*(jup + 1) - 2].node;
531 double mind = RealLast();
532 for (int k = g; k <= jup; k++) {
533 const SMDS_MeshNode *nk;
535 nk = uv_e0[nbdown - 2].node;
537 nk = quad->uv_grid[nbhoriz*(k + 1) - 2].node;
538 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
539 double dist = pb.Distance(pnk);
540 if (dist < mind - eps) {
550 if (near == g) { // make triangle
551 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
552 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
554 else { // make quadrangle
556 d = uv_e0[nbdown - 2].node;
558 d = quad->uv_grid[nbhoriz*near - 2].node;
559 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
561 if (!myTrianglePreference){
562 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
563 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
566 SplitQuad(meshDS, geomFaceID, a, b, c, d);
569 if (near - 1 > g) { // if d not is at g - make additional triangles
570 for (int k = near - 1; k > g; k--) {
571 c = quad->uv_grid[nbhoriz*(k + 1) - 2].node;
573 d = uv_e0[nbdown - 2].node;
575 d = quad->uv_grid[nbhoriz*k - 2].node;
576 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
577 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
584 if (quad->isEdgeOut[3]) {
585 // MESSAGE("left edge is out");
586 int g = nbvertic - 1; // last processed node in the grid
588 if (quad->isEdgeOut[0]) stop++;
589 for (i = nbleft - 1; i > stop; i--) {
590 const SMDS_MeshNode *a, *b, *c, *d;
592 b = uv_e3[i - 1].node;
593 gp_Pnt pb (b->X(), b->Y(), b->Z());
595 // find node c in the grid, nearest to the b
597 if (i == stop + 1) { // down bondary reached
598 c = quad->uv_grid[nbhoriz*jlow + 1].node;
601 double mind = RealLast();
602 for (int k = g; k >= jlow; k--) {
603 const SMDS_MeshNode *nk;
607 nk = quad->uv_grid[nbhoriz*k + 1].node;
608 gp_Pnt pnk (nk->X(), nk->Y(), nk->Z());
609 double dist = pb.Distance(pnk);
610 if (dist < mind - eps) {
620 if (near == g) { // make triangle
621 SMDS_MeshFace* face = myHelper->AddFace(a, b, c);
622 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
624 else { // make quadrangle
628 d = quad->uv_grid[nbhoriz*(near + 1) + 1].node;
629 //SMDS_MeshFace* face = meshDS->AddFace(a, b, c, d);
630 if (!myTrianglePreference){
631 SMDS_MeshFace* face = myHelper->AddFace(a, b, c, d);
632 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
635 SplitQuad(meshDS, geomFaceID, a, b, c, d);
638 if (near + 1 < g) { // if d not is at g - make additional triangles
639 for (int k = near + 1; k < g; k++) {
640 c = quad->uv_grid[nbhoriz*k + 1].node;
644 d = quad->uv_grid[nbhoriz*(k + 1) + 1].node;
645 SMDS_MeshFace* face = myHelper->AddFace(a, c, d);
646 if (face) meshDS->SetMeshElementOnShape(face, geomFaceID);
663 //=============================================================================
667 //=============================================================================
669 bool StdMeshers_Quadrangle_2D::Evaluate(SMESH_Mesh& aMesh,
670 const TopoDS_Shape& aShape,
671 MapShapeNbElems& aResMap)
674 aMesh.GetSubMesh(aShape);
676 std::vector<int> aNbNodes(4);
677 bool IsQuadratic = false;
678 if (!CheckNbEdgesForEvaluate(aMesh, aShape, aResMap, aNbNodes, IsQuadratic)) {
679 std::vector<int> aResVec(SMDSEntity_Last);
680 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
681 SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
682 aResMap.insert(std::make_pair(sm,aResVec));
683 SMESH_ComputeErrorPtr& smError = sm->GetComputeError();
684 smError.reset(new SMESH_ComputeError(COMPERR_ALGO_FAILED,"Submesh can not be evaluated",this));
688 if (myQuadranglePreference) {
689 int n1 = aNbNodes[0];
690 int n2 = aNbNodes[1];
691 int n3 = aNbNodes[2];
692 int n4 = aNbNodes[3];
693 int nfull = n1+n2+n3+n4;
696 if (nfull==ntmp && ((n1!=n3) || (n2!=n4))) {
697 // special path for using only quandrangle faces
698 return EvaluateQuadPref(aMesh, aShape, aNbNodes, aResMap, IsQuadratic);
703 int nbdown = aNbNodes[0];
704 int nbup = aNbNodes[2];
706 int nbright = aNbNodes[1];
707 int nbleft = aNbNodes[3];
709 int nbhoriz = Min(nbdown, nbup);
710 int nbvertic = Min(nbright, nbleft);
712 int dh = Max(nbdown, nbup) - nbhoriz;
713 int dv = Max(nbright, nbleft) - nbvertic;
720 int nbNodes = (nbhoriz-2)*(nbvertic-2);
721 //int nbFaces3 = dh + dv + kdh*(nbvertic-1)*2 + kdv*(nbhoriz-1)*2;
722 int nbFaces3 = dh + dv;
723 //if (kdh==1 && kdv==1) nbFaces3 -= 2;
724 //if (dh>0 && dv>0) nbFaces3 -= 2;
725 //int nbFaces4 = (nbhoriz-1-kdh)*(nbvertic-1-kdv);
726 int nbFaces4 = (nbhoriz-1)*(nbvertic-1);
728 std::vector<int> aVec(SMDSEntity_Last);
729 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aVec[i] = 0;
731 aVec[SMDSEntity_Quad_Triangle] = nbFaces3;
732 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces4;
733 int nbbndedges = nbdown + nbup + nbright + nbleft -4;
734 int nbintedges = (nbFaces4*4 + nbFaces3*3 - nbbndedges) / 2;
735 aVec[SMDSEntity_Node] = nbNodes + nbintedges;
736 if (aNbNodes.size()==5) {
737 aVec[SMDSEntity_Quad_Triangle] = nbFaces3 + aNbNodes[3] -1;
738 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces4 - aNbNodes[3] +1;
742 aVec[SMDSEntity_Node] = nbNodes;
743 aVec[SMDSEntity_Triangle] = nbFaces3;
744 aVec[SMDSEntity_Quadrangle] = nbFaces4;
745 if (aNbNodes.size()==5) {
746 aVec[SMDSEntity_Triangle] = nbFaces3 + aNbNodes[3] - 1;
747 aVec[SMDSEntity_Quadrangle] = nbFaces4 - aNbNodes[3] + 1;
750 SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
751 aResMap.insert(std::make_pair(sm,aVec));
757 //================================================================================
759 * \brief Return true if only two given edges meat at their common vertex
761 //================================================================================
763 static bool twoEdgesMeatAtVertex(const TopoDS_Edge& e1,
764 const TopoDS_Edge& e2,
768 if (!TopExp::CommonVertex(e1, e2, v))
770 TopTools_ListIteratorOfListOfShape ancestIt(mesh.GetAncestors(v));
771 for (; ancestIt.More() ; ancestIt.Next())
772 if (ancestIt.Value().ShapeType() == TopAbs_EDGE)
773 if (!e1.IsSame(ancestIt.Value()) && !e2.IsSame(ancestIt.Value()))
778 //=============================================================================
782 //=============================================================================
784 FaceQuadStruct* StdMeshers_Quadrangle_2D::CheckNbEdges(SMESH_Mesh & aMesh,
785 const TopoDS_Shape & aShape)
786 //throw(SALOME_Exception)
788 TopoDS_Face F = TopoDS::Face(aShape);
789 if ( F.Orientation() >= TopAbs_INTERNAL ) F.Orientation( TopAbs_FORWARD );
790 const bool ignoreMediumNodes = _quadraticMesh;
792 // verify 1 wire only, with 4 edges
794 list< TopoDS_Edge > edges;
795 list< int > nbEdgesInWire;
796 int nbWire = SMESH_Block::GetOrderedEdges (F, V, edges, nbEdgesInWire);
798 error(COMPERR_BAD_SHAPE, TComm("Wrong number of wires: ") << nbWire);
801 FaceQuadStruct* quad = new FaceQuadStruct;
803 quad->side.reserve(nbEdgesInWire.front());
807 list< TopoDS_Edge >::iterator edgeIt = edges.begin();
808 if (nbEdgesInWire.front() == 3) // exactly 3 edges
810 SMESH_Comment comment;
811 SMESHDS_Mesh* meshDS = aMesh.GetMeshDS();
812 if (myTriaVertexID == -1)
814 comment << "No Base vertex parameter provided for a trilateral geometrical face";
818 TopoDS_Vertex V = TopoDS::Vertex(meshDS->IndexToShape(myTriaVertexID));
820 TopoDS_Edge E1,E2,E3;
821 for (; edgeIt != edges.end(); ++edgeIt) {
822 TopoDS_Edge E = *edgeIt;
823 TopoDS_Vertex VF, VL;
824 TopExp::Vertices(E, VF, VL, true);
827 else if (VL.IsSame(V))
832 if (!E1.IsNull() && !E2.IsNull() && !E3.IsNull())
834 quad->side.push_back(new StdMeshers_FaceSide(F, E1, &aMesh, true, ignoreMediumNodes));
835 quad->side.push_back(new StdMeshers_FaceSide(F, E2, &aMesh, true, ignoreMediumNodes));
836 quad->side.push_back(new StdMeshers_FaceSide(F, E3, &aMesh, false,ignoreMediumNodes));
837 const vector<UVPtStruct>& UVPSleft = quad->side[0]->GetUVPtStruct(true,0);
838 /* vector<UVPtStruct>& UVPStop = */quad->side[1]->GetUVPtStruct(false,1);
839 /* vector<UVPtStruct>& UVPSright = */quad->side[2]->GetUVPtStruct(true,1);
840 const SMDS_MeshNode* aNode = UVPSleft[0].node;
841 gp_Pnt2d aPnt2d(UVPSleft[0].u, UVPSleft[0].v);
842 quad->side.push_back(new StdMeshers_FaceSide(aNode, aPnt2d, quad->side[1]));
846 comment << "Invalid Base vertex parameter: " << myTriaVertexID << " is not among [";
847 TopTools_MapOfShape vMap;
848 for (TopExp_Explorer v(aShape, TopAbs_VERTEX); v.More(); v.Next())
849 if (vMap.Add(v.Current()))
850 comment << meshDS->ShapeToIndex(v.Current()) << (vMap.Extent()==3 ? "]" : ", ");
856 else if (nbEdgesInWire.front() == 4) // exactly 4 edges
858 for (; edgeIt != edges.end(); ++edgeIt, nbSides++)
859 quad->side.push_back(new StdMeshers_FaceSide(F, *edgeIt, &aMesh,
860 nbSides<TOP_SIDE, ignoreMediumNodes));
862 else if (nbEdgesInWire.front() > 4) // more than 4 edges - try to unite some
864 list< TopoDS_Edge > sideEdges;
865 vector< int > degenSides;
866 while (!edges.empty()) {
868 sideEdges.splice(sideEdges.end(), edges, edges.begin()); // edges.front() -> sideEdges.end()
869 bool sameSide = true;
870 while (!edges.empty() && sameSide) {
871 sameSide = SMESH_Algo::IsContinuous(sideEdges.back(), edges.front());
873 sideEdges.splice(sideEdges.end(), edges, edges.begin());
875 if (nbSides == 0) { // go backward from the first edge
877 while (!edges.empty() && sameSide) {
878 sameSide = SMESH_Algo::IsContinuous(sideEdges.front(), edges.back());
880 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
883 if ( sideEdges.size() == 1 && BRep_Tool::Degenerated( sideEdges.front() ))
884 degenSides.push_back( nbSides );
886 quad->side.push_back(new StdMeshers_FaceSide(F, sideEdges, &aMesh,
887 nbSides<TOP_SIDE, ignoreMediumNodes));
890 if ( !degenSides.empty() && nbSides - degenSides.size() == 4 )
893 for ( unsigned i = TOP_SIDE; i < quad->side.size(); ++i )
894 quad->side[i]->Reverse();
896 for ( int i = degenSides.size()-1; i > -1; --i )
898 StdMeshers_FaceSide* degenSide = quad->side[ degenSides[ i ]];
900 quad->side.erase( quad->side.begin() + degenSides[ i ] );
902 for ( unsigned i = TOP_SIDE; i < quad->side.size(); ++i )
903 quad->side[i]->Reverse();
905 nbSides -= degenSides.size();
907 // issue 20222. Try to unite only edges shared by two same faces
909 // delete found sides
910 { FaceQuadStruct cleaner(*quad); }
912 quad->side.reserve(nbEdgesInWire.front());
915 SMESH_Block::GetOrderedEdges (F, V, edges, nbEdgesInWire);
916 while (!edges.empty()) {
918 sideEdges.splice(sideEdges.end(), edges, edges.begin());
919 bool sameSide = true;
920 while (!edges.empty() && sameSide) {
922 SMESH_Algo::IsContinuous(sideEdges.back(), edges.front()) &&
923 twoEdgesMeatAtVertex(sideEdges.back(), edges.front(), aMesh);
925 sideEdges.splice(sideEdges.end(), edges, edges.begin());
927 if (nbSides == 0) { // go backward from the first edge
929 while (!edges.empty() && sameSide) {
931 SMESH_Algo::IsContinuous(sideEdges.front(), edges.back()) &&
932 twoEdgesMeatAtVertex(sideEdges.front(), edges.back(), aMesh);
934 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
937 quad->side.push_back(new StdMeshers_FaceSide(F, sideEdges, &aMesh,
938 nbSides<TOP_SIDE, ignoreMediumNodes));
945 MESSAGE ("StdMeshers_Quadrangle_2D. Edge IDs of " << nbSides << " sides:\n");
946 for (int i = 0; i < nbSides; ++i) {
948 for (int e = 0; e < quad->side[i]->NbEdges(); ++e)
949 MESSAGE (myHelper->GetMeshDS()->ShapeToIndex(quad->side[i]->Edge(e)) << " ");
955 nbSides = nbEdgesInWire.front();
956 error(COMPERR_BAD_SHAPE, TComm("Face must have 4 sides but not ") << nbSides);
965 //=============================================================================
969 //=============================================================================
971 bool StdMeshers_Quadrangle_2D::CheckNbEdgesForEvaluate(SMESH_Mesh& aMesh,
972 const TopoDS_Shape & aShape,
973 MapShapeNbElems& aResMap,
974 std::vector<int>& aNbNodes,
978 const TopoDS_Face & F = TopoDS::Face(aShape);
980 // verify 1 wire only, with 4 edges
982 list< TopoDS_Edge > edges;
983 list< int > nbEdgesInWire;
984 int nbWire = SMESH_Block::GetOrderedEdges (F, V, edges, nbEdgesInWire);
992 list< TopoDS_Edge >::iterator edgeIt = edges.begin();
993 SMESH_subMesh * sm = aMesh.GetSubMesh(*edgeIt);
994 MapShapeNbElemsItr anIt = aResMap.find(sm);
995 if (anIt==aResMap.end()) {
998 std::vector<int> aVec = (*anIt).second;
999 IsQuadratic = (aVec[SMDSEntity_Quad_Edge] > aVec[SMDSEntity_Edge]);
1000 if (nbEdgesInWire.front() == 3) { // exactly 3 edges
1001 if (myTriaVertexID>0) {
1002 SMESHDS_Mesh* meshDS = aMesh.GetMeshDS();
1003 TopoDS_Vertex V = TopoDS::Vertex(meshDS->IndexToShape(myTriaVertexID));
1005 TopoDS_Edge E1,E2,E3;
1006 for (; edgeIt != edges.end(); ++edgeIt) {
1007 TopoDS_Edge E = TopoDS::Edge(*edgeIt);
1008 TopoDS_Vertex VF, VL;
1009 TopExp::Vertices(E, VF, VL, true);
1012 else if (VL.IsSame(V))
1017 SMESH_subMesh * sm = aMesh.GetSubMesh(E1);
1018 MapShapeNbElemsItr anIt = aResMap.find(sm);
1019 if (anIt==aResMap.end()) return false;
1020 std::vector<int> aVec = (*anIt).second;
1022 aNbNodes[0] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1024 aNbNodes[0] = aVec[SMDSEntity_Node] + 2;
1025 sm = aMesh.GetSubMesh(E2);
1026 anIt = aResMap.find(sm);
1027 if (anIt==aResMap.end()) return false;
1028 aVec = (*anIt).second;
1030 aNbNodes[1] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1032 aNbNodes[1] = aVec[SMDSEntity_Node] + 2;
1033 sm = aMesh.GetSubMesh(E3);
1034 anIt = aResMap.find(sm);
1035 if (anIt==aResMap.end()) return false;
1036 aVec = (*anIt).second;
1038 aNbNodes[2] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1040 aNbNodes[2] = aVec[SMDSEntity_Node] + 2;
1041 aNbNodes[3] = aNbNodes[1];
1047 if (nbEdgesInWire.front() == 4) { // exactly 4 edges
1048 for (; edgeIt != edges.end(); edgeIt++) {
1049 SMESH_subMesh * sm = aMesh.GetSubMesh(*edgeIt);
1050 MapShapeNbElemsItr anIt = aResMap.find(sm);
1051 if (anIt==aResMap.end()) {
1054 std::vector<int> aVec = (*anIt).second;
1056 aNbNodes[nbSides] = (aVec[SMDSEntity_Node]-1)/2 + 2;
1058 aNbNodes[nbSides] = aVec[SMDSEntity_Node] + 2;
1062 else if (nbEdgesInWire.front() > 4) { // more than 4 edges - try to unite some
1063 list< TopoDS_Edge > sideEdges;
1064 while (!edges.empty()) {
1066 sideEdges.splice(sideEdges.end(), edges, edges.begin()); // edges.front() -> sideEdges.end()
1067 bool sameSide = true;
1068 while (!edges.empty() && sameSide) {
1069 sameSide = SMESH_Algo::IsContinuous(sideEdges.back(), edges.front());
1071 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1073 if (nbSides == 0) { // go backward from the first edge
1075 while (!edges.empty() && sameSide) {
1076 sameSide = SMESH_Algo::IsContinuous(sideEdges.front(), edges.back());
1078 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
1081 list<TopoDS_Edge>::iterator ite = sideEdges.begin();
1082 aNbNodes[nbSides] = 1;
1083 for (; ite!=sideEdges.end(); ite++) {
1084 SMESH_subMesh * sm = aMesh.GetSubMesh(*ite);
1085 MapShapeNbElemsItr anIt = aResMap.find(sm);
1086 if (anIt==aResMap.end()) {
1089 std::vector<int> aVec = (*anIt).second;
1091 aNbNodes[nbSides] += (aVec[SMDSEntity_Node]-1)/2 + 1;
1093 aNbNodes[nbSides] += aVec[SMDSEntity_Node] + 1;
1097 // issue 20222. Try to unite only edges shared by two same faces
1100 SMESH_Block::GetOrderedEdges (F, V, edges, nbEdgesInWire);
1101 while (!edges.empty()) {
1103 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1104 bool sameSide = true;
1105 while (!edges.empty() && sameSide) {
1107 SMESH_Algo::IsContinuous(sideEdges.back(), edges.front()) &&
1108 twoEdgesMeatAtVertex(sideEdges.back(), edges.front(), aMesh);
1110 sideEdges.splice(sideEdges.end(), edges, edges.begin());
1112 if (nbSides == 0) { // go backward from the first edge
1114 while (!edges.empty() && sameSide) {
1116 SMESH_Algo::IsContinuous(sideEdges.front(), edges.back()) &&
1117 twoEdgesMeatAtVertex(sideEdges.front(), edges.back(), aMesh);
1119 sideEdges.splice(sideEdges.begin(), edges, --edges.end());
1122 list<TopoDS_Edge>::iterator ite = sideEdges.begin();
1123 aNbNodes[nbSides] = 1;
1124 for (; ite!=sideEdges.end(); ite++) {
1125 SMESH_subMesh * sm = aMesh.GetSubMesh(*ite);
1126 MapShapeNbElemsItr anIt = aResMap.find(sm);
1127 if (anIt==aResMap.end()) {
1130 std::vector<int> aVec = (*anIt).second;
1132 aNbNodes[nbSides] += (aVec[SMDSEntity_Node]-1)/2 + 1;
1134 aNbNodes[nbSides] += aVec[SMDSEntity_Node] + 1;
1142 nbSides = nbEdgesInWire.front();
1143 error(COMPERR_BAD_SHAPE, TComm("Face must have 4 sides but not ") << nbSides);
1151 //=============================================================================
1155 //=============================================================================
1157 FaceQuadStruct *StdMeshers_Quadrangle_2D::CheckAnd2Dcompute
1158 (SMESH_Mesh & aMesh,
1159 const TopoDS_Shape & aShape,
1160 const bool CreateQuadratic) //throw(SALOME_Exception)
1162 _quadraticMesh = CreateQuadratic;
1164 FaceQuadStruct *quad = CheckNbEdges(aMesh, aShape);
1166 if (!quad) return 0;
1168 // set normalized grid on unit square in parametric domain
1169 bool stat = SetNormalizedGrid(aMesh, aShape, quad);
1171 if (quad) delete quad;
1178 //=============================================================================
1182 //=============================================================================
1184 faceQuadStruct::~faceQuadStruct()
1186 for (int i = 0; i < side.size(); i++) {
1187 if (side[i]) delete side[i];
1189 if (uv_grid) delete [] uv_grid;
1193 inline const vector<UVPtStruct>& GetUVPtStructIn(FaceQuadStruct* quad, int i, int nbSeg)
1195 bool isXConst = (i == BOTTOM_SIDE || i == TOP_SIDE);
1196 double constValue = (i == BOTTOM_SIDE || i == LEFT_SIDE) ? 0 : 1;
1198 quad->isEdgeOut[i] ?
1199 quad->side[i]->SimulateUVPtStruct(nbSeg,isXConst,constValue) :
1200 quad->side[i]->GetUVPtStruct(isXConst,constValue);
1202 inline gp_UV CalcUV(double x, double y,
1203 const gp_UV& a0,const gp_UV& a1,const gp_UV& a2,const gp_UV& a3,
1204 const gp_UV& p0,const gp_UV& p1,const gp_UV& p2,const gp_UV& p3)
1207 ((1 - y) * p0 + x * p1 + y * p2 + (1 - x) * p3 ) -
1208 ((1 - x) * (1 - y) * a0 + x * (1 - y) * a1 + x * y * a2 + (1 - x) * y * a3);
1212 //=============================================================================
1216 //=============================================================================
1218 bool StdMeshers_Quadrangle_2D::SetNormalizedGrid (SMESH_Mesh & aMesh,
1219 const TopoDS_Shape& aShape,
1220 FaceQuadStruct* & quad) //throw (SALOME_Exception)
1222 // Algorithme décrit dans "Génération automatique de maillages"
1223 // P.L. GEORGE, MASSON, § 6.4.1 p. 84-85
1224 // traitement dans le domaine paramétrique 2d u,v
1225 // transport - projection sur le carré unité
1227 // MESSAGE("StdMeshers_Quadrangle_2D::SetNormalizedGrid");
1228 // const TopoDS_Face& F = TopoDS::Face(aShape);
1230 // 1 --- find orientation of the 4 edges, by test on extrema
1233 // |<----north-2-------^ a3 -------------> a2
1235 // west-3 east-1 =right | |
1239 // v----south-0--------> a0 -------------> a1
1244 // 3 --- 2D normalized values on unit square [0..1][0..1]
1246 int nbhoriz = Min(quad->side[0]->NbPoints(), quad->side[2]->NbPoints());
1247 int nbvertic = Min(quad->side[1]->NbPoints(), quad->side[3]->NbPoints());
1249 quad->isEdgeOut[0] = (quad->side[0]->NbPoints() > quad->side[2]->NbPoints());
1250 quad->isEdgeOut[1] = (quad->side[1]->NbPoints() > quad->side[3]->NbPoints());
1251 quad->isEdgeOut[2] = (quad->side[2]->NbPoints() > quad->side[0]->NbPoints());
1252 quad->isEdgeOut[3] = (quad->side[3]->NbPoints() > quad->side[1]->NbPoints());
1254 UVPtStruct *uv_grid = quad->uv_grid = new UVPtStruct[nbvertic * nbhoriz];
1256 const vector<UVPtStruct>& uv_e0 = GetUVPtStructIn(quad, 0, nbhoriz - 1);
1257 const vector<UVPtStruct>& uv_e1 = GetUVPtStructIn(quad, 1, nbvertic - 1);
1258 const vector<UVPtStruct>& uv_e2 = GetUVPtStructIn(quad, 2, nbhoriz - 1);
1259 const vector<UVPtStruct>& uv_e3 = GetUVPtStructIn(quad, 3, nbvertic - 1);
1261 if (uv_e0.empty() || uv_e1.empty() || uv_e2.empty() || uv_e3.empty())
1262 //return error("Can't find nodes on sides");
1263 return error(COMPERR_BAD_INPUT_MESH);
1266 UpdateDegenUV( quad );
1268 // nodes Id on "in" edges
1269 if (! quad->isEdgeOut[0]) {
1271 for (int i = 0; i < nbhoriz; i++) { // down
1272 int ij = j * nbhoriz + i;
1273 uv_grid[ij].node = uv_e0[i].node;
1276 if (! quad->isEdgeOut[1]) {
1277 int i = nbhoriz - 1;
1278 for (int j = 0; j < nbvertic; j++) { // right
1279 int ij = j * nbhoriz + i;
1280 uv_grid[ij].node = uv_e1[j].node;
1283 if (! quad->isEdgeOut[2]) {
1284 int j = nbvertic - 1;
1285 for (int i = 0; i < nbhoriz; i++) { // up
1286 int ij = j * nbhoriz + i;
1287 uv_grid[ij].node = uv_e2[i].node;
1290 if (! quad->isEdgeOut[3]) {
1292 for (int j = 0; j < nbvertic; j++) { // left
1293 int ij = j * nbhoriz + i;
1294 uv_grid[ij].node = uv_e3[j].node;
1298 // normalized 2d values on grid
1299 for (int i = 0; i < nbhoriz; i++) {
1300 for (int j = 0; j < nbvertic; j++) {
1301 int ij = j * nbhoriz + i;
1302 // --- droite i cste : x = x0 + y(x1-x0)
1303 double x0 = uv_e0[i].normParam; // bas - sud
1304 double x1 = uv_e2[i].normParam; // haut - nord
1305 // --- droite j cste : y = y0 + x(y1-y0)
1306 double y0 = uv_e3[j].normParam; // gauche-ouest
1307 double y1 = uv_e1[j].normParam; // droite - est
1308 // --- intersection : x=x0+(y0+x(y1-y0))(x1-x0)
1309 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1310 double y = y0 + x * (y1 - y0);
1313 //MESSAGE("-xy-01 "<<x0<<" "<<x1<<" "<<y0<<" "<<y1);
1314 //MESSAGE("-xy-norm "<<i<<" "<<j<<" "<<x<<" "<<y);
1318 // 4 --- projection on 2d domain (u,v)
1319 gp_UV a0(uv_e0.front().u, uv_e0.front().v);
1320 gp_UV a1(uv_e0.back().u, uv_e0.back().v);
1321 gp_UV a2(uv_e2.back().u, uv_e2.back().v);
1322 gp_UV a3(uv_e2.front().u, uv_e2.front().v);
1324 for (int i = 0; i < nbhoriz; i++) {
1325 for (int j = 0; j < nbvertic; j++) {
1326 int ij = j * nbhoriz + i;
1327 double x = uv_grid[ij].x;
1328 double y = uv_grid[ij].y;
1329 double param_0 = uv_e0[0].normParam + x * (uv_e0.back().normParam - uv_e0[0].normParam); // sud
1330 double param_2 = uv_e2[0].normParam + x * (uv_e2.back().normParam - uv_e2[0].normParam); // nord
1331 double param_1 = uv_e1[0].normParam + y * (uv_e1.back().normParam - uv_e1[0].normParam); // est
1332 double param_3 = uv_e3[0].normParam + y * (uv_e3.back().normParam - uv_e3[0].normParam); // ouest
1334 //MESSAGE("params "<<param_0<<" "<<param_1<<" "<<param_2<<" "<<param_3);
1335 gp_UV p0 = quad->side[0]->Value2d(param_0).XY();
1336 gp_UV p1 = quad->side[1]->Value2d(param_1).XY();
1337 gp_UV p2 = quad->side[2]->Value2d(param_2).XY();
1338 gp_UV p3 = quad->side[3]->Value2d(param_3).XY();
1340 gp_UV uv = CalcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1342 uv_grid[ij].u = uv.X();
1343 uv_grid[ij].v = uv.Y();
1349 //=======================================================================
1350 //function : ShiftQuad
1351 //purpose : auxilary function for ComputeQuadPref
1352 //=======================================================================
1354 static void ShiftQuad(FaceQuadStruct* quad, const int num, bool)
1356 StdMeshers_FaceSide* side[4] = { quad->side[0], quad->side[1], quad->side[2], quad->side[3] };
1357 for (int i = BOTTOM_SIDE; i < NB_SIDES; ++i) {
1358 int id = (i + num) % NB_SIDES;
1359 bool wasForward = (i < TOP_SIDE);
1360 bool newForward = (id < TOP_SIDE);
1361 if (wasForward != newForward)
1362 side[ i ]->Reverse();
1363 quad->side[ id ] = side[ i ];
1367 //=======================================================================
1369 //purpose : auxilary function for ComputeQuadPref
1370 //=======================================================================
1372 static gp_UV CalcUV(double x0, double x1, double y0, double y1,
1373 FaceQuadStruct* quad,
1374 const gp_UV& a0, const gp_UV& a1,
1375 const gp_UV& a2, const gp_UV& a3)
1377 const vector<UVPtStruct>& uv_eb = quad->side[0]->GetUVPtStruct(true,0);
1378 const vector<UVPtStruct>& uv_er = quad->side[1]->GetUVPtStruct(false,1);
1379 const vector<UVPtStruct>& uv_et = quad->side[2]->GetUVPtStruct(true,1);
1380 const vector<UVPtStruct>& uv_el = quad->side[3]->GetUVPtStruct(false,0);
1382 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1383 double y = y0 + x * (y1 - y0);
1385 double param_b = uv_eb[0].normParam + x * (uv_eb.back().normParam - uv_eb[0].normParam);
1386 double param_t = uv_et[0].normParam + x * (uv_et.back().normParam - uv_et[0].normParam);
1387 double param_r = uv_er[0].normParam + y * (uv_er.back().normParam - uv_er[0].normParam);
1388 double param_l = uv_el[0].normParam + y * (uv_el.back().normParam - uv_el[0].normParam);
1390 gp_UV p0 = quad->side[BOTTOM_SIDE]->Value2d(param_b).XY();
1391 gp_UV p1 = quad->side[RIGHT_SIDE ]->Value2d(param_r).XY();
1392 gp_UV p2 = quad->side[TOP_SIDE ]->Value2d(param_t).XY();
1393 gp_UV p3 = quad->side[LEFT_SIDE ]->Value2d(param_l).XY();
1395 gp_UV uv = CalcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1400 //=======================================================================
1401 //function : CalcUV2
1402 //purpose : auxilary function for ComputeQuadPref
1403 //=======================================================================
1405 static gp_UV CalcUV2(double x, double y,
1406 FaceQuadStruct* quad,
1407 const gp_UV& a0, const gp_UV& a1,
1408 const gp_UV& a2, const gp_UV& a3)
1410 gp_UV p0 = quad->side[BOTTOM_SIDE]->Value2d(x).XY();
1411 gp_UV p1 = quad->side[RIGHT_SIDE ]->Value2d(y).XY();
1412 gp_UV p2 = quad->side[TOP_SIDE ]->Value2d(x).XY();
1413 gp_UV p3 = quad->side[LEFT_SIDE ]->Value2d(y).XY();
1415 gp_UV uv = CalcUV(x,y, a0,a1,a2,a3, p0,p1,p2,p3);
1421 //=======================================================================
1423 * Create only quandrangle faces
1425 //=======================================================================
1427 bool StdMeshers_Quadrangle_2D::ComputeQuadPref (SMESH_Mesh & aMesh,
1428 const TopoDS_Shape& aShape,
1429 FaceQuadStruct* quad)
1431 // Auxilary key in order to keep old variant
1432 // of meshing after implementation new variant
1433 // for bug 0016220 from Mantis.
1434 bool OldVersion = false;
1435 if (myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
1438 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
1439 const TopoDS_Face& F = TopoDS::Face(aShape);
1440 Handle(Geom_Surface) S = BRep_Tool::Surface(F);
1442 int i,j,geomFaceID = meshDS->ShapeToIndex(F);
1444 int nb = quad->side[0]->NbPoints();
1445 int nr = quad->side[1]->NbPoints();
1446 int nt = quad->side[2]->NbPoints();
1447 int nl = quad->side[3]->NbPoints();
1448 int dh = abs(nb-nt);
1449 int dv = abs(nr-nl);
1453 // it is a base case => not shift quad but me be replacement is need
1454 ShiftQuad(quad,0,WisF);
1457 // we have to shift quad on 2
1458 ShiftQuad(quad,2,WisF);
1463 // we have to shift quad on 1
1464 ShiftQuad(quad,1,WisF);
1467 // we have to shift quad on 3
1468 ShiftQuad(quad,3,WisF);
1472 nb = quad->side[0]->NbPoints();
1473 nr = quad->side[1]->NbPoints();
1474 nt = quad->side[2]->NbPoints();
1475 nl = quad->side[3]->NbPoints();
1478 int nbh = Max(nb,nt);
1479 int nbv = Max(nr,nl);
1483 // ----------- Old version ---------------
1484 // orientation of face and 3 main domain for future faces
1490 // left | | | | rigth
1497 // ----------- New version ---------------
1498 // orientation of face and 3 main domain for future faces
1504 // left |/________\| rigth
1520 const vector<UVPtStruct>& uv_eb = quad->side[0]->GetUVPtStruct(true,0);
1521 const vector<UVPtStruct>& uv_er = quad->side[1]->GetUVPtStruct(false,1);
1522 const vector<UVPtStruct>& uv_et = quad->side[2]->GetUVPtStruct(true,1);
1523 const vector<UVPtStruct>& uv_el = quad->side[3]->GetUVPtStruct(false,0);
1525 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
1526 return error(COMPERR_BAD_INPUT_MESH);
1529 UpdateDegenUV( quad );
1531 // arrays for normalized params
1532 //cout<<"Dump B:"<<endl;
1533 TColStd_SequenceOfReal npb, npr, npt, npl;
1534 for (i=0; i<nb; i++) {
1535 npb.Append(uv_eb[i].normParam);
1536 //cout<<"i="<<i<<" par="<<uv_eb[i].normParam<<" npar="<<uv_eb[i].normParam;
1537 //const SMDS_MeshNode* N = uv_eb[i].node;
1538 //cout<<" node("<<N->X()<<","<<N->Y()<<","<<N->Z()<<")"<<endl;
1540 for (i=0; i<nr; i++) {
1541 npr.Append(uv_er[i].normParam);
1543 for (i=0; i<nt; i++) {
1544 npt.Append(uv_et[i].normParam);
1546 for (i=0; i<nl; i++) {
1547 npl.Append(uv_el[i].normParam);
1552 // add some params to right and left after the first param
1555 double dpr = (npr.Value(2) - npr.Value(1))/(dr+1);
1556 for (i=1; i<=dr; i++) {
1557 npr.InsertAfter(1,npr.Value(2)-dpr);
1561 dpr = (npl.Value(2) - npl.Value(1))/(dl+1);
1562 for (i=1; i<=dl; i++) {
1563 npl.InsertAfter(1,npl.Value(2)-dpr);
1567 //for (i=1; i<=npb.Length(); i++) {
1568 // cout<<" "<<npb.Value(i);
1572 gp_XY a0(uv_eb.front().u, uv_eb.front().v);
1573 gp_XY a1(uv_eb.back().u, uv_eb.back().v);
1574 gp_XY a2(uv_et.back().u, uv_et.back().v);
1575 gp_XY a3(uv_et.front().u, uv_et.front().v);
1576 //cout<<" a0("<<a0.X()<<","<<a0.Y()<<")"<<" a1("<<a1.X()<<","<<a1.Y()<<")"
1577 // <<" a2("<<a2.X()<<","<<a2.Y()<<")"<<" a3("<<a3.X()<<","<<a3.Y()<<")"<<endl;
1579 int nnn = Min(nr,nl);
1580 // auxilary sequence of XY for creation nodes
1581 // in the bottom part of central domain
1582 // Length of UVL and UVR must be == nbv-nnn
1583 TColgp_SequenceOfXY UVL, UVR, UVT;
1586 // step1: create faces for left domain
1587 StdMeshers_Array2OfNode NodesL(1,dl+1,1,nl);
1589 for (j=1; j<=nl; j++)
1590 NodesL.SetValue(1,j,uv_el[j-1].node);
1593 for (i=1; i<=dl; i++)
1594 NodesL.SetValue(i+1,nl,uv_et[i].node);
1595 // create and add needed nodes
1596 TColgp_SequenceOfXY UVtmp;
1597 for (i=1; i<=dl; i++) {
1598 double x0 = npt.Value(i+1);
1601 double y0 = npl.Value(i+1);
1602 double y1 = npr.Value(i+1);
1603 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1604 gp_Pnt P = S->Value(UV.X(),UV.Y());
1605 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1606 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1607 NodesL.SetValue(i+1,1,N);
1608 if (UVL.Length()<nbv-nnn) UVL.Append(UV);
1610 for (j=2; j<nl; j++) {
1611 double y0 = npl.Value(dl+j);
1612 double y1 = npr.Value(dl+j);
1613 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1614 gp_Pnt P = S->Value(UV.X(),UV.Y());
1615 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1616 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1617 NodesL.SetValue(i+1,j,N);
1618 if (i==dl) UVtmp.Append(UV);
1621 for (i=1; i<=UVtmp.Length() && UVL.Length()<nbv-nnn; i++) {
1622 UVL.Append(UVtmp.Value(i));
1624 //cout<<"Dump NodesL:"<<endl;
1625 //for (i=1; i<=dl+1; i++) {
1627 // for (j=1; j<=nl; j++) {
1628 // cout<<" ("<<NodesL.Value(i,j)->X()<<","<<NodesL.Value(i,j)->Y()<<","<<NodesL.Value(i,j)->Z()<<")";
1633 for (i=1; i<=dl; i++) {
1634 for (j=1; j<nl; j++) {
1637 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i+1,j),
1638 NodesL.Value(i+1,j+1), NodesL.Value(i,j+1));
1639 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1643 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i,j+1),
1644 NodesL.Value(i+1,j+1), NodesL.Value(i+1,j));
1645 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1651 // fill UVL using c2d
1652 for (i=1; i<npl.Length() && UVL.Length()<nbv-nnn; i++) {
1653 UVL.Append(gp_UV (uv_el[i].u, uv_el[i].v));
1657 // step2: create faces for right domain
1658 StdMeshers_Array2OfNode NodesR(1,dr+1,1,nr);
1660 for (j=1; j<=nr; j++)
1661 NodesR.SetValue(1,j,uv_er[nr-j].node);
1664 for (i=1; i<=dr; i++)
1665 NodesR.SetValue(i+1,1,uv_et[nt-1-i].node);
1666 // create and add needed nodes
1667 TColgp_SequenceOfXY UVtmp;
1668 for (i=1; i<=dr; i++) {
1669 double x0 = npt.Value(nt-i);
1672 double y0 = npl.Value(i+1);
1673 double y1 = npr.Value(i+1);
1674 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1675 gp_Pnt P = S->Value(UV.X(),UV.Y());
1676 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1677 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1678 NodesR.SetValue(i+1,nr,N);
1679 if (UVR.Length()<nbv-nnn) UVR.Append(UV);
1681 for (j=2; j<nr; j++) {
1682 double y0 = npl.Value(nbv-j+1);
1683 double y1 = npr.Value(nbv-j+1);
1684 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1685 gp_Pnt P = S->Value(UV.X(),UV.Y());
1686 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1687 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1688 NodesR.SetValue(i+1,j,N);
1689 if (i==dr) UVtmp.Prepend(UV);
1692 for (i=1; i<=UVtmp.Length() && UVR.Length()<nbv-nnn; i++) {
1693 UVR.Append(UVtmp.Value(i));
1696 for (i=1; i<=dr; i++) {
1697 for (j=1; j<nr; j++) {
1700 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i+1,j),
1701 NodesR.Value(i+1,j+1), NodesR.Value(i,j+1));
1702 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1706 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i,j+1),
1707 NodesR.Value(i+1,j+1), NodesR.Value(i+1,j));
1708 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1714 // fill UVR using c2d
1715 for (i=1; i<npr.Length() && UVR.Length()<nbv-nnn; i++) {
1716 UVR.Append(gp_UV(uv_er[i].u, uv_er[i].v));
1720 // step3: create faces for central domain
1721 StdMeshers_Array2OfNode NodesC(1,nb,1,nbv);
1722 // add first line using NodesL
1723 for (i=1; i<=dl+1; i++)
1724 NodesC.SetValue(1,i,NodesL(i,1));
1725 for (i=2; i<=nl; i++)
1726 NodesC.SetValue(1,dl+i,NodesL(dl+1,i));
1727 // add last line using NodesR
1728 for (i=1; i<=dr+1; i++)
1729 NodesC.SetValue(nb,i,NodesR(i,nr));
1730 for (i=1; i<nr; i++)
1731 NodesC.SetValue(nb,dr+i+1,NodesR(dr+1,nr-i));
1732 // add top nodes (last columns)
1733 for (i=dl+2; i<nbh-dr; i++)
1734 NodesC.SetValue(i-dl,nbv,uv_et[i-1].node);
1735 // add bottom nodes (first columns)
1736 for (i=2; i<nb; i++)
1737 NodesC.SetValue(i,1,uv_eb[i-1].node);
1739 // create and add needed nodes
1740 // add linear layers
1741 for (i=2; i<nb; i++) {
1742 double x0 = npt.Value(dl+i);
1744 for (j=1; j<nnn; j++) {
1745 double y0 = npl.Value(nbv-nnn+j);
1746 double y1 = npr.Value(nbv-nnn+j);
1747 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
1748 gp_Pnt P = S->Value(UV.X(),UV.Y());
1749 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1750 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1751 NodesC.SetValue(i,nbv-nnn+j,N);
1756 // add diagonal layers
1757 //cout<<"UVL.Length()="<<UVL.Length()<<" UVR.Length()="<<UVR.Length()<<endl;
1758 //cout<<"Dump UVL:"<<endl;
1759 //for (i=1; i<=UVL.Length(); i++) {
1760 // cout<<" ("<<UVL.Value(i).X()<<","<<UVL.Value(i).Y()<<")";
1763 gp_UV A2 = UVR.Value(nbv-nnn);
1764 gp_UV A3 = UVL.Value(nbv-nnn);
1765 for (i=1; i<nbv-nnn; i++) {
1766 gp_UV p1 = UVR.Value(i);
1767 gp_UV p3 = UVL.Value(i);
1768 double y = i / double(nbv-nnn);
1769 for (j=2; j<nb; j++) {
1770 double x = npb.Value(j);
1771 gp_UV p0( uv_eb[j-1].u, uv_eb[j-1].v );
1772 gp_UV p2 = UVT.Value( j-1 );
1773 gp_UV UV = CalcUV(x, y, a0, a1, A2, A3, p0,p1,p2,p3 );
1774 gp_Pnt P = S->Value(UV.X(),UV.Y());
1775 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1776 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(),UV.Y());
1777 NodesC.SetValue(j,i+1,N);
1781 for (i=1; i<nb; i++) {
1782 for (j=1; j<nbv; j++) {
1785 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
1786 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
1787 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1791 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i,j+1),
1792 NodesC.Value(i+1,j+1), NodesC.Value(i+1,j));
1793 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1799 else { // New version (!OldVersion)
1800 // step1: create faces for bottom rectangle domain
1801 StdMeshers_Array2OfNode NodesBRD(1,nb,1,nnn-1);
1802 // fill UVL and UVR using c2d
1803 for (j=0; j<nb; j++) {
1804 NodesBRD.SetValue(j+1,1,uv_eb[j].node);
1806 for (i=1; i<nnn-1; i++) {
1807 NodesBRD.SetValue(1,i+1,uv_el[i].node);
1808 NodesBRD.SetValue(nb,i+1,uv_er[i].node);
1809 for (j=2; j<nb; j++) {
1810 double x = npb.Value(j);
1811 double y = (1-x) * npl.Value(i+1) + x * npr.Value(i+1);
1812 gp_UV UV = CalcUV2(x, y, quad, a0, a1, a2, a3);
1813 gp_Pnt P = S->Value(UV.X(),UV.Y());
1814 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1815 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(),UV.Y());
1816 NodesBRD.SetValue(j,i+1,N);
1819 for (j=1; j<nnn-1; j++) {
1820 for (i=1; i<nb; i++) {
1823 myHelper->AddFace(NodesBRD.Value(i,j), NodesBRD.Value(i+1,j),
1824 NodesBRD.Value(i+1,j+1), NodesBRD.Value(i,j+1));
1825 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1829 myHelper->AddFace(NodesBRD.Value(i,j), NodesBRD.Value(i,j+1),
1830 NodesBRD.Value(i+1,j+1), NodesBRD.Value(i+1,j));
1831 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1835 int drl = abs(nr-nl);
1836 // create faces for region C
1837 StdMeshers_Array2OfNode NodesC(1,nb,1,drl+1+addv);
1838 // add nodes from previous region
1839 for (j=1; j<=nb; j++) {
1840 NodesC.SetValue(j,1,NodesBRD.Value(j,nnn-1));
1842 if ((drl+addv) > 0) {
1847 TColgp_SequenceOfXY UVtmp;
1848 double drparam = npr.Value(nr) - npr.Value(nnn-1);
1849 double dlparam = npl.Value(nnn) - npl.Value(nnn-1);
1851 for (i=1; i<=drl; i++) {
1852 // add existed nodes from right edge
1853 NodesC.SetValue(nb,i+1,uv_er[nnn+i-2].node);
1854 //double dtparam = npt.Value(i+1);
1855 y1 = npr.Value(nnn+i-1); // param on right edge
1856 double dpar = (y1 - npr.Value(nnn-1))/drparam;
1857 y0 = npl.Value(nnn-1) + dpar*dlparam; // param on left edge
1858 double dy = y1 - y0;
1859 for (j=1; j<nb; j++) {
1860 double x = npt.Value(i+1) + npb.Value(j)*(1-npt.Value(i+1));
1861 double y = y0 + dy*x;
1862 gp_UV UV = CalcUV2(x, y, quad, a0, a1, a2, a3);
1863 gp_Pnt P = S->Value(UV.X(),UV.Y());
1864 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1865 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1866 NodesC.SetValue(j,i+1,N);
1869 double dy0 = (1-y0)/(addv+1);
1870 double dy1 = (1-y1)/(addv+1);
1871 for (i=1; i<=addv; i++) {
1872 double yy0 = y0 + dy0*i;
1873 double yy1 = y1 + dy1*i;
1874 double dyy = yy1 - yy0;
1875 for (j=1; j<=nb; j++) {
1876 double x = npt.Value(i+1+drl) +
1877 npb.Value(j) * (npt.Value(nt-i) - npt.Value(i+1+drl));
1878 double y = yy0 + dyy*x;
1879 gp_UV UV = CalcUV2(x, y, quad, a0, a1, a2, a3);
1880 gp_Pnt P = S->Value(UV.X(),UV.Y());
1881 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1882 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1883 NodesC.SetValue(j,i+drl+1,N);
1890 TColgp_SequenceOfXY UVtmp;
1891 double dlparam = npl.Value(nl) - npl.Value(nnn-1);
1892 double drparam = npr.Value(nnn) - npr.Value(nnn-1);
1893 double y0 = npl.Value(nnn-1);
1894 double y1 = npr.Value(nnn-1);
1895 for (i=1; i<=drl; i++) {
1896 // add existed nodes from right edge
1897 NodesC.SetValue(1,i+1,uv_el[nnn+i-2].node);
1898 y0 = npl.Value(nnn+i-1); // param on left edge
1899 double dpar = (y0 - npl.Value(nnn-1))/dlparam;
1900 y1 = npr.Value(nnn-1) + dpar*drparam; // param on right edge
1901 double dy = y1 - y0;
1902 for (j=2; j<=nb; j++) {
1903 double x = npb.Value(j)*npt.Value(nt-i);
1904 double y = y0 + dy*x;
1905 gp_UV UV = CalcUV2(x, y, quad, a0, a1, a2, a3);
1906 gp_Pnt P = S->Value(UV.X(),UV.Y());
1907 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1908 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1909 NodesC.SetValue(j,i+1,N);
1912 double dy0 = (1-y0)/(addv+1);
1913 double dy1 = (1-y1)/(addv+1);
1914 for (i=1; i<=addv; i++) {
1915 double yy0 = y0 + dy0*i;
1916 double yy1 = y1 + dy1*i;
1917 double dyy = yy1 - yy0;
1918 for (j=1; j<=nb; j++) {
1919 double x = npt.Value(i+1) +
1920 npb.Value(j) * (npt.Value(nt-i-drl) - npt.Value(i+1));
1921 double y = yy0 + dyy*x;
1922 gp_UV UV = CalcUV2(x, y, quad, a0, a1, a2, a3);
1923 gp_Pnt P = S->Value(UV.X(),UV.Y());
1924 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
1925 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
1926 NodesC.SetValue(j,i+drl+1,N);
1931 for (j=1; j<=drl+addv; j++) {
1932 for (i=1; i<nb; i++) {
1935 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
1936 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
1937 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1941 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i,j+1),
1942 NodesC.Value(i+1,j+1), NodesC.Value(i+1,j));
1943 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1948 StdMeshers_Array2OfNode NodesLast(1,nt,1,2);
1949 for (i=1; i<=nt; i++) {
1950 NodesLast.SetValue(i,2,uv_et[i-1].node);
1953 for (i=n1; i<drl+addv+1; i++) {
1955 NodesLast.SetValue(nnn,1,NodesC.Value(1,i));
1957 for (i=1; i<=nb; i++) {
1959 NodesLast.SetValue(nnn,1,NodesC.Value(i,drl+addv+1));
1961 for (i=drl+addv; i>=n2; i--) {
1963 NodesLast.SetValue(nnn,1,NodesC.Value(nb,i));
1965 for (i=1; i<nt; i++) {
1968 myHelper->AddFace(NodesLast.Value(i,1), NodesLast.Value(i+1,1),
1969 NodesLast.Value(i+1,2), NodesLast.Value(i,2));
1970 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1974 myHelper->AddFace(NodesLast.Value(i,1), NodesLast.Value(i,2),
1975 NodesLast.Value(i+1,2), NodesLast.Value(i+1,2));
1976 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
1979 } // if ((drl+addv) > 0)
1981 } // end new version implementation
1988 //=======================================================================
1990 * Evaluate only quandrangle faces
1992 //=======================================================================
1994 bool StdMeshers_Quadrangle_2D::EvaluateQuadPref(SMESH_Mesh & aMesh,
1995 const TopoDS_Shape& aShape,
1996 std::vector<int>& aNbNodes,
1997 MapShapeNbElems& aResMap,
2000 // Auxilary key in order to keep old variant
2001 // of meshing after implementation new variant
2002 // for bug 0016220 from Mantis.
2003 bool OldVersion = false;
2004 if (myQuadType == QUAD_QUADRANGLE_PREF_REVERSED)
2007 const TopoDS_Face& F = TopoDS::Face(aShape);
2008 Handle(Geom_Surface) S = BRep_Tool::Surface(F);
2010 int nb = aNbNodes[0];
2011 int nr = aNbNodes[1];
2012 int nt = aNbNodes[2];
2013 int nl = aNbNodes[3];
2014 int dh = abs(nb-nt);
2015 int dv = abs(nr-nl);
2019 // it is a base case => not shift
2022 // we have to shift on 2
2031 // we have to shift quad on 1
2038 // we have to shift quad on 3
2048 int nbh = Max(nb,nt);
2049 int nbv = Max(nr,nl);
2064 // add some params to right and left after the first param
2071 int nnn = Min(nr,nl);
2076 // step1: create faces for left domain
2078 nbNodes += dl*(nl-1);
2079 nbFaces += dl*(nl-1);
2081 // step2: create faces for right domain
2083 nbNodes += dr*(nr-1);
2084 nbFaces += dr*(nr-1);
2086 // step3: create faces for central domain
2087 nbNodes += (nb-2)*(nnn-1) + (nbv-nnn-1)*(nb-2);
2088 nbFaces += (nb-1)*(nbv-1);
2090 else { // New version (!OldVersion)
2091 nbNodes += (nnn-2)*(nb-2);
2092 nbFaces += (nnn-2)*(nb-1);
2093 int drl = abs(nr-nl);
2094 nbNodes += drl*(nb-1) + addv*nb;
2095 nbFaces += (drl+addv)*(nb-1) + (nt-1);
2096 } // end new version implementation
2098 std::vector<int> aVec(SMDSEntity_Last);
2099 for (int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aVec[i] = 0;
2101 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces;
2102 aVec[SMDSEntity_Node] = nbNodes + nbFaces*4;
2103 if (aNbNodes.size()==5) {
2104 aVec[SMDSEntity_Quad_Triangle] = aNbNodes[3] - 1;
2105 aVec[SMDSEntity_Quad_Quadrangle] = nbFaces - aNbNodes[3] + 1;
2109 aVec[SMDSEntity_Node] = nbNodes;
2110 aVec[SMDSEntity_Quadrangle] = nbFaces;
2111 if (aNbNodes.size()==5) {
2112 aVec[SMDSEntity_Triangle] = aNbNodes[3] - 1;
2113 aVec[SMDSEntity_Quadrangle] = nbFaces - aNbNodes[3] + 1;
2116 SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
2117 aResMap.insert(std::make_pair(sm,aVec));
2123 //=============================================================================
2124 /*! Split quadrangle in to 2 triangles by smallest diagonal
2127 //=============================================================================
2128 void StdMeshers_Quadrangle_2D::SplitQuad(SMESHDS_Mesh *theMeshDS,
2130 const SMDS_MeshNode* theNode1,
2131 const SMDS_MeshNode* theNode2,
2132 const SMDS_MeshNode* theNode3,
2133 const SMDS_MeshNode* theNode4)
2135 gp_Pnt a(theNode1->X(),theNode1->Y(),theNode1->Z());
2136 gp_Pnt b(theNode2->X(),theNode2->Y(),theNode2->Z());
2137 gp_Pnt c(theNode3->X(),theNode3->Y(),theNode3->Z());
2138 gp_Pnt d(theNode4->X(),theNode4->Y(),theNode4->Z());
2139 SMDS_MeshFace* face;
2140 if (a.Distance(c) > b.Distance(d)){
2141 face = myHelper->AddFace(theNode2, theNode4 , theNode1);
2142 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2143 face = myHelper->AddFace(theNode2, theNode3, theNode4);
2144 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2148 face = myHelper->AddFace(theNode1, theNode2 ,theNode3);
2149 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2150 face = myHelper->AddFace(theNode1, theNode3, theNode4);
2151 if (face) theMeshDS->SetMeshElementOnShape(face, theFaceID);
2155 //=======================================================================
2157 * Implementation of Reduced algorithm (meshing with quadrangles only)
2159 //=======================================================================
2160 bool StdMeshers_Quadrangle_2D::ComputeReduced (SMESH_Mesh & aMesh,
2161 const TopoDS_Shape& aShape,
2162 FaceQuadStruct* quad)
2164 SMESHDS_Mesh * meshDS = aMesh.GetMeshDS();
2165 const TopoDS_Face& F = TopoDS::Face(aShape);
2166 Handle(Geom_Surface) S = BRep_Tool::Surface(F);
2167 int i,j,geomFaceID = meshDS->ShapeToIndex(F);
2169 int nb = quad->side[0]->NbPoints();
2170 int nr = quad->side[1]->NbPoints();
2171 int nt = quad->side[2]->NbPoints();
2172 int nl = quad->side[3]->NbPoints();
2174 // Simple Reduce 8->6->4->2 (3 steps) Multiple Reduce 8->2 (1 step)
2176 // .-----.-----.-----.-----. .-----.-----.-----.-----.
2177 // | / \ | / \ | | / \ | / \ |
2178 // | / .--.--. \ | | / \ | / \ |
2179 // | / / | \ \ | | / .----.----. \ |
2180 // .---.---.---.---.---.---. | / / \ | / \ \ |
2181 // | / / \ | / \ \ | | / / \ | / \ \ |
2182 // | / / .-.-. \ \ | | / / .---.---. \ \ |
2183 // | / / / | \ \ \ | | / / / \ | / \ \ \ |
2184 // .--.--.--.--.--.--.--.--. | / / / \ | / \ \ \ |
2185 // | / / / \ | / \ \ \ | | / / / .-.-. \ \ \ |
2186 // | / / / .-.-. \ \ \ | | / / / / | \ \ \ \ |
2187 // | / / / / | \ \ \ \ | | / / / / | \ \ \ \ |
2188 // .-.-.-.--.--.--.--.-.-.-. .-.-.-.--.--.--.--.-.-.-.
2190 bool MultipleReduce = false;
2202 else if (nb == nt) {
2203 nr1 = nb; // and == nt
2217 // number of rows and columns
2218 int nrows = nr1 - 1;
2219 int ncol_top = nt1 - 1;
2220 int ncol_bot = nb1 - 1;
2221 // number of rows needed to reduce ncol_bot to ncol_top using simple 3->1 "tree" (see below)
2222 int nrows_tree31 = int( log( (double)(ncol_bot / ncol_top) ) / log((double) 3 )); // = log x base 3
2223 if ( nrows < nrows_tree31 )
2224 MultipleReduce = true;
2227 if (MultipleReduce) { // == ComputeQuadPref QUAD_QUADRANGLE_PREF_REVERSED
2228 //==================================================
2229 int dh = abs(nb-nt);
2230 int dv = abs(nr-nl);
2234 // it is a base case => not shift quad but may be replacement is need
2235 ShiftQuad(quad,0,true);
2238 // we have to shift quad on 2
2239 ShiftQuad(quad,2,true);
2244 // we have to shift quad on 1
2245 ShiftQuad(quad,1,true);
2248 // we have to shift quad on 3
2249 ShiftQuad(quad,3,true);
2253 nb = quad->side[0]->NbPoints();
2254 nr = quad->side[1]->NbPoints();
2255 nt = quad->side[2]->NbPoints();
2256 nl = quad->side[3]->NbPoints();
2259 int nbh = Max(nb,nt);
2260 int nbv = Max(nr,nl);
2273 const vector<UVPtStruct>& uv_eb = quad->side[0]->GetUVPtStruct(true,0);
2274 const vector<UVPtStruct>& uv_er = quad->side[1]->GetUVPtStruct(false,1);
2275 const vector<UVPtStruct>& uv_et = quad->side[2]->GetUVPtStruct(true,1);
2276 const vector<UVPtStruct>& uv_el = quad->side[3]->GetUVPtStruct(false,0);
2278 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
2279 return error(COMPERR_BAD_INPUT_MESH);
2282 UpdateDegenUV( quad );
2284 // arrays for normalized params
2285 TColStd_SequenceOfReal npb, npr, npt, npl;
2286 for (j = 0; j < nb; j++) {
2287 npb.Append(uv_eb[j].normParam);
2289 for (i = 0; i < nr; i++) {
2290 npr.Append(uv_er[i].normParam);
2292 for (j = 0; j < nt; j++) {
2293 npt.Append(uv_et[j].normParam);
2295 for (i = 0; i < nl; i++) {
2296 npl.Append(uv_el[i].normParam);
2300 // orientation of face and 3 main domain for future faces
2306 // left | | | | rigth
2313 // add some params to right and left after the first param
2316 double dpr = (npr.Value(2) - npr.Value(1))/(dr+1);
2317 for (i=1; i<=dr; i++) {
2318 npr.InsertAfter(1,npr.Value(2)-dpr);
2322 dpr = (npl.Value(2) - npl.Value(1))/(dl+1);
2323 for (i=1; i<=dl; i++) {
2324 npl.InsertAfter(1,npl.Value(2)-dpr);
2327 gp_XY a0 (uv_eb.front().u, uv_eb.front().v);
2328 gp_XY a1 (uv_eb.back().u, uv_eb.back().v);
2329 gp_XY a2 (uv_et.back().u, uv_et.back().v);
2330 gp_XY a3 (uv_et.front().u, uv_et.front().v);
2332 int nnn = Min(nr,nl);
2333 // auxilary sequence of XY for creation nodes
2334 // in the bottom part of central domain
2335 // it's length must be == nbv-nnn-1
2336 TColgp_SequenceOfXY UVL;
2337 TColgp_SequenceOfXY UVR;
2338 //==================================================
2340 // step1: create faces for left domain
2341 StdMeshers_Array2OfNode NodesL(1,dl+1,1,nl);
2343 for (j=1; j<=nl; j++)
2344 NodesL.SetValue(1,j,uv_el[j-1].node);
2347 for (i=1; i<=dl; i++)
2348 NodesL.SetValue(i+1,nl,uv_et[i].node);
2349 // create and add needed nodes
2350 TColgp_SequenceOfXY UVtmp;
2351 for (i=1; i<=dl; i++) {
2352 double x0 = npt.Value(i+1);
2355 double y0 = npl.Value(i+1);
2356 double y1 = npr.Value(i+1);
2357 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2358 gp_Pnt P = S->Value(UV.X(),UV.Y());
2359 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2360 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2361 NodesL.SetValue(i+1,1,N);
2362 if (UVL.Length()<nbv-nnn-1) UVL.Append(UV);
2364 for (j=2; j<nl; j++) {
2365 double y0 = npl.Value(dl+j);
2366 double y1 = npr.Value(dl+j);
2367 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2368 gp_Pnt P = S->Value(UV.X(),UV.Y());
2369 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2370 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2371 NodesL.SetValue(i+1,j,N);
2372 if (i==dl) UVtmp.Append(UV);
2375 for (i=1; i<=UVtmp.Length() && UVL.Length()<nbv-nnn-1; i++) {
2376 UVL.Append(UVtmp.Value(i));
2379 for (i=1; i<=dl; i++) {
2380 for (j=1; j<nl; j++) {
2382 myHelper->AddFace(NodesL.Value(i,j), NodesL.Value(i+1,j),
2383 NodesL.Value(i+1,j+1), NodesL.Value(i,j+1));
2384 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2389 // fill UVL using c2d
2390 for (i=1; i<npl.Length() && UVL.Length()<nbv-nnn-1; i++) {
2391 UVL.Append(gp_UV (uv_el[i].u, uv_el[i].v));
2395 // step2: create faces for right domain
2396 StdMeshers_Array2OfNode NodesR(1,dr+1,1,nr);
2398 for (j=1; j<=nr; j++)
2399 NodesR.SetValue(1,j,uv_er[nr-j].node);
2402 for (i=1; i<=dr; i++)
2403 NodesR.SetValue(i+1,1,uv_et[nt-1-i].node);
2404 // create and add needed nodes
2405 TColgp_SequenceOfXY UVtmp;
2406 for (i=1; i<=dr; i++) {
2407 double x0 = npt.Value(nt-i);
2410 double y0 = npl.Value(i+1);
2411 double y1 = npr.Value(i+1);
2412 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2413 gp_Pnt P = S->Value(UV.X(),UV.Y());
2414 SMDS_MeshNode * N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2415 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2416 NodesR.SetValue(i+1,nr,N);
2417 if (UVR.Length()<nbv-nnn-1) UVR.Append(UV);
2419 for (j=2; j<nr; j++) {
2420 double y0 = npl.Value(nbv-j+1);
2421 double y1 = npr.Value(nbv-j+1);
2422 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2423 gp_Pnt P = S->Value(UV.X(),UV.Y());
2424 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2425 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2426 NodesR.SetValue(i+1,j,N);
2427 if (i==dr) UVtmp.Prepend(UV);
2430 for (i=1; i<=UVtmp.Length() && UVR.Length()<nbv-nnn-1; i++) {
2431 UVR.Append(UVtmp.Value(i));
2434 for (i=1; i<=dr; i++) {
2435 for (j=1; j<nr; j++) {
2437 myHelper->AddFace(NodesR.Value(i,j), NodesR.Value(i+1,j),
2438 NodesR.Value(i+1,j+1), NodesR.Value(i,j+1));
2439 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2444 // fill UVR using c2d
2445 for (i=1; i<npr.Length() && UVR.Length()<nbv-nnn-1; i++) {
2446 UVR.Append(gp_UV(uv_er[i].u, uv_er[i].v));
2450 // step3: create faces for central domain
2451 StdMeshers_Array2OfNode NodesC(1,nb,1,nbv);
2452 // add first line using NodesL
2453 for (i=1; i<=dl+1; i++)
2454 NodesC.SetValue(1,i,NodesL(i,1));
2455 for (i=2; i<=nl; i++)
2456 NodesC.SetValue(1,dl+i,NodesL(dl+1,i));
2457 // add last line using NodesR
2458 for (i=1; i<=dr+1; i++)
2459 NodesC.SetValue(nb,i,NodesR(i,nr));
2460 for (i=1; i<nr; i++)
2461 NodesC.SetValue(nb,dr+i+1,NodesR(dr+1,nr-i));
2462 // add top nodes (last columns)
2463 for (i=dl+2; i<nbh-dr; i++)
2464 NodesC.SetValue(i-dl,nbv,uv_et[i-1].node);
2465 // add bottom nodes (first columns)
2466 for (i=2; i<nb; i++)
2467 NodesC.SetValue(i,1,uv_eb[i-1].node);
2469 // create and add needed nodes
2470 // add linear layers
2471 for (i=2; i<nb; i++) {
2472 double x0 = npt.Value(dl+i);
2474 for (j=1; j<nnn; j++) {
2475 double y0 = npl.Value(nbv-nnn+j);
2476 double y1 = npr.Value(nbv-nnn+j);
2477 gp_UV UV = CalcUV(x0, x1, y0, y1, quad, a0, a1, a2, a3);
2478 gp_Pnt P = S->Value(UV.X(),UV.Y());
2479 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2480 meshDS->SetNodeOnFace(N, geomFaceID, UV.X(), UV.Y());
2481 NodesC.SetValue(i,nbv-nnn+j,N);
2484 // add diagonal layers
2485 for (i=1; i<nbv-nnn; i++) {
2486 double du = UVR.Value(i).X() - UVL.Value(i).X();
2487 double dv = UVR.Value(i).Y() - UVL.Value(i).Y();
2488 for (j=2; j<nb; j++) {
2489 double u = UVL.Value(i).X() + du*npb.Value(j);
2490 double v = UVL.Value(i).Y() + dv*npb.Value(j);
2491 gp_Pnt P = S->Value(u,v);
2492 SMDS_MeshNode* N = meshDS->AddNode(P.X(), P.Y(), P.Z());
2493 meshDS->SetNodeOnFace(N, geomFaceID, u, v);
2494 NodesC.SetValue(j,i+1,N);
2498 for (i=1; i<nb; i++) {
2499 for (j=1; j<nbv; j++) {
2501 myHelper->AddFace(NodesC.Value(i,j), NodesC.Value(i+1,j),
2502 NodesC.Value(i+1,j+1), NodesC.Value(i,j+1));
2503 if (F) meshDS->SetMeshElementOnShape(F, geomFaceID);
2507 } // end Multiple Reduce implementation
2508 else { // Simple Reduce (!MultipleReduce)
2509 //=========================================================
2512 // it is a base case => not shift quad
2513 //ShiftQuad(quad,0,true);
2516 // we have to shift quad on 2
2517 ShiftQuad(quad,2,true);
2522 // we have to shift quad on 1
2523 ShiftQuad(quad,1,true);
2526 // we have to shift quad on 3
2527 ShiftQuad(quad,3,true);
2531 nb = quad->side[0]->NbPoints();
2532 nr = quad->side[1]->NbPoints();
2533 nt = quad->side[2]->NbPoints();
2534 nl = quad->side[3]->NbPoints();
2536 // number of rows and columns
2537 int nrows = nr - 1; // and also == nl - 1
2538 int ncol_top = nt - 1;
2539 int ncol_bot = nb - 1;
2540 int npair_top = ncol_top / 2;
2541 // maximum number of bottom elements for "linear" simple reduce 4->2
2542 int max_lin = ncol_top + npair_top * 2 * nrows;
2543 // maximum number of bottom elements for "linear" simple reduce 4->2
2544 int max_lin31 = ncol_top + ncol_top * 2 * nrows;
2545 // maximum number of bottom elements for "tree" simple reduce 4->2
2547 // number of rows needed to reduce ncol_bot to ncol_top using simple 4->2 "tree"
2548 int nrows_tree42 = int( log( (double)(ncol_bot / ncol_top) )/log((double)2) ); // needed to avoid overflow at pow(2) while computing max_tree42
2549 if ( nrows_tree42 < nrows) {
2550 max_tree42 = npair_top * pow(2.0, nrows + 1);
2551 if (ncol_top > npair_top * 2 )
2553 int delta = ncol_bot - int( max_tree42 );
2554 for (int irow = 1; irow < nrows; irow++) {
2555 int nfour = delta / 4;
2558 if (delta <= (ncol_top - npair_top * 2))
2559 max_tree42 = ncol_bot;
2562 // maximum number of bottom elements for "tree" simple reduce 3->1
2563 //int max_tree31 = ncol_top * pow(3.0, nrows);
2564 bool is_lin_31 = false;
2565 bool is_lin_42 = false;
2566 bool is_tree_31 = false;
2567 bool is_tree_42 = false;
2568 if (ncol_bot > max_lin) {
2569 if (ncol_bot <= max_lin31) {
2571 max_lin = max_lin31;
2575 // if ncol_bot is a 3*n or not 2*n
2576 if ((ncol_bot/3)*3 == ncol_bot || (ncol_bot/2)*2 != ncol_bot) {
2578 max_lin = max_lin31;
2584 if (ncol_bot > max_lin) { // not "linear"
2585 is_tree_31 = (ncol_bot > max_tree42);
2586 if (ncol_bot <= max_tree42) {
2587 if ((ncol_bot/3)*3 == ncol_bot || (ncol_bot/2)*2 != ncol_bot) {
2596 const vector<UVPtStruct>& uv_eb = quad->side[0]->GetUVPtStruct(true,0);
2597 const vector<UVPtStruct>& uv_er = quad->side[1]->GetUVPtStruct(false,1);
2598 const vector<UVPtStruct>& uv_et = quad->side[2]->GetUVPtStruct(true,1);
2599 const vector<UVPtStruct>& uv_el = quad->side[3]->GetUVPtStruct(false,0);
2601 if (uv_eb.size() != nb || uv_er.size() != nr || uv_et.size() != nt || uv_el.size() != nl)
2602 return error(COMPERR_BAD_INPUT_MESH);
2604 // arrays for normalized params
2605 TColStd_SequenceOfReal npb, npr, npt, npl;
2606 for (j = 0; j < nb; j++) {
2607 npb.Append(uv_eb[j].normParam);
2609 for (i = 0; i < nr; i++) {
2610 npr.Append(uv_er[i].normParam);
2612 for (j = 0; j < nt; j++) {
2613 npt.Append(uv_et[j].normParam);
2615 for (i = 0; i < nl; i++) {
2616 npl.Append(uv_el[i].normParam);
2619 // We will ajust new points to this grid
2620 if (!SetNormalizedGrid(aMesh, aShape, quad))
2624 gp_XY a0 (uv_eb.front().u, uv_eb.front().v);
2625 gp_XY a1 (uv_eb.back().u, uv_eb.back().v);
2626 gp_XY a2 (uv_et.back().u, uv_et.back().v);
2627 gp_XY a3 (uv_et.front().u, uv_et.front().v);
2628 //=========================================================
2630 TColStd_SequenceOfInteger curr_base, next_base;
2631 TColStd_SequenceOfReal curr_par_u, curr_par_v;
2632 TColStd_SequenceOfReal next_par_u, next_par_v;
2633 StdMeshers_Array2OfNode NodesBRD (1,nb, 1,nr);
2634 for (j = 1; j <= nb; j++) {
2635 NodesBRD.SetValue(j, 1, uv_eb[j - 1].node); // bottom
2636 curr_base.Append(j);
2637 next_base.Append(-1);
2638 curr_par_u.Append(uv_eb[j-1].u);
2639 curr_par_v.Append(uv_eb[j-1].v);
2640 next_par_u.Append(0.);
2641 next_par_v.Append(0.);
2643 for (j = 1; j <= nt; j++) {
2644 NodesBRD.SetValue(j, nr, uv_et[j - 1].node); // top
2647 int curr_base_len = nb;
2648 int next_base_len = 0;
2651 // "tree" simple reduce "42": 2->4->8->16->32->...
2653 // .-------------------------------.-------------------------------. nr
2655 // | \ .---------------.---------------. / |
2657 // .---------------.---------------.---------------.---------------.
2658 // | \ | / | \ | / |
2659 // | \ .-------.-------. / | \ .-------.-------. / |
2660 // | | | | | | | | |
2661 // .-------.-------.-------.-------.-------.-------.-------.-------. i
2662 // |\ | /|\ | /|\ | /|\ | /|
2663 // | \.---.---./ | \.---.---./ | \.---.---./ | \.---.---./ |
2664 // | | | | | | | | | | | | | | | | |
2665 // .---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.
2666 // |\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|\ | /|
2667 // | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. | .-.-. |
2668 // | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
2669 // .-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-. 1
2672 for (i = 1; i < nr; i++) { // layer by layer
2674 NodesBRD.SetValue(1, i+1, uv_el[i].node);
2675 next_base.SetValue(++next_base_len, 1);
2677 NodesBRD.SetValue(nb, i+1, uv_er[i].node);
2679 next_par_u.SetValue(next_base_len, uv_el[i].u);
2680 next_par_v.SetValue(next_base_len, uv_el[i].v);
2682 // to stop reducing, if number of nodes reaches nt
2683 int delta = curr_base_len - nt;
2685 //double du = uv_er[i].u - uv_el[i].u;
2686 //double dv = uv_er[i].v - uv_el[i].v;
2688 // to calculate normalized parameter, we must know number of points in next layer
2689 int nb_four = (curr_base_len - 1) / 4;
2690 int nb_next = nb_four*2 + (curr_base_len - nb_four*4);
2691 if (nb_next < nt) nb_next = nt;
2693 for (j = 1; j + 4 <= curr_base_len && delta > 0; j += 4, delta -= 2) {
2694 // add one "HH": nodes a,b,c,d,e and faces 1,2,3,4,5,6
2696 // .-----a-----b i + 1
2709 const SMDS_MeshNode* Na;
2711 next_base.SetValue(next_base_len, curr_base.Value(j + 2));
2712 if (i + 1 == nr) { // top
2713 Na = uv_et[next_base_len - 1].node;
2714 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Na);
2715 u = uv_et[next_base_len - 1].u;
2716 v = uv_et[next_base_len - 1].v;
2719 //double norm_par = double(next_base_len - 1)/double(nb_next - 1);
2720 //u = uv_el[i].u + du * norm_par;
2721 //v = uv_el[i].v + dv * norm_par;
2723 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
2724 int nearest_node_j = (int)rel;
2725 rel -= nearest_node_j;
2726 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
2727 double u1 = quad->uv_grid[ij].u;
2728 double v1 = quad->uv_grid[ij].v;
2729 double u2 = quad->uv_grid[ij + 1].u;
2730 double v2 = quad->uv_grid[ij + 1].v;
2731 double duj = (u2 - u1) * rel;
2732 double dvj = (v2 - v1) * rel;
2736 //u = uv_el[i].u + du*npb.Value(curr_base.Value(j + 2));
2737 //v = uv_el[i].v + dv*npb.Value(curr_base.Value(j + 2));
2738 gp_Pnt P = S->Value(u,v);
2739 SMDS_MeshNode* Na1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
2740 meshDS->SetNodeOnFace(Na1, geomFaceID, u, v);
2741 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Na1);
2744 next_par_u.SetValue(next_base_len, u);
2745 next_par_v.SetValue(next_base_len, v);
2748 const SMDS_MeshNode* Nb;
2750 next_base.SetValue(next_base_len, curr_base.Value(j + 4));
2751 if (i + 1 == nr) { // top
2752 Nb = uv_et[next_base_len - 1].node;
2753 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nb);
2754 u = uv_et[next_base_len - 1].u;
2755 v = uv_et[next_base_len - 1].v;
2757 else if (j + 4 == curr_base_len) { // right
2758 Nb = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
2763 //double norm_par = double(next_base_len - 1)/double(nb_next - 1);
2764 //u = uv_el[i].u + du * norm_par;
2765 //v = uv_el[i].v + dv * norm_par;
2767 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
2768 int nearest_node_j = (int)rel;
2769 rel -= nearest_node_j;
2770 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
2771 double u1 = quad->uv_grid[ij].u;
2772 double v1 = quad->uv_grid[ij].v;
2773 double u2 = quad->uv_grid[ij + 1].u;
2774 double v2 = quad->uv_grid[ij + 1].v;
2775 double duj = (u2 - u1) * rel;
2776 double dvj = (v2 - v1) * rel;
2780 //u = uv_el[i].u + du*npb.Value(curr_base.Value(j + 4));
2781 //v = uv_el[i].v + dv*npb.Value(curr_base.Value(j + 4));
2782 gp_Pnt P = S->Value(u,v);
2783 SMDS_MeshNode* Nb1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
2784 meshDS->SetNodeOnFace(Nb1, geomFaceID, u, v);
2785 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nb1);
2788 next_par_u.SetValue(next_base_len, u);
2789 next_par_v.SetValue(next_base_len, v);
2792 u = (curr_par_u.Value(j + 2) + next_par_u.Value(next_base_len - 2)) / 2.0;
2793 v = (curr_par_v.Value(j + 2) + next_par_v.Value(next_base_len - 2)) / 2.0;
2794 gp_Pnt P = S->Value(u,v);
2795 SMDS_MeshNode* Nc = meshDS->AddNode(P.X(), P.Y(), P.Z());
2796 meshDS->SetNodeOnFace(Nc, geomFaceID, u, v);
2799 u = (curr_par_u.Value(j + 2) + next_par_u.Value(next_base_len - 1)) / 2.0;
2800 v = (curr_par_v.Value(j + 2) + next_par_v.Value(next_base_len - 1)) / 2.0;
2802 SMDS_MeshNode* Nd = meshDS->AddNode(P.X(), P.Y(), P.Z());
2803 meshDS->SetNodeOnFace(Nd, geomFaceID, u, v);
2806 u = (curr_par_u.Value(j + 2) + next_par_u.Value(next_base_len)) / 2.0;
2807 v = (curr_par_v.Value(j + 2) + next_par_v.Value(next_base_len)) / 2.0;
2809 SMDS_MeshNode* Ne = meshDS->AddNode(P.X(), P.Y(), P.Z());
2810 meshDS->SetNodeOnFace(Ne, geomFaceID, u, v);
2813 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 0), i),
2814 NodesBRD.Value(curr_base.Value(j + 1), i),
2816 NodesBRD.Value(next_base.Value(next_base_len - 2), i + 1));
2817 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
2819 SMDS_MeshFace* F2 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 1), i),
2820 NodesBRD.Value(curr_base.Value(j + 2), i),
2822 if (F2) meshDS->SetMeshElementOnShape(F2, geomFaceID);
2824 SMDS_MeshFace* F3 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 2), i),
2825 NodesBRD.Value(curr_base.Value(j + 3), i),
2827 if (F3) meshDS->SetMeshElementOnShape(F3, geomFaceID);
2829 SMDS_MeshFace* F4 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 3), i),
2830 NodesBRD.Value(curr_base.Value(j + 4), i),
2832 if (F4) meshDS->SetMeshElementOnShape(F4, geomFaceID);
2834 SMDS_MeshFace* F5 = myHelper->AddFace(Nc, Nd, Na,
2835 NodesBRD.Value(next_base.Value(next_base_len - 2), i + 1));
2836 if (F5) meshDS->SetMeshElementOnShape(F5, geomFaceID);
2838 SMDS_MeshFace* F6 = myHelper->AddFace(Nd, Ne, Nb, Na);
2839 if (F6) meshDS->SetMeshElementOnShape(F6, geomFaceID);
2842 // not reduced side elements (if any)
2843 for (; j < curr_base_len; j++) {
2845 const SMDS_MeshNode* Nf;
2847 next_base.SetValue(++next_base_len, curr_base.Value(j + 1));
2848 if (i + 1 == nr) { // top
2849 Nf = uv_et[next_base_len - 1].node;
2850 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf);
2851 u = uv_et[next_base_len - 1].u;
2852 v = uv_et[next_base_len - 1].v;
2854 else if (j + 1 == curr_base_len) { // right
2855 Nf = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
2860 //double norm_par = double(next_base_len - 1)/double(nb_next - 1);
2861 //u = uv_el[i].u + du * norm_par;
2862 //v = uv_el[i].v + dv * norm_par;
2864 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
2865 int nearest_node_j = (int)rel;
2866 rel -= nearest_node_j;
2867 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
2868 double u1 = quad->uv_grid[ij].u;
2869 double v1 = quad->uv_grid[ij].v;
2870 double u2 = quad->uv_grid[ij + 1].u;
2871 double v2 = quad->uv_grid[ij + 1].v;
2872 double duj = (u2 - u1) * rel;
2873 double dvj = (v2 - v1) * rel;
2877 //u = uv_el[i].u + du*npb.Value(curr_base.Value(j + 1));
2878 //v = uv_el[i].v + dv*npb.Value(curr_base.Value(j + 1));
2879 gp_Pnt P = S->Value(u,v);
2880 SMDS_MeshNode* Nf1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
2881 meshDS->SetNodeOnFace(Nf1, geomFaceID, u, v);
2882 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf1);
2885 next_par_u.SetValue(next_base_len, u);
2886 next_par_v.SetValue(next_base_len, v);
2887 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j), i),
2888 NodesBRD.Value(curr_base.Value(j + 1), i),
2889 NodesBRD.Value(next_base.Value(next_base_len), i + 1),
2890 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
2891 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
2894 curr_base_len = next_base_len;
2895 curr_base = next_base;
2896 curr_par_u = next_par_u;
2897 curr_par_v = next_par_v;
2900 } // end "tree" simple reduce "42"
2901 else if (is_tree_31) {
2902 // "tree" simple reduce "31": 1->3->9->27->...
2904 // .-----------------------------------------------------. nr
2906 // | .-----------------. |
2908 // .-----------------.-----------------.-----------------.
2909 // | \ / | \ / | \ / |
2910 // | .-----. | .-----. | .-----. | i
2911 // | | | | | | | | | |
2912 // .-----.-----.-----.-----.-----.-----.-----.-----.-----.
2913 // |\ /|\ /|\ /|\ /|\ /|\ /|\ /|\ /|\ /|
2914 // | .-. | .-. | .-. | .-. | .-. | .-. | .-. | .-. | .-. |
2915 // | | | | | | | | | | | | | | | | | | | | | | | | | | | |
2916 // .-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-. 1
2919 for (i = 1; i < nr; i++) { // layer by layer
2921 NodesBRD.SetValue(1, i+1, uv_el[i].node);
2922 next_base.SetValue(++next_base_len, 1);
2924 NodesBRD.SetValue(nb, i+1, uv_er[i].node);
2926 next_par_u.SetValue(next_base_len, uv_el[i].u);
2927 next_par_v.SetValue(next_base_len, uv_el[i].v);
2929 // to stop reducing, if number of nodes reaches nt
2930 int delta = curr_base_len - nt;
2932 // to calculate normalized parameter, we must know number of points in next layer
2933 int nb_three = (curr_base_len - 1) / 3;
2934 int nb_next = nb_three + (curr_base_len - nb_three*3);
2935 if (nb_next < nt) nb_next = nt;
2937 for (j = 1; j + 3 <= curr_base_len && delta > 0; j += 3, delta -= 2) {
2938 // add one "H": nodes b,c,e and faces 1,2,4,5
2940 // .---------b i + 1
2953 const SMDS_MeshNode* Nb;
2955 next_base.SetValue(next_base_len, curr_base.Value(j + 3));
2956 if (i + 1 == nr) { // top
2957 Nb = uv_et[next_base_len - 1].node;
2958 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nb);
2959 u = uv_et[next_base_len - 1].u;
2960 v = uv_et[next_base_len - 1].v;
2962 else if (j + 3 == curr_base_len) { // right
2963 Nb = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
2969 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
2970 int nearest_node_j = (int)rel;
2971 rel -= nearest_node_j;
2972 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
2973 double u1 = quad->uv_grid[ij].u;
2974 double v1 = quad->uv_grid[ij].v;
2975 double u2 = quad->uv_grid[ij + 1].u;
2976 double v2 = quad->uv_grid[ij + 1].v;
2977 double duj = (u2 - u1) * rel;
2978 double dvj = (v2 - v1) * rel;
2982 gp_Pnt P = S->Value(u,v);
2983 SMDS_MeshNode* Nb1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
2984 meshDS->SetNodeOnFace(Nb1, geomFaceID, u, v);
2985 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nb1);
2988 next_par_u.SetValue(next_base_len, u);
2989 next_par_v.SetValue(next_base_len, v);
2992 double u1 = (curr_par_u.Value(j) + next_par_u.Value(next_base_len - 1)) / 2.0;
2993 double u2 = (curr_par_u.Value(j + 3) + next_par_u.Value(next_base_len)) / 2.0;
2994 double u3 = (u2 - u1) / 3.0;
2996 double v1 = (curr_par_v.Value(j) + next_par_v.Value(next_base_len - 1)) / 2.0;
2997 double v2 = (curr_par_v.Value(j + 3) + next_par_v.Value(next_base_len)) / 2.0;
2998 double v3 = (v2 - v1) / 3.0;
3003 gp_Pnt P = S->Value(u,v);
3004 SMDS_MeshNode* Nc = meshDS->AddNode(P.X(), P.Y(), P.Z());
3005 meshDS->SetNodeOnFace(Nc, geomFaceID, u, v);
3011 SMDS_MeshNode* Ne = meshDS->AddNode(P.X(), P.Y(), P.Z());
3012 meshDS->SetNodeOnFace(Ne, geomFaceID, u, v);
3015 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 0), i),
3016 NodesBRD.Value(curr_base.Value(j + 1), i),
3018 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3019 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3021 SMDS_MeshFace* F2 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 1), i),
3022 NodesBRD.Value(curr_base.Value(j + 2), i),
3024 if (F2) meshDS->SetMeshElementOnShape(F2, geomFaceID);
3026 SMDS_MeshFace* F4 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 2), i),
3027 NodesBRD.Value(curr_base.Value(j + 3), i),
3029 if (F4) meshDS->SetMeshElementOnShape(F4, geomFaceID);
3031 SMDS_MeshFace* F5 = myHelper->AddFace(Nc, Ne, Nb,
3032 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3033 if (F5) meshDS->SetMeshElementOnShape(F5, geomFaceID);
3036 // not reduced side elements (if any)
3037 for (; j < curr_base_len; j++) {
3039 const SMDS_MeshNode* Nf;
3041 next_base.SetValue(++next_base_len, curr_base.Value(j + 1));
3042 if (i + 1 == nr) { // top
3043 Nf = uv_et[next_base_len - 1].node;
3044 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf);
3045 u = uv_et[next_base_len - 1].u;
3046 v = uv_et[next_base_len - 1].v;
3048 else if (j + 1 == curr_base_len) { // right
3049 Nf = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
3055 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3056 int nearest_node_j = (int)rel;
3057 rel -= nearest_node_j;
3058 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3059 double u1 = quad->uv_grid[ij].u;
3060 double v1 = quad->uv_grid[ij].v;
3061 double u2 = quad->uv_grid[ij + 1].u;
3062 double v2 = quad->uv_grid[ij + 1].v;
3063 double duj = (u2 - u1) * rel;
3064 double dvj = (v2 - v1) * rel;
3068 gp_Pnt P = S->Value(u,v);
3069 SMDS_MeshNode* Nf1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3070 meshDS->SetNodeOnFace(Nf1, geomFaceID, u, v);
3071 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf1);
3074 next_par_u.SetValue(next_base_len, u);
3075 next_par_v.SetValue(next_base_len, v);
3076 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j), i),
3077 NodesBRD.Value(curr_base.Value(j + 1), i),
3078 NodesBRD.Value(next_base.Value(next_base_len), i + 1),
3079 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3080 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3083 curr_base_len = next_base_len;
3084 curr_base = next_base;
3085 curr_par_u = next_par_u;
3086 curr_par_v = next_par_v;
3089 } // end "tree" simple reduce "31"
3090 else if (is_lin_42) {
3091 // "linear" simple reduce "42": 4->8->12->16
3093 // .---------------.---------------.---------------.---------------. nr
3094 // | \ | / | \ | / |
3095 // | \ .-------.-------. / | \ .-------.-------. / |
3096 // | | | | | | | | |
3097 // .-------.-------.-------.-------.-------.-------.-------.-------.
3098 // | / \ | / \ | / \ | / \ |
3099 // | / \.----.----./ \ | / \.----.----./ \ | i
3100 // | / | | | \ | / | | | \ |
3101 // .-----.----.----.----.----.-----.-----.----.----.----.----.-----.
3102 // | / / \ | / \ \ | / / \ | / \ \ |
3103 // | / / .-.-. \ \ | / / .-.-. \ \ |
3104 // | / / / | \ \ \ | / / / | \ \ \ |
3105 // .---.---.---.---.---.---.---.---.---.---.---.---.---.---.---.---. 1
3108 // nt = 5, nb = 7, nr = 4
3109 //int delta_all = 2;
3110 //int delta_one_col = 6;
3112 //int remainder = 2;
3113 //if (remainder > 0) nb_col++;
3115 //int free_left = 1;
3117 //int free_middle = 4;
3119 int delta_all = nb - nt;
3120 int delta_one_col = (nr - 1) * 2;
3121 int nb_col = delta_all / delta_one_col;
3122 int remainder = delta_all - nb_col * delta_one_col;
3123 if (remainder > 0) {
3126 int free_left = ((nt - 1) - nb_col * 2) / 2;
3127 free_left += nr - 2;
3128 int free_middle = (nr - 2) * 2;
3129 if (remainder > 0 && nb_col == 1) {
3130 int nb_rows_short_col = remainder / 2;
3131 int nb_rows_thrown = (nr - 1) - nb_rows_short_col;
3132 free_left -= nb_rows_thrown;
3135 // nt = 5, nb = 17, nr = 4
3136 //int delta_all = 12;
3137 //int delta_one_col = 6;
3139 //int remainder = 0;
3140 //int free_left = 2;
3141 //int free_middle = 4;
3143 for (i = 1; i < nr; i++, free_middle -= 2, free_left -= 1) { // layer by layer
3145 NodesBRD.SetValue(1, i+1, uv_el[i].node);
3146 next_base.SetValue(++next_base_len, 1);
3148 NodesBRD.SetValue(nb, i+1, uv_er[i].node);
3151 next_par_u.SetValue(next_base_len, uv_el[i].u);
3152 next_par_v.SetValue(next_base_len, uv_el[i].v);
3154 // to calculate normalized parameter, we must know number of points in next layer
3155 int nb_next = curr_base_len - nb_col * 2;
3156 if (remainder > 0 && i > remainder / 2)
3157 // take into account short "column"
3159 if (nb_next < nt) nb_next = nt;
3161 // not reduced left elements
3162 for (j = 1; j <= free_left; j++) {
3164 const SMDS_MeshNode* Nf;
3166 next_base.SetValue(++next_base_len, curr_base.Value(j + 1));
3167 if (i + 1 == nr) { // top
3168 Nf = uv_et[next_base_len - 1].node;
3169 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf);
3170 u = uv_et[next_base_len - 1].u;
3171 v = uv_et[next_base_len - 1].v;
3175 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3176 int nearest_node_j = (int)rel;
3177 rel -= nearest_node_j;
3178 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3179 double u1 = quad->uv_grid[ij].u;
3180 double v1 = quad->uv_grid[ij].v;
3181 double u2 = quad->uv_grid[ij + 1].u;
3182 double v2 = quad->uv_grid[ij + 1].v;
3183 double duj = (u2 - u1) * rel;
3184 double dvj = (v2 - v1) * rel;
3188 gp_Pnt P = S->Value(u,v);
3189 SMDS_MeshNode* Nf1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3190 meshDS->SetNodeOnFace(Nf1, geomFaceID, u, v);
3191 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf1);
3194 next_par_u.SetValue(next_base_len, u);
3195 next_par_v.SetValue(next_base_len, v);
3196 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j), i),
3197 NodesBRD.Value(curr_base.Value(j + 1), i),
3198 NodesBRD.Value(next_base.Value(next_base_len), i + 1),
3199 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3200 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3203 for (int icol = 1; icol <= nb_col; icol++) {
3205 if (remainder > 0 && icol == nb_col && i > remainder / 2)
3206 // stop short "column"
3209 // add one "HH": nodes a,b,c,d,e and faces 1,2,3,4,5,6
3211 // .-----a-----b i + 1
3224 const SMDS_MeshNode* Na;
3226 next_base.SetValue(next_base_len, curr_base.Value(j + 2));
3227 if (i + 1 == nr) { // top
3228 Na = uv_et[next_base_len - 1].node;
3229 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Na);
3230 u = uv_et[next_base_len - 1].u;
3231 v = uv_et[next_base_len - 1].v;
3235 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3236 int nearest_node_j = (int)rel;
3237 rel -= nearest_node_j;
3238 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3239 double u1 = quad->uv_grid[ij].u;
3240 double v1 = quad->uv_grid[ij].v;
3241 double u2 = quad->uv_grid[ij + 1].u;
3242 double v2 = quad->uv_grid[ij + 1].v;
3243 double duj = (u2 - u1) * rel;
3244 double dvj = (v2 - v1) * rel;
3248 gp_Pnt P = S->Value(u,v);
3249 SMDS_MeshNode* Na1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3250 meshDS->SetNodeOnFace(Na1, geomFaceID, u, v);
3251 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Na1);
3254 next_par_u.SetValue(next_base_len, u);
3255 next_par_v.SetValue(next_base_len, v);
3258 const SMDS_MeshNode* Nb;
3260 next_base.SetValue(next_base_len, curr_base.Value(j + 4));
3261 if (i + 1 == nr) { // top
3262 Nb = uv_et[next_base_len - 1].node;
3263 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nb);
3264 u = uv_et[next_base_len - 1].u;
3265 v = uv_et[next_base_len - 1].v;
3267 else if (j + 4 == curr_base_len) { // right
3268 Nb = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
3274 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3275 int nearest_node_j = (int)rel;
3276 rel -= nearest_node_j;
3277 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3278 double u1 = quad->uv_grid[ij].u;
3279 double v1 = quad->uv_grid[ij].v;
3280 double u2 = quad->uv_grid[ij + 1].u;
3281 double v2 = quad->uv_grid[ij + 1].v;
3282 double duj = (u2 - u1) * rel;
3283 double dvj = (v2 - v1) * rel;
3287 gp_Pnt P = S->Value(u,v);
3288 SMDS_MeshNode* Nb1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3289 meshDS->SetNodeOnFace(Nb1, geomFaceID, u, v);
3290 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nb1);
3293 next_par_u.SetValue(next_base_len, u);
3294 next_par_v.SetValue(next_base_len, v);
3297 u = (curr_par_u.Value(j + 2) + next_par_u.Value(next_base_len - 2)) / 2.0;
3298 v = (curr_par_v.Value(j + 2) + next_par_v.Value(next_base_len - 2)) / 2.0;
3299 gp_Pnt P = S->Value(u,v);
3300 SMDS_MeshNode* Nc = meshDS->AddNode(P.X(), P.Y(), P.Z());
3301 meshDS->SetNodeOnFace(Nc, geomFaceID, u, v);
3304 u = (curr_par_u.Value(j + 2) + next_par_u.Value(next_base_len - 1)) / 2.0;
3305 v = (curr_par_v.Value(j + 2) + next_par_v.Value(next_base_len - 1)) / 2.0;
3307 SMDS_MeshNode* Nd = meshDS->AddNode(P.X(), P.Y(), P.Z());
3308 meshDS->SetNodeOnFace(Nd, geomFaceID, u, v);
3311 u = (curr_par_u.Value(j + 2) + next_par_u.Value(next_base_len)) / 2.0;
3312 v = (curr_par_v.Value(j + 2) + next_par_v.Value(next_base_len)) / 2.0;
3314 SMDS_MeshNode* Ne = meshDS->AddNode(P.X(), P.Y(), P.Z());
3315 meshDS->SetNodeOnFace(Ne, geomFaceID, u, v);
3318 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 0), i),
3319 NodesBRD.Value(curr_base.Value(j + 1), i),
3321 NodesBRD.Value(next_base.Value(next_base_len - 2), i + 1));
3322 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3324 SMDS_MeshFace* F2 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 1), i),
3325 NodesBRD.Value(curr_base.Value(j + 2), i),
3327 if (F2) meshDS->SetMeshElementOnShape(F2, geomFaceID);
3329 SMDS_MeshFace* F3 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 2), i),
3330 NodesBRD.Value(curr_base.Value(j + 3), i),
3332 if (F3) meshDS->SetMeshElementOnShape(F3, geomFaceID);
3334 SMDS_MeshFace* F4 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 3), i),
3335 NodesBRD.Value(curr_base.Value(j + 4), i),
3337 if (F4) meshDS->SetMeshElementOnShape(F4, geomFaceID);
3339 SMDS_MeshFace* F5 = myHelper->AddFace(Nc, Nd, Na,
3340 NodesBRD.Value(next_base.Value(next_base_len - 2), i + 1));
3341 if (F5) meshDS->SetMeshElementOnShape(F5, geomFaceID);
3343 SMDS_MeshFace* F6 = myHelper->AddFace(Nd, Ne, Nb, Na);
3344 if (F6) meshDS->SetMeshElementOnShape(F6, geomFaceID);
3348 // not reduced middle elements
3349 if (icol < nb_col) {
3350 if (remainder > 0 && icol == nb_col - 1 && i > remainder / 2)
3351 // pass middle elements before stopped short "column"
3354 int free_add = free_middle;
3355 if (remainder > 0 && icol == nb_col - 1)
3356 // next "column" is short
3357 free_add -= (nr - 1) - (remainder / 2);
3359 for (int imiddle = 1; imiddle <= free_add; imiddle++) {
3360 // f (i + 1, j + imiddle)
3361 const SMDS_MeshNode* Nf;
3363 next_base.SetValue(++next_base_len, curr_base.Value(j + imiddle));
3364 if (i + 1 == nr) { // top
3365 Nf = uv_et[next_base_len - 1].node;
3366 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf);
3367 u = uv_et[next_base_len - 1].u;
3368 v = uv_et[next_base_len - 1].v;
3370 else if (j + imiddle == curr_base_len) { // right
3371 Nf = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
3377 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3378 int nearest_node_j = (int)rel;
3379 rel -= nearest_node_j;
3380 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3381 double u1 = quad->uv_grid[ij].u;
3382 double v1 = quad->uv_grid[ij].v;
3383 double u2 = quad->uv_grid[ij + 1].u;
3384 double v2 = quad->uv_grid[ij + 1].v;
3385 double duj = (u2 - u1) * rel;
3386 double dvj = (v2 - v1) * rel;
3390 gp_Pnt P = S->Value(u,v);
3391 SMDS_MeshNode* Nf1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3392 meshDS->SetNodeOnFace(Nf1, geomFaceID, u, v);
3393 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf1);
3396 next_par_u.SetValue(next_base_len, u);
3397 next_par_v.SetValue(next_base_len, v);
3398 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j - 1 + imiddle), i),
3399 NodesBRD.Value(curr_base.Value(j + imiddle), i),
3400 NodesBRD.Value(next_base.Value(next_base_len), i + 1),
3401 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3402 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3408 // not reduced right elements
3409 for (; j < curr_base_len; j++) {
3411 const SMDS_MeshNode* Nf;
3413 next_base.SetValue(++next_base_len, curr_base.Value(j + 1));
3414 if (i + 1 == nr) { // top
3415 Nf = uv_et[next_base_len - 1].node;
3416 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf);
3417 u = uv_et[next_base_len - 1].u;
3418 v = uv_et[next_base_len - 1].v;
3420 else if (j + 1 == curr_base_len) { // right
3421 Nf = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
3427 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3428 int nearest_node_j = (int)rel;
3429 rel -= nearest_node_j;
3430 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3431 double u1 = quad->uv_grid[ij].u;
3432 double v1 = quad->uv_grid[ij].v;
3433 double u2 = quad->uv_grid[ij + 1].u;
3434 double v2 = quad->uv_grid[ij + 1].v;
3435 double duj = (u2 - u1) * rel;
3436 double dvj = (v2 - v1) * rel;
3440 gp_Pnt P = S->Value(u,v);
3441 SMDS_MeshNode* Nf1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3442 meshDS->SetNodeOnFace(Nf1, geomFaceID, u, v);
3443 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf1);
3446 next_par_u.SetValue(next_base_len, u);
3447 next_par_v.SetValue(next_base_len, v);
3448 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j), i),
3449 NodesBRD.Value(curr_base.Value(j + 1), i),
3450 NodesBRD.Value(next_base.Value(next_base_len), i + 1),
3451 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3452 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3455 curr_base_len = next_base_len;
3456 curr_base = next_base;
3457 curr_par_u = next_par_u;
3458 curr_par_v = next_par_v;
3461 } // end "linear" simple reduce "42"
3462 else if (is_lin_31) {
3463 // "linear" simple reduce "31": 2->6->10->14
3465 // .-----------------------------.-----------------------------. nr
3467 // | .---------. | .---------. |
3469 // .---------.---------.---------.---------.---------.---------.
3470 // | / \ / \ | / \ / \ |
3471 // | / .-----. \ | / .-----. \ | i
3472 // | / | | \ | / | | \ |
3473 // .-----.-----.-----.-----.-----.-----.-----.-----.-----.-----.
3474 // | / / \ / \ \ | / / \ / \ \ |
3475 // | / / .-. \ \ | / / .-. \ \ |
3476 // | / / / \ \ \ | / / / \ \ \ |
3477 // .--.----.---.-----.---.-----.-.--.----.---.-----.---.-----.-. 1
3480 int delta_all = nb - nt;
3481 int delta_one_col = (nr - 1) * 2;
3482 int nb_col = delta_all / delta_one_col;
3483 int remainder = delta_all - nb_col * delta_one_col;
3484 if (remainder > 0) {
3487 int free_left = ((nt - 1) - nb_col) / 2;
3488 free_left += nr - 2;
3489 int free_middle = (nr - 2) * 2;
3490 if (remainder > 0 && nb_col == 1) {
3491 int nb_rows_short_col = remainder / 2;
3492 int nb_rows_thrown = (nr - 1) - nb_rows_short_col;
3493 free_left -= nb_rows_thrown;
3496 for (i = 1; i < nr; i++, free_middle -= 2, free_left -= 1) { // layer by layer
3498 NodesBRD.SetValue(1, i+1, uv_el[i].node);
3499 next_base.SetValue(++next_base_len, 1);
3501 NodesBRD.SetValue(nb, i+1, uv_er[i].node);
3504 next_par_u.SetValue(next_base_len, uv_el[i].u);
3505 next_par_v.SetValue(next_base_len, uv_el[i].v);
3507 // to calculate normalized parameter, we must know number of points in next layer
3508 int nb_next = curr_base_len - nb_col * 2;
3509 if (remainder > 0 && i > remainder / 2)
3510 // take into account short "column"
3512 if (nb_next < nt) nb_next = nt;
3514 // not reduced left elements
3515 for (j = 1; j <= free_left; j++) {
3517 const SMDS_MeshNode* Nf;
3519 next_base.SetValue(++next_base_len, curr_base.Value(j + 1));
3520 if (i + 1 == nr) { // top
3521 Nf = uv_et[next_base_len - 1].node;
3522 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf);
3523 u = uv_et[next_base_len - 1].u;
3524 v = uv_et[next_base_len - 1].v;
3528 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3529 int nearest_node_j = (int)rel;
3530 rel -= nearest_node_j;
3531 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3532 double u1 = quad->uv_grid[ij].u;
3533 double v1 = quad->uv_grid[ij].v;
3534 double u2 = quad->uv_grid[ij + 1].u;
3535 double v2 = quad->uv_grid[ij + 1].v;
3536 double duj = (u2 - u1) * rel;
3537 double dvj = (v2 - v1) * rel;
3541 gp_Pnt P = S->Value(u,v);
3542 SMDS_MeshNode* Nf1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3543 meshDS->SetNodeOnFace(Nf1, geomFaceID, u, v);
3544 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf1);
3547 next_par_u.SetValue(next_base_len, u);
3548 next_par_v.SetValue(next_base_len, v);
3549 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j), i),
3550 NodesBRD.Value(curr_base.Value(j + 1), i),
3551 NodesBRD.Value(next_base.Value(next_base_len), i + 1),
3552 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3553 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3556 for (int icol = 1; icol <= nb_col; icol++) {
3558 if (remainder > 0 && icol == nb_col && i > remainder / 2)
3559 // stop short "column"
3562 // add one "H": nodes b,c,e and faces 1,2,4,5
3564 // .---------b i + 1
3577 const SMDS_MeshNode* Nb;
3579 next_base.SetValue(next_base_len, curr_base.Value(j + 3));
3580 if (i + 1 == nr) { // top
3581 Nb = uv_et[next_base_len - 1].node;
3582 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nb);
3583 u = uv_et[next_base_len - 1].u;
3584 v = uv_et[next_base_len - 1].v;
3586 else if (j + 3 == curr_base_len) { // right
3587 Nb = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
3593 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3594 int nearest_node_j = (int)rel;
3595 rel -= nearest_node_j;
3596 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3597 double u1 = quad->uv_grid[ij].u;
3598 double v1 = quad->uv_grid[ij].v;
3599 double u2 = quad->uv_grid[ij + 1].u;
3600 double v2 = quad->uv_grid[ij + 1].v;
3601 double duj = (u2 - u1) * rel;
3602 double dvj = (v2 - v1) * rel;
3606 gp_Pnt P = S->Value(u,v);
3607 SMDS_MeshNode* Nb1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3608 meshDS->SetNodeOnFace(Nb1, geomFaceID, u, v);
3609 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nb1);
3612 next_par_u.SetValue(next_base_len, u);
3613 next_par_v.SetValue(next_base_len, v);
3616 double u1 = (curr_par_u.Value(j) + next_par_u.Value(next_base_len - 1)) / 2.0;
3617 double u2 = (curr_par_u.Value(j + 3) + next_par_u.Value(next_base_len)) / 2.0;
3618 double u3 = (u2 - u1) / 3.0;
3620 double v1 = (curr_par_v.Value(j) + next_par_v.Value(next_base_len - 1)) / 2.0;
3621 double v2 = (curr_par_v.Value(j + 3) + next_par_v.Value(next_base_len)) / 2.0;
3622 double v3 = (v2 - v1) / 3.0;
3627 gp_Pnt P = S->Value(u,v);
3628 SMDS_MeshNode* Nc = meshDS->AddNode(P.X(), P.Y(), P.Z());
3629 meshDS->SetNodeOnFace(Nc, geomFaceID, u, v);
3635 SMDS_MeshNode* Ne = meshDS->AddNode(P.X(), P.Y(), P.Z());
3636 meshDS->SetNodeOnFace(Ne, geomFaceID, u, v);
3639 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 0), i),
3640 NodesBRD.Value(curr_base.Value(j + 1), i),
3642 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3643 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3645 SMDS_MeshFace* F2 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 1), i),
3646 NodesBRD.Value(curr_base.Value(j + 2), i),
3648 if (F2) meshDS->SetMeshElementOnShape(F2, geomFaceID);
3650 SMDS_MeshFace* F4 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j + 2), i),
3651 NodesBRD.Value(curr_base.Value(j + 3), i),
3653 if (F4) meshDS->SetMeshElementOnShape(F4, geomFaceID);
3655 SMDS_MeshFace* F5 = myHelper->AddFace(Nc, Ne, Nb,
3656 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3657 if (F5) meshDS->SetMeshElementOnShape(F5, geomFaceID);
3661 // not reduced middle elements
3662 if (icol < nb_col) {
3663 if (remainder > 0 && icol == nb_col - 1 && i > remainder / 2)
3664 // pass middle elements before stopped short "column"
3667 int free_add = free_middle;
3668 if (remainder > 0 && icol == nb_col - 1)
3669 // next "column" is short
3670 free_add -= (nr - 1) - (remainder / 2);
3672 for (int imiddle = 1; imiddle <= free_add; imiddle++) {
3673 // f (i + 1, j + imiddle)
3674 const SMDS_MeshNode* Nf;
3676 next_base.SetValue(++next_base_len, curr_base.Value(j + imiddle));
3677 if (i + 1 == nr) { // top
3678 Nf = uv_et[next_base_len - 1].node;
3679 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf);
3680 u = uv_et[next_base_len - 1].u;
3681 v = uv_et[next_base_len - 1].v;
3683 else if (j + imiddle == curr_base_len) { // right
3684 Nf = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
3690 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3691 int nearest_node_j = (int)rel;
3692 rel -= nearest_node_j;
3693 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3694 double u1 = quad->uv_grid[ij].u;
3695 double v1 = quad->uv_grid[ij].v;
3696 double u2 = quad->uv_grid[ij + 1].u;
3697 double v2 = quad->uv_grid[ij + 1].v;
3698 double duj = (u2 - u1) * rel;
3699 double dvj = (v2 - v1) * rel;
3703 gp_Pnt P = S->Value(u,v);
3704 SMDS_MeshNode* Nf1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3705 meshDS->SetNodeOnFace(Nf1, geomFaceID, u, v);
3706 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf1);
3709 next_par_u.SetValue(next_base_len, u);
3710 next_par_v.SetValue(next_base_len, v);
3711 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j - 1 + imiddle), i),
3712 NodesBRD.Value(curr_base.Value(j + imiddle), i),
3713 NodesBRD.Value(next_base.Value(next_base_len), i + 1),
3714 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3715 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3721 // not reduced right elements
3722 for (; j < curr_base_len; j++) {
3724 const SMDS_MeshNode* Nf;
3726 next_base.SetValue(++next_base_len, curr_base.Value(j + 1));
3727 if (i + 1 == nr) { // top
3728 Nf = uv_et[next_base_len - 1].node;
3729 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf);
3730 u = uv_et[next_base_len - 1].u;
3731 v = uv_et[next_base_len - 1].v;
3733 else if (j + 1 == curr_base_len) { // right
3734 Nf = NodesBRD.Value(next_base.Value(next_base_len), i + 1);
3740 double rel = double(next_base_len - 1) * double(nt - 1) / double(nb_next - 1) + 1;
3741 int nearest_node_j = (int)rel;
3742 rel -= nearest_node_j;
3743 int ij = (i + 1 - 1) * nt + (nearest_node_j - 1);
3744 double u1 = quad->uv_grid[ij].u;
3745 double v1 = quad->uv_grid[ij].v;
3746 double u2 = quad->uv_grid[ij + 1].u;
3747 double v2 = quad->uv_grid[ij + 1].v;
3748 double duj = (u2 - u1) * rel;
3749 double dvj = (v2 - v1) * rel;
3753 gp_Pnt P = S->Value(u,v);
3754 SMDS_MeshNode* Nf1 = meshDS->AddNode(P.X(), P.Y(), P.Z());
3755 meshDS->SetNodeOnFace(Nf1, geomFaceID, u, v);
3756 NodesBRD.SetValue(next_base.Value(next_base_len), i + 1, Nf1);
3759 next_par_u.SetValue(next_base_len, u);
3760 next_par_v.SetValue(next_base_len, v);
3761 SMDS_MeshFace* F1 = myHelper->AddFace(NodesBRD.Value(curr_base.Value(j), i),
3762 NodesBRD.Value(curr_base.Value(j + 1), i),
3763 NodesBRD.Value(next_base.Value(next_base_len), i + 1),
3764 NodesBRD.Value(next_base.Value(next_base_len - 1), i + 1));
3765 if (F1) meshDS->SetMeshElementOnShape(F1, geomFaceID);
3768 curr_base_len = next_base_len;
3769 curr_base = next_base;
3770 curr_par_u = next_par_u;
3771 curr_par_v = next_par_v;
3774 } // end "linear" simple reduce "31"
3777 } // end Simple Reduce implementation
3783 //================================================================================
3784 namespace // data for smoothing
3787 // --------------------------------------------------------------------------------
3789 * \brief Structure used to check validity of node position after smoothing.
3790 * It holds two nodes connected to a smoothed node and belonging to
3797 TTriangle( TSmoothNode* n1=0, TSmoothNode* n2=0 ): _n1(n1), _n2(n2) {}
3799 inline bool IsForward( gp_UV uv ) const;
3801 // --------------------------------------------------------------------------------
3803 * \brief Data of a smoothed node
3808 vector< TTriangle > _triangles; // if empty, then node is not movable
3810 // --------------------------------------------------------------------------------
3811 inline bool TTriangle::IsForward( gp_UV uv ) const
3813 gp_Vec2d v1( uv, _n1->_uv ), v2( uv, _n2->_uv );
3819 //================================================================================
3821 * \brief Set UV of nodes on degenerated VERTEXes in the middle of degenerated EDGE
3823 * WARNING: this method must be called AFTER retrieving UVPtStruct's from quad
3825 //================================================================================
3827 void StdMeshers_Quadrangle_2D::UpdateDegenUV(FaceQuadStruct* quad)
3829 for ( unsigned i = 0; i < quad->side.size(); ++i )
3831 StdMeshers_FaceSide* side = quad->side[i];
3832 const vector<UVPtStruct>& uvVec = side->GetUVPtStruct();
3834 // find which end of the side is on degenerated shape
3836 if ( myHelper->IsDegenShape( uvVec[0].node->getshapeId() ))
3838 else if ( myHelper->IsDegenShape( uvVec.back().node->getshapeId() ))
3839 degenInd = uvVec.size() - 1;
3843 // find another side sharing the degenerated shape
3844 bool isPrev = ( degenInd == 0 );
3845 if ( i >= TOP_SIDE )
3847 int i2 = ( isPrev ? ( i + 3 ) : ( i + 1 )) % 4;
3848 StdMeshers_FaceSide* side2 = quad->side[ i2 ];
3849 const vector<UVPtStruct>& uvVec2 = side2->GetUVPtStruct();
3851 if ( uvVec[ degenInd ].node == uvVec2[0].node )
3853 else if ( uvVec[ degenInd ].node == uvVec2.back().node )
3854 degenInd2 = uvVec2.size() - 1;
3856 throw SALOME_Exception( LOCALIZED( "Logical error" ));
3858 // move UV in the middle
3859 uvPtStruct& uv1 = const_cast<uvPtStruct&>( uvVec [ degenInd ]);
3860 uvPtStruct& uv2 = const_cast<uvPtStruct&>( uvVec2[ degenInd2 ]);
3861 uv1.u = uv2.u = 0.5 * ( uv1.u + uv2.u );
3862 uv1.v = uv2.v = 0.5 * ( uv1.v + uv2.v );
3866 //================================================================================
3868 * \brief Perform smoothing of 2D elements on a FACE with ignored degenerated EDGE
3870 //================================================================================
3872 void StdMeshers_Quadrangle_2D::Smooth (FaceQuadStruct* quad)
3874 if ( !myNeedSmooth ) return;
3876 // Get nodes to smooth
3878 typedef map< const SMDS_MeshNode*, TSmoothNode, TIDCompare > TNo2SmooNoMap;
3879 TNo2SmooNoMap smooNoMap;
3881 const TopoDS_Face& geomFace = TopoDS::Face( myHelper->GetSubShape() );
3882 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
3883 SMESHDS_SubMesh* fSubMesh = meshDS->MeshElements( geomFace );
3884 SMDS_NodeIteratorPtr nIt = fSubMesh->GetNodes();
3885 while ( nIt->more() ) // loop on nodes bound to a FACE
3887 const SMDS_MeshNode* node = nIt->next();
3888 TSmoothNode & sNode = smooNoMap[ node ];
3889 sNode._uv = myHelper->GetNodeUV( geomFace, node );
3891 // set sNode._triangles
3892 SMDS_ElemIteratorPtr fIt = node->GetInverseElementIterator( SMDSAbs_Face );
3893 while ( fIt->more() )
3895 const SMDS_MeshElement* face = fIt->next();
3896 const int nbN = face->NbCornerNodes();
3897 const int nInd = face->GetNodeIndex( node );
3898 const int prevInd = myHelper->WrapIndex( nInd - 1, nbN );
3899 const int nextInd = myHelper->WrapIndex( nInd + 1, nbN );
3900 const SMDS_MeshNode* prevNode = face->GetNode( prevInd );
3901 const SMDS_MeshNode* nextNode = face->GetNode( nextInd );
3902 sNode._triangles.push_back( TTriangle( & smooNoMap[ prevNode ],
3903 & smooNoMap[ nextNode ]));
3906 // set _uv of smooth nodes on FACE boundary
3907 for ( unsigned i = 0; i < quad->side.size(); ++i )
3909 const vector<UVPtStruct>& uvVec = quad->side[i]->GetUVPtStruct();
3910 for ( unsigned j = 0; j < uvVec.size(); ++j )
3912 TSmoothNode & sNode = smooNoMap[ uvVec[j].node ];
3913 sNode._uv.SetCoord( uvVec[j].u, uvVec[j].v );
3917 // define refernce orientation in 2D
3918 TNo2SmooNoMap::iterator n2sn = smooNoMap.begin();
3919 for ( ; n2sn != smooNoMap.end(); ++n2sn )
3920 if ( !n2sn->second._triangles.empty() )
3922 if ( n2sn == smooNoMap.end() ) return;
3923 const TSmoothNode & sampleNode = n2sn->second;
3924 const bool refForward = ( sampleNode._triangles[0].IsForward( sampleNode._uv ));
3928 for ( int iLoop = 0; iLoop < 5; ++iLoop )
3930 for ( n2sn = smooNoMap.begin(); n2sn != smooNoMap.end(); ++n2sn )
3932 TSmoothNode& sNode = n2sn->second;
3933 if ( sNode._triangles.empty() )
3934 continue; // not movable node
3938 for ( unsigned i = 0; i < sNode._triangles.size(); ++i )
3939 newUV += sNode._triangles[i]._n1->_uv;
3940 newUV /= sNode._triangles.size();
3942 // check validity of the newUV
3943 bool isValid = true;
3944 for ( unsigned i = 0; i < sNode._triangles.size() && isValid; ++i )
3945 isValid = ( sNode._triangles[i].IsForward( newUV ) == refForward );
3952 // Set new XYZ to the smoothed nodes
3954 Handle(Geom_Surface) surface = BRep_Tool::Surface( geomFace );
3956 for ( n2sn = smooNoMap.begin(); n2sn != smooNoMap.end(); ++n2sn )
3958 TSmoothNode& sNode = n2sn->second;
3959 if ( sNode._triangles.empty() )
3960 continue; // not movable node
3962 SMDS_MeshNode* node = const_cast< SMDS_MeshNode*>( n2sn->first );
3963 gp_Pnt xyz = surface->Value( sNode._uv.X(), sNode._uv.Y() );
3964 meshDS->MoveNode( node, xyz.X(), xyz.Y(), xyz.Z() );
3967 node->SetPosition( SMDS_PositionPtr( new SMDS_FacePosition( sNode._uv.X(), sNode._uv.Y() )));
3970 // Move medium nodes in quadratic mesh
3971 if ( _quadraticMesh )
3973 const TLinkNodeMap& links = myHelper->GetTLinkNodeMap();
3974 TLinkNodeMap::const_iterator linkIt = links.begin();
3975 for ( ; linkIt != links.end(); ++linkIt )
3977 const SMESH_TLink& link = linkIt->first;
3978 SMDS_MeshNode* node = const_cast< SMDS_MeshNode*>( linkIt->second );
3980 if ( node->getshapeId() != myHelper->GetSubShapeID() )
3981 continue; // medium node is on EDGE or VERTEX
3983 gp_XY uv1 = myHelper->GetNodeUV( geomFace, link.node1(), node );
3984 gp_XY uv2 = myHelper->GetNodeUV( geomFace, link.node2(), node );
3986 gp_XY uv = myHelper->GetMiddleUV( surface, uv1, uv2 );
3987 node->SetPosition( SMDS_PositionPtr( new SMDS_FacePosition( uv.X(), uv.Y() )));
3989 gp_Pnt xyz = surface->Value( uv.X(), uv.Y() );
3990 meshDS->MoveNode( node, xyz.X(), xyz.Y(), xyz.Z() );