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 : ~SMESH_MesherHelper
85 //=======================================================================
87 SMESH_MesherHelper::~SMESH_MesherHelper()
89 TID2Projector::iterator i_proj = myFace2Projector.begin();
90 for ( ; i_proj != myFace2Projector.end(); ++i_proj )
91 delete i_proj->second;
94 //=======================================================================
95 //function : IsQuadraticSubMesh
96 //purpose : Check submesh for given shape: if all elements on this shape
97 // are quadratic, quadratic elements will be created.
98 // Also fill myTLinkNodeMap
99 //=======================================================================
101 bool SMESH_MesherHelper::IsQuadraticSubMesh(const TopoDS_Shape& aSh)
103 SMESHDS_Mesh* meshDS = GetMeshDS();
104 // we can create quadratic elements only if all elements
105 // created on subshapes of given shape are quadratic
106 // also we have to fill myTLinkNodeMap
107 myCreateQuadratic = true;
108 mySeamShapeIds.clear();
109 myDegenShapeIds.clear();
110 TopAbs_ShapeEnum subType( aSh.ShapeType()==TopAbs_FACE ? TopAbs_EDGE : TopAbs_FACE );
111 SMDSAbs_ElementType elemType( subType==TopAbs_FACE ? SMDSAbs_Face : SMDSAbs_Edge );
113 int nbOldLinks = myTLinkNodeMap.size();
115 TopExp_Explorer exp( aSh, subType );
116 for (; exp.More() && myCreateQuadratic; exp.Next()) {
117 if ( SMESHDS_SubMesh * subMesh = meshDS->MeshElements( exp.Current() )) {
118 if ( SMDS_ElemIteratorPtr it = subMesh->GetElements() ) {
120 const SMDS_MeshElement* e = it->next();
121 if ( e->GetType() != elemType || !e->IsQuadratic() ) {
122 myCreateQuadratic = false;
127 switch ( e->NbNodes() ) {
129 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(2)); break;
131 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(3));
132 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(4));
133 AddTLinkNode(e->GetNode(2),e->GetNode(0),e->GetNode(5)); break;
135 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(4));
136 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(5));
137 AddTLinkNode(e->GetNode(2),e->GetNode(3),e->GetNode(6));
138 AddTLinkNode(e->GetNode(3),e->GetNode(0),e->GetNode(7));
141 myCreateQuadratic = false;
150 if ( nbOldLinks == myTLinkNodeMap.size() )
151 myCreateQuadratic = false;
153 if(!myCreateQuadratic) {
154 myTLinkNodeMap.clear();
158 return myCreateQuadratic;
161 //=======================================================================
162 //function : SetSubShape
163 //purpose : Set geomerty to make elements on
164 //=======================================================================
166 void SMESH_MesherHelper::SetSubShape(const int aShID)
168 if ( aShID == myShapeID )
171 SetSubShape( GetMeshDS()->IndexToShape( aShID ));
173 SetSubShape( TopoDS_Shape() );
176 //=======================================================================
177 //function : SetSubShape
178 //purpose : Set geomerty to create elements on
179 //=======================================================================
181 void SMESH_MesherHelper::SetSubShape(const TopoDS_Shape& aSh)
183 if ( myShape.IsSame( aSh ))
187 mySeamShapeIds.clear();
188 myDegenShapeIds.clear();
190 if ( myShape.IsNull() ) {
194 SMESHDS_Mesh* meshDS = GetMeshDS();
195 myShapeID = meshDS->ShapeToIndex(aSh);
198 // treatment of periodic faces
199 for ( TopExp_Explorer eF( aSh, TopAbs_FACE ); eF.More(); eF.Next() )
201 const TopoDS_Face& face = TopoDS::Face( eF.Current() );
202 BRepAdaptor_Surface surface( face );
203 if ( surface.IsUPeriodic() || surface.IsVPeriodic() )
205 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
207 // look for a seam edge
208 const TopoDS_Edge& edge = TopoDS::Edge( exp.Current() );
209 if ( BRep_Tool::IsClosed( edge, face )) {
210 // initialize myPar1, myPar2 and myParIndex
212 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
213 if ( Abs( uv1.Coord(1) - uv2.Coord(1) ) < Abs( uv1.Coord(2) - uv2.Coord(2) ))
215 myParIndex |= U_periodic;
216 myPar1[0] = surface.FirstUParameter();
217 myPar2[0] = surface.LastUParameter();
220 myParIndex |= V_periodic;
221 myPar1[1] = surface.FirstVParameter();
222 myPar2[1] = surface.LastVParameter();
224 // store seam shape indices, negative if shape encounters twice
225 int edgeID = meshDS->ShapeToIndex( edge );
226 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
227 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
228 int vertexID = meshDS->ShapeToIndex( v.Current() );
229 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
233 // look for a degenerated edge
234 if ( BRep_Tool::Degenerated( edge )) {
235 myDegenShapeIds.insert( meshDS->ShapeToIndex( edge ));
236 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
237 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
244 //=======================================================================
245 //function : GetNodeUVneedInFaceNode
246 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
247 // Return true if the face is periodic.
248 // If F is Null, answer about subshape set through IsQuadraticSubMesh() or
250 //=======================================================================
252 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
254 if ( F.IsNull() ) return !mySeamShapeIds.empty();
256 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
257 return !mySeamShapeIds.empty();
260 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
261 if ( !aSurface.IsNull() )
262 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
267 //=======================================================================
268 //function : IsMedium
270 //=======================================================================
272 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
273 const SMDSAbs_ElementType typeToCheck)
275 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
278 //=======================================================================
279 //function : GetSubShapeByNode
280 //purpose : Return support shape of a node
281 //=======================================================================
283 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
284 SMESHDS_Mesh* meshDS)
286 int shapeID = node->GetPosition()->GetShapeId();
287 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
288 return meshDS->IndexToShape( shapeID );
290 return TopoDS_Shape();
294 //=======================================================================
295 //function : AddTLinkNode
296 //purpose : add a link in my data structure
297 //=======================================================================
299 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
300 const SMDS_MeshNode* n2,
301 const SMDS_MeshNode* n12)
303 // add new record to map
304 SMESH_TLink link( n1, n2 );
305 myTLinkNodeMap.insert( make_pair(link,n12));
308 //=======================================================================
309 //function : GetUVOnSeam
310 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
311 //=======================================================================
313 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
315 gp_Pnt2d result = uv1;
316 for ( int i = U_periodic; i <= V_periodic ; ++i )
318 if ( myParIndex & i )
320 double p1 = uv1.Coord( i );
321 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
322 if ( myParIndex == i ||
323 dp1 < ( myPar2[i-1] - myPar2[i-1] ) / 100. ||
324 dp2 < ( myPar2[i-1] - myPar2[i-1] ) / 100. )
326 double p2 = uv2.Coord( i );
327 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
328 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
329 result.SetCoord( i, p1Alt );
336 //=======================================================================
337 //function : GetNodeUV
338 //purpose : Return node UV on face
339 //=======================================================================
341 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
342 const SMDS_MeshNode* n,
343 const SMDS_MeshNode* n2,
346 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
347 const SMDS_PositionPtr Pos = n->GetPosition();
349 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
351 // node has position on face
352 const SMDS_FacePosition* fpos =
353 static_cast<const SMDS_FacePosition*>(n->GetPosition().get());
354 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
356 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), BRep_Tool::Tolerance( F ));
358 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
360 // node has position on edge => it is needed to find
361 // corresponding edge from face, get pcurve for this
362 // edge and retrieve value from this pcurve
363 const SMDS_EdgePosition* epos =
364 static_cast<const SMDS_EdgePosition*>(n->GetPosition().get());
365 int edgeID = Pos->GetShapeId();
366 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
367 double f, l, u = epos->GetUParameter();
368 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
369 bool validU = ( f < u && u < l );
371 uv = C2d->Value( u );
374 if ( check || !validU )
375 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), BRep_Tool::Tolerance( E ),/*force=*/ !validU );
377 // for a node on a seam edge select one of UVs on 2 pcurves
378 if ( n2 && IsSeamShape( edgeID ) )
380 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
383 { // adjust uv to period
385 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
386 Standard_Boolean isUPeriodic = S->IsUPeriodic();
387 Standard_Boolean isVPeriodic = S->IsVPeriodic();
388 if ( isUPeriodic || isVPeriodic ) {
389 Standard_Real UF,UL,VF,VL;
390 S->Bounds(UF,UL,VF,VL);
392 uv.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
394 uv.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
398 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
400 if ( int vertexID = n->GetPosition()->GetShapeId() ) {
401 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
403 uv = BRep_Tool::Parameters( V, F );
406 catch (Standard_Failure& exc) {
409 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
410 uvOK = ( V == vert.Current() );
413 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
414 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
416 // get UV of a vertex closest to the node
418 gp_Pnt pn = XYZ( n );
419 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
420 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
421 gp_Pnt p = BRep_Tool::Pnt( curV );
422 double curDist = p.SquareDistance( pn );
423 if ( curDist < dist ) {
425 uv = BRep_Tool::Parameters( curV, F );
426 uvOK = ( dist < DBL_MIN );
432 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
433 for ( ; it.More(); it.Next() ) {
434 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
435 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
437 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
438 if ( !C2d.IsNull() ) {
439 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
440 uv = C2d->Value( u );
448 if ( n2 && IsSeamShape( vertexID ) )
449 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
459 //=======================================================================
460 //function : CheckNodeUV
461 //purpose : Check and fix node UV on a face
462 //=======================================================================
464 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
465 const SMDS_MeshNode* n,
468 const bool force) const
470 if ( force || !myOkNodePosShapes.count( n->GetPosition()->GetShapeId() ))
472 // check that uv is correct
474 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
475 gp_Pnt nodePnt = XYZ( n );
476 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
477 if ( Precision::IsInfinite( uv.X() ) ||
478 Precision::IsInfinite( uv.Y() ) ||
479 nodePnt.Distance( surface->Value( uv.X(), uv.Y() )) > tol )
481 // uv incorrect, project the node to surface
482 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
483 projector.Perform( nodePnt );
484 if ( !projector.IsDone() || projector.NbPoints() < 1 )
486 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
489 Quantity_Parameter U,V;
490 projector.LowerDistanceParameters(U,V);
491 if ( nodePnt.Distance( surface->Value( U, V )) > tol )
493 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
498 else if ( uv.Modulus() > numeric_limits<double>::min() )
500 ((SMESH_MesherHelper*) this)->myOkNodePosShapes.insert( n->GetPosition()->GetShapeId() );
506 //=======================================================================
507 //function : GetProjector
508 //purpose : Return projector intitialized by given face without location, which is returned
509 //=======================================================================
511 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
512 TopLoc_Location& loc,
515 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
516 int faceID = GetMeshDS()->ShapeToIndex( F );
517 TID2Projector& i2proj = const_cast< TID2Projector&>( myFace2Projector );
518 TID2Projector::iterator i_proj = i2proj.find( faceID );
519 if ( i_proj == i2proj.end() )
521 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
522 double U1, U2, V1, V2;
523 surface->Bounds(U1, U2, V1, V2);
524 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
525 proj->Init( surface, U1, U2, V1, V2, tol );
526 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
528 return *( i_proj->second );
533 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
534 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
535 gp_XY_FunPtr(Subtracted);
538 //=======================================================================
539 //function : applyIn2D
540 //purpose : Perform given operation on two 2d points in parameric space of given surface.
541 // It takes into account period of the surface. Use gp_XY_FunPtr macro
542 // to easily define pointer to function of gp_XY class.
543 //=======================================================================
545 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
549 const bool resultInPeriod)
551 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
552 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
553 if ( !isUPeriodic && !isVPeriodic )
556 // move uv2 not far than half-period from uv1
558 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
560 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
563 gp_XY res = fun( uv1, gp_XY(u2,v2) );
565 // move result within period
566 if ( resultInPeriod )
568 Standard_Real UF,UL,VF,VL;
569 surface->Bounds(UF,UL,VF,VL);
571 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
573 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
578 //=======================================================================
579 //function : GetMiddleUV
580 //purpose : Return middle UV taking in account surface period
581 //=======================================================================
583 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
587 return applyIn2D( surface, p1, p2, & AverageUV );
590 //=======================================================================
591 //function : GetNodeU
592 //purpose : Return node U on edge
593 //=======================================================================
595 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
596 const SMDS_MeshNode* n,
600 const SMDS_PositionPtr Pos = n->GetPosition();
601 if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE) {
602 const SMDS_EdgePosition* epos =
603 static_cast<const SMDS_EdgePosition*>(n->GetPosition().get());
604 param = epos->GetUParameter();
606 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX) {
607 SMESHDS_Mesh * meshDS = GetMeshDS();
608 int vertexID = n->GetPosition()->GetShapeId();
609 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
610 param = BRep_Tool::Parameter( V, E );
613 *check = CheckNodeU( E, n, param, BRep_Tool::Tolerance( E ));
617 //=======================================================================
618 //function : CheckNodeU
619 //purpose : Check and fix node U on an edge
620 // Return false if U is bad and could not be fixed
621 //=======================================================================
623 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
624 const SMDS_MeshNode* n,
627 const bool force) const
629 if ( force || !myOkNodePosShapes.count( n->GetPosition()->GetShapeId() ))
631 // check that u is correct
632 TopLoc_Location loc; double f,l;
633 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
634 if ( curve.IsNull() ) // degenerated edge
636 if ( u+tol < f || u-tol > l )
638 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
644 gp_Pnt nodePnt = SMESH_MeshEditor::TNodeXYZ( n );
645 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
646 if ( nodePnt.Distance( curve->Value( u )) > tol )
648 // u incorrect, project the node to the curve
649 GeomAPI_ProjectPointOnCurve projector( nodePnt, curve, f, l );
650 if ( projector.NbPoints() < 1 )
652 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
655 Quantity_Parameter U = projector.LowerDistanceParameter();
656 if ( nodePnt.Distance( curve->Value( U )) > tol )
658 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
663 else if ( fabs( u ) > numeric_limits<double>::min() )
665 ((SMESH_MesherHelper*) this)->myOkNodePosShapes.insert( n->GetPosition()->GetShapeId() );
672 //=======================================================================
673 //function : GetMediumNode
674 //purpose : Return existing or create new medium nodes between given ones
675 //=======================================================================
677 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
678 const SMDS_MeshNode* n2,
681 // Find existing node
683 SMESH_TLink link(n1,n2);
684 ItTLinkNode itLN = myTLinkNodeMap.find( link );
685 if ( itLN != myTLinkNodeMap.end() ) {
686 return (*itLN).second;
689 // Create medium node
692 SMESHDS_Mesh* meshDS = GetMeshDS();
694 // get type of shape for the new medium node
695 int faceID = -1, edgeID = -1;
696 const SMDS_PositionPtr Pos1 = n1->GetPosition();
697 const SMDS_PositionPtr Pos2 = n2->GetPosition();
699 if( myShape.IsNull() )
701 if( Pos1->GetTypeOfPosition()==SMDS_TOP_FACE ) {
702 faceID = Pos1->GetShapeId();
704 else if( Pos2->GetTypeOfPosition()==SMDS_TOP_FACE ) {
705 faceID = Pos2->GetShapeId();
708 if( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE ) {
709 edgeID = Pos1->GetShapeId();
711 if( Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE ) {
712 edgeID = Pos2->GetShapeId();
715 // get positions of the given nodes on shapes
716 TopoDS_Edge E; double u [2];
717 TopoDS_Face F; gp_XY uv[2];
718 bool uvOK[2] = { false, false };
719 TopAbs_ShapeEnum shapeType = myShape.IsNull() ? TopAbs_SHAPE : myShape.ShapeType();
720 if ( faceID>0 || shapeType == TopAbs_FACE)
722 if( myShape.IsNull() )
723 F = TopoDS::Face(meshDS->IndexToShape(faceID));
725 F = TopoDS::Face(myShape);
728 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
729 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
731 else if (edgeID>0 || shapeType == TopAbs_EDGE)
733 if( myShape.IsNull() )
734 E = TopoDS::Edge(meshDS->IndexToShape(edgeID));
736 E = TopoDS::Edge(myShape);
739 u[0] = GetNodeU(E,n1, force3d ? 0 : &uvOK[0]);
740 u[1] = GetNodeU(E,n2, force3d ? 0 : &uvOK[1]);
744 // we try to create medium node using UV parameters of
745 // nodes, else - medium between corresponding 3d points
748 if ( uvOK[0] && uvOK[1] )
750 if ( IsDegenShape( Pos1->GetShapeId() ))
751 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
752 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
753 else if ( IsDegenShape( Pos2->GetShapeId() ))
754 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
755 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
758 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
759 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
760 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
761 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
762 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
763 myTLinkNodeMap.insert(make_pair(link,n12));
767 else if ( !E.IsNull() )
770 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
773 Standard_Boolean isPeriodic = C->IsPeriodic();
776 Standard_Real Period = C->Period();
777 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
778 Standard_Real pmid = (u[0]+p)/2.;
779 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
784 gp_Pnt P = C->Value( U );
785 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
786 meshDS->SetNodeOnEdge(n12, edgeID, U);
787 myTLinkNodeMap.insert(make_pair(link,n12));
793 double x = ( n1->X() + n2->X() )/2.;
794 double y = ( n1->Y() + n2->Y() )/2.;
795 double z = ( n1->Z() + n2->Z() )/2.;
796 n12 = meshDS->AddNode(x,y,z);
799 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
800 CheckNodeUV( F, n12, UV, BRep_Tool::Tolerance( F ), /*force=*/true);
801 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
803 else if ( !E.IsNull() )
805 double U = ( u[0] + u[1] ) / 2.;
806 CheckNodeU( E, n12, U, BRep_Tool::Tolerance( E ), /*force=*/true);
807 meshDS->SetNodeOnEdge(n12, edgeID, U);
811 meshDS->SetNodeInVolume(n12, myShapeID);
813 myTLinkNodeMap.insert( make_pair( link, n12 ));
817 //=======================================================================
819 //purpose : Creates a node
820 //=======================================================================
822 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID)
824 SMESHDS_Mesh * meshDS = GetMeshDS();
825 SMDS_MeshNode* node = 0;
827 node = meshDS->AddNodeWithID( x, y, z, ID );
829 node = meshDS->AddNode( x, y, z );
830 if ( mySetElemOnShape && myShapeID > 0 ) {
831 switch ( myShape.ShapeType() ) {
832 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
833 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
834 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID); break;
835 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID); break;
836 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
843 //=======================================================================
845 //purpose : Creates quadratic or linear edge
846 //=======================================================================
848 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
849 const SMDS_MeshNode* n2,
853 SMESHDS_Mesh * meshDS = GetMeshDS();
855 SMDS_MeshEdge* edge = 0;
856 if (myCreateQuadratic) {
857 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
859 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
861 edge = meshDS->AddEdge(n1, n2, n12);
865 edge = meshDS->AddEdgeWithID(n1, n2, id);
867 edge = meshDS->AddEdge(n1, n2);
870 if ( mySetElemOnShape && myShapeID > 0 )
871 meshDS->SetMeshElementOnShape( edge, myShapeID );
876 //=======================================================================
878 //purpose : Creates quadratic or linear triangle
879 //=======================================================================
881 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
882 const SMDS_MeshNode* n2,
883 const SMDS_MeshNode* n3,
887 SMESHDS_Mesh * meshDS = GetMeshDS();
888 SMDS_MeshFace* elem = 0;
890 if( n1==n2 || n2==n3 || n3==n1 )
893 if(!myCreateQuadratic) {
895 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
897 elem = meshDS->AddFace(n1, n2, n3);
900 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
901 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
902 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
905 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
907 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
909 if ( mySetElemOnShape && myShapeID > 0 )
910 meshDS->SetMeshElementOnShape( elem, myShapeID );
915 //=======================================================================
917 //purpose : Creates quadratic or linear quadrangle
918 //=======================================================================
920 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
921 const SMDS_MeshNode* n2,
922 const SMDS_MeshNode* n3,
923 const SMDS_MeshNode* n4,
927 SMESHDS_Mesh * meshDS = GetMeshDS();
928 SMDS_MeshFace* elem = 0;
931 return AddFace(n1,n3,n4,id,force3d);
934 return AddFace(n1,n2,n4,id,force3d);
937 return AddFace(n1,n2,n3,id,force3d);
940 return AddFace(n1,n2,n4,id,force3d);
943 return AddFace(n1,n2,n3,id,force3d);
946 return AddFace(n1,n2,n3,id,force3d);
949 if(!myCreateQuadratic) {
951 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
953 elem = meshDS->AddFace(n1, n2, n3, n4);
956 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
957 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
958 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
959 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
962 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
964 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
966 if ( mySetElemOnShape && myShapeID > 0 )
967 meshDS->SetMeshElementOnShape( elem, myShapeID );
972 //=======================================================================
973 //function : AddVolume
974 //purpose : Creates quadratic or linear prism
975 //=======================================================================
977 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
978 const SMDS_MeshNode* n2,
979 const SMDS_MeshNode* n3,
980 const SMDS_MeshNode* n4,
981 const SMDS_MeshNode* n5,
982 const SMDS_MeshNode* n6,
986 SMESHDS_Mesh * meshDS = GetMeshDS();
987 SMDS_MeshVolume* elem = 0;
988 if(!myCreateQuadratic) {
990 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
992 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
995 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
996 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
997 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
999 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1000 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1001 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1003 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1004 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1005 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1008 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1009 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1011 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1012 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1014 if ( mySetElemOnShape && myShapeID > 0 )
1015 meshDS->SetMeshElementOnShape( elem, myShapeID );
1020 //=======================================================================
1021 //function : AddVolume
1022 //purpose : Creates quadratic or linear tetrahedron
1023 //=======================================================================
1025 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1026 const SMDS_MeshNode* n2,
1027 const SMDS_MeshNode* n3,
1028 const SMDS_MeshNode* n4,
1032 SMESHDS_Mesh * meshDS = GetMeshDS();
1033 SMDS_MeshVolume* elem = 0;
1034 if(!myCreateQuadratic) {
1036 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1038 elem = meshDS->AddVolume(n1, n2, n3, n4);
1041 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1042 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1043 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1045 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1046 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1047 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1050 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1052 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1054 if ( mySetElemOnShape && myShapeID > 0 )
1055 meshDS->SetMeshElementOnShape( elem, myShapeID );
1060 //=======================================================================
1061 //function : AddVolume
1062 //purpose : Creates quadratic or linear pyramid
1063 //=======================================================================
1065 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1066 const SMDS_MeshNode* n2,
1067 const SMDS_MeshNode* n3,
1068 const SMDS_MeshNode* n4,
1069 const SMDS_MeshNode* n5,
1073 SMDS_MeshVolume* elem = 0;
1074 if(!myCreateQuadratic) {
1076 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1078 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1081 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1082 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1083 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1084 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1086 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1087 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1088 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
1089 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1092 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
1097 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
1099 n15, n25, n35, n45);
1101 if ( mySetElemOnShape && myShapeID > 0 )
1102 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
1107 //=======================================================================
1108 //function : AddVolume
1109 //purpose : Creates quadratic or linear hexahedron
1110 //=======================================================================
1112 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1113 const SMDS_MeshNode* n2,
1114 const SMDS_MeshNode* n3,
1115 const SMDS_MeshNode* n4,
1116 const SMDS_MeshNode* n5,
1117 const SMDS_MeshNode* n6,
1118 const SMDS_MeshNode* n7,
1119 const SMDS_MeshNode* n8,
1123 SMESHDS_Mesh * meshDS = GetMeshDS();
1124 SMDS_MeshVolume* elem = 0;
1125 if(!myCreateQuadratic) {
1127 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
1129 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
1132 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1133 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1134 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1135 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1137 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1138 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
1139 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
1140 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
1142 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1143 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
1144 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
1145 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
1148 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
1149 n12, n23, n34, n41, n56, n67,
1150 n78, n85, n15, n26, n37, n48, id);
1152 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
1153 n12, n23, n34, n41, n56, n67,
1154 n78, n85, n15, n26, n37, n48);
1156 if ( mySetElemOnShape && myShapeID > 0 )
1157 meshDS->SetMeshElementOnShape( elem, myShapeID );
1162 //=======================================================================
1163 //function : LoadNodeColumns
1164 //purpose : Load nodes bound to face into a map of node columns
1165 //=======================================================================
1167 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
1168 const TopoDS_Face& theFace,
1169 const TopoDS_Edge& theBaseEdge,
1170 SMESHDS_Mesh* theMesh)
1172 // get vertices of theBaseEdge
1173 TopoDS_Vertex vfb, vlb, vft; // first and last, bottom and top vertices
1174 TopoDS_Edge eFrw = TopoDS::Edge( theBaseEdge.Oriented( TopAbs_FORWARD ));
1175 TopExp::Vertices( eFrw, vfb, vlb );
1177 // find the other edges of theFace and orientation of e1
1178 TopoDS_Edge e1, e2, eTop;
1179 bool rev1, CumOri = false;
1180 TopExp_Explorer exp( theFace, TopAbs_EDGE );
1182 for ( ; exp.More(); exp.Next() ) {
1183 if ( ++nbEdges > 4 ) {
1184 return false; // more than 4 edges in theFace
1186 TopoDS_Edge e = TopoDS::Edge( exp.Current() );
1187 if ( theBaseEdge.IsSame( e ))
1189 TopoDS_Vertex vCommon;
1190 if ( !TopExp::CommonVertex( theBaseEdge, e, vCommon ))
1192 else if ( vCommon.IsSame( vfb )) {
1194 vft = TopExp::LastVertex( e1, CumOri );
1195 rev1 = vfb.IsSame( vft );
1197 vft = TopExp::FirstVertex( e1, CumOri );
1202 if ( nbEdges < 4 ) {
1203 return false; // less than 4 edges in theFace
1205 if ( e2.IsNull() && vfb.IsSame( vlb ))
1208 // submeshes corresponding to shapes
1209 SMESHDS_SubMesh* smFace = theMesh->MeshElements( theFace );
1210 SMESHDS_SubMesh* smb = theMesh->MeshElements( theBaseEdge );
1211 SMESHDS_SubMesh* smt = theMesh->MeshElements( eTop );
1212 SMESHDS_SubMesh* sm1 = theMesh->MeshElements( e1 );
1213 SMESHDS_SubMesh* sm2 = theMesh->MeshElements( e2 );
1214 SMESHDS_SubMesh* smVfb = theMesh->MeshElements( vfb );
1215 SMESHDS_SubMesh* smVlb = theMesh->MeshElements( vlb );
1216 SMESHDS_SubMesh* smVft = theMesh->MeshElements( vft );
1217 if (!smFace || !smb || !smt || !sm1 || !sm2 || !smVfb || !smVlb || !smVft ) {
1218 RETURN_BAD_RESULT( "NULL submesh " <<smFace<<" "<<smb<<" "<<smt<<" "<<
1219 sm1<<" "<<sm2<<" "<<smVfb<<" "<<smVlb<<" "<<smVft);
1221 if ( smb->NbNodes() != smt->NbNodes() || sm1->NbNodes() != sm2->NbNodes() ) {
1222 RETURN_BAD_RESULT(" Diff nb of nodes on opposite edges" );
1224 if (smVfb->NbNodes() != 1 || smVlb->NbNodes() != 1 || smVft->NbNodes() != 1) {
1225 RETURN_BAD_RESULT("Empty submesh of vertex");
1227 // define whether mesh is quadratic
1228 bool isQuadraticMesh = false;
1229 SMDS_ElemIteratorPtr eIt = smFace->GetElements();
1230 if ( !eIt->more() ) {
1231 RETURN_BAD_RESULT("No elements on the face");
1233 const SMDS_MeshElement* e = eIt->next();
1234 isQuadraticMesh = e->IsQuadratic();
1236 if ( sm1->NbNodes() * smb->NbNodes() != smFace->NbNodes() ) {
1237 // check quadratic case
1238 if ( isQuadraticMesh ) {
1239 // what if there are quadrangles and triangles mixed?
1240 // int n1 = sm1->NbNodes()/2;
1241 // int n2 = smb->NbNodes()/2;
1242 // int n3 = sm1->NbNodes() - n1;
1243 // int n4 = smb->NbNodes() - n2;
1244 // int nf = sm1->NbNodes()*smb->NbNodes() - n3*n4;
1245 // if( nf != smFace->NbNodes() ) {
1246 // MESSAGE( "Wrong nb face nodes: " <<
1247 // sm1->NbNodes()<<" "<<smb->NbNodes()<<" "<<smFace->NbNodes());
1252 RETURN_BAD_RESULT( "Wrong nb face nodes: " <<
1253 sm1->NbNodes()<<" "<<smb->NbNodes()<<" "<<smFace->NbNodes());
1257 int vsize = sm1->NbNodes() + 2;
1258 int hsize = smb->NbNodes() + 2;
1259 if(isQuadraticMesh) {
1260 vsize = vsize - sm1->NbNodes()/2 -1;
1261 hsize = hsize - smb->NbNodes()/2 -1;
1264 // load nodes from theBaseEdge
1266 std::set<const SMDS_MeshNode*> loadedNodes;
1267 const SMDS_MeshNode* nullNode = 0;
1269 std::vector<const SMDS_MeshNode*> & nVecf = theParam2ColumnMap[ 0.];
1270 nVecf.resize( vsize, nullNode );
1271 loadedNodes.insert( nVecf[ 0 ] = smVfb->GetNodes()->next() );
1273 std::vector<const SMDS_MeshNode*> & nVecl = theParam2ColumnMap[ 1.];
1274 nVecl.resize( vsize, nullNode );
1275 loadedNodes.insert( nVecl[ 0 ] = smVlb->GetNodes()->next() );
1278 BRep_Tool::Range( eFrw, f, l );
1279 double range = l - f;
1280 SMDS_NodeIteratorPtr nIt = smb->GetNodes();
1281 const SMDS_MeshNode* node;
1282 while ( nIt->more() ) {
1284 if(IsMedium(node, SMDSAbs_Edge))
1286 const SMDS_EdgePosition* pos =
1287 dynamic_cast<const SMDS_EdgePosition*>( node->GetPosition().get() );
1291 double u = ( pos->GetUParameter() - f ) / range;
1292 std::vector<const SMDS_MeshNode*> & nVec = theParam2ColumnMap[ u ];
1293 nVec.resize( vsize, nullNode );
1294 loadedNodes.insert( nVec[ 0 ] = node );
1296 if ( theParam2ColumnMap.size() != hsize ) {
1297 RETURN_BAD_RESULT( "Wrong node positions on theBaseEdge" );
1300 // load nodes from e1
1302 std::map< double, const SMDS_MeshNode*> sortedNodes; // sort by param on edge
1303 nIt = sm1->GetNodes();
1304 while ( nIt->more() ) {
1308 const SMDS_EdgePosition* pos =
1309 dynamic_cast<const SMDS_EdgePosition*>( node->GetPosition().get() );
1313 sortedNodes.insert( std::make_pair( pos->GetUParameter(), node ));
1315 loadedNodes.insert( nVecf[ vsize - 1 ] = smVft->GetNodes()->next() );
1316 std::map< double, const SMDS_MeshNode*>::iterator u_n = sortedNodes.begin();
1317 int row = rev1 ? vsize - 1 : 0;
1318 int dRow = rev1 ? -1 : +1;
1319 for ( ; u_n != sortedNodes.end(); u_n++ ) {
1321 loadedNodes.insert( nVecf[ row ] = u_n->second );
1324 // try to load the rest nodes
1326 // get all faces from theFace
1327 TIDSortedElemSet allFaces, foundFaces;
1328 eIt = smFace->GetElements();
1329 while ( eIt->more() ) {
1330 const SMDS_MeshElement* e = eIt->next();
1331 if ( e->GetType() == SMDSAbs_Face )
1332 allFaces.insert( e );
1334 // Starting from 2 neighbour nodes on theBaseEdge, look for a face
1335 // the nodes belong to, and between the nodes of the found face,
1336 // look for a not loaded node considering this node to be the next
1337 // in a column of the starting second node. Repeat, starting
1338 // from nodes next to the previous starting nodes in their columns,
1339 // and so on while a face can be found. Then go the the next pair
1340 // of nodes on theBaseEdge.
1341 TParam2ColumnMap::iterator par_nVec_1 = theParam2ColumnMap.begin();
1342 TParam2ColumnMap::iterator par_nVec_2 = par_nVec_1;
1345 for ( par_nVec_2++; par_nVec_2 != theParam2ColumnMap.end(); par_nVec_1++, par_nVec_2++ ) {
1348 const SMDS_MeshNode* n1 = par_nVec_1->second[ row ];
1349 const SMDS_MeshNode* n2 = par_nVec_2->second[ row ];
1350 const SMDS_MeshElement* face = 0;
1351 bool lastColOnClosedFace = ( nVecf[ row ] == n2 );
1353 // look for a face by 2 nodes
1354 face = SMESH_MeshEditor::FindFaceInSet( n1, n2, allFaces, foundFaces );
1356 int nbFaceNodes = face->NbNodes();
1357 if ( face->IsQuadratic() )
1359 if ( nbFaceNodes>4 ) {
1360 RETURN_BAD_RESULT(" Too many nodes in a face: " << nbFaceNodes );
1362 // look for a not loaded node of the <face>
1364 const SMDS_MeshNode* n3 = 0; // a node defferent from n1 and n2
1365 for ( int i = 0; i < nbFaceNodes && !found; ++i ) {
1366 node = face->GetNode( i );
1367 found = loadedNodes.insert( node ).second;
1368 if ( !found && node != n1 && node != n2 )
1371 if ( lastColOnClosedFace && row + 1 < vsize ) {
1372 node = nVecf[ row + 1 ];
1373 found = ( face->GetNodeIndex( node ) >= 0 );
1376 if ( ++row > vsize - 1 ) {
1377 RETURN_BAD_RESULT( "Too many nodes in column "<< col <<": "<< row+1);
1379 par_nVec_2->second[ row ] = node;
1380 foundFaces.insert( face );
1382 if ( nbFaceNodes==4 ) {
1383 n1 = par_nVec_1->second[ row ];
1386 else if ( nbFaceNodes==3 && n3 == par_nVec_1->second[ row + 1 ] ) {
1390 RETURN_BAD_RESULT( "Not quad mesh, column "<< col );
1394 while ( face && n1 && n2 );
1396 if ( row < vsize - 1 ) {
1397 MESSAGE( "Too few nodes in column "<< col <<": "<< row+1);
1398 MESSAGE( "Base node 1: "<< par_nVec_1->second[0]);
1399 MESSAGE( "Base node 2: "<< par_nVec_2->second[0]);
1400 if ( n1 ) { MESSAGE( "Current node 1: "<< n1); }
1401 else { MESSAGE( "Current node 1: NULL"); }
1402 if ( n2 ) { MESSAGE( "Current node 2: "<< n2); }
1403 else { MESSAGE( "Current node 2: NULL"); }
1404 MESSAGE( "first base node: "<< theParam2ColumnMap.begin()->second[0]);
1405 MESSAGE( "last base node: "<< theParam2ColumnMap.rbegin()->second[0]);
1408 } // loop on columns
1413 //=======================================================================
1414 //function : NbAncestors
1415 //purpose : Return number of unique ancestors of the shape
1416 //=======================================================================
1418 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
1419 const SMESH_Mesh& mesh,
1420 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
1422 TopTools_MapOfShape ancestors;
1423 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
1424 for ( ; ansIt.More(); ansIt.Next() ) {
1425 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
1426 ancestors.Add( ansIt.Value() );
1428 return ancestors.Extent();
1431 //=======================================================================
1432 //function : GetSubShapeOri
1433 //purpose : Return orientation of sub-shape in the main shape
1434 //=======================================================================
1436 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
1437 const TopoDS_Shape& subShape)
1439 TopAbs_Orientation ori = TopAbs_Orientation(-1);
1440 if ( !shape.IsNull() && !subShape.IsNull() )
1442 TopExp_Explorer e( shape, subShape.ShapeType() );
1443 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
1444 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
1445 for ( ; e.More(); e.Next())
1446 if ( subShape.IsSame( e.Current() ))
1449 ori = e.Current().Orientation();
1454 //=======================================================================
1455 //function : IsSubShape
1457 //=======================================================================
1459 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
1460 const TopoDS_Shape& mainShape )
1462 if ( !shape.IsNull() && !mainShape.IsNull() )
1464 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
1467 if ( shape.IsSame( exp.Current() ))
1470 SCRUTE((shape.IsNull()));
1471 SCRUTE((mainShape.IsNull()));
1475 //=======================================================================
1476 //function : IsSubShape
1478 //=======================================================================
1480 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
1482 if ( shape.IsNull() || !aMesh )
1485 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
1487 shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape );
1490 //=======================================================================
1491 //function : IsQuadraticMesh
1492 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
1493 // quadratic elements will be created.
1494 // Used then generated 3D mesh without geometry.
1495 //=======================================================================
1497 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
1499 int NbAllEdgsAndFaces=0;
1500 int NbQuadFacesAndEdgs=0;
1501 int NbFacesAndEdges=0;
1502 //All faces and edges
1503 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
1505 //Quadratic faces and edges
1506 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
1508 //Linear faces and edges
1509 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
1511 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
1513 return SMESH_MesherHelper::QUADRATIC;
1515 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
1517 return SMESH_MesherHelper::LINEAR;
1520 //Mesh with both type of elements
1521 return SMESH_MesherHelper::COMP;
1524 //=======================================================================
1525 //function : GetOtherParam
1526 //purpose : Return an alternative parameter for a node on seam
1527 //=======================================================================
1529 double SMESH_MesherHelper::GetOtherParam(const double param) const
1531 int i = myParIndex & U_periodic ? 0 : 1;
1532 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
1535 //=======================================================================
1536 namespace { // Structures used by FixQuadraticElements()
1537 //=======================================================================
1539 #define __DMP__(txt) \
1541 #define MSG(txt) __DMP__(txt<<endl)
1542 #define MSGBEG(txt) __DMP__(txt)
1544 const double straightTol2 = 1e-33; // to detect straing links
1547 // ---------------------------------------
1549 * \brief Quadratic link knowing its faces
1551 struct QLink: public SMESH_TLink
1553 const SMDS_MeshNode* _mediumNode;
1554 mutable vector<const QFace* > _faces;
1555 mutable gp_Vec _nodeMove;
1556 mutable int _nbMoves;
1558 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
1559 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
1561 //if ( MediumPos() != SMDS_TOP_3DSPACE )
1562 _nodeMove = MediumPnt() - MiddlePnt();
1564 void SetContinuesFaces() const;
1565 const QFace* GetContinuesFace( const QFace* face ) const;
1566 bool OnBoundary() const;
1567 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
1568 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
1570 SMDS_TypeOfPosition MediumPos() const
1571 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
1572 SMDS_TypeOfPosition EndPos(bool isSecond) const
1573 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
1574 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
1575 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
1577 void Move(const gp_Vec& move, bool sum=false) const
1578 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
1579 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
1580 bool IsMoved() const { return (_nbMoves > 0 && !IsStraight()); }
1581 bool IsStraight() const { return _nodeMove.SquareMagnitude() <= straightTol2; }
1583 bool operator<(const QLink& other) const {
1584 return (node1()->GetID() == other.node1()->GetID() ?
1585 node2()->GetID() < other.node2()->GetID() :
1586 node1()->GetID() < other.node1()->GetID());
1588 struct PtrComparator {
1589 bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
1592 // ---------------------------------------------------------
1594 * \brief Link in the chain of links; it connects two faces
1598 const QLink* _qlink;
1599 mutable const QFace* _qfaces[2];
1601 TChainLink(const QLink* qlink=0):_qlink(qlink) {
1602 _qfaces[0] = _qfaces[1] = 0;
1604 void SetFace(const QFace* face) { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
1606 bool IsBoundary() const { return !_qfaces[1]; }
1608 void RemoveFace( const QFace* face ) const
1609 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
1611 const QFace* NextFace( const QFace* f ) const
1612 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
1614 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
1615 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
1617 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
1619 operator bool() const { return (_qlink); }
1621 const QLink* operator->() const { return _qlink; }
1623 gp_Vec Normal() const;
1625 // --------------------------------------------------------------------
1626 typedef list< TChainLink > TChain;
1627 typedef set < TChainLink > TLinkSet;
1628 typedef TLinkSet::const_iterator TLinkInSet;
1630 const int theFirstStep = 5;
1632 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
1633 // --------------------------------------------------------------------
1635 * \brief Face shared by two volumes and bound by QLinks
1637 struct QFace: public TIDSortedElemSet
1639 mutable const SMDS_MeshElement* _volumes[2];
1640 mutable vector< const QLink* > _sides;
1641 mutable bool _sideIsAdded[4]; // added in chain of links
1644 mutable const SMDS_MeshElement* _face;
1647 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
1649 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
1651 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
1653 void AddSelfToLinks() const {
1654 for ( int i = 0; i < _sides.size(); ++i )
1655 _sides[i]->_faces.push_back( this );
1657 int LinkIndex( const QLink* side ) const {
1658 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
1661 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
1663 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
1665 int i = LinkIndex( link._qlink );
1666 if ( i < 0 ) return true;
1667 _sideIsAdded[i] = true;
1668 link.SetFace( this );
1669 // continue from opposite link
1670 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
1672 bool IsBoundary() const { return !_volumes[1]; }
1674 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
1676 TLinkInSet GetBoundaryLink( const TLinkSet& links,
1677 const TChainLink& avoidLink,
1678 TLinkInSet * notBoundaryLink = 0,
1679 const SMDS_MeshNode* nodeToContain = 0,
1680 bool * isAdjacentUsed = 0,
1681 int nbRecursionsLeft = -1) const;
1683 TLinkInSet GetLinkByNode( const TLinkSet& links,
1684 const TChainLink& avoidLink,
1685 const SMDS_MeshNode* nodeToContain) const;
1687 const SMDS_MeshNode* GetNodeInFace() const {
1688 for ( int iL = 0; iL < _sides.size(); ++iL )
1689 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
1693 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
1695 double MoveByBoundary( const TChainLink& theLink,
1696 const gp_Vec& theRefVec,
1697 const TLinkSet& theLinks,
1698 SMESH_MesherHelper* theFaceHelper=0,
1699 const double thePrevLen=0,
1700 const int theStep=theFirstStep,
1701 gp_Vec* theLinkNorm=0,
1702 double theSign=1.0) const;
1705 //================================================================================
1707 * \brief Dump QLink and QFace
1709 ostream& operator << (ostream& out, const QLink& l)
1711 out <<"QLink nodes: "
1712 << l.node1()->GetID() << " - "
1713 << l._mediumNode->GetID() << " - "
1714 << l.node2()->GetID() << endl;
1717 ostream& operator << (ostream& out, const QFace& f)
1719 out <<"QFace nodes: "/*<< &f << " "*/;
1720 for ( TIDSortedElemSet::const_iterator n = f.begin(); n != f.end(); ++n )
1721 out << (*n)->GetID() << " ";
1722 out << " \tvolumes: "
1723 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
1724 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
1725 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
1729 //================================================================================
1731 * \brief Construct QFace from QLinks
1733 //================================================================================
1735 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
1737 _volumes[0] = _volumes[1] = 0;
1739 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
1740 _normal.SetCoord(0,0,0);
1741 for ( int i = 1; i < _sides.size(); ++i ) {
1742 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
1743 insert( l1->node1() ); insert( l1->node2() );
1745 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
1746 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
1747 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
1751 double normSqSize = _normal.SquareMagnitude();
1752 if ( normSqSize > numeric_limits<double>::min() )
1753 _normal /= sqrt( normSqSize );
1755 _normal.SetCoord(1e-33,0,0);
1761 //================================================================================
1763 * \brief Make up chain of links
1764 * \param iSide - link to add first
1765 * \param chain - chain to fill in
1766 * \param pos - postion of medium nodes the links should have
1767 * \param error - out, specifies what is wrong
1768 * \retval bool - false if valid chain can't be built; "valid" means that links
1769 * of the chain belongs to rectangles bounding hexahedrons
1771 //================================================================================
1773 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
1775 if ( iSide >= _sides.size() ) // wrong argument iSide
1777 if ( _sideIsAdded[ iSide ]) // already in chain
1780 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
1782 list< const QFace* > faces( 1, this );
1783 for (list< const QFace* >::iterator fIt = faces.begin(); fIt != faces.end(); ++fIt ) {
1784 const QFace* face = *fIt;
1785 for ( int i = 0; i < face->_sides.size(); ++i ) {
1786 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
1787 face->_sideIsAdded[i] = true;
1788 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
1789 chLink->SetFace( face );
1790 if ( face->_sides[i]->MediumPos() >= pos )
1791 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
1792 faces.push_back( contFace );
1796 if ( error < ERR_TRI )
1800 _sideIsAdded[iSide] = true; // not to add this link to chain again
1801 const QLink* link = _sides[iSide];
1805 // add link into chain
1806 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
1807 chLink->SetFace( this );
1810 // propagate from quadrangle to neighbour faces
1811 if ( link->MediumPos() >= pos ) {
1812 int nbLinkFaces = link->_faces.size();
1813 if ( nbLinkFaces == 4 || nbLinkFaces < 4 && link->OnBoundary()) {
1814 // hexahedral mesh or boundary quadrangles - goto a continous face
1815 if ( const QFace* f = link->GetContinuesFace( this ))
1816 return f->GetLinkChain( *chLink, chain, pos, error );
1819 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
1820 for ( int i = 0; i < nbLinkFaces; ++i )
1821 if ( link->_faces[i] )
1822 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
1823 if ( error < ERR_PRISM )
1831 //================================================================================
1833 * \brief Return a boundary link of the triangle face
1834 * \param links - set of all links
1835 * \param avoidLink - link not to return
1836 * \param notBoundaryLink - out, neither the returned link nor avoidLink
1837 * \param nodeToContain - node the returned link must contain; if provided, search
1838 * also performed on adjacent faces
1839 * \param isAdjacentUsed - returns true if link is found in adjacent faces
1840 * \param nbRecursionsLeft - to limit recursion
1842 //================================================================================
1844 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
1845 const TChainLink& avoidLink,
1846 TLinkInSet * notBoundaryLink,
1847 const SMDS_MeshNode* nodeToContain,
1848 bool * isAdjacentUsed,
1849 int nbRecursionsLeft) const
1851 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
1853 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
1854 TFaceLinkList adjacentFaces;
1856 for ( int iL = 0; iL < _sides.size(); ++iL )
1858 if ( avoidLink._qlink == _sides[iL] )
1860 TLinkInSet link = links.find( _sides[iL] );
1861 if ( link == linksEnd ) continue;
1862 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
1863 continue; // We work on faces here, don't go into a volume
1866 if ( link->IsBoundary() ) {
1867 if ( !nodeToContain ||
1868 (*link)->node1() == nodeToContain ||
1869 (*link)->node2() == nodeToContain )
1871 boundaryLink = link;
1872 if ( !notBoundaryLink ) break;
1875 else if ( notBoundaryLink ) {
1876 *notBoundaryLink = link;
1877 if ( boundaryLink != linksEnd ) break;
1880 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
1881 if ( const QFace* adj = link->NextFace( this ))
1882 if ( adj->Contains( nodeToContain ))
1883 adjacentFaces.push_back( make_pair( adj, link ));
1886 if ( isAdjacentUsed ) *isAdjacentUsed = false;
1887 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
1889 if ( nbRecursionsLeft < 0 )
1890 nbRecursionsLeft = nodeToContain->NbInverseElements();
1891 TFaceLinkList::iterator adj = adjacentFaces.begin();
1892 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
1893 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
1894 isAdjacentUsed, nbRecursionsLeft-1);
1895 if ( isAdjacentUsed ) *isAdjacentUsed = true;
1897 return boundaryLink;
1899 //================================================================================
1901 * \brief Return a link ending at the given node but not avoidLink
1903 //================================================================================
1905 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
1906 const TChainLink& avoidLink,
1907 const SMDS_MeshNode* nodeToContain) const
1909 for ( int i = 0; i < _sides.size(); ++i )
1910 if ( avoidLink._qlink != _sides[i] &&
1911 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
1912 return links.find( _sides[ i ]);
1916 //================================================================================
1918 * \brief Return normal to the i-th side pointing outside the face
1920 //================================================================================
1922 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
1924 gp_Vec norm, vecOut;
1925 // if ( uvHelper ) {
1926 // TopoDS_Face face = TopoDS::Face( uvHelper->GetSubShape());
1927 // const SMDS_MeshNode* inFaceNode = uvHelper->GetNodeUVneedInFaceNode() ? GetNodeInFace() : 0;
1928 // gp_XY uv1 = uvHelper->GetNodeUV( face, _sides[i]->node1(), inFaceNode );
1929 // gp_XY uv2 = uvHelper->GetNodeUV( face, _sides[i]->node2(), inFaceNode );
1930 // norm.SetCoord( uv1.Y() - uv2.Y(), uv2.X() - uv1.X(), 0 );
1932 // const QLink* otherLink = _sides[(i + 1) % _sides.size()];
1933 // const SMDS_MeshNode* otherNode =
1934 // otherLink->node1() == _sides[i]->node1() ? otherLink->node2() : otherLink->node1();
1935 // gp_XY pIn = uvHelper->GetNodeUV( face, otherNode, inFaceNode );
1936 // vecOut.SetCoord( uv1.X() - pIn.X(), uv1.Y() - pIn.Y(), 0 );
1939 norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
1940 gp_XYZ pIn = ( XYZ( _sides[0]->node1() ) +
1941 XYZ( _sides[0]->node2() ) +
1942 XYZ( _sides[1]->node1() )) / 3.;
1943 vecOut.SetXYZ( _sides[i]->MiddlePnt() - pIn );
1945 if ( norm * vecOut < 0 )
1947 double mag2 = norm.SquareMagnitude();
1948 if ( mag2 > numeric_limits<double>::min() )
1949 norm /= sqrt( mag2 );
1952 //================================================================================
1954 * \brief Move medium node of theLink according to its distance from boundary
1955 * \param theLink - link to fix
1956 * \param theRefVec - movement of boundary
1957 * \param theLinks - all adjacent links of continous triangles
1958 * \param theFaceHelper - helper is not used so far
1959 * \param thePrevLen - distance from the boundary
1960 * \param theStep - number of steps till movement propagation limit
1961 * \param theLinkNorm - out normal to theLink
1962 * \param theSign - 1 or -1 depending on movement of boundary
1963 * \retval double - distance from boundary to propagation limit or other boundary
1965 //================================================================================
1967 double QFace::MoveByBoundary( const TChainLink& theLink,
1968 const gp_Vec& theRefVec,
1969 const TLinkSet& theLinks,
1970 SMESH_MesherHelper* theFaceHelper,
1971 const double thePrevLen,
1973 gp_Vec* theLinkNorm,
1974 double theSign) const
1977 return thePrevLen; // propagation limit reached
1979 int iL; // index of theLink
1980 for ( iL = 0; iL < _sides.size(); ++iL )
1981 if ( theLink._qlink == _sides[ iL ])
1984 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
1985 <<" thePrevLen " << thePrevLen);
1986 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
1988 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
1989 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
1990 if ( theStep == theFirstStep )
1991 theSign = refProj < 0. ? -1. : 1.;
1992 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
1993 return thePrevLen; // to propagate movement forward only, not in side dir or backward
1995 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
1996 TLinkInSet link1 = theLinks.find( _sides[iL1] );
1997 TLinkInSet link2 = theLinks.find( _sides[iL2] );
1998 if ( link1 == theLinks.end() || link2 == theLinks.end() )
2000 const QFace* f1 = link1->NextFace( this ); // adjacent faces
2001 const QFace* f2 = link2->NextFace( this );
2003 // propagate to adjacent faces till limit step or boundary
2004 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
2005 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
2006 gp_Vec linkDir1, linkDir2;
2010 len1 = f1->MoveByBoundary
2011 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
2013 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
2015 MSG( " --------------- EXCEPTION");
2021 len2 = f2->MoveByBoundary
2022 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
2024 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
2026 MSG( " --------------- EXCEPTION");
2031 if ( theStep != theFirstStep )
2033 // choose chain length by direction of propagation most codirected with theRefVec
2034 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
2035 fullLen = choose1 ? len1 : len2;
2036 double r = thePrevLen / fullLen;
2038 gp_Vec move = linkNorm * refProj * ( 1 - r );
2039 theLink->Move( move, true );
2041 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
2042 " by " << refProj * ( 1 - r ) << " following " <<
2043 (choose1 ? *link1->_qlink : *link2->_qlink));
2045 if ( theLinkNorm ) *theLinkNorm = linkNorm;
2050 //================================================================================
2052 * \brief Find pairs of continues faces
2054 //================================================================================
2056 void QLink::SetContinuesFaces() const
2058 // x0 x - QLink, [-|] - QFace, v - volume
2060 // | Between _faces of link x2 two vertical faces are continues
2061 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
2062 // | to _faces[0] and _faces[1] and horizontal faces to
2063 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
2066 if ( _faces.empty() )
2069 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
2071 // look for a face bounding none of volumes bound by _faces[0]
2072 bool sameVol = false;
2073 int nbVol = _faces[iF]->NbVolumes();
2074 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
2075 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
2076 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
2080 if ( iFaceCont > 0 ) // continues faces found, set one by the other
2082 if ( iFaceCont != 1 )
2083 std::swap( _faces[1], _faces[iFaceCont] );
2085 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
2087 _faces.insert( ++_faces.begin(), 0 );
2090 //================================================================================
2092 * \brief Return a face continues to the given one
2094 //================================================================================
2096 const QFace* QLink::GetContinuesFace( const QFace* face ) const
2098 for ( int i = 0; i < _faces.size(); ++i ) {
2099 if ( _faces[i] == face ) {
2100 int iF = i < 2 ? 1-i : 5-i;
2101 return iF < _faces.size() ? _faces[iF] : 0;
2106 //================================================================================
2108 * \brief True if link is on mesh boundary
2110 //================================================================================
2112 bool QLink::OnBoundary() const
2114 for ( int i = 0; i < _faces.size(); ++i )
2115 if (_faces[i] && _faces[i]->IsBoundary()) return true;
2118 //================================================================================
2120 * \brief Return normal of link of the chain
2122 //================================================================================
2124 gp_Vec TChainLink::Normal() const {
2126 if (_qfaces[0]) norm = _qfaces[0]->_normal;
2127 if (_qfaces[1]) norm += _qfaces[1]->_normal;
2130 //================================================================================
2132 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
2134 //================================================================================
2136 void fixPrism( TChain& allLinks )
2138 // separate boundary links from internal ones
2139 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
2140 QLinkSet interLinks, bndLinks1, bndLink2;
2142 bool isCurved = false;
2143 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
2144 if ( (*lnk)->OnBoundary() )
2145 bndLinks1.insert( lnk->_qlink );
2147 interLinks.insert( lnk->_qlink );
2148 isCurved = isCurved || !(*lnk)->IsStraight();
2151 return; // no need to move
2153 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
2155 while ( !interLinks.empty() && !curBndLinks->empty() )
2157 // propagate movement from boundary links to connected internal links
2158 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
2159 for ( ; bnd != bndEnd; ++bnd )
2161 const QLink* bndLink = *bnd;
2162 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
2164 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
2165 if ( !face ) continue;
2166 // find and move internal link opposite to bndLink within the face
2167 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
2168 const QLink* interLink = face->_sides[ interInd ];
2169 QLinkSet::iterator pInterLink = interLinks.find( interLink );
2170 if ( pInterLink == interLinks.end() ) continue; // not internal link
2171 interLink->Move( bndLink->_nodeMove );
2172 // treated internal links become new boundary ones
2173 interLinks. erase( pInterLink );
2174 newBndLinks->insert( interLink );
2177 curBndLinks->clear();
2178 std::swap( curBndLinks, newBndLinks );
2182 //================================================================================
2184 * \brief Fix links of continues triangles near curved boundary
2186 //================================================================================
2188 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
2190 if ( allLinks.empty() ) return;
2192 TLinkSet linkSet( allLinks.begin(), allLinks.end());
2193 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
2195 // move in 2d if we are on geom face
2196 // TopoDS_Face face;
2197 // TopLoc_Location loc;
2198 // SMESH_MesherHelper faceHelper( *helper.GetMesh());
2199 // while ( linkIt->IsBoundary()) ++linkIt;
2200 // if ( linkIt == linksEnd ) return;
2201 // if ( (*linkIt)->MediumPos() == SMDS_TOP_FACE ) {
2202 // bool checkPos = true;
2203 // TopoDS_Shape f = helper.GetSubShapeByNode( (*linkIt)->_mediumNode, helper.GetMeshDS() );
2204 // if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE ) {
2205 // face = TopoDS::Face( f );
2206 // helper.GetNodeUV( face, (*linkIt)->_mediumNode, 0, &checkPos);
2210 // faceHelper.SetSubShape( face );
2213 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
2215 if ( linkIt->IsBoundary() && !(*linkIt)->IsStraight() && linkIt->_qfaces[0])
2217 // if ( !face.IsNull() ) {
2218 // const SMDS_MeshNode* inFaceNode =
2219 // faceHelper.GetNodeUVneedInFaceNode() ? linkIt->_qfaces[0]->GetNodeInFace() : 0;
2220 // gp_XY uvm = helper.GetNodeUV( face, (*linkIt)->_mediumNode, inFaceNode );
2221 // gp_XY uv1 = helper.GetNodeUV( face, (*linkIt)->node1(), inFaceNode);
2222 // gp_XY uv2 = helper.GetNodeUV( face, (*linkIt)->node2(), inFaceNode);
2223 // gp_XY uvMove = uvm - helper.GetMiddleUV( BRep_Tool::Surface(face,loc), uv1, uv2);
2224 // gp_Vec move( uvMove.X(), uvMove.Y(), 0 );
2225 // linkIt->_qfaces[0]->MoveByBoundary( *linkIt, move, linkSet, &faceHelper );
2228 linkIt->_qfaces[0]->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
2234 //================================================================================
2236 * \brief Detect rectangular structure of links and build chains from them
2238 //================================================================================
2240 enum TSplitTriaResult {
2241 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
2242 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK };
2244 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
2245 vector< TChain> & resultChains,
2246 SMDS_TypeOfPosition pos )
2248 // put links in the set and evalute number of result chains by number of boundary links
2251 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
2252 linkSet.insert( *lnk );
2253 nbBndLinks += lnk->IsBoundary();
2255 resultChains.clear();
2256 resultChains.reserve( nbBndLinks / 2 );
2258 TLinkInSet linkIt, linksEnd = linkSet.end();
2260 // find a boundary link with corner node; corner node has position pos-2
2261 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
2263 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
2264 const SMDS_MeshNode* corner = 0;
2265 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
2266 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
2271 TLinkInSet startLink = linkIt;
2272 const SMDS_MeshNode* startCorner = corner;
2273 vector< TChain* > rowChains;
2276 while ( startLink != linksEnd) // loop on columns
2278 // We suppose we have a rectangular structure like shown here. We have found a
2279 // corner of the rectangle (startCorner) and a boundary link sharing
2280 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
2281 // --o---o---o structure making several chains at once. One chain (columnChain)
2282 // |\ | /| starts at startLink and continues upward (we look at the structure
2283 // \ | \ | / | from such point that startLink is on the bottom of the structure).
2284 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
2285 // --o---o---o encounter.
2287 // / | \ | \ | startCorner
2292 if ( resultChains.size() == nbBndLinks / 2 )
2294 resultChains.push_back( TChain() );
2295 TChain& columnChain = resultChains.back();
2297 TLinkInSet botLink = startLink; // current horizontal link to go up from
2298 corner = startCorner; // current corner the botLink ends at
2300 while ( botLink != linksEnd ) // loop on rows
2302 // add botLink to the columnChain
2303 columnChain.push_back( *botLink );
2305 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
2307 { // the column ends
2308 linkSet.erase( botLink );
2309 if ( iRow != rowChains.size() )
2310 return _FEW_ROWS; // different nb of rows in columns
2313 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
2314 // link ending at <corner> (sideLink); there are two cases:
2315 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
2316 // since midQuadLink is not at boundary while sideLink is.
2317 // 2) midQuadLink ends at <corner>
2319 TLinkInSet midQuadLink = linksEnd;
2320 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
2322 if ( isCase2 ) { // find midQuadLink among links of botTria
2323 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
2324 if ( midQuadLink->IsBoundary() )
2325 return _BAD_MIDQUAD;
2327 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
2328 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
2331 columnChain.push_back( *midQuadLink );
2332 if ( iRow >= rowChains.size() ) {
2334 return _MANY_ROWS; // different nb of rows in columns
2335 if ( resultChains.size() == nbBndLinks / 2 )
2337 resultChains.push_back( TChain() );
2338 rowChains.push_back( & resultChains.back() );
2340 rowChains[iRow]->push_back( *sideLink );
2341 rowChains[iRow]->push_back( *midQuadLink );
2343 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
2347 // prepare startCorner and startLink for the next column
2348 startCorner = startLink->NextNode( startCorner );
2350 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
2352 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
2353 // check if no more columns remains
2354 if ( startLink != linksEnd ) {
2355 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
2356 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
2357 startLink = linksEnd; // startLink bounds upTria or botTria
2358 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
2362 // find bottom link and corner for the next row
2363 corner = sideLink->NextNode( corner );
2364 // next bottom link ends at the new corner
2365 linkSet.erase( botLink );
2366 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
2367 if ( botLink == linksEnd || botLink == (isCase2 ? midQuadLink : sideLink))
2369 linkSet.erase( midQuadLink );
2370 linkSet.erase( sideLink );
2372 // make faces neighboring the found ones be boundary
2373 if ( startLink != linksEnd ) {
2374 const QFace* tria = isCase2 ? botTria : upTria;
2375 for ( int iL = 0; iL < 3; ++iL ) {
2376 linkIt = linkSet.find( tria->_sides[iL] );
2377 if ( linkIt != linksEnd )
2378 linkIt->RemoveFace( tria );
2381 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
2382 botLink->RemoveFace( upTria ); // make next botTria first in vector
2389 // In the linkSet, there must remain the last links of rowChains; add them
2390 if ( linkSet.size() != rowChains.size() )
2391 return _BAD_SET_SIZE;
2392 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
2393 // find the link (startLink) ending at startCorner
2395 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
2396 if ( (*startLink)->node1() == startCorner ) {
2397 corner = (*startLink)->node2(); break;
2399 else if ( (*startLink)->node2() == startCorner) {
2400 corner = (*startLink)->node1(); break;
2403 if ( startLink == linksEnd )
2405 rowChains[ iRow ]->push_back( *startLink );
2406 linkSet.erase( startLink );
2407 startCorner = corner;
2414 //=======================================================================
2416 * \brief Move medium nodes of faces and volumes to fix distorted elements
2417 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
2419 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
2421 //=======================================================================
2423 void SMESH_MesherHelper::FixQuadraticElements(bool volumeOnly)
2425 // apply algorithm to solids or geom faces
2426 // ----------------------------------------------
2427 if ( myShape.IsNull() ) {
2428 if ( !myMesh->HasShapeToMesh() ) return;
2429 SetSubShape( myMesh->GetShapeToMesh() );
2431 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
2432 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
2433 faces.Add( f.Current() );
2435 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
2436 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
2437 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
2438 faces.Add( f.Current() );
2440 else { // fix nodes in the solid and its faces
2441 SMESH_MesherHelper h(*myMesh);
2442 h.SetSubShape( s.Current() );
2443 h.FixQuadraticElements(false);
2446 // fix nodes on geom faces
2447 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
2448 SMESH_MesherHelper h(*myMesh);
2449 h.SetSubShape( fIt.Key() );
2450 h.FixQuadraticElements(true);
2455 // Find out type of elements and get iterator on them
2456 // ---------------------------------------------------
2458 SMDS_ElemIteratorPtr elemIt;
2459 SMDSAbs_ElementType elemType = SMDSAbs_All;
2461 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
2464 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
2465 elemIt = smDS->GetElements();
2466 if ( elemIt->more() ) {
2467 elemType = elemIt->next()->GetType();
2468 elemIt = smDS->GetElements();
2471 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
2474 // Fill in auxiliary data structures
2475 // ----------------------------------
2479 set< QLink >::iterator pLink;
2480 set< QFace >::iterator pFace;
2482 bool isCurved = false;
2483 bool hasRectFaces = false;
2484 set<int> nbElemNodeSet;
2486 if ( elemType == SMDSAbs_Volume )
2488 SMDS_VolumeTool volTool;
2489 while ( elemIt->more() ) // loop on volumes
2491 const SMDS_MeshElement* vol = elemIt->next();
2492 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
2494 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
2496 int nbN = volTool.NbFaceNodes( iF );
2497 nbElemNodeSet.insert( nbN );
2498 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
2499 vector< const QLink* > faceLinks( nbN/2 );
2500 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
2503 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
2504 pLink = links.insert( link ).first;
2505 faceLinks[ iN/2 ] = & *pLink;
2507 isCurved = !link.IsStraight();
2508 if ( link.MediumPos() == SMDS_TOP_3DSPACE && !link.IsStraight() )
2509 return; // already fixed
2512 pFace = faces.insert( QFace( faceLinks )).first;
2513 if ( pFace->NbVolumes() == 0 )
2514 pFace->AddSelfToLinks();
2515 pFace->SetVolume( vol );
2516 hasRectFaces = hasRectFaces ||
2517 ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
2518 volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
2521 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
2523 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
2524 faceNodes[4],faceNodes[6] );
2528 set< QLink >::iterator pLink = links.begin();
2529 for ( ; pLink != links.end(); ++pLink )
2530 pLink->SetContinuesFaces();
2534 while ( elemIt->more() ) // loop on faces
2536 const SMDS_MeshElement* face = elemIt->next();
2537 if ( !face->IsQuadratic() )
2539 nbElemNodeSet.insert( face->NbNodes() );
2540 int nbN = face->NbNodes()/2;
2541 vector< const QLink* > faceLinks( nbN );
2542 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
2545 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
2546 pLink = links.insert( link ).first;
2547 faceLinks[ iN ] = & *pLink;
2549 isCurved = !link.IsStraight();
2552 pFace = faces.insert( QFace( faceLinks )).first;
2553 pFace->AddSelfToLinks();
2554 hasRectFaces = ( hasRectFaces || nbN == 4 );
2558 return; // no curved edges of faces
2560 // Compute displacement of medium nodes
2561 // -------------------------------------
2563 // two loops on faces: the first is to treat boundary links, the second is for internal ones
2564 TopLoc_Location loc;
2565 // not treat boundary of volumic submesh
2566 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
2567 for ( ; isInside < 2; ++isInside ) {
2568 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
2569 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
2571 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
2572 if ( bool(isInside) == pFace->IsBoundary() )
2574 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from quadrangle
2577 // make chain of links connected via continues faces
2580 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
2582 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
2584 vector< TChain > chains;
2585 if ( error == ERR_OK ) { // chain contains continues rectangles
2587 chains[0].splice( chains[0].begin(), rawChain );
2589 else if ( error == ERR_TRI ) { // chain contains continues triangles
2590 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
2591 if ( res != _OK ) { // not quadrangles split into triangles
2592 fixTriaNearBoundary( rawChain, *this );
2596 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
2597 fixPrism( rawChain );
2603 for ( int iC = 0; iC < chains.size(); ++iC )
2605 TChain& chain = chains[iC];
2606 if ( chain.empty() ) continue;
2607 if ( chain.front()->IsStraight() && chain.back()->IsStraight() ) {
2611 // mesure chain length and compute link position along the chain
2612 double chainLen = 0;
2613 vector< double > linkPos;
2614 MSGBEG( "Link medium nodes: ");
2615 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
2616 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
2617 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
2618 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
2619 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
2620 link1 = chain.erase( link1 );
2621 if ( link1 == chain.end() )
2623 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
2626 linkPos.push_back( chainLen );
2629 if ( linkPos.size() < 2 )
2632 gp_Vec move0 = chain.front()->_nodeMove;
2633 gp_Vec move1 = chain.back ()->_nodeMove;
2636 bool checkUV = true;
2638 // compute node displacement of end links in parametric space of face
2639 const SMDS_MeshNode* nodeOnFace = (*(++chain.begin()))->_mediumNode;
2640 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
2641 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
2643 face = TopoDS::Face( f );
2644 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
2645 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
2647 TChainLink& link = is1 ? chain.back() : chain.front();
2648 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
2649 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
2650 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
2651 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
2652 // uvMove = uvm - uv12
2653 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
2654 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
2656 if ( move0.SquareMagnitude() < straightTol2 &&
2657 move1.SquareMagnitude() < straightTol2 ) {
2659 continue; // straight - no need to move nodes of internal links
2664 if ( isInside || face.IsNull() )
2666 // compute node displacement of end links in their local coord systems
2668 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
2669 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
2670 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
2671 move0.Transform(trsf);
2674 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
2675 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
2676 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
2677 move1.Transform(trsf);
2680 // compute displacement of medium nodes
2681 link2 = chain.begin();
2684 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
2686 double r = linkPos[i] / chainLen;
2687 // displacement in local coord system
2688 gp_Vec move = (1. - r) * move0 + r * move1;
2689 if ( isInside || face.IsNull()) {
2690 // transform to global
2691 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
2692 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
2693 gp_Vec x = x01.Normalized() + x12.Normalized();
2694 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
2695 move.Transform(trsf);
2698 // compute 3D displacement by 2D one
2699 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
2700 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
2701 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
2702 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
2703 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
2705 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
2706 move.SquareMagnitude())
2708 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
2709 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
2710 MSG( "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
2711 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
2712 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
2713 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
2717 (*link1)->Move( move );
2718 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
2719 << chain.front()->_mediumNode->GetID() <<"-"
2720 << chain.back ()->_mediumNode->GetID() <<
2721 " by " << move.Magnitude());
2723 } // loop on chains of links
2724 } // loop on 2 directions of propagation from quadrangle
2731 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
2732 if ( pLink->IsMoved() ) {
2733 //gp_Pnt p = pLink->MediumPnt() + pLink->Move();
2734 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
2735 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
2740 //=======================================================================
2742 * \brief Iterator on ancestors of the given type
2744 //=======================================================================
2746 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
2748 TopTools_ListIteratorOfListOfShape _ancIter;
2749 TopAbs_ShapeEnum _type;
2750 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
2751 : _ancIter( ancestors ), _type( type )
2753 if ( _ancIter.More() && _ancIter.Value().ShapeType() != _type ) next();
2757 return _ancIter.More();
2759 virtual const TopoDS_Shape* next()
2761 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
2762 if ( _ancIter.More() )
2763 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
2764 if ( _ancIter.Value().ShapeType() == _type )
2770 //=======================================================================
2772 * \brief Return iterator on ancestors of the given type
2774 //=======================================================================
2776 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
2777 const SMESH_Mesh& mesh,
2778 TopAbs_ShapeEnum ancestorType)
2780 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));