1 // Copyright (C) 2007-2013 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 // File: SMESH_MesherHelper.cxx
24 // Created: 15.02.06 15:22:41
25 // Author: Sergey KUUL
27 #include "SMESH_MesherHelper.hxx"
29 #include "SMDS_EdgePosition.hxx"
30 #include "SMDS_FaceOfNodes.hxx"
31 #include "SMDS_FacePosition.hxx"
32 #include "SMDS_IteratorOnIterators.hxx"
33 #include "SMDS_VolumeTool.hxx"
34 #include "SMESH_Block.hxx"
35 #include "SMESH_MeshAlgos.hxx"
36 #include "SMESH_ProxyMesh.hxx"
37 #include "SMESH_subMesh.hxx"
39 #include <BRepAdaptor_Curve.hxx>
40 #include <BRepAdaptor_Surface.hxx>
41 #include <BRepTools.hxx>
42 #include <BRep_Tool.hxx>
43 #include <Geom2d_Curve.hxx>
44 #include <GeomAPI_ProjectPointOnCurve.hxx>
45 #include <GeomAPI_ProjectPointOnSurf.hxx>
46 #include <Geom_Curve.hxx>
47 #include <Geom_RectangularTrimmedSurface.hxx>
48 #include <Geom_Surface.hxx>
49 #include <ShapeAnalysis.hxx>
51 #include <TopExp_Explorer.hxx>
52 #include <TopTools_ListIteratorOfListOfShape.hxx>
53 #include <TopTools_MapIteratorOfMapOfShape.hxx>
54 #include <TopTools_MapOfShape.hxx>
57 #include <gp_Pnt2d.hxx>
58 #include <gp_Trsf.hxx>
60 #include <Standard_Failure.hxx>
61 #include <Standard_ErrorHandler.hxx>
63 #include <utilities.h>
69 #define RETURN_BAD_RESULT(msg) { MESSAGE(msg); return false; }
73 gp_XYZ XYZ(const SMDS_MeshNode* n) { return gp_XYZ(n->X(), n->Y(), n->Z()); }
75 enum { U_periodic = 1, V_periodic = 2 };
78 //================================================================================
82 //================================================================================
84 SMESH_MesherHelper::SMESH_MesherHelper(SMESH_Mesh& theMesh)
88 myCreateQuadratic(false),
89 myCreateBiQuadratic(false),
90 myFixNodeParameters(false)
92 myPar1[0] = myPar2[0] = myPar1[1] = myPar2[1] = 0;
93 mySetElemOnShape = ( ! myMesh->HasShapeToMesh() );
96 //=======================================================================
97 //function : ~SMESH_MesherHelper
99 //=======================================================================
101 SMESH_MesherHelper::~SMESH_MesherHelper()
104 TID2ProjectorOnSurf::iterator i_proj = myFace2Projector.begin();
105 for ( ; i_proj != myFace2Projector.end(); ++i_proj )
106 delete i_proj->second;
109 TID2ProjectorOnCurve::iterator i_proj = myEdge2Projector.begin();
110 for ( ; i_proj != myEdge2Projector.end(); ++i_proj )
111 delete i_proj->second;
115 //=======================================================================
116 //function : IsQuadraticSubMesh
117 //purpose : Check submesh for given shape: if all elements on this shape
118 // are quadratic, quadratic elements will be created.
119 // Also fill myTLinkNodeMap
120 //=======================================================================
122 bool SMESH_MesherHelper::IsQuadraticSubMesh(const TopoDS_Shape& aSh)
124 SMESHDS_Mesh* meshDS = GetMeshDS();
125 // we can create quadratic elements only if all elements
126 // created on sub-shapes of given shape are quadratic
127 // also we have to fill myTLinkNodeMap
128 myCreateQuadratic = true;
129 mySeamShapeIds.clear();
130 myDegenShapeIds.clear();
131 TopAbs_ShapeEnum subType( aSh.ShapeType()==TopAbs_FACE ? TopAbs_EDGE : TopAbs_FACE );
132 if ( aSh.ShapeType()==TopAbs_COMPOUND )
134 TopoDS_Iterator subIt( aSh );
136 subType = ( subIt.Value().ShapeType()==TopAbs_FACE ) ? TopAbs_EDGE : TopAbs_FACE;
138 SMDSAbs_ElementType elemType( subType==TopAbs_FACE ? SMDSAbs_Face : SMDSAbs_Edge );
141 int nbOldLinks = myTLinkNodeMap.size();
143 if ( !myMesh->HasShapeToMesh() )
145 if (( myCreateQuadratic = myMesh->NbFaces( ORDER_QUADRATIC )))
147 SMDS_FaceIteratorPtr fIt = meshDS->facesIterator();
148 while ( fIt->more() )
149 AddTLinks( static_cast< const SMDS_MeshFace* >( fIt->next() ));
154 TopExp_Explorer exp( aSh, subType );
155 TopTools_MapOfShape checkedSubShapes;
156 for (; exp.More() && myCreateQuadratic; exp.Next()) {
157 if ( !checkedSubShapes.Add( exp.Current() ))
158 continue; // needed if aSh is compound of solids
159 if ( SMESHDS_SubMesh * subMesh = meshDS->MeshElements( exp.Current() )) {
160 if ( SMDS_ElemIteratorPtr it = subMesh->GetElements() ) {
162 const SMDS_MeshElement* e = it->next();
163 if ( e->GetType() != elemType || !e->IsQuadratic() ) {
164 myCreateQuadratic = false;
169 switch ( e->NbCornerNodes() ) {
171 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(2)); break;
173 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(3));
174 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(4));
175 AddTLinkNode(e->GetNode(2),e->GetNode(0),e->GetNode(5)); break;
177 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(4));
178 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(5));
179 AddTLinkNode(e->GetNode(2),e->GetNode(3),e->GetNode(6));
180 AddTLinkNode(e->GetNode(3),e->GetNode(0),e->GetNode(7));
183 myCreateQuadratic = false;
193 if ( nbOldLinks == myTLinkNodeMap.size() )
194 myCreateQuadratic = false;
196 if(!myCreateQuadratic) {
197 myTLinkNodeMap.clear();
201 return myCreateQuadratic;
204 //=======================================================================
205 //function : SetSubShape
206 //purpose : Set geometry to make elements on
207 //=======================================================================
209 void SMESH_MesherHelper::SetSubShape(const int aShID)
211 if ( aShID == myShapeID )
214 SetSubShape( GetMeshDS()->IndexToShape( aShID ));
216 SetSubShape( TopoDS_Shape() );
219 //=======================================================================
220 //function : SetSubShape
221 //purpose : Set geometry to create elements on
222 //=======================================================================
224 void SMESH_MesherHelper::SetSubShape(const TopoDS_Shape& aSh)
226 if ( myShape.IsSame( aSh ))
230 mySeamShapeIds.clear();
231 myDegenShapeIds.clear();
233 if ( myShape.IsNull() ) {
237 SMESHDS_Mesh* meshDS = GetMeshDS();
238 myShapeID = meshDS->ShapeToIndex(aSh);
241 // treatment of periodic faces
242 for ( TopExp_Explorer eF( aSh, TopAbs_FACE ); eF.More(); eF.Next() )
244 const TopoDS_Face& face = TopoDS::Face( eF.Current() );
246 Handle(Geom_Surface) surface = BRep_Tool::Surface( face, loc );
248 if ( surface->IsUPeriodic() || surface->IsVPeriodic() ||
249 surface->IsUClosed() || surface->IsVClosed() )
251 //while ( surface->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
252 //surface = Handle(Geom_RectangularTrimmedSurface)::DownCast( surface )->BasisSurface();
253 GeomAdaptor_Surface surf( surface );
255 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
257 // look for a seam edge
258 const TopoDS_Edge& edge = TopoDS::Edge( exp.Current() );
259 if ( BRep_Tool::IsClosed( edge, face )) {
260 // initialize myPar1, myPar2 and myParIndex
262 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
263 if ( Abs( uv1.Coord(1) - uv2.Coord(1) ) < Abs( uv1.Coord(2) - uv2.Coord(2) ))
265 myParIndex |= U_periodic;
266 myPar1[0] = surf.FirstUParameter();
267 myPar2[0] = surf.LastUParameter();
270 myParIndex |= V_periodic;
271 myPar1[1] = surf.FirstVParameter();
272 myPar2[1] = surf.LastVParameter();
274 // store seam shape indices, negative if shape encounters twice
275 int edgeID = meshDS->ShapeToIndex( edge );
276 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
277 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
278 int vertexID = meshDS->ShapeToIndex( v.Current() );
279 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
283 // look for a degenerated edge
284 if ( BRep_Tool::Degenerated( edge )) {
285 myDegenShapeIds.insert( meshDS->ShapeToIndex( edge ));
286 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
287 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
290 if ( !myDegenShapeIds.empty() && !myParIndex ) {
291 if ( surface->IsUPeriodic() || surface->IsUClosed() ) {
292 myParIndex |= U_periodic;
293 myPar1[0] = surf.FirstUParameter();
294 myPar2[0] = surf.LastUParameter();
296 else if ( surface->IsVPeriodic() || surface->IsVClosed() ) {
297 myParIndex |= V_periodic;
298 myPar1[1] = surf.FirstVParameter();
299 myPar2[1] = surf.LastVParameter();
306 //=======================================================================
307 //function : GetNodeUVneedInFaceNode
308 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
309 // Return true if the face is periodic.
310 // If F is Null, answer about sub-shape set through IsQuadraticSubMesh() or
312 //=======================================================================
314 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
316 if ( F.IsNull() ) return !mySeamShapeIds.empty();
318 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
319 return !mySeamShapeIds.empty();
322 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
323 if ( !aSurface.IsNull() )
324 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
329 //=======================================================================
330 //function : IsMedium
332 //=======================================================================
334 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
335 const SMDSAbs_ElementType typeToCheck)
337 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
340 //=======================================================================
341 //function : GetSubShapeByNode
342 //purpose : Return support shape of a node
343 //=======================================================================
345 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
346 const SMESHDS_Mesh* meshDS)
348 int shapeID = node ? node->getshapeId() : 0;
349 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
350 return meshDS->IndexToShape( shapeID );
352 return TopoDS_Shape();
356 //=======================================================================
357 //function : AddTLinkNode
358 //purpose : add a link in my data structure
359 //=======================================================================
361 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
362 const SMDS_MeshNode* n2,
363 const SMDS_MeshNode* n12)
365 // add new record to map
366 SMESH_TLink link( n1, n2 );
367 myTLinkNodeMap.insert( make_pair(link,n12));
370 //================================================================================
372 * \brief Add quadratic links of edge to own data structure
374 //================================================================================
376 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
378 if ( edge->IsQuadratic() )
379 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
382 //================================================================================
384 * \brief Add quadratic links of face to own data structure
386 //================================================================================
388 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
391 switch ( f->NbNodes() ) {
393 // myMapWithCentralNode.insert
394 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2) ),
396 // break; -- add medium nodes as well
398 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
399 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
400 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
403 // myMapWithCentralNode.insert
404 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2),f->GetNode(3) ),
406 // break; -- add medium nodes as well
408 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
409 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
410 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
411 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7)); break;
416 //================================================================================
418 * \brief Add quadratic links of volume to own data structure
420 //================================================================================
422 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
424 if ( volume->IsQuadratic() )
426 SMDS_VolumeTool vTool( volume );
427 const SMDS_MeshNode** nodes = vTool.GetNodes();
429 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
431 const int nbN = vTool.NbFaceNodes( iF );
432 const int* iNodes = vTool.GetFaceNodesIndices( iF );
433 for ( int i = 0; i < nbN; )
435 int iN1 = iNodes[i++];
436 int iN12 = iNodes[i++];
438 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
439 int linkID = iN1 * vTool.NbNodes() + iN2;
440 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
441 if ( it_isNew.second )
442 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
444 addedLinks.erase( it_isNew.first ); // each link encounters only twice
446 if ( vTool.NbNodes() == 27 )
448 const SMDS_MeshNode* nFCenter = nodes[ vTool.GetCenterNodeIndex( iF )];
449 if ( nFCenter->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
450 myMapWithCentralNode.insert
451 ( make_pair( TBiQuad( nodes[ iNodes[0]], nodes[ iNodes[1]],
452 nodes[ iNodes[2]], nodes[ iNodes[3]] ),
459 //================================================================================
461 * \brief Return true if position of nodes on the shape hasn't yet been checked or
462 * the positions proved to be invalid
464 //================================================================================
466 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
468 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
469 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
472 //================================================================================
474 * \brief Set validity of positions of nodes on the shape.
475 * Once set, validity is not changed
477 //================================================================================
479 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
481 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok));
484 //=======================================================================
485 //function : ToFixNodeParameters
486 //purpose : Enables fixing node parameters on EDGEs and FACEs in
487 // GetNodeU(...,check=true), GetNodeUV(...,check=true), CheckNodeUV() and
488 // CheckNodeU() in case if a node lies on a shape set via SetSubShape().
490 //=======================================================================
492 void SMESH_MesherHelper::ToFixNodeParameters(bool toFix)
494 myFixNodeParameters = toFix;
498 //=======================================================================
499 //function : GetUVOnSeam
500 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
501 //=======================================================================
503 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
505 gp_Pnt2d result = uv1;
506 for ( int i = U_periodic; i <= V_periodic ; ++i )
508 if ( myParIndex & i )
510 double p1 = uv1.Coord( i );
511 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
512 if ( myParIndex == i ||
513 dp1 < ( myPar2[i-1] - myPar2[i-1] ) / 100. ||
514 dp2 < ( myPar2[i-1] - myPar2[i-1] ) / 100. )
516 double p2 = uv2.Coord( i );
517 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
518 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
519 result.SetCoord( i, p1Alt );
526 //=======================================================================
527 //function : GetNodeUV
528 //purpose : Return node UV on face
529 //=======================================================================
531 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
532 const SMDS_MeshNode* n,
533 const SMDS_MeshNode* n2,
536 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
538 const SMDS_PositionPtr Pos = n->GetPosition();
540 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
542 // node has position on face
543 const SMDS_FacePosition* fpos =
544 static_cast<const SMDS_FacePosition*>(n->GetPosition());
545 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
547 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
549 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
551 // node has position on edge => it is needed to find
552 // corresponding edge from face, get pcurve for this
553 // edge and retrieve value from this pcurve
554 const SMDS_EdgePosition* epos =
555 static_cast<const SMDS_EdgePosition*>(n->GetPosition());
556 int edgeID = n->getshapeId();
557 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
558 double f, l, u = epos->GetUParameter();
559 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
560 bool validU = ( f < u && u < l );
562 uv = C2d->Value( u );
564 uv.SetCoord( Precision::Infinite(),0.);
565 if ( check || !validU )
566 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ),/*force=*/ !validU );
568 // for a node on a seam edge select one of UVs on 2 pcurves
569 if ( n2 && IsSeamShape( edgeID ) )
571 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
574 { // adjust uv to period
576 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
577 Standard_Boolean isUPeriodic = S->IsUPeriodic();
578 Standard_Boolean isVPeriodic = S->IsVPeriodic();
579 if ( isUPeriodic || isVPeriodic ) {
580 Standard_Real UF,UL,VF,VL;
581 S->Bounds(UF,UL,VF,VL);
583 uv.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
585 uv.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
589 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
591 if ( int vertexID = n->getshapeId() ) {
592 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
594 uv = BRep_Tool::Parameters( V, F );
597 catch (Standard_Failure& exc) {
600 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
601 uvOK = ( V == vert.Current() );
604 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
605 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
607 // get UV of a vertex closest to the node
609 gp_Pnt pn = XYZ( n );
610 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
611 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
612 gp_Pnt p = BRep_Tool::Pnt( curV );
613 double curDist = p.SquareDistance( pn );
614 if ( curDist < dist ) {
616 uv = BRep_Tool::Parameters( curV, F );
617 uvOK = ( dist < DBL_MIN );
623 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
624 for ( ; it.More(); it.Next() ) {
625 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
626 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
628 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
629 if ( !C2d.IsNull() ) {
630 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
631 uv = C2d->Value( u );
639 if ( n2 && IsSeamShape( vertexID ) )
640 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
645 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
654 //=======================================================================
655 //function : CheckNodeUV
656 //purpose : Check and fix node UV on a face
657 //=======================================================================
659 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
660 const SMDS_MeshNode* n,
664 double distXYZ[4]) const
666 int shapeID = n->getshapeId();
667 bool infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ));
668 if ( force || toCheckPosOnShape( shapeID ) || infinit )
670 // check that uv is correct
672 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
673 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
675 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
677 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
679 setPosOnShapeValidity( shapeID, false );
680 if ( !infinit && distXYZ ) {
681 surfPnt.Transform( loc );
683 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
685 // uv incorrect, project the node to surface
686 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
687 projector.Perform( nodePnt );
688 if ( !projector.IsDone() || projector.NbPoints() < 1 )
690 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
693 Quantity_Parameter U,V;
694 projector.LowerDistanceParameters(U,V);
696 surfPnt = surface->Value( U, V );
697 dist = nodePnt.Distance( surfPnt );
699 surfPnt.Transform( loc );
701 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
705 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
708 // store the fixed UV on the face
709 if ( myShape.IsSame(F) && shapeID == myShapeID && myFixNodeParameters )
710 const_cast<SMDS_MeshNode*>(n)->SetPosition
711 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
713 else if ( uv.Modulus() > numeric_limits<double>::min() )
715 setPosOnShapeValidity( shapeID, true );
721 //=======================================================================
722 //function : GetProjector
723 //purpose : Return projector intitialized by given face without location, which is returned
724 //=======================================================================
726 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
727 TopLoc_Location& loc,
730 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
731 int faceID = GetMeshDS()->ShapeToIndex( F );
732 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
733 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
734 if ( i_proj == i2proj.end() )
736 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
737 double U1, U2, V1, V2;
738 surface->Bounds(U1, U2, V1, V2);
739 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
740 proj->Init( surface, U1, U2, V1, V2, tol );
741 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
743 return *( i_proj->second );
748 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
749 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
750 gp_XY_FunPtr(Subtracted);
753 //=======================================================================
754 //function : applyIn2D
755 //purpose : Perform given operation on two 2d points in parameric space of given surface.
756 // It takes into account period of the surface. Use gp_XY_FunPtr macro
757 // to easily define pointer to function of gp_XY class.
758 //=======================================================================
760 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
764 const bool resultInPeriod)
766 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
767 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
768 if ( !isUPeriodic && !isVPeriodic )
771 // move uv2 not far than half-period from uv1
773 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
775 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
778 gp_XY res = fun( uv1, gp_XY(u2,v2) );
780 // move result within period
781 if ( resultInPeriod )
783 Standard_Real UF,UL,VF,VL;
784 surface->Bounds(UF,UL,VF,VL);
786 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
788 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
793 //=======================================================================
794 //function : GetMiddleUV
795 //purpose : Return middle UV taking in account surface period
796 //=======================================================================
798 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
803 // the proper place of getting basic surface seems to be in applyIn2D()
804 // but we put it here to decrease a risk of regressions just before releasing a version
805 Handle(Geom_Surface) surf = surface;
806 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
807 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
809 return applyIn2D( surf, p1, p2, & AverageUV );
812 //=======================================================================
813 //function : GetNodeU
814 //purpose : Return node U on edge
815 //=======================================================================
817 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
818 const SMDS_MeshNode* n,
819 const SMDS_MeshNode* inEdgeNode,
822 double param = Precision::Infinite();
824 const SMDS_PositionPtr pos = n->GetPosition();
825 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
827 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
828 param = epos->GetUParameter();
830 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
832 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
835 BRep_Tool::Range( E, f,l );
836 double uInEdge = GetNodeU( E, inEdgeNode );
837 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
841 SMESHDS_Mesh * meshDS = GetMeshDS();
842 int vertexID = n->getshapeId();
843 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
844 param = BRep_Tool::Parameter( V, E );
849 double tol = BRep_Tool::Tolerance( E );
850 double f,l; BRep_Tool::Range( E, f,l );
851 bool force = ( param < f-tol || param > l+tol );
852 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
853 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
855 *check = CheckNodeU( E, n, param, 2*tol, force );
860 //=======================================================================
861 //function : CheckNodeU
862 //purpose : Check and fix node U on an edge
863 // Return false if U is bad and could not be fixed
864 //=======================================================================
866 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
867 const SMDS_MeshNode* n,
871 double distXYZ[4]) const
873 int shapeID = n->getshapeId();
874 if ( force || toCheckPosOnShape( shapeID ))
876 TopLoc_Location loc; double f,l;
877 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
878 if ( curve.IsNull() ) // degenerated edge
880 if ( u+tol < f || u-tol > l )
882 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
888 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
889 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
890 gp_Pnt curvPnt = curve->Value( u );
891 double dist = nodePnt.Distance( curvPnt );
893 curvPnt.Transform( loc );
895 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
899 setPosOnShapeValidity( shapeID, false );
900 // u incorrect, project the node to the curve
901 int edgeID = GetMeshDS()->ShapeToIndex( E );
902 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
903 TID2ProjectorOnCurve::iterator i_proj =
904 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
905 if ( !i_proj->second )
907 i_proj->second = new GeomAPI_ProjectPointOnCurve();
908 i_proj->second->Init( curve, f, l );
910 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
911 projector->Perform( nodePnt );
912 if ( projector->NbPoints() < 1 )
914 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
917 Quantity_Parameter U = projector->LowerDistanceParameter();
919 curvPnt = curve->Value( u );
920 dist = nodePnt.Distance( curvPnt );
922 curvPnt.Transform( loc );
924 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
928 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
929 MESSAGE("distance " << dist << " " << tol );
932 // store the fixed U on the edge
933 if ( myShape.IsSame(E) && shapeID == myShapeID && myFixNodeParameters )
934 const_cast<SMDS_MeshNode*>(n)->SetPosition
935 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
937 else if ( fabs( u ) > numeric_limits<double>::min() )
939 setPosOnShapeValidity( shapeID, true );
941 if (( u < f-tol || u > l+tol ) && force )
943 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
946 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
947 double period = curve->Period();
948 u = ( u < f ) ? u + period : u - period;
950 catch (Standard_Failure& exc)
960 //=======================================================================
961 //function : GetMediumPos
962 //purpose : Return index and type of the shape (EDGE or FACE only) to
963 // set a medium node on
964 //param : useCurSubShape - if true, returns the shape set via SetSubShape()
966 //=======================================================================
968 std::pair<int, TopAbs_ShapeEnum>
969 SMESH_MesherHelper::GetMediumPos(const SMDS_MeshNode* n1,
970 const SMDS_MeshNode* n2,
971 const bool useCurSubShape)
973 if ( useCurSubShape && !myShape.IsNull() )
974 return std::make_pair( myShapeID, myShape.ShapeType() );
976 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
980 if (( myShapeID == n1->getshapeId() || myShapeID == n2->getshapeId() ) && myShapeID > 0 )
982 shapeType = myShape.ShapeType();
985 else if ( n1->getshapeId() == n2->getshapeId() )
987 shapeID = n2->getshapeId();
988 shape = GetSubShapeByNode( n1, GetMeshDS() );
992 const SMDS_TypeOfPosition Pos1 = n1->GetPosition()->GetTypeOfPosition();
993 const SMDS_TypeOfPosition Pos2 = n2->GetPosition()->GetTypeOfPosition();
995 if ( Pos1 == SMDS_TOP_3DSPACE || Pos2 == SMDS_TOP_3DSPACE )
998 else if ( Pos1 == SMDS_TOP_FACE || Pos2 == SMDS_TOP_FACE )
1000 if ( Pos1 != SMDS_TOP_FACE || Pos2 != SMDS_TOP_FACE )
1002 if ( Pos1 != SMDS_TOP_FACE ) std::swap( n1,n2 );
1003 TopoDS_Shape F = GetSubShapeByNode( n1, GetMeshDS() );
1004 TopoDS_Shape S = GetSubShapeByNode( n2, GetMeshDS() );
1005 if ( IsSubShape( S, F ))
1007 shapeType = TopAbs_FACE;
1008 shapeID = n1->getshapeId();
1012 else if ( Pos1 == SMDS_TOP_EDGE && Pos2 == SMDS_TOP_EDGE )
1014 TopoDS_Shape E1 = GetSubShapeByNode( n1, GetMeshDS() );
1015 TopoDS_Shape E2 = GetSubShapeByNode( n2, GetMeshDS() );
1016 shape = GetCommonAncestor( E1, E2, *myMesh, TopAbs_FACE );
1018 else if ( Pos1 == SMDS_TOP_VERTEX && Pos2 == SMDS_TOP_VERTEX )
1020 TopoDS_Shape V1 = GetSubShapeByNode( n1, GetMeshDS() );
1021 TopoDS_Shape V2 = GetSubShapeByNode( n2, GetMeshDS() );
1022 shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_EDGE );
1023 if ( shape.IsNull() ) shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_FACE );
1025 else // VERTEX and EDGE
1027 if ( Pos1 != SMDS_TOP_VERTEX ) std::swap( n1,n2 );
1028 TopoDS_Shape V = GetSubShapeByNode( n1, GetMeshDS() );
1029 TopoDS_Shape E = GetSubShapeByNode( n2, GetMeshDS() );
1030 if ( IsSubShape( V, E ))
1033 shape = GetCommonAncestor( V, E, *myMesh, TopAbs_FACE );
1037 if ( !shape.IsNull() )
1040 shapeID = GetMeshDS()->ShapeToIndex( shape );
1041 shapeType = shape.ShapeType();
1043 return make_pair( shapeID, shapeType );
1046 //=======================================================================
1047 //function : GetCentralNode
1048 //purpose : Return existing or create a new central node for a quardilateral
1049 // quadratic face given its 8 nodes.
1050 //@param : force3d - true means node creation in between the given nodes,
1051 // else node position is found on a geometrical face if any.
1052 //=======================================================================
1054 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1055 const SMDS_MeshNode* n2,
1056 const SMDS_MeshNode* n3,
1057 const SMDS_MeshNode* n4,
1058 const SMDS_MeshNode* n12,
1059 const SMDS_MeshNode* n23,
1060 const SMDS_MeshNode* n34,
1061 const SMDS_MeshNode* n41,
1064 SMDS_MeshNode *centralNode = 0; // central node to return
1066 // Find an existing central node
1068 TBiQuad keyOfMap(n1,n2,n3,n4);
1069 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1070 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1071 if ( itMapCentralNode != myMapWithCentralNode.end() )
1073 return (*itMapCentralNode).second;
1076 // Get type of shape for the new central node
1078 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1082 TopTools_ListIteratorOfListOfShape it;
1084 std::map< int, int > faceId2nbNodes;
1085 std::map< int, int > ::iterator itMapWithIdFace;
1087 SMESHDS_Mesh* meshDS = GetMeshDS();
1089 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1090 // on sub-shapes of the FACE
1091 if ( GetMesh()->HasShapeToMesh() )
1093 const SMDS_MeshNode* nodes[] = { n1, n2, n3, n4 };
1094 for(int i = 0; i < 4; i++)
1096 shape = GetSubShapeByNode( nodes[i], meshDS );
1097 if ( shape.IsNull() ) break;
1098 if ( shape.ShapeType() == TopAbs_SOLID )
1100 solidID = nodes[i]->getshapeId();
1101 shapeType = TopAbs_SOLID;
1104 if ( shape.ShapeType() == TopAbs_FACE )
1106 faceID = nodes[i]->getshapeId();
1107 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1108 itMapWithIdFace->second++;
1112 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1113 while ( const TopoDS_Shape* face = it->next() )
1115 faceID = meshDS->ShapeToIndex( *face );
1116 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1117 itMapWithIdFace->second++;
1122 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1124 // find ID of the FACE the four corner nodes belong to
1125 itMapWithIdFace = faceId2nbNodes.begin();
1126 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1128 if ( itMapWithIdFace->second == 4 )
1130 shapeType = TopAbs_FACE;
1131 faceID = (*itMapWithIdFace).first;
1138 if ( shapeType == TopAbs_FACE )
1140 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1147 if ( !F.IsNull() && !force3d )
1149 uvAvg = calcTFI (0.5, 0.5,
1150 GetNodeUV(F,n1,n3), GetNodeUV(F,n2,n4),
1151 GetNodeUV(F,n3,n1), GetNodeUV(F,n4,n2),
1152 GetNodeUV(F,n12,n3), GetNodeUV(F,n23,n4),
1153 GetNodeUV(F,n34,n2), GetNodeUV(F,n41,n2));
1154 TopLoc_Location loc;
1155 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1156 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1157 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1158 // if ( mySetElemOnShape ) node is not elem!
1159 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1161 else // ( force3d || F.IsNull() )
1163 P = ( SMESH_TNodeXYZ( n1 ) +
1164 SMESH_TNodeXYZ( n2 ) +
1165 SMESH_TNodeXYZ( n3 ) +
1166 SMESH_TNodeXYZ( n4 ) ) / 4;
1167 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1169 if ( !F.IsNull() ) // force3d
1171 uvAvg = (GetNodeUV(F,n1,n3) +
1172 GetNodeUV(F,n2,n4) +
1173 GetNodeUV(F,n3,n1) +
1174 GetNodeUV(F,n4,n2)) / 4;
1175 //CheckNodeUV( F, centralNode, uvAvg, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1176 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1178 else if ( solidID > 0 )
1180 meshDS->SetNodeInVolume( centralNode, solidID );
1182 else if ( myShapeID > 0 && mySetElemOnShape )
1184 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1187 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1191 //=======================================================================
1192 //function : GetCentralNode
1193 //purpose : Return existing or create a new central node for a
1194 // quadratic triangle given its 6 nodes.
1195 //@param : force3d - true means node creation in between the given nodes,
1196 // else node position is found on a geometrical face if any.
1197 //=======================================================================
1199 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1200 const SMDS_MeshNode* n2,
1201 const SMDS_MeshNode* n3,
1202 const SMDS_MeshNode* n12,
1203 const SMDS_MeshNode* n23,
1204 const SMDS_MeshNode* n31,
1207 SMDS_MeshNode *centralNode = 0; // central node to return
1209 // Find an existing central node
1211 TBiQuad keyOfMap(n1,n2,n3);
1212 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1213 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1214 if ( itMapCentralNode != myMapWithCentralNode.end() )
1216 return (*itMapCentralNode).second;
1219 // Get type of shape for the new central node
1221 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1225 TopTools_ListIteratorOfListOfShape it;
1227 std::map< int, int > faceId2nbNodes;
1228 std::map< int, int > ::iterator itMapWithIdFace;
1230 SMESHDS_Mesh* meshDS = GetMeshDS();
1232 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1233 // on sub-shapes of the FACE
1234 if ( GetMesh()->HasShapeToMesh() )
1236 const SMDS_MeshNode* nodes[] = { n1, n2, n3 };
1237 for(int i = 0; i < 3; i++)
1239 shape = GetSubShapeByNode( nodes[i], meshDS );
1240 if ( shape.IsNull() ) break;
1241 if ( shape.ShapeType() == TopAbs_SOLID )
1243 solidID = nodes[i]->getshapeId();
1244 shapeType = TopAbs_SOLID;
1247 if ( shape.ShapeType() == TopAbs_FACE )
1249 faceID = nodes[i]->getshapeId();
1250 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1251 itMapWithIdFace->second++;
1255 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1256 while ( const TopoDS_Shape* face = it->next() )
1258 faceID = meshDS->ShapeToIndex( *face );
1259 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1260 itMapWithIdFace->second++;
1265 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1267 // find ID of the FACE the four corner nodes belong to
1268 itMapWithIdFace = faceId2nbNodes.begin();
1269 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1271 if ( itMapWithIdFace->second == 3 )
1273 shapeType = TopAbs_FACE;
1274 faceID = (*itMapWithIdFace).first;
1281 if ( shapeType == TopAbs_FACE )
1283 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1290 if ( !F.IsNull() && !force3d )
1292 uvAvg = ( GetNodeUV(F,n12,n3) +
1293 GetNodeUV(F,n23,n1) +
1294 GetNodeUV(F,n31,n2) ) / 3.;
1295 TopLoc_Location loc;
1296 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1297 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1298 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1299 // if ( mySetElemOnShape ) node is not elem!
1300 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1302 else // ( force3d || F.IsNull() )
1304 P = ( SMESH_TNodeXYZ( n12 ) +
1305 SMESH_TNodeXYZ( n23 ) +
1306 SMESH_TNodeXYZ( n31 ) ) / 3;
1307 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1309 if ( !F.IsNull() ) // force3d
1311 uvAvg = ( GetNodeUV(F,n12,n3) +
1312 GetNodeUV(F,n23,n1) +
1313 GetNodeUV(F,n31,n2) ) / 3.;
1314 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1316 else if ( solidID > 0 )
1318 meshDS->SetNodeInVolume( centralNode, solidID );
1320 else if ( myShapeID > 0 && mySetElemOnShape )
1322 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1325 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1329 //=======================================================================
1330 //function : GetMediumNode
1331 //purpose : Return existing or create a new medium node between given ones
1332 //=======================================================================
1334 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
1335 const SMDS_MeshNode* n2,
1338 // Find existing node
1340 SMESH_TLink link(n1,n2);
1341 ItTLinkNode itLN = myTLinkNodeMap.find( link );
1342 if ( itLN != myTLinkNodeMap.end() ) {
1343 return (*itLN).second;
1346 // Create medium node
1349 SMESHDS_Mesh* meshDS = GetMeshDS();
1351 if ( IsSeamShape( n1->getshapeId() ))
1352 // to get a correct UV of a node on seam, the second node must have checked UV
1353 std::swap( n1, n2 );
1355 // get type of shape for the new medium node
1356 int faceID = -1, edgeID = -1;
1357 TopoDS_Edge E; double u [2];
1358 TopoDS_Face F; gp_XY uv[2];
1359 bool uvOK[2] = { false, false };
1361 pair<int, TopAbs_ShapeEnum> pos = GetMediumPos( n1, n2, mySetElemOnShape );
1362 // calling GetMediumPos() with useCurSubShape=mySetElemOnShape is OK only for the
1363 // case where the lower dim mesh is already constructed, else, nodes on EDGEs are
1364 // assigned to FACE, for example.
1366 // get positions of the given nodes on shapes
1367 if ( pos.second == TopAbs_FACE )
1369 F = TopoDS::Face(meshDS->IndexToShape( faceID = pos.first ));
1370 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
1371 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
1373 else if ( pos.second == TopAbs_EDGE )
1375 const SMDS_PositionPtr Pos1 = n1->GetPosition();
1376 const SMDS_PositionPtr Pos2 = n2->GetPosition();
1377 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1378 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1379 n1->getshapeId() != n2->getshapeId() )
1382 return getMediumNodeOnComposedWire(n1,n2,force3d);
1384 E = TopoDS::Edge(meshDS->IndexToShape( edgeID = pos.first ));
1385 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
1386 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
1389 if ( !force3d & uvOK[0] && uvOK[1] )
1391 // we try to create medium node using UV parameters of
1392 // nodes, else - medium between corresponding 3d points
1395 //if ( uvOK[0] && uvOK[1] )
1397 if ( IsDegenShape( n1->getshapeId() )) {
1398 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
1399 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
1401 else if ( IsDegenShape( n2->getshapeId() )) {
1402 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
1403 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
1406 TopLoc_Location loc;
1407 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
1408 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
1409 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
1410 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1411 // if ( mySetElemOnShape ) node is not elem!
1412 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
1413 myTLinkNodeMap.insert(make_pair(link,n12));
1417 else if ( !E.IsNull() )
1420 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1423 Standard_Boolean isPeriodic = C->IsPeriodic();
1426 Standard_Real Period = C->Period();
1427 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1428 Standard_Real pmid = (u[0]+p)/2.;
1429 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1434 gp_Pnt P = C->Value( U );
1435 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1436 //if ( mySetElemOnShape ) node is not elem!
1437 meshDS->SetNodeOnEdge(n12, edgeID, U);
1438 myTLinkNodeMap.insert(make_pair(link,n12));
1445 double x = ( n1->X() + n2->X() )/2.;
1446 double y = ( n1->Y() + n2->Y() )/2.;
1447 double z = ( n1->Z() + n2->Z() )/2.;
1448 n12 = meshDS->AddNode(x,y,z);
1450 //if ( mySetElemOnShape ) node is not elem!
1454 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1455 CheckNodeUV( F, n12, UV, 2 * BRep_Tool::Tolerance( F ), /*force=*/true);
1456 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1458 else if ( !E.IsNull() )
1460 double U = ( u[0] + u[1] ) / 2.;
1461 CheckNodeU( E, n12, U, 2 * BRep_Tool::Tolerance( E ), /*force=*/true);
1462 meshDS->SetNodeOnEdge(n12, edgeID, U);
1464 else if ( myShapeID > 0 && mySetElemOnShape )
1466 meshDS->SetMeshElementOnShape(n12, myShapeID);
1470 myTLinkNodeMap.insert( make_pair( link, n12 ));
1474 //================================================================================
1476 * \brief Makes a medium node if nodes reside different edges
1478 //================================================================================
1480 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1481 const SMDS_MeshNode* n2,
1484 gp_Pnt middle = 0.5 * XYZ(n1) + 0.5 * XYZ(n2);
1485 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1487 // To find position on edge and 3D position for n12,
1488 // project <middle> to 2 edges and select projection most close to <middle>
1490 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4];
1492 TopoDS_Edge edges[2];
1493 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1496 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1497 TopoDS_Shape shape = GetSubShapeByNode( n, GetMeshDS() );
1498 if ( shape.IsNull() || shape.ShapeType() != TopAbs_EDGE )
1501 // project to get U of projection and distance from middle to projection
1502 TopoDS_Edge edge = edges[ is2nd ] = TopoDS::Edge( shape );
1503 double node2MiddleDist = middle.Distance( XYZ(n) );
1504 double foundU = GetNodeU( edge, n );
1505 CheckNodeU( edge, n12, foundU, 2*BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1506 if ( distXYZ[0] < node2MiddleDist )
1508 distMiddleProj = distXYZ[0];
1513 if ( Precision::IsInfinite( distMiddleProj ))
1515 // both projections failed; set n12 on the edge of n1 with U of a common vertex
1516 TopoDS_Vertex vCommon;
1517 if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1518 u = BRep_Tool::Parameter( vCommon, edges[0] );
1521 double f,l, u0 = GetNodeU( edges[0], n1 );
1522 BRep_Tool::Range( edges[0],f,l );
1523 u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1529 // move n12 to position of a successfull projection
1530 double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1531 if ( !force3d && distMiddleProj > 2*tol )
1533 TopLoc_Location loc; double f,l;
1534 Handle(Geom_Curve) curve = BRep_Tool::Curve( edges[iOkEdge],loc,f,l );
1535 gp_Pnt p = curve->Value( u );
1536 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1539 //if ( mySetElemOnShape ) node is not elem!
1541 int edgeID = GetMeshDS()->ShapeToIndex( edges[iOkEdge] );
1542 if ( edgeID != n12->getshapeId() )
1543 GetMeshDS()->UnSetNodeOnShape( n12 );
1544 GetMeshDS()->SetNodeOnEdge(n12, edgeID, u);
1546 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1551 //=======================================================================
1552 //function : AddNode
1553 //purpose : Creates a node
1554 //=======================================================================
1556 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID,
1559 SMESHDS_Mesh * meshDS = GetMeshDS();
1560 SMDS_MeshNode* node = 0;
1562 node = meshDS->AddNodeWithID( x, y, z, ID );
1564 node = meshDS->AddNode( x, y, z );
1565 if ( mySetElemOnShape && myShapeID > 0 ) { // node is not elem ?
1566 switch ( myShape.ShapeType() ) {
1567 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1568 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1569 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID, u, v); break;
1570 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID, u); break;
1571 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1578 //=======================================================================
1579 //function : AddEdge
1580 //purpose : Creates quadratic or linear edge
1581 //=======================================================================
1583 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1584 const SMDS_MeshNode* n2,
1588 SMESHDS_Mesh * meshDS = GetMeshDS();
1590 SMDS_MeshEdge* edge = 0;
1591 if (myCreateQuadratic) {
1592 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1594 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1596 edge = meshDS->AddEdge(n1, n2, n12);
1600 edge = meshDS->AddEdgeWithID(n1, n2, id);
1602 edge = meshDS->AddEdge(n1, n2);
1605 if ( mySetElemOnShape && myShapeID > 0 )
1606 meshDS->SetMeshElementOnShape( edge, myShapeID );
1611 //=======================================================================
1612 //function : AddFace
1613 //purpose : Creates quadratic or linear triangle
1614 //=======================================================================
1616 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1617 const SMDS_MeshNode* n2,
1618 const SMDS_MeshNode* n3,
1622 SMESHDS_Mesh * meshDS = GetMeshDS();
1623 SMDS_MeshFace* elem = 0;
1625 if( n1==n2 || n2==n3 || n3==n1 )
1628 if(!myCreateQuadratic) {
1630 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1632 elem = meshDS->AddFace(n1, n2, n3);
1635 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1636 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1637 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1638 if(myCreateBiQuadratic)
1640 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n12, n23, n31, force3d);
1642 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, nCenter, id);
1644 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31, nCenter);
1649 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1651 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1654 if ( mySetElemOnShape && myShapeID > 0 )
1655 meshDS->SetMeshElementOnShape( elem, myShapeID );
1660 //=======================================================================
1661 //function : AddFace
1662 //purpose : Creates bi-quadratic, quadratic or linear quadrangle
1663 //=======================================================================
1665 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1666 const SMDS_MeshNode* n2,
1667 const SMDS_MeshNode* n3,
1668 const SMDS_MeshNode* n4,
1672 SMESHDS_Mesh * meshDS = GetMeshDS();
1673 SMDS_MeshFace* elem = 0;
1676 return AddFace(n1,n3,n4,id,force3d);
1679 return AddFace(n1,n2,n4,id,force3d);
1682 return AddFace(n1,n2,n3,id,force3d);
1685 return AddFace(n1,n2,n4,id,force3d);
1688 return AddFace(n1,n2,n3,id,force3d);
1691 return AddFace(n1,n2,n3,id,force3d);
1694 if(!myCreateQuadratic) {
1696 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1698 elem = meshDS->AddFace(n1, n2, n3, n4);
1701 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1702 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1703 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1704 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1705 if(myCreateBiQuadratic)
1707 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n4, n12, n23, n34, n41, force3d);
1709 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, nCenter, id);
1711 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41, nCenter);
1716 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1718 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1721 if ( mySetElemOnShape && myShapeID > 0 )
1722 meshDS->SetMeshElementOnShape( elem, myShapeID );
1727 //=======================================================================
1728 //function : AddPolygonalFace
1729 //purpose : Creates polygon, with additional nodes in quadratic mesh
1730 //=======================================================================
1732 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1736 SMESHDS_Mesh * meshDS = GetMeshDS();
1737 SMDS_MeshFace* elem = 0;
1739 if(!myCreateQuadratic) {
1741 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1743 elem = meshDS->AddPolygonalFace(nodes);
1746 vector<const SMDS_MeshNode*> newNodes;
1747 for ( int i = 0; i < nodes.size(); ++i )
1749 const SMDS_MeshNode* n1 = nodes[i];
1750 const SMDS_MeshNode* n2 = nodes[(i+1)%nodes.size()];
1751 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1752 newNodes.push_back( n1 );
1753 newNodes.push_back( n12 );
1756 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1758 elem = meshDS->AddPolygonalFace(newNodes);
1760 if ( mySetElemOnShape && myShapeID > 0 )
1761 meshDS->SetMeshElementOnShape( elem, myShapeID );
1766 //=======================================================================
1767 //function : AddVolume
1768 //purpose : Creates quadratic or linear prism
1769 //=======================================================================
1771 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1772 const SMDS_MeshNode* n2,
1773 const SMDS_MeshNode* n3,
1774 const SMDS_MeshNode* n4,
1775 const SMDS_MeshNode* n5,
1776 const SMDS_MeshNode* n6,
1780 SMESHDS_Mesh * meshDS = GetMeshDS();
1781 SMDS_MeshVolume* elem = 0;
1782 if(!myCreateQuadratic) {
1784 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1786 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1789 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1790 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1791 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1793 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1794 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1795 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1797 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1798 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1799 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1802 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1803 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1805 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1806 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1808 if ( mySetElemOnShape && myShapeID > 0 )
1809 meshDS->SetMeshElementOnShape( elem, myShapeID );
1814 //=======================================================================
1815 //function : AddVolume
1816 //purpose : Creates quadratic or linear tetrahedron
1817 //=======================================================================
1819 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1820 const SMDS_MeshNode* n2,
1821 const SMDS_MeshNode* n3,
1822 const SMDS_MeshNode* n4,
1826 SMESHDS_Mesh * meshDS = GetMeshDS();
1827 SMDS_MeshVolume* elem = 0;
1828 if(!myCreateQuadratic) {
1830 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1832 elem = meshDS->AddVolume(n1, n2, n3, n4);
1835 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1836 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1837 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1839 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1840 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1841 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1844 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1846 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1848 if ( mySetElemOnShape && myShapeID > 0 )
1849 meshDS->SetMeshElementOnShape( elem, myShapeID );
1854 //=======================================================================
1855 //function : AddVolume
1856 //purpose : Creates quadratic or linear pyramid
1857 //=======================================================================
1859 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1860 const SMDS_MeshNode* n2,
1861 const SMDS_MeshNode* n3,
1862 const SMDS_MeshNode* n4,
1863 const SMDS_MeshNode* n5,
1867 SMDS_MeshVolume* elem = 0;
1868 if(!myCreateQuadratic) {
1870 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1872 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1875 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1876 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1877 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1878 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1880 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1881 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1882 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
1883 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1886 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
1891 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
1893 n15, n25, n35, n45);
1895 if ( mySetElemOnShape && myShapeID > 0 )
1896 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
1901 //=======================================================================
1902 //function : AddVolume
1903 //purpose : Creates bi-quadratic, quadratic or linear hexahedron
1904 //=======================================================================
1906 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1907 const SMDS_MeshNode* n2,
1908 const SMDS_MeshNode* n3,
1909 const SMDS_MeshNode* n4,
1910 const SMDS_MeshNode* n5,
1911 const SMDS_MeshNode* n6,
1912 const SMDS_MeshNode* n7,
1913 const SMDS_MeshNode* n8,
1917 SMESHDS_Mesh * meshDS = GetMeshDS();
1918 SMDS_MeshVolume* elem = 0;
1919 if(!myCreateQuadratic) {
1921 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
1923 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
1926 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1927 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1928 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1929 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1931 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1932 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
1933 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
1934 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
1936 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1937 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
1938 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
1939 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
1940 if(myCreateBiQuadratic)
1942 const SMDS_MeshNode* n1234 = GetCentralNode(n1,n2,n3,n4,n12,n23,n34,n41,force3d);
1943 const SMDS_MeshNode* n1256 = GetCentralNode(n1,n2,n5,n6,n12,n26,n56,n15,force3d);
1944 const SMDS_MeshNode* n2367 = GetCentralNode(n2,n3,n6,n7,n23,n37,n67,n26,force3d);
1945 const SMDS_MeshNode* n3478 = GetCentralNode(n3,n4,n7,n8,n34,n48,n78,n37,force3d);
1946 const SMDS_MeshNode* n1458 = GetCentralNode(n1,n4,n5,n8,n41,n48,n15,n85,force3d);
1947 const SMDS_MeshNode* n5678 = GetCentralNode(n5,n6,n7,n8,n56,n67,n78,n85,force3d);
1949 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
1951 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( n4 );
1952 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( n8 );
1953 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( n3 );
1954 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( n7 );
1955 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( n1 );
1956 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( n5 );
1957 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( n2 );
1958 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( n6 );
1960 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( n48 );
1961 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( n37 );
1962 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( n15 );
1963 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( n26 );
1964 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( n34 );
1965 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( n78 );
1966 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( n12 );
1967 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( n56 );
1968 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( n41 );
1969 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( n85 );
1970 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( n23 );
1971 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( n67 );
1973 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( n3478 );
1974 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( n1256 );
1975 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( n1458 );
1976 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( n2367 );
1977 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( n1234 );
1978 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( n5678 );
1980 gp_XYZ centerCube(0.5, 0.5, 0.5);
1982 SMESH_Block::ShellPoint( centerCube, pointsOnShapes, nCenterElem );
1983 const SMDS_MeshNode* nCenter =
1984 meshDS->AddNode( nCenterElem.X(), nCenterElem.Y(), nCenterElem.Z() );
1985 meshDS->SetNodeInVolume( nCenter, myShapeID );
1988 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
1989 n12, n23, n34, n41, n56, n67,
1990 n78, n85, n15, n26, n37, n48,
1991 n1234, n1256, n2367, n3478, n1458, n5678, nCenter, id);
1993 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
1994 n12, n23, n34, n41, n56, n67,
1995 n78, n85, n15, n26, n37, n48,
1996 n1234, n1256, n2367, n3478, n1458, n5678, nCenter);
2001 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2002 n12, n23, n34, n41, n56, n67,
2003 n78, n85, n15, n26, n37, n48, id);
2005 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2006 n12, n23, n34, n41, n56, n67,
2007 n78, n85, n15, n26, n37, n48);
2010 if ( mySetElemOnShape && myShapeID > 0 )
2011 meshDS->SetMeshElementOnShape( elem, myShapeID );
2016 //=======================================================================
2017 //function : AddVolume
2018 //purpose : Creates LINEAR!!!!!!!!! octahedron
2019 //=======================================================================
2021 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2022 const SMDS_MeshNode* n2,
2023 const SMDS_MeshNode* n3,
2024 const SMDS_MeshNode* n4,
2025 const SMDS_MeshNode* n5,
2026 const SMDS_MeshNode* n6,
2027 const SMDS_MeshNode* n7,
2028 const SMDS_MeshNode* n8,
2029 const SMDS_MeshNode* n9,
2030 const SMDS_MeshNode* n10,
2031 const SMDS_MeshNode* n11,
2032 const SMDS_MeshNode* n12,
2036 SMESHDS_Mesh * meshDS = GetMeshDS();
2037 SMDS_MeshVolume* elem = 0;
2039 elem = meshDS->AddVolumeWithID(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12,id);
2041 elem = meshDS->AddVolume(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12);
2042 if ( mySetElemOnShape && myShapeID > 0 )
2043 meshDS->SetMeshElementOnShape( elem, myShapeID );
2047 //=======================================================================
2048 //function : AddPolyhedralVolume
2049 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
2050 //=======================================================================
2053 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
2054 const std::vector<int>& quantities,
2058 SMESHDS_Mesh * meshDS = GetMeshDS();
2059 SMDS_MeshVolume* elem = 0;
2060 if(!myCreateQuadratic)
2063 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
2065 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
2069 vector<const SMDS_MeshNode*> newNodes;
2070 vector<int> newQuantities;
2071 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
2073 int nbNodesInFace = quantities[iFace];
2074 newQuantities.push_back(0);
2075 for ( int i = 0; i < nbNodesInFace; ++i )
2077 const SMDS_MeshNode* n1 = nodes[ iN + i ];
2078 newNodes.push_back( n1 );
2079 newQuantities.back()++;
2081 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
2082 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
2083 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
2085 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2086 newNodes.push_back( n12 );
2087 newQuantities.back()++;
2090 iN += nbNodesInFace;
2093 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
2095 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
2097 if ( mySetElemOnShape && myShapeID > 0 )
2098 meshDS->SetMeshElementOnShape( elem, myShapeID );
2105 //================================================================================
2107 * \brief Check if a node belongs to any face of sub-mesh
2109 //================================================================================
2111 bool isNodeInSubMesh( const SMDS_MeshNode* n, const SMESHDS_SubMesh* sm )
2113 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2114 while ( fIt->more() )
2115 if ( sm->Contains( fIt->next() ))
2121 //=======================================================================
2122 //function : IsSameElemGeometry
2123 //purpose : Returns true if all elements of a sub-mesh are of same shape
2124 //=======================================================================
2126 bool SMESH_MesherHelper::IsSameElemGeometry(const SMESHDS_SubMesh* smDS,
2127 SMDSAbs_GeometryType shape,
2128 const bool nullSubMeshRes)
2130 if ( !smDS ) return nullSubMeshRes;
2132 SMDS_ElemIteratorPtr elemIt = smDS->GetElements();
2133 while ( elemIt->more() ) {
2134 const SMDS_MeshElement* e = elemIt->next();
2135 if ( e->GetGeomType() != shape )
2141 //=======================================================================
2142 //function : LoadNodeColumns
2143 //purpose : Load nodes bound to face into a map of node columns
2144 //=======================================================================
2146 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2147 const TopoDS_Face& theFace,
2148 const TopoDS_Edge& theBaseEdge,
2149 SMESHDS_Mesh* theMesh,
2150 SMESH_ProxyMesh* theProxyMesh)
2152 return LoadNodeColumns(theParam2ColumnMap,
2154 std::list<TopoDS_Edge>(1,theBaseEdge),
2159 //=======================================================================
2160 //function : LoadNodeColumns
2161 //purpose : Load nodes bound to face into a map of node columns
2162 //=======================================================================
2164 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2165 const TopoDS_Face& theFace,
2166 const std::list<TopoDS_Edge>& theBaseSide,
2167 SMESHDS_Mesh* theMesh,
2168 SMESH_ProxyMesh* theProxyMesh)
2170 // get a right sub-mesh of theFace
2172 const SMESHDS_SubMesh* faceSubMesh = 0;
2175 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
2176 if ( !faceSubMesh ||
2177 faceSubMesh->NbElements() == 0 ||
2178 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
2180 // can use a proxy sub-mesh with not temporary elements only
2186 faceSubMesh = theMesh->MeshElements( theFace );
2187 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
2190 if ( theParam2ColumnMap.empty() )
2192 // get data of edges for normalization of params
2193 vector< double > length;
2195 list<TopoDS_Edge>::const_iterator edge;
2197 for ( edge = theBaseSide.begin(); edge != theBaseSide.end(); ++edge )
2199 double len = std::max( 1e-10, SMESH_Algo::EdgeLength( *edge ));
2201 length.push_back( len );
2205 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
2206 edge = theBaseSide.begin();
2207 for ( int iE = 0; edge != theBaseSide.end(); ++edge, ++iE )
2209 map< double, const SMDS_MeshNode*> sortedBaseNN;
2210 SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN);
2211 if ( sortedBaseNN.empty() ) continue;
2213 map< double, const SMDS_MeshNode*>::iterator u_n = sortedBaseNN.begin();
2214 if ( theProxyMesh ) // from sortedBaseNN remove nodes not shared by faces of faceSubMesh
2216 const SMDS_MeshNode* n1 = (++sortedBaseNN.begin())->second;
2217 const SMDS_MeshNode* n2 = (++sortedBaseNN.rbegin())->second;
2218 bool allNodesAreProxy = ( n1 != theProxyMesh->GetProxyNode( n1 ) &&
2219 n2 != theProxyMesh->GetProxyNode( n2 ));
2220 if ( allNodesAreProxy )
2221 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2222 u_n->second = theProxyMesh->GetProxyNode( u_n->second );
2224 if ( u_n = sortedBaseNN.begin(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2226 while ( ++u_n != sortedBaseNN.end() && !isNodeInSubMesh( u_n->second, faceSubMesh ));
2227 sortedBaseNN.erase( sortedBaseNN.begin(), u_n );
2229 if ( u_n = --sortedBaseNN.end(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2231 while ( u_n != sortedBaseNN.begin() && !isNodeInSubMesh( (--u_n)->second, faceSubMesh ));
2232 sortedBaseNN.erase( ++u_n, sortedBaseNN.end() );
2234 if ( sortedBaseNN.empty() ) continue;
2238 BRep_Tool::Range( *edge, f, l );
2239 if ( edge->Orientation() == TopAbs_REVERSED ) std::swap( f, l );
2240 const double coeff = 1. / ( l - f ) * length[iE] / fullLen;
2241 const double prevPar = theParam2ColumnMap.empty() ? 0 : theParam2ColumnMap.rbegin()->first;
2242 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2244 double par = prevPar + coeff * ( u_n->first - f );
2245 TParam2ColumnMap::iterator u2nn =
2246 theParam2ColumnMap.insert( theParam2ColumnMap.end(), make_pair( par, TNodeColumn()));
2247 u2nn->second.push_back( u_n->second );
2250 if ( theParam2ColumnMap.empty() )
2255 int prevNbRows = theParam2ColumnMap.begin()->second.size(); // current, at least 1 here
2256 int expectedNbRows = faceSubMesh->NbElements() / ( theParam2ColumnMap.size()-1 ); // to be added
2258 // fill theParam2ColumnMap column by column by passing from nodes on
2259 // theBaseEdge up via mesh faces on theFace
2261 TParam2ColumnMap::iterator par_nVec_1, par_nVec_2;
2262 par_nVec_2 = theParam2ColumnMap.begin();
2263 par_nVec_1 = par_nVec_2++;
2264 TIDSortedElemSet emptySet, avoidSet;
2265 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
2267 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
2268 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
2269 nCol1.resize( prevNbRows + expectedNbRows );
2270 nCol2.resize( prevNbRows + expectedNbRows );
2272 int i1, i2, foundNbRows = 0;
2273 const SMDS_MeshNode *n1 = nCol1[ prevNbRows-1 ];
2274 const SMDS_MeshNode *n2 = nCol2[ prevNbRows-1 ];
2275 // find face sharing node n1 and n2 and belonging to faceSubMesh
2276 while ( const SMDS_MeshElement* face =
2277 SMESH_MeshAlgos::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
2279 if ( faceSubMesh->Contains( face ))
2281 int nbNodes = face->NbCornerNodes();
2284 if ( foundNbRows + 1 > expectedNbRows )
2286 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
2287 n2 = face->GetNode( (i1+2) % 4 );
2288 nCol1[ prevNbRows + foundNbRows] = n1;
2289 nCol2[ prevNbRows + foundNbRows] = n2;
2292 avoidSet.insert( face );
2294 if ( foundNbRows != expectedNbRows )
2298 return ( theParam2ColumnMap.size() > 1 &&
2299 theParam2ColumnMap.begin()->second.size() == prevNbRows + expectedNbRows );
2304 //================================================================================
2306 * \brief Return true if a node is at a corner of a 2D structured mesh of FACE
2308 //================================================================================
2310 bool isCornerOfStructure( const SMDS_MeshNode* n,
2311 const SMESHDS_SubMesh* faceSM,
2312 SMESH_MesherHelper& faceAnalyser )
2314 int nbFacesInSM = 0;
2316 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2317 while ( fIt->more() )
2318 nbFacesInSM += faceSM->Contains( fIt->next() );
2320 if ( nbFacesInSM == 1 )
2323 if ( nbFacesInSM == 2 && n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
2325 return faceAnalyser.IsRealSeam( n->getshapeId() );
2331 //=======================================================================
2332 //function : IsStructured
2333 //purpose : Return true if 2D mesh on FACE is structured
2334 //=======================================================================
2336 bool SMESH_MesherHelper::IsStructured( SMESH_subMesh* faceSM )
2338 SMESHDS_SubMesh* fSM = faceSM->GetSubMeshDS();
2339 if ( !fSM || fSM->NbElements() == 0 )
2342 list< TopoDS_Edge > edges;
2343 list< int > nbEdgesInWires;
2344 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( faceSM->GetSubShape() ),
2345 edges, nbEdgesInWires );
2346 if ( nbWires != 1 /*|| nbEdgesInWires.front() != 4*/ ) // allow composite sides
2349 // algo: find corners of a structure and then analyze nb of faces and
2350 // length of structure sides
2352 SMESHDS_Mesh* meshDS = faceSM->GetFather()->GetMeshDS();
2353 SMESH_MesherHelper faceAnalyser( *faceSM->GetFather() );
2354 faceAnalyser.SetSubShape( faceSM->GetSubShape() );
2356 // rotate edges to get the first node being at corner
2357 // (in principle it's not necessary but so far none SALOME algo can make
2358 // such a structured mesh that all corner nodes are not on VERTEXes)
2359 bool isCorner = false;
2360 int nbRemainEdges = nbEdgesInWires.front();
2362 TopoDS_Vertex V = IthVertex( 0, edges.front() );
2363 isCorner = isCornerOfStructure( SMESH_Algo::VertexNode( V, meshDS ),
2366 edges.splice( edges.end(), edges, edges.begin() );
2370 while ( !isCorner && nbRemainEdges > 0 );
2375 // get all nodes from EDGEs
2376 list< const SMDS_MeshNode* > nodes;
2377 list< TopoDS_Edge >::iterator edge = edges.begin();
2378 for ( ; edge != edges.end(); ++edge )
2380 map< double, const SMDS_MeshNode* > u2Nodes;
2381 if ( !SMESH_Algo::GetSortedNodesOnEdge( meshDS, *edge,
2382 /*skipMedium=*/true, u2Nodes ))
2385 list< const SMDS_MeshNode* > edgeNodes;
2386 map< double, const SMDS_MeshNode* >::iterator u2n = u2Nodes.begin();
2387 for ( ; u2n != u2Nodes.end(); ++u2n )
2388 edgeNodes.push_back( u2n->second );
2389 if ( edge->Orientation() == TopAbs_REVERSED )
2390 edgeNodes.reverse();
2392 if ( !nodes.empty() && nodes.back() == edgeNodes.front() )
2393 edgeNodes.pop_front();
2394 nodes.splice( nodes.end(), edgeNodes, edgeNodes.begin(), edgeNodes.end() );
2397 // get length of structured sides
2398 vector<int> nbEdgesInSide;
2400 list< const SMDS_MeshNode* >::iterator n = ++nodes.begin();
2401 for ( ; n != nodes.end(); ++n )
2404 if ( isCornerOfStructure( *n, fSM, faceAnalyser )) {
2405 nbEdgesInSide.push_back( nbEdges );
2411 if ( nbEdgesInSide.size() != 4 )
2413 if ( nbEdgesInSide[0] != nbEdgesInSide[2] )
2415 if ( nbEdgesInSide[1] != nbEdgesInSide[3] )
2417 if ( nbEdgesInSide[0] * nbEdgesInSide[1] != fSM->NbElements() )
2423 //================================================================================
2425 * \brief Find out elements orientation on a geometrical face
2426 * \param theFace - The face correctly oriented in the shape being meshed
2427 * \retval bool - true if the face normal and the normal of first element
2428 * in the correspoding submesh point in different directions
2430 //================================================================================
2432 bool SMESH_MesherHelper::IsReversedSubMesh (const TopoDS_Face& theFace)
2434 if ( theFace.IsNull() )
2437 // find out orientation of a meshed face
2438 int faceID = GetMeshDS()->ShapeToIndex( theFace );
2439 TopoDS_Shape aMeshedFace = GetMeshDS()->IndexToShape( faceID );
2440 bool isReversed = ( theFace.Orientation() != aMeshedFace.Orientation() );
2442 const SMESHDS_SubMesh * aSubMeshDSFace = GetMeshDS()->MeshElements( faceID );
2443 if ( !aSubMeshDSFace )
2446 // find an element with a good normal
2448 bool normalOK = false;
2450 SMDS_ElemIteratorPtr iteratorElem = aSubMeshDSFace->GetElements();
2451 while ( !normalOK && iteratorElem->more() ) // loop on elements on theFace
2453 const SMDS_MeshElement* elem = iteratorElem->next();
2454 if ( elem && elem->NbCornerNodes() > 2 )
2456 SMESH_TNodeXYZ nPnt[3];
2457 SMDS_ElemIteratorPtr nodesIt = elem->nodesIterator();
2458 for ( int iN = 0; nodesIt->more() && iN < 3; ++iN) // loop on nodes
2459 nPnt[ iN ] = nodesIt->next();
2462 gp_Vec v01( nPnt[0], nPnt[1] ), v02( nPnt[0], nPnt[2] );
2463 if ( v01.SquareMagnitude() > RealSmall() &&
2464 v02.SquareMagnitude() > RealSmall() )
2467 if (( normalOK = ( Ne.SquareMagnitude() > RealSmall() )))
2468 uv = GetNodeUV( theFace, nPnt[0]._node, nPnt[2]._node, &normalOK );
2475 // face normal at node position
2476 TopLoc_Location loc;
2477 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
2478 // if ( surf.IsNull() || surf->Continuity() < GeomAbs_C1 )
2479 // some surfaces not detected as GeomAbs_C1 are nevertheless correct for meshing
2480 if ( surf.IsNull() || surf->Continuity() < GeomAbs_C0 )
2483 MESSAGE("surf->Continuity() < GeomAbs_C1 " << (surf->Continuity() < GeomAbs_C1));
2486 gp_Vec d1u, d1v; gp_Pnt p;
2487 surf->D1( uv.X(), uv.Y(), p, d1u, d1v );
2488 gp_Vec Nf = (d1u ^ d1v).Transformed( loc );
2490 if ( theFace.Orientation() == TopAbs_REVERSED )
2493 return Ne * Nf < 0.;
2496 //=======================================================================
2498 //purpose : Count nb of sub-shapes
2499 //=======================================================================
2501 int SMESH_MesherHelper::Count(const TopoDS_Shape& shape,
2502 const TopAbs_ShapeEnum type,
2503 const bool ignoreSame)
2506 TopTools_IndexedMapOfShape map;
2507 TopExp::MapShapes( shape, type, map );
2508 return map.Extent();
2512 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2518 //=======================================================================
2519 //function : NbAncestors
2520 //purpose : Return number of unique ancestors of the shape
2521 //=======================================================================
2523 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
2524 const SMESH_Mesh& mesh,
2525 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
2527 TopTools_MapOfShape ancestors;
2528 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
2529 for ( ; ansIt.More(); ansIt.Next() ) {
2530 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
2531 ancestors.Add( ansIt.Value() );
2533 return ancestors.Extent();
2536 //=======================================================================
2537 //function : GetSubShapeOri
2538 //purpose : Return orientation of sub-shape in the main shape
2539 //=======================================================================
2541 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
2542 const TopoDS_Shape& subShape)
2544 TopAbs_Orientation ori = TopAbs_Orientation(-1);
2545 if ( !shape.IsNull() && !subShape.IsNull() )
2547 TopExp_Explorer e( shape, subShape.ShapeType() );
2548 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
2549 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
2550 for ( ; e.More(); e.Next())
2551 if ( subShape.IsSame( e.Current() ))
2554 ori = e.Current().Orientation();
2559 //=======================================================================
2560 //function : IsSubShape
2562 //=======================================================================
2564 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
2565 const TopoDS_Shape& mainShape )
2567 if ( !shape.IsNull() && !mainShape.IsNull() )
2569 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
2572 if ( shape.IsSame( exp.Current() ))
2575 SCRUTE((shape.IsNull()));
2576 SCRUTE((mainShape.IsNull()));
2580 //=======================================================================
2581 //function : IsSubShape
2583 //=======================================================================
2585 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
2587 if ( shape.IsNull() || !aMesh )
2590 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
2592 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
2595 //================================================================================
2597 * \brief Return maximal tolerance of shape
2599 //================================================================================
2601 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
2603 double tol = Precision::Confusion();
2604 TopExp_Explorer exp;
2605 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
2606 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
2607 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
2608 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
2609 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
2610 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
2615 //================================================================================
2617 * \brief Check if the first and last vertices of an edge are the same
2618 * \param anEdge - the edge to check
2619 * \retval bool - true if same
2621 //================================================================================
2623 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
2625 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2626 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
2627 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
2630 //================================================================================
2632 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
2633 * in the case of INTERNAL edge
2635 //================================================================================
2637 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
2641 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2642 anEdge.Orientation( TopAbs_FORWARD );
2644 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
2645 TopoDS_Iterator vIt( anEdge, CumOri );
2646 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
2649 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
2652 //================================================================================
2654 * \brief Return type of shape contained in a group
2655 * \param group - a shape of type TopAbs_COMPOUND
2656 * \param avoidCompound - not to return TopAbs_COMPOUND
2658 //================================================================================
2660 TopAbs_ShapeEnum SMESH_MesherHelper::GetGroupType(const TopoDS_Shape& group,
2661 const bool avoidCompound)
2663 if ( !group.IsNull() )
2665 if ( group.ShapeType() != TopAbs_COMPOUND )
2666 return group.ShapeType();
2668 // iterate on a compound
2669 TopoDS_Iterator it( group );
2671 return avoidCompound ? GetGroupType( it.Value() ) : it.Value().ShapeType();
2673 return TopAbs_SHAPE;
2676 //=======================================================================
2677 //function : IsQuadraticMesh
2678 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
2679 // quadratic elements will be created.
2680 // Used then generated 3D mesh without geometry.
2681 //=======================================================================
2683 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
2685 int NbAllEdgsAndFaces=0;
2686 int NbQuadFacesAndEdgs=0;
2687 int NbFacesAndEdges=0;
2688 //All faces and edges
2689 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
2690 if ( NbAllEdgsAndFaces == 0 )
2691 return SMESH_MesherHelper::LINEAR;
2693 //Quadratic faces and edges
2694 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
2696 //Linear faces and edges
2697 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
2699 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
2701 return SMESH_MesherHelper::QUADRATIC;
2703 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
2705 return SMESH_MesherHelper::LINEAR;
2708 //Mesh with both type of elements
2709 return SMESH_MesherHelper::COMP;
2712 //=======================================================================
2713 //function : GetOtherParam
2714 //purpose : Return an alternative parameter for a node on seam
2715 //=======================================================================
2717 double SMESH_MesherHelper::GetOtherParam(const double param) const
2719 int i = myParIndex & U_periodic ? 0 : 1;
2720 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
2725 //=======================================================================
2727 * \brief Iterator on ancestors of the given type
2729 //=======================================================================
2731 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
2733 TopTools_ListIteratorOfListOfShape _ancIter;
2734 TopAbs_ShapeEnum _type;
2735 TopTools_MapOfShape _encountered;
2736 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
2737 : _ancIter( ancestors ), _type( type )
2739 if ( _ancIter.More() ) {
2740 if ( _ancIter.Value().ShapeType() != _type ) next();
2741 else _encountered.Add( _ancIter.Value() );
2746 return _ancIter.More();
2748 virtual const TopoDS_Shape* next()
2750 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
2751 if ( _ancIter.More() )
2752 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
2753 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
2761 //=======================================================================
2763 * \brief Return iterator on ancestors of the given type
2765 //=======================================================================
2767 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
2768 const SMESH_Mesh& mesh,
2769 TopAbs_ShapeEnum ancestorType)
2771 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
2774 //=======================================================================
2775 //function : GetCommonAncestor
2776 //purpose : Find a common ancestors of two shapes of the given type
2777 //=======================================================================
2779 TopoDS_Shape SMESH_MesherHelper::GetCommonAncestor(const TopoDS_Shape& shape1,
2780 const TopoDS_Shape& shape2,
2781 const SMESH_Mesh& mesh,
2782 TopAbs_ShapeEnum ancestorType)
2784 TopoDS_Shape commonAnc;
2785 if ( !shape1.IsNull() && !shape2.IsNull() )
2787 PShapeIteratorPtr ancIt = GetAncestors( shape1, mesh, ancestorType );
2788 while ( const TopoDS_Shape* anc = ancIt->next() )
2789 if ( IsSubShape( shape2, *anc ))
2798 //#include <Perf_Meter.hxx>
2800 //=======================================================================
2801 namespace { // Structures used by FixQuadraticElements()
2802 //=======================================================================
2804 #define __DMP__(txt) \
2806 #define MSG(txt) __DMP__(txt<<endl)
2807 #define MSGBEG(txt) __DMP__(txt)
2809 //const double straightTol2 = 1e-33; // to detect straing links
2810 bool isStraightLink(double linkLen2, double middleNodeMove2)
2812 // straight if <node move> < 1/15 * <link length>
2813 return middleNodeMove2 < 1/15./15. * linkLen2;
2817 // ---------------------------------------
2819 * \brief Quadratic link knowing its faces
2821 struct QLink: public SMESH_TLink
2823 const SMDS_MeshNode* _mediumNode;
2824 mutable vector<const QFace* > _faces;
2825 mutable gp_Vec _nodeMove;
2826 mutable int _nbMoves;
2828 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
2829 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
2831 //if ( MediumPos() != SMDS_TOP_3DSPACE )
2832 _nodeMove = MediumPnt() - MiddlePnt();
2834 void SetContinuesFaces() const;
2835 const QFace* GetContinuesFace( const QFace* face ) const;
2836 bool OnBoundary() const;
2837 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
2838 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
2840 SMDS_TypeOfPosition MediumPos() const
2841 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
2842 SMDS_TypeOfPosition EndPos(bool isSecond) const
2843 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
2844 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
2845 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
2847 void Move(const gp_Vec& move, bool sum=false) const
2848 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
2849 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
2850 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
2851 bool IsStraight() const
2852 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
2853 _nodeMove.SquareMagnitude());
2855 bool operator<(const QLink& other) const {
2856 return (node1()->GetID() == other.node1()->GetID() ?
2857 node2()->GetID() < other.node2()->GetID() :
2858 node1()->GetID() < other.node1()->GetID());
2860 // struct PtrComparator {
2861 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
2864 // ---------------------------------------------------------
2866 * \brief Link in the chain of links; it connects two faces
2870 const QLink* _qlink;
2871 mutable const QFace* _qfaces[2];
2873 TChainLink(const QLink* qlink=0):_qlink(qlink) {
2874 _qfaces[0] = _qfaces[1] = 0;
2876 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
2878 bool IsBoundary() const { return !_qfaces[1]; }
2880 void RemoveFace( const QFace* face ) const
2881 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
2883 const QFace* NextFace( const QFace* f ) const
2884 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
2886 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
2887 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
2889 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
2891 operator bool() const { return (_qlink); }
2893 const QLink* operator->() const { return _qlink; }
2895 gp_Vec Normal() const;
2897 bool IsStraight() const;
2899 // --------------------------------------------------------------------
2900 typedef list< TChainLink > TChain;
2901 typedef set < TChainLink > TLinkSet;
2902 typedef TLinkSet::const_iterator TLinkInSet;
2904 const int theFirstStep = 5;
2906 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
2907 // --------------------------------------------------------------------
2909 * \brief Quadratic face shared by two volumes and bound by QLinks
2911 struct QFace: public TIDSortedNodeSet
2913 mutable const SMDS_MeshElement* _volumes[2];
2914 mutable vector< const QLink* > _sides;
2915 mutable bool _sideIsAdded[4]; // added in chain of links
2918 mutable const SMDS_MeshElement* _face;
2921 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
2923 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
2925 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
2927 void AddSelfToLinks() const {
2928 for ( int i = 0; i < _sides.size(); ++i )
2929 _sides[i]->_faces.push_back( this );
2931 int LinkIndex( const QLink* side ) const {
2932 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
2935 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
2937 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
2939 int i = LinkIndex( link._qlink );
2940 if ( i < 0 ) return true;
2941 _sideIsAdded[i] = true;
2942 link.SetFace( this );
2943 // continue from opposite link
2944 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
2946 bool IsBoundary() const { return !_volumes[1]; }
2948 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
2950 bool IsSpoiled(const QLink* bentLink ) const;
2952 TLinkInSet GetBoundaryLink( const TLinkSet& links,
2953 const TChainLink& avoidLink,
2954 TLinkInSet * notBoundaryLink = 0,
2955 const SMDS_MeshNode* nodeToContain = 0,
2956 bool * isAdjacentUsed = 0,
2957 int nbRecursionsLeft = -1) const;
2959 TLinkInSet GetLinkByNode( const TLinkSet& links,
2960 const TChainLink& avoidLink,
2961 const SMDS_MeshNode* nodeToContain) const;
2963 const SMDS_MeshNode* GetNodeInFace() const {
2964 for ( int iL = 0; iL < _sides.size(); ++iL )
2965 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
2969 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
2971 double MoveByBoundary( const TChainLink& theLink,
2972 const gp_Vec& theRefVec,
2973 const TLinkSet& theLinks,
2974 SMESH_MesherHelper* theFaceHelper=0,
2975 const double thePrevLen=0,
2976 const int theStep=theFirstStep,
2977 gp_Vec* theLinkNorm=0,
2978 double theSign=1.0) const;
2981 //================================================================================
2983 * \brief Dump QLink and QFace
2985 ostream& operator << (ostream& out, const QLink& l)
2987 out <<"QLink nodes: "
2988 << l.node1()->GetID() << " - "
2989 << l._mediumNode->GetID() << " - "
2990 << l.node2()->GetID() << endl;
2993 ostream& operator << (ostream& out, const QFace& f)
2995 out <<"QFace nodes: "/*<< &f << " "*/;
2996 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
2997 out << (*n)->GetID() << " ";
2998 out << " \tvolumes: "
2999 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
3000 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
3001 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
3005 //================================================================================
3007 * \brief Construct QFace from QLinks
3009 //================================================================================
3011 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
3013 _volumes[0] = _volumes[1] = 0;
3015 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
3016 _normal.SetCoord(0,0,0);
3017 for ( int i = 1; i < _sides.size(); ++i ) {
3018 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
3019 insert( l1->node1() ); insert( l1->node2() );
3021 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
3022 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
3023 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
3027 double normSqSize = _normal.SquareMagnitude();
3028 if ( normSqSize > numeric_limits<double>::min() )
3029 _normal /= sqrt( normSqSize );
3031 _normal.SetCoord(1e-33,0,0);
3037 //================================================================================
3039 * \brief Make up a chain of links
3040 * \param iSide - link to add first
3041 * \param chain - chain to fill in
3042 * \param pos - postion of medium nodes the links should have
3043 * \param error - out, specifies what is wrong
3044 * \retval bool - false if valid chain can't be built; "valid" means that links
3045 * of the chain belongs to rectangles bounding hexahedrons
3047 //================================================================================
3049 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
3051 if ( iSide >= _sides.size() ) // wrong argument iSide
3053 if ( _sideIsAdded[ iSide ]) // already in chain
3056 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
3059 list< const QFace* > faces( 1, this );
3060 while ( !faces.empty() ) {
3061 const QFace* face = faces.front();
3062 for ( int i = 0; i < face->_sides.size(); ++i ) {
3063 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
3064 face->_sideIsAdded[i] = true;
3065 // find a face side in the chain
3066 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
3067 // TChain::iterator chLink = chain.begin();
3068 // for ( ; chLink != chain.end(); ++chLink )
3069 // if ( chLink->_qlink == face->_sides[i] )
3071 // if ( chLink == chain.end() )
3072 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
3073 // add a face to a chained link and put a continues face in the queue
3074 chLink->SetFace( face );
3075 if ( face->_sides[i]->MediumPos() == pos )
3076 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
3077 if ( contFace->_sides.size() == 3 )
3078 faces.push_back( contFace );
3083 if ( error < ERR_TRI )
3085 chain.insert( chain.end(), links.begin(),links.end() );
3088 _sideIsAdded[iSide] = true; // not to add this link to chain again
3089 const QLink* link = _sides[iSide];
3093 // add link into chain
3094 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
3095 chLink->SetFace( this );
3098 // propagate from quadrangle to neighbour faces
3099 if ( link->MediumPos() >= pos ) {
3100 int nbLinkFaces = link->_faces.size();
3101 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
3102 // hexahedral mesh or boundary quadrangles - goto a continous face
3103 if ( const QFace* f = link->GetContinuesFace( this ))
3104 if ( f->_sides.size() == 4 )
3105 return f->GetLinkChain( *chLink, chain, pos, error );
3108 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
3109 for ( int i = 0; i < nbLinkFaces; ++i )
3110 if ( link->_faces[i] )
3111 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
3112 if ( error < ERR_PRISM )
3120 //================================================================================
3122 * \brief Return a boundary link of the triangle face
3123 * \param links - set of all links
3124 * \param avoidLink - link not to return
3125 * \param notBoundaryLink - out, neither the returned link nor avoidLink
3126 * \param nodeToContain - node the returned link must contain; if provided, search
3127 * also performed on adjacent faces
3128 * \param isAdjacentUsed - returns true if link is found in adjacent faces
3129 * \param nbRecursionsLeft - to limit recursion
3131 //================================================================================
3133 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
3134 const TChainLink& avoidLink,
3135 TLinkInSet * notBoundaryLink,
3136 const SMDS_MeshNode* nodeToContain,
3137 bool * isAdjacentUsed,
3138 int nbRecursionsLeft) const
3140 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
3142 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
3143 TFaceLinkList adjacentFaces;
3145 for ( int iL = 0; iL < _sides.size(); ++iL )
3147 if ( avoidLink._qlink == _sides[iL] )
3149 TLinkInSet link = links.find( _sides[iL] );
3150 if ( link == linksEnd ) continue;
3151 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
3152 continue; // We work on faces here, don't go inside a solid
3155 if ( link->IsBoundary() ) {
3156 if ( !nodeToContain ||
3157 (*link)->node1() == nodeToContain ||
3158 (*link)->node2() == nodeToContain )
3160 boundaryLink = link;
3161 if ( !notBoundaryLink ) break;
3164 else if ( notBoundaryLink ) {
3165 *notBoundaryLink = link;
3166 if ( boundaryLink != linksEnd ) break;
3169 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
3170 if ( const QFace* adj = link->NextFace( this ))
3171 if ( adj->Contains( nodeToContain ))
3172 adjacentFaces.push_back( make_pair( adj, link ));
3175 if ( isAdjacentUsed ) *isAdjacentUsed = false;
3176 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
3178 if ( nbRecursionsLeft < 0 )
3179 nbRecursionsLeft = nodeToContain->NbInverseElements();
3180 TFaceLinkList::iterator adj = adjacentFaces.begin();
3181 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
3182 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
3183 isAdjacentUsed, nbRecursionsLeft-1);
3184 if ( isAdjacentUsed ) *isAdjacentUsed = true;
3186 return boundaryLink;
3188 //================================================================================
3190 * \brief Return a link ending at the given node but not avoidLink
3192 //================================================================================
3194 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
3195 const TChainLink& avoidLink,
3196 const SMDS_MeshNode* nodeToContain) const
3198 for ( int i = 0; i < _sides.size(); ++i )
3199 if ( avoidLink._qlink != _sides[i] &&
3200 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
3201 return links.find( _sides[ i ]);
3205 //================================================================================
3207 * \brief Return normal to the i-th side pointing outside the face
3209 //================================================================================
3211 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
3213 gp_Vec norm, vecOut;
3214 // if ( uvHelper ) {
3215 // TopoDS_Face face = TopoDS::Face( uvHelper->GetSubShape());
3216 // const SMDS_MeshNode* inFaceNode = uvHelper->GetNodeUVneedInFaceNode() ? GetNodeInFace() : 0;
3217 // gp_XY uv1 = uvHelper->GetNodeUV( face, _sides[i]->node1(), inFaceNode );
3218 // gp_XY uv2 = uvHelper->GetNodeUV( face, _sides[i]->node2(), inFaceNode );
3219 // norm.SetCoord( uv1.Y() - uv2.Y(), uv2.X() - uv1.X(), 0 );
3221 // const QLink* otherLink = _sides[(i + 1) % _sides.size()];
3222 // const SMDS_MeshNode* otherNode =
3223 // otherLink->node1() == _sides[i]->node1() ? otherLink->node2() : otherLink->node1();
3224 // gp_XY pIn = uvHelper->GetNodeUV( face, otherNode, inFaceNode );
3225 // vecOut.SetCoord( uv1.X() - pIn.X(), uv1.Y() - pIn.Y(), 0 );
3228 norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3229 gp_XYZ pIn = ( XYZ( _sides[0]->node1() ) +
3230 XYZ( _sides[0]->node2() ) +
3231 XYZ( _sides[1]->node1() )) / 3.;
3232 vecOut.SetXYZ( _sides[i]->MiddlePnt() - pIn );
3234 if ( norm * vecOut < 0 )
3236 double mag2 = norm.SquareMagnitude();
3237 if ( mag2 > numeric_limits<double>::min() )
3238 norm /= sqrt( mag2 );
3241 //================================================================================
3243 * \brief Move medium node of theLink according to its distance from boundary
3244 * \param theLink - link to fix
3245 * \param theRefVec - movement of boundary
3246 * \param theLinks - all adjacent links of continous triangles
3247 * \param theFaceHelper - helper is not used so far
3248 * \param thePrevLen - distance from the boundary
3249 * \param theStep - number of steps till movement propagation limit
3250 * \param theLinkNorm - out normal to theLink
3251 * \param theSign - 1 or -1 depending on movement of boundary
3252 * \retval double - distance from boundary to propagation limit or other boundary
3254 //================================================================================
3256 double QFace::MoveByBoundary( const TChainLink& theLink,
3257 const gp_Vec& theRefVec,
3258 const TLinkSet& theLinks,
3259 SMESH_MesherHelper* theFaceHelper,
3260 const double thePrevLen,
3262 gp_Vec* theLinkNorm,
3263 double theSign) const
3266 return thePrevLen; // propagation limit reached
3268 int iL; // index of theLink
3269 for ( iL = 0; iL < _sides.size(); ++iL )
3270 if ( theLink._qlink == _sides[ iL ])
3273 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
3274 <<" thePrevLen " << thePrevLen);
3275 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
3277 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
3278 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
3279 if ( theStep == theFirstStep )
3280 theSign = refProj < 0. ? -1. : 1.;
3281 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
3282 return thePrevLen; // to propagate movement forward only, not in side dir or backward
3284 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
3285 TLinkInSet link1 = theLinks.find( _sides[iL1] );
3286 TLinkInSet link2 = theLinks.find( _sides[iL2] );
3287 if ( link1 == theLinks.end() || link2 == theLinks.end() )
3289 const QFace* f1 = link1->NextFace( this ); // adjacent faces
3290 const QFace* f2 = link2->NextFace( this );
3292 // propagate to adjacent faces till limit step or boundary
3293 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
3294 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
3295 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
3296 gp_Vec linkDir2(0,0,0);
3299 if ( f1 && theLink->MediumPos() <= (*link1)->MediumPos() )
3300 len1 = f1->MoveByBoundary
3301 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
3303 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
3305 MSG( " --------------- EXCEPTION");
3310 if ( f2 && theLink->MediumPos() <= (*link2)->MediumPos() )
3311 len2 = f2->MoveByBoundary
3312 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
3314 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
3316 MSG( " --------------- EXCEPTION");
3321 if ( theStep != theFirstStep )
3323 // choose chain length by direction of propagation most codirected with theRefVec
3324 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
3325 fullLen = choose1 ? len1 : len2;
3326 double r = thePrevLen / fullLen;
3328 gp_Vec move = linkNorm * refProj * ( 1 - r );
3329 theLink->Move( move, true );
3331 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
3332 " by " << refProj * ( 1 - r ) << " following " <<
3333 (choose1 ? *link1->_qlink : *link2->_qlink));
3335 if ( theLinkNorm ) *theLinkNorm = linkNorm;
3340 //================================================================================
3342 * \brief Checks if the face is distorted due to bentLink
3344 //================================================================================
3346 bool QFace::IsSpoiled(const QLink* bentLink ) const
3348 // code is valid for convex faces only
3350 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
3351 gc += XYZ( *n ) / size();
3352 for (unsigned i = 0; i < _sides.size(); ++i )
3354 if ( _sides[i] == bentLink ) continue;
3355 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3356 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
3357 if ( linkNorm * vecOut < 0 )
3359 double mag2 = linkNorm.SquareMagnitude();
3360 if ( mag2 > numeric_limits<double>::min() )
3361 linkNorm /= sqrt( mag2 );
3362 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
3363 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
3364 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
3371 //================================================================================
3373 * \brief Find pairs of continues faces
3375 //================================================================================
3377 void QLink::SetContinuesFaces() const
3379 // x0 x - QLink, [-|] - QFace, v - volume
3381 // | Between _faces of link x2 two vertical faces are continues
3382 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
3383 // | to _faces[0] and _faces[1] and horizontal faces to
3384 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
3387 if ( _faces.empty() )
3389 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
3390 if ( _faces[0]->IsBoundary() )
3391 iBoundary[ nbBoundary++ ] = 0;
3392 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
3394 // look for a face bounding none of volumes bound by _faces[0]
3395 bool sameVol = false;
3396 int nbVol = _faces[iF]->NbVolumes();
3397 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
3398 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
3399 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
3402 if ( _faces[iF]->IsBoundary() )
3403 iBoundary[ nbBoundary++ ] = iF;
3405 // Set continues faces: arrange _faces to have
3406 // _faces[0] continues to _faces[1]
3407 // _faces[2] continues to _faces[3]
3408 if ( nbBoundary == 2 ) // bnd faces are continues
3410 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
3412 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
3413 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
3416 else if ( iFaceCont > 0 ) // continues faces found
3418 if ( iFaceCont != 1 )
3419 std::swap( _faces[1], _faces[iFaceCont] );
3421 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
3423 _faces.insert( ++_faces.begin(), 0 );
3426 //================================================================================
3428 * \brief Return a face continues to the given one
3430 //================================================================================
3432 const QFace* QLink::GetContinuesFace( const QFace* face ) const
3434 for ( int i = 0; i < _faces.size(); ++i ) {
3435 if ( _faces[i] == face ) {
3436 int iF = i < 2 ? 1-i : 5-i;
3437 return iF < _faces.size() ? _faces[iF] : 0;
3442 //================================================================================
3444 * \brief True if link is on mesh boundary
3446 //================================================================================
3448 bool QLink::OnBoundary() const
3450 for ( int i = 0; i < _faces.size(); ++i )
3451 if (_faces[i] && _faces[i]->IsBoundary()) return true;
3454 //================================================================================
3456 * \brief Return normal of link of the chain
3458 //================================================================================
3460 gp_Vec TChainLink::Normal() const {
3462 if (_qfaces[0]) norm = _qfaces[0]->_normal;
3463 if (_qfaces[1]) norm += _qfaces[1]->_normal;
3466 //================================================================================
3468 * \brief Test link curvature taking into account size of faces
3470 //================================================================================
3472 bool TChainLink::IsStraight() const
3474 bool isStraight = _qlink->IsStraight();
3475 if ( isStraight && _qfaces[0] && !_qfaces[1] )
3477 int i = _qfaces[0]->LinkIndex( _qlink );
3478 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
3479 gp_XYZ mid1 = _qlink->MiddlePnt();
3480 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
3481 double faceSize2 = (mid1-mid2).SquareModulus();
3482 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
3487 //================================================================================
3489 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
3491 //================================================================================
3493 void fixPrism( TChain& allLinks )
3495 // separate boundary links from internal ones
3496 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
3497 QLinkSet interLinks, bndLinks1, bndLink2;
3499 bool isCurved = false;
3500 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3501 if ( (*lnk)->OnBoundary() )
3502 bndLinks1.insert( lnk->_qlink );
3504 interLinks.insert( lnk->_qlink );
3505 isCurved = isCurved || !lnk->IsStraight();
3508 return; // no need to move
3510 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
3512 while ( !interLinks.empty() && !curBndLinks->empty() )
3514 // propagate movement from boundary links to connected internal links
3515 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
3516 for ( ; bnd != bndEnd; ++bnd )
3518 const QLink* bndLink = *bnd;
3519 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
3521 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
3522 if ( !face ) continue;
3523 // find and move internal link opposite to bndLink within the face
3524 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
3525 const QLink* interLink = face->_sides[ interInd ];
3526 QLinkSet::iterator pInterLink = interLinks.find( interLink );
3527 if ( pInterLink == interLinks.end() ) continue; // not internal link
3528 interLink->Move( bndLink->_nodeMove );
3529 // treated internal links become new boundary ones
3530 interLinks. erase( pInterLink );
3531 newBndLinks->insert( interLink );
3534 curBndLinks->clear();
3535 std::swap( curBndLinks, newBndLinks );
3539 //================================================================================
3541 * \brief Fix links of continues triangles near curved boundary
3543 //================================================================================
3545 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
3547 if ( allLinks.empty() ) return;
3549 TLinkSet linkSet( allLinks.begin(), allLinks.end());
3550 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
3552 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
3554 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
3556 // move iff a boundary link is bent towards inside of a face (issue 0021084)
3557 const QFace* face = linkIt->_qfaces[0];
3558 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
3559 face->_sides[1]->MiddlePnt() +
3560 face->_sides[2]->MiddlePnt() ) / 3.;
3561 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
3562 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
3563 //if ( face->IsSpoiled( linkIt->_qlink ))
3564 if ( linkBentInside )
3565 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
3570 //================================================================================
3572 * \brief Detect rectangular structure of links and build chains from them
3574 //================================================================================
3576 enum TSplitTriaResult {
3577 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
3578 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
3580 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
3581 vector< TChain> & resultChains,
3582 SMDS_TypeOfPosition pos )
3584 // put links in the set and evalute number of result chains by number of boundary links
3587 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3588 linkSet.insert( *lnk );
3589 nbBndLinks += lnk->IsBoundary();
3591 resultChains.clear();
3592 resultChains.reserve( nbBndLinks / 2 );
3594 TLinkInSet linkIt, linksEnd = linkSet.end();
3596 // find a boundary link with corner node; corner node has position pos-2
3597 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
3599 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
3600 const SMDS_MeshNode* corner = 0;
3601 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
3602 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
3607 TLinkInSet startLink = linkIt;
3608 const SMDS_MeshNode* startCorner = corner;
3609 vector< TChain* > rowChains;
3612 while ( startLink != linksEnd) // loop on columns
3614 // We suppose we have a rectangular structure like shown here. We have found a
3615 // corner of the rectangle (startCorner) and a boundary link sharing
3616 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
3617 // --o---o---o structure making several chains at once. One chain (columnChain)
3618 // |\ | /| starts at startLink and continues upward (we look at the structure
3619 // \ | \ | / | from such point that startLink is on the bottom of the structure).
3620 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
3621 // --o---o---o encounter.
3623 // / | \ | \ | startCorner
3628 if ( resultChains.size() == nbBndLinks / 2 )
3630 resultChains.push_back( TChain() );
3631 TChain& columnChain = resultChains.back();
3633 TLinkInSet botLink = startLink; // current horizontal link to go up from
3634 corner = startCorner; // current corner the botLink ends at
3636 while ( botLink != linksEnd ) // loop on rows
3638 // add botLink to the columnChain
3639 columnChain.push_back( *botLink );
3641 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
3643 { // the column ends
3644 if ( botLink == startLink )
3645 return _TWISTED_CHAIN; // issue 0020951
3646 linkSet.erase( botLink );
3647 if ( iRow != rowChains.size() )
3648 return _FEW_ROWS; // different nb of rows in columns
3651 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
3652 // link ending at <corner> (sideLink); there are two cases:
3653 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
3654 // since midQuadLink is not at boundary while sideLink is.
3655 // 2) midQuadLink ends at <corner>
3657 TLinkInSet midQuadLink = linksEnd;
3658 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
3660 if ( isCase2 ) { // find midQuadLink among links of botTria
3661 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
3662 if ( midQuadLink->IsBoundary() )
3663 return _BAD_MIDQUAD;
3665 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
3666 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
3669 columnChain.push_back( *midQuadLink );
3670 if ( iRow >= rowChains.size() ) {
3672 return _MANY_ROWS; // different nb of rows in columns
3673 if ( resultChains.size() == nbBndLinks / 2 )
3675 resultChains.push_back( TChain() );
3676 rowChains.push_back( & resultChains.back() );
3678 rowChains[iRow]->push_back( *sideLink );
3679 rowChains[iRow]->push_back( *midQuadLink );
3681 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
3685 // prepare startCorner and startLink for the next column
3686 startCorner = startLink->NextNode( startCorner );
3688 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
3690 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
3691 // check if no more columns remains
3692 if ( startLink != linksEnd ) {
3693 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
3694 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
3695 startLink = linksEnd; // startLink bounds upTria or botTria
3696 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
3700 // find bottom link and corner for the next row
3701 corner = sideLink->NextNode( corner );
3702 // next bottom link ends at the new corner
3703 linkSet.erase( botLink );
3704 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
3705 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
3707 if ( midQuadLink == startLink || sideLink == startLink )
3708 return _TWISTED_CHAIN; // issue 0020951
3709 linkSet.erase( midQuadLink );
3710 linkSet.erase( sideLink );
3712 // make faces neighboring the found ones be boundary
3713 if ( startLink != linksEnd ) {
3714 const QFace* tria = isCase2 ? botTria : upTria;
3715 for ( int iL = 0; iL < 3; ++iL ) {
3716 linkIt = linkSet.find( tria->_sides[iL] );
3717 if ( linkIt != linksEnd )
3718 linkIt->RemoveFace( tria );
3721 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
3722 botLink->RemoveFace( upTria ); // make next botTria first in vector
3729 // In the linkSet, there must remain the last links of rowChains; add them
3730 if ( linkSet.size() != rowChains.size() )
3731 return _BAD_SET_SIZE;
3732 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
3733 // find the link (startLink) ending at startCorner
3735 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
3736 if ( (*startLink)->node1() == startCorner ) {
3737 corner = (*startLink)->node2(); break;
3739 else if ( (*startLink)->node2() == startCorner) {
3740 corner = (*startLink)->node1(); break;
3743 if ( startLink == linksEnd )
3745 rowChains[ iRow ]->push_back( *startLink );
3746 linkSet.erase( startLink );
3747 startCorner = corner;
3753 //================================================================================
3755 * \brief Place medium nodes at the link middle for elements whose corner nodes
3756 * are out of geometrical boundary to prevent distorting elements.
3757 * Issue 0020982, note 0013990
3759 //================================================================================
3761 void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
3762 SMESH_ComputeErrorPtr& theError)
3764 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
3765 TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
3766 if ( shape.IsNull() ) return;
3768 if ( !theError ) theError = SMESH_ComputeError::New();
3772 if ( shape.ShapeType() == TopAbs_FACE ) // 2D
3774 if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
3776 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
3777 if ( !faceSM ) return;
3779 const TopoDS_Face& face = TopoDS::Face( shape );
3780 Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
3782 TopExp_Explorer edgeIt( face, TopAbs_EDGE );
3783 for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
3785 // check if the EDGE needs checking
3786 const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
3787 if ( BRep_Tool::Degenerated( edge ) )
3789 if ( theHelper.IsRealSeam( edge ) &&
3790 edge.Orientation() == TopAbs_REVERSED )
3793 SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
3794 if ( !edgeSM ) continue;
3797 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
3798 BRepAdaptor_Curve curve3D( edge );
3799 switch ( curve3D.GetType() ) {
3800 case GeomAbs_Line: continue;
3801 case GeomAbs_Circle:
3802 case GeomAbs_Ellipse:
3803 case GeomAbs_Hyperbola:
3804 case GeomAbs_Parabola:
3807 gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
3808 curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
3809 gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
3810 surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
3811 gp_Vec fNorm = Du1 ^ Dv1;
3812 if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
3813 continue; // face is normal to the curve3D
3815 gp_Vec curvNorm = fNorm ^ D1;
3816 if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
3817 if ( curvNorm * D2 > 0 )
3818 continue; // convex edge
3820 catch ( Standard_Failure )
3825 // get nodes shared by faces that may be distorted
3826 SMDS_NodeIteratorPtr nodeIt;
3827 if ( edgeSM->NbNodes() > 0 ) {
3828 nodeIt = edgeSM->GetNodes();
3831 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
3833 vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
3834 if ( !vertexSM ) continue;
3835 nodeIt = vertexSM->GetNodes();
3838 // find suspicious faces
3839 TIDSortedElemSet checkedFaces;
3840 vector< const SMDS_MeshNode* > nOnEdge( 2 );
3841 const SMDS_MeshNode* nOnFace;
3842 while ( nodeIt->more() )
3844 const SMDS_MeshNode* n = nodeIt->next();
3845 SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
3846 while ( faceIt->more() )
3848 const SMDS_MeshElement* f = faceIt->next();
3849 if ( !faceSM->Contains( f ) ||
3850 f->NbNodes() != 6 || // check quadratic triangles only
3851 !checkedFaces.insert( f ).second )
3854 // get nodes on EDGE and on FACE of a suspicious face
3855 nOnEdge.clear(); nOnFace = 0;
3856 SMDS_MeshElement::iterator triNode = f->begin_nodes();
3857 for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
3860 if ( n->GetPosition()->GetDim() == 2 )
3863 nOnEdge.push_back( n );
3866 // check if nOnFace is inside the FACE
3867 if ( nOnFace && nOnEdge.size() == 2 )
3869 theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
3870 if ( !SMESH_MeshAlgos::FaceNormal( f, faceNorm, /*normalized=*/false ))
3872 gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
3873 gp_XYZ edgeNorm = faceNorm ^ edgeDir;
3874 n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true );
3875 gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
3876 gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
3877 gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
3878 double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
3879 double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
3880 if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
3882 // nOnFace is out of FACE, move a medium on-edge node to the middle
3883 gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
3884 meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
3885 MSG( "move OUT of face " << n );
3886 theError->myBadElements.push_back( f );
3892 if ( !theError->myBadElements.empty() )
3893 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
3896 } // 2D ==============================================================================
3898 if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
3900 if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
3901 theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
3903 SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
3904 if ( !solidSM ) return;
3906 // check if the SOLID is bound by concave FACEs
3907 vector< TopoDS_Face > concaveFaces;
3908 TopExp_Explorer faceIt( shape, TopAbs_FACE );
3909 for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
3911 const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
3912 if ( !meshDS->MeshElements( face )) continue;
3914 BRepAdaptor_Surface surface( face );
3915 switch ( surface.GetType() ) {
3916 case GeomAbs_Plane: continue;
3917 case GeomAbs_Cylinder:
3919 case GeomAbs_Sphere:
3922 double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
3923 double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
3924 gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
3925 surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
3926 gp_Vec fNorm = Du1 ^ Dv1;
3927 if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
3928 bool concaveU = ( fNorm * Du2 > 1e-100 );
3929 bool concaveV = ( fNorm * Dv2 > 1e-100 );
3930 if ( concaveU || concaveV )
3931 concaveFaces.push_back( face );
3933 catch ( Standard_Failure )
3935 concaveFaces.push_back( face );
3939 if ( concaveFaces.empty() )
3942 // fix 2D mesh on the SOLID
3943 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
3945 SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
3946 faceHelper.SetSubShape( faceIt.Current() );
3947 force3DOutOfBoundary( faceHelper, theError );
3950 // get an iterator over faces on concaveFaces
3951 vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
3952 for ( size_t i = 0; i < concaveFaces.size(); ++i )
3953 faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
3954 typedef SMDS_IteratorOnIterators
3955 < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
3956 SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
3958 // a seacher to check if a volume is close to a concave face
3959 std::auto_ptr< SMESH_ElementSearcher > faceSearcher
3960 ( SMESH_MeshAlgos::GetElementSearcher( *theHelper.GetMeshDS(), faceIter ));
3963 //BRepClass3d_SolidClassifier solidClassifier( shape );
3965 TIDSortedElemSet checkedVols, movedNodes;
3966 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
3968 const TopoDS_Shape& face = faceIt.Current();
3969 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
3970 if ( !faceSM ) continue;
3972 // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
3973 SMDS_NodeIteratorPtr nodeIt;
3974 if ( faceSM->NbNodes() > 0 ) {
3975 nodeIt = faceSM->GetNodes();
3978 TopExp_Explorer vertex( face, TopAbs_VERTEX );
3979 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
3980 if ( !vertexSM ) continue;
3981 nodeIt = vertexSM->GetNodes();
3984 // find suspicious volumes adjacent to the FACE
3985 vector< const SMDS_MeshNode* > nOnFace( 4 );
3986 const SMDS_MeshNode* nInSolid;
3987 //vector< const SMDS_MeshElement* > intersectedFaces;
3988 while ( nodeIt->more() )
3990 const SMDS_MeshNode* n = nodeIt->next();
3991 SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
3992 while ( volIt->more() )
3994 const SMDS_MeshElement* vol = volIt->next();
3995 int nbN = vol->NbCornerNodes();
3996 if ( ( nbN != 4 && nbN != 5 ) ||
3997 !solidSM->Contains( vol ) ||
3998 !checkedVols.insert( vol ).second )
4001 // get nodes on FACE and in SOLID of a suspicious volume
4002 nOnFace.clear(); nInSolid = 0;
4003 SMDS_MeshElement::iterator volNode = vol->begin_nodes();
4004 for ( int nb = nbN; nb > 0; ++volNode, --nb )
4007 if ( n->GetPosition()->GetDim() == 3 )
4010 nOnFace.push_back( n );
4012 if ( !nInSolid || nOnFace.size() != nbN - 1 )
4015 // get size of the vol
4016 SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
4017 double volLength = pInSolid.SquareDistance( nOnFace[0] );
4018 for ( size_t i = 1; i < nOnFace.size(); ++i )
4020 volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
4023 // check if vol is close to concaveFaces
4024 const SMDS_MeshElement* closeFace =
4025 faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
4027 pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
4030 // check if vol is distorted, i.e. a medium node is much closer
4031 // to nInSolid than the link middle
4032 bool isDistorted = false;
4033 SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
4034 if ( !SMESH_MeshAlgos::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
4036 theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
4037 vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
4038 for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
4039 for ( size_t j = i+1; j < nOnFace.size(); ++j )
4041 SMESH_TLink link( nOnFace[i], nOnFace[j] );
4042 TLinkNodeMap::const_iterator linkIt =
4043 theHelper.GetTLinkNodeMap().find( link );
4044 if ( linkIt != theHelper.GetTLinkNodeMap().end() )
4046 links.push_back( make_pair( linkIt->first, linkIt->second ));
4047 if ( !isDistorted ) {
4048 // compare projections of nInSolid and nMedium to face normal
4049 gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
4050 double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
4051 double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
4052 isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
4056 // move medium nodes to link middle
4059 for ( size_t i = 0; i < links.size(); ++i )
4061 const SMDS_MeshNode* nMedium = links[i].second;
4062 if ( movedNodes.insert( nMedium ).second )
4064 gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
4065 SMESH_TNodeXYZ( links[i].first.node2() ));
4066 meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4067 MSG( "move OUT of solid " << nMedium );
4070 theError->myBadElements.push_back( vol );
4072 } // loop on volumes sharing a node on FACE
4073 } // loop on nodes on FACE
4074 } // loop on FACEs of a SOLID
4076 if ( !theError->myBadElements.empty() )
4077 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4083 //=======================================================================
4085 * \brief Move medium nodes of faces and volumes to fix distorted elements
4086 * \param error - container of fixed distorted elements
4087 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
4089 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
4091 //=======================================================================
4093 void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& compError,
4096 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
4097 if ( getenv("NO_FixQuadraticElements") )
4100 // 0. Apply algorithm to SOLIDs or FACEs
4101 // ----------------------------------------------
4102 if ( myShape.IsNull() ) {
4103 if ( !myMesh->HasShapeToMesh() ) return;
4104 SetSubShape( myMesh->GetShapeToMesh() );
4108 TopTools_IndexedMapOfShape solids;
4109 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
4110 nbSolids = solids.Extent();
4112 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
4113 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
4114 faces.Add( f.Current() ); // not in solid
4116 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
4117 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
4118 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
4119 faces.Add( f.Current() ); // in not meshed solid
4121 else { // fix nodes in the solid and its faces
4123 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
4125 SMESH_MesherHelper h(*myMesh);
4126 h.SetSubShape( s.Current() );
4127 h.ToFixNodeParameters(true);
4128 h.FixQuadraticElements( compError, false );
4131 // fix nodes on geom faces
4133 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
4135 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
4136 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
4137 SMESH_MesherHelper h(*myMesh);
4138 h.SetSubShape( fIt.Key() );
4139 h.ToFixNodeParameters(true);
4140 h.FixQuadraticElements( compError, true);
4142 //perf_print_all_meters(1);
4143 if ( compError && compError->myName == EDITERR_NO_MEDIUM_ON_GEOM )
4144 compError->myComment = "during conversion to quadratic, "
4145 "some medium nodes were not placed on geometry to avoid distorting elements";
4149 // 1. Find out type of elements and get iterator on them
4150 // ---------------------------------------------------
4152 SMDS_ElemIteratorPtr elemIt;
4153 SMDSAbs_ElementType elemType = SMDSAbs_All;
4155 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
4158 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
4159 elemIt = smDS->GetElements();
4160 if ( elemIt->more() ) {
4161 elemType = elemIt->next()->GetType();
4162 elemIt = smDS->GetElements();
4165 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
4168 // 2. Fill in auxiliary data structures
4169 // ----------------------------------
4173 set< QLink >::iterator pLink;
4174 set< QFace >::iterator pFace;
4176 bool isCurved = false;
4177 //bool hasRectFaces = false;
4178 //set<int> nbElemNodeSet;
4179 SMDS_VolumeTool volTool;
4181 TIDSortedNodeSet apexOfPyramid;
4182 const int apexIndex = 4;
4185 // Move medium nodes to the link middle for elements whose corner nodes
4186 // are out of geometrical boundary to fix distorted elements.
4187 force3DOutOfBoundary( *this, compError );
4189 if ( elemType == SMDSAbs_Volume )
4191 while ( elemIt->more() ) // loop on volumes
4193 const SMDS_MeshElement* vol = elemIt->next();
4194 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
4196 double volMinSize2 = -1.;
4197 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
4199 int nbN = volTool.NbFaceNodes( iF );
4200 //nbElemNodeSet.insert( nbN );
4201 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
4202 vector< const QLink* > faceLinks( nbN/2 );
4203 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
4206 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
4207 pLink = links.insert( link ).first;
4208 faceLinks[ iN/2 ] = & *pLink;
4210 if ( link.MediumPos() == SMDS_TOP_3DSPACE )
4212 if ( !link.IsStraight() )
4213 return; // already fixed
4215 else if ( !isCurved )
4217 if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
4218 isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
4222 pFace = faces.insert( QFace( faceLinks )).first;
4223 if ( pFace->NbVolumes() == 0 )
4224 pFace->AddSelfToLinks();
4225 pFace->SetVolume( vol );
4226 // hasRectFaces = hasRectFaces ||
4227 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
4228 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
4231 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
4233 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
4234 faceNodes[4],faceNodes[6] );
4237 // collect pyramid apexes for further correction
4238 if ( vol->NbCornerNodes() == 5 )
4239 apexOfPyramid.insert( vol->GetNode( apexIndex ));
4241 set< QLink >::iterator pLink = links.begin();
4242 for ( ; pLink != links.end(); ++pLink )
4243 pLink->SetContinuesFaces();
4247 while ( elemIt->more() ) // loop on faces
4249 const SMDS_MeshElement* face = elemIt->next();
4250 if ( !face->IsQuadratic() )
4252 //nbElemNodeSet.insert( face->NbNodes() );
4253 int nbN = face->NbNodes()/2;
4254 vector< const QLink* > faceLinks( nbN );
4255 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
4258 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
4259 pLink = links.insert( link ).first;
4260 faceLinks[ iN ] = & *pLink;
4262 link.node1()->GetPosition()->GetTypeOfPosition() < 2 &&
4263 link.node2()->GetPosition()->GetTypeOfPosition() < 2 )
4264 isCurved = !link.IsStraight();
4267 pFace = faces.insert( QFace( faceLinks )).first;
4268 pFace->AddSelfToLinks();
4269 //hasRectFaces = ( hasRectFaces || nbN == 4 );
4273 return; // no curved edges of faces
4275 // 3. Compute displacement of medium nodes
4276 // ---------------------------------------
4278 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones.
4279 TopLoc_Location loc;
4281 // not to treat boundary of volumic sub-mesh.
4282 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
4283 for ( ; isInside < 2; ++isInside )
4285 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
4286 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
4287 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
4289 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
4290 if ( bool(isInside) == pFace->IsBoundary() )
4292 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
4295 // make chain of links connected via continues faces
4298 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
4300 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
4302 vector< TChain > chains;
4303 if ( error == ERR_OK ) { // chain contains continues rectangles
4305 chains[0].splice( chains[0].begin(), rawChain );
4307 else if ( error == ERR_TRI ) { // chain contains continues triangles
4308 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
4309 if ( res != _OK ) { // not quadrangles split into triangles
4310 fixTriaNearBoundary( rawChain, *this );
4314 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
4315 fixPrism( rawChain );
4321 for ( int iC = 0; iC < chains.size(); ++iC )
4323 TChain& chain = chains[iC];
4324 if ( chain.empty() ) continue;
4325 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
4326 MSG("3D straight - ignore");
4329 if ( chain.front()->MediumPos() > bndPos ||
4330 chain.back() ->MediumPos() > bndPos ) {
4331 MSG("Internal chain - ignore");
4334 // mesure chain length and compute link position along the chain
4335 double chainLen = 0;
4336 vector< double > linkPos;
4337 MSGBEG( "Link medium nodes: ");
4338 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
4339 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
4340 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
4341 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4342 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
4343 link1 = chain.erase( link1 );
4344 if ( link1 == chain.end() )
4346 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4349 linkPos.push_back( chainLen );
4352 if ( linkPos.size() < 2 )
4355 gp_Vec move0 = chain.front()->_nodeMove;
4356 gp_Vec move1 = chain.back ()->_nodeMove;
4361 // compute node displacement of end links of chain in parametric space of face
4362 TChainLink& linkOnFace = *(++chain.begin());
4363 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
4364 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
4365 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
4367 face = TopoDS::Face( f );
4368 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
4370 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
4372 TChainLink& link = is1 ? chain.back() : chain.front();
4373 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
4374 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
4375 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
4376 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4377 // uvMove = uvm - uv12
4378 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
4379 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
4380 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
4381 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
4382 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
4383 10 * uvMove.SquareModulus());
4385 if ( isStraight[0] && isStraight[1] ) {
4386 MSG("2D straight - ignore");
4387 continue; // straight - no need to move nodes of internal links
4390 // check if a chain is already fixed
4391 gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
4392 gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
4393 gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
4394 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4395 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
4397 MSG("Already fixed - ignore");
4403 if ( isInside || face.IsNull() )
4405 // compute node displacement of end links in their local coord systems
4407 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
4408 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
4409 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4410 move0.Transform(trsf);
4413 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
4414 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
4415 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4416 move1.Transform(trsf);
4419 // compute displacement of medium nodes
4420 link2 = chain.begin();
4423 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
4425 double r = linkPos[i] / chainLen;
4426 // displacement in local coord system
4427 gp_Vec move = (1. - r) * move0 + r * move1;
4428 if ( isInside || face.IsNull()) {
4429 // transform to global
4430 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
4431 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
4432 gp_Vec x = x01.Normalized() + x12.Normalized();
4433 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
4434 move.Transform(trsf);
4437 // compute 3D displacement by 2D one
4438 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
4439 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
4440 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
4441 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
4442 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
4444 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
4445 move.SquareMagnitude())
4447 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
4448 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
4449 MSG( "TOO LONG MOVE \t" <<
4450 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
4451 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
4452 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
4453 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
4457 (*link1)->Move( move );
4458 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
4459 << chain.front()->_mediumNode->GetID() <<"-"
4460 << chain.back ()->_mediumNode->GetID() <<
4461 " by " << move.Magnitude());
4463 } // loop on chains of links
4464 } // loop on 2 directions of propagation from quadrangle
4466 } // fix faces and/or volumes
4471 TIDSortedElemSet biQuadQuas, biQuadTris, triQuadHexa;
4472 const SMDS_MeshElement *biQuadQua, *triQuadHex;
4473 const bool toFixCentralNodes = ( myMesh->NbBiQuadQuadrangles() +
4474 myMesh->NbBiQuadTriangles() +
4475 myMesh->NbTriQuadraticHexas() );
4477 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
4478 if ( pLink->IsMoved() )
4480 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
4481 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
4483 // collect bi-quadratic elements
4484 if ( toFixCentralNodes )
4486 biQuadQua = triQuadHex = 0;
4487 SMDS_ElemIteratorPtr eIt = pLink->_mediumNode->GetInverseElementIterator();
4488 while ( eIt->more() )
4490 const SMDS_MeshElement* e = eIt->next();
4491 switch( e->GetEntityType() ) {
4492 case SMDSEntity_BiQuad_Quadrangle: biQuadQuas.insert( e ); break;
4493 case SMDSEntity_BiQuad_Triangle: biQuadTris.insert( e ); break;
4494 case SMDSEntity_TriQuad_Hexa: triQuadHexa.insert( e ); break;
4501 // Fix positions of central nodes of bi-tri-quadratic elements
4503 // treat bi-quad quadrangles
4505 vector< const SMDS_MeshNode* > nodes( 9 );
4507 TIDSortedElemSet::iterator quadIt = biQuadQuas.begin();
4508 for ( ; quadIt != biQuadQuas.end(); ++quadIt )
4510 const SMDS_MeshElement* quad = *quadIt;
4513 nodes.assign( quad->begin_nodes(), quad->end_nodes() );
4515 TopoDS_Shape S = GetSubShapeByNode( nodes.back(), GetMeshDS() );
4516 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4517 const TopoDS_Face& F = TopoDS::Face( S );
4518 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4519 const double tol = BRep_Tool::Tolerance( F );
4521 for ( int i = 0; i < 8; ++i )
4523 uv[ i ] = GetNodeUV( F, nodes[i], nodes[8], &checkUV );
4524 // as this method is used after mesh generation, UV of nodes is not
4525 // updated according to bending links, so we update
4526 if ( i > 3 && nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4527 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4529 // move the central node
4530 gp_XY uvCent = calcTFI (0.5, 0.5, uv[0],uv[1],uv[2],uv[3],uv[4],uv[5],uv[6],uv[7] );
4531 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4532 GetMeshDS()->MoveNode( nodes[8], p.X(), p.Y(), p.Z());
4536 // treat bi-quad triangles
4538 const SMDS_MeshNode* nodes[3]; // medium nodes
4539 gp_XY uv[ 3 ]; // UV of medium nodes
4540 TIDSortedElemSet::iterator triIt = biQuadTris.begin();
4541 for ( ; triIt != biQuadTris.end(); ++triIt )
4543 const SMDS_MeshElement* tria = *triIt;
4545 for ( int i = 3; i < 6; ++i )
4546 nodes[ i-3 ] = tria->GetNode( i );
4548 const TopoDS_Shape& S = GetMeshDS()->IndexToShape( tria->getshapeId() );
4549 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4550 const TopoDS_Face& F = TopoDS::Face( S );
4551 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4552 const double tol = BRep_Tool::Tolerance( F );
4554 for ( int i = 0; i < 3; ++i )
4556 uv[ i ] = GetNodeUV( F, nodes[i], nodes[(i+1)%3], &checkUV );
4557 // as this method is used after mesh generation, UV of nodes is not
4558 // updated according to bending links, so we update
4559 if ( nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4560 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4562 // move the central node
4563 gp_XY uvCent = ( uv[0] + uv[1] + uv[2] ) / 3.;
4564 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4565 GetMeshDS()->MoveNode( tria->GetNode(6), p.X(), p.Y(), p.Z() );
4569 // treat tri-quadratic hexahedra
4571 SMDS_VolumeTool volExp;
4572 TIDSortedElemSet::iterator hexIt = triQuadHexa.begin();
4573 for ( ; hexIt != triQuadHexa.end(); ++hexIt )
4575 volExp.Set( *hexIt, /*ignoreCentralNodes=*/false );
4577 // fix nodes central in sides
4578 for ( int iQuad = 0; iQuad < volExp.NbFaces(); ++iQuad )
4580 const SMDS_MeshNode** quadNodes = volExp.GetFaceNodes( iQuad );
4581 if ( quadNodes[8]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
4583 gp_XYZ p = calcTFI( 0.5, 0.5,
4584 SMESH_TNodeXYZ( quadNodes[0] ), SMESH_TNodeXYZ( quadNodes[2] ),
4585 SMESH_TNodeXYZ( quadNodes[4] ), SMESH_TNodeXYZ( quadNodes[6] ),
4586 SMESH_TNodeXYZ( quadNodes[1] ), SMESH_TNodeXYZ( quadNodes[3] ),
4587 SMESH_TNodeXYZ( quadNodes[5] ), SMESH_TNodeXYZ( quadNodes[7] ));
4588 GetMeshDS()->MoveNode( quadNodes[8], p.X(), p.Y(), p.Z());
4592 // fix the volume central node
4593 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
4594 const SMDS_MeshNode** hexNodes = volExp.GetNodes();
4596 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( hexNodes[ 0 ] );
4597 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( hexNodes[ 3 ] );
4598 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( hexNodes[ 1 ] );
4599 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( hexNodes[ 2 ] );
4600 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( hexNodes[ 4 ] );
4601 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( hexNodes[ 7 ] );
4602 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( hexNodes[ 5 ] );
4603 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( hexNodes[ 6 ] );
4605 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( hexNodes[ 11 ] );
4606 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( hexNodes[ 9 ] );
4607 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( hexNodes[ 8 ] );
4608 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( hexNodes[ 10 ] );
4609 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( hexNodes[ 15 ] );
4610 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( hexNodes[ 13 ] );
4611 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( hexNodes[ 12 ] );
4612 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( hexNodes[ 14 ] );
4613 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( hexNodes[ 16 ] );
4614 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( hexNodes[ 19 ] );
4615 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( hexNodes[ 17 ] );
4616 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( hexNodes[ 18 ] );
4618 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( hexNodes[ 20 ] );
4619 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( hexNodes[ 25 ] );
4620 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( hexNodes[ 21 ] );
4621 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( hexNodes[ 23 ] );
4622 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( hexNodes[ 24 ] );
4623 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( hexNodes[ 22 ] );
4625 gp_XYZ nCenterParams(0.5, 0.5, 0.5), nCenterCoords;
4626 SMESH_Block::ShellPoint( nCenterParams, pointsOnShapes, nCenterCoords );
4627 GetMeshDS()->MoveNode( hexNodes[26],
4628 nCenterCoords.X(), nCenterCoords.Y(), nCenterCoords.Z());
4633 // Move the apex of pyramid together with the most curved link.
4634 // TIDSortedNodeSet::iterator apexIt = apexOfPyramid.begin();
4635 // for ( ; apexIt != apexOfPyramid.end(); ++apexIt )
4637 // SMESH_TNodeXYZ apex = *apexIt;
4639 // gp_Vec maxMove( 0,0,0 );
4640 // double maxMoveSize2 = 0;
4642 // // shift of node index to get medium nodes between the base nodes
4643 // const int base2MediumShift = 5;
4645 // // find maximal movement of medium node
4646 // SMDS_ElemIteratorPtr volIt = apex._node->GetInverseElementIterator( SMDSAbs_Volume );
4647 // vector< const SMDS_MeshElement* > pyramids;
4648 // while ( volIt->more() )
4650 // const SMDS_MeshElement* pyram = volIt->next();
4651 // if ( pyram->GetEntityType() != SMDSEntity_Quad_Pyramid ) continue;
4652 // pyramids.push_back( pyram );
4654 // for ( int iBase = 0; iBase < apexIndex; ++iBase )
4656 // SMESH_TNodeXYZ medium = pyram->GetNode( iBase + base2MediumShift );
4657 // if ( medium._node->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
4659 // SMESH_TNodeXYZ n1 = pyram->GetNode( iBase );
4660 // SMESH_TNodeXYZ n2 = pyram->GetNode( ( iBase+1 ) % 4 );
4661 // gp_Pnt middle = 0.5 * ( n1 + n2 );
4662 // gp_Vec move( middle, medium );
4663 // double moveSize2 = move.SquareMagnitude();
4664 // if ( moveSize2 > maxMoveSize2 )
4665 // maxMove = move, maxMoveSize2 = moveSize2;
4671 // if ( maxMoveSize2 > 1e-20 )
4673 // apex += maxMove.XYZ();
4674 // GetMeshDS()->MoveNode( apex._node, apex.X(), apex.Y(), apex.Z());
4676 // // move medium nodes neighboring the apex to the middle
4677 // const int base2MediumShift_2 = 9;
4678 // for ( unsigned i = 0; i < pyramids.size(); ++i )
4679 // for ( int iBase = 0; iBase < apexIndex; ++iBase )
4681 // SMESH_TNodeXYZ base = pyramids[i]->GetNode( iBase );
4682 // const SMDS_MeshNode* medium = pyramids[i]->GetNode( iBase + base2MediumShift_2 );
4683 // gp_XYZ middle = 0.5 * ( apex + base );
4684 // GetMeshDS()->MoveNode( medium, middle.X(), middle.Y(), middle.Z());