1 // Copyright (C) 2007-2014 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, or (at your option) any later version.
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() );
245 BRepAdaptor_Surface surf( face, false );
246 if ( surf.IsUPeriodic() || surf.IsUClosed() ) {
247 myParIndex |= U_periodic;
248 myPar1[0] = surf.FirstUParameter();
249 myPar2[0] = surf.LastUParameter();
251 if ( surf.IsVPeriodic() || surf.IsVClosed() ) {
252 myParIndex |= V_periodic;
253 myPar1[1] = surf.FirstVParameter();
254 myPar2[1] = surf.LastVParameter();
258 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
260 // look for a "seam" edge, a real seam or an edge on period boundary
261 TopoDS_Edge edge = TopoDS::Edge( exp.Current() );
262 const int edgeID = meshDS->ShapeToIndex( edge );
265 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
266 const double du = Abs( uv1.Coord(1) - uv2.Coord(1) );
267 const double dv = Abs( uv1.Coord(2) - uv2.Coord(2) );
269 bool isSeam = BRep_Tool::IsClosed( edge, face );
270 if ( isSeam ) // real seam - having two pcurves on face
272 // pcurve can lie not on pediod boundary (22582, mesh_Quadratic_01/C9)
275 double u1 = uv1.Coord(1);
277 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
278 double u2 = uv1.Coord(1);
279 myPar1[0] = Min( u1, u2 );
280 myPar2[0] = Max( u1, u2 );
284 double v1 = uv1.Coord(2);
286 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
287 double v2 = uv1.Coord(2);
288 myPar1[1] = Min( v1, v2 );
289 myPar2[1] = Max( v1, v2 );
292 else //if ( !isSeam )
294 // one pcurve but on period boundary (22772, mesh_Quadratic_01/D1)
295 if (( myParIndex & U_periodic ) && du < Precision::PConfusion() )
297 isSeam = ( Abs( uv1.Coord(1) - myPar1[0] ) < Precision::PConfusion() ||
298 Abs( uv1.Coord(1) - myPar2[0] ) < Precision::PConfusion() );
300 else if (( myParIndex & V_periodic ) && dv < Precision::PConfusion() )
302 isSeam = ( Abs( uv1.Coord(2) - myPar1[1] ) < Precision::PConfusion() ||
303 Abs( uv1.Coord(2) - myPar2[1] ) < Precision::PConfusion() );
308 // store seam shape indices, negative if shape encounters twice
309 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
310 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
311 int vertexID = meshDS->ShapeToIndex( v.Current() );
312 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
316 // look for a degenerated edge
317 if ( SMESH_Algo::isDegenerated( edge )) {
318 myDegenShapeIds.insert( edgeID );
319 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
320 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
322 if ( !BRep_Tool::SameParameter( edge ) ||
323 !BRep_Tool::SameRange( edge ))
325 setPosOnShapeValidity( edgeID, false );
331 //=======================================================================
332 //function : GetNodeUVneedInFaceNode
333 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
334 // Return true if the face is periodic.
335 // If F is Null, answer about sub-shape set through IsQuadraticSubMesh() or
337 //=======================================================================
339 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
341 if ( F.IsNull() ) return !mySeamShapeIds.empty();
343 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
344 return !mySeamShapeIds.empty();
347 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
348 if ( !aSurface.IsNull() )
349 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
354 //=======================================================================
355 //function : IsMedium
357 //=======================================================================
359 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
360 const SMDSAbs_ElementType typeToCheck)
362 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
365 //=======================================================================
366 //function : GetSubShapeByNode
367 //purpose : Return support shape of a node
368 //=======================================================================
370 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
371 const SMESHDS_Mesh* meshDS)
373 int shapeID = node ? node->getshapeId() : 0;
374 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
375 return meshDS->IndexToShape( shapeID );
377 return TopoDS_Shape();
381 //=======================================================================
382 //function : AddTLinkNode
383 //purpose : add a link in my data structure
384 //=======================================================================
386 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
387 const SMDS_MeshNode* n2,
388 const SMDS_MeshNode* n12)
390 // add new record to map
391 SMESH_TLink link( n1, n2 );
392 myTLinkNodeMap.insert( make_pair(link,n12));
395 //================================================================================
397 * \brief Add quadratic links of edge to own data structure
399 //================================================================================
401 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
403 if ( edge && edge->IsQuadratic() )
404 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
410 //================================================================================
412 * \brief Add quadratic links of face to own data structure
414 //================================================================================
416 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
420 switch ( f->NbNodes() ) {
422 // myMapWithCentralNode.insert
423 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2) ),
425 // break; -- add medium nodes as well
427 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
428 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
429 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
432 // myMapWithCentralNode.insert
433 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2),f->GetNode(3) ),
435 // break; -- add medium nodes as well
437 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
438 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
439 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
440 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7)); break;
447 //================================================================================
449 * \brief Add quadratic links of volume to own data structure
451 //================================================================================
453 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
455 if ( volume->IsQuadratic() )
457 SMDS_VolumeTool vTool( volume );
458 const SMDS_MeshNode** nodes = vTool.GetNodes();
460 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
462 const int nbN = vTool.NbFaceNodes( iF );
463 const int* iNodes = vTool.GetFaceNodesIndices( iF );
464 for ( int i = 0; i < nbN; )
466 int iN1 = iNodes[i++];
467 int iN12 = iNodes[i++];
469 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
470 int linkID = iN1 * vTool.NbNodes() + iN2;
471 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
472 if ( it_isNew.second )
473 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
475 addedLinks.erase( it_isNew.first ); // each link encounters only twice
477 if ( vTool.NbNodes() == 27 )
479 const SMDS_MeshNode* nFCenter = nodes[ vTool.GetCenterNodeIndex( iF )];
480 if ( nFCenter->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
481 myMapWithCentralNode.insert
482 ( make_pair( TBiQuad( nodes[ iNodes[0]], nodes[ iNodes[1]],
483 nodes[ iNodes[2]], nodes[ iNodes[3]] ),
492 //================================================================================
494 * \brief Return true if position of nodes on the shape hasn't yet been checked or
495 * the positions proved to be invalid
497 //================================================================================
499 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
501 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
502 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
505 //================================================================================
507 * \brief Set validity of positions of nodes on the shape.
508 * Once set, validity is not changed
510 //================================================================================
512 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
514 std::map< int,bool >::iterator sh_ok =
515 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok)).first;
520 //=======================================================================
521 //function : ToFixNodeParameters
522 //purpose : Enables fixing node parameters on EDGEs and FACEs in
523 // GetNodeU(...,check=true), GetNodeUV(...,check=true), CheckNodeUV() and
524 // CheckNodeU() in case if a node lies on a shape set via SetSubShape().
526 //=======================================================================
528 void SMESH_MesherHelper::ToFixNodeParameters(bool toFix)
530 myFixNodeParameters = toFix;
534 //=======================================================================
535 //function : getUVOnSeam
536 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
537 //=======================================================================
539 gp_Pnt2d SMESH_MesherHelper::getUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
541 gp_Pnt2d result = uv1;
542 for ( int i = U_periodic; i <= V_periodic ; ++i )
544 if ( myParIndex & i )
546 double p1 = uv1.Coord( i );
547 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
548 if ( myParIndex == i ||
549 dp1 < ( myPar2[i-1] - myPar1[i-1] ) / 100. ||
550 dp2 < ( myPar2[i-1] - myPar1[i-1] ) / 100. )
552 double p2 = uv2.Coord( i );
553 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
554 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
555 result.SetCoord( i, p1Alt );
562 //=======================================================================
563 //function : GetNodeUV
564 //purpose : Return node UV on face
565 //=======================================================================
567 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
568 const SMDS_MeshNode* n,
569 const SMDS_MeshNode* n2,
572 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
574 const SMDS_PositionPtr Pos = n->GetPosition();
576 if ( Pos->GetTypeOfPosition() == SMDS_TOP_FACE )
578 // node has position on face
579 const SMDS_FacePosition* fpos = static_cast<const SMDS_FacePosition*>( Pos );
580 uv.SetCoord( fpos->GetUParameter(), fpos->GetVParameter() );
582 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*getFaceMaxTol( F ));
584 else if ( Pos->GetTypeOfPosition() == SMDS_TOP_EDGE )
586 // node has position on EDGE => it is needed to find
587 // corresponding EDGE from FACE, get pcurve for this
588 // EDGE and retrieve value from this pcurve
589 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( Pos );
590 const int edgeID = n->getshapeId();
591 const TopoDS_Edge& E = TopoDS::Edge( GetMeshDS()->IndexToShape( edgeID ));
592 double f, l, u = epos->GetUParameter();
593 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface( E, F, f, l );
594 bool validU = ( !C2d.IsNull() && ( f < u ) && ( u < l ));
595 if ( validU ) uv = C2d->Value( u );
596 else uv.SetCoord( Precision::Infinite(),0.);
597 if ( check || !validU )
598 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*getFaceMaxTol( F ),/*force=*/ !validU );
600 // for a node on a seam EDGE select one of UVs on 2 pcurves
601 if ( n2 && IsSeamShape( edgeID ))
603 uv = getUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
606 { // adjust uv to period
608 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
609 Standard_Boolean isUPeriodic = S->IsUPeriodic();
610 Standard_Boolean isVPeriodic = S->IsVPeriodic();
612 if ( isUPeriodic || isVPeriodic ) {
613 Standard_Real UF,UL,VF,VL;
614 S->Bounds(UF,UL,VF,VL);
615 if ( isUPeriodic ) newUV.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
616 if ( isVPeriodic ) newUV.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
620 gp_Pnt2d uv2 = GetNodeUV( F, n2, 0, check );
621 if ( isUPeriodic && Abs( uv.X()-uv2.X() ) < Abs( newUV.X()-uv2.X() ))
622 newUV.SetX( uv.X() );
623 if ( isVPeriodic && Abs( uv.Y()-uv2.Y() ) < Abs( newUV.Y()-uv2.Y() ))
624 newUV.SetY( uv.Y() );
630 else if ( Pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
632 if ( int vertexID = n->getshapeId() ) {
633 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
635 uv = BRep_Tool::Parameters( V, F );
638 catch (Standard_Failure& exc) {
641 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
642 uvOK = ( V == vert.Current() );
644 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
645 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
646 // get UV of a vertex closest to the node
648 gp_Pnt pn = XYZ( n );
649 for ( TopExp_Explorer vert( F,TopAbs_VERTEX ); !uvOK && vert.More(); vert.Next() ) {
650 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
651 gp_Pnt p = BRep_Tool::Pnt( curV );
652 double curDist = p.SquareDistance( pn );
653 if ( curDist < dist ) {
655 uv = BRep_Tool::Parameters( curV, F );
656 uvOK = ( dist < DBL_MIN );
662 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
663 for ( ; it.More(); it.Next() ) {
664 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
665 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
667 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
668 if ( !C2d.IsNull() ) {
669 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
670 uv = C2d->Value( u );
678 if ( n2 && IsSeamShape( vertexID ))
680 bool isSeam = ( myShape.IsSame( F ));
682 SMESH_MesherHelper h( *myMesh );
684 isSeam = IsSeamShape( vertexID );
688 uv = getUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
694 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*getFaceMaxTol( F ));
703 //=======================================================================
704 //function : CheckNodeUV
705 //purpose : Check and fix node UV on a face
706 //=======================================================================
708 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
709 const SMDS_MeshNode* n,
713 double distXYZ[4]) const
715 int shapeID = n->getshapeId();
717 if (( infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ))) ||
719 ( uv.X() == 0. && uv.Y() == 0. ) ||
720 ( toCheckPosOnShape( shapeID )))
722 // check that uv is correct
724 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
725 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
727 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
729 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
731 setPosOnShapeValidity( shapeID, false );
732 if ( !infinit && distXYZ ) {
733 surfPnt.Transform( loc );
735 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
737 // uv incorrect, project the node to surface
738 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
739 projector.Perform( nodePnt );
740 if ( !projector.IsDone() || projector.NbPoints() < 1 )
742 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
745 Quantity_Parameter U,V;
746 projector.LowerDistanceParameters(U,V);
748 surfPnt = surface->Value( U, V );
749 dist = nodePnt.Distance( surfPnt );
751 surfPnt.Transform( loc );
753 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
757 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
760 // store the fixed UV on the face
761 if ( myShape.IsSame(F) && shapeID == myShapeID && myFixNodeParameters )
762 const_cast<SMDS_MeshNode*>(n)->SetPosition
763 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
765 else if ( myShape.IsSame(F) && uv.Modulus() > numeric_limits<double>::min() )
767 setPosOnShapeValidity( shapeID, true );
773 //=======================================================================
774 //function : GetProjector
775 //purpose : Return projector intitialized by given face without location, which is returned
776 //=======================================================================
778 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
779 TopLoc_Location& loc,
782 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
783 int faceID = GetMeshDS()->ShapeToIndex( F );
784 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
785 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
786 if ( i_proj == i2proj.end() )
788 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
789 double U1, U2, V1, V2;
790 surface->Bounds(U1, U2, V1, V2);
791 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
792 proj->Init( surface, U1, U2, V1, V2, tol );
793 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
795 return *( i_proj->second );
800 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
801 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
802 gp_XY_FunPtr(Subtracted);
805 //=======================================================================
806 //function : applyIn2D
807 //purpose : Perform given operation on two 2d points in parameric space of given surface.
808 // It takes into account period of the surface. Use gp_XY_FunPtr macro
809 // to easily define pointer to function of gp_XY class.
810 //=======================================================================
812 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
816 const bool resultInPeriod)
818 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
819 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
820 if ( !isUPeriodic && !isVPeriodic )
823 // move uv2 not far than half-period from uv1
825 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
827 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
830 gp_XY res = fun( uv1, gp_XY(u2,v2) );
832 // move result within period
833 if ( resultInPeriod )
835 Standard_Real UF,UL,VF,VL;
836 surface->Bounds(UF,UL,VF,VL);
838 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
840 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
845 //=======================================================================
846 //function : GetMiddleUV
847 //purpose : Return middle UV taking in account surface period
848 //=======================================================================
850 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
855 // the proper place of getting basic surface seems to be in applyIn2D()
856 // but we put it here to decrease a risk of regressions just before releasing a version
857 Handle(Geom_Surface) surf = surface;
858 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
859 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
861 return applyIn2D( surf, p1, p2, & AverageUV );
864 //=======================================================================
865 //function : GetCenterUV
866 //purpose : Return UV for the central node of a biquadratic triangle
867 //=======================================================================
869 gp_XY SMESH_MesherHelper::GetCenterUV(const gp_XY& uv1,
875 bool * isBadTria/*=0*/)
878 gp_XY uvAvg = ( uv12 + uv23 + uv31 ) / 3.;
880 if (( badTria = (( uvAvg - uv1 ) * ( uvAvg - uv23 ) > 0 )))
881 uvAvg = ( uv1 + uv23 ) / 2.;
882 else if (( badTria = (( uvAvg - uv2 ) * ( uvAvg - uv31 ) > 0 )))
883 uvAvg = ( uv2 + uv31 ) / 2.;
884 else if (( badTria = (( uvAvg - uv3 ) * ( uvAvg - uv12 ) > 0 )))
885 uvAvg = ( uv3 + uv12 ) / 2.;
888 *isBadTria = badTria;
892 //=======================================================================
893 //function : GetNodeU
894 //purpose : Return node U on edge
895 //=======================================================================
897 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
898 const SMDS_MeshNode* n,
899 const SMDS_MeshNode* inEdgeNode,
902 double param = Precision::Infinite();
904 const SMDS_PositionPtr pos = n->GetPosition();
905 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
907 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
908 param = epos->GetUParameter();
910 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
912 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
915 BRep_Tool::Range( E, f,l );
916 double uInEdge = GetNodeU( E, inEdgeNode );
917 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
921 SMESHDS_Mesh * meshDS = GetMeshDS();
922 int vertexID = n->getshapeId();
923 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
924 param = BRep_Tool::Parameter( V, E );
929 double tol = BRep_Tool::Tolerance( E );
930 double f,l; BRep_Tool::Range( E, f,l );
931 bool force = ( param < f-tol || param > l+tol );
932 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
933 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
935 *check = CheckNodeU( E, n, param, 2*tol, force );
940 //=======================================================================
941 //function : CheckNodeU
942 //purpose : Check and fix node U on an edge
943 // Return false if U is bad and could not be fixed
944 //=======================================================================
946 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
947 const SMDS_MeshNode* n,
951 double distXYZ[4]) const
953 int shapeID = n->getshapeId();
955 if (( infinit = Precision::IsInfinite( u )) ||
958 ( toCheckPosOnShape( shapeID )))
960 TopLoc_Location loc; double f,l;
961 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
962 if ( curve.IsNull() ) // degenerated edge
964 if ( u+tol < f || u-tol > l )
966 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
972 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
973 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
978 curvPnt = curve->Value( u );
979 dist = nodePnt.Distance( curvPnt );
981 curvPnt.Transform( loc );
983 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
988 setPosOnShapeValidity( shapeID, false );
989 // u incorrect, project the node to the curve
990 int edgeID = GetMeshDS()->ShapeToIndex( E );
991 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
992 TID2ProjectorOnCurve::iterator i_proj =
993 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
994 if ( !i_proj->second )
996 i_proj->second = new GeomAPI_ProjectPointOnCurve();
997 i_proj->second->Init( curve, f, l );
999 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
1000 projector->Perform( nodePnt );
1001 if ( projector->NbPoints() < 1 )
1003 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
1006 Quantity_Parameter U = projector->LowerDistanceParameter();
1008 MESSAGE(" f " << f << " l " << l << " u " << u);
1009 curvPnt = curve->Value( u );
1010 dist = nodePnt.Distance( curvPnt );
1012 curvPnt.Transform( loc );
1014 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
1018 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
1019 MESSAGE("distance " << dist << " " << tol );
1022 // store the fixed U on the edge
1023 if ( myShape.IsSame(E) && shapeID == myShapeID && myFixNodeParameters )
1024 const_cast<SMDS_MeshNode*>(n)->SetPosition
1025 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
1027 else if ( fabs( u ) > numeric_limits<double>::min() )
1029 setPosOnShapeValidity( shapeID, true );
1031 if (( u < f-tol || u > l+tol ) && force )
1033 MESSAGE("u < f-tol || u > l+tol ; u " << u << " f " << f << " l " << l);
1034 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
1037 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
1038 double period = curve->Period();
1039 u = ( u < f ) ? u + period : u - period;
1041 catch (Standard_Failure& exc)
1051 //=======================================================================
1052 //function : GetMediumPos
1053 //purpose : Return index and type of the shape (EDGE or FACE only) to
1054 // set a medium node on
1055 //param : useCurSubShape - if true, returns the shape set via SetSubShape()
1057 //param : expectedSupport - shape type corresponding to element being created,
1058 // e.g TopAbs_EDGE if SMDSAbs_Edge is created
1059 // basing on \a n1 and \a n2
1060 // Calling GetMediumPos() with useCurSubShape=true is OK only for the
1061 // case where the lower dim mesh is already constructed and converted to quadratic,
1062 // else, nodes on EDGEs are assigned to FACE, for example.
1063 //=======================================================================
1065 std::pair<int, TopAbs_ShapeEnum>
1066 SMESH_MesherHelper::GetMediumPos(const SMDS_MeshNode* n1,
1067 const SMDS_MeshNode* n2,
1068 const bool useCurSubShape,
1069 TopAbs_ShapeEnum expectedSupport)
1071 if ( useCurSubShape && !myShape.IsNull() )
1072 return std::make_pair( myShapeID, myShape.ShapeType() );
1074 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1078 if (( myShapeID == n1->getshapeId() || myShapeID == n2->getshapeId() ) && myShapeID > 0 )
1080 shapeType = myShape.ShapeType();
1081 shapeID = myShapeID;
1083 else if ( n1->getshapeId() == n2->getshapeId() )
1085 shapeID = n2->getshapeId();
1086 shape = GetSubShapeByNode( n1, GetMeshDS() );
1088 else // 2 different shapes
1090 const SMDS_TypeOfPosition Pos1 = n1->GetPosition()->GetTypeOfPosition();
1091 const SMDS_TypeOfPosition Pos2 = n2->GetPosition()->GetTypeOfPosition();
1093 if ( Pos1 == SMDS_TOP_3DSPACE || Pos2 == SMDS_TOP_3DSPACE )
1097 else if ( Pos1 == SMDS_TOP_FACE || Pos2 == SMDS_TOP_FACE )
1100 if ( Pos1 != SMDS_TOP_FACE || Pos2 != SMDS_TOP_FACE ) // not 2 FACEs
1102 if ( Pos1 != SMDS_TOP_FACE ) std::swap( n1,n2 );
1103 TopoDS_Shape F = GetSubShapeByNode( n1, GetMeshDS() );
1104 TopoDS_Shape S = GetSubShapeByNode( n2, GetMeshDS() );
1105 if ( IsSubShape( S, F ))
1107 shapeType = TopAbs_FACE;
1108 shapeID = n1->getshapeId();
1112 else if ( Pos1 == SMDS_TOP_EDGE && Pos2 == SMDS_TOP_EDGE )
1114 TopoDS_Shape E1 = GetSubShapeByNode( n1, GetMeshDS() );
1115 TopoDS_Shape E2 = GetSubShapeByNode( n2, GetMeshDS() );
1116 shape = GetCommonAncestor( E1, E2, *myMesh, TopAbs_FACE );
1118 else if ( Pos1 == SMDS_TOP_VERTEX && Pos2 == SMDS_TOP_VERTEX )
1120 TopoDS_Shape V1 = GetSubShapeByNode( n1, GetMeshDS() );
1121 TopoDS_Shape V2 = GetSubShapeByNode( n2, GetMeshDS() );
1122 shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_EDGE );
1123 if ( shape.IsNull() ) shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_FACE );
1125 else // on VERTEX and EDGE
1127 if ( Pos1 != SMDS_TOP_VERTEX ) std::swap( n1,n2 );
1128 TopoDS_Shape V = GetSubShapeByNode( n1, GetMeshDS() );
1129 TopoDS_Shape E = GetSubShapeByNode( n2, GetMeshDS() );
1130 if ( IsSubShape( V, E ))
1133 shape = GetCommonAncestor( V, E, *myMesh, TopAbs_FACE );
1137 if ( !shape.IsNull() )
1140 shapeID = GetMeshDS()->ShapeToIndex( shape );
1141 shapeType = shape.ShapeType(); // EDGE or FACE
1143 if ( expectedSupport < shapeType &&
1144 expectedSupport != TopAbs_SHAPE &&
1145 !myShape.IsNull() &&
1146 myShape.ShapeType() == expectedSupport )
1148 // e.g. a side of triangle connects nodes on the same EDGE but does not
1149 // lie on this EDGE (an arc with a coarse mesh)
1150 // => shapeType == TopAbs_EDGE, expectedSupport == TopAbs_FACE;
1151 // hope that myShape is a right shape, return it if the found shape
1152 // has converted elements of corresponding dim (segments in our example)
1153 int nbConvertedElems = 0;
1154 SMDSAbs_ElementType type = ( shapeType == TopAbs_FACE ? SMDSAbs_Face : SMDSAbs_Edge );
1155 for ( int iN = 0; iN < 2; ++iN )
1157 const SMDS_MeshNode* n = iN ? n2 : n1;
1158 SMDS_ElemIteratorPtr it = n->GetInverseElementIterator( type );
1159 while ( it->more() )
1161 const SMDS_MeshElement* elem = it->next();
1162 if ( elem->getshapeId() == shapeID &&
1163 elem->IsQuadratic() )
1170 if ( nbConvertedElems == 2 )
1172 shapeType = myShape.ShapeType();
1173 shapeID = myShapeID;
1177 return make_pair( shapeID, shapeType );
1180 //=======================================================================
1181 //function : GetCentralNode
1182 //purpose : Return existing or create a new central node for a quardilateral
1183 // quadratic face given its 8 nodes.
1184 //@param : force3d - true means node creation in between the given nodes,
1185 // else node position is found on a geometrical face if any.
1186 //=======================================================================
1188 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1189 const SMDS_MeshNode* n2,
1190 const SMDS_MeshNode* n3,
1191 const SMDS_MeshNode* n4,
1192 const SMDS_MeshNode* n12,
1193 const SMDS_MeshNode* n23,
1194 const SMDS_MeshNode* n34,
1195 const SMDS_MeshNode* n41,
1198 SMDS_MeshNode *centralNode = 0; // central node to return
1200 // Find an existing central node
1202 TBiQuad keyOfMap(n1,n2,n3,n4);
1203 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1204 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1205 if ( itMapCentralNode != myMapWithCentralNode.end() )
1207 return (*itMapCentralNode).second;
1210 // Get type of shape for the new central node
1212 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1216 TopTools_ListIteratorOfListOfShape it;
1218 std::map< int, int > faceId2nbNodes;
1219 std::map< int, int > ::iterator itMapWithIdFace;
1221 SMESHDS_Mesh* meshDS = GetMeshDS();
1223 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1224 // on sub-shapes of the FACE
1225 if ( GetMesh()->HasShapeToMesh() )
1227 const SMDS_MeshNode* nodes[] = { n1, n2, n3, n4 };
1228 for(int i = 0; i < 4; i++)
1230 shape = GetSubShapeByNode( nodes[i], meshDS );
1231 if ( shape.IsNull() ) break;
1232 if ( shape.ShapeType() == TopAbs_SOLID )
1234 solidID = nodes[i]->getshapeId();
1235 shapeType = TopAbs_SOLID;
1238 if ( shape.ShapeType() == TopAbs_FACE )
1240 faceID = nodes[i]->getshapeId();
1241 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1242 itMapWithIdFace->second++;
1246 PShapeIteratorPtr it = GetAncestors( shape, *GetMesh(), TopAbs_FACE );
1247 while ( const TopoDS_Shape* face = it->next() )
1249 faceID = meshDS->ShapeToIndex( *face );
1250 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 )).first;
1251 itMapWithIdFace->second++;
1256 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1258 // find ID of the FACE the four corner nodes belong to
1259 itMapWithIdFace = faceId2nbNodes.begin();
1260 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1262 if ( itMapWithIdFace->second == 4 )
1264 shapeType = TopAbs_FACE;
1265 faceID = (*itMapWithIdFace).first;
1272 if ( shapeType == TopAbs_FACE )
1274 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1281 bool toCheck = true;
1282 if ( !F.IsNull() && !force3d )
1284 uvAvg = calcTFI (0.5, 0.5,
1285 GetNodeUV(F,n1,n3,&toCheck), GetNodeUV(F,n2,n4,&toCheck),
1286 GetNodeUV(F,n3,n1,&toCheck), GetNodeUV(F,n4,n2,&toCheck),
1287 GetNodeUV(F,n12,n3), GetNodeUV(F,n23,n4),
1288 GetNodeUV(F,n34,n2), GetNodeUV(F,n41,n2));
1289 TopLoc_Location loc;
1290 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1291 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1292 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1293 // if ( mySetElemOnShape ) node is not elem!
1294 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1296 else // ( force3d || F.IsNull() )
1298 P = calcTFI (0.5, 0.5,
1299 SMESH_TNodeXYZ(n1), SMESH_TNodeXYZ(n2),
1300 SMESH_TNodeXYZ(n3), SMESH_TNodeXYZ(n4),
1301 SMESH_TNodeXYZ(n12), SMESH_TNodeXYZ(n23),
1302 SMESH_TNodeXYZ(n34), SMESH_TNodeXYZ(n41));
1303 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1305 if ( !F.IsNull() ) // force3d
1307 uvAvg = (GetNodeUV(F,n1,n3,&toCheck) +
1308 GetNodeUV(F,n2,n4,&toCheck) +
1309 GetNodeUV(F,n3,n1,&toCheck) +
1310 GetNodeUV(F,n4,n2,&toCheck)) / 4;
1311 //CheckNodeUV( F, centralNode, uvAvg, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1312 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1314 else if ( solidID > 0 )
1316 meshDS->SetNodeInVolume( centralNode, solidID );
1318 else if ( myShapeID > 0 && mySetElemOnShape )
1320 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1323 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1327 //=======================================================================
1328 //function : GetCentralNode
1329 //purpose : Return existing or create a new central node for a
1330 // quadratic triangle given its 6 nodes.
1331 //@param : force3d - true means node creation in between the given nodes,
1332 // else node position is found on a geometrical face if any.
1333 //=======================================================================
1335 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1336 const SMDS_MeshNode* n2,
1337 const SMDS_MeshNode* n3,
1338 const SMDS_MeshNode* n12,
1339 const SMDS_MeshNode* n23,
1340 const SMDS_MeshNode* n31,
1343 SMDS_MeshNode *centralNode = 0; // central node to return
1345 // Find an existing central node
1347 TBiQuad keyOfMap(n1,n2,n3);
1348 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1349 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1350 if ( itMapCentralNode != myMapWithCentralNode.end() )
1352 return (*itMapCentralNode).second;
1355 // Get type of shape for the new central node
1357 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1361 TopTools_ListIteratorOfListOfShape it;
1363 std::map< int, int > faceId2nbNodes;
1364 std::map< int, int > ::iterator itMapWithIdFace;
1366 SMESHDS_Mesh* meshDS = GetMeshDS();
1368 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1369 // on sub-shapes of the FACE
1370 if ( GetMesh()->HasShapeToMesh() )
1372 const SMDS_MeshNode* nodes[] = { n1, n2, n3 };
1373 for(int i = 0; i < 3; i++)
1375 shape = GetSubShapeByNode( nodes[i], meshDS );
1376 if ( shape.IsNull() ) break;
1377 if ( shape.ShapeType() == TopAbs_SOLID )
1379 solidID = nodes[i]->getshapeId();
1380 shapeType = TopAbs_SOLID;
1383 if ( shape.ShapeType() == TopAbs_FACE )
1385 faceID = nodes[i]->getshapeId();
1386 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1387 itMapWithIdFace->second++;
1391 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1392 while ( const TopoDS_Shape* face = it->next() )
1394 faceID = meshDS->ShapeToIndex( *face );
1395 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1396 itMapWithIdFace->second++;
1401 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1403 // find ID of the FACE the four corner nodes belong to
1404 itMapWithIdFace = faceId2nbNodes.begin();
1405 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1407 if ( itMapWithIdFace->second == 3 )
1409 shapeType = TopAbs_FACE;
1410 faceID = (*itMapWithIdFace).first;
1420 if ( shapeType == TopAbs_FACE )
1422 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1424 gp_XY uv1 = GetNodeUV( F, n1, n23, &check );
1425 gp_XY uv2 = GetNodeUV( F, n2, n31, &check );
1426 gp_XY uv3 = GetNodeUV( F, n3, n12, &check );
1427 gp_XY uv12 = GetNodeUV( F, n12, n3, &check );
1428 gp_XY uv23 = GetNodeUV( F, n23, n1, &check );
1429 gp_XY uv31 = GetNodeUV( F, n31, n2, &check );
1430 uvAvg = GetCenterUV( uv1,uv2,uv3, uv12,uv23,uv31, &badTria );
1435 // Create a central node
1438 if ( !F.IsNull() && !force3d )
1440 TopLoc_Location loc;
1441 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1442 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1443 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1444 // if ( mySetElemOnShape ) node is not elem!
1445 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1447 else // ( force3d || F.IsNull() )
1449 P = ( SMESH_TNodeXYZ( n12 ) +
1450 SMESH_TNodeXYZ( n23 ) +
1451 SMESH_TNodeXYZ( n31 ) ) / 3;
1452 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1454 if ( !F.IsNull() ) // force3d
1456 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1458 else if ( solidID > 0 )
1460 meshDS->SetNodeInVolume( centralNode, solidID );
1462 else if ( myShapeID > 0 && mySetElemOnShape )
1464 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1467 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1471 //=======================================================================
1472 //function : GetMediumNode
1473 //purpose : Return existing or create a new medium node between given ones
1474 //=======================================================================
1476 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
1477 const SMDS_MeshNode* n2,
1479 TopAbs_ShapeEnum expectedSupport)
1481 // Find existing node
1483 SMESH_TLink link(n1,n2);
1484 ItTLinkNode itLN = myTLinkNodeMap.find( link );
1485 if ( itLN != myTLinkNodeMap.end() ) {
1486 return (*itLN).second;
1489 // Create medium node
1492 SMESHDS_Mesh* meshDS = GetMeshDS();
1494 if ( IsSeamShape( n1->getshapeId() ))
1495 // to get a correct UV of a node on seam, the second node must have checked UV
1496 std::swap( n1, n2 );
1498 // get type of shape for the new medium node
1499 int faceID = -1, edgeID = -1;
1500 TopoDS_Edge E; double u [2];
1501 TopoDS_Face F; gp_XY uv[2];
1502 bool uvOK[2] = { false, false };
1503 const bool useCurSubShape = ( !myShape.IsNull() && myShape.ShapeType() == TopAbs_EDGE );
1505 pair<int, TopAbs_ShapeEnum> pos = GetMediumPos( n1, n2, useCurSubShape, expectedSupport );
1507 // get positions of the given nodes on shapes
1508 if ( pos.second == TopAbs_FACE )
1510 F = TopoDS::Face(meshDS->IndexToShape( faceID = pos.first ));
1511 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
1512 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
1514 else if ( pos.second == TopAbs_EDGE )
1516 const SMDS_PositionPtr Pos1 = n1->GetPosition();
1517 const SMDS_PositionPtr Pos2 = n2->GetPosition();
1518 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1519 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1520 n1->getshapeId() != n2->getshapeId() )
1523 return getMediumNodeOnComposedWire(n1,n2,force3d);
1525 E = TopoDS::Edge(meshDS->IndexToShape( edgeID = pos.first ));
1527 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
1528 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
1530 catch ( Standard_Failure& f )
1532 // issue 22502 / a node is on VERTEX not belonging to E
1533 // issue 22568 / both nodes are on non-connected VERTEXes
1534 return getMediumNodeOnComposedWire(n1,n2,force3d);
1538 if ( !force3d & uvOK[0] && uvOK[1] )
1540 // we try to create medium node using UV parameters of
1541 // nodes, else - medium between corresponding 3d points
1544 //if ( uvOK[0] && uvOK[1] )
1546 if ( IsDegenShape( n1->getshapeId() )) {
1547 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
1548 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
1550 else if ( IsDegenShape( n2->getshapeId() )) {
1551 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
1552 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
1554 TopLoc_Location loc;
1555 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
1556 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
1557 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
1558 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1559 // if ( mySetElemOnShape ) node is not elem!
1560 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
1561 myTLinkNodeMap.insert(make_pair(link,n12));
1565 else if ( !E.IsNull() )
1568 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1571 Standard_Boolean isPeriodic = C->IsPeriodic();
1574 Standard_Real Period = C->Period();
1575 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1576 Standard_Real pmid = (u[0]+p)/2.;
1577 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1582 gp_Pnt P = C->Value( U );
1583 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1584 //if ( mySetElemOnShape ) node is not elem!
1585 meshDS->SetNodeOnEdge(n12, edgeID, U);
1586 myTLinkNodeMap.insert(make_pair(link,n12));
1593 double x = ( n1->X() + n2->X() )/2.;
1594 double y = ( n1->Y() + n2->Y() )/2.;
1595 double z = ( n1->Z() + n2->Z() )/2.;
1596 n12 = meshDS->AddNode(x,y,z);
1598 //if ( mySetElemOnShape ) node is not elem!
1602 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1603 CheckNodeUV( F, n12, UV, 2 * BRep_Tool::Tolerance( F ), /*force=*/true);
1604 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1606 else if ( !E.IsNull() )
1608 double U = ( u[0] + u[1] ) / 2.;
1609 CheckNodeU( E, n12, U, 2 * BRep_Tool::Tolerance( E ), /*force=*/true);
1610 meshDS->SetNodeOnEdge(n12, edgeID, U);
1612 else if ( myShapeID > 0 && mySetElemOnShape )
1614 meshDS->SetMeshElementOnShape(n12, myShapeID);
1618 myTLinkNodeMap.insert( make_pair( link, n12 ));
1622 //================================================================================
1624 * \brief Makes a medium node if nodes reside different edges
1626 //================================================================================
1628 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1629 const SMDS_MeshNode* n2,
1632 SMESH_TNodeXYZ p1( n1 ), p2( n2 );
1633 gp_Pnt middle = 0.5 * p1 + 0.5 * p2;
1634 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1636 // To find position on edge and 3D position for n12,
1637 // project <middle> to 2 edges and select projection most close to <middle>
1639 TopoDS_Edge bestEdge;
1640 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4], f,l;
1642 // get shapes under the nodes
1643 TopoDS_Shape shape[2];
1645 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1647 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1648 TopoDS_Shape S = GetSubShapeByNode( n, GetMeshDS() );
1650 shape[ nbShapes++ ] = S;
1653 vector< TopoDS_Shape > edges;
1654 for ( int iS = 0; iS < nbShapes; ++iS )
1656 switch ( shape[iS].ShapeType() ) {
1659 edges.push_back( shape[iS] );
1665 if ( nbShapes == 2 && iS==0 && shape[1-iS].ShapeType() == TopAbs_VERTEX )
1666 edge = GetCommonAncestor( shape[iS], shape[1-iS], *myMesh, TopAbs_EDGE );
1668 if ( edge.IsNull() )
1670 PShapeIteratorPtr eIt = GetAncestors( shape[iS], *myMesh, TopAbs_EDGE );
1671 while( const TopoDS_Shape* e = eIt->next() )
1672 edges.push_back( *e );
1678 if ( nbShapes == 1 || shape[1-iS].ShapeType() < TopAbs_EDGE )
1679 for ( TopExp_Explorer e( shape[iS], TopAbs_EDGE ); e.More(); e.Next() )
1680 edges.push_back( e.Current() );
1687 // project to get U of projection and distance from middle to projection
1688 for ( size_t iE = 0; iE < edges.size(); ++iE )
1690 const TopoDS_Edge& edge = TopoDS::Edge( edges[ iE ]);
1691 distXYZ[0] = distMiddleProj;
1693 CheckNodeU( edge, n12, testU, 2 * BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1694 if ( distXYZ[0] < distMiddleProj )
1696 distMiddleProj = distXYZ[0];
1702 // // both projections failed; set n12 on the edge of n1 with U of a common vertex
1703 // TopoDS_Vertex vCommon;
1704 // if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1705 // u = BRep_Tool::Parameter( vCommon, edges[0] );
1708 // double f,l, u0 = GetNodeU( edges[0], n1 );
1709 // BRep_Tool::Range( edges[0],f,l );
1710 // u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1713 // distMiddleProj = 0;
1716 if ( !bestEdge.IsNull() )
1718 // move n12 to position of a successfull projection
1719 //double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1720 if ( !force3d /*&& distMiddleProj > 2*tol*/ )
1722 TopLoc_Location loc;
1723 Handle(Geom_Curve) curve = BRep_Tool::Curve( bestEdge,loc,f,l );
1724 gp_Pnt p = curve->Value( u ).Transformed( loc );
1725 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1727 //if ( mySetElemOnShape ) node is not elem!
1729 int edgeID = GetMeshDS()->ShapeToIndex( bestEdge );
1730 if ( edgeID != n12->getshapeId() )
1731 GetMeshDS()->UnSetNodeOnShape( n12 );
1732 GetMeshDS()->SetNodeOnEdge(n12, edgeID, u);
1735 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1740 //=======================================================================
1741 //function : AddNode
1742 //purpose : Creates a node
1743 //=======================================================================
1745 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID,
1748 SMESHDS_Mesh * meshDS = GetMeshDS();
1749 SMDS_MeshNode* node = 0;
1751 node = meshDS->AddNodeWithID( x, y, z, ID );
1753 node = meshDS->AddNode( x, y, z );
1754 if ( mySetElemOnShape && myShapeID > 0 ) { // node is not elem ?
1755 switch ( myShape.ShapeType() ) {
1756 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1757 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1758 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID, u, v); break;
1759 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID, u); break;
1760 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1767 //=======================================================================
1768 //function : AddEdge
1769 //purpose : Creates quadratic or linear edge
1770 //=======================================================================
1772 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1773 const SMDS_MeshNode* n2,
1777 SMESHDS_Mesh * meshDS = GetMeshDS();
1779 SMDS_MeshEdge* edge = 0;
1780 if (myCreateQuadratic) {
1781 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1783 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1785 edge = meshDS->AddEdge(n1, n2, n12);
1789 edge = meshDS->AddEdgeWithID(n1, n2, id);
1791 edge = meshDS->AddEdge(n1, n2);
1794 if ( mySetElemOnShape && myShapeID > 0 )
1795 meshDS->SetMeshElementOnShape( edge, myShapeID );
1800 //=======================================================================
1801 //function : AddFace
1802 //purpose : Creates quadratic or linear triangle
1803 //=======================================================================
1805 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1806 const SMDS_MeshNode* n2,
1807 const SMDS_MeshNode* n3,
1811 SMESHDS_Mesh * meshDS = GetMeshDS();
1812 SMDS_MeshFace* elem = 0;
1814 if( n1==n2 || n2==n3 || n3==n1 )
1817 if(!myCreateQuadratic) {
1819 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1821 elem = meshDS->AddFace(n1, n2, n3);
1824 const SMDS_MeshNode* n12 = GetMediumNode( n1, n2, force3d, TopAbs_FACE );
1825 const SMDS_MeshNode* n23 = GetMediumNode( n2, n3, force3d, TopAbs_FACE );
1826 const SMDS_MeshNode* n31 = GetMediumNode( n3, n1, force3d, TopAbs_FACE );
1827 if(myCreateBiQuadratic)
1829 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n12, n23, n31, force3d);
1831 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, nCenter, id);
1833 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31, nCenter);
1838 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1840 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1843 if ( mySetElemOnShape && myShapeID > 0 )
1844 meshDS->SetMeshElementOnShape( elem, myShapeID );
1849 //=======================================================================
1850 //function : AddFace
1851 //purpose : Creates bi-quadratic, quadratic or linear quadrangle
1852 //=======================================================================
1854 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1855 const SMDS_MeshNode* n2,
1856 const SMDS_MeshNode* n3,
1857 const SMDS_MeshNode* n4,
1861 SMESHDS_Mesh * meshDS = GetMeshDS();
1862 SMDS_MeshFace* elem = 0;
1865 return AddFace(n1,n3,n4,id,force3d);
1868 return AddFace(n1,n2,n4,id,force3d);
1871 return AddFace(n1,n2,n3,id,force3d);
1874 return AddFace(n1,n2,n4,id,force3d);
1877 return AddFace(n1,n2,n3,id,force3d);
1880 return AddFace(n1,n2,n3,id,force3d);
1883 if(!myCreateQuadratic) {
1885 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1887 elem = meshDS->AddFace(n1, n2, n3, n4);
1890 const SMDS_MeshNode* n12 = GetMediumNode( n1, n2, force3d, TopAbs_FACE );
1891 const SMDS_MeshNode* n23 = GetMediumNode( n2, n3, force3d, TopAbs_FACE );
1892 const SMDS_MeshNode* n34 = GetMediumNode( n3, n4, force3d, TopAbs_FACE );
1893 const SMDS_MeshNode* n41 = GetMediumNode( n4, n1, force3d, TopAbs_FACE );
1894 if(myCreateBiQuadratic)
1896 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n4, n12, n23, n34, n41, force3d);
1898 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, nCenter, id);
1900 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41, nCenter);
1905 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1907 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1910 if ( mySetElemOnShape && myShapeID > 0 )
1911 meshDS->SetMeshElementOnShape( elem, myShapeID );
1916 //=======================================================================
1917 //function : AddPolygonalFace
1918 //purpose : Creates polygon, with additional nodes in quadratic mesh
1919 //=======================================================================
1921 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1925 SMESHDS_Mesh * meshDS = GetMeshDS();
1926 SMDS_MeshFace* elem = 0;
1928 if(!myCreateQuadratic) {
1930 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1932 elem = meshDS->AddPolygonalFace(nodes);
1935 vector<const SMDS_MeshNode*> newNodes;
1936 for ( int i = 0; i < nodes.size(); ++i )
1938 const SMDS_MeshNode* n1 = nodes[i];
1939 const SMDS_MeshNode* n2 = nodes[(i+1)%nodes.size()];
1940 const SMDS_MeshNode* n12 = GetMediumNode( n1, n2, force3d, TopAbs_FACE );
1941 newNodes.push_back( n1 );
1942 newNodes.push_back( n12 );
1945 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1947 elem = meshDS->AddPolygonalFace(newNodes);
1949 if ( mySetElemOnShape && myShapeID > 0 )
1950 meshDS->SetMeshElementOnShape( elem, myShapeID );
1955 //=======================================================================
1956 //function : AddVolume
1957 //purpose : Creates quadratic or linear prism
1958 //=======================================================================
1960 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1961 const SMDS_MeshNode* n2,
1962 const SMDS_MeshNode* n3,
1963 const SMDS_MeshNode* n4,
1964 const SMDS_MeshNode* n5,
1965 const SMDS_MeshNode* n6,
1969 SMESHDS_Mesh * meshDS = GetMeshDS();
1970 SMDS_MeshVolume* elem = 0;
1971 if(!myCreateQuadratic) {
1973 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1975 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1978 const SMDS_MeshNode* n12 = GetMediumNode( n1, n2, force3d, TopAbs_SOLID );
1979 const SMDS_MeshNode* n23 = GetMediumNode( n2, n3, force3d, TopAbs_SOLID );
1980 const SMDS_MeshNode* n31 = GetMediumNode( n3, n1, force3d, TopAbs_SOLID );
1982 const SMDS_MeshNode* n45 = GetMediumNode( n4, n5, force3d, TopAbs_SOLID );
1983 const SMDS_MeshNode* n56 = GetMediumNode( n5, n6, force3d, TopAbs_SOLID );
1984 const SMDS_MeshNode* n64 = GetMediumNode( n6, n4, force3d, TopAbs_SOLID );
1986 const SMDS_MeshNode* n14 = GetMediumNode( n1, n4, force3d, TopAbs_SOLID );
1987 const SMDS_MeshNode* n25 = GetMediumNode( n2, n5, force3d, TopAbs_SOLID );
1988 const SMDS_MeshNode* n36 = GetMediumNode( n3, n6, force3d, TopAbs_SOLID );
1991 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1992 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1994 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1995 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1997 if ( mySetElemOnShape && myShapeID > 0 )
1998 meshDS->SetMeshElementOnShape( elem, myShapeID );
2003 //=======================================================================
2004 //function : AddVolume
2005 //purpose : Creates quadratic or linear tetrahedron
2006 //=======================================================================
2008 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2009 const SMDS_MeshNode* n2,
2010 const SMDS_MeshNode* n3,
2011 const SMDS_MeshNode* n4,
2015 SMESHDS_Mesh * meshDS = GetMeshDS();
2016 SMDS_MeshVolume* elem = 0;
2017 if(!myCreateQuadratic) {
2019 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
2021 elem = meshDS->AddVolume(n1, n2, n3, n4);
2024 const SMDS_MeshNode* n12 = GetMediumNode( n1, n2, force3d, TopAbs_SOLID );
2025 const SMDS_MeshNode* n23 = GetMediumNode( n2, n3, force3d, TopAbs_SOLID );
2026 const SMDS_MeshNode* n31 = GetMediumNode( n3, n1, force3d, TopAbs_SOLID );
2028 const SMDS_MeshNode* n14 = GetMediumNode( n1, n4, force3d, TopAbs_SOLID );
2029 const SMDS_MeshNode* n24 = GetMediumNode( n2, n4, force3d, TopAbs_SOLID );
2030 const SMDS_MeshNode* n34 = GetMediumNode( n3, n4, force3d, TopAbs_SOLID );
2033 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
2035 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
2037 if ( mySetElemOnShape && myShapeID > 0 )
2038 meshDS->SetMeshElementOnShape( elem, myShapeID );
2043 //=======================================================================
2044 //function : AddVolume
2045 //purpose : Creates quadratic or linear pyramid
2046 //=======================================================================
2048 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2049 const SMDS_MeshNode* n2,
2050 const SMDS_MeshNode* n3,
2051 const SMDS_MeshNode* n4,
2052 const SMDS_MeshNode* n5,
2056 SMDS_MeshVolume* elem = 0;
2057 if(!myCreateQuadratic) {
2059 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
2061 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
2064 const SMDS_MeshNode* n12 = GetMediumNode( n1, n2, force3d, TopAbs_SOLID );
2065 const SMDS_MeshNode* n23 = GetMediumNode( n2, n3, force3d, TopAbs_SOLID );
2066 const SMDS_MeshNode* n34 = GetMediumNode( n3, n4, force3d, TopAbs_SOLID );
2067 const SMDS_MeshNode* n41 = GetMediumNode( n4, n1, force3d, TopAbs_SOLID );
2069 const SMDS_MeshNode* n15 = GetMediumNode( n1, n5, force3d, TopAbs_SOLID );
2070 const SMDS_MeshNode* n25 = GetMediumNode( n2, n5, force3d, TopAbs_SOLID );
2071 const SMDS_MeshNode* n35 = GetMediumNode( n3, n5, force3d, TopAbs_SOLID );
2072 const SMDS_MeshNode* n45 = GetMediumNode( n4, n5, force3d, TopAbs_SOLID );
2075 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
2080 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
2082 n15, n25, n35, n45);
2084 if ( mySetElemOnShape && myShapeID > 0 )
2085 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
2090 //=======================================================================
2091 //function : AddVolume
2092 //purpose : Creates tri-quadratic, quadratic or linear hexahedron
2093 //=======================================================================
2095 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2096 const SMDS_MeshNode* n2,
2097 const SMDS_MeshNode* n3,
2098 const SMDS_MeshNode* n4,
2099 const SMDS_MeshNode* n5,
2100 const SMDS_MeshNode* n6,
2101 const SMDS_MeshNode* n7,
2102 const SMDS_MeshNode* n8,
2106 SMESHDS_Mesh * meshDS = GetMeshDS();
2107 SMDS_MeshVolume* elem = 0;
2108 if(!myCreateQuadratic) {
2110 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
2112 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
2115 const SMDS_MeshNode* n12 = GetMediumNode( n1, n2, force3d, TopAbs_SOLID );
2116 const SMDS_MeshNode* n23 = GetMediumNode( n2, n3, force3d, TopAbs_SOLID );
2117 const SMDS_MeshNode* n34 = GetMediumNode( n3, n4, force3d, TopAbs_SOLID );
2118 const SMDS_MeshNode* n41 = GetMediumNode( n4, n1, force3d, TopAbs_SOLID );
2120 const SMDS_MeshNode* n56 = GetMediumNode( n5, n6, force3d, TopAbs_SOLID );
2121 const SMDS_MeshNode* n67 = GetMediumNode( n6, n7, force3d, TopAbs_SOLID );
2122 const SMDS_MeshNode* n78 = GetMediumNode( n7, n8, force3d, TopAbs_SOLID );
2123 const SMDS_MeshNode* n85 = GetMediumNode( n8, n5, force3d, TopAbs_SOLID );
2125 const SMDS_MeshNode* n15 = GetMediumNode( n1, n5, force3d, TopAbs_SOLID );
2126 const SMDS_MeshNode* n26 = GetMediumNode( n2, n6, force3d, TopAbs_SOLID );
2127 const SMDS_MeshNode* n37 = GetMediumNode( n3, n7, force3d, TopAbs_SOLID );
2128 const SMDS_MeshNode* n48 = GetMediumNode( n4, n8, force3d, TopAbs_SOLID );
2129 if(myCreateBiQuadratic)
2131 const SMDS_MeshNode* n1234 = GetCentralNode( n1,n2,n3,n4,n12,n23,n34,n41,force3d );
2132 const SMDS_MeshNode* n1256 = GetCentralNode( n1,n2,n5,n6,n12,n26,n56,n15,force3d );
2133 const SMDS_MeshNode* n2367 = GetCentralNode( n2,n3,n6,n7,n23,n37,n67,n26,force3d );
2134 const SMDS_MeshNode* n3478 = GetCentralNode( n3,n4,n7,n8,n34,n48,n78,n37,force3d );
2135 const SMDS_MeshNode* n1458 = GetCentralNode( n1,n4,n5,n8,n41,n48,n15,n85,force3d );
2136 const SMDS_MeshNode* n5678 = GetCentralNode( n5,n6,n7,n8,n56,n67,n78,n85,force3d );
2138 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
2140 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( n4 );
2141 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( n8 );
2142 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( n3 );
2143 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( n7 );
2144 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( n1 );
2145 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( n5 );
2146 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( n2 );
2147 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( n6 );
2149 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( n48 );
2150 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( n37 );
2151 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( n15 );
2152 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( n26 );
2153 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( n34 );
2154 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( n78 );
2155 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( n12 );
2156 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( n56 );
2157 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( n41 );
2158 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( n85 );
2159 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( n23 );
2160 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( n67 );
2162 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( n3478 );
2163 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( n1256 );
2164 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( n1458 );
2165 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( n2367 );
2166 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( n1234 );
2167 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( n5678 );
2169 gp_XYZ centerCube(0.5, 0.5, 0.5);
2171 SMESH_Block::ShellPoint( centerCube, pointsOnShapes, nCenterElem );
2172 const SMDS_MeshNode* nCenter =
2173 meshDS->AddNode( nCenterElem.X(), nCenterElem.Y(), nCenterElem.Z() );
2174 meshDS->SetNodeInVolume( nCenter, myShapeID );
2177 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2178 n12, n23, n34, n41, n56, n67,
2179 n78, n85, n15, n26, n37, n48,
2180 n1234, n1256, n2367, n3478, n1458, n5678, nCenter, id);
2182 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2183 n12, n23, n34, n41, n56, n67,
2184 n78, n85, n15, n26, n37, n48,
2185 n1234, n1256, n2367, n3478, n1458, n5678, nCenter);
2190 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2191 n12, n23, n34, n41, n56, n67,
2192 n78, n85, n15, n26, n37, n48, id);
2194 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2195 n12, n23, n34, n41, n56, n67,
2196 n78, n85, n15, n26, n37, n48);
2199 if ( mySetElemOnShape && myShapeID > 0 )
2200 meshDS->SetMeshElementOnShape( elem, myShapeID );
2205 //=======================================================================
2206 //function : AddVolume
2207 //purpose : Creates LINEAR!!!!!!!!! octahedron
2208 //=======================================================================
2210 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2211 const SMDS_MeshNode* n2,
2212 const SMDS_MeshNode* n3,
2213 const SMDS_MeshNode* n4,
2214 const SMDS_MeshNode* n5,
2215 const SMDS_MeshNode* n6,
2216 const SMDS_MeshNode* n7,
2217 const SMDS_MeshNode* n8,
2218 const SMDS_MeshNode* n9,
2219 const SMDS_MeshNode* n10,
2220 const SMDS_MeshNode* n11,
2221 const SMDS_MeshNode* n12,
2225 SMESHDS_Mesh * meshDS = GetMeshDS();
2226 SMDS_MeshVolume* elem = 0;
2228 elem = meshDS->AddVolumeWithID(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12,id);
2230 elem = meshDS->AddVolume(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12);
2231 if ( mySetElemOnShape && myShapeID > 0 )
2232 meshDS->SetMeshElementOnShape( elem, myShapeID );
2236 //=======================================================================
2237 //function : AddPolyhedralVolume
2238 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
2239 //=======================================================================
2242 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
2243 const std::vector<int>& quantities,
2247 SMESHDS_Mesh * meshDS = GetMeshDS();
2248 SMDS_MeshVolume* elem = 0;
2249 if(!myCreateQuadratic)
2252 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
2254 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
2258 vector<const SMDS_MeshNode*> newNodes;
2259 vector<int> newQuantities;
2260 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
2262 int nbNodesInFace = quantities[iFace];
2263 newQuantities.push_back(0);
2264 for ( int i = 0; i < nbNodesInFace; ++i )
2266 const SMDS_MeshNode* n1 = nodes[ iN + i ];
2267 newNodes.push_back( n1 );
2268 newQuantities.back()++;
2270 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
2271 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
2272 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
2274 const SMDS_MeshNode* n12 = GetMediumNode( n1, n2, force3d, TopAbs_SOLID );
2275 newNodes.push_back( n12 );
2276 newQuantities.back()++;
2279 iN += nbNodesInFace;
2282 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
2284 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
2286 if ( mySetElemOnShape && myShapeID > 0 )
2287 meshDS->SetMeshElementOnShape( elem, myShapeID );
2294 //================================================================================
2296 * \brief Check if a node belongs to any face of sub-mesh
2298 //================================================================================
2300 bool isNodeInSubMesh( const SMDS_MeshNode* n, const SMESHDS_SubMesh* sm )
2302 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2303 while ( fIt->more() )
2304 if ( sm->Contains( fIt->next() ))
2310 //=======================================================================
2311 //function : IsSameElemGeometry
2312 //purpose : Returns true if all elements of a sub-mesh are of same shape
2313 //=======================================================================
2315 bool SMESH_MesherHelper::IsSameElemGeometry(const SMESHDS_SubMesh* smDS,
2316 SMDSAbs_GeometryType shape,
2317 const bool nullSubMeshRes)
2319 if ( !smDS ) return nullSubMeshRes;
2321 SMDS_ElemIteratorPtr elemIt = smDS->GetElements();
2322 while ( elemIt->more() ) {
2323 const SMDS_MeshElement* e = elemIt->next();
2324 if ( e->GetGeomType() != shape )
2330 //=======================================================================
2331 //function : LoadNodeColumns
2332 //purpose : Load nodes bound to face into a map of node columns
2333 //=======================================================================
2335 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2336 const TopoDS_Face& theFace,
2337 const TopoDS_Edge& theBaseEdge,
2338 SMESHDS_Mesh* theMesh,
2339 SMESH_ProxyMesh* theProxyMesh)
2341 return LoadNodeColumns(theParam2ColumnMap,
2343 std::list<TopoDS_Edge>(1,theBaseEdge),
2348 //=======================================================================
2349 //function : LoadNodeColumns
2350 //purpose : Load nodes bound to face into a map of node columns
2351 //=======================================================================
2353 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2354 const TopoDS_Face& theFace,
2355 const std::list<TopoDS_Edge>& theBaseSide,
2356 SMESHDS_Mesh* theMesh,
2357 SMESH_ProxyMesh* theProxyMesh)
2359 // get a right sub-mesh of theFace
2361 const SMESHDS_SubMesh* faceSubMesh = 0;
2364 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
2365 if ( !faceSubMesh ||
2366 faceSubMesh->NbElements() == 0 ||
2367 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
2369 // can use a proxy sub-mesh with not temporary elements only
2375 faceSubMesh = theMesh->MeshElements( theFace );
2376 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
2379 if ( theParam2ColumnMap.empty() )
2381 // get data of edges for normalization of params
2382 vector< double > length;
2384 list<TopoDS_Edge>::const_iterator edge;
2386 for ( edge = theBaseSide.begin(); edge != theBaseSide.end(); ++edge )
2388 double len = std::max( 1e-10, SMESH_Algo::EdgeLength( *edge ));
2390 length.push_back( len );
2394 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
2395 edge = theBaseSide.begin();
2396 for ( int iE = 0; edge != theBaseSide.end(); ++edge, ++iE )
2398 map< double, const SMDS_MeshNode*> sortedBaseNN;
2399 SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN );
2401 map< double, const SMDS_MeshNode*>::iterator u_n;
2402 // pb with mesh_Projection_2D_00/A1 fixed by adding expectedSupport arg to GetMediumPos()
2403 // so the following solution is commented (hope forever :)
2405 // SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN,
2406 // // SMDSAbs_Edge here is needed to be coherent with
2407 // // StdMeshers_FaceSide used by Quadrangle to get nodes
2408 // // on EDGE; else pb in mesh_Projection_2D_00/A1 where a
2409 // // medium node on EDGE is medium in a triangle but not
2412 // if ( faceSubMesh->GetElements()->next()->IsQuadratic() )
2413 // // filter off nodes medium in faces on theFace (same pb with mesh_Projection_2D_00/A1)
2414 // for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end() ; )
2416 // const SMDS_MeshNode* node = u_n->second;
2417 // SMDS_ElemIteratorPtr faceIt = node->GetInverseElementIterator( SMDSAbs_Face );
2418 // if ( faceIt->more() && node ) {
2419 // const SMDS_MeshElement* face = faceIt->next();
2420 // if ( faceSubMesh->Contains( face ) && face->IsMediumNode( node ))
2424 // sortedBaseNN.erase( u_n++ );
2428 if ( sortedBaseNN.empty() ) continue;
2430 u_n = sortedBaseNN.begin();
2431 if ( theProxyMesh ) // from sortedBaseNN remove nodes not shared by faces of faceSubMesh
2433 const SMDS_MeshNode* n1 = (++sortedBaseNN.begin())->second;
2434 const SMDS_MeshNode* n2 = (++sortedBaseNN.rbegin())->second;
2435 bool allNodesAreProxy = ( n1 != theProxyMesh->GetProxyNode( n1 ) &&
2436 n2 != theProxyMesh->GetProxyNode( n2 ));
2437 if ( allNodesAreProxy )
2438 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2439 u_n->second = theProxyMesh->GetProxyNode( u_n->second );
2441 if ( u_n = sortedBaseNN.begin(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2443 while ( ++u_n != sortedBaseNN.end() && !isNodeInSubMesh( u_n->second, faceSubMesh ));
2444 sortedBaseNN.erase( sortedBaseNN.begin(), u_n );
2446 if ( !sortedBaseNN.empty() )
2447 if ( u_n = --sortedBaseNN.end(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2449 while ( u_n != sortedBaseNN.begin() && !isNodeInSubMesh( (--u_n)->second, faceSubMesh ));
2450 sortedBaseNN.erase( ++u_n, sortedBaseNN.end() );
2452 if ( sortedBaseNN.empty() ) continue;
2456 BRep_Tool::Range( *edge, f, l );
2457 if ( edge->Orientation() == TopAbs_REVERSED ) std::swap( f, l );
2458 const double coeff = 1. / ( l - f ) * length[iE] / fullLen;
2459 const double prevPar = theParam2ColumnMap.empty() ? 0 : theParam2ColumnMap.rbegin()->first;
2460 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2462 double par = prevPar + coeff * ( u_n->first - f );
2463 TParam2ColumnMap::iterator u2nn =
2464 theParam2ColumnMap.insert( theParam2ColumnMap.end(), make_pair( par, TNodeColumn()));
2465 u2nn->second.push_back( u_n->second );
2468 if ( theParam2ColumnMap.size() < 2 )
2473 int prevNbRows = theParam2ColumnMap.begin()->second.size(); // current, at least 1 here
2474 int expectedNbRows = faceSubMesh->NbElements() / ( theParam2ColumnMap.size()-1 ); // to be added
2476 // fill theParam2ColumnMap column by column by passing from nodes on
2477 // theBaseEdge up via mesh faces on theFace
2479 TParam2ColumnMap::iterator par_nVec_1, par_nVec_2;
2480 par_nVec_2 = theParam2ColumnMap.begin();
2481 par_nVec_1 = par_nVec_2++;
2482 TIDSortedElemSet emptySet, avoidSet;
2483 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
2485 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
2486 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
2487 nCol1.resize( prevNbRows + expectedNbRows );
2488 nCol2.resize( prevNbRows + expectedNbRows );
2490 int i1, i2, foundNbRows = 0;
2491 const SMDS_MeshNode *n1 = nCol1[ prevNbRows-1 ];
2492 const SMDS_MeshNode *n2 = nCol2[ prevNbRows-1 ];
2493 // find face sharing node n1 and n2 and belonging to faceSubMesh
2494 while ( const SMDS_MeshElement* face =
2495 SMESH_MeshAlgos::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
2497 if ( faceSubMesh->Contains( face ))
2499 int nbNodes = face->NbCornerNodes();
2502 if ( foundNbRows + 1 > expectedNbRows )
2504 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
2505 n2 = face->GetNode( (i1+2) % 4 );
2506 nCol1[ prevNbRows + foundNbRows] = n1;
2507 nCol2[ prevNbRows + foundNbRows] = n2;
2510 avoidSet.insert( face );
2512 if ( foundNbRows != expectedNbRows )
2516 return ( theParam2ColumnMap.size() > 1 &&
2517 theParam2ColumnMap.begin()->second.size() == prevNbRows + expectedNbRows );
2522 //================================================================================
2524 * \brief Return true if a node is at a corner of a 2D structured mesh of FACE
2526 //================================================================================
2528 bool isCornerOfStructure( const SMDS_MeshNode* n,
2529 const SMESHDS_SubMesh* faceSM,
2530 SMESH_MesherHelper& faceAnalyser )
2532 int nbFacesInSM = 0;
2534 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2535 while ( fIt->more() )
2536 nbFacesInSM += faceSM->Contains( fIt->next() );
2538 if ( nbFacesInSM == 1 )
2541 if ( nbFacesInSM == 2 && n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
2543 return faceAnalyser.IsRealSeam( n->getshapeId() );
2549 //=======================================================================
2550 //function : IsStructured
2551 //purpose : Return true if 2D mesh on FACE is a structured rectangle
2552 //=======================================================================
2554 bool SMESH_MesherHelper::IsStructured( SMESH_subMesh* faceSM )
2556 SMESHDS_SubMesh* fSM = faceSM->GetSubMeshDS();
2557 if ( !fSM || fSM->NbElements() == 0 )
2560 list< TopoDS_Edge > edges;
2561 list< int > nbEdgesInWires;
2562 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( faceSM->GetSubShape() ),
2563 edges, nbEdgesInWires );
2564 if ( nbWires != 1 /*|| nbEdgesInWires.front() != 4*/ ) // allow composite sides
2567 // algo: find corners of a structure and then analyze nb of faces and
2568 // length of structure sides
2570 SMESHDS_Mesh* meshDS = faceSM->GetFather()->GetMeshDS();
2571 SMESH_MesherHelper faceAnalyser( *faceSM->GetFather() );
2572 faceAnalyser.SetSubShape( faceSM->GetSubShape() );
2574 // rotate edges to get the first node being at corner
2575 // (in principle it's not necessary but so far none SALOME algo can make
2576 // such a structured mesh that all corner nodes are not on VERTEXes)
2577 bool isCorner = false;
2578 int nbRemainEdges = nbEdgesInWires.front();
2580 TopoDS_Vertex V = IthVertex( 0, edges.front() );
2581 isCorner = isCornerOfStructure( SMESH_Algo::VertexNode( V, meshDS ),
2584 edges.splice( edges.end(), edges, edges.begin() );
2588 while ( !isCorner && nbRemainEdges > 0 );
2593 // get all nodes from EDGEs
2594 list< const SMDS_MeshNode* > nodes;
2595 list< TopoDS_Edge >::iterator edge = edges.begin();
2596 for ( ; edge != edges.end(); ++edge )
2598 map< double, const SMDS_MeshNode* > u2Nodes;
2599 if ( !SMESH_Algo::GetSortedNodesOnEdge( meshDS, *edge,
2600 /*skipMedium=*/true, u2Nodes ))
2603 list< const SMDS_MeshNode* > edgeNodes;
2604 map< double, const SMDS_MeshNode* >::iterator u2n = u2Nodes.begin();
2605 for ( ; u2n != u2Nodes.end(); ++u2n )
2606 edgeNodes.push_back( u2n->second );
2607 if ( edge->Orientation() == TopAbs_REVERSED )
2608 edgeNodes.reverse();
2610 if ( !nodes.empty() && nodes.back() == edgeNodes.front() )
2611 edgeNodes.pop_front();
2612 nodes.splice( nodes.end(), edgeNodes, edgeNodes.begin(), edgeNodes.end() );
2615 // get length of structured sides
2616 vector<int> nbEdgesInSide;
2618 list< const SMDS_MeshNode* >::iterator n = ++nodes.begin();
2619 for ( ; n != nodes.end(); ++n )
2622 if ( isCornerOfStructure( *n, fSM, faceAnalyser )) {
2623 nbEdgesInSide.push_back( nbEdges );
2629 if ( nbEdgesInSide.size() != 4 )
2631 if ( nbEdgesInSide[0] != nbEdgesInSide[2] )
2633 if ( nbEdgesInSide[1] != nbEdgesInSide[3] )
2635 if ( nbEdgesInSide[0] * nbEdgesInSide[1] != fSM->NbElements() )
2641 //=======================================================================
2642 //function : IsDistorted2D
2643 //purpose : Return true if 2D mesh on FACE is ditorted
2644 //=======================================================================
2646 bool SMESH_MesherHelper::IsDistorted2D( SMESH_subMesh* faceSM,
2649 if ( !faceSM || faceSM->GetSubShape().ShapeType() != TopAbs_FACE )
2652 bool haveBadFaces = false;
2654 SMESH_MesherHelper helper( *faceSM->GetFather() );
2655 helper.SetSubShape( faceSM->GetSubShape() );
2657 const TopoDS_Face& F = TopoDS::Face( faceSM->GetSubShape() );
2658 SMESHDS_SubMesh* smDS = helper.GetMeshDS()->MeshElements( F );
2659 if ( !smDS || smDS->NbElements() == 0 ) return false;
2661 SMDS_ElemIteratorPtr faceIt = smDS->GetElements();
2662 double prevArea = 0;
2663 vector< const SMDS_MeshNode* > nodes;
2665 bool* toCheckUV = checkUV ? & checkUV : 0;
2666 while ( faceIt->more() && !haveBadFaces )
2668 const SMDS_MeshElement* face = faceIt->next();
2671 nodes.resize( face->NbCornerNodes() );
2672 SMDS_MeshElement::iterator n = face->begin_nodes();
2673 for ( size_t i = 0; i < nodes.size(); ++n, ++i )
2676 // avoid elems on degenarate shapes as UV on them can be wrong
2677 if ( helper.HasDegeneratedEdges() )
2679 bool isOnDegen = false;
2680 for ( size_t i = 0; ( i < nodes.size() && !isOnDegen ); ++i )
2681 isOnDegen = helper.IsDegenShape( nodes[ i ]->getshapeId() );
2685 // prepare to getting UVs
2686 const SMDS_MeshNode* inFaceNode = 0;
2687 if ( helper.HasSeam() ) {
2688 for ( size_t i = 0; ( i < nodes.size() && !inFaceNode ); ++i )
2689 if ( !helper.IsSeamShape( nodes[ i ]->getshapeId() ))
2690 inFaceNode = nodes[ i ];
2695 uv.resize( nodes.size() );
2696 for ( size_t i = 0; i < nodes.size(); ++i )
2697 uv[ i ] = helper.GetNodeUV( F, nodes[ i ], inFaceNode, toCheckUV );
2699 // compare orientation of triangles
2700 double faceArea = 0;
2701 for ( int iT = 0, nbT = nodes.size()-2; iT < nbT; ++iT )
2703 gp_XY v1 = uv[ iT+1 ] - uv[ 0 ];
2704 gp_XY v2 = uv[ iT+2 ] - uv[ 0 ];
2705 faceArea += v2 ^ v1;
2707 haveBadFaces = ( faceArea * prevArea < 0 );
2708 prevArea = faceArea;
2711 return haveBadFaces;
2714 //================================================================================
2716 * \brief Find out elements orientation on a geometrical face
2717 * \param theFace - The face correctly oriented in the shape being meshed
2718 * \retval bool - true if the face normal and the normal of first element
2719 * in the correspoding submesh point in different directions
2721 //================================================================================
2723 bool SMESH_MesherHelper::IsReversedSubMesh (const TopoDS_Face& theFace)
2725 if ( theFace.IsNull() )
2728 // find out orientation of a meshed face
2729 int faceID = GetMeshDS()->ShapeToIndex( theFace );
2730 TopoDS_Shape aMeshedFace = GetMeshDS()->IndexToShape( faceID );
2731 bool isReversed = ( theFace.Orientation() != aMeshedFace.Orientation() );
2733 const SMESHDS_SubMesh * aSubMeshDSFace = GetMeshDS()->MeshElements( faceID );
2734 if ( !aSubMeshDSFace )
2737 // find an element with a good normal
2739 bool normalOK = false;
2741 SMDS_ElemIteratorPtr iteratorElem = aSubMeshDSFace->GetElements();
2742 while ( !normalOK && iteratorElem->more() ) // loop on elements on theFace
2744 const SMDS_MeshElement* elem = iteratorElem->next();
2745 if ( elem && elem->NbCornerNodes() > 2 )
2747 SMESH_TNodeXYZ nPnt[3];
2748 SMDS_ElemIteratorPtr nodesIt = elem->nodesIterator();
2749 int iNodeOnFace = 0, iPosDim = SMDS_TOP_VERTEX;
2750 for ( int iN = 0; nodesIt->more() && iN < 3; ++iN) // loop on nodes
2752 nPnt[ iN ] = nodesIt->next();
2753 if ( nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition() > iPosDim )
2756 iPosDim = nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition();
2760 gp_Vec v01( nPnt[0], nPnt[1] ), v02( nPnt[0], nPnt[2] );
2761 if ( v01.SquareMagnitude() > RealSmall() &&
2762 v02.SquareMagnitude() > RealSmall() )
2765 if (( normalOK = ( Ne.SquareMagnitude() > RealSmall() )))
2766 uv = GetNodeUV( theFace, nPnt[iNodeOnFace]._node, 0, &normalOK );
2773 // face normal at node position
2774 TopLoc_Location loc;
2775 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
2776 // if ( surf.IsNull() || surf->Continuity() < GeomAbs_C1 )
2777 // some surfaces not detected as GeomAbs_C1 are nevertheless correct for meshing
2778 if ( surf.IsNull() || surf->Continuity() < GeomAbs_C0 )
2781 MESSAGE("surf->Continuity() < GeomAbs_C1 " << (surf->Continuity() < GeomAbs_C1));
2784 gp_Vec d1u, d1v; gp_Pnt p;
2785 surf->D1( uv.X(), uv.Y(), p, d1u, d1v );
2786 gp_Vec Nf = (d1u ^ d1v).Transformed( loc );
2788 if ( theFace.Orientation() == TopAbs_REVERSED )
2791 return Ne * Nf < 0.;
2794 //=======================================================================
2796 //purpose : Count nb of sub-shapes
2797 //=======================================================================
2799 int SMESH_MesherHelper::Count(const TopoDS_Shape& shape,
2800 const TopAbs_ShapeEnum type,
2801 const bool ignoreSame)
2804 TopTools_IndexedMapOfShape map;
2805 TopExp::MapShapes( shape, type, map );
2806 return map.Extent();
2810 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2816 //=======================================================================
2817 //function : NbAncestors
2818 //purpose : Return number of unique ancestors of the shape
2819 //=======================================================================
2821 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
2822 const SMESH_Mesh& mesh,
2823 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
2825 TopTools_MapOfShape ancestors;
2826 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
2827 for ( ; ansIt.More(); ansIt.Next() ) {
2828 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
2829 ancestors.Add( ansIt.Value() );
2831 return ancestors.Extent();
2834 //=======================================================================
2835 //function : GetSubShapeOri
2836 //purpose : Return orientation of sub-shape in the main shape
2837 //=======================================================================
2839 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
2840 const TopoDS_Shape& subShape)
2842 TopAbs_Orientation ori = TopAbs_Orientation(-1);
2843 if ( !shape.IsNull() && !subShape.IsNull() )
2845 TopExp_Explorer e( shape, subShape.ShapeType() );
2846 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
2847 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
2848 for ( ; e.More(); e.Next())
2849 if ( subShape.IsSame( e.Current() ))
2852 ori = e.Current().Orientation();
2857 //=======================================================================
2858 //function : IsSubShape
2860 //=======================================================================
2862 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
2863 const TopoDS_Shape& mainShape )
2865 if ( !shape.IsNull() && !mainShape.IsNull() )
2867 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
2870 if ( shape.IsSame( exp.Current() ))
2873 SCRUTE((shape.IsNull()));
2874 SCRUTE((mainShape.IsNull()));
2878 //=======================================================================
2879 //function : IsSubShape
2881 //=======================================================================
2883 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
2885 if ( shape.IsNull() || !aMesh )
2888 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
2890 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
2893 //=======================================================================
2894 //function : IsBlock
2896 //=======================================================================
2898 bool SMESH_MesherHelper::IsBlock( const TopoDS_Shape& shape )
2900 if ( shape.IsNull() )
2904 TopExp_Explorer exp( shape, TopAbs_SHELL );
2905 if ( !exp.More() ) return false;
2906 shell = TopoDS::Shell( exp.Current() );
2907 if ( exp.Next(), exp.More() ) return false;
2910 TopTools_IndexedMapOfOrientedShape map;
2911 return SMESH_Block::FindBlockShapes( shell, v, v, map );
2915 //================================================================================
2917 * \brief Return maximal tolerance of shape
2919 //================================================================================
2921 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
2923 double tol = Precision::Confusion();
2924 TopExp_Explorer exp;
2925 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
2926 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
2927 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
2928 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
2929 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
2930 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
2935 //================================================================================
2937 * \brief Return MaxTolerance( face ), probably cached
2939 //================================================================================
2941 double SMESH_MesherHelper::getFaceMaxTol( const TopoDS_Shape& face ) const
2943 int faceID = GetMeshDS()->ShapeToIndex( face );
2945 SMESH_MesherHelper* me = const_cast< SMESH_MesherHelper* >( this );
2946 double & tol = me->myFaceMaxTol.insert( make_pair( faceID, -1. )).first->second;
2948 tol = MaxTolerance( face );
2953 //================================================================================
2955 * \brief Return an angle between two EDGEs sharing a common VERTEX with reference
2956 * of the FACE normal
2957 * \return double - the angle (between -Pi and Pi), negative if the angle is concave,
2958 * 1e100 in case of failure
2959 * \waring Care about order of the EDGEs and their orientation to be as they are
2960 * within the FACE! Don't pass degenerated EDGEs neither!
2962 //================================================================================
2964 double SMESH_MesherHelper::GetAngle( const TopoDS_Edge & theE1,
2965 const TopoDS_Edge & theE2,
2966 const TopoDS_Face & theFace,
2967 const TopoDS_Vertex & theCommonV,
2968 gp_Vec* theFaceNormal)
2970 double angle = 1e100;
2974 Handle(Geom_Curve) c1 = BRep_Tool::Curve( theE1, f,l );
2975 Handle(Geom_Curve) c2 = BRep_Tool::Curve( theE2, f,l );
2976 Handle(Geom2d_Curve) c2d1 = BRep_Tool::CurveOnSurface( theE1, theFace, f,l );
2977 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace );
2978 double p1 = BRep_Tool::Parameter( theCommonV, theE1 );
2979 double p2 = BRep_Tool::Parameter( theCommonV, theE2 );
2980 if ( c1.IsNull() || c2.IsNull() )
2982 gp_XY uv = c2d1->Value( p1 ).XY();
2983 gp_Vec du, dv; gp_Pnt p;
2984 surf->D1( uv.X(), uv.Y(), p, du, dv );
2985 gp_Vec vec1, vec2, vecRef = du ^ dv;
2988 while ( vecRef.SquareMagnitude() < 1e-25 )
2990 double dp = ( l - f ) / 1000.;
2991 p1tmp += dp * (( Abs( p1 - f ) > Abs( p1 - l )) ? -1. : +1.);
2992 uv = c2d1->Value( p1tmp ).XY();
2993 surf->D1( uv.X(), uv.Y(), p, du, dv );
2995 if ( ++nbLoops > 10 )
2998 cout << "SMESH_MesherHelper::GetAngle(): Captured in a sigularity" << endl;
3003 if ( theFace.Orientation() == TopAbs_REVERSED )
3005 if ( theFaceNormal ) *theFaceNormal = vecRef;
3007 c1->D1( p1, p, vec1 );
3008 c2->D1( p2, p, vec2 );
3009 // TopoDS_Face F = theFace;
3010 // if ( F.Orientation() == TopAbs_INTERNAL )
3011 // F.Orientation( TopAbs_FORWARD );
3012 if ( theE1.Orientation() /*GetSubShapeOri( F, theE1 )*/ == TopAbs_REVERSED )
3014 if ( theE2.Orientation() /*GetSubShapeOri( F, theE2 )*/ == TopAbs_REVERSED )
3016 angle = vec1.AngleWithRef( vec2, vecRef );
3018 if ( Abs ( angle ) >= 0.99 * M_PI )
3020 BRep_Tool::Range( theE1, f, l );
3021 p1 += 1e-7 * ( p1-f < l-p1 ? +1. : -1. );
3022 c1->D1( p1, p, vec1 );
3023 if ( theE1.Orientation() == TopAbs_REVERSED )
3025 BRep_Tool::Range( theE2, f, l );
3026 p2 += 1e-7 * ( p2-f < l-p2 ? +1. : -1. );
3027 c2->D1( p2, p, vec2 );
3028 if ( theE2.Orientation() == TopAbs_REVERSED )
3030 angle = vec1.AngleWithRef( vec2, vecRef );
3039 //================================================================================
3041 * \brief Check if the first and last vertices of an edge are the same
3042 * \param anEdge - the edge to check
3043 * \retval bool - true if same
3045 //================================================================================
3047 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
3049 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
3050 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
3051 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
3054 //================================================================================
3056 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
3057 * in the case of INTERNAL edge
3059 //================================================================================
3061 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
3065 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
3066 anEdge.Orientation( TopAbs_FORWARD );
3068 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
3069 TopoDS_Iterator vIt( anEdge, CumOri );
3070 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
3073 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
3076 //================================================================================
3078 * \brief Return type of shape contained in a group
3079 * \param group - a shape of type TopAbs_COMPOUND
3080 * \param avoidCompound - not to return TopAbs_COMPOUND
3082 //================================================================================
3084 TopAbs_ShapeEnum SMESH_MesherHelper::GetGroupType(const TopoDS_Shape& group,
3085 const bool avoidCompound)
3087 if ( !group.IsNull() )
3089 if ( group.ShapeType() != TopAbs_COMPOUND )
3090 return group.ShapeType();
3092 // iterate on a compound
3093 TopoDS_Iterator it( group );
3095 return avoidCompound ? GetGroupType( it.Value() ) : it.Value().ShapeType();
3097 return TopAbs_SHAPE;
3100 //=======================================================================
3101 //function : IsQuadraticMesh
3102 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
3103 // quadratic elements will be created.
3104 // Used then generated 3D mesh without geometry.
3105 //=======================================================================
3107 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
3109 int NbAllEdgsAndFaces=0;
3110 int NbQuadFacesAndEdgs=0;
3111 int NbFacesAndEdges=0;
3112 //All faces and edges
3113 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
3114 if ( NbAllEdgsAndFaces == 0 )
3115 return SMESH_MesherHelper::LINEAR;
3117 //Quadratic faces and edges
3118 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
3120 //Linear faces and edges
3121 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
3123 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
3125 return SMESH_MesherHelper::QUADRATIC;
3127 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
3129 return SMESH_MesherHelper::LINEAR;
3132 //Mesh with both type of elements
3133 return SMESH_MesherHelper::COMP;
3136 //=======================================================================
3137 //function : GetOtherParam
3138 //purpose : Return an alternative parameter for a node on seam
3139 //=======================================================================
3141 double SMESH_MesherHelper::GetOtherParam(const double param) const
3143 int i = myParIndex & U_periodic ? 0 : 1;
3144 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
3149 //=======================================================================
3151 * \brief Iterator on ancestors of the given type
3153 //=======================================================================
3155 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
3157 TopTools_ListIteratorOfListOfShape _ancIter;
3158 TopAbs_ShapeEnum _type;
3159 TopTools_MapOfShape _encountered;
3160 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
3161 : _ancIter( ancestors ), _type( type )
3163 if ( _ancIter.More() ) {
3164 if ( _ancIter.Value().ShapeType() != _type ) next();
3165 else _encountered.Add( _ancIter.Value() );
3170 return _ancIter.More();
3172 virtual const TopoDS_Shape* next()
3174 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
3175 if ( _ancIter.More() )
3176 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
3177 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
3185 //=======================================================================
3187 * \brief Return iterator on ancestors of the given type
3189 //=======================================================================
3191 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
3192 const SMESH_Mesh& mesh,
3193 TopAbs_ShapeEnum ancestorType)
3195 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
3198 //=======================================================================
3199 //function : GetCommonAncestor
3200 //purpose : Find a common ancestors of two shapes of the given type
3201 //=======================================================================
3203 TopoDS_Shape SMESH_MesherHelper::GetCommonAncestor(const TopoDS_Shape& shape1,
3204 const TopoDS_Shape& shape2,
3205 const SMESH_Mesh& mesh,
3206 TopAbs_ShapeEnum ancestorType)
3208 TopoDS_Shape commonAnc;
3209 if ( !shape1.IsNull() && !shape2.IsNull() )
3211 PShapeIteratorPtr ancIt = GetAncestors( shape1, mesh, ancestorType );
3212 while ( const TopoDS_Shape* anc = ancIt->next() )
3213 if ( IsSubShape( shape2, *anc ))
3222 //#include <Perf_Meter.hxx>
3224 //=======================================================================
3225 namespace { // Structures used by FixQuadraticElements()
3226 //=======================================================================
3228 #define __DMP__(txt) \
3230 #define MSG(txt) __DMP__(txt<<endl)
3231 #define MSGBEG(txt) __DMP__(txt)
3233 //const double straightTol2 = 1e-33; // to detect straing links
3234 bool isStraightLink(double linkLen2, double middleNodeMove2)
3236 // straight if <node move> < 1/15 * <link length>
3237 return middleNodeMove2 < 1/15./15. * linkLen2;
3241 // ---------------------------------------
3243 * \brief Quadratic link knowing its faces
3245 struct QLink: public SMESH_TLink
3247 const SMDS_MeshNode* _mediumNode;
3248 mutable vector<const QFace* > _faces;
3249 mutable gp_Vec _nodeMove;
3250 mutable int _nbMoves;
3252 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
3253 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
3255 //if ( MediumPos() != SMDS_TOP_3DSPACE )
3256 _nodeMove = MediumPnt() - MiddlePnt();
3258 void SetContinuesFaces() const;
3259 const QFace* GetContinuesFace( const QFace* face ) const;
3260 bool OnBoundary() const;
3261 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
3262 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
3264 SMDS_TypeOfPosition MediumPos() const
3265 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
3266 SMDS_TypeOfPosition EndPos(bool isSecond) const
3267 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
3268 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
3269 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
3271 void Move(const gp_Vec& move, bool sum=false) const
3272 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
3273 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
3274 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
3275 bool IsStraight() const
3276 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
3277 _nodeMove.SquareMagnitude());
3279 bool operator<(const QLink& other) const {
3280 return (node1()->GetID() == other.node1()->GetID() ?
3281 node2()->GetID() < other.node2()->GetID() :
3282 node1()->GetID() < other.node1()->GetID());
3284 // struct PtrComparator {
3285 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
3288 // ---------------------------------------------------------
3290 * \brief Link in the chain of links; it connects two faces
3294 const QLink* _qlink;
3295 mutable const QFace* _qfaces[2];
3297 TChainLink(const QLink* qlink=0):_qlink(qlink) {
3298 _qfaces[0] = _qfaces[1] = 0;
3300 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
3302 bool IsBoundary() const { return !_qfaces[1]; }
3304 void RemoveFace( const QFace* face ) const
3305 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
3307 const QFace* NextFace( const QFace* f ) const
3308 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
3310 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
3311 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
3313 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
3315 operator bool() const { return (_qlink); }
3317 const QLink* operator->() const { return _qlink; }
3319 gp_Vec Normal() const;
3321 bool IsStraight() const;
3323 // --------------------------------------------------------------------
3324 typedef list< TChainLink > TChain;
3325 typedef set < TChainLink > TLinkSet;
3326 typedef TLinkSet::const_iterator TLinkInSet;
3328 const int theFirstStep = 5;
3330 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
3331 // --------------------------------------------------------------------
3333 * \brief Quadratic face shared by two volumes and bound by QLinks
3335 struct QFace: public TIDSortedNodeSet
3337 mutable const SMDS_MeshElement* _volumes[2];
3338 mutable vector< const QLink* > _sides;
3339 mutable bool _sideIsAdded[4]; // added in chain of links
3342 mutable const SMDS_MeshElement* _face;
3345 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
3347 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
3349 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
3351 void AddSelfToLinks() const {
3352 for ( int i = 0; i < _sides.size(); ++i )
3353 _sides[i]->_faces.push_back( this );
3355 int LinkIndex( const QLink* side ) const {
3356 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
3359 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
3361 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
3363 int i = LinkIndex( link._qlink );
3364 if ( i < 0 ) return true;
3365 _sideIsAdded[i] = true;
3366 link.SetFace( this );
3367 // continue from opposite link
3368 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
3370 bool IsBoundary() const { return !_volumes[1]; }
3372 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
3374 bool IsSpoiled(const QLink* bentLink ) const;
3376 TLinkInSet GetBoundaryLink( const TLinkSet& links,
3377 const TChainLink& avoidLink,
3378 TLinkInSet * notBoundaryLink = 0,
3379 const SMDS_MeshNode* nodeToContain = 0,
3380 bool * isAdjacentUsed = 0,
3381 int nbRecursionsLeft = -1) const;
3383 TLinkInSet GetLinkByNode( const TLinkSet& links,
3384 const TChainLink& avoidLink,
3385 const SMDS_MeshNode* nodeToContain) const;
3387 const SMDS_MeshNode* GetNodeInFace() const {
3388 for ( int iL = 0; iL < _sides.size(); ++iL )
3389 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
3393 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
3395 double MoveByBoundary( const TChainLink& theLink,
3396 const gp_Vec& theRefVec,
3397 const TLinkSet& theLinks,
3398 SMESH_MesherHelper* theFaceHelper=0,
3399 const double thePrevLen=0,
3400 const int theStep=theFirstStep,
3401 gp_Vec* theLinkNorm=0,
3402 double theSign=1.0) const;
3405 //================================================================================
3407 * \brief Dump QLink and QFace
3409 ostream& operator << (ostream& out, const QLink& l)
3411 out <<"QLink nodes: "
3412 << l.node1()->GetID() << " - "
3413 << l._mediumNode->GetID() << " - "
3414 << l.node2()->GetID() << endl;
3417 ostream& operator << (ostream& out, const QFace& f)
3419 out <<"QFace nodes: "/*<< &f << " "*/;
3420 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
3421 out << (*n)->GetID() << " ";
3422 out << " \tvolumes: "
3423 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
3424 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
3425 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
3429 //================================================================================
3431 * \brief Construct QFace from QLinks
3433 //================================================================================
3435 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
3437 _volumes[0] = _volumes[1] = 0;
3439 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
3440 _normal.SetCoord(0,0,0);
3441 for ( int i = 1; i < _sides.size(); ++i ) {
3442 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
3443 insert( l1->node1() ); insert( l1->node2() );
3445 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
3446 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
3447 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
3451 double normSqSize = _normal.SquareMagnitude();
3452 if ( normSqSize > numeric_limits<double>::min() )
3453 _normal /= sqrt( normSqSize );
3455 _normal.SetCoord(1e-33,0,0);
3461 //================================================================================
3463 * \brief Make up a chain of links
3464 * \param iSide - link to add first
3465 * \param chain - chain to fill in
3466 * \param pos - postion of medium nodes the links should have
3467 * \param error - out, specifies what is wrong
3468 * \retval bool - false if valid chain can't be built; "valid" means that links
3469 * of the chain belongs to rectangles bounding hexahedrons
3471 //================================================================================
3473 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
3475 if ( iSide >= _sides.size() ) // wrong argument iSide
3477 if ( _sideIsAdded[ iSide ]) // already in chain
3480 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
3483 list< const QFace* > faces( 1, this );
3484 while ( !faces.empty() ) {
3485 const QFace* face = faces.front();
3486 for ( int i = 0; i < face->_sides.size(); ++i ) {
3487 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
3488 face->_sideIsAdded[i] = true;
3489 // find a face side in the chain
3490 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
3491 // TChain::iterator chLink = chain.begin();
3492 // for ( ; chLink != chain.end(); ++chLink )
3493 // if ( chLink->_qlink == face->_sides[i] )
3495 // if ( chLink == chain.end() )
3496 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
3497 // add a face to a chained link and put a continues face in the queue
3498 chLink->SetFace( face );
3499 if ( face->_sides[i]->MediumPos() == pos )
3500 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
3501 if ( contFace->_sides.size() == 3 )
3502 faces.push_back( contFace );
3507 if ( error < ERR_TRI )
3509 chain.insert( chain.end(), links.begin(),links.end() );
3512 _sideIsAdded[iSide] = true; // not to add this link to chain again
3513 const QLink* link = _sides[iSide];
3517 // add link into chain
3518 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
3519 chLink->SetFace( this );
3522 // propagate from a quadrangle to neighbour faces
3523 if ( link->MediumPos() >= pos ) {
3524 int nbLinkFaces = link->_faces.size();
3525 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
3526 // hexahedral mesh or boundary quadrangles - goto a continous face
3527 if ( const QFace* f = link->GetContinuesFace( this ))
3528 if ( f->_sides.size() == 4 )
3529 return f->GetLinkChain( *chLink, chain, pos, error );
3532 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
3533 for ( int i = 0; i < nbLinkFaces; ++i )
3534 if ( link->_faces[i] )
3535 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
3536 if ( error < ERR_PRISM )
3544 //================================================================================
3546 * \brief Return a boundary link of the triangle face
3547 * \param links - set of all links
3548 * \param avoidLink - link not to return
3549 * \param notBoundaryLink - out, neither the returned link nor avoidLink
3550 * \param nodeToContain - node the returned link must contain; if provided, search
3551 * also performed on adjacent faces
3552 * \param isAdjacentUsed - returns true if link is found in adjacent faces
3553 * \param nbRecursionsLeft - to limit recursion
3555 //================================================================================
3557 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
3558 const TChainLink& avoidLink,
3559 TLinkInSet * notBoundaryLink,
3560 const SMDS_MeshNode* nodeToContain,
3561 bool * isAdjacentUsed,
3562 int nbRecursionsLeft) const
3564 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
3566 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
3567 TFaceLinkList adjacentFaces;
3569 for ( int iL = 0; iL < _sides.size(); ++iL )
3571 if ( avoidLink._qlink == _sides[iL] )
3573 TLinkInSet link = links.find( _sides[iL] );
3574 if ( link == linksEnd ) continue;
3575 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
3576 continue; // We work on faces here, don't go inside a solid
3579 if ( link->IsBoundary() ) {
3580 if ( !nodeToContain ||
3581 (*link)->node1() == nodeToContain ||
3582 (*link)->node2() == nodeToContain )
3584 boundaryLink = link;
3585 if ( !notBoundaryLink ) break;
3588 else if ( notBoundaryLink ) {
3589 *notBoundaryLink = link;
3590 if ( boundaryLink != linksEnd ) break;
3593 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
3594 if ( const QFace* adj = link->NextFace( this ))
3595 if ( adj->Contains( nodeToContain ))
3596 adjacentFaces.push_back( make_pair( adj, link ));
3599 if ( isAdjacentUsed ) *isAdjacentUsed = false;
3600 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
3602 if ( nbRecursionsLeft < 0 )
3603 nbRecursionsLeft = nodeToContain->NbInverseElements();
3604 TFaceLinkList::iterator adj = adjacentFaces.begin();
3605 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
3606 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
3607 isAdjacentUsed, nbRecursionsLeft-1);
3608 if ( isAdjacentUsed ) *isAdjacentUsed = true;
3610 return boundaryLink;
3612 //================================================================================
3614 * \brief Return a link ending at the given node but not avoidLink
3616 //================================================================================
3618 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
3619 const TChainLink& avoidLink,
3620 const SMDS_MeshNode* nodeToContain) const
3622 for ( int i = 0; i < _sides.size(); ++i )
3623 if ( avoidLink._qlink != _sides[i] &&
3624 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
3625 return links.find( _sides[ i ]);
3629 //================================================================================
3631 * \brief Return normal to the i-th side pointing outside the face
3633 //================================================================================
3635 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
3637 gp_Vec norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3638 gp_XYZ pIn = ( _sides[ (i+1)%3 ]->MiddlePnt() +
3639 _sides[ (i+2)%3 ]->MiddlePnt() ) / 2.;
3640 gp_Vec vecOut = ( _sides[i]->MiddlePnt() - pIn );
3642 if ( norm * vecOut < 0 )
3644 double mag2 = norm.SquareMagnitude();
3645 if ( mag2 > numeric_limits<double>::min() )
3646 norm /= sqrt( mag2 );
3649 //================================================================================
3651 * \brief Move medium node of theLink according to its distance from boundary
3652 * \param theLink - link to fix
3653 * \param theRefVec - movement of boundary
3654 * \param theLinks - all adjacent links of continous triangles
3655 * \param theFaceHelper - helper is not used so far
3656 * \param thePrevLen - distance from the boundary
3657 * \param theStep - number of steps till movement propagation limit
3658 * \param theLinkNorm - out normal to theLink
3659 * \param theSign - 1 or -1 depending on movement of boundary
3660 * \retval double - distance from boundary to propagation limit or other boundary
3662 //================================================================================
3664 double QFace::MoveByBoundary( const TChainLink& theLink,
3665 const gp_Vec& theRefVec,
3666 const TLinkSet& theLinks,
3667 SMESH_MesherHelper* theFaceHelper,
3668 const double thePrevLen,
3670 gp_Vec* theLinkNorm,
3671 double theSign) const
3674 return thePrevLen; // propagation limit reached
3676 int iL; // index of theLink
3677 for ( iL = 0; iL < _sides.size(); ++iL )
3678 if ( theLink._qlink == _sides[ iL ])
3681 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
3682 <<" thePrevLen " << thePrevLen);
3683 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
3685 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
3686 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
3687 if ( theStep == theFirstStep )
3688 theSign = refProj < 0. ? -1. : 1.;
3689 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
3690 return thePrevLen; // to propagate movement forward only, not in side dir or backward
3692 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
3693 TLinkInSet link1 = theLinks.find( _sides[iL1] );
3694 TLinkInSet link2 = theLinks.find( _sides[iL2] );
3696 const QFace *f1 = 0, *f2 = 0; // adjacent faces
3697 bool isBndLink1 = true, isBndLink2 = true;
3698 if ( link1 != theLinks.end() && link2 != theLinks.end() )
3700 f1 = link1->NextFace( this );
3701 f2 = link2->NextFace( this );
3703 isBndLink1 = ( theLink->MediumPos() > (*link1)->MediumPos() );
3704 isBndLink2 = ( theLink->MediumPos() > (*link2)->MediumPos() );
3705 if ( theStep == theFirstStep ) // (issue 22541) quad-dominant mesh
3707 if ( !isBndLink1 && !f1 )
3708 f1 = (*link1)->GetContinuesFace( this ); // get a quadrangle face
3709 if ( !isBndLink2 && !f2 )
3710 f2 = (*link2)->GetContinuesFace( this );
3713 else if ( _sides.size() < 4 )
3716 // propagate to adjacent faces till limit step or boundary
3717 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
3718 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
3719 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
3720 gp_Vec linkDir2(0,0,0);
3723 if ( f1 && !isBndLink1 )
3724 len1 = f1->MoveByBoundary
3725 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
3727 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
3729 MSG( " --------------- EXCEPTION");
3734 if ( f2 && !isBndLink2 )
3735 len2 = f2->MoveByBoundary
3736 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
3738 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
3740 MSG( " --------------- EXCEPTION");
3745 if ( theStep != theFirstStep )
3747 // choose chain length by direction of propagation most codirected with theRefVec
3748 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
3749 fullLen = choose1 ? len1 : len2;
3750 double r = thePrevLen / fullLen;
3752 gp_Vec move = linkNorm * refProj * ( 1 - r );
3753 theLink->Move( move, true );
3755 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
3756 " by " << refProj * ( 1 - r ) << " following " <<
3757 (choose1 ? *link1->_qlink : *link2->_qlink)); // warning: link1 can be invalid
3759 if ( theLinkNorm ) *theLinkNorm = linkNorm;
3764 //================================================================================
3766 * \brief Checks if the face is distorted due to bentLink
3768 //================================================================================
3770 bool QFace::IsSpoiled(const QLink* bentLink ) const
3772 // code is valid for convex faces only
3774 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
3775 gc += XYZ( *n ) / size();
3776 for (unsigned i = 0; i < _sides.size(); ++i )
3778 if ( _sides[i] == bentLink ) continue;
3779 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3780 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
3781 if ( linkNorm * vecOut < 0 )
3783 double mag2 = linkNorm.SquareMagnitude();
3784 if ( mag2 > numeric_limits<double>::min() )
3785 linkNorm /= sqrt( mag2 );
3786 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
3787 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
3788 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
3795 //================================================================================
3797 * \brief Find pairs of continues faces
3799 //================================================================================
3801 void QLink::SetContinuesFaces() const
3803 // x0 x - QLink, [-|] - QFace, v - volume
3805 // | Between _faces of link x2 two vertical faces are continues
3806 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
3807 // | to _faces[0] and _faces[1] and horizontal faces to
3808 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
3811 if ( _faces.empty() )
3813 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
3814 if ( _faces[0]->IsBoundary() )
3815 iBoundary[ nbBoundary++ ] = 0;
3816 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
3818 // look for a face bounding none of volumes bound by _faces[0]
3819 bool sameVol = false;
3820 int nbVol = _faces[iF]->NbVolumes();
3821 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
3822 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
3823 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
3826 if ( _faces[iF]->IsBoundary() )
3827 iBoundary[ nbBoundary++ ] = iF;
3829 // Set continues faces: arrange _faces to have
3830 // _faces[0] continues to _faces[1]
3831 // _faces[2] continues to _faces[3]
3832 if ( nbBoundary == 2 ) // bnd faces are continues
3834 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
3836 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
3837 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
3840 else if ( iFaceCont > 0 ) // continues faces found
3842 if ( iFaceCont != 1 )
3843 std::swap( _faces[1], _faces[iFaceCont] );
3845 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
3847 _faces.insert( ++_faces.begin(), (QFace*) 0 );
3850 //================================================================================
3852 * \brief Return a face continues to the given one
3854 //================================================================================
3856 const QFace* QLink::GetContinuesFace( const QFace* face ) const
3858 for ( int i = 0; i < _faces.size(); ++i ) {
3859 if ( _faces[i] == face ) {
3860 int iF = i < 2 ? 1-i : 5-i;
3861 return iF < _faces.size() ? _faces[iF] : 0;
3866 //================================================================================
3868 * \brief True if link is on mesh boundary
3870 //================================================================================
3872 bool QLink::OnBoundary() const
3874 for ( int i = 0; i < _faces.size(); ++i )
3875 if (_faces[i] && _faces[i]->IsBoundary()) return true;
3878 //================================================================================
3880 * \brief Return normal of link of the chain
3882 //================================================================================
3884 gp_Vec TChainLink::Normal() const {
3886 if (_qfaces[0]) norm = _qfaces[0]->_normal;
3887 if (_qfaces[1]) norm += _qfaces[1]->_normal;
3890 //================================================================================
3892 * \brief Test link curvature taking into account size of faces
3894 //================================================================================
3896 bool TChainLink::IsStraight() const
3898 bool isStraight = _qlink->IsStraight();
3899 if ( isStraight && _qfaces[0] && !_qfaces[1] )
3901 int i = _qfaces[0]->LinkIndex( _qlink );
3902 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
3903 gp_XYZ mid1 = _qlink->MiddlePnt();
3904 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
3905 double faceSize2 = (mid1-mid2).SquareModulus();
3906 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
3911 //================================================================================
3913 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
3915 //================================================================================
3917 void fixPrism( TChain& allLinks )
3919 // separate boundary links from internal ones
3920 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
3921 QLinkSet interLinks, bndLinks1, bndLink2;
3923 bool isCurved = false;
3924 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3925 if ( (*lnk)->OnBoundary() )
3926 bndLinks1.insert( lnk->_qlink );
3928 interLinks.insert( lnk->_qlink );
3929 isCurved = isCurved || !lnk->IsStraight();
3932 return; // no need to move
3934 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
3936 while ( !interLinks.empty() && !curBndLinks->empty() )
3938 // propagate movement from boundary links to connected internal links
3939 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
3940 for ( ; bnd != bndEnd; ++bnd )
3942 const QLink* bndLink = *bnd;
3943 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
3945 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
3946 if ( !face ) continue;
3947 // find and move internal link opposite to bndLink within the face
3948 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
3949 const QLink* interLink = face->_sides[ interInd ];
3950 QLinkSet::iterator pInterLink = interLinks.find( interLink );
3951 if ( pInterLink == interLinks.end() ) continue; // not internal link
3952 interLink->Move( bndLink->_nodeMove );
3953 // treated internal links become new boundary ones
3954 interLinks.erase( pInterLink );
3955 newBndLinks->insert( interLink );
3958 curBndLinks->clear();
3959 std::swap( curBndLinks, newBndLinks );
3963 //================================================================================
3965 * \brief Fix links of continues triangles near curved boundary
3967 //================================================================================
3969 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
3971 if ( allLinks.empty() ) return;
3973 TLinkSet linkSet( allLinks.begin(), allLinks.end());
3974 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
3976 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
3978 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
3980 // move iff a boundary link is bent towards inside of a face (issue 0021084)
3981 const QFace* face = linkIt->_qfaces[0];
3982 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
3983 face->_sides[1]->MiddlePnt() +
3984 face->_sides[2]->MiddlePnt() ) / 3.;
3985 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
3986 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
3987 //if ( face->IsSpoiled( linkIt->_qlink ))
3988 if ( linkBentInside )
3989 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
3994 //================================================================================
3996 * \brief Detect rectangular structure of links and build chains from them
3998 //================================================================================
4000 enum TSplitTriaResult {
4001 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
4002 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
4004 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
4005 vector< TChain> & resultChains,
4006 SMDS_TypeOfPosition pos )
4008 // put links in the set and evalute number of result chains by number of boundary links
4011 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
4012 linkSet.insert( *lnk );
4013 nbBndLinks += lnk->IsBoundary();
4015 resultChains.clear();
4016 resultChains.reserve( nbBndLinks / 2 );
4018 TLinkInSet linkIt, linksEnd = linkSet.end();
4020 // find a boundary link with corner node; corner node has position pos-2
4021 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
4023 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
4024 const SMDS_MeshNode* corner = 0;
4025 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
4026 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
4031 TLinkInSet startLink = linkIt;
4032 const SMDS_MeshNode* startCorner = corner;
4033 vector< TChain* > rowChains;
4036 while ( startLink != linksEnd) // loop on columns
4038 // We suppose we have a rectangular structure like shown here. We have found a
4039 // corner of the rectangle (startCorner) and a boundary link sharing
4040 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
4041 // --o---o---o structure making several chains at once. One chain (columnChain)
4042 // |\ | /| starts at startLink and continues upward (we look at the structure
4043 // \ | \ | / | from such point that startLink is on the bottom of the structure).
4044 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
4045 // --o---o---o encounter.
4047 // / | \ | \ | startCorner
4052 if ( resultChains.size() == nbBndLinks / 2 )
4054 resultChains.push_back( TChain() );
4055 TChain& columnChain = resultChains.back();
4057 TLinkInSet botLink = startLink; // current horizontal link to go up from
4058 corner = startCorner; // current corner the botLink ends at
4060 while ( botLink != linksEnd ) // loop on rows
4062 // add botLink to the columnChain
4063 columnChain.push_back( *botLink );
4065 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
4067 { // the column ends
4068 if ( botLink == startLink )
4069 return _TWISTED_CHAIN; // issue 0020951
4070 linkSet.erase( botLink );
4071 if ( iRow != rowChains.size() )
4072 return _FEW_ROWS; // different nb of rows in columns
4075 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
4076 // link ending at <corner> (sideLink); there are two cases:
4077 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
4078 // since midQuadLink is not at boundary while sideLink is.
4079 // 2) midQuadLink ends at <corner>
4081 TLinkInSet midQuadLink = linksEnd;
4082 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
4084 if ( isCase2 ) { // find midQuadLink among links of botTria
4085 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
4086 if ( midQuadLink->IsBoundary() )
4087 return _BAD_MIDQUAD;
4089 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
4090 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
4093 columnChain.push_back( *midQuadLink );
4094 if ( iRow >= rowChains.size() ) {
4096 return _MANY_ROWS; // different nb of rows in columns
4097 if ( resultChains.size() == nbBndLinks / 2 )
4099 resultChains.push_back( TChain() );
4100 rowChains.push_back( & resultChains.back() );
4102 rowChains[iRow]->push_back( *sideLink );
4103 rowChains[iRow]->push_back( *midQuadLink );
4105 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
4109 // prepare startCorner and startLink for the next column
4110 startCorner = startLink->NextNode( startCorner );
4112 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
4114 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
4115 // check if no more columns remains
4116 if ( startLink != linksEnd ) {
4117 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
4118 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
4119 startLink = linksEnd; // startLink bounds upTria or botTria
4120 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
4124 // find bottom link and corner for the next row
4125 corner = sideLink->NextNode( corner );
4126 // next bottom link ends at the new corner
4127 linkSet.erase( botLink );
4128 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
4129 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
4131 if ( midQuadLink == startLink || sideLink == startLink )
4132 return _TWISTED_CHAIN; // issue 0020951
4133 linkSet.erase( midQuadLink );
4134 linkSet.erase( sideLink );
4136 // make faces neighboring the found ones be boundary
4137 if ( startLink != linksEnd ) {
4138 const QFace* tria = isCase2 ? botTria : upTria;
4139 for ( int iL = 0; iL < 3; ++iL ) {
4140 linkIt = linkSet.find( tria->_sides[iL] );
4141 if ( linkIt != linksEnd )
4142 linkIt->RemoveFace( tria );
4145 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
4146 botLink->RemoveFace( upTria ); // make next botTria first in vector
4153 // In the linkSet, there must remain the last links of rowChains; add them
4154 if ( linkSet.size() != rowChains.size() )
4155 return _BAD_SET_SIZE;
4156 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
4157 // find the link (startLink) ending at startCorner
4159 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
4160 if ( (*startLink)->node1() == startCorner ) {
4161 corner = (*startLink)->node2(); break;
4163 else if ( (*startLink)->node2() == startCorner) {
4164 corner = (*startLink)->node1(); break;
4167 if ( startLink == linksEnd )
4169 rowChains[ iRow ]->push_back( *startLink );
4170 linkSet.erase( startLink );
4171 startCorner = corner;
4177 //================================================================================
4179 * \brief Place medium nodes at the link middle for elements whose corner nodes
4180 * are out of geometrical boundary to prevent distorting elements.
4181 * Issue 0020982, note 0013990
4183 //================================================================================
4185 void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
4186 SMESH_ComputeErrorPtr& theError)
4188 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
4189 TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
4190 if ( shape.IsNull() ) return;
4192 if ( !theError ) theError = SMESH_ComputeError::New();
4196 if ( shape.ShapeType() == TopAbs_FACE ) // 2D
4198 if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
4200 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
4201 if ( !faceSM ) return;
4203 const TopoDS_Face& face = TopoDS::Face( shape );
4204 Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
4206 TopExp_Explorer edgeIt( face, TopAbs_EDGE );
4207 for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
4209 // check if the EDGE needs checking
4210 const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
4211 if ( SMESH_Algo::isDegenerated( edge ) )
4213 if ( theHelper.IsRealSeam( edge ) &&
4214 edge.Orientation() == TopAbs_REVERSED )
4217 SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
4218 if ( !edgeSM ) continue;
4221 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
4222 BRepAdaptor_Curve curve3D( edge );
4223 switch ( curve3D.GetType() ) {
4224 case GeomAbs_Line: continue;
4225 case GeomAbs_Circle:
4226 case GeomAbs_Ellipse:
4227 case GeomAbs_Hyperbola:
4228 case GeomAbs_Parabola:
4231 gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
4232 curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
4233 gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
4234 surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
4235 gp_Vec fNorm = Du1 ^ Dv1;
4236 if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
4237 continue; // face is normal to the curve3D
4239 gp_Vec curvNorm = fNorm ^ D1;
4240 if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
4241 if ( curvNorm * D2 > 0 )
4242 continue; // convex edge
4244 catch ( Standard_Failure )
4249 // get nodes shared by faces that may be distorted
4250 SMDS_NodeIteratorPtr nodeIt;
4251 if ( edgeSM->NbNodes() > 0 ) {
4252 nodeIt = edgeSM->GetNodes();
4255 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
4257 vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
4258 if ( !vertexSM ) continue;
4259 nodeIt = vertexSM->GetNodes();
4262 // find suspicious faces
4263 TIDSortedElemSet checkedFaces;
4264 vector< const SMDS_MeshNode* > nOnEdge( 2 );
4265 const SMDS_MeshNode* nOnFace;
4266 while ( nodeIt->more() )
4268 const SMDS_MeshNode* n = nodeIt->next();
4269 SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
4270 while ( faceIt->more() )
4272 const SMDS_MeshElement* f = faceIt->next();
4273 if ( !faceSM->Contains( f ) ||
4274 f->NbNodes() < 6 || // check quadratic triangles only
4275 !checkedFaces.insert( f ).second )
4278 // get nodes on EDGE and on FACE of a suspicious face
4279 nOnEdge.clear(); nOnFace = 0;
4280 SMDS_MeshElement::iterator triNode = f->begin_nodes();
4281 for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
4284 if ( n->GetPosition()->GetDim() == 2 )
4287 nOnEdge.push_back( n );
4290 // check if nOnFace is inside the FACE
4291 if ( nOnFace && nOnEdge.size() == 2 )
4293 theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
4294 if ( !SMESH_MeshAlgos::FaceNormal( f, faceNorm, /*normalized=*/false ))
4296 gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
4297 gp_XYZ edgeNorm = faceNorm ^ edgeDir;
4298 n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true ); // find n, not create
4299 gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
4300 gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
4301 gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
4302 double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
4303 double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
4304 if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
4306 // nOnFace is out of FACE, move a medium on-edge node to the middle
4307 gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
4308 meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4309 MSG( "move OUT of face " << n );
4310 theError->myBadElements.push_back( f );
4316 if ( !theError->myBadElements.empty() )
4317 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4320 } // 2D ==============================================================================
4322 if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
4324 if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
4325 theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
4327 SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
4328 if ( !solidSM ) return;
4330 // check if the SOLID is bound by concave FACEs
4331 vector< TopoDS_Face > concaveFaces;
4332 TopExp_Explorer faceIt( shape, TopAbs_FACE );
4333 for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4335 const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
4336 if ( !meshDS->MeshElements( face )) continue;
4338 BRepAdaptor_Surface surface( face );
4339 switch ( surface.GetType() ) {
4340 case GeomAbs_Plane: continue;
4341 case GeomAbs_Cylinder:
4343 case GeomAbs_Sphere:
4346 double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
4347 double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
4348 gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
4349 surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
4350 gp_Vec fNorm = Du1 ^ Dv1;
4351 if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
4352 bool concaveU = ( fNorm * Du2 > 1e-100 );
4353 bool concaveV = ( fNorm * Dv2 > 1e-100 );
4354 if ( concaveU || concaveV )
4355 concaveFaces.push_back( face );
4357 catch ( Standard_Failure )
4359 concaveFaces.push_back( face );
4363 if ( concaveFaces.empty() )
4366 // fix 2D mesh on the SOLID
4367 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4369 SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
4370 faceHelper.SetSubShape( faceIt.Current() );
4371 force3DOutOfBoundary( faceHelper, theError );
4374 // get an iterator over faces on concaveFaces
4375 vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
4376 for ( size_t i = 0; i < concaveFaces.size(); ++i )
4377 faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
4378 typedef SMDS_IteratorOnIterators
4379 < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
4380 SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
4382 // a seacher to check if a volume is close to a concave face
4383 std::auto_ptr< SMESH_ElementSearcher > faceSearcher
4384 ( SMESH_MeshAlgos::GetElementSearcher( *theHelper.GetMeshDS(), faceIter ));
4387 //BRepClass3d_SolidClassifier solidClassifier( shape );
4389 TIDSortedElemSet checkedVols, movedNodes;
4390 //for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4391 for ( size_t iF = 0; iF < concaveFaces.size(); ++iF ) // loop on concave FACEs
4393 //const TopoDS_Shape& face = faceIt.Current();
4394 const TopoDS_Shape& face = concaveFaces[ iF ];
4395 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
4396 if ( !faceSM ) continue;
4398 // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
4399 SMDS_NodeIteratorPtr nodeIt;
4400 if ( faceSM->NbNodes() > 0 ) {
4401 nodeIt = faceSM->GetNodes();
4404 TopExp_Explorer vertex( face, TopAbs_VERTEX );
4405 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
4406 if ( !vertexSM ) continue;
4407 nodeIt = vertexSM->GetNodes();
4409 // get ids of sub-shapes of the FACE
4411 SMESH_subMeshIteratorPtr smIt =
4412 theHelper.GetMesh()->GetSubMesh( face )->getDependsOnIterator(/*includeSelf=*/true);
4413 while ( smIt->more() )
4414 subIDs.insert( smIt->next()->GetId() );
4416 // find suspicious volumes adjacent to the FACE
4417 vector< const SMDS_MeshNode* > nOnFace( 4 );
4418 const SMDS_MeshNode* nInSolid;
4419 while ( nodeIt->more() )
4421 const SMDS_MeshNode* n = nodeIt->next();
4422 SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
4423 while ( volIt->more() )
4425 const SMDS_MeshElement* vol = volIt->next();
4426 int nbN = vol->NbCornerNodes();
4427 if ( ( nbN != 4 && nbN != 5 ) ||
4428 !solidSM->Contains( vol ) ||
4429 !checkedVols.insert( vol ).second )
4432 // get nodes on FACE and in SOLID of a suspicious volume
4433 nOnFace.clear(); nInSolid = 0;
4434 SMDS_MeshElement::iterator volNode = vol->begin_nodes();
4435 for ( int nb = nbN; nb > 0; ++volNode, --nb )
4438 if ( n->GetPosition()->GetDim() == 3 )
4440 else if ( subIDs.count( n->getshapeId() ))
4441 nOnFace.push_back( n );
4445 if ( !nInSolid || nOnFace.size() != nbN - 1 )
4448 // get size of the vol
4449 SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
4450 double volLength = pInSolid.SquareDistance( nOnFace[0] );
4451 for ( size_t i = 1; i < nOnFace.size(); ++i )
4453 volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
4456 // check if vol is close to concaveFaces
4457 const SMDS_MeshElement* closeFace =
4458 faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
4460 pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
4463 // check if vol is distorted, i.e. a medium node is much closer
4464 // to nInSolid than the link middle
4465 bool isDistorted = false;
4466 SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
4467 if ( !SMESH_MeshAlgos::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
4469 theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
4470 vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
4471 for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
4472 for ( size_t j = i+1; j < nOnFace.size(); ++j )
4474 SMESH_TLink link( nOnFace[i], nOnFace[j] );
4475 TLinkNodeMap::const_iterator linkIt =
4476 theHelper.GetTLinkNodeMap().find( link );
4477 if ( linkIt != theHelper.GetTLinkNodeMap().end() )
4479 links.push_back( make_pair( linkIt->first, linkIt->second ));
4480 if ( !isDistorted ) {
4481 // compare projections of nInSolid and nMedium to face normal
4482 gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
4483 double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
4484 double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
4485 isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
4489 // move medium nodes to link middle
4492 for ( size_t i = 0; i < links.size(); ++i )
4494 const SMDS_MeshNode* nMedium = links[i].second;
4495 if ( movedNodes.insert( nMedium ).second )
4497 gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
4498 SMESH_TNodeXYZ( links[i].first.node2() ));
4499 meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4500 MSG( "move OUT of solid " << nMedium );
4503 theError->myBadElements.push_back( vol );
4505 } // loop on volumes sharing a node on FACE
4506 } // loop on nodes on FACE
4507 } // loop on FACEs of a SOLID
4509 if ( !theError->myBadElements.empty() )
4510 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4516 //=======================================================================
4518 * \brief Move medium nodes of faces and volumes to fix distorted elements
4519 * \param error - container of fixed distorted elements
4520 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
4522 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
4524 //=======================================================================
4526 void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& compError,
4529 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
4530 if ( getenv("NO_FixQuadraticElements") )
4533 // 0. Apply algorithm to SOLIDs or FACEs
4534 // ----------------------------------------------
4535 if ( myShape.IsNull() ) {
4536 if ( !myMesh->HasShapeToMesh() ) return;
4537 SetSubShape( myMesh->GetShapeToMesh() );
4541 TopTools_IndexedMapOfShape solids;
4542 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
4543 nbSolids = solids.Extent();
4545 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
4546 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
4547 faces.Add( f.Current() ); // not in solid
4549 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
4550 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
4551 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
4552 faces.Add( f.Current() ); // in not meshed solid
4554 else { // fix nodes in the solid and its faces
4556 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
4558 SMESH_MesherHelper h(*myMesh);
4559 h.SetSubShape( s.Current() );
4560 h.ToFixNodeParameters(true);
4561 h.FixQuadraticElements( compError, false );
4564 // fix nodes on geom faces
4566 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
4568 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
4569 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
4570 SMESH_MesherHelper h(*myMesh);
4571 h.SetSubShape( fIt.Key() );
4572 h.ToFixNodeParameters(true);
4573 h.FixQuadraticElements( compError, true);
4575 //perf_print_all_meters(1);
4576 if ( compError && compError->myName == EDITERR_NO_MEDIUM_ON_GEOM )
4577 compError->myComment = "during conversion to quadratic, "
4578 "some medium nodes were not placed on geometry to avoid distorting elements";
4582 // 1. Find out type of elements and get iterator on them
4583 // ---------------------------------------------------
4585 SMDS_ElemIteratorPtr elemIt;
4586 SMDSAbs_ElementType elemType = SMDSAbs_All;
4588 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
4591 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
4592 elemIt = smDS->GetElements();
4593 if ( elemIt->more() ) {
4594 elemType = elemIt->next()->GetType();
4595 elemIt = smDS->GetElements();
4598 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
4601 // 2. Fill in auxiliary data structures
4602 // ----------------------------------
4606 set< QLink >::iterator pLink;
4607 set< QFace >::iterator pFace;
4609 bool isCurved = false;
4610 //bool hasRectFaces = false;
4611 //set<int> nbElemNodeSet;
4612 SMDS_VolumeTool volTool;
4614 TIDSortedNodeSet apexOfPyramid;
4615 const int apexIndex = 4;
4618 // Move medium nodes to the link middle for elements whose corner nodes
4619 // are out of geometrical boundary to fix distorted elements.
4620 force3DOutOfBoundary( *this, compError );
4622 if ( elemType == SMDSAbs_Volume )
4624 while ( elemIt->more() ) // loop on volumes
4626 const SMDS_MeshElement* vol = elemIt->next();
4627 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
4629 double volMinSize2 = -1.;
4630 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
4632 int nbN = volTool.NbFaceNodes( iF );
4633 //nbElemNodeSet.insert( nbN );
4634 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
4635 vector< const QLink* > faceLinks( nbN/2 );
4636 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
4639 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
4640 pLink = links.insert( link ).first;
4641 faceLinks[ iN/2 ] = & *pLink;
4643 if ( link.MediumPos() == SMDS_TOP_3DSPACE )
4645 if ( !link.IsStraight() )
4646 return; // already fixed
4648 else if ( !isCurved )
4650 if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
4651 isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
4655 pFace = faces.insert( QFace( faceLinks )).first;
4656 if ( pFace->NbVolumes() == 0 )
4657 pFace->AddSelfToLinks();
4658 pFace->SetVolume( vol );
4659 // hasRectFaces = hasRectFaces ||
4660 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
4661 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
4664 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
4666 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
4667 faceNodes[4],faceNodes[6] );
4670 // collect pyramid apexes for further correction
4671 if ( vol->NbCornerNodes() == 5 )
4672 apexOfPyramid.insert( vol->GetNode( apexIndex ));
4674 set< QLink >::iterator pLink = links.begin();
4675 for ( ; pLink != links.end(); ++pLink )
4676 pLink->SetContinuesFaces();
4680 while ( elemIt->more() ) // loop on faces
4682 const SMDS_MeshElement* face = elemIt->next();
4683 if ( !face->IsQuadratic() )
4685 //nbElemNodeSet.insert( face->NbNodes() );
4686 int nbN = face->NbNodes()/2;
4687 vector< const QLink* > faceLinks( nbN );
4688 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
4691 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
4692 pLink = links.insert( link ).first;
4693 faceLinks[ iN ] = & *pLink;
4695 link.node1()->GetPosition()->GetTypeOfPosition() < 2 &&
4696 link.node2()->GetPosition()->GetTypeOfPosition() < 2 )
4697 isCurved = !link.IsStraight();
4700 pFace = faces.insert( QFace( faceLinks )).first;
4701 pFace->AddSelfToLinks();
4702 //hasRectFaces = ( hasRectFaces || nbN == 4 );
4706 return; // no curved edges of faces
4708 // 3. Compute displacement of medium nodes
4709 // ---------------------------------------
4711 SMESH_MesherHelper faceHlp(*myMesh);
4713 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones.
4714 TopLoc_Location loc;
4716 // not to treat boundary of volumic sub-mesh.
4717 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
4718 for ( ; isInside < 2; ++isInside )
4720 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
4721 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
4722 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
4724 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
4725 if ( bool(isInside) == pFace->IsBoundary() )
4727 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
4730 // make chain of links connected via continues faces
4733 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
4735 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
4737 vector< TChain > chains;
4738 if ( error == ERR_OK ) { // chain contains continues rectangles
4740 chains[0].splice( chains[0].begin(), rawChain );
4742 else if ( error == ERR_TRI ) { // chain contains continues triangles
4743 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
4744 if ( res != _OK ) { // not quadrangles split into triangles
4745 fixTriaNearBoundary( rawChain, *this );
4749 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
4750 fixPrism( rawChain );
4756 for ( int iC = 0; iC < chains.size(); ++iC )
4758 TChain& chain = chains[iC];
4759 if ( chain.empty() ) continue;
4760 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
4761 MSG("3D straight - ignore");
4764 if ( chain.front()->MediumPos() > bndPos ||
4765 chain.back() ->MediumPos() > bndPos ) {
4766 MSG("Internal chain - ignore");
4769 // mesure chain length and compute link position along the chain
4770 double chainLen = 0;
4771 vector< double > linkPos;
4772 MSGBEG( "Link medium nodes: ");
4773 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
4774 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
4775 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
4776 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4777 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
4778 link1 = chain.erase( link1 );
4779 if ( link1 == chain.end() )
4781 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4784 linkPos.push_back( chainLen );
4787 if ( linkPos.size() < 2 )
4790 gp_Vec move0 = chain.front()->_nodeMove;
4791 gp_Vec move1 = chain.back ()->_nodeMove;
4796 // compute node displacement of end links of chain in parametric space of FACE
4797 TChainLink& linkOnFace = *(++chain.begin());
4798 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
4799 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
4800 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
4802 face = TopoDS::Face( f );
4803 faceHlp.SetSubShape( face );
4804 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
4806 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
4808 TChainLink& link = is1 ? chain.back() : chain.front();
4809 gp_XY uvm = faceHlp.GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV );
4810 gp_XY uv1 = faceHlp.GetNodeUV( face, link->node1(), nodeOnFace, &checkUV );
4811 gp_XY uv2 = faceHlp.GetNodeUV( face, link->node2(), nodeOnFace, &checkUV );
4812 gp_XY uv12 = faceHlp.GetMiddleUV( surf, uv1, uv2 );
4813 // uvMove = uvm - uv12
4814 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
4815 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
4816 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
4817 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
4818 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
4819 10 * uvMove.SquareModulus());
4821 if ( isStraight[0] && isStraight[1] ) {
4822 MSG("2D straight - ignore");
4823 continue; // straight - no need to move nodes of internal links
4826 // check if a chain is already fixed
4827 gp_XY uvm = faceHlp.GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV );
4828 gp_XY uv1 = faceHlp.GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV );
4829 gp_XY uv2 = faceHlp.GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV );
4830 gp_XY uv12 = faceHlp.GetMiddleUV( surf, uv1, uv2 );
4831 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
4833 MSG("Already fixed - ignore");
4839 if ( isInside || face.IsNull() )
4841 // compute node displacement of end links in their local coord systems
4843 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
4844 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
4845 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4846 move0.Transform(trsf);
4849 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
4850 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
4851 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4852 move1.Transform(trsf);
4855 // compute displacement of medium nodes
4856 link2 = chain.begin();
4859 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
4861 double r = linkPos[i] / chainLen;
4862 // displacement in local coord system
4863 gp_Vec move = (1. - r) * move0 + r * move1;
4864 if ( isInside || face.IsNull()) {
4865 // transform to global
4866 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
4867 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
4868 gp_Vec x = x01.Normalized() + x12.Normalized();
4869 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
4870 move.Transform(trsf);
4873 // compute 3D displacement by 2D one
4874 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
4875 gp_XY oldUV = faceHlp.GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV );
4876 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added );
4877 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
4878 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
4879 if ( SMDS_FacePosition* nPos =
4880 dynamic_cast< SMDS_FacePosition* >((*link1)->_mediumNode->GetPosition()))
4881 nPos->SetParameters( newUV.X(), newUV.Y() );
4883 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
4884 move.SquareMagnitude())
4886 gp_XY uv0 = faceHlp.GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV );
4887 gp_XY uv2 = faceHlp.GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV );
4888 MSG( "TOO LONG MOVE \t" <<
4889 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
4890 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
4891 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
4892 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
4896 (*link1)->Move( move );
4897 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
4898 << chain.front()->_mediumNode->GetID() <<"-"
4899 << chain.back ()->_mediumNode->GetID() <<
4900 " by " << move.Magnitude());
4902 } // loop on chains of links
4903 } // loop on 2 directions of propagation from quadrangle
4905 } // fix faces and/or volumes
4910 TIDSortedElemSet biQuadQuas, biQuadTris, triQuadHexa;
4911 const SMDS_MeshElement *biQuadQua, *triQuadHex;
4912 const bool toFixCentralNodes = ( myMesh->NbBiQuadQuadrangles() +
4913 myMesh->NbBiQuadTriangles() +
4914 myMesh->NbTriQuadraticHexas() );
4916 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
4917 if ( pLink->IsMoved() )
4919 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
4920 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
4922 // collect bi-quadratic elements
4923 if ( toFixCentralNodes )
4925 biQuadQua = triQuadHex = 0;
4926 SMDS_ElemIteratorPtr eIt = pLink->_mediumNode->GetInverseElementIterator();
4927 while ( eIt->more() )
4929 const SMDS_MeshElement* e = eIt->next();
4930 switch( e->GetEntityType() ) {
4931 case SMDSEntity_BiQuad_Quadrangle: biQuadQuas.insert( e ); break;
4932 case SMDSEntity_BiQuad_Triangle: biQuadTris.insert( e ); break;
4933 case SMDSEntity_TriQuad_Hexa: triQuadHexa.insert( e ); break;
4940 // Fix positions of central nodes of bi-tri-quadratic elements
4942 // treat bi-quad quadrangles
4944 vector< const SMDS_MeshNode* > nodes( 9 );
4946 TIDSortedElemSet::iterator quadIt = biQuadQuas.begin();
4947 for ( ; quadIt != biQuadQuas.end(); ++quadIt )
4949 const SMDS_MeshElement* quad = *quadIt;
4952 nodes.assign( quad->begin_nodes(), quad->end_nodes() );
4954 TopoDS_Shape S = GetSubShapeByNode( nodes.back(), GetMeshDS() );
4955 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4956 const TopoDS_Face& F = TopoDS::Face( S );
4957 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4958 const double tol = BRep_Tool::Tolerance( F );
4960 for ( int i = 0; i < 8; ++i )
4962 uv[ i ] = GetNodeUV( F, nodes[i], nodes[8], &checkUV );
4963 // as this method is used after mesh generation, UV of nodes is not
4964 // updated according to bending links, so we update
4965 if ( i > 3 && nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4966 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4968 // move the central node
4969 gp_XY uvCent = calcTFI (0.5, 0.5, uv[0],uv[1],uv[2],uv[3],uv[4],uv[5],uv[6],uv[7] );
4970 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4971 GetMeshDS()->MoveNode( nodes[8], p.X(), p.Y(), p.Z());
4975 // treat bi-quad triangles
4977 vector< const SMDS_MeshNode* > nodes;
4979 TIDSortedElemSet::iterator triIt = biQuadTris.begin();
4980 for ( ; triIt != biQuadTris.end(); ++triIt )
4982 const SMDS_MeshElement* tria = *triIt;
4984 const TopoDS_Shape& S = GetMeshDS()->IndexToShape( tria->getshapeId() );
4985 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4986 const TopoDS_Face& F = TopoDS::Face( S );
4987 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4988 const double tol = BRep_Tool::Tolerance( F );
4991 nodes.assign( tria->begin_nodes(), tria->end_nodes() );
4993 for ( int i = 0; i < 6; ++i )
4995 uv[ i ] = GetNodeUV( F, nodes[i], nodes[(i+1)%3], &checkUV );
4996 // as this method is used after mesh generation, UV of nodes is not
4997 // updated according to bending links, so we update
4998 if ( nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4999 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
5001 // move the central node
5002 gp_XY uvCent = GetCenterUV( uv[0], uv[1], uv[2], uv[3], uv[4], uv[5] );
5003 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
5004 GetMeshDS()->MoveNode( tria->GetNode(6), p.X(), p.Y(), p.Z() );
5008 // treat tri-quadratic hexahedra
5010 SMDS_VolumeTool volExp;
5011 TIDSortedElemSet::iterator hexIt = triQuadHexa.begin();
5012 for ( ; hexIt != triQuadHexa.end(); ++hexIt )
5014 volExp.Set( *hexIt, /*ignoreCentralNodes=*/false );
5016 // fix nodes central in sides
5017 for ( int iQuad = 0; iQuad < volExp.NbFaces(); ++iQuad )
5019 const SMDS_MeshNode** quadNodes = volExp.GetFaceNodes( iQuad );
5020 if ( quadNodes[8]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
5022 gp_XYZ p = calcTFI( 0.5, 0.5,
5023 SMESH_TNodeXYZ( quadNodes[0] ), SMESH_TNodeXYZ( quadNodes[2] ),
5024 SMESH_TNodeXYZ( quadNodes[4] ), SMESH_TNodeXYZ( quadNodes[6] ),
5025 SMESH_TNodeXYZ( quadNodes[1] ), SMESH_TNodeXYZ( quadNodes[3] ),
5026 SMESH_TNodeXYZ( quadNodes[5] ), SMESH_TNodeXYZ( quadNodes[7] ));
5027 GetMeshDS()->MoveNode( quadNodes[8], p.X(), p.Y(), p.Z());
5031 // fix the volume central node
5032 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
5033 const SMDS_MeshNode** hexNodes = volExp.GetNodes();
5035 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( hexNodes[ 0 ] );
5036 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( hexNodes[ 3 ] );
5037 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( hexNodes[ 1 ] );
5038 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( hexNodes[ 2 ] );
5039 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( hexNodes[ 4 ] );
5040 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( hexNodes[ 7 ] );
5041 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( hexNodes[ 5 ] );
5042 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( hexNodes[ 6 ] );
5044 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( hexNodes[ 11 ] );
5045 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( hexNodes[ 9 ] );
5046 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( hexNodes[ 8 ] );
5047 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( hexNodes[ 10 ] );
5048 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( hexNodes[ 15 ] );
5049 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( hexNodes[ 13 ] );
5050 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( hexNodes[ 12 ] );
5051 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( hexNodes[ 14 ] );
5052 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( hexNodes[ 16 ] );
5053 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( hexNodes[ 19 ] );
5054 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( hexNodes[ 17 ] );
5055 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( hexNodes[ 18 ] );
5057 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( hexNodes[ 20 ] );
5058 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( hexNodes[ 25 ] );
5059 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( hexNodes[ 21 ] );
5060 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( hexNodes[ 23 ] );
5061 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( hexNodes[ 24 ] );
5062 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( hexNodes[ 22 ] );
5064 gp_XYZ nCenterParams(0.5, 0.5, 0.5), nCenterCoords;
5065 SMESH_Block::ShellPoint( nCenterParams, pointsOnShapes, nCenterCoords );
5066 GetMeshDS()->MoveNode( hexNodes[26],
5067 nCenterCoords.X(), nCenterCoords.Y(), nCenterCoords.Z());