1 // Copyright (C) 2007-2008 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
22 // File: SMESH_MesherHelper.cxx
23 // Created: 15.02.06 15:22:41
24 // Author: Sergey KUUL
26 #include "SMESH_MesherHelper.hxx"
28 #include "SMDS_FacePosition.hxx"
29 #include "SMDS_EdgePosition.hxx"
30 #include "SMDS_VolumeTool.hxx"
31 #include "SMESH_subMesh.hxx"
33 #include <BRepAdaptor_Surface.hxx>
34 #include <BRepTools.hxx>
35 #include <BRepTools_WireExplorer.hxx>
36 #include <BRep_Tool.hxx>
37 #include <Geom2d_Curve.hxx>
38 #include <GeomAPI_ProjectPointOnCurve.hxx>
39 #include <GeomAPI_ProjectPointOnSurf.hxx>
40 #include <Geom_Curve.hxx>
41 #include <Geom_Surface.hxx>
42 #include <ShapeAnalysis.hxx>
44 #include <TopExp_Explorer.hxx>
45 #include <TopTools_ListIteratorOfListOfShape.hxx>
46 #include <TopTools_MapIteratorOfMapOfShape.hxx>
47 #include <TopTools_MapOfShape.hxx>
50 #include <gp_Pnt2d.hxx>
51 #include <gp_Trsf.hxx>
53 #include <Standard_Failure.hxx>
54 #include <Standard_ErrorHandler.hxx>
56 #include <utilities.h>
60 #define RETURN_BAD_RESULT(msg) { MESSAGE(msg); return false; }
64 gp_XYZ XYZ(const SMDS_MeshNode* n) { return gp_XYZ(n->X(), n->Y(), n->Z()); }
66 enum { U_periodic = 1, V_periodic = 2 };
69 //================================================================================
73 //================================================================================
75 SMESH_MesherHelper::SMESH_MesherHelper(SMESH_Mesh& theMesh)
76 : myParIndex(0), myMesh(&theMesh), myShapeID(0), myCreateQuadratic(false)
78 myPar1[0] = myPar2[0] = myPar1[1] = myPar2[1] = 0;
79 mySetElemOnShape = ( ! myMesh->HasShapeToMesh() );
82 //=======================================================================
83 //function : IsQuadraticSubMesh
84 //purpose : Check submesh for given shape: if all elements on this shape
85 // are quadratic, quadratic elements will be created.
86 // Also fill myTLinkNodeMap
87 //=======================================================================
89 bool SMESH_MesherHelper::IsQuadraticSubMesh(const TopoDS_Shape& aSh)
91 SMESHDS_Mesh* meshDS = GetMeshDS();
92 // we can create quadratic elements only if all elements
93 // created on subshapes of given shape are quadratic
94 // also we have to fill myTLinkNodeMap
95 myCreateQuadratic = true;
96 mySeamShapeIds.clear();
97 myDegenShapeIds.clear();
98 TopAbs_ShapeEnum subType( aSh.ShapeType()==TopAbs_FACE ? TopAbs_EDGE : TopAbs_FACE );
99 SMDSAbs_ElementType elemType( subType==TopAbs_FACE ? SMDSAbs_Face : SMDSAbs_Edge );
101 int nbOldLinks = myTLinkNodeMap.size();
103 TopExp_Explorer exp( aSh, subType );
104 for (; exp.More() && myCreateQuadratic; exp.Next()) {
105 if ( SMESHDS_SubMesh * subMesh = meshDS->MeshElements( exp.Current() )) {
106 if ( SMDS_ElemIteratorPtr it = subMesh->GetElements() ) {
108 const SMDS_MeshElement* e = it->next();
109 if ( e->GetType() != elemType || !e->IsQuadratic() ) {
110 myCreateQuadratic = false;
115 switch ( e->NbNodes() ) {
117 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(2)); break;
119 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(3));
120 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(4));
121 AddTLinkNode(e->GetNode(2),e->GetNode(0),e->GetNode(5)); break;
123 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(4));
124 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(5));
125 AddTLinkNode(e->GetNode(2),e->GetNode(3),e->GetNode(6));
126 AddTLinkNode(e->GetNode(3),e->GetNode(0),e->GetNode(7));
129 myCreateQuadratic = false;
138 if ( nbOldLinks == myTLinkNodeMap.size() )
139 myCreateQuadratic = false;
141 if(!myCreateQuadratic) {
142 myTLinkNodeMap.clear();
146 return myCreateQuadratic;
149 //=======================================================================
150 //function : SetSubShape
151 //purpose : Set geomerty to make elements on
152 //=======================================================================
154 void SMESH_MesherHelper::SetSubShape(const int aShID)
156 if ( aShID == myShapeID )
159 SetSubShape( GetMeshDS()->IndexToShape( aShID ));
161 SetSubShape( TopoDS_Shape() );
164 //=======================================================================
165 //function : SetSubShape
166 //purpose : Set geomerty to create elements on
167 //=======================================================================
169 void SMESH_MesherHelper::SetSubShape(const TopoDS_Shape& aSh)
171 if ( myShape.IsSame( aSh ))
175 mySeamShapeIds.clear();
176 myDegenShapeIds.clear();
178 if ( myShape.IsNull() ) {
182 SMESHDS_Mesh* meshDS = GetMeshDS();
183 myShapeID = meshDS->ShapeToIndex(aSh);
186 // treatment of periodic faces
187 for ( TopExp_Explorer eF( aSh, TopAbs_FACE ); eF.More(); eF.Next() )
189 const TopoDS_Face& face = TopoDS::Face( eF.Current() );
190 BRepAdaptor_Surface surface( face );
191 if ( surface.IsUPeriodic() || surface.IsVPeriodic() )
193 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
195 // look for a seam edge
196 const TopoDS_Edge& edge = TopoDS::Edge( exp.Current() );
197 if ( BRep_Tool::IsClosed( edge, face )) {
198 // initialize myPar1, myPar2 and myParIndex
200 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
201 if ( Abs( uv1.Coord(1) - uv2.Coord(1) ) < Abs( uv1.Coord(2) - uv2.Coord(2) ))
203 myParIndex |= U_periodic;
204 myPar1[0] = surface.FirstUParameter();
205 myPar2[0] = surface.LastUParameter();
208 myParIndex |= V_periodic;
209 myPar1[1] = surface.FirstVParameter();
210 myPar2[1] = surface.LastVParameter();
212 // store seam shape indices, negative if shape encounters twice
213 int edgeID = meshDS->ShapeToIndex( edge );
214 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
215 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
216 int vertexID = meshDS->ShapeToIndex( v.Current() );
217 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
221 // look for a degenerated edge
222 if ( BRep_Tool::Degenerated( edge )) {
223 myDegenShapeIds.insert( meshDS->ShapeToIndex( edge ));
224 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
225 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
232 //=======================================================================
233 //function : GetNodeUVneedInFaceNode
234 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
235 // Return true if the face is periodic.
236 // If F is Null, answer about subshape set through IsQuadraticSubMesh() or
238 //=======================================================================
240 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
242 if ( F.IsNull() ) return !mySeamShapeIds.empty();
244 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
245 return !mySeamShapeIds.empty();
248 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
249 if ( !aSurface.IsNull() )
250 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
255 //=======================================================================
256 //function : IsMedium
258 //=======================================================================
260 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
261 const SMDSAbs_ElementType typeToCheck)
263 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
266 //=======================================================================
267 //function : GetSubShapeByNode
268 //purpose : Return support shape of a node
269 //=======================================================================
271 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
272 SMESHDS_Mesh* meshDS)
274 int shapeID = node->GetPosition()->GetShapeId();
275 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
276 return meshDS->IndexToShape( shapeID );
278 return TopoDS_Shape();
282 //=======================================================================
283 //function : AddTLinkNode
284 //purpose : add a link in my data structure
285 //=======================================================================
287 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
288 const SMDS_MeshNode* n2,
289 const SMDS_MeshNode* n12)
291 // add new record to map
292 SMESH_TLink link( n1, n2 );
293 myTLinkNodeMap.insert( make_pair(link,n12));
296 //=======================================================================
297 //function : GetUVOnSeam
298 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
299 //=======================================================================
301 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
303 gp_Pnt2d result = uv1;
304 for ( int i = U_periodic; i <= V_periodic ; ++i )
306 if ( myParIndex & i )
308 double p1 = uv1.Coord( i );
309 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
310 if ( myParIndex == i ||
311 dp1 < ( myPar2[i-1] - myPar2[i-1] ) / 100. ||
312 dp2 < ( myPar2[i-1] - myPar2[i-1] ) / 100. )
314 double p2 = uv2.Coord( i );
315 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
316 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
317 result.SetCoord( i, p1Alt );
324 //=======================================================================
325 //function : GetNodeUV
326 //purpose : Return node UV on face
327 //=======================================================================
329 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
330 const SMDS_MeshNode* n,
331 const SMDS_MeshNode* n2,
334 gp_Pnt2d uv( 1e100, 1e100 );
335 const SMDS_PositionPtr Pos = n->GetPosition();
337 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
339 // node has position on face
340 const SMDS_FacePosition* fpos =
341 static_cast<const SMDS_FacePosition*>(n->GetPosition().get());
342 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
344 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), BRep_Tool::Tolerance( F ));
346 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
348 // node has position on edge => it is needed to find
349 // corresponding edge from face, get pcurve for this
350 // edge and retrieve value from this pcurve
351 const SMDS_EdgePosition* epos =
352 static_cast<const SMDS_EdgePosition*>(n->GetPosition().get());
353 int edgeID = Pos->GetShapeId();
354 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
355 double f, l, u = epos->GetUParameter();
356 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
357 bool validU = ( f < u && u < l );
359 uv = C2d->Value( u );
362 if ( check || !validU )
363 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), BRep_Tool::Tolerance( E ),/*force=*/ !validU );
365 // for a node on a seam edge select one of UVs on 2 pcurves
366 if ( n2 && IsSeamShape( edgeID ) )
368 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
371 { // adjust uv to period
373 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
374 Standard_Boolean isUPeriodic = S->IsUPeriodic();
375 Standard_Boolean isVPeriodic = S->IsVPeriodic();
376 if ( isUPeriodic || isVPeriodic ) {
377 Standard_Real UF,UL,VF,VL;
378 S->Bounds(UF,UL,VF,VL);
380 uv.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
382 uv.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
386 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
388 if ( int vertexID = n->GetPosition()->GetShapeId() ) {
389 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
391 uv = BRep_Tool::Parameters( V, F );
394 catch (Standard_Failure& exc) {
397 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
398 uvOK = ( V == vert.Current() );
401 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
402 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
404 // get UV of a vertex closest to the node
406 gp_Pnt pn = XYZ( n );
407 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
408 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
409 gp_Pnt p = BRep_Tool::Pnt( curV );
410 double curDist = p.SquareDistance( pn );
411 if ( curDist < dist ) {
413 uv = BRep_Tool::Parameters( curV, F );
414 uvOK = ( dist < DBL_MIN );
419 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
420 for ( ; it.More(); it.Next() ) {
421 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
422 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
424 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
425 if ( !C2d.IsNull() ) {
426 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
427 uv = C2d->Value( u );
434 if ( n2 && IsSeamShape( vertexID ) )
435 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
445 //=======================================================================
446 //function : CheckNodeUV
447 //purpose : Check and fix node UV on a face
448 //=======================================================================
450 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
451 const SMDS_MeshNode* n,
454 const bool force) const
456 if ( force || !myOkNodePosShapes.count( n->GetPosition()->GetShapeId() ))
458 // check that uv is correct
460 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
461 gp_Pnt nodePnt = XYZ( n );
462 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
463 if ( nodePnt.Distance( surface->Value( uv.X(), uv.Y() )) > tol )
465 // uv incorrect, project the node to surface
466 GeomAPI_ProjectPointOnSurf projector( nodePnt, surface, tol );
467 if ( !projector.IsDone() || projector.NbPoints() < 1 )
469 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
472 Quantity_Parameter U,V;
473 projector.LowerDistanceParameters(U,V);
474 if ( nodePnt.Distance( surface->Value( U, V )) > tol )
476 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
481 else if ( uv.Modulus() > numeric_limits<double>::min() )
483 ((SMESH_MesherHelper*) this)->myOkNodePosShapes.insert( n->GetPosition()->GetShapeId() );
489 //=======================================================================
490 //function : GetMiddleUV
491 //purpose : Return middle UV taking in account surface period
492 //=======================================================================
494 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
498 if ( surface.IsNull() )
499 return 0.5 * ( p1 + p2 );
500 //checking if surface is periodic
501 Standard_Real UF,UL,VF,VL;
502 surface->Bounds(UF,UL,VF,VL);
505 Standard_Boolean isUPeriodic = surface->IsUPeriodic();
507 Standard_Real UPeriod = surface->UPeriod();
508 Standard_Real p2x = p2.X()+ShapeAnalysis::AdjustByPeriod(p2.X(),p1.X(),UPeriod);
509 Standard_Real pmid = (p1.X()+p2x)/2.;
510 u = pmid+ShapeAnalysis::AdjustToPeriod(pmid,UF,UL);
513 u= (p1.X()+p2.X())/2.;
515 Standard_Boolean isVPeriodic = surface->IsVPeriodic();
517 Standard_Real VPeriod = surface->VPeriod();
518 Standard_Real p2y = p2.Y()+ShapeAnalysis::AdjustByPeriod(p2.Y(),p1.Y(),VPeriod);
519 Standard_Real pmid = (p1.Y()+p2y)/2.;
520 v = pmid+ShapeAnalysis::AdjustToPeriod(pmid,VF,VL);
523 v = (p1.Y()+p2.Y())/2.;
528 //=======================================================================
529 //function : GetNodeU
530 //purpose : Return node U on edge
531 //=======================================================================
533 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
534 const SMDS_MeshNode* n,
538 const SMDS_PositionPtr Pos = n->GetPosition();
539 if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE) {
540 const SMDS_EdgePosition* epos =
541 static_cast<const SMDS_EdgePosition*>(n->GetPosition().get());
542 param = epos->GetUParameter();
544 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX) {
545 SMESHDS_Mesh * meshDS = GetMeshDS();
546 int vertexID = n->GetPosition()->GetShapeId();
547 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
548 param = BRep_Tool::Parameter( V, E );
551 *check = CheckNodeU( E, n, param, BRep_Tool::Tolerance( E ));
555 //=======================================================================
556 //function : CheckNodeU
557 //purpose : Check and fix node U on an edge
558 // Return false if U is bad and could not be fixed
559 //=======================================================================
561 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
562 const SMDS_MeshNode* n,
565 const bool force) const
567 if ( force || !myOkNodePosShapes.count( n->GetPosition()->GetShapeId() ))
569 // check that u is correct
570 TopLoc_Location loc; double f,l;
571 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
572 if ( curve.IsNull() ) // degenerated edge
574 if ( u+tol < f || u-tol > l )
576 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
582 gp_Pnt nodePnt = SMESH_MeshEditor::TNodeXYZ( n );
583 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
584 if ( nodePnt.Distance( curve->Value( u )) > tol )
586 // u incorrect, project the node to the curve
587 GeomAPI_ProjectPointOnCurve projector( nodePnt, curve, f, l );
588 if ( projector.NbPoints() < 1 )
590 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
593 Quantity_Parameter U = projector.LowerDistanceParameter();
594 if ( nodePnt.Distance( curve->Value( U )) > tol )
596 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
601 else if ( fabs( u ) > numeric_limits<double>::min() )
603 ((SMESH_MesherHelper*) this)->myOkNodePosShapes.insert( n->GetPosition()->GetShapeId() );
610 //=======================================================================
611 //function : GetMediumNode
612 //purpose : Return existing or create new medium nodes between given ones
613 //=======================================================================
615 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
616 const SMDS_MeshNode* n2,
619 // Find existing node
621 SMESH_TLink link(n1,n2);
622 ItTLinkNode itLN = myTLinkNodeMap.find( link );
623 if ( itLN != myTLinkNodeMap.end() ) {
624 return (*itLN).second;
627 // Create medium node
630 SMESHDS_Mesh* meshDS = GetMeshDS();
632 // get type of shape for the new medium node
633 int faceID = -1, edgeID = -1;
634 const SMDS_PositionPtr Pos1 = n1->GetPosition();
635 const SMDS_PositionPtr Pos2 = n2->GetPosition();
637 if( myShape.IsNull() )
639 if( Pos1->GetTypeOfPosition()==SMDS_TOP_FACE ) {
640 faceID = Pos1->GetShapeId();
642 else if( Pos2->GetTypeOfPosition()==SMDS_TOP_FACE ) {
643 faceID = Pos2->GetShapeId();
646 if( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE ) {
647 edgeID = Pos1->GetShapeId();
649 if( Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE ) {
650 edgeID = Pos2->GetShapeId();
653 // get positions of the given nodes on shapes
654 TopoDS_Edge E; double u [2];
655 TopoDS_Face F; gp_XY uv[2];
656 bool uvOK[2] = { false, false };
657 TopAbs_ShapeEnum shapeType = myShape.IsNull() ? TopAbs_SHAPE : myShape.ShapeType();
658 if ( faceID>0 || shapeType == TopAbs_FACE)
660 if( myShape.IsNull() )
661 F = TopoDS::Face(meshDS->IndexToShape(faceID));
663 F = TopoDS::Face(myShape);
666 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
667 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
669 else if (edgeID>0 || shapeType == TopAbs_EDGE)
671 if( myShape.IsNull() )
672 E = TopoDS::Edge(meshDS->IndexToShape(edgeID));
674 E = TopoDS::Edge(myShape);
677 u[0] = GetNodeU(E,n1, force3d ? 0 : &uvOK[0]);
678 u[1] = GetNodeU(E,n2, force3d ? 0 : &uvOK[1]);
682 // we try to create medium node using UV parameters of
683 // nodes, else - medium between corresponding 3d points
686 if ( uvOK[0] && uvOK[1] )
688 if ( IsDegenShape( Pos1->GetShapeId() ))
689 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
690 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
691 else if ( IsDegenShape( Pos2->GetShapeId() ))
692 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
693 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
696 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
697 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
698 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
699 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
700 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
701 myTLinkNodeMap.insert(make_pair(link,n12));
705 else if ( !E.IsNull() )
708 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
711 Standard_Boolean isPeriodic = C->IsPeriodic();
714 Standard_Real Period = C->Period();
715 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
716 Standard_Real pmid = (u[0]+p)/2.;
717 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
722 gp_Pnt P = C->Value( U );
723 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
724 meshDS->SetNodeOnEdge(n12, edgeID, U);
725 myTLinkNodeMap.insert(make_pair(link,n12));
731 double x = ( n1->X() + n2->X() )/2.;
732 double y = ( n1->Y() + n2->Y() )/2.;
733 double z = ( n1->Z() + n2->Z() )/2.;
734 n12 = meshDS->AddNode(x,y,z);
737 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
738 CheckNodeUV( F, n12, UV, BRep_Tool::Tolerance( F ), /*force=*/true);
739 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
741 else if ( !E.IsNull() )
743 double U = ( u[0] + u[1] ) / 2.;
744 CheckNodeU( E, n12, U, BRep_Tool::Tolerance( E ), /*force=*/true);
745 meshDS->SetNodeOnEdge(n12, edgeID, U);
749 meshDS->SetNodeInVolume(n12, myShapeID);
751 myTLinkNodeMap.insert( make_pair( link, n12 ));
755 //=======================================================================
757 //purpose : Creates a node
758 //=======================================================================
760 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID)
762 SMESHDS_Mesh * meshDS = GetMeshDS();
763 SMDS_MeshNode* node = 0;
765 node = meshDS->AddNodeWithID( x, y, z, ID );
767 node = meshDS->AddNode( x, y, z );
768 if ( mySetElemOnShape && myShapeID > 0 ) {
769 switch ( myShape.ShapeType() ) {
770 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
771 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
772 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID); break;
773 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID); break;
774 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
781 //=======================================================================
783 //purpose : Creates quadratic or linear edge
784 //=======================================================================
786 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
787 const SMDS_MeshNode* n2,
791 SMESHDS_Mesh * meshDS = GetMeshDS();
793 SMDS_MeshEdge* edge = 0;
794 if (myCreateQuadratic) {
795 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
797 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
799 edge = meshDS->AddEdge(n1, n2, n12);
803 edge = meshDS->AddEdgeWithID(n1, n2, id);
805 edge = meshDS->AddEdge(n1, n2);
808 if ( mySetElemOnShape && myShapeID > 0 )
809 meshDS->SetMeshElementOnShape( edge, myShapeID );
814 //=======================================================================
816 //purpose : Creates quadratic or linear triangle
817 //=======================================================================
819 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
820 const SMDS_MeshNode* n2,
821 const SMDS_MeshNode* n3,
825 SMESHDS_Mesh * meshDS = GetMeshDS();
826 SMDS_MeshFace* elem = 0;
828 if( n1==n2 || n2==n3 || n3==n1 )
831 if(!myCreateQuadratic) {
833 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
835 elem = meshDS->AddFace(n1, n2, n3);
838 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
839 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
840 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
843 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
845 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
847 if ( mySetElemOnShape && myShapeID > 0 )
848 meshDS->SetMeshElementOnShape( elem, myShapeID );
853 //=======================================================================
855 //purpose : Creates quadratic or linear quadrangle
856 //=======================================================================
858 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
859 const SMDS_MeshNode* n2,
860 const SMDS_MeshNode* n3,
861 const SMDS_MeshNode* n4,
865 SMESHDS_Mesh * meshDS = GetMeshDS();
866 SMDS_MeshFace* elem = 0;
869 return AddFace(n1,n3,n4,id,force3d);
872 return AddFace(n1,n2,n4,id,force3d);
875 return AddFace(n1,n2,n3,id,force3d);
878 return AddFace(n1,n2,n4,id,force3d);
881 return AddFace(n1,n2,n3,id,force3d);
884 return AddFace(n1,n2,n3,id,force3d);
887 if(!myCreateQuadratic) {
889 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
891 elem = meshDS->AddFace(n1, n2, n3, n4);
894 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
895 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
896 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
897 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
900 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
902 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
904 if ( mySetElemOnShape && myShapeID > 0 )
905 meshDS->SetMeshElementOnShape( elem, myShapeID );
910 //=======================================================================
911 //function : AddVolume
912 //purpose : Creates quadratic or linear prism
913 //=======================================================================
915 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
916 const SMDS_MeshNode* n2,
917 const SMDS_MeshNode* n3,
918 const SMDS_MeshNode* n4,
919 const SMDS_MeshNode* n5,
920 const SMDS_MeshNode* n6,
924 SMESHDS_Mesh * meshDS = GetMeshDS();
925 SMDS_MeshVolume* elem = 0;
926 if(!myCreateQuadratic) {
928 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
930 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
933 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
934 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
935 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
937 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
938 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
939 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
941 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
942 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
943 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
946 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
947 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
949 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
950 n12, n23, n31, n45, n56, n64, n14, n25, n36);
952 if ( mySetElemOnShape && myShapeID > 0 )
953 meshDS->SetMeshElementOnShape( elem, myShapeID );
958 //=======================================================================
959 //function : AddVolume
960 //purpose : Creates quadratic or linear tetrahedron
961 //=======================================================================
963 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
964 const SMDS_MeshNode* n2,
965 const SMDS_MeshNode* n3,
966 const SMDS_MeshNode* n4,
970 SMESHDS_Mesh * meshDS = GetMeshDS();
971 SMDS_MeshVolume* elem = 0;
972 if(!myCreateQuadratic) {
974 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
976 elem = meshDS->AddVolume(n1, n2, n3, n4);
979 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
980 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
981 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
983 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
984 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
985 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
988 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
990 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
992 if ( mySetElemOnShape && myShapeID > 0 )
993 meshDS->SetMeshElementOnShape( elem, myShapeID );
998 //=======================================================================
999 //function : AddVolume
1000 //purpose : Creates quadratic or linear pyramid
1001 //=======================================================================
1003 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1004 const SMDS_MeshNode* n2,
1005 const SMDS_MeshNode* n3,
1006 const SMDS_MeshNode* n4,
1007 const SMDS_MeshNode* n5,
1011 SMDS_MeshVolume* elem = 0;
1012 if(!myCreateQuadratic) {
1014 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1016 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1019 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1020 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1021 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1022 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1024 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1025 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1026 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
1027 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1030 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
1035 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
1037 n15, n25, n35, n45);
1039 if ( mySetElemOnShape && myShapeID > 0 )
1040 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
1045 //=======================================================================
1046 //function : AddVolume
1047 //purpose : Creates quadratic or linear hexahedron
1048 //=======================================================================
1050 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1051 const SMDS_MeshNode* n2,
1052 const SMDS_MeshNode* n3,
1053 const SMDS_MeshNode* n4,
1054 const SMDS_MeshNode* n5,
1055 const SMDS_MeshNode* n6,
1056 const SMDS_MeshNode* n7,
1057 const SMDS_MeshNode* n8,
1061 SMESHDS_Mesh * meshDS = GetMeshDS();
1062 SMDS_MeshVolume* elem = 0;
1063 if(!myCreateQuadratic) {
1065 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
1067 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
1070 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1071 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1072 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1073 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1075 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1076 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
1077 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
1078 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
1080 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1081 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
1082 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
1083 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
1086 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
1087 n12, n23, n34, n41, n56, n67,
1088 n78, n85, n15, n26, n37, n48, id);
1090 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
1091 n12, n23, n34, n41, n56, n67,
1092 n78, n85, n15, n26, n37, n48);
1094 if ( mySetElemOnShape && myShapeID > 0 )
1095 meshDS->SetMeshElementOnShape( elem, myShapeID );
1100 //=======================================================================
1101 //function : LoadNodeColumns
1102 //purpose : Load nodes bound to face into a map of node columns
1103 //=======================================================================
1105 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
1106 const TopoDS_Face& theFace,
1107 const TopoDS_Edge& theBaseEdge,
1108 SMESHDS_Mesh* theMesh)
1110 // get vertices of theBaseEdge
1111 TopoDS_Vertex vfb, vlb, vft; // first and last, bottom and top vertices
1112 TopoDS_Edge eFrw = TopoDS::Edge( theBaseEdge.Oriented( TopAbs_FORWARD ));
1113 TopExp::Vertices( eFrw, vfb, vlb );
1115 // find the other edges of theFace and orientation of e1
1116 TopoDS_Edge e1, e2, eTop;
1117 bool rev1, CumOri = false;
1118 TopExp_Explorer exp( theFace, TopAbs_EDGE );
1120 for ( ; exp.More(); exp.Next() ) {
1121 if ( ++nbEdges > 4 ) {
1122 return false; // more than 4 edges in theFace
1124 TopoDS_Edge e = TopoDS::Edge( exp.Current() );
1125 if ( theBaseEdge.IsSame( e ))
1127 TopoDS_Vertex vCommon;
1128 if ( !TopExp::CommonVertex( theBaseEdge, e, vCommon ))
1130 else if ( vCommon.IsSame( vfb )) {
1132 vft = TopExp::LastVertex( e1, CumOri );
1133 rev1 = vfb.IsSame( vft );
1135 vft = TopExp::FirstVertex( e1, CumOri );
1140 if ( nbEdges < 4 ) {
1141 return false; // less than 4 edges in theFace
1143 if ( e2.IsNull() && vfb.IsSame( vlb ))
1146 // submeshes corresponding to shapes
1147 SMESHDS_SubMesh* smFace = theMesh->MeshElements( theFace );
1148 SMESHDS_SubMesh* smb = theMesh->MeshElements( theBaseEdge );
1149 SMESHDS_SubMesh* smt = theMesh->MeshElements( eTop );
1150 SMESHDS_SubMesh* sm1 = theMesh->MeshElements( e1 );
1151 SMESHDS_SubMesh* sm2 = theMesh->MeshElements( e2 );
1152 SMESHDS_SubMesh* smVfb = theMesh->MeshElements( vfb );
1153 SMESHDS_SubMesh* smVlb = theMesh->MeshElements( vlb );
1154 SMESHDS_SubMesh* smVft = theMesh->MeshElements( vft );
1155 if (!smFace || !smb || !smt || !sm1 || !sm2 || !smVfb || !smVlb || !smVft ) {
1156 RETURN_BAD_RESULT( "NULL submesh " <<smFace<<" "<<smb<<" "<<smt<<" "<<
1157 sm1<<" "<<sm2<<" "<<smVfb<<" "<<smVlb<<" "<<smVft);
1159 if ( smb->NbNodes() != smt->NbNodes() || sm1->NbNodes() != sm2->NbNodes() ) {
1160 RETURN_BAD_RESULT(" Diff nb of nodes on opposite edges" );
1162 if (smVfb->NbNodes() != 1 || smVlb->NbNodes() != 1 || smVft->NbNodes() != 1) {
1163 RETURN_BAD_RESULT("Empty submesh of vertex");
1165 // define whether mesh is quadratic
1166 bool isQuadraticMesh = false;
1167 SMDS_ElemIteratorPtr eIt = smFace->GetElements();
1168 if ( !eIt->more() ) {
1169 RETURN_BAD_RESULT("No elements on the face");
1171 const SMDS_MeshElement* e = eIt->next();
1172 isQuadraticMesh = e->IsQuadratic();
1174 if ( sm1->NbNodes() * smb->NbNodes() != smFace->NbNodes() ) {
1175 // check quadratic case
1176 if ( isQuadraticMesh ) {
1177 // what if there are quadrangles and triangles mixed?
1178 // int n1 = sm1->NbNodes()/2;
1179 // int n2 = smb->NbNodes()/2;
1180 // int n3 = sm1->NbNodes() - n1;
1181 // int n4 = smb->NbNodes() - n2;
1182 // int nf = sm1->NbNodes()*smb->NbNodes() - n3*n4;
1183 // if( nf != smFace->NbNodes() ) {
1184 // MESSAGE( "Wrong nb face nodes: " <<
1185 // sm1->NbNodes()<<" "<<smb->NbNodes()<<" "<<smFace->NbNodes());
1190 RETURN_BAD_RESULT( "Wrong nb face nodes: " <<
1191 sm1->NbNodes()<<" "<<smb->NbNodes()<<" "<<smFace->NbNodes());
1195 int vsize = sm1->NbNodes() + 2;
1196 int hsize = smb->NbNodes() + 2;
1197 if(isQuadraticMesh) {
1198 vsize = vsize - sm1->NbNodes()/2 -1;
1199 hsize = hsize - smb->NbNodes()/2 -1;
1202 // load nodes from theBaseEdge
1204 std::set<const SMDS_MeshNode*> loadedNodes;
1205 const SMDS_MeshNode* nullNode = 0;
1207 std::vector<const SMDS_MeshNode*> & nVecf = theParam2ColumnMap[ 0.];
1208 nVecf.resize( vsize, nullNode );
1209 loadedNodes.insert( nVecf[ 0 ] = smVfb->GetNodes()->next() );
1211 std::vector<const SMDS_MeshNode*> & nVecl = theParam2ColumnMap[ 1.];
1212 nVecl.resize( vsize, nullNode );
1213 loadedNodes.insert( nVecl[ 0 ] = smVlb->GetNodes()->next() );
1216 BRep_Tool::Range( eFrw, f, l );
1217 double range = l - f;
1218 SMDS_NodeIteratorPtr nIt = smb->GetNodes();
1219 const SMDS_MeshNode* node;
1220 while ( nIt->more() ) {
1222 if(IsMedium(node, SMDSAbs_Edge))
1224 const SMDS_EdgePosition* pos =
1225 dynamic_cast<const SMDS_EdgePosition*>( node->GetPosition().get() );
1229 double u = ( pos->GetUParameter() - f ) / range;
1230 std::vector<const SMDS_MeshNode*> & nVec = theParam2ColumnMap[ u ];
1231 nVec.resize( vsize, nullNode );
1232 loadedNodes.insert( nVec[ 0 ] = node );
1234 if ( theParam2ColumnMap.size() != hsize ) {
1235 RETURN_BAD_RESULT( "Wrong node positions on theBaseEdge" );
1238 // load nodes from e1
1240 std::map< double, const SMDS_MeshNode*> sortedNodes; // sort by param on edge
1241 nIt = sm1->GetNodes();
1242 while ( nIt->more() ) {
1246 const SMDS_EdgePosition* pos =
1247 dynamic_cast<const SMDS_EdgePosition*>( node->GetPosition().get() );
1251 sortedNodes.insert( std::make_pair( pos->GetUParameter(), node ));
1253 loadedNodes.insert( nVecf[ vsize - 1 ] = smVft->GetNodes()->next() );
1254 std::map< double, const SMDS_MeshNode*>::iterator u_n = sortedNodes.begin();
1255 int row = rev1 ? vsize - 1 : 0;
1256 int dRow = rev1 ? -1 : +1;
1257 for ( ; u_n != sortedNodes.end(); u_n++ ) {
1259 loadedNodes.insert( nVecf[ row ] = u_n->second );
1262 // try to load the rest nodes
1264 // get all faces from theFace
1265 TIDSortedElemSet allFaces, foundFaces;
1266 eIt = smFace->GetElements();
1267 while ( eIt->more() ) {
1268 const SMDS_MeshElement* e = eIt->next();
1269 if ( e->GetType() == SMDSAbs_Face )
1270 allFaces.insert( e );
1272 // Starting from 2 neighbour nodes on theBaseEdge, look for a face
1273 // the nodes belong to, and between the nodes of the found face,
1274 // look for a not loaded node considering this node to be the next
1275 // in a column of the starting second node. Repeat, starting
1276 // from nodes next to the previous starting nodes in their columns,
1277 // and so on while a face can be found. Then go the the next pair
1278 // of nodes on theBaseEdge.
1279 TParam2ColumnMap::iterator par_nVec_1 = theParam2ColumnMap.begin();
1280 TParam2ColumnMap::iterator par_nVec_2 = par_nVec_1;
1283 for ( par_nVec_2++; par_nVec_2 != theParam2ColumnMap.end(); par_nVec_1++, par_nVec_2++ ) {
1286 const SMDS_MeshNode* n1 = par_nVec_1->second[ row ];
1287 const SMDS_MeshNode* n2 = par_nVec_2->second[ row ];
1288 const SMDS_MeshElement* face = 0;
1289 bool lastColOnClosedFace = ( nVecf[ row ] == n2 );
1291 // look for a face by 2 nodes
1292 face = SMESH_MeshEditor::FindFaceInSet( n1, n2, allFaces, foundFaces );
1294 int nbFaceNodes = face->NbNodes();
1295 if ( face->IsQuadratic() )
1297 if ( nbFaceNodes>4 ) {
1298 RETURN_BAD_RESULT(" Too many nodes in a face: " << nbFaceNodes );
1300 // look for a not loaded node of the <face>
1302 const SMDS_MeshNode* n3 = 0; // a node defferent from n1 and n2
1303 for ( int i = 0; i < nbFaceNodes && !found; ++i ) {
1304 node = face->GetNode( i );
1305 found = loadedNodes.insert( node ).second;
1306 if ( !found && node != n1 && node != n2 )
1309 if ( lastColOnClosedFace && row + 1 < vsize ) {
1310 node = nVecf[ row + 1 ];
1311 found = ( face->GetNodeIndex( node ) >= 0 );
1314 if ( ++row > vsize - 1 ) {
1315 RETURN_BAD_RESULT( "Too many nodes in column "<< col <<": "<< row+1);
1317 par_nVec_2->second[ row ] = node;
1318 foundFaces.insert( face );
1320 if ( nbFaceNodes==4 ) {
1321 n1 = par_nVec_1->second[ row ];
1324 else if ( nbFaceNodes==3 && n3 == par_nVec_1->second[ row + 1 ] ) {
1328 RETURN_BAD_RESULT( "Not quad mesh, column "<< col );
1332 while ( face && n1 && n2 );
1334 if ( row < vsize - 1 ) {
1335 MESSAGE( "Too few nodes in column "<< col <<": "<< row+1);
1336 MESSAGE( "Base node 1: "<< par_nVec_1->second[0]);
1337 MESSAGE( "Base node 2: "<< par_nVec_2->second[0]);
1338 if ( n1 ) { MESSAGE( "Current node 1: "<< n1); }
1339 else { MESSAGE( "Current node 1: NULL"); }
1340 if ( n2 ) { MESSAGE( "Current node 2: "<< n2); }
1341 else { MESSAGE( "Current node 2: NULL"); }
1342 MESSAGE( "first base node: "<< theParam2ColumnMap.begin()->second[0]);
1343 MESSAGE( "last base node: "<< theParam2ColumnMap.rbegin()->second[0]);
1346 } // loop on columns
1351 //=======================================================================
1352 //function : NbAncestors
1353 //purpose : Return number of unique ancestors of the shape
1354 //=======================================================================
1356 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
1357 const SMESH_Mesh& mesh,
1358 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
1360 TopTools_MapOfShape ancestors;
1361 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
1362 for ( ; ansIt.More(); ansIt.Next() ) {
1363 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
1364 ancestors.Add( ansIt.Value() );
1366 return ancestors.Extent();
1369 //=======================================================================
1370 //function : IsQuadraticMesh
1371 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
1372 // quadratic elements will be created.
1373 // Used then generated 3D mesh without geometry.
1374 //=======================================================================
1376 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
1378 int NbAllEdgsAndFaces=0;
1379 int NbQuadFacesAndEdgs=0;
1380 int NbFacesAndEdges=0;
1381 //All faces and edges
1382 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
1384 //Quadratic faces and edges
1385 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
1387 //Linear faces and edges
1388 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
1390 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
1392 return SMESH_MesherHelper::QUADRATIC;
1394 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
1396 return SMESH_MesherHelper::LINEAR;
1399 //Mesh with both type of elements
1400 return SMESH_MesherHelper::COMP;
1403 //=======================================================================
1404 //function : GetOtherParam
1405 //purpose : Return an alternative parameter for a node on seam
1406 //=======================================================================
1408 double SMESH_MesherHelper::GetOtherParam(const double param) const
1410 int i = myParIndex & U_periodic ? 0 : 1;
1411 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
1414 //=======================================================================
1415 namespace { // Structures used by FixQuadraticElements()
1416 //=======================================================================
1418 #define __DMP__(txt) \
1420 #define MSG(txt) __DMP__(txt<<endl)
1421 #define MSGBEG(txt) __DMP__(txt)
1423 const double straightTol2 = 1e-33; // to detect straing links
1426 // ---------------------------------------
1428 * \brief Quadratic link knowing its faces
1430 struct QLink: public SMESH_TLink
1432 const SMDS_MeshNode* _mediumNode;
1433 mutable vector<const QFace* > _faces;
1434 mutable gp_Vec _nodeMove;
1435 mutable int _nbMoves;
1437 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
1438 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
1440 //if ( MediumPos() != SMDS_TOP_3DSPACE )
1441 _nodeMove = MediumPnt() - MiddlePnt();
1443 void SetContinuesFaces() const;
1444 const QFace* GetContinuesFace( const QFace* face ) const;
1445 bool OnBoundary() const;
1446 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
1447 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
1449 SMDS_TypeOfPosition MediumPos() const
1450 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
1451 SMDS_TypeOfPosition EndPos(bool isSecond) const
1452 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
1453 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
1454 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
1456 void Move(const gp_Vec& move, bool sum=false) const
1457 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
1458 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
1459 bool IsMoved() const { return (_nbMoves > 0 && !IsStraight()); }
1460 bool IsStraight() const { return _nodeMove.SquareMagnitude() <= straightTol2; }
1462 bool operator<(const QLink& other) const {
1463 return (node1()->GetID() == other.node1()->GetID() ?
1464 node2()->GetID() < other.node2()->GetID() :
1465 node1()->GetID() < other.node1()->GetID());
1467 struct PtrComparator {
1468 bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
1471 // ---------------------------------------------------------
1473 * \brief Link in the chain of links; it connects two faces
1477 const QLink* _qlink;
1478 mutable const QFace* _qfaces[2];
1480 TChainLink(const QLink* qlink=0):_qlink(qlink) {
1481 _qfaces[0] = _qfaces[1] = 0;
1483 void SetFace(const QFace* face) { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
1485 bool IsBoundary() const { return !_qfaces[1]; }
1487 void RemoveFace( const QFace* face ) const
1488 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
1490 const QFace* NextFace( const QFace* f ) const
1491 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
1493 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
1494 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
1496 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
1498 operator bool() const { return (_qlink); }
1500 const QLink* operator->() const { return _qlink; }
1502 gp_Vec Normal() const;
1504 // --------------------------------------------------------------------
1505 typedef list< TChainLink > TChain;
1506 typedef set < TChainLink > TLinkSet;
1507 typedef TLinkSet::const_iterator TLinkInSet;
1509 const int theFirstStep = 5;
1511 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
1512 // --------------------------------------------------------------------
1514 * \brief Face shared by two volumes and bound by QLinks
1516 struct QFace: public TIDSortedElemSet
1518 mutable const SMDS_MeshElement* _volumes[2];
1519 mutable vector< const QLink* > _sides;
1520 mutable bool _sideIsAdded[4]; // added in chain of links
1523 mutable const SMDS_MeshElement* _face;
1526 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
1528 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
1530 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
1532 void AddSelfToLinks() const {
1533 for ( int i = 0; i < _sides.size(); ++i )
1534 _sides[i]->_faces.push_back( this );
1536 int LinkIndex( const QLink* side ) const {
1537 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
1540 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
1542 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
1544 int i = LinkIndex( link._qlink );
1545 if ( i < 0 ) return true;
1546 _sideIsAdded[i] = true;
1547 link.SetFace( this );
1548 // continue from opposite link
1549 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
1551 bool IsBoundary() const { return !_volumes[1]; }
1553 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
1555 TLinkInSet GetBoundaryLink( const TLinkSet& links,
1556 const TChainLink& avoidLink,
1557 TLinkInSet * notBoundaryLink = 0,
1558 const SMDS_MeshNode* nodeToContain = 0,
1559 bool * isAdjacentUsed = 0,
1560 int nbRecursionsLeft = -1) const;
1562 TLinkInSet GetLinkByNode( const TLinkSet& links,
1563 const TChainLink& avoidLink,
1564 const SMDS_MeshNode* nodeToContain) const;
1566 const SMDS_MeshNode* GetNodeInFace() const {
1567 for ( int iL = 0; iL < _sides.size(); ++iL )
1568 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
1572 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
1574 double MoveByBoundary( const TChainLink& theLink,
1575 const gp_Vec& theRefVec,
1576 const TLinkSet& theLinks,
1577 SMESH_MesherHelper* theFaceHelper=0,
1578 const double thePrevLen=0,
1579 const int theStep=theFirstStep,
1580 gp_Vec* theLinkNorm=0,
1581 double theSign=1.0) const;
1584 //================================================================================
1586 * \brief Dump QLink and QFace
1588 ostream& operator << (ostream& out, const QLink& l)
1590 out <<"QLink nodes: "
1591 << l.node1()->GetID() << " - "
1592 << l._mediumNode->GetID() << " - "
1593 << l.node2()->GetID() << endl;
1596 ostream& operator << (ostream& out, const QFace& f)
1598 out <<"QFace nodes: "/*<< &f << " "*/;
1599 for ( TIDSortedElemSet::const_iterator n = f.begin(); n != f.end(); ++n )
1600 out << (*n)->GetID() << " ";
1601 out << " \tvolumes: "
1602 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
1603 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
1604 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
1608 //================================================================================
1610 * \brief Construct QFace from QLinks
1612 //================================================================================
1614 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
1616 _volumes[0] = _volumes[1] = 0;
1618 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
1619 _normal.SetCoord(0,0,0);
1620 for ( int i = 1; i < _sides.size(); ++i ) {
1621 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
1622 insert( l1->node1() ); insert( l1->node2() );
1624 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
1625 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
1626 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
1630 double normSqSize = _normal.SquareMagnitude();
1631 if ( normSqSize > numeric_limits<double>::min() )
1632 _normal /= sqrt( normSqSize );
1634 _normal.SetCoord(1e-33,0,0);
1640 //================================================================================
1642 * \brief Make up chain of links
1643 * \param iSide - link to add first
1644 * \param chain - chain to fill in
1645 * \param pos - postion of medium nodes the links should have
1646 * \param error - out, specifies what is wrong
1647 * \retval bool - false if valid chain can't be built; "valid" means that links
1648 * of the chain belongs to rectangles bounding hexahedrons
1650 //================================================================================
1652 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
1654 if ( iSide >= _sides.size() ) // wrong argument iSide
1656 if ( _sideIsAdded[ iSide ]) // already in chain
1659 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
1661 list< const QFace* > faces( 1, this );
1662 for (list< const QFace* >::iterator fIt = faces.begin(); fIt != faces.end(); ++fIt ) {
1663 const QFace* face = *fIt;
1664 for ( int i = 0; i < face->_sides.size(); ++i ) {
1665 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
1666 face->_sideIsAdded[i] = true;
1667 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
1668 chLink->SetFace( face );
1669 if ( face->_sides[i]->MediumPos() >= pos )
1670 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
1671 faces.push_back( contFace );
1675 if ( error < ERR_TRI )
1679 _sideIsAdded[iSide] = true; // not to add this link to chain again
1680 const QLink* link = _sides[iSide];
1684 // add link into chain
1685 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
1686 chLink->SetFace( this );
1689 // propagate from quadrangle to neighbour faces
1690 if ( link->MediumPos() >= pos ) {
1691 int nbLinkFaces = link->_faces.size();
1692 if ( nbLinkFaces == 4 || nbLinkFaces < 4 && link->OnBoundary()) {
1693 // hexahedral mesh or boundary quadrangles - goto a continous face
1694 if ( const QFace* f = link->GetContinuesFace( this ))
1695 return f->GetLinkChain( *chLink, chain, pos, error );
1698 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
1699 for ( int i = 0; i < nbLinkFaces; ++i )
1700 if ( link->_faces[i] )
1701 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
1702 if ( error < ERR_PRISM )
1710 //================================================================================
1712 * \brief Return a boundary link of the triangle face
1713 * \param links - set of all links
1714 * \param avoidLink - link not to return
1715 * \param notBoundaryLink - out, neither the returned link nor avoidLink
1716 * \param nodeToContain - node the returned link must contain; if provided, search
1717 * also performed on adjacent faces
1718 * \param isAdjacentUsed - returns true if link is found in adjacent faces
1719 * \param nbRecursionsLeft - to limit recursion
1721 //================================================================================
1723 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
1724 const TChainLink& avoidLink,
1725 TLinkInSet * notBoundaryLink,
1726 const SMDS_MeshNode* nodeToContain,
1727 bool * isAdjacentUsed,
1728 int nbRecursionsLeft) const
1730 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
1732 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
1733 TFaceLinkList adjacentFaces;
1735 for ( int iL = 0; iL < _sides.size(); ++iL )
1737 if ( avoidLink._qlink == _sides[iL] )
1739 TLinkInSet link = links.find( _sides[iL] );
1740 if ( link == linksEnd ) continue;
1741 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
1742 continue; // We work on faces here, don't go into a volume
1745 if ( link->IsBoundary() ) {
1746 if ( !nodeToContain ||
1747 (*link)->node1() == nodeToContain ||
1748 (*link)->node2() == nodeToContain )
1750 boundaryLink = link;
1751 if ( !notBoundaryLink ) break;
1754 else if ( notBoundaryLink ) {
1755 *notBoundaryLink = link;
1756 if ( boundaryLink != linksEnd ) break;
1759 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
1760 if ( const QFace* adj = link->NextFace( this ))
1761 if ( adj->Contains( nodeToContain ))
1762 adjacentFaces.push_back( make_pair( adj, link ));
1765 if ( isAdjacentUsed ) *isAdjacentUsed = false;
1766 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
1768 if ( nbRecursionsLeft < 0 )
1769 nbRecursionsLeft = nodeToContain->NbInverseElements();
1770 TFaceLinkList::iterator adj = adjacentFaces.begin();
1771 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
1772 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
1773 isAdjacentUsed, nbRecursionsLeft-1);
1774 if ( isAdjacentUsed ) *isAdjacentUsed = true;
1776 return boundaryLink;
1778 //================================================================================
1780 * \brief Return a link ending at the given node but not avoidLink
1782 //================================================================================
1784 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
1785 const TChainLink& avoidLink,
1786 const SMDS_MeshNode* nodeToContain) const
1788 for ( int i = 0; i < _sides.size(); ++i )
1789 if ( avoidLink._qlink != _sides[i] &&
1790 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
1791 return links.find( _sides[ i ]);
1795 //================================================================================
1797 * \brief Return normal to the i-th side pointing outside the face
1799 //================================================================================
1801 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
1803 gp_Vec norm, vecOut;
1804 // if ( uvHelper ) {
1805 // TopoDS_Face face = TopoDS::Face( uvHelper->GetSubShape());
1806 // const SMDS_MeshNode* inFaceNode = uvHelper->GetNodeUVneedInFaceNode() ? GetNodeInFace() : 0;
1807 // gp_XY uv1 = uvHelper->GetNodeUV( face, _sides[i]->node1(), inFaceNode );
1808 // gp_XY uv2 = uvHelper->GetNodeUV( face, _sides[i]->node2(), inFaceNode );
1809 // norm.SetCoord( uv1.Y() - uv2.Y(), uv2.X() - uv1.X(), 0 );
1811 // const QLink* otherLink = _sides[(i + 1) % _sides.size()];
1812 // const SMDS_MeshNode* otherNode =
1813 // otherLink->node1() == _sides[i]->node1() ? otherLink->node2() : otherLink->node1();
1814 // gp_XY pIn = uvHelper->GetNodeUV( face, otherNode, inFaceNode );
1815 // vecOut.SetCoord( uv1.X() - pIn.X(), uv1.Y() - pIn.Y(), 0 );
1818 norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
1819 gp_XYZ pIn = ( XYZ( _sides[0]->node1() ) +
1820 XYZ( _sides[0]->node2() ) +
1821 XYZ( _sides[1]->node1() )) / 3.;
1822 vecOut.SetXYZ( _sides[i]->MiddlePnt() - pIn );
1824 if ( norm * vecOut < 0 )
1826 double mag2 = norm.SquareMagnitude();
1827 if ( mag2 > numeric_limits<double>::min() )
1828 norm /= sqrt( mag2 );
1831 //================================================================================
1833 * \brief Move medium node of theLink according to its distance from boundary
1834 * \param theLink - link to fix
1835 * \param theRefVec - movement of boundary
1836 * \param theLinks - all adjacent links of continous triangles
1837 * \param theFaceHelper - helper is not used so far
1838 * \param thePrevLen - distance from the boundary
1839 * \param theStep - number of steps till movement propagation limit
1840 * \param theLinkNorm - out normal to theLink
1841 * \param theSign - 1 or -1 depending on movement of boundary
1842 * \retval double - distance from boundary to propagation limit or other boundary
1844 //================================================================================
1846 double QFace::MoveByBoundary( const TChainLink& theLink,
1847 const gp_Vec& theRefVec,
1848 const TLinkSet& theLinks,
1849 SMESH_MesherHelper* theFaceHelper,
1850 const double thePrevLen,
1852 gp_Vec* theLinkNorm,
1853 double theSign) const
1856 return thePrevLen; // propagation limit reached
1858 int iL; // index of theLink
1859 for ( iL = 0; iL < _sides.size(); ++iL )
1860 if ( theLink._qlink == _sides[ iL ])
1863 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
1864 <<" thePrevLen " << thePrevLen);
1865 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
1867 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
1868 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
1869 if ( theStep == theFirstStep )
1870 theSign = refProj < 0. ? -1. : 1.;
1871 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
1872 return thePrevLen; // to propagate movement forward only, not in side dir or backward
1874 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
1875 TLinkInSet link1 = theLinks.find( _sides[iL1] );
1876 TLinkInSet link2 = theLinks.find( _sides[iL2] );
1877 if ( link1 == theLinks.end() || link2 == theLinks.end() )
1879 const QFace* f1 = link1->NextFace( this ); // adjacent faces
1880 const QFace* f2 = link2->NextFace( this );
1882 // propagate to adjacent faces till limit step or boundary
1883 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
1884 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
1885 gp_Vec linkDir1, linkDir2;
1889 len1 = f1->MoveByBoundary
1890 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
1892 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
1894 MSG( " --------------- EXCEPTION");
1900 len2 = f2->MoveByBoundary
1901 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
1903 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
1905 MSG( " --------------- EXCEPTION");
1910 if ( theStep != theFirstStep )
1912 // choose chain length by direction of propagation most codirected with theRefVec
1913 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
1914 fullLen = choose1 ? len1 : len2;
1915 double r = thePrevLen / fullLen;
1917 gp_Vec move = linkNorm * refProj * ( 1 - r );
1918 theLink->Move( move, true );
1920 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
1921 " by " << refProj * ( 1 - r ) << " following " <<
1922 (choose1 ? *link1->_qlink : *link2->_qlink));
1924 if ( theLinkNorm ) *theLinkNorm = linkNorm;
1929 //================================================================================
1931 * \brief Find pairs of continues faces
1933 //================================================================================
1935 void QLink::SetContinuesFaces() const
1937 // x0 x - QLink, [-|] - QFace, v - volume
1939 // | Between _faces of link x2 two vertical faces are continues
1940 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
1941 // | to _faces[0] and _faces[1] and horizontal faces to
1942 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
1945 if ( _faces.empty() )
1948 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
1950 // look for a face bounding none of volumes bound by _faces[0]
1951 bool sameVol = false;
1952 int nbVol = _faces[iF]->NbVolumes();
1953 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
1954 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
1955 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
1959 if ( iFaceCont > 0 ) // continues faces found, set one by the other
1961 if ( iFaceCont != 1 )
1962 std::swap( _faces[1], _faces[iFaceCont] );
1964 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
1966 _faces.insert( ++_faces.begin(), 0 );
1969 //================================================================================
1971 * \brief Return a face continues to the given one
1973 //================================================================================
1975 const QFace* QLink::GetContinuesFace( const QFace* face ) const
1977 for ( int i = 0; i < _faces.size(); ++i ) {
1978 if ( _faces[i] == face ) {
1979 int iF = i < 2 ? 1-i : 5-i;
1980 return iF < _faces.size() ? _faces[iF] : 0;
1985 //================================================================================
1987 * \brief True if link is on mesh boundary
1989 //================================================================================
1991 bool QLink::OnBoundary() const
1993 for ( int i = 0; i < _faces.size(); ++i )
1994 if (_faces[i] && _faces[i]->IsBoundary()) return true;
1997 //================================================================================
1999 * \brief Return normal of link of the chain
2001 //================================================================================
2003 gp_Vec TChainLink::Normal() const {
2005 if (_qfaces[0]) norm = _qfaces[0]->_normal;
2006 if (_qfaces[1]) norm += _qfaces[1]->_normal;
2009 //================================================================================
2011 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
2013 //================================================================================
2015 void fixPrism( TChain& allLinks )
2017 // separate boundary links from internal ones
2018 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
2019 QLinkSet interLinks, bndLinks1, bndLink2;
2021 bool isCurved = false;
2022 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
2023 if ( (*lnk)->OnBoundary() )
2024 bndLinks1.insert( lnk->_qlink );
2026 interLinks.insert( lnk->_qlink );
2027 isCurved = isCurved || !(*lnk)->IsStraight();
2030 return; // no need to move
2032 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
2034 while ( !interLinks.empty() && !curBndLinks->empty() )
2036 // propagate movement from boundary links to connected internal links
2037 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
2038 for ( ; bnd != bndEnd; ++bnd )
2040 const QLink* bndLink = *bnd;
2041 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
2043 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
2044 if ( !face ) continue;
2045 // find and move internal link opposite to bndLink within the face
2046 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
2047 const QLink* interLink = face->_sides[ interInd ];
2048 QLinkSet::iterator pInterLink = interLinks.find( interLink );
2049 if ( pInterLink == interLinks.end() ) continue; // not internal link
2050 interLink->Move( bndLink->_nodeMove );
2051 // treated internal links become new boundary ones
2052 interLinks. erase( pInterLink );
2053 newBndLinks->insert( interLink );
2056 curBndLinks->clear();
2057 std::swap( curBndLinks, newBndLinks );
2061 //================================================================================
2063 * \brief Fix links of continues triangles near curved boundary
2065 //================================================================================
2067 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
2069 if ( allLinks.empty() ) return;
2071 TLinkSet linkSet( allLinks.begin(), allLinks.end());
2072 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
2074 // move in 2d if we are on geom face
2075 // TopoDS_Face face;
2076 // TopLoc_Location loc;
2077 // SMESH_MesherHelper faceHelper( *helper.GetMesh());
2078 // while ( linkIt->IsBoundary()) ++linkIt;
2079 // if ( linkIt == linksEnd ) return;
2080 // if ( (*linkIt)->MediumPos() == SMDS_TOP_FACE ) {
2081 // bool checkPos = true;
2082 // TopoDS_Shape f = helper.GetSubShapeByNode( (*linkIt)->_mediumNode, helper.GetMeshDS() );
2083 // if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE ) {
2084 // face = TopoDS::Face( f );
2085 // helper.GetNodeUV( face, (*linkIt)->_mediumNode, 0, &checkPos);
2089 // faceHelper.SetSubShape( face );
2092 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
2094 if ( linkIt->IsBoundary() && !(*linkIt)->IsStraight() && linkIt->_qfaces[0])
2096 // if ( !face.IsNull() ) {
2097 // const SMDS_MeshNode* inFaceNode =
2098 // faceHelper.GetNodeUVneedInFaceNode() ? linkIt->_qfaces[0]->GetNodeInFace() : 0;
2099 // gp_XY uvm = helper.GetNodeUV( face, (*linkIt)->_mediumNode, inFaceNode );
2100 // gp_XY uv1 = helper.GetNodeUV( face, (*linkIt)->node1(), inFaceNode);
2101 // gp_XY uv2 = helper.GetNodeUV( face, (*linkIt)->node2(), inFaceNode);
2102 // gp_XY uvMove = uvm - helper.GetMiddleUV( BRep_Tool::Surface(face,loc), uv1, uv2);
2103 // gp_Vec move( uvMove.X(), uvMove.Y(), 0 );
2104 // linkIt->_qfaces[0]->MoveByBoundary( *linkIt, move, linkSet, &faceHelper );
2107 linkIt->_qfaces[0]->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
2113 //================================================================================
2115 * \brief Detect rectangular structure of links and build chains from them
2117 //================================================================================
2119 enum TSplitTriaResult {
2120 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
2121 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK };
2123 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
2124 vector< TChain> & resultChains,
2125 SMDS_TypeOfPosition pos )
2127 // put links in the set and evalute number of result chains by number of boundary links
2130 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
2131 linkSet.insert( *lnk );
2132 nbBndLinks += lnk->IsBoundary();
2134 resultChains.clear();
2135 resultChains.reserve( nbBndLinks / 2 );
2137 TLinkInSet linkIt, linksEnd = linkSet.end();
2139 // find a boundary link with corner node; corner node has position pos-2
2140 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
2142 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
2143 const SMDS_MeshNode* corner = 0;
2144 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
2145 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
2150 TLinkInSet startLink = linkIt;
2151 const SMDS_MeshNode* startCorner = corner;
2152 vector< TChain* > rowChains;
2155 while ( startLink != linksEnd) // loop on columns
2157 // We suppose we have a rectangular structure like shown here. We have found a
2158 // corner of the rectangle (startCorner) and a boundary link sharing
2159 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
2160 // --o---o---o structure making several chains at once. One chain (columnChain)
2161 // |\ | /| starts at startLink and continues upward (we look at the structure
2162 // \ | \ | / | from such point that startLink is on the bottom of the structure).
2163 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
2164 // --o---o---o encounter.
2166 // / | \ | \ | startCorner
2171 if ( resultChains.size() == nbBndLinks / 2 )
2173 resultChains.push_back( TChain() );
2174 TChain& columnChain = resultChains.back();
2176 TLinkInSet botLink = startLink; // current horizontal link to go up from
2177 corner = startCorner; // current corner the botLink ends at
2179 while ( botLink != linksEnd ) // loop on rows
2181 // add botLink to the columnChain
2182 columnChain.push_back( *botLink );
2184 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
2186 { // the column ends
2187 linkSet.erase( botLink );
2188 if ( iRow != rowChains.size() )
2189 return _FEW_ROWS; // different nb of rows in columns
2192 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
2193 // link ending at <corner> (sideLink); there are two cases:
2194 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
2195 // since midQuadLink is not at boundary while sideLink is.
2196 // 2) midQuadLink ends at <corner>
2198 TLinkInSet midQuadLink = linksEnd;
2199 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
2201 if ( isCase2 ) { // find midQuadLink among links of botTria
2202 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
2203 if ( midQuadLink->IsBoundary() )
2204 return _BAD_MIDQUAD;
2206 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
2207 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
2210 columnChain.push_back( *midQuadLink );
2211 if ( iRow >= rowChains.size() ) {
2213 return _MANY_ROWS; // different nb of rows in columns
2214 if ( resultChains.size() == nbBndLinks / 2 )
2216 resultChains.push_back( TChain() );
2217 rowChains.push_back( & resultChains.back() );
2219 rowChains[iRow]->push_back( *sideLink );
2220 rowChains[iRow]->push_back( *midQuadLink );
2222 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
2226 // prepare startCorner and startLink for the next column
2227 startCorner = startLink->NextNode( startCorner );
2229 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
2231 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
2232 // check if no more columns remains
2233 if ( startLink != linksEnd ) {
2234 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
2235 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
2236 startLink = linksEnd; // startLink bounds upTria or botTria
2237 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
2241 // find bottom link and corner for the next row
2242 corner = sideLink->NextNode( corner );
2243 // next bottom link ends at the new corner
2244 linkSet.erase( botLink );
2245 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
2246 if ( botLink == linksEnd || botLink == (isCase2 ? midQuadLink : sideLink))
2248 linkSet.erase( midQuadLink );
2249 linkSet.erase( sideLink );
2251 // make faces neighboring the found ones be boundary
2252 if ( startLink != linksEnd ) {
2253 const QFace* tria = isCase2 ? botTria : upTria;
2254 for ( int iL = 0; iL < 3; ++iL ) {
2255 linkIt = linkSet.find( tria->_sides[iL] );
2256 if ( linkIt != linksEnd )
2257 linkIt->RemoveFace( tria );
2260 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
2261 botLink->RemoveFace( upTria ); // make next botTria first in vector
2268 // In the linkSet, there must remain the last links of rowChains; add them
2269 if ( linkSet.size() != rowChains.size() )
2270 return _BAD_SET_SIZE;
2271 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
2272 // find the link (startLink) ending at startCorner
2274 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
2275 if ( (*startLink)->node1() == startCorner ) {
2276 corner = (*startLink)->node2(); break;
2278 else if ( (*startLink)->node2() == startCorner) {
2279 corner = (*startLink)->node1(); break;
2282 if ( startLink == linksEnd )
2284 rowChains[ iRow ]->push_back( *startLink );
2285 linkSet.erase( startLink );
2286 startCorner = corner;
2293 //=======================================================================
2295 * \brief Move medium nodes of faces and volumes to fix distorted elements
2296 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
2298 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
2300 //=======================================================================
2302 void SMESH_MesherHelper::FixQuadraticElements(bool volumeOnly)
2304 // apply algorithm to solids or geom faces
2305 // ----------------------------------------------
2306 if ( myShape.IsNull() ) {
2307 if ( !myMesh->HasShapeToMesh() ) return;
2308 SetSubShape( myMesh->GetShapeToMesh() );
2310 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
2311 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
2312 faces.Add( f.Current() );
2314 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
2315 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
2316 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
2317 faces.Add( f.Current() );
2319 else { // fix nodes in the solid and its faces
2320 SMESH_MesherHelper h(*myMesh);
2321 h.SetSubShape( s.Current() );
2322 h.FixQuadraticElements(false);
2325 // fix nodes on geom faces
2326 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
2327 SMESH_MesherHelper h(*myMesh);
2328 h.SetSubShape( fIt.Key() );
2329 h.FixQuadraticElements(true);
2334 // Find out type of elements and get iterator on them
2335 // ---------------------------------------------------
2337 SMDS_ElemIteratorPtr elemIt;
2338 SMDSAbs_ElementType elemType = SMDSAbs_All;
2340 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
2343 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
2344 elemIt = smDS->GetElements();
2345 if ( elemIt->more() ) {
2346 elemType = elemIt->next()->GetType();
2347 elemIt = smDS->GetElements();
2350 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
2353 // Fill in auxiliary data structures
2354 // ----------------------------------
2358 set< QLink >::iterator pLink;
2359 set< QFace >::iterator pFace;
2361 bool isCurved = false;
2362 bool hasRectFaces = false;
2363 set<int> nbElemNodeSet;
2365 if ( elemType == SMDSAbs_Volume )
2367 SMDS_VolumeTool volTool;
2368 while ( elemIt->more() ) // loop on volumes
2370 const SMDS_MeshElement* vol = elemIt->next();
2371 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
2373 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
2375 int nbN = volTool.NbFaceNodes( iF );
2376 nbElemNodeSet.insert( nbN );
2377 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
2378 vector< const QLink* > faceLinks( nbN/2 );
2379 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
2382 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
2383 pLink = links.insert( link ).first;
2384 faceLinks[ iN/2 ] = & *pLink;
2386 isCurved = !link.IsStraight();
2387 if ( link.MediumPos() == SMDS_TOP_3DSPACE && !link.IsStraight() )
2388 return; // already fixed
2391 pFace = faces.insert( QFace( faceLinks )).first;
2392 if ( pFace->NbVolumes() == 0 )
2393 pFace->AddSelfToLinks();
2394 pFace->SetVolume( vol );
2395 hasRectFaces = hasRectFaces ||
2396 ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
2397 volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
2400 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
2402 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
2403 faceNodes[4],faceNodes[6] );
2407 set< QLink >::iterator pLink = links.begin();
2408 for ( ; pLink != links.end(); ++pLink )
2409 pLink->SetContinuesFaces();
2413 while ( elemIt->more() ) // loop on faces
2415 const SMDS_MeshElement* face = elemIt->next();
2416 if ( !face->IsQuadratic() )
2418 nbElemNodeSet.insert( face->NbNodes() );
2419 int nbN = face->NbNodes()/2;
2420 vector< const QLink* > faceLinks( nbN );
2421 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
2424 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
2425 pLink = links.insert( link ).first;
2426 faceLinks[ iN ] = & *pLink;
2428 isCurved = !link.IsStraight();
2431 pFace = faces.insert( QFace( faceLinks )).first;
2432 pFace->AddSelfToLinks();
2433 hasRectFaces = ( hasRectFaces || nbN == 4 );
2437 return; // no curved edges of faces
2439 // Compute displacement of medium nodes
2440 // -------------------------------------
2442 // two loops on faces: the first is to treat boundary links, the second is for internal ones
2443 TopLoc_Location loc;
2444 // not treat boundary of volumic submesh
2445 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
2446 for ( ; isInside < 2; ++isInside ) {
2447 MSG( "--------------- LOOP " << isInside << " ------------------");
2448 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
2450 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
2451 if ( bool(isInside) == pFace->IsBoundary() )
2453 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from quadrangle
2456 // make chain of links connected via continues faces
2459 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
2461 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
2463 vector< TChain > chains;
2464 if ( error == ERR_OK ) { // chains contains continues rectangles
2466 chains[0].splice( chains[0].begin(), rawChain );
2468 else if ( error == ERR_TRI ) { // chains contains continues triangles
2469 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
2470 if ( res != _OK ) { // not rectangles split into triangles
2471 fixTriaNearBoundary( rawChain, *this );
2475 else if ( error == ERR_PRISM ) { // side faces of prisms
2476 fixPrism( rawChain );
2482 for ( int iC = 0; iC < chains.size(); ++iC )
2484 TChain& chain = chains[iC];
2485 if ( chain.empty() ) continue;
2486 if ( chain.front()->IsStraight() && chain.back()->IsStraight() ) {
2490 // mesure chain length and compute link position along the chain
2491 double chainLen = 0;
2492 vector< double > linkPos;
2493 MSGBEG( "Link medium nodes: ");
2494 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
2495 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
2496 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
2497 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
2498 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
2499 link1 = chain.erase( link1 );
2500 if ( link1 == chain.end() )
2502 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
2505 linkPos.push_back( chainLen );
2508 if ( linkPos.size() < 2 )
2511 gp_Vec move0 = chain.front()->_nodeMove;
2512 gp_Vec move1 = chain.back ()->_nodeMove;
2515 bool checkUV = true;
2517 // compute node displacement of end links in parametric space of face
2518 const SMDS_MeshNode* nodeOnFace = (*(++chain.begin()))->_mediumNode;
2519 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
2520 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE ) {
2521 face = TopoDS::Face( f );
2522 for ( int is1 = 0; is1 < 2; ++is1 ) { // move0 or move1
2523 TChainLink& link = is1 ? chain.back() : chain.front();
2524 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
2525 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
2526 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
2527 gp_XY uvMove = uvm - GetMiddleUV( BRep_Tool::Surface(face,loc), uv1, uv2);
2528 if ( is1 ) move1.SetCoord( uvMove.X(), uvMove.Y(), 0 );
2529 else move0.SetCoord( uvMove.X(), uvMove.Y(), 0 );
2531 if ( move0.SquareMagnitude() < straightTol2 &&
2532 move1.SquareMagnitude() < straightTol2 ) {
2534 continue; // straight - no need to move nodes of internal links
2539 if ( isInside || face.IsNull() )
2541 // compute node displacement of end links in their local coord systems
2543 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
2544 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
2545 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
2546 move0.Transform(trsf);
2549 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
2550 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
2551 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
2552 move1.Transform(trsf);
2555 // compute displacement of medium nodes
2556 link2 = chain.begin();
2559 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
2561 double r = linkPos[i] / chainLen;
2562 // displacement in local coord system
2563 gp_Vec move = (1. - r) * move0 + r * move1;
2564 if ( isInside || face.IsNull()) {
2565 // transform to global
2566 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
2567 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
2568 gp_Vec x = x01.Normalized() + x12.Normalized();
2569 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
2570 move.Transform(trsf);
2573 // compute 3D displacement by 2D one
2574 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
2575 gp_XY newUV = oldUV + gp_XY( move.X(), move.Y() );
2576 gp_Pnt newPnt = BRep_Tool::Surface(face,loc)->Value( newUV.X(), newUV.Y());
2577 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
2579 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
2580 move.SquareMagnitude())
2582 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
2583 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
2584 MSG( "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
2585 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
2586 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
2587 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
2591 (*link1)->Move( move );
2592 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
2593 << chain.front()->_mediumNode->GetID() <<"-"
2594 << chain.back ()->_mediumNode->GetID() <<
2595 " by " << move.Magnitude());
2597 } // loop on chains of links
2598 } // loop on 2 directions of propagation from quadrangle
2605 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
2606 if ( pLink->IsMoved() ) {
2607 //gp_Pnt p = pLink->MediumPnt() + pLink->Move();
2608 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
2609 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());