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() );
264 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
265 const double du = Abs( uv1.Coord(1) - uv2.Coord(1) );
266 const double dv = Abs( uv1.Coord(2) - uv2.Coord(2) );
268 bool isSeam = BRep_Tool::IsClosed( edge, face );
269 if ( isSeam ) // real seam - having two pcurves on face
271 // pcurve can lie not on pediod boundary (22582, mesh_Quadratic_01/C9)
274 double u1 = uv1.Coord(1);
276 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
277 double u2 = uv1.Coord(1);
278 myPar1[0] = Min( u1, u2 );
279 myPar2[0] = Max( u1, u2 );
283 double v1 = uv1.Coord(2);
285 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
286 double v2 = uv1.Coord(2);
287 myPar1[1] = Min( v1, v2 );
288 myPar2[1] = Max( v1, v2 );
291 else //if ( !isSeam )
293 // one pcurve but on period boundary (22772, mesh_Quadratic_01/D1)
294 if (( myParIndex & U_periodic ) && du < Precision::PConfusion() )
296 isSeam = ( Abs( uv1.Coord(1) - myPar1[0] ) < Precision::PConfusion() ||
297 Abs( uv1.Coord(1) - myPar2[0] ) < Precision::PConfusion() );
299 else if (( myParIndex & V_periodic ) && dv < Precision::PConfusion() )
301 isSeam = ( Abs( uv1.Coord(2) - myPar1[1] ) < Precision::PConfusion() ||
302 Abs( uv1.Coord(2) - myPar2[1] ) < Precision::PConfusion() );
307 // store seam shape indices, negative if shape encounters twice
308 int edgeID = meshDS->ShapeToIndex( edge );
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( meshDS->ShapeToIndex( edge ));
319 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
320 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
326 //=======================================================================
327 //function : GetNodeUVneedInFaceNode
328 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
329 // Return true if the face is periodic.
330 // If F is Null, answer about sub-shape set through IsQuadraticSubMesh() or
332 //=======================================================================
334 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
336 if ( F.IsNull() ) return !mySeamShapeIds.empty();
338 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
339 return !mySeamShapeIds.empty();
342 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
343 if ( !aSurface.IsNull() )
344 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
349 //=======================================================================
350 //function : IsMedium
352 //=======================================================================
354 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
355 const SMDSAbs_ElementType typeToCheck)
357 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
360 //=======================================================================
361 //function : GetSubShapeByNode
362 //purpose : Return support shape of a node
363 //=======================================================================
365 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
366 const SMESHDS_Mesh* meshDS)
368 int shapeID = node ? node->getshapeId() : 0;
369 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
370 return meshDS->IndexToShape( shapeID );
372 return TopoDS_Shape();
376 //=======================================================================
377 //function : AddTLinkNode
378 //purpose : add a link in my data structure
379 //=======================================================================
381 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
382 const SMDS_MeshNode* n2,
383 const SMDS_MeshNode* n12)
385 // add new record to map
386 SMESH_TLink link( n1, n2 );
387 myTLinkNodeMap.insert( make_pair(link,n12));
390 //================================================================================
392 * \brief Add quadratic links of edge to own data structure
394 //================================================================================
396 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
398 if ( edge && edge->IsQuadratic() )
399 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
405 //================================================================================
407 * \brief Add quadratic links of face to own data structure
409 //================================================================================
411 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
415 switch ( f->NbNodes() ) {
417 // myMapWithCentralNode.insert
418 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2) ),
420 // break; -- add medium nodes as well
422 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
423 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
424 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
427 // myMapWithCentralNode.insert
428 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2),f->GetNode(3) ),
430 // break; -- add medium nodes as well
432 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
433 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
434 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
435 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7)); break;
442 //================================================================================
444 * \brief Add quadratic links of volume to own data structure
446 //================================================================================
448 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
450 if ( volume->IsQuadratic() )
452 SMDS_VolumeTool vTool( volume );
453 const SMDS_MeshNode** nodes = vTool.GetNodes();
455 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
457 const int nbN = vTool.NbFaceNodes( iF );
458 const int* iNodes = vTool.GetFaceNodesIndices( iF );
459 for ( int i = 0; i < nbN; )
461 int iN1 = iNodes[i++];
462 int iN12 = iNodes[i++];
464 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
465 int linkID = iN1 * vTool.NbNodes() + iN2;
466 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
467 if ( it_isNew.second )
468 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
470 addedLinks.erase( it_isNew.first ); // each link encounters only twice
472 if ( vTool.NbNodes() == 27 )
474 const SMDS_MeshNode* nFCenter = nodes[ vTool.GetCenterNodeIndex( iF )];
475 if ( nFCenter->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
476 myMapWithCentralNode.insert
477 ( make_pair( TBiQuad( nodes[ iNodes[0]], nodes[ iNodes[1]],
478 nodes[ iNodes[2]], nodes[ iNodes[3]] ),
487 //================================================================================
489 * \brief Return true if position of nodes on the shape hasn't yet been checked or
490 * the positions proved to be invalid
492 //================================================================================
494 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
496 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
497 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
500 //================================================================================
502 * \brief Set validity of positions of nodes on the shape.
503 * Once set, validity is not changed
505 //================================================================================
507 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
509 std::map< int,bool >::iterator sh_ok =
510 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok)).first;
515 //=======================================================================
516 //function : ToFixNodeParameters
517 //purpose : Enables fixing node parameters on EDGEs and FACEs in
518 // GetNodeU(...,check=true), GetNodeUV(...,check=true), CheckNodeUV() and
519 // CheckNodeU() in case if a node lies on a shape set via SetSubShape().
521 //=======================================================================
523 void SMESH_MesherHelper::ToFixNodeParameters(bool toFix)
525 myFixNodeParameters = toFix;
529 //=======================================================================
530 //function : GetUVOnSeam
531 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
532 //=======================================================================
534 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
536 gp_Pnt2d result = uv1;
537 for ( int i = U_periodic; i <= V_periodic ; ++i )
539 if ( myParIndex & i )
541 double p1 = uv1.Coord( i );
542 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
543 if ( myParIndex == i ||
544 dp1 < ( myPar2[i-1] - myPar1[i-1] ) / 100. ||
545 dp2 < ( myPar2[i-1] - myPar1[i-1] ) / 100. )
547 double p2 = uv2.Coord( i );
548 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
549 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
550 result.SetCoord( i, p1Alt );
557 //=======================================================================
558 //function : GetNodeUV
559 //purpose : Return node UV on face
560 //=======================================================================
562 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
563 const SMDS_MeshNode* n,
564 const SMDS_MeshNode* n2,
567 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
569 const SMDS_PositionPtr Pos = n->GetPosition();
571 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
573 // node has position on face
574 const SMDS_FacePosition* fpos =
575 static_cast<const SMDS_FacePosition*>( Pos );
576 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
578 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
580 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
582 // node has position on edge => it is needed to find
583 // corresponding edge from face, get pcurve for this
584 // edge and retrieve value from this pcurve
585 const SMDS_EdgePosition* epos =
586 static_cast<const SMDS_EdgePosition*>( Pos );
587 int edgeID = n->getshapeId();
588 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
589 double f, l, u = epos->GetUParameter();
590 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
591 bool validU = ( f < u && u < l );
593 uv = C2d->Value( u );
595 uv.SetCoord( Precision::Infinite(),0.);
596 if ( check || !validU )
597 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ),/*force=*/ !validU );
599 // for a node on a seam edge select one of UVs on 2 pcurves
600 if ( n2 && IsSeamShape( edgeID ) )
602 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
605 { // adjust uv to period
607 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
608 Standard_Boolean isUPeriodic = S->IsUPeriodic();
609 Standard_Boolean isVPeriodic = S->IsVPeriodic();
611 if ( isUPeriodic || isVPeriodic ) {
612 Standard_Real UF,UL,VF,VL;
613 S->Bounds(UF,UL,VF,VL);
615 newUV.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
617 newUV.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
621 gp_Pnt2d uv2 = GetNodeUV( F, n2, 0, check );
622 if ( isUPeriodic && Abs( uv.X()-uv2.X() ) < Abs( newUV.X()-uv2.X() ))
623 newUV.SetX( uv.X() );
624 if ( isVPeriodic && Abs( uv.Y()-uv2.Y() ) < Abs( newUV.Y()-uv2.Y() ))
625 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 ) )
679 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
684 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
693 //=======================================================================
694 //function : CheckNodeUV
695 //purpose : Check and fix node UV on a face
696 //=======================================================================
698 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
699 const SMDS_MeshNode* n,
703 double distXYZ[4]) const
705 int shapeID = n->getshapeId();
706 bool infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ));
707 bool zero = ( uv.X() == 0. && uv.Y() == 0. );
708 if ( force || toCheckPosOnShape( shapeID ) || infinit || zero )
710 // check that uv is correct
712 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
713 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
715 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
717 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
719 setPosOnShapeValidity( shapeID, false );
720 if ( !infinit && distXYZ ) {
721 surfPnt.Transform( loc );
723 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
725 // uv incorrect, project the node to surface
726 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
727 projector.Perform( nodePnt );
728 if ( !projector.IsDone() || projector.NbPoints() < 1 )
730 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
733 Quantity_Parameter U,V;
734 projector.LowerDistanceParameters(U,V);
736 surfPnt = surface->Value( U, V );
737 dist = nodePnt.Distance( surfPnt );
739 surfPnt.Transform( loc );
741 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
745 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
748 // store the fixed UV on the face
749 if ( myShape.IsSame(F) && shapeID == myShapeID && myFixNodeParameters )
750 const_cast<SMDS_MeshNode*>(n)->SetPosition
751 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
753 else if ( uv.Modulus() > numeric_limits<double>::min() )
755 setPosOnShapeValidity( shapeID, true );
761 //=======================================================================
762 //function : GetProjector
763 //purpose : Return projector intitialized by given face without location, which is returned
764 //=======================================================================
766 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
767 TopLoc_Location& loc,
770 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
771 int faceID = GetMeshDS()->ShapeToIndex( F );
772 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
773 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
774 if ( i_proj == i2proj.end() )
776 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
777 double U1, U2, V1, V2;
778 surface->Bounds(U1, U2, V1, V2);
779 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
780 proj->Init( surface, U1, U2, V1, V2, tol );
781 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
783 return *( i_proj->second );
788 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
789 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
790 gp_XY_FunPtr(Subtracted);
793 //=======================================================================
794 //function : applyIn2D
795 //purpose : Perform given operation on two 2d points in parameric space of given surface.
796 // It takes into account period of the surface. Use gp_XY_FunPtr macro
797 // to easily define pointer to function of gp_XY class.
798 //=======================================================================
800 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
804 const bool resultInPeriod)
806 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
807 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
808 if ( !isUPeriodic && !isVPeriodic )
811 // move uv2 not far than half-period from uv1
813 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
815 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
818 gp_XY res = fun( uv1, gp_XY(u2,v2) );
820 // move result within period
821 if ( resultInPeriod )
823 Standard_Real UF,UL,VF,VL;
824 surface->Bounds(UF,UL,VF,VL);
826 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
828 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
833 //=======================================================================
834 //function : GetMiddleUV
835 //purpose : Return middle UV taking in account surface period
836 //=======================================================================
838 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
843 // the proper place of getting basic surface seems to be in applyIn2D()
844 // but we put it here to decrease a risk of regressions just before releasing a version
845 Handle(Geom_Surface) surf = surface;
846 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
847 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
849 return applyIn2D( surf, p1, p2, & AverageUV );
852 //=======================================================================
853 //function : GetCenterUV
854 //purpose : Return UV for the central node of a biquadratic triangle
855 //=======================================================================
857 gp_XY SMESH_MesherHelper::GetCenterUV(const gp_XY& uv1,
863 bool * isBadTria/*=0*/)
866 gp_XY uvAvg = ( uv12 + uv23 + uv31 ) / 3.;
868 if (( badTria = (( uvAvg - uv1 ) * ( uvAvg - uv23 ) > 0 )))
869 uvAvg = ( uv1 + uv23 ) / 2.;
870 else if (( badTria = (( uvAvg - uv2 ) * ( uvAvg - uv31 ) > 0 )))
871 uvAvg = ( uv2 + uv31 ) / 2.;
872 else if (( badTria = (( uvAvg - uv3 ) * ( uvAvg - uv12 ) > 0 )))
873 uvAvg = ( uv3 + uv12 ) / 2.;
876 *isBadTria = badTria;
880 //=======================================================================
881 //function : GetNodeU
882 //purpose : Return node U on edge
883 //=======================================================================
885 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
886 const SMDS_MeshNode* n,
887 const SMDS_MeshNode* inEdgeNode,
890 double param = Precision::Infinite();
892 const SMDS_PositionPtr pos = n->GetPosition();
893 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
895 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
896 param = epos->GetUParameter();
898 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
900 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
903 BRep_Tool::Range( E, f,l );
904 double uInEdge = GetNodeU( E, inEdgeNode );
905 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
909 SMESHDS_Mesh * meshDS = GetMeshDS();
910 int vertexID = n->getshapeId();
911 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
912 param = BRep_Tool::Parameter( V, E );
917 double tol = BRep_Tool::Tolerance( E );
918 double f,l; BRep_Tool::Range( E, f,l );
919 bool force = ( param < f-tol || param > l+tol );
920 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
921 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
923 *check = CheckNodeU( E, n, param, 2*tol, force );
928 //=======================================================================
929 //function : CheckNodeU
930 //purpose : Check and fix node U on an edge
931 // Return false if U is bad and could not be fixed
932 //=======================================================================
934 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
935 const SMDS_MeshNode* n,
939 double distXYZ[4]) const
941 int shapeID = n->getshapeId();
942 bool infinit = Precision::IsInfinite( u );
943 bool zero = ( u == 0. );
944 if ( force || infinit || zero || toCheckPosOnShape( shapeID ))
946 TopLoc_Location loc; double f,l;
947 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
948 if ( curve.IsNull() ) // degenerated edge
950 if ( u+tol < f || u-tol > l )
952 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
958 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
959 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
964 curvPnt = curve->Value( u );
965 dist = nodePnt.Distance( curvPnt );
967 curvPnt.Transform( loc );
969 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
974 setPosOnShapeValidity( shapeID, false );
975 // u incorrect, project the node to the curve
976 int edgeID = GetMeshDS()->ShapeToIndex( E );
977 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
978 TID2ProjectorOnCurve::iterator i_proj =
979 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
980 if ( !i_proj->second )
982 i_proj->second = new GeomAPI_ProjectPointOnCurve();
983 i_proj->second->Init( curve, f, l );
985 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
986 projector->Perform( nodePnt );
987 if ( projector->NbPoints() < 1 )
989 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
992 Quantity_Parameter U = projector->LowerDistanceParameter();
994 MESSAGE(" f " << f << " l " << l << " u " << u);
995 curvPnt = curve->Value( u );
996 dist = nodePnt.Distance( curvPnt );
998 curvPnt.Transform( loc );
1000 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
1004 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
1005 MESSAGE("distance " << dist << " " << tol );
1008 // store the fixed U on the edge
1009 if ( myShape.IsSame(E) && shapeID == myShapeID && myFixNodeParameters )
1010 const_cast<SMDS_MeshNode*>(n)->SetPosition
1011 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
1013 else if ( fabs( u ) > numeric_limits<double>::min() )
1015 setPosOnShapeValidity( shapeID, true );
1017 if (( u < f-tol || u > l+tol ) && force )
1019 MESSAGE("u < f-tol || u > l+tol ; u " << u << " f " << f << " l " << l);
1020 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
1023 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
1024 double period = curve->Period();
1025 u = ( u < f ) ? u + period : u - period;
1027 catch (Standard_Failure& exc)
1037 //=======================================================================
1038 //function : GetMediumPos
1039 //purpose : Return index and type of the shape (EDGE or FACE only) to
1040 // set a medium node on
1041 //param : useCurSubShape - if true, returns the shape set via SetSubShape()
1043 //=======================================================================
1045 std::pair<int, TopAbs_ShapeEnum>
1046 SMESH_MesherHelper::GetMediumPos(const SMDS_MeshNode* n1,
1047 const SMDS_MeshNode* n2,
1048 const bool useCurSubShape)
1050 if ( useCurSubShape && !myShape.IsNull() )
1051 return std::make_pair( myShapeID, myShape.ShapeType() );
1053 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1057 if (( myShapeID == n1->getshapeId() || myShapeID == n2->getshapeId() ) && myShapeID > 0 )
1059 shapeType = myShape.ShapeType();
1060 shapeID = myShapeID;
1062 else if ( n1->getshapeId() == n2->getshapeId() )
1064 shapeID = n2->getshapeId();
1065 shape = GetSubShapeByNode( n1, GetMeshDS() );
1069 const SMDS_TypeOfPosition Pos1 = n1->GetPosition()->GetTypeOfPosition();
1070 const SMDS_TypeOfPosition Pos2 = n2->GetPosition()->GetTypeOfPosition();
1072 if ( Pos1 == SMDS_TOP_3DSPACE || Pos2 == SMDS_TOP_3DSPACE )
1075 else if ( Pos1 == SMDS_TOP_FACE || Pos2 == SMDS_TOP_FACE )
1077 if ( Pos1 != SMDS_TOP_FACE || Pos2 != SMDS_TOP_FACE )
1079 if ( Pos1 != SMDS_TOP_FACE ) std::swap( n1,n2 );
1080 TopoDS_Shape F = GetSubShapeByNode( n1, GetMeshDS() );
1081 TopoDS_Shape S = GetSubShapeByNode( n2, GetMeshDS() );
1082 if ( IsSubShape( S, F ))
1084 shapeType = TopAbs_FACE;
1085 shapeID = n1->getshapeId();
1089 else if ( Pos1 == SMDS_TOP_EDGE && Pos2 == SMDS_TOP_EDGE )
1091 TopoDS_Shape E1 = GetSubShapeByNode( n1, GetMeshDS() );
1092 TopoDS_Shape E2 = GetSubShapeByNode( n2, GetMeshDS() );
1093 shape = GetCommonAncestor( E1, E2, *myMesh, TopAbs_FACE );
1095 else if ( Pos1 == SMDS_TOP_VERTEX && Pos2 == SMDS_TOP_VERTEX )
1097 TopoDS_Shape V1 = GetSubShapeByNode( n1, GetMeshDS() );
1098 TopoDS_Shape V2 = GetSubShapeByNode( n2, GetMeshDS() );
1099 shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_EDGE );
1100 if ( shape.IsNull() ) shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_FACE );
1102 else // VERTEX and EDGE
1104 if ( Pos1 != SMDS_TOP_VERTEX ) std::swap( n1,n2 );
1105 TopoDS_Shape V = GetSubShapeByNode( n1, GetMeshDS() );
1106 TopoDS_Shape E = GetSubShapeByNode( n2, GetMeshDS() );
1107 if ( IsSubShape( V, E ))
1110 shape = GetCommonAncestor( V, E, *myMesh, TopAbs_FACE );
1114 if ( !shape.IsNull() )
1117 shapeID = GetMeshDS()->ShapeToIndex( shape );
1118 shapeType = shape.ShapeType();
1120 return make_pair( shapeID, shapeType );
1123 //=======================================================================
1124 //function : GetCentralNode
1125 //purpose : Return existing or create a new central node for a quardilateral
1126 // quadratic face given its 8 nodes.
1127 //@param : force3d - true means node creation in between the given nodes,
1128 // else node position is found on a geometrical face if any.
1129 //=======================================================================
1131 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1132 const SMDS_MeshNode* n2,
1133 const SMDS_MeshNode* n3,
1134 const SMDS_MeshNode* n4,
1135 const SMDS_MeshNode* n12,
1136 const SMDS_MeshNode* n23,
1137 const SMDS_MeshNode* n34,
1138 const SMDS_MeshNode* n41,
1141 SMDS_MeshNode *centralNode = 0; // central node to return
1143 // Find an existing central node
1145 TBiQuad keyOfMap(n1,n2,n3,n4);
1146 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1147 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1148 if ( itMapCentralNode != myMapWithCentralNode.end() )
1150 return (*itMapCentralNode).second;
1153 // Get type of shape for the new central node
1155 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1159 TopTools_ListIteratorOfListOfShape it;
1161 std::map< int, int > faceId2nbNodes;
1162 std::map< int, int > ::iterator itMapWithIdFace;
1164 SMESHDS_Mesh* meshDS = GetMeshDS();
1166 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1167 // on sub-shapes of the FACE
1168 if ( GetMesh()->HasShapeToMesh() )
1170 const SMDS_MeshNode* nodes[] = { n1, n2, n3, n4 };
1171 for(int i = 0; i < 4; i++)
1173 shape = GetSubShapeByNode( nodes[i], meshDS );
1174 if ( shape.IsNull() ) break;
1175 if ( shape.ShapeType() == TopAbs_SOLID )
1177 solidID = nodes[i]->getshapeId();
1178 shapeType = TopAbs_SOLID;
1181 if ( shape.ShapeType() == TopAbs_FACE )
1183 faceID = nodes[i]->getshapeId();
1184 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1185 itMapWithIdFace->second++;
1189 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1190 while ( const TopoDS_Shape* face = it->next() )
1192 faceID = meshDS->ShapeToIndex( *face );
1193 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1194 itMapWithIdFace->second++;
1199 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1201 // find ID of the FACE the four corner nodes belong to
1202 itMapWithIdFace = faceId2nbNodes.begin();
1203 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1205 if ( itMapWithIdFace->second == 4 )
1207 shapeType = TopAbs_FACE;
1208 faceID = (*itMapWithIdFace).first;
1215 if ( shapeType == TopAbs_FACE )
1217 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1224 bool toCheck = true;
1225 if ( !F.IsNull() && !force3d )
1227 uvAvg = calcTFI (0.5, 0.5,
1228 GetNodeUV(F,n1,n3,&toCheck), GetNodeUV(F,n2,n4,&toCheck),
1229 GetNodeUV(F,n3,n1,&toCheck), GetNodeUV(F,n4,n2,&toCheck),
1230 GetNodeUV(F,n12,n3), GetNodeUV(F,n23,n4),
1231 GetNodeUV(F,n34,n2), GetNodeUV(F,n41,n2));
1232 TopLoc_Location loc;
1233 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1234 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1235 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1236 // if ( mySetElemOnShape ) node is not elem!
1237 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1239 else // ( force3d || F.IsNull() )
1241 P = calcTFI (0.5, 0.5,
1242 SMESH_TNodeXYZ(n1), SMESH_TNodeXYZ(n2),
1243 SMESH_TNodeXYZ(n3), SMESH_TNodeXYZ(n4),
1244 SMESH_TNodeXYZ(n12), SMESH_TNodeXYZ(n23),
1245 SMESH_TNodeXYZ(n34), SMESH_TNodeXYZ(n41));
1246 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1248 if ( !F.IsNull() ) // force3d
1250 uvAvg = (GetNodeUV(F,n1,n3,&toCheck) +
1251 GetNodeUV(F,n2,n4,&toCheck) +
1252 GetNodeUV(F,n3,n1,&toCheck) +
1253 GetNodeUV(F,n4,n2,&toCheck)) / 4;
1254 //CheckNodeUV( F, centralNode, uvAvg, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1255 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1257 else if ( solidID > 0 )
1259 meshDS->SetNodeInVolume( centralNode, solidID );
1261 else if ( myShapeID > 0 && mySetElemOnShape )
1263 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1266 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1270 //=======================================================================
1271 //function : GetCentralNode
1272 //purpose : Return existing or create a new central node for a
1273 // quadratic triangle given its 6 nodes.
1274 //@param : force3d - true means node creation in between the given nodes,
1275 // else node position is found on a geometrical face if any.
1276 //=======================================================================
1278 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1279 const SMDS_MeshNode* n2,
1280 const SMDS_MeshNode* n3,
1281 const SMDS_MeshNode* n12,
1282 const SMDS_MeshNode* n23,
1283 const SMDS_MeshNode* n31,
1286 SMDS_MeshNode *centralNode = 0; // central node to return
1288 // Find an existing central node
1290 TBiQuad keyOfMap(n1,n2,n3);
1291 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1292 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1293 if ( itMapCentralNode != myMapWithCentralNode.end() )
1295 return (*itMapCentralNode).second;
1298 // Get type of shape for the new central node
1300 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1304 TopTools_ListIteratorOfListOfShape it;
1306 std::map< int, int > faceId2nbNodes;
1307 std::map< int, int > ::iterator itMapWithIdFace;
1309 SMESHDS_Mesh* meshDS = GetMeshDS();
1311 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1312 // on sub-shapes of the FACE
1313 if ( GetMesh()->HasShapeToMesh() )
1315 const SMDS_MeshNode* nodes[] = { n1, n2, n3 };
1316 for(int i = 0; i < 3; i++)
1318 shape = GetSubShapeByNode( nodes[i], meshDS );
1319 if ( shape.IsNull() ) break;
1320 if ( shape.ShapeType() == TopAbs_SOLID )
1322 solidID = nodes[i]->getshapeId();
1323 shapeType = TopAbs_SOLID;
1326 if ( shape.ShapeType() == TopAbs_FACE )
1328 faceID = nodes[i]->getshapeId();
1329 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1330 itMapWithIdFace->second++;
1334 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1335 while ( const TopoDS_Shape* face = it->next() )
1337 faceID = meshDS->ShapeToIndex( *face );
1338 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1339 itMapWithIdFace->second++;
1344 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1346 // find ID of the FACE the four corner nodes belong to
1347 itMapWithIdFace = faceId2nbNodes.begin();
1348 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1350 if ( itMapWithIdFace->second == 3 )
1352 shapeType = TopAbs_FACE;
1353 faceID = (*itMapWithIdFace).first;
1363 if ( shapeType == TopAbs_FACE )
1365 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1367 gp_XY uv1 = GetNodeUV( F, n1, n23, &check );
1368 gp_XY uv2 = GetNodeUV( F, n2, n31, &check );
1369 gp_XY uv3 = GetNodeUV( F, n3, n12, &check );
1370 gp_XY uv12 = GetNodeUV( F, n12, n3, &check );
1371 gp_XY uv23 = GetNodeUV( F, n23, n1, &check );
1372 gp_XY uv31 = GetNodeUV( F, n31, n2, &check );
1373 uvAvg = GetCenterUV( uv1,uv2,uv3, uv12,uv23,uv31, &badTria );
1378 // Create a central node
1381 if ( !F.IsNull() && !force3d )
1383 TopLoc_Location loc;
1384 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1385 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1386 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1387 // if ( mySetElemOnShape ) node is not elem!
1388 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1390 else // ( force3d || F.IsNull() )
1392 P = ( SMESH_TNodeXYZ( n12 ) +
1393 SMESH_TNodeXYZ( n23 ) +
1394 SMESH_TNodeXYZ( n31 ) ) / 3;
1395 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1397 if ( !F.IsNull() ) // force3d
1399 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1401 else if ( solidID > 0 )
1403 meshDS->SetNodeInVolume( centralNode, solidID );
1405 else if ( myShapeID > 0 && mySetElemOnShape )
1407 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1410 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1414 //=======================================================================
1415 //function : GetMediumNode
1416 //purpose : Return existing or create a new medium node between given ones
1417 //=======================================================================
1419 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
1420 const SMDS_MeshNode* n2,
1423 // Find existing node
1425 SMESH_TLink link(n1,n2);
1426 ItTLinkNode itLN = myTLinkNodeMap.find( link );
1427 if ( itLN != myTLinkNodeMap.end() ) {
1428 return (*itLN).second;
1431 // Create medium node
1434 SMESHDS_Mesh* meshDS = GetMeshDS();
1436 if ( IsSeamShape( n1->getshapeId() ))
1437 // to get a correct UV of a node on seam, the second node must have checked UV
1438 std::swap( n1, n2 );
1440 // get type of shape for the new medium node
1441 int faceID = -1, edgeID = -1;
1442 TopoDS_Edge E; double u [2];
1443 TopoDS_Face F; gp_XY uv[2];
1444 bool uvOK[2] = { false, false };
1446 pair<int, TopAbs_ShapeEnum> pos = GetMediumPos( n1, n2, mySetElemOnShape );
1447 // calling GetMediumPos() with useCurSubShape=mySetElemOnShape is OK only for the
1448 // case where the lower dim mesh is already constructed, else, nodes on EDGEs are
1449 // assigned to FACE, for example.
1451 // get positions of the given nodes on shapes
1452 if ( pos.second == TopAbs_FACE )
1454 F = TopoDS::Face(meshDS->IndexToShape( faceID = pos.first ));
1455 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
1456 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
1458 else if ( pos.second == TopAbs_EDGE )
1460 const SMDS_PositionPtr Pos1 = n1->GetPosition();
1461 const SMDS_PositionPtr Pos2 = n2->GetPosition();
1462 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1463 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1464 n1->getshapeId() != n2->getshapeId() )
1467 return getMediumNodeOnComposedWire(n1,n2,force3d);
1469 E = TopoDS::Edge(meshDS->IndexToShape( edgeID = pos.first ));
1471 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
1472 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
1474 catch ( Standard_Failure& f )
1476 // issue 22502 / a node is on VERTEX not belonging to E
1477 // issue 22568 / both nodes are on non-connected VERTEXes
1478 return getMediumNodeOnComposedWire(n1,n2,force3d);
1482 if ( !force3d & uvOK[0] && uvOK[1] )
1484 // we try to create medium node using UV parameters of
1485 // nodes, else - medium between corresponding 3d points
1488 //if ( uvOK[0] && uvOK[1] )
1490 if ( IsDegenShape( n1->getshapeId() )) {
1491 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
1492 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
1494 else if ( IsDegenShape( n2->getshapeId() )) {
1495 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
1496 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
1498 TopLoc_Location loc;
1499 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
1500 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
1501 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
1502 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1503 // if ( mySetElemOnShape ) node is not elem!
1504 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
1505 myTLinkNodeMap.insert(make_pair(link,n12));
1509 else if ( !E.IsNull() )
1512 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1515 Standard_Boolean isPeriodic = C->IsPeriodic();
1518 Standard_Real Period = C->Period();
1519 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1520 Standard_Real pmid = (u[0]+p)/2.;
1521 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1526 gp_Pnt P = C->Value( U );
1527 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1528 //if ( mySetElemOnShape ) node is not elem!
1529 meshDS->SetNodeOnEdge(n12, edgeID, U);
1530 myTLinkNodeMap.insert(make_pair(link,n12));
1537 double x = ( n1->X() + n2->X() )/2.;
1538 double y = ( n1->Y() + n2->Y() )/2.;
1539 double z = ( n1->Z() + n2->Z() )/2.;
1540 n12 = meshDS->AddNode(x,y,z);
1542 //if ( mySetElemOnShape ) node is not elem!
1546 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1547 CheckNodeUV( F, n12, UV, 2 * BRep_Tool::Tolerance( F ), /*force=*/true);
1548 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1550 else if ( !E.IsNull() )
1552 double U = ( u[0] + u[1] ) / 2.;
1553 CheckNodeU( E, n12, U, 2 * BRep_Tool::Tolerance( E ), /*force=*/true);
1554 meshDS->SetNodeOnEdge(n12, edgeID, U);
1556 else if ( myShapeID > 0 && mySetElemOnShape )
1558 meshDS->SetMeshElementOnShape(n12, myShapeID);
1562 myTLinkNodeMap.insert( make_pair( link, n12 ));
1566 //================================================================================
1568 * \brief Makes a medium node if nodes reside different edges
1570 //================================================================================
1572 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1573 const SMDS_MeshNode* n2,
1576 SMESH_TNodeXYZ p1( n1 ), p2( n2 );
1577 gp_Pnt middle = 0.5 * p1 + 0.5 * p2;
1578 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1580 // To find position on edge and 3D position for n12,
1581 // project <middle> to 2 edges and select projection most close to <middle>
1583 TopoDS_Edge bestEdge;
1584 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4], f,l;
1586 // get shapes under the nodes
1587 TopoDS_Shape shape[2];
1589 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1591 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1592 TopoDS_Shape S = GetSubShapeByNode( n, GetMeshDS() );
1594 shape[ nbShapes++ ] = S;
1597 vector< TopoDS_Shape > edges;
1598 for ( int iS = 0; iS < nbShapes; ++iS )
1600 switch ( shape[iS].ShapeType() ) {
1603 edges.push_back( shape[iS] );
1609 if ( nbShapes == 2 && iS==0 && shape[1-iS].ShapeType() == TopAbs_VERTEX )
1610 edge = GetCommonAncestor( shape[iS], shape[1-iS], *myMesh, TopAbs_EDGE );
1612 if ( edge.IsNull() )
1614 PShapeIteratorPtr eIt = GetAncestors( shape[iS], *myMesh, TopAbs_EDGE );
1615 while( const TopoDS_Shape* e = eIt->next() )
1616 edges.push_back( *e );
1622 if ( nbShapes == 1 || shape[1-iS].ShapeType() < TopAbs_EDGE )
1623 for ( TopExp_Explorer e( shape[iS], TopAbs_EDGE ); e.More(); e.Next() )
1624 edges.push_back( e.Current() );
1631 // project to get U of projection and distance from middle to projection
1632 for ( size_t iE = 0; iE < edges.size(); ++iE )
1634 const TopoDS_Edge& edge = TopoDS::Edge( edges[ iE ]);
1635 distXYZ[0] = distMiddleProj;
1637 CheckNodeU( edge, n12, testU, 2 * BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1638 if ( distXYZ[0] < distMiddleProj )
1640 distMiddleProj = distXYZ[0];
1646 // // both projections failed; set n12 on the edge of n1 with U of a common vertex
1647 // TopoDS_Vertex vCommon;
1648 // if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1649 // u = BRep_Tool::Parameter( vCommon, edges[0] );
1652 // double f,l, u0 = GetNodeU( edges[0], n1 );
1653 // BRep_Tool::Range( edges[0],f,l );
1654 // u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1657 // distMiddleProj = 0;
1660 if ( !bestEdge.IsNull() )
1662 // move n12 to position of a successfull projection
1663 //double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1664 if ( !force3d /*&& distMiddleProj > 2*tol*/ )
1666 TopLoc_Location loc;
1667 Handle(Geom_Curve) curve = BRep_Tool::Curve( bestEdge,loc,f,l );
1668 gp_Pnt p = curve->Value( u ).Transformed( loc );
1669 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1671 //if ( mySetElemOnShape ) node is not elem!
1673 int edgeID = GetMeshDS()->ShapeToIndex( bestEdge );
1674 if ( edgeID != n12->getshapeId() )
1675 GetMeshDS()->UnSetNodeOnShape( n12 );
1676 GetMeshDS()->SetNodeOnEdge(n12, edgeID, u);
1679 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1684 //=======================================================================
1685 //function : AddNode
1686 //purpose : Creates a node
1687 //=======================================================================
1689 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID,
1692 SMESHDS_Mesh * meshDS = GetMeshDS();
1693 SMDS_MeshNode* node = 0;
1695 node = meshDS->AddNodeWithID( x, y, z, ID );
1697 node = meshDS->AddNode( x, y, z );
1698 if ( mySetElemOnShape && myShapeID > 0 ) { // node is not elem ?
1699 switch ( myShape.ShapeType() ) {
1700 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1701 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1702 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID, u, v); break;
1703 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID, u); break;
1704 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1711 //=======================================================================
1712 //function : AddEdge
1713 //purpose : Creates quadratic or linear edge
1714 //=======================================================================
1716 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1717 const SMDS_MeshNode* n2,
1721 SMESHDS_Mesh * meshDS = GetMeshDS();
1723 SMDS_MeshEdge* edge = 0;
1724 if (myCreateQuadratic) {
1725 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1727 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1729 edge = meshDS->AddEdge(n1, n2, n12);
1733 edge = meshDS->AddEdgeWithID(n1, n2, id);
1735 edge = meshDS->AddEdge(n1, n2);
1738 if ( mySetElemOnShape && myShapeID > 0 )
1739 meshDS->SetMeshElementOnShape( edge, myShapeID );
1744 //=======================================================================
1745 //function : AddFace
1746 //purpose : Creates quadratic or linear triangle
1747 //=======================================================================
1749 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1750 const SMDS_MeshNode* n2,
1751 const SMDS_MeshNode* n3,
1755 SMESHDS_Mesh * meshDS = GetMeshDS();
1756 SMDS_MeshFace* elem = 0;
1758 if( n1==n2 || n2==n3 || n3==n1 )
1761 if(!myCreateQuadratic) {
1763 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1765 elem = meshDS->AddFace(n1, n2, n3);
1768 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1769 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1770 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1771 if(myCreateBiQuadratic)
1773 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n12, n23, n31, force3d);
1775 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, nCenter, id);
1777 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31, nCenter);
1782 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1784 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1787 if ( mySetElemOnShape && myShapeID > 0 )
1788 meshDS->SetMeshElementOnShape( elem, myShapeID );
1793 //=======================================================================
1794 //function : AddFace
1795 //purpose : Creates bi-quadratic, quadratic or linear quadrangle
1796 //=======================================================================
1798 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1799 const SMDS_MeshNode* n2,
1800 const SMDS_MeshNode* n3,
1801 const SMDS_MeshNode* n4,
1805 SMESHDS_Mesh * meshDS = GetMeshDS();
1806 SMDS_MeshFace* elem = 0;
1809 return AddFace(n1,n3,n4,id,force3d);
1812 return AddFace(n1,n2,n4,id,force3d);
1815 return AddFace(n1,n2,n3,id,force3d);
1818 return AddFace(n1,n2,n4,id,force3d);
1821 return AddFace(n1,n2,n3,id,force3d);
1824 return AddFace(n1,n2,n3,id,force3d);
1827 if(!myCreateQuadratic) {
1829 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1831 elem = meshDS->AddFace(n1, n2, n3, n4);
1834 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1835 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1836 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1837 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1838 if(myCreateBiQuadratic)
1840 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n4, n12, n23, n34, n41, force3d);
1842 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, nCenter, id);
1844 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41, nCenter);
1849 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1851 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1854 if ( mySetElemOnShape && myShapeID > 0 )
1855 meshDS->SetMeshElementOnShape( elem, myShapeID );
1860 //=======================================================================
1861 //function : AddPolygonalFace
1862 //purpose : Creates polygon, with additional nodes in quadratic mesh
1863 //=======================================================================
1865 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1869 SMESHDS_Mesh * meshDS = GetMeshDS();
1870 SMDS_MeshFace* elem = 0;
1872 if(!myCreateQuadratic) {
1874 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1876 elem = meshDS->AddPolygonalFace(nodes);
1879 vector<const SMDS_MeshNode*> newNodes;
1880 for ( int i = 0; i < nodes.size(); ++i )
1882 const SMDS_MeshNode* n1 = nodes[i];
1883 const SMDS_MeshNode* n2 = nodes[(i+1)%nodes.size()];
1884 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1885 newNodes.push_back( n1 );
1886 newNodes.push_back( n12 );
1889 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1891 elem = meshDS->AddPolygonalFace(newNodes);
1893 if ( mySetElemOnShape && myShapeID > 0 )
1894 meshDS->SetMeshElementOnShape( elem, myShapeID );
1899 //=======================================================================
1900 //function : AddVolume
1901 //purpose : Creates quadratic or linear prism
1902 //=======================================================================
1904 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1905 const SMDS_MeshNode* n2,
1906 const SMDS_MeshNode* n3,
1907 const SMDS_MeshNode* n4,
1908 const SMDS_MeshNode* n5,
1909 const SMDS_MeshNode* n6,
1913 SMESHDS_Mesh * meshDS = GetMeshDS();
1914 SMDS_MeshVolume* elem = 0;
1915 if(!myCreateQuadratic) {
1917 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1919 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1922 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1923 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1924 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1926 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1927 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1928 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1930 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1931 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1932 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1935 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1936 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1938 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1939 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1941 if ( mySetElemOnShape && myShapeID > 0 )
1942 meshDS->SetMeshElementOnShape( elem, myShapeID );
1947 //=======================================================================
1948 //function : AddVolume
1949 //purpose : Creates quadratic or linear tetrahedron
1950 //=======================================================================
1952 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1953 const SMDS_MeshNode* n2,
1954 const SMDS_MeshNode* n3,
1955 const SMDS_MeshNode* n4,
1959 SMESHDS_Mesh * meshDS = GetMeshDS();
1960 SMDS_MeshVolume* elem = 0;
1961 if(!myCreateQuadratic) {
1963 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1965 elem = meshDS->AddVolume(n1, n2, n3, n4);
1968 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1969 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1970 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1972 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1973 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1974 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1977 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1979 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1981 if ( mySetElemOnShape && myShapeID > 0 )
1982 meshDS->SetMeshElementOnShape( elem, myShapeID );
1987 //=======================================================================
1988 //function : AddVolume
1989 //purpose : Creates quadratic or linear pyramid
1990 //=======================================================================
1992 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1993 const SMDS_MeshNode* n2,
1994 const SMDS_MeshNode* n3,
1995 const SMDS_MeshNode* n4,
1996 const SMDS_MeshNode* n5,
2000 SMDS_MeshVolume* elem = 0;
2001 if(!myCreateQuadratic) {
2003 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
2005 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
2008 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2009 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
2010 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
2011 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
2013 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
2014 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
2015 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
2016 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
2019 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
2024 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
2026 n15, n25, n35, n45);
2028 if ( mySetElemOnShape && myShapeID > 0 )
2029 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
2034 //=======================================================================
2035 //function : AddVolume
2036 //purpose : Creates bi-quadratic, quadratic or linear hexahedron
2037 //=======================================================================
2039 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2040 const SMDS_MeshNode* n2,
2041 const SMDS_MeshNode* n3,
2042 const SMDS_MeshNode* n4,
2043 const SMDS_MeshNode* n5,
2044 const SMDS_MeshNode* n6,
2045 const SMDS_MeshNode* n7,
2046 const SMDS_MeshNode* n8,
2050 SMESHDS_Mesh * meshDS = GetMeshDS();
2051 SMDS_MeshVolume* elem = 0;
2052 if(!myCreateQuadratic) {
2054 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
2056 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
2059 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2060 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
2061 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
2062 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
2064 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
2065 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
2066 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
2067 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
2069 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
2070 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
2071 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
2072 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
2073 if(myCreateBiQuadratic)
2075 const SMDS_MeshNode* n1234 = GetCentralNode(n1,n2,n3,n4,n12,n23,n34,n41,force3d);
2076 const SMDS_MeshNode* n1256 = GetCentralNode(n1,n2,n5,n6,n12,n26,n56,n15,force3d);
2077 const SMDS_MeshNode* n2367 = GetCentralNode(n2,n3,n6,n7,n23,n37,n67,n26,force3d);
2078 const SMDS_MeshNode* n3478 = GetCentralNode(n3,n4,n7,n8,n34,n48,n78,n37,force3d);
2079 const SMDS_MeshNode* n1458 = GetCentralNode(n1,n4,n5,n8,n41,n48,n15,n85,force3d);
2080 const SMDS_MeshNode* n5678 = GetCentralNode(n5,n6,n7,n8,n56,n67,n78,n85,force3d);
2082 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
2084 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( n4 );
2085 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( n8 );
2086 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( n3 );
2087 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( n7 );
2088 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( n1 );
2089 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( n5 );
2090 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( n2 );
2091 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( n6 );
2093 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( n48 );
2094 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( n37 );
2095 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( n15 );
2096 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( n26 );
2097 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( n34 );
2098 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( n78 );
2099 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( n12 );
2100 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( n56 );
2101 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( n41 );
2102 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( n85 );
2103 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( n23 );
2104 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( n67 );
2106 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( n3478 );
2107 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( n1256 );
2108 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( n1458 );
2109 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( n2367 );
2110 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( n1234 );
2111 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( n5678 );
2113 gp_XYZ centerCube(0.5, 0.5, 0.5);
2115 SMESH_Block::ShellPoint( centerCube, pointsOnShapes, nCenterElem );
2116 const SMDS_MeshNode* nCenter =
2117 meshDS->AddNode( nCenterElem.X(), nCenterElem.Y(), nCenterElem.Z() );
2118 meshDS->SetNodeInVolume( nCenter, myShapeID );
2121 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2122 n12, n23, n34, n41, n56, n67,
2123 n78, n85, n15, n26, n37, n48,
2124 n1234, n1256, n2367, n3478, n1458, n5678, nCenter, id);
2126 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2127 n12, n23, n34, n41, n56, n67,
2128 n78, n85, n15, n26, n37, n48,
2129 n1234, n1256, n2367, n3478, n1458, n5678, nCenter);
2134 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2135 n12, n23, n34, n41, n56, n67,
2136 n78, n85, n15, n26, n37, n48, id);
2138 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2139 n12, n23, n34, n41, n56, n67,
2140 n78, n85, n15, n26, n37, n48);
2143 if ( mySetElemOnShape && myShapeID > 0 )
2144 meshDS->SetMeshElementOnShape( elem, myShapeID );
2149 //=======================================================================
2150 //function : AddVolume
2151 //purpose : Creates LINEAR!!!!!!!!! octahedron
2152 //=======================================================================
2154 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2155 const SMDS_MeshNode* n2,
2156 const SMDS_MeshNode* n3,
2157 const SMDS_MeshNode* n4,
2158 const SMDS_MeshNode* n5,
2159 const SMDS_MeshNode* n6,
2160 const SMDS_MeshNode* n7,
2161 const SMDS_MeshNode* n8,
2162 const SMDS_MeshNode* n9,
2163 const SMDS_MeshNode* n10,
2164 const SMDS_MeshNode* n11,
2165 const SMDS_MeshNode* n12,
2169 SMESHDS_Mesh * meshDS = GetMeshDS();
2170 SMDS_MeshVolume* elem = 0;
2172 elem = meshDS->AddVolumeWithID(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12,id);
2174 elem = meshDS->AddVolume(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12);
2175 if ( mySetElemOnShape && myShapeID > 0 )
2176 meshDS->SetMeshElementOnShape( elem, myShapeID );
2180 //=======================================================================
2181 //function : AddPolyhedralVolume
2182 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
2183 //=======================================================================
2186 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
2187 const std::vector<int>& quantities,
2191 SMESHDS_Mesh * meshDS = GetMeshDS();
2192 SMDS_MeshVolume* elem = 0;
2193 if(!myCreateQuadratic)
2196 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
2198 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
2202 vector<const SMDS_MeshNode*> newNodes;
2203 vector<int> newQuantities;
2204 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
2206 int nbNodesInFace = quantities[iFace];
2207 newQuantities.push_back(0);
2208 for ( int i = 0; i < nbNodesInFace; ++i )
2210 const SMDS_MeshNode* n1 = nodes[ iN + i ];
2211 newNodes.push_back( n1 );
2212 newQuantities.back()++;
2214 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
2215 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
2216 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
2218 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2219 newNodes.push_back( n12 );
2220 newQuantities.back()++;
2223 iN += nbNodesInFace;
2226 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
2228 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
2230 if ( mySetElemOnShape && myShapeID > 0 )
2231 meshDS->SetMeshElementOnShape( elem, myShapeID );
2238 //================================================================================
2240 * \brief Check if a node belongs to any face of sub-mesh
2242 //================================================================================
2244 bool isNodeInSubMesh( const SMDS_MeshNode* n, const SMESHDS_SubMesh* sm )
2246 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2247 while ( fIt->more() )
2248 if ( sm->Contains( fIt->next() ))
2254 //=======================================================================
2255 //function : IsSameElemGeometry
2256 //purpose : Returns true if all elements of a sub-mesh are of same shape
2257 //=======================================================================
2259 bool SMESH_MesherHelper::IsSameElemGeometry(const SMESHDS_SubMesh* smDS,
2260 SMDSAbs_GeometryType shape,
2261 const bool nullSubMeshRes)
2263 if ( !smDS ) return nullSubMeshRes;
2265 SMDS_ElemIteratorPtr elemIt = smDS->GetElements();
2266 while ( elemIt->more() ) {
2267 const SMDS_MeshElement* e = elemIt->next();
2268 if ( e->GetGeomType() != shape )
2274 //=======================================================================
2275 //function : LoadNodeColumns
2276 //purpose : Load nodes bound to face into a map of node columns
2277 //=======================================================================
2279 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2280 const TopoDS_Face& theFace,
2281 const TopoDS_Edge& theBaseEdge,
2282 SMESHDS_Mesh* theMesh,
2283 SMESH_ProxyMesh* theProxyMesh)
2285 return LoadNodeColumns(theParam2ColumnMap,
2287 std::list<TopoDS_Edge>(1,theBaseEdge),
2292 //=======================================================================
2293 //function : LoadNodeColumns
2294 //purpose : Load nodes bound to face into a map of node columns
2295 //=======================================================================
2297 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2298 const TopoDS_Face& theFace,
2299 const std::list<TopoDS_Edge>& theBaseSide,
2300 SMESHDS_Mesh* theMesh,
2301 SMESH_ProxyMesh* theProxyMesh)
2303 // get a right sub-mesh of theFace
2305 const SMESHDS_SubMesh* faceSubMesh = 0;
2308 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
2309 if ( !faceSubMesh ||
2310 faceSubMesh->NbElements() == 0 ||
2311 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
2313 // can use a proxy sub-mesh with not temporary elements only
2319 faceSubMesh = theMesh->MeshElements( theFace );
2320 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
2323 if ( theParam2ColumnMap.empty() )
2325 // get data of edges for normalization of params
2326 vector< double > length;
2328 list<TopoDS_Edge>::const_iterator edge;
2330 for ( edge = theBaseSide.begin(); edge != theBaseSide.end(); ++edge )
2332 double len = std::max( 1e-10, SMESH_Algo::EdgeLength( *edge ));
2334 length.push_back( len );
2338 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
2339 edge = theBaseSide.begin();
2340 for ( int iE = 0; edge != theBaseSide.end(); ++edge, ++iE )
2342 map< double, const SMDS_MeshNode*> sortedBaseNN;
2343 SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN);
2344 if ( sortedBaseNN.empty() ) continue;
2346 map< double, const SMDS_MeshNode*>::iterator u_n = sortedBaseNN.begin();
2347 if ( theProxyMesh ) // from sortedBaseNN remove nodes not shared by faces of faceSubMesh
2349 const SMDS_MeshNode* n1 = (++sortedBaseNN.begin())->second;
2350 const SMDS_MeshNode* n2 = (++sortedBaseNN.rbegin())->second;
2351 bool allNodesAreProxy = ( n1 != theProxyMesh->GetProxyNode( n1 ) &&
2352 n2 != theProxyMesh->GetProxyNode( n2 ));
2353 if ( allNodesAreProxy )
2354 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2355 u_n->second = theProxyMesh->GetProxyNode( u_n->second );
2357 if ( u_n = sortedBaseNN.begin(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2359 while ( ++u_n != sortedBaseNN.end() && !isNodeInSubMesh( u_n->second, faceSubMesh ));
2360 sortedBaseNN.erase( sortedBaseNN.begin(), u_n );
2362 if ( !sortedBaseNN.empty() )
2363 if ( u_n = --sortedBaseNN.end(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2365 while ( u_n != sortedBaseNN.begin() && !isNodeInSubMesh( (--u_n)->second, faceSubMesh ));
2366 sortedBaseNN.erase( ++u_n, sortedBaseNN.end() );
2368 if ( sortedBaseNN.empty() ) continue;
2372 BRep_Tool::Range( *edge, f, l );
2373 if ( edge->Orientation() == TopAbs_REVERSED ) std::swap( f, l );
2374 const double coeff = 1. / ( l - f ) * length[iE] / fullLen;
2375 const double prevPar = theParam2ColumnMap.empty() ? 0 : theParam2ColumnMap.rbegin()->first;
2376 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2378 double par = prevPar + coeff * ( u_n->first - f );
2379 TParam2ColumnMap::iterator u2nn =
2380 theParam2ColumnMap.insert( theParam2ColumnMap.end(), make_pair( par, TNodeColumn()));
2381 u2nn->second.push_back( u_n->second );
2384 if ( theParam2ColumnMap.size() < 2 )
2389 int prevNbRows = theParam2ColumnMap.begin()->second.size(); // current, at least 1 here
2390 int expectedNbRows = faceSubMesh->NbElements() / ( theParam2ColumnMap.size()-1 ); // to be added
2392 // fill theParam2ColumnMap column by column by passing from nodes on
2393 // theBaseEdge up via mesh faces on theFace
2395 TParam2ColumnMap::iterator par_nVec_1, par_nVec_2;
2396 par_nVec_2 = theParam2ColumnMap.begin();
2397 par_nVec_1 = par_nVec_2++;
2398 TIDSortedElemSet emptySet, avoidSet;
2399 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
2401 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
2402 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
2403 nCol1.resize( prevNbRows + expectedNbRows );
2404 nCol2.resize( prevNbRows + expectedNbRows );
2406 int i1, i2, foundNbRows = 0;
2407 const SMDS_MeshNode *n1 = nCol1[ prevNbRows-1 ];
2408 const SMDS_MeshNode *n2 = nCol2[ prevNbRows-1 ];
2409 // find face sharing node n1 and n2 and belonging to faceSubMesh
2410 while ( const SMDS_MeshElement* face =
2411 SMESH_MeshAlgos::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
2413 if ( faceSubMesh->Contains( face ))
2415 int nbNodes = face->NbCornerNodes();
2418 if ( foundNbRows + 1 > expectedNbRows )
2420 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
2421 n2 = face->GetNode( (i1+2) % 4 );
2422 nCol1[ prevNbRows + foundNbRows] = n1;
2423 nCol2[ prevNbRows + foundNbRows] = n2;
2426 avoidSet.insert( face );
2428 if ( foundNbRows != expectedNbRows )
2432 return ( theParam2ColumnMap.size() > 1 &&
2433 theParam2ColumnMap.begin()->second.size() == prevNbRows + expectedNbRows );
2438 //================================================================================
2440 * \brief Return true if a node is at a corner of a 2D structured mesh of FACE
2442 //================================================================================
2444 bool isCornerOfStructure( const SMDS_MeshNode* n,
2445 const SMESHDS_SubMesh* faceSM,
2446 SMESH_MesherHelper& faceAnalyser )
2448 int nbFacesInSM = 0;
2450 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2451 while ( fIt->more() )
2452 nbFacesInSM += faceSM->Contains( fIt->next() );
2454 if ( nbFacesInSM == 1 )
2457 if ( nbFacesInSM == 2 && n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
2459 return faceAnalyser.IsRealSeam( n->getshapeId() );
2465 //=======================================================================
2466 //function : IsStructured
2467 //purpose : Return true if 2D mesh on FACE is a structured rectangle
2468 //=======================================================================
2470 bool SMESH_MesherHelper::IsStructured( SMESH_subMesh* faceSM )
2472 SMESHDS_SubMesh* fSM = faceSM->GetSubMeshDS();
2473 if ( !fSM || fSM->NbElements() == 0 )
2476 list< TopoDS_Edge > edges;
2477 list< int > nbEdgesInWires;
2478 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( faceSM->GetSubShape() ),
2479 edges, nbEdgesInWires );
2480 if ( nbWires != 1 /*|| nbEdgesInWires.front() != 4*/ ) // allow composite sides
2483 // algo: find corners of a structure and then analyze nb of faces and
2484 // length of structure sides
2486 SMESHDS_Mesh* meshDS = faceSM->GetFather()->GetMeshDS();
2487 SMESH_MesherHelper faceAnalyser( *faceSM->GetFather() );
2488 faceAnalyser.SetSubShape( faceSM->GetSubShape() );
2490 // rotate edges to get the first node being at corner
2491 // (in principle it's not necessary but so far none SALOME algo can make
2492 // such a structured mesh that all corner nodes are not on VERTEXes)
2493 bool isCorner = false;
2494 int nbRemainEdges = nbEdgesInWires.front();
2496 TopoDS_Vertex V = IthVertex( 0, edges.front() );
2497 isCorner = isCornerOfStructure( SMESH_Algo::VertexNode( V, meshDS ),
2500 edges.splice( edges.end(), edges, edges.begin() );
2504 while ( !isCorner && nbRemainEdges > 0 );
2509 // get all nodes from EDGEs
2510 list< const SMDS_MeshNode* > nodes;
2511 list< TopoDS_Edge >::iterator edge = edges.begin();
2512 for ( ; edge != edges.end(); ++edge )
2514 map< double, const SMDS_MeshNode* > u2Nodes;
2515 if ( !SMESH_Algo::GetSortedNodesOnEdge( meshDS, *edge,
2516 /*skipMedium=*/true, u2Nodes ))
2519 list< const SMDS_MeshNode* > edgeNodes;
2520 map< double, const SMDS_MeshNode* >::iterator u2n = u2Nodes.begin();
2521 for ( ; u2n != u2Nodes.end(); ++u2n )
2522 edgeNodes.push_back( u2n->second );
2523 if ( edge->Orientation() == TopAbs_REVERSED )
2524 edgeNodes.reverse();
2526 if ( !nodes.empty() && nodes.back() == edgeNodes.front() )
2527 edgeNodes.pop_front();
2528 nodes.splice( nodes.end(), edgeNodes, edgeNodes.begin(), edgeNodes.end() );
2531 // get length of structured sides
2532 vector<int> nbEdgesInSide;
2534 list< const SMDS_MeshNode* >::iterator n = ++nodes.begin();
2535 for ( ; n != nodes.end(); ++n )
2538 if ( isCornerOfStructure( *n, fSM, faceAnalyser )) {
2539 nbEdgesInSide.push_back( nbEdges );
2545 if ( nbEdgesInSide.size() != 4 )
2547 if ( nbEdgesInSide[0] != nbEdgesInSide[2] )
2549 if ( nbEdgesInSide[1] != nbEdgesInSide[3] )
2551 if ( nbEdgesInSide[0] * nbEdgesInSide[1] != fSM->NbElements() )
2557 //=======================================================================
2558 //function : IsDistorted2D
2559 //purpose : Return true if 2D mesh on FACE is ditorted
2560 //=======================================================================
2562 bool SMESH_MesherHelper::IsDistorted2D( SMESH_subMesh* faceSM,
2565 if ( !faceSM || faceSM->GetSubShape().ShapeType() != TopAbs_FACE )
2568 bool haveBadFaces = false;
2570 SMESH_MesherHelper helper( *faceSM->GetFather() );
2571 helper.SetSubShape( faceSM->GetSubShape() );
2573 const TopoDS_Face& F = TopoDS::Face( faceSM->GetSubShape() );
2574 SMESHDS_SubMesh* smDS = helper.GetMeshDS()->MeshElements( F );
2575 if ( !smDS || smDS->NbElements() == 0 ) return false;
2577 SMDS_ElemIteratorPtr faceIt = smDS->GetElements();
2578 double prevArea = 0;
2579 vector< const SMDS_MeshNode* > nodes;
2581 bool* toCheckUV = checkUV ? & checkUV : 0;
2582 while ( faceIt->more() && !haveBadFaces )
2584 const SMDS_MeshElement* face = faceIt->next();
2587 nodes.resize( face->NbCornerNodes() );
2588 SMDS_MeshElement::iterator n = face->begin_nodes();
2589 for ( size_t i = 0; i < nodes.size(); ++n, ++i )
2592 // avoid elems on degenarate shapes as UV on them can be wrong
2593 if ( helper.HasDegeneratedEdges() )
2595 bool isOnDegen = false;
2596 for ( size_t i = 0; ( i < nodes.size() && !isOnDegen ); ++i )
2597 isOnDegen = helper.IsDegenShape( nodes[ i ]->getshapeId() );
2601 // prepare to getting UVs
2602 const SMDS_MeshNode* inFaceNode = 0;
2603 if ( helper.HasSeam() ) {
2604 for ( size_t i = 0; ( i < nodes.size() && !inFaceNode ); ++i )
2605 if ( !helper.IsSeamShape( nodes[ i ]->getshapeId() ))
2606 inFaceNode = nodes[ i ];
2611 uv.resize( nodes.size() );
2612 for ( size_t i = 0; i < nodes.size(); ++i )
2613 uv[ i ] = helper.GetNodeUV( F, nodes[ i ], inFaceNode, toCheckUV );
2615 // compare orientation of triangles
2616 double faceArea = 0;
2617 for ( int iT = 0, nbT = nodes.size()-2; iT < nbT; ++iT )
2619 gp_XY v1 = uv[ iT+1 ] - uv[ 0 ];
2620 gp_XY v2 = uv[ iT+2 ] - uv[ 0 ];
2621 faceArea += v2 ^ v1;
2623 haveBadFaces = ( faceArea * prevArea < 0 );
2624 prevArea = faceArea;
2627 return haveBadFaces;
2630 //================================================================================
2632 * \brief Find out elements orientation on a geometrical face
2633 * \param theFace - The face correctly oriented in the shape being meshed
2634 * \retval bool - true if the face normal and the normal of first element
2635 * in the correspoding submesh point in different directions
2637 //================================================================================
2639 bool SMESH_MesherHelper::IsReversedSubMesh (const TopoDS_Face& theFace)
2641 if ( theFace.IsNull() )
2644 // find out orientation of a meshed face
2645 int faceID = GetMeshDS()->ShapeToIndex( theFace );
2646 TopoDS_Shape aMeshedFace = GetMeshDS()->IndexToShape( faceID );
2647 bool isReversed = ( theFace.Orientation() != aMeshedFace.Orientation() );
2649 const SMESHDS_SubMesh * aSubMeshDSFace = GetMeshDS()->MeshElements( faceID );
2650 if ( !aSubMeshDSFace )
2653 // find an element with a good normal
2655 bool normalOK = false;
2657 SMDS_ElemIteratorPtr iteratorElem = aSubMeshDSFace->GetElements();
2658 while ( !normalOK && iteratorElem->more() ) // loop on elements on theFace
2660 const SMDS_MeshElement* elem = iteratorElem->next();
2661 if ( elem && elem->NbCornerNodes() > 2 )
2663 SMESH_TNodeXYZ nPnt[3];
2664 SMDS_ElemIteratorPtr nodesIt = elem->nodesIterator();
2665 int iNodeOnFace = 0, iPosDim = SMDS_TOP_VERTEX;
2666 for ( int iN = 0; nodesIt->more() && iN < 3; ++iN) // loop on nodes
2668 nPnt[ iN ] = nodesIt->next();
2669 if ( nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition() > iPosDim )
2672 iPosDim = nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition();
2676 gp_Vec v01( nPnt[0], nPnt[1] ), v02( nPnt[0], nPnt[2] );
2677 if ( v01.SquareMagnitude() > RealSmall() &&
2678 v02.SquareMagnitude() > RealSmall() )
2681 if (( normalOK = ( Ne.SquareMagnitude() > RealSmall() )))
2682 uv = GetNodeUV( theFace, nPnt[iNodeOnFace]._node, 0, &normalOK );
2689 // face normal at node position
2690 TopLoc_Location loc;
2691 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
2692 // if ( surf.IsNull() || surf->Continuity() < GeomAbs_C1 )
2693 // some surfaces not detected as GeomAbs_C1 are nevertheless correct for meshing
2694 if ( surf.IsNull() || surf->Continuity() < GeomAbs_C0 )
2697 MESSAGE("surf->Continuity() < GeomAbs_C1 " << (surf->Continuity() < GeomAbs_C1));
2700 gp_Vec d1u, d1v; gp_Pnt p;
2701 surf->D1( uv.X(), uv.Y(), p, d1u, d1v );
2702 gp_Vec Nf = (d1u ^ d1v).Transformed( loc );
2704 if ( theFace.Orientation() == TopAbs_REVERSED )
2707 return Ne * Nf < 0.;
2710 //=======================================================================
2712 //purpose : Count nb of sub-shapes
2713 //=======================================================================
2715 int SMESH_MesherHelper::Count(const TopoDS_Shape& shape,
2716 const TopAbs_ShapeEnum type,
2717 const bool ignoreSame)
2720 TopTools_IndexedMapOfShape map;
2721 TopExp::MapShapes( shape, type, map );
2722 return map.Extent();
2726 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2732 //=======================================================================
2733 //function : NbAncestors
2734 //purpose : Return number of unique ancestors of the shape
2735 //=======================================================================
2737 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
2738 const SMESH_Mesh& mesh,
2739 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
2741 TopTools_MapOfShape ancestors;
2742 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
2743 for ( ; ansIt.More(); ansIt.Next() ) {
2744 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
2745 ancestors.Add( ansIt.Value() );
2747 return ancestors.Extent();
2750 //=======================================================================
2751 //function : GetSubShapeOri
2752 //purpose : Return orientation of sub-shape in the main shape
2753 //=======================================================================
2755 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
2756 const TopoDS_Shape& subShape)
2758 TopAbs_Orientation ori = TopAbs_Orientation(-1);
2759 if ( !shape.IsNull() && !subShape.IsNull() )
2761 TopExp_Explorer e( shape, subShape.ShapeType() );
2762 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
2763 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
2764 for ( ; e.More(); e.Next())
2765 if ( subShape.IsSame( e.Current() ))
2768 ori = e.Current().Orientation();
2773 //=======================================================================
2774 //function : IsSubShape
2776 //=======================================================================
2778 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
2779 const TopoDS_Shape& mainShape )
2781 if ( !shape.IsNull() && !mainShape.IsNull() )
2783 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
2786 if ( shape.IsSame( exp.Current() ))
2789 SCRUTE((shape.IsNull()));
2790 SCRUTE((mainShape.IsNull()));
2794 //=======================================================================
2795 //function : IsSubShape
2797 //=======================================================================
2799 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
2801 if ( shape.IsNull() || !aMesh )
2804 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
2806 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
2809 //=======================================================================
2810 //function : IsBlock
2812 //=======================================================================
2814 bool SMESH_MesherHelper::IsBlock( const TopoDS_Shape& shape )
2816 if ( shape.IsNull() )
2820 TopExp_Explorer exp( shape, TopAbs_SHELL );
2821 if ( !exp.More() ) return false;
2822 shell = TopoDS::Shell( exp.Current() );
2823 if ( exp.Next(), exp.More() ) return false;
2826 TopTools_IndexedMapOfOrientedShape map;
2827 return SMESH_Block::FindBlockShapes( shell, v, v, map );
2831 //================================================================================
2833 * \brief Return maximal tolerance of shape
2835 //================================================================================
2837 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
2839 double tol = Precision::Confusion();
2840 TopExp_Explorer exp;
2841 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
2842 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
2843 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
2844 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
2845 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
2846 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
2851 //================================================================================
2853 * \brief Return an angle between two EDGEs sharing a common VERTEX with reference
2854 * of the FACE normal
2855 * \return double - the angle (between -Pi and Pi), negative if the angle is concave,
2856 * 1e100 in case of failure
2857 * \waring Care about order of the EDGEs and their orientation to be as they are
2858 * within the FACE! Don't pass degenerated EDGEs neither!
2860 //================================================================================
2862 double SMESH_MesherHelper::GetAngle( const TopoDS_Edge & theE1,
2863 const TopoDS_Edge & theE2,
2864 const TopoDS_Face & theFace,
2865 const TopoDS_Vertex & theCommonV,
2866 gp_Vec* theFaceNormal)
2868 double angle = 1e100;
2872 Handle(Geom_Curve) c1 = BRep_Tool::Curve( theE1, f,l );
2873 Handle(Geom_Curve) c2 = BRep_Tool::Curve( theE2, f,l );
2874 Handle(Geom2d_Curve) c2d1 = BRep_Tool::CurveOnSurface( theE1, theFace, f,l );
2875 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace );
2876 double p1 = BRep_Tool::Parameter( theCommonV, theE1 );
2877 double p2 = BRep_Tool::Parameter( theCommonV, theE2 );
2878 if ( c1.IsNull() || c2.IsNull() )
2880 gp_XY uv = c2d1->Value( p1 ).XY();
2881 gp_Vec du, dv; gp_Pnt p;
2882 surf->D1( uv.X(), uv.Y(), p, du, dv );
2883 gp_Vec vec1, vec2, vecRef = du ^ dv;
2886 while ( vecRef.SquareMagnitude() < 1e-25 )
2888 double dp = ( l - f ) / 1000.;
2889 p1tmp += dp * (( Abs( p1 - f ) > Abs( p1 - l )) ? -1. : +1.);
2890 uv = c2d1->Value( p1tmp ).XY();
2891 surf->D1( uv.X(), uv.Y(), p, du, dv );
2893 if ( ++nbLoops > 10 )
2896 cout << "SMESH_MesherHelper::GetAngle(): Captured in a sigularity" << endl;
2901 if ( theFace.Orientation() == TopAbs_REVERSED )
2903 if ( theFaceNormal ) *theFaceNormal = vecRef;
2905 c1->D1( p1, p, vec1 );
2906 c2->D1( p2, p, vec2 );
2907 // TopoDS_Face F = theFace;
2908 // if ( F.Orientation() == TopAbs_INTERNAL )
2909 // F.Orientation( TopAbs_FORWARD );
2910 if ( theE1.Orientation() /*GetSubShapeOri( F, theE1 )*/ == TopAbs_REVERSED )
2912 if ( theE2.Orientation() /*GetSubShapeOri( F, theE2 )*/ == TopAbs_REVERSED )
2914 angle = vec1.AngleWithRef( vec2, vecRef );
2916 if ( Abs ( angle ) >= 0.99 * M_PI )
2918 BRep_Tool::Range( theE1, f, l );
2919 p1 += 1e-7 * ( p1-f < l-p1 ? +1. : -1. );
2920 c1->D1( p1, p, vec1 );
2921 if ( theE1.Orientation() == TopAbs_REVERSED )
2923 BRep_Tool::Range( theE2, f, l );
2924 p2 += 1e-7 * ( p2-f < l-p2 ? +1. : -1. );
2925 c2->D1( p2, p, vec2 );
2926 if ( theE2.Orientation() == TopAbs_REVERSED )
2928 angle = vec1.AngleWithRef( vec2, vecRef );
2937 //================================================================================
2939 * \brief Check if the first and last vertices of an edge are the same
2940 * \param anEdge - the edge to check
2941 * \retval bool - true if same
2943 //================================================================================
2945 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
2947 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2948 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
2949 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
2952 //================================================================================
2954 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
2955 * in the case of INTERNAL edge
2957 //================================================================================
2959 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
2963 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2964 anEdge.Orientation( TopAbs_FORWARD );
2966 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
2967 TopoDS_Iterator vIt( anEdge, CumOri );
2968 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
2971 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
2974 //================================================================================
2976 * \brief Return type of shape contained in a group
2977 * \param group - a shape of type TopAbs_COMPOUND
2978 * \param avoidCompound - not to return TopAbs_COMPOUND
2980 //================================================================================
2982 TopAbs_ShapeEnum SMESH_MesherHelper::GetGroupType(const TopoDS_Shape& group,
2983 const bool avoidCompound)
2985 if ( !group.IsNull() )
2987 if ( group.ShapeType() != TopAbs_COMPOUND )
2988 return group.ShapeType();
2990 // iterate on a compound
2991 TopoDS_Iterator it( group );
2993 return avoidCompound ? GetGroupType( it.Value() ) : it.Value().ShapeType();
2995 return TopAbs_SHAPE;
2998 //=======================================================================
2999 //function : IsQuadraticMesh
3000 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
3001 // quadratic elements will be created.
3002 // Used then generated 3D mesh without geometry.
3003 //=======================================================================
3005 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
3007 int NbAllEdgsAndFaces=0;
3008 int NbQuadFacesAndEdgs=0;
3009 int NbFacesAndEdges=0;
3010 //All faces and edges
3011 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
3012 if ( NbAllEdgsAndFaces == 0 )
3013 return SMESH_MesherHelper::LINEAR;
3015 //Quadratic faces and edges
3016 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
3018 //Linear faces and edges
3019 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
3021 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
3023 return SMESH_MesherHelper::QUADRATIC;
3025 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
3027 return SMESH_MesherHelper::LINEAR;
3030 //Mesh with both type of elements
3031 return SMESH_MesherHelper::COMP;
3034 //=======================================================================
3035 //function : GetOtherParam
3036 //purpose : Return an alternative parameter for a node on seam
3037 //=======================================================================
3039 double SMESH_MesherHelper::GetOtherParam(const double param) const
3041 int i = myParIndex & U_periodic ? 0 : 1;
3042 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
3047 //=======================================================================
3049 * \brief Iterator on ancestors of the given type
3051 //=======================================================================
3053 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
3055 TopTools_ListIteratorOfListOfShape _ancIter;
3056 TopAbs_ShapeEnum _type;
3057 TopTools_MapOfShape _encountered;
3058 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
3059 : _ancIter( ancestors ), _type( type )
3061 if ( _ancIter.More() ) {
3062 if ( _ancIter.Value().ShapeType() != _type ) next();
3063 else _encountered.Add( _ancIter.Value() );
3068 return _ancIter.More();
3070 virtual const TopoDS_Shape* next()
3072 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
3073 if ( _ancIter.More() )
3074 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
3075 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
3083 //=======================================================================
3085 * \brief Return iterator on ancestors of the given type
3087 //=======================================================================
3089 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
3090 const SMESH_Mesh& mesh,
3091 TopAbs_ShapeEnum ancestorType)
3093 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
3096 //=======================================================================
3097 //function : GetCommonAncestor
3098 //purpose : Find a common ancestors of two shapes of the given type
3099 //=======================================================================
3101 TopoDS_Shape SMESH_MesherHelper::GetCommonAncestor(const TopoDS_Shape& shape1,
3102 const TopoDS_Shape& shape2,
3103 const SMESH_Mesh& mesh,
3104 TopAbs_ShapeEnum ancestorType)
3106 TopoDS_Shape commonAnc;
3107 if ( !shape1.IsNull() && !shape2.IsNull() )
3109 PShapeIteratorPtr ancIt = GetAncestors( shape1, mesh, ancestorType );
3110 while ( const TopoDS_Shape* anc = ancIt->next() )
3111 if ( IsSubShape( shape2, *anc ))
3120 //#include <Perf_Meter.hxx>
3122 //=======================================================================
3123 namespace { // Structures used by FixQuadraticElements()
3124 //=======================================================================
3126 #define __DMP__(txt) \
3128 #define MSG(txt) __DMP__(txt<<endl)
3129 #define MSGBEG(txt) __DMP__(txt)
3131 //const double straightTol2 = 1e-33; // to detect straing links
3132 bool isStraightLink(double linkLen2, double middleNodeMove2)
3134 // straight if <node move> < 1/15 * <link length>
3135 return middleNodeMove2 < 1/15./15. * linkLen2;
3139 // ---------------------------------------
3141 * \brief Quadratic link knowing its faces
3143 struct QLink: public SMESH_TLink
3145 const SMDS_MeshNode* _mediumNode;
3146 mutable vector<const QFace* > _faces;
3147 mutable gp_Vec _nodeMove;
3148 mutable int _nbMoves;
3150 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
3151 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
3153 //if ( MediumPos() != SMDS_TOP_3DSPACE )
3154 _nodeMove = MediumPnt() - MiddlePnt();
3156 void SetContinuesFaces() const;
3157 const QFace* GetContinuesFace( const QFace* face ) const;
3158 bool OnBoundary() const;
3159 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
3160 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
3162 SMDS_TypeOfPosition MediumPos() const
3163 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
3164 SMDS_TypeOfPosition EndPos(bool isSecond) const
3165 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
3166 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
3167 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
3169 void Move(const gp_Vec& move, bool sum=false) const
3170 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
3171 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
3172 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
3173 bool IsStraight() const
3174 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
3175 _nodeMove.SquareMagnitude());
3177 bool operator<(const QLink& other) const {
3178 return (node1()->GetID() == other.node1()->GetID() ?
3179 node2()->GetID() < other.node2()->GetID() :
3180 node1()->GetID() < other.node1()->GetID());
3182 // struct PtrComparator {
3183 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
3186 // ---------------------------------------------------------
3188 * \brief Link in the chain of links; it connects two faces
3192 const QLink* _qlink;
3193 mutable const QFace* _qfaces[2];
3195 TChainLink(const QLink* qlink=0):_qlink(qlink) {
3196 _qfaces[0] = _qfaces[1] = 0;
3198 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
3200 bool IsBoundary() const { return !_qfaces[1]; }
3202 void RemoveFace( const QFace* face ) const
3203 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
3205 const QFace* NextFace( const QFace* f ) const
3206 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
3208 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
3209 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
3211 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
3213 operator bool() const { return (_qlink); }
3215 const QLink* operator->() const { return _qlink; }
3217 gp_Vec Normal() const;
3219 bool IsStraight() const;
3221 // --------------------------------------------------------------------
3222 typedef list< TChainLink > TChain;
3223 typedef set < TChainLink > TLinkSet;
3224 typedef TLinkSet::const_iterator TLinkInSet;
3226 const int theFirstStep = 5;
3228 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
3229 // --------------------------------------------------------------------
3231 * \brief Quadratic face shared by two volumes and bound by QLinks
3233 struct QFace: public TIDSortedNodeSet
3235 mutable const SMDS_MeshElement* _volumes[2];
3236 mutable vector< const QLink* > _sides;
3237 mutable bool _sideIsAdded[4]; // added in chain of links
3240 mutable const SMDS_MeshElement* _face;
3243 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
3245 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
3247 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
3249 void AddSelfToLinks() const {
3250 for ( int i = 0; i < _sides.size(); ++i )
3251 _sides[i]->_faces.push_back( this );
3253 int LinkIndex( const QLink* side ) const {
3254 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
3257 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
3259 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
3261 int i = LinkIndex( link._qlink );
3262 if ( i < 0 ) return true;
3263 _sideIsAdded[i] = true;
3264 link.SetFace( this );
3265 // continue from opposite link
3266 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
3268 bool IsBoundary() const { return !_volumes[1]; }
3270 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
3272 bool IsSpoiled(const QLink* bentLink ) const;
3274 TLinkInSet GetBoundaryLink( const TLinkSet& links,
3275 const TChainLink& avoidLink,
3276 TLinkInSet * notBoundaryLink = 0,
3277 const SMDS_MeshNode* nodeToContain = 0,
3278 bool * isAdjacentUsed = 0,
3279 int nbRecursionsLeft = -1) const;
3281 TLinkInSet GetLinkByNode( const TLinkSet& links,
3282 const TChainLink& avoidLink,
3283 const SMDS_MeshNode* nodeToContain) const;
3285 const SMDS_MeshNode* GetNodeInFace() const {
3286 for ( int iL = 0; iL < _sides.size(); ++iL )
3287 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
3291 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
3293 double MoveByBoundary( const TChainLink& theLink,
3294 const gp_Vec& theRefVec,
3295 const TLinkSet& theLinks,
3296 SMESH_MesherHelper* theFaceHelper=0,
3297 const double thePrevLen=0,
3298 const int theStep=theFirstStep,
3299 gp_Vec* theLinkNorm=0,
3300 double theSign=1.0) const;
3303 //================================================================================
3305 * \brief Dump QLink and QFace
3307 ostream& operator << (ostream& out, const QLink& l)
3309 out <<"QLink nodes: "
3310 << l.node1()->GetID() << " - "
3311 << l._mediumNode->GetID() << " - "
3312 << l.node2()->GetID() << endl;
3315 ostream& operator << (ostream& out, const QFace& f)
3317 out <<"QFace nodes: "/*<< &f << " "*/;
3318 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
3319 out << (*n)->GetID() << " ";
3320 out << " \tvolumes: "
3321 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
3322 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
3323 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
3327 //================================================================================
3329 * \brief Construct QFace from QLinks
3331 //================================================================================
3333 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
3335 _volumes[0] = _volumes[1] = 0;
3337 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
3338 _normal.SetCoord(0,0,0);
3339 for ( int i = 1; i < _sides.size(); ++i ) {
3340 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
3341 insert( l1->node1() ); insert( l1->node2() );
3343 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
3344 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
3345 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
3349 double normSqSize = _normal.SquareMagnitude();
3350 if ( normSqSize > numeric_limits<double>::min() )
3351 _normal /= sqrt( normSqSize );
3353 _normal.SetCoord(1e-33,0,0);
3359 //================================================================================
3361 * \brief Make up a chain of links
3362 * \param iSide - link to add first
3363 * \param chain - chain to fill in
3364 * \param pos - postion of medium nodes the links should have
3365 * \param error - out, specifies what is wrong
3366 * \retval bool - false if valid chain can't be built; "valid" means that links
3367 * of the chain belongs to rectangles bounding hexahedrons
3369 //================================================================================
3371 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
3373 if ( iSide >= _sides.size() ) // wrong argument iSide
3375 if ( _sideIsAdded[ iSide ]) // already in chain
3378 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
3381 list< const QFace* > faces( 1, this );
3382 while ( !faces.empty() ) {
3383 const QFace* face = faces.front();
3384 for ( int i = 0; i < face->_sides.size(); ++i ) {
3385 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
3386 face->_sideIsAdded[i] = true;
3387 // find a face side in the chain
3388 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
3389 // TChain::iterator chLink = chain.begin();
3390 // for ( ; chLink != chain.end(); ++chLink )
3391 // if ( chLink->_qlink == face->_sides[i] )
3393 // if ( chLink == chain.end() )
3394 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
3395 // add a face to a chained link and put a continues face in the queue
3396 chLink->SetFace( face );
3397 if ( face->_sides[i]->MediumPos() == pos )
3398 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
3399 if ( contFace->_sides.size() == 3 )
3400 faces.push_back( contFace );
3405 if ( error < ERR_TRI )
3407 chain.insert( chain.end(), links.begin(),links.end() );
3410 _sideIsAdded[iSide] = true; // not to add this link to chain again
3411 const QLink* link = _sides[iSide];
3415 // add link into chain
3416 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
3417 chLink->SetFace( this );
3420 // propagate from a quadrangle to neighbour faces
3421 if ( link->MediumPos() >= pos ) {
3422 int nbLinkFaces = link->_faces.size();
3423 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
3424 // hexahedral mesh or boundary quadrangles - goto a continous face
3425 if ( const QFace* f = link->GetContinuesFace( this ))
3426 if ( f->_sides.size() == 4 )
3427 return f->GetLinkChain( *chLink, chain, pos, error );
3430 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
3431 for ( int i = 0; i < nbLinkFaces; ++i )
3432 if ( link->_faces[i] )
3433 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
3434 if ( error < ERR_PRISM )
3442 //================================================================================
3444 * \brief Return a boundary link of the triangle face
3445 * \param links - set of all links
3446 * \param avoidLink - link not to return
3447 * \param notBoundaryLink - out, neither the returned link nor avoidLink
3448 * \param nodeToContain - node the returned link must contain; if provided, search
3449 * also performed on adjacent faces
3450 * \param isAdjacentUsed - returns true if link is found in adjacent faces
3451 * \param nbRecursionsLeft - to limit recursion
3453 //================================================================================
3455 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
3456 const TChainLink& avoidLink,
3457 TLinkInSet * notBoundaryLink,
3458 const SMDS_MeshNode* nodeToContain,
3459 bool * isAdjacentUsed,
3460 int nbRecursionsLeft) const
3462 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
3464 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
3465 TFaceLinkList adjacentFaces;
3467 for ( int iL = 0; iL < _sides.size(); ++iL )
3469 if ( avoidLink._qlink == _sides[iL] )
3471 TLinkInSet link = links.find( _sides[iL] );
3472 if ( link == linksEnd ) continue;
3473 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
3474 continue; // We work on faces here, don't go inside a solid
3477 if ( link->IsBoundary() ) {
3478 if ( !nodeToContain ||
3479 (*link)->node1() == nodeToContain ||
3480 (*link)->node2() == nodeToContain )
3482 boundaryLink = link;
3483 if ( !notBoundaryLink ) break;
3486 else if ( notBoundaryLink ) {
3487 *notBoundaryLink = link;
3488 if ( boundaryLink != linksEnd ) break;
3491 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
3492 if ( const QFace* adj = link->NextFace( this ))
3493 if ( adj->Contains( nodeToContain ))
3494 adjacentFaces.push_back( make_pair( adj, link ));
3497 if ( isAdjacentUsed ) *isAdjacentUsed = false;
3498 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
3500 if ( nbRecursionsLeft < 0 )
3501 nbRecursionsLeft = nodeToContain->NbInverseElements();
3502 TFaceLinkList::iterator adj = adjacentFaces.begin();
3503 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
3504 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
3505 isAdjacentUsed, nbRecursionsLeft-1);
3506 if ( isAdjacentUsed ) *isAdjacentUsed = true;
3508 return boundaryLink;
3510 //================================================================================
3512 * \brief Return a link ending at the given node but not avoidLink
3514 //================================================================================
3516 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
3517 const TChainLink& avoidLink,
3518 const SMDS_MeshNode* nodeToContain) const
3520 for ( int i = 0; i < _sides.size(); ++i )
3521 if ( avoidLink._qlink != _sides[i] &&
3522 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
3523 return links.find( _sides[ i ]);
3527 //================================================================================
3529 * \brief Return normal to the i-th side pointing outside the face
3531 //================================================================================
3533 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
3535 gp_Vec norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3536 gp_XYZ pIn = ( _sides[ (i+1)%3 ]->MiddlePnt() +
3537 _sides[ (i+2)%3 ]->MiddlePnt() ) / 2.;
3538 gp_Vec vecOut = ( _sides[i]->MiddlePnt() - pIn );
3540 if ( norm * vecOut < 0 )
3542 double mag2 = norm.SquareMagnitude();
3543 if ( mag2 > numeric_limits<double>::min() )
3544 norm /= sqrt( mag2 );
3547 //================================================================================
3549 * \brief Move medium node of theLink according to its distance from boundary
3550 * \param theLink - link to fix
3551 * \param theRefVec - movement of boundary
3552 * \param theLinks - all adjacent links of continous triangles
3553 * \param theFaceHelper - helper is not used so far
3554 * \param thePrevLen - distance from the boundary
3555 * \param theStep - number of steps till movement propagation limit
3556 * \param theLinkNorm - out normal to theLink
3557 * \param theSign - 1 or -1 depending on movement of boundary
3558 * \retval double - distance from boundary to propagation limit or other boundary
3560 //================================================================================
3562 double QFace::MoveByBoundary( const TChainLink& theLink,
3563 const gp_Vec& theRefVec,
3564 const TLinkSet& theLinks,
3565 SMESH_MesherHelper* theFaceHelper,
3566 const double thePrevLen,
3568 gp_Vec* theLinkNorm,
3569 double theSign) const
3572 return thePrevLen; // propagation limit reached
3574 int iL; // index of theLink
3575 for ( iL = 0; iL < _sides.size(); ++iL )
3576 if ( theLink._qlink == _sides[ iL ])
3579 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
3580 <<" thePrevLen " << thePrevLen);
3581 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
3583 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
3584 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
3585 if ( theStep == theFirstStep )
3586 theSign = refProj < 0. ? -1. : 1.;
3587 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
3588 return thePrevLen; // to propagate movement forward only, not in side dir or backward
3590 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
3591 TLinkInSet link1 = theLinks.find( _sides[iL1] );
3592 TLinkInSet link2 = theLinks.find( _sides[iL2] );
3594 const QFace *f1 = 0, *f2 = 0; // adjacent faces
3595 bool isBndLink1 = true, isBndLink2 = true;
3596 if ( link1 != theLinks.end() && link2 != theLinks.end() )
3598 f1 = link1->NextFace( this );
3599 f2 = link2->NextFace( this );
3601 isBndLink1 = ( theLink->MediumPos() > (*link1)->MediumPos() );
3602 isBndLink2 = ( theLink->MediumPos() > (*link2)->MediumPos() );
3603 if ( theStep == theFirstStep ) // (issue 22541) quad-dominant mesh
3605 if ( !isBndLink1 && !f1 )
3606 f1 = (*link1)->GetContinuesFace( this ); // get a quadrangle face
3607 if ( !isBndLink2 && !f2 )
3608 f2 = (*link2)->GetContinuesFace( this );
3611 else if ( _sides.size() < 4 )
3614 // propagate to adjacent faces till limit step or boundary
3615 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
3616 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
3617 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
3618 gp_Vec linkDir2(0,0,0);
3621 if ( f1 && !isBndLink1 )
3622 len1 = f1->MoveByBoundary
3623 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
3625 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
3627 MSG( " --------------- EXCEPTION");
3632 if ( f2 && !isBndLink2 )
3633 len2 = f2->MoveByBoundary
3634 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
3636 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
3638 MSG( " --------------- EXCEPTION");
3643 if ( theStep != theFirstStep )
3645 // choose chain length by direction of propagation most codirected with theRefVec
3646 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
3647 fullLen = choose1 ? len1 : len2;
3648 double r = thePrevLen / fullLen;
3650 gp_Vec move = linkNorm * refProj * ( 1 - r );
3651 theLink->Move( move, true );
3653 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
3654 " by " << refProj * ( 1 - r ) << " following " <<
3655 (choose1 ? *link1->_qlink : *link2->_qlink)); // warning: link1 can be invalid
3657 if ( theLinkNorm ) *theLinkNorm = linkNorm;
3662 //================================================================================
3664 * \brief Checks if the face is distorted due to bentLink
3666 //================================================================================
3668 bool QFace::IsSpoiled(const QLink* bentLink ) const
3670 // code is valid for convex faces only
3672 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
3673 gc += XYZ( *n ) / size();
3674 for (unsigned i = 0; i < _sides.size(); ++i )
3676 if ( _sides[i] == bentLink ) continue;
3677 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3678 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
3679 if ( linkNorm * vecOut < 0 )
3681 double mag2 = linkNorm.SquareMagnitude();
3682 if ( mag2 > numeric_limits<double>::min() )
3683 linkNorm /= sqrt( mag2 );
3684 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
3685 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
3686 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
3693 //================================================================================
3695 * \brief Find pairs of continues faces
3697 //================================================================================
3699 void QLink::SetContinuesFaces() const
3701 // x0 x - QLink, [-|] - QFace, v - volume
3703 // | Between _faces of link x2 two vertical faces are continues
3704 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
3705 // | to _faces[0] and _faces[1] and horizontal faces to
3706 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
3709 if ( _faces.empty() )
3711 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
3712 if ( _faces[0]->IsBoundary() )
3713 iBoundary[ nbBoundary++ ] = 0;
3714 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
3716 // look for a face bounding none of volumes bound by _faces[0]
3717 bool sameVol = false;
3718 int nbVol = _faces[iF]->NbVolumes();
3719 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
3720 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
3721 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
3724 if ( _faces[iF]->IsBoundary() )
3725 iBoundary[ nbBoundary++ ] = iF;
3727 // Set continues faces: arrange _faces to have
3728 // _faces[0] continues to _faces[1]
3729 // _faces[2] continues to _faces[3]
3730 if ( nbBoundary == 2 ) // bnd faces are continues
3732 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
3734 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
3735 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
3738 else if ( iFaceCont > 0 ) // continues faces found
3740 if ( iFaceCont != 1 )
3741 std::swap( _faces[1], _faces[iFaceCont] );
3743 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
3745 _faces.insert( ++_faces.begin(), (QFace*) 0 );
3748 //================================================================================
3750 * \brief Return a face continues to the given one
3752 //================================================================================
3754 const QFace* QLink::GetContinuesFace( const QFace* face ) const
3756 for ( int i = 0; i < _faces.size(); ++i ) {
3757 if ( _faces[i] == face ) {
3758 int iF = i < 2 ? 1-i : 5-i;
3759 return iF < _faces.size() ? _faces[iF] : 0;
3764 //================================================================================
3766 * \brief True if link is on mesh boundary
3768 //================================================================================
3770 bool QLink::OnBoundary() const
3772 for ( int i = 0; i < _faces.size(); ++i )
3773 if (_faces[i] && _faces[i]->IsBoundary()) return true;
3776 //================================================================================
3778 * \brief Return normal of link of the chain
3780 //================================================================================
3782 gp_Vec TChainLink::Normal() const {
3784 if (_qfaces[0]) norm = _qfaces[0]->_normal;
3785 if (_qfaces[1]) norm += _qfaces[1]->_normal;
3788 //================================================================================
3790 * \brief Test link curvature taking into account size of faces
3792 //================================================================================
3794 bool TChainLink::IsStraight() const
3796 bool isStraight = _qlink->IsStraight();
3797 if ( isStraight && _qfaces[0] && !_qfaces[1] )
3799 int i = _qfaces[0]->LinkIndex( _qlink );
3800 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
3801 gp_XYZ mid1 = _qlink->MiddlePnt();
3802 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
3803 double faceSize2 = (mid1-mid2).SquareModulus();
3804 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
3809 //================================================================================
3811 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
3813 //================================================================================
3815 void fixPrism( TChain& allLinks )
3817 // separate boundary links from internal ones
3818 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
3819 QLinkSet interLinks, bndLinks1, bndLink2;
3821 bool isCurved = false;
3822 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3823 if ( (*lnk)->OnBoundary() )
3824 bndLinks1.insert( lnk->_qlink );
3826 interLinks.insert( lnk->_qlink );
3827 isCurved = isCurved || !lnk->IsStraight();
3830 return; // no need to move
3832 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
3834 while ( !interLinks.empty() && !curBndLinks->empty() )
3836 // propagate movement from boundary links to connected internal links
3837 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
3838 for ( ; bnd != bndEnd; ++bnd )
3840 const QLink* bndLink = *bnd;
3841 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
3843 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
3844 if ( !face ) continue;
3845 // find and move internal link opposite to bndLink within the face
3846 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
3847 const QLink* interLink = face->_sides[ interInd ];
3848 QLinkSet::iterator pInterLink = interLinks.find( interLink );
3849 if ( pInterLink == interLinks.end() ) continue; // not internal link
3850 interLink->Move( bndLink->_nodeMove );
3851 // treated internal links become new boundary ones
3852 interLinks.erase( pInterLink );
3853 newBndLinks->insert( interLink );
3856 curBndLinks->clear();
3857 std::swap( curBndLinks, newBndLinks );
3861 //================================================================================
3863 * \brief Fix links of continues triangles near curved boundary
3865 //================================================================================
3867 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
3869 if ( allLinks.empty() ) return;
3871 TLinkSet linkSet( allLinks.begin(), allLinks.end());
3872 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
3874 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
3876 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
3878 // move iff a boundary link is bent towards inside of a face (issue 0021084)
3879 const QFace* face = linkIt->_qfaces[0];
3880 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
3881 face->_sides[1]->MiddlePnt() +
3882 face->_sides[2]->MiddlePnt() ) / 3.;
3883 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
3884 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
3885 //if ( face->IsSpoiled( linkIt->_qlink ))
3886 if ( linkBentInside )
3887 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
3892 //================================================================================
3894 * \brief Detect rectangular structure of links and build chains from them
3896 //================================================================================
3898 enum TSplitTriaResult {
3899 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
3900 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
3902 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
3903 vector< TChain> & resultChains,
3904 SMDS_TypeOfPosition pos )
3906 // put links in the set and evalute number of result chains by number of boundary links
3909 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3910 linkSet.insert( *lnk );
3911 nbBndLinks += lnk->IsBoundary();
3913 resultChains.clear();
3914 resultChains.reserve( nbBndLinks / 2 );
3916 TLinkInSet linkIt, linksEnd = linkSet.end();
3918 // find a boundary link with corner node; corner node has position pos-2
3919 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
3921 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
3922 const SMDS_MeshNode* corner = 0;
3923 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
3924 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
3929 TLinkInSet startLink = linkIt;
3930 const SMDS_MeshNode* startCorner = corner;
3931 vector< TChain* > rowChains;
3934 while ( startLink != linksEnd) // loop on columns
3936 // We suppose we have a rectangular structure like shown here. We have found a
3937 // corner of the rectangle (startCorner) and a boundary link sharing
3938 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
3939 // --o---o---o structure making several chains at once. One chain (columnChain)
3940 // |\ | /| starts at startLink and continues upward (we look at the structure
3941 // \ | \ | / | from such point that startLink is on the bottom of the structure).
3942 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
3943 // --o---o---o encounter.
3945 // / | \ | \ | startCorner
3950 if ( resultChains.size() == nbBndLinks / 2 )
3952 resultChains.push_back( TChain() );
3953 TChain& columnChain = resultChains.back();
3955 TLinkInSet botLink = startLink; // current horizontal link to go up from
3956 corner = startCorner; // current corner the botLink ends at
3958 while ( botLink != linksEnd ) // loop on rows
3960 // add botLink to the columnChain
3961 columnChain.push_back( *botLink );
3963 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
3965 { // the column ends
3966 if ( botLink == startLink )
3967 return _TWISTED_CHAIN; // issue 0020951
3968 linkSet.erase( botLink );
3969 if ( iRow != rowChains.size() )
3970 return _FEW_ROWS; // different nb of rows in columns
3973 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
3974 // link ending at <corner> (sideLink); there are two cases:
3975 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
3976 // since midQuadLink is not at boundary while sideLink is.
3977 // 2) midQuadLink ends at <corner>
3979 TLinkInSet midQuadLink = linksEnd;
3980 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
3982 if ( isCase2 ) { // find midQuadLink among links of botTria
3983 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
3984 if ( midQuadLink->IsBoundary() )
3985 return _BAD_MIDQUAD;
3987 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
3988 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
3991 columnChain.push_back( *midQuadLink );
3992 if ( iRow >= rowChains.size() ) {
3994 return _MANY_ROWS; // different nb of rows in columns
3995 if ( resultChains.size() == nbBndLinks / 2 )
3997 resultChains.push_back( TChain() );
3998 rowChains.push_back( & resultChains.back() );
4000 rowChains[iRow]->push_back( *sideLink );
4001 rowChains[iRow]->push_back( *midQuadLink );
4003 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
4007 // prepare startCorner and startLink for the next column
4008 startCorner = startLink->NextNode( startCorner );
4010 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
4012 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
4013 // check if no more columns remains
4014 if ( startLink != linksEnd ) {
4015 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
4016 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
4017 startLink = linksEnd; // startLink bounds upTria or botTria
4018 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
4022 // find bottom link and corner for the next row
4023 corner = sideLink->NextNode( corner );
4024 // next bottom link ends at the new corner
4025 linkSet.erase( botLink );
4026 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
4027 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
4029 if ( midQuadLink == startLink || sideLink == startLink )
4030 return _TWISTED_CHAIN; // issue 0020951
4031 linkSet.erase( midQuadLink );
4032 linkSet.erase( sideLink );
4034 // make faces neighboring the found ones be boundary
4035 if ( startLink != linksEnd ) {
4036 const QFace* tria = isCase2 ? botTria : upTria;
4037 for ( int iL = 0; iL < 3; ++iL ) {
4038 linkIt = linkSet.find( tria->_sides[iL] );
4039 if ( linkIt != linksEnd )
4040 linkIt->RemoveFace( tria );
4043 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
4044 botLink->RemoveFace( upTria ); // make next botTria first in vector
4051 // In the linkSet, there must remain the last links of rowChains; add them
4052 if ( linkSet.size() != rowChains.size() )
4053 return _BAD_SET_SIZE;
4054 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
4055 // find the link (startLink) ending at startCorner
4057 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
4058 if ( (*startLink)->node1() == startCorner ) {
4059 corner = (*startLink)->node2(); break;
4061 else if ( (*startLink)->node2() == startCorner) {
4062 corner = (*startLink)->node1(); break;
4065 if ( startLink == linksEnd )
4067 rowChains[ iRow ]->push_back( *startLink );
4068 linkSet.erase( startLink );
4069 startCorner = corner;
4075 //================================================================================
4077 * \brief Place medium nodes at the link middle for elements whose corner nodes
4078 * are out of geometrical boundary to prevent distorting elements.
4079 * Issue 0020982, note 0013990
4081 //================================================================================
4083 void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
4084 SMESH_ComputeErrorPtr& theError)
4086 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
4087 TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
4088 if ( shape.IsNull() ) return;
4090 if ( !theError ) theError = SMESH_ComputeError::New();
4094 if ( shape.ShapeType() == TopAbs_FACE ) // 2D
4096 if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
4098 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
4099 if ( !faceSM ) return;
4101 const TopoDS_Face& face = TopoDS::Face( shape );
4102 Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
4104 TopExp_Explorer edgeIt( face, TopAbs_EDGE );
4105 for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
4107 // check if the EDGE needs checking
4108 const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
4109 if ( SMESH_Algo::isDegenerated( edge ) )
4111 if ( theHelper.IsRealSeam( edge ) &&
4112 edge.Orientation() == TopAbs_REVERSED )
4115 SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
4116 if ( !edgeSM ) continue;
4119 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
4120 BRepAdaptor_Curve curve3D( edge );
4121 switch ( curve3D.GetType() ) {
4122 case GeomAbs_Line: continue;
4123 case GeomAbs_Circle:
4124 case GeomAbs_Ellipse:
4125 case GeomAbs_Hyperbola:
4126 case GeomAbs_Parabola:
4129 gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
4130 curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
4131 gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
4132 surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
4133 gp_Vec fNorm = Du1 ^ Dv1;
4134 if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
4135 continue; // face is normal to the curve3D
4137 gp_Vec curvNorm = fNorm ^ D1;
4138 if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
4139 if ( curvNorm * D2 > 0 )
4140 continue; // convex edge
4142 catch ( Standard_Failure )
4147 // get nodes shared by faces that may be distorted
4148 SMDS_NodeIteratorPtr nodeIt;
4149 if ( edgeSM->NbNodes() > 0 ) {
4150 nodeIt = edgeSM->GetNodes();
4153 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
4155 vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
4156 if ( !vertexSM ) continue;
4157 nodeIt = vertexSM->GetNodes();
4160 // find suspicious faces
4161 TIDSortedElemSet checkedFaces;
4162 vector< const SMDS_MeshNode* > nOnEdge( 2 );
4163 const SMDS_MeshNode* nOnFace;
4164 while ( nodeIt->more() )
4166 const SMDS_MeshNode* n = nodeIt->next();
4167 SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
4168 while ( faceIt->more() )
4170 const SMDS_MeshElement* f = faceIt->next();
4171 if ( !faceSM->Contains( f ) ||
4172 f->NbNodes() < 6 || // check quadratic triangles only
4173 !checkedFaces.insert( f ).second )
4176 // get nodes on EDGE and on FACE of a suspicious face
4177 nOnEdge.clear(); nOnFace = 0;
4178 SMDS_MeshElement::iterator triNode = f->begin_nodes();
4179 for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
4182 if ( n->GetPosition()->GetDim() == 2 )
4185 nOnEdge.push_back( n );
4188 // check if nOnFace is inside the FACE
4189 if ( nOnFace && nOnEdge.size() == 2 )
4191 theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
4192 if ( !SMESH_MeshAlgos::FaceNormal( f, faceNorm, /*normalized=*/false ))
4194 gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
4195 gp_XYZ edgeNorm = faceNorm ^ edgeDir;
4196 n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true );
4197 gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
4198 gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
4199 gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
4200 double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
4201 double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
4202 if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
4204 // nOnFace is out of FACE, move a medium on-edge node to the middle
4205 gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
4206 meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4207 MSG( "move OUT of face " << n );
4208 theError->myBadElements.push_back( f );
4214 if ( !theError->myBadElements.empty() )
4215 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4218 } // 2D ==============================================================================
4220 if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
4222 if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
4223 theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
4225 SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
4226 if ( !solidSM ) return;
4228 // check if the SOLID is bound by concave FACEs
4229 vector< TopoDS_Face > concaveFaces;
4230 TopExp_Explorer faceIt( shape, TopAbs_FACE );
4231 for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4233 const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
4234 if ( !meshDS->MeshElements( face )) continue;
4236 BRepAdaptor_Surface surface( face );
4237 switch ( surface.GetType() ) {
4238 case GeomAbs_Plane: continue;
4239 case GeomAbs_Cylinder:
4241 case GeomAbs_Sphere:
4244 double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
4245 double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
4246 gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
4247 surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
4248 gp_Vec fNorm = Du1 ^ Dv1;
4249 if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
4250 bool concaveU = ( fNorm * Du2 > 1e-100 );
4251 bool concaveV = ( fNorm * Dv2 > 1e-100 );
4252 if ( concaveU || concaveV )
4253 concaveFaces.push_back( face );
4255 catch ( Standard_Failure )
4257 concaveFaces.push_back( face );
4261 if ( concaveFaces.empty() )
4264 // fix 2D mesh on the SOLID
4265 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4267 SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
4268 faceHelper.SetSubShape( faceIt.Current() );
4269 force3DOutOfBoundary( faceHelper, theError );
4272 // get an iterator over faces on concaveFaces
4273 vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
4274 for ( size_t i = 0; i < concaveFaces.size(); ++i )
4275 faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
4276 typedef SMDS_IteratorOnIterators
4277 < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
4278 SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
4280 // a seacher to check if a volume is close to a concave face
4281 std::auto_ptr< SMESH_ElementSearcher > faceSearcher
4282 ( SMESH_MeshAlgos::GetElementSearcher( *theHelper.GetMeshDS(), faceIter ));
4285 //BRepClass3d_SolidClassifier solidClassifier( shape );
4287 TIDSortedElemSet checkedVols, movedNodes;
4288 //for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4289 for ( size_t iF = 0; iF < concaveFaces.size(); ++iF ) // loop on concave FACEs
4291 //const TopoDS_Shape& face = faceIt.Current();
4292 const TopoDS_Shape& face = concaveFaces[ iF ];
4293 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
4294 if ( !faceSM ) continue;
4296 // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
4297 SMDS_NodeIteratorPtr nodeIt;
4298 if ( faceSM->NbNodes() > 0 ) {
4299 nodeIt = faceSM->GetNodes();
4302 TopExp_Explorer vertex( face, TopAbs_VERTEX );
4303 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
4304 if ( !vertexSM ) continue;
4305 nodeIt = vertexSM->GetNodes();
4307 // get ids of sub-shapes of the FACE
4309 SMESH_subMeshIteratorPtr smIt =
4310 theHelper.GetMesh()->GetSubMesh( face )->getDependsOnIterator(/*includeSelf=*/true);
4311 while ( smIt->more() )
4312 subIDs.insert( smIt->next()->GetId() );
4314 // find suspicious volumes adjacent to the FACE
4315 vector< const SMDS_MeshNode* > nOnFace( 4 );
4316 const SMDS_MeshNode* nInSolid;
4317 while ( nodeIt->more() )
4319 const SMDS_MeshNode* n = nodeIt->next();
4320 SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
4321 while ( volIt->more() )
4323 const SMDS_MeshElement* vol = volIt->next();
4324 int nbN = vol->NbCornerNodes();
4325 if ( ( nbN != 4 && nbN != 5 ) ||
4326 !solidSM->Contains( vol ) ||
4327 !checkedVols.insert( vol ).second )
4330 // get nodes on FACE and in SOLID of a suspicious volume
4331 nOnFace.clear(); nInSolid = 0;
4332 SMDS_MeshElement::iterator volNode = vol->begin_nodes();
4333 for ( int nb = nbN; nb > 0; ++volNode, --nb )
4336 if ( n->GetPosition()->GetDim() == 3 )
4338 else if ( subIDs.count( n->getshapeId() ))
4339 nOnFace.push_back( n );
4343 if ( !nInSolid || nOnFace.size() != nbN - 1 )
4346 // get size of the vol
4347 SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
4348 double volLength = pInSolid.SquareDistance( nOnFace[0] );
4349 for ( size_t i = 1; i < nOnFace.size(); ++i )
4351 volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
4354 // check if vol is close to concaveFaces
4355 const SMDS_MeshElement* closeFace =
4356 faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
4358 pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
4361 // check if vol is distorted, i.e. a medium node is much closer
4362 // to nInSolid than the link middle
4363 bool isDistorted = false;
4364 SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
4365 if ( !SMESH_MeshAlgos::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
4367 theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
4368 vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
4369 for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
4370 for ( size_t j = i+1; j < nOnFace.size(); ++j )
4372 SMESH_TLink link( nOnFace[i], nOnFace[j] );
4373 TLinkNodeMap::const_iterator linkIt =
4374 theHelper.GetTLinkNodeMap().find( link );
4375 if ( linkIt != theHelper.GetTLinkNodeMap().end() )
4377 links.push_back( make_pair( linkIt->first, linkIt->second ));
4378 if ( !isDistorted ) {
4379 // compare projections of nInSolid and nMedium to face normal
4380 gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
4381 double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
4382 double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
4383 isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
4387 // move medium nodes to link middle
4390 for ( size_t i = 0; i < links.size(); ++i )
4392 const SMDS_MeshNode* nMedium = links[i].second;
4393 if ( movedNodes.insert( nMedium ).second )
4395 gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
4396 SMESH_TNodeXYZ( links[i].first.node2() ));
4397 meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4398 MSG( "move OUT of solid " << nMedium );
4401 theError->myBadElements.push_back( vol );
4403 } // loop on volumes sharing a node on FACE
4404 } // loop on nodes on FACE
4405 } // loop on FACEs of a SOLID
4407 if ( !theError->myBadElements.empty() )
4408 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4414 //=======================================================================
4416 * \brief Move medium nodes of faces and volumes to fix distorted elements
4417 * \param error - container of fixed distorted elements
4418 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
4420 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
4422 //=======================================================================
4424 void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& compError,
4427 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
4428 if ( getenv("NO_FixQuadraticElements") )
4431 // 0. Apply algorithm to SOLIDs or FACEs
4432 // ----------------------------------------------
4433 if ( myShape.IsNull() ) {
4434 if ( !myMesh->HasShapeToMesh() ) return;
4435 SetSubShape( myMesh->GetShapeToMesh() );
4439 TopTools_IndexedMapOfShape solids;
4440 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
4441 nbSolids = solids.Extent();
4443 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
4444 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
4445 faces.Add( f.Current() ); // not in solid
4447 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
4448 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
4449 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
4450 faces.Add( f.Current() ); // in not meshed solid
4452 else { // fix nodes in the solid and its faces
4454 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
4456 SMESH_MesherHelper h(*myMesh);
4457 h.SetSubShape( s.Current() );
4458 h.ToFixNodeParameters(true);
4459 h.FixQuadraticElements( compError, false );
4462 // fix nodes on geom faces
4464 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
4466 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
4467 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
4468 SMESH_MesherHelper h(*myMesh);
4469 h.SetSubShape( fIt.Key() );
4470 h.ToFixNodeParameters(true);
4471 h.FixQuadraticElements( compError, true);
4473 //perf_print_all_meters(1);
4474 if ( compError && compError->myName == EDITERR_NO_MEDIUM_ON_GEOM )
4475 compError->myComment = "during conversion to quadratic, "
4476 "some medium nodes were not placed on geometry to avoid distorting elements";
4480 // 1. Find out type of elements and get iterator on them
4481 // ---------------------------------------------------
4483 SMDS_ElemIteratorPtr elemIt;
4484 SMDSAbs_ElementType elemType = SMDSAbs_All;
4486 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
4489 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
4490 elemIt = smDS->GetElements();
4491 if ( elemIt->more() ) {
4492 elemType = elemIt->next()->GetType();
4493 elemIt = smDS->GetElements();
4496 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
4499 // 2. Fill in auxiliary data structures
4500 // ----------------------------------
4504 set< QLink >::iterator pLink;
4505 set< QFace >::iterator pFace;
4507 bool isCurved = false;
4508 //bool hasRectFaces = false;
4509 //set<int> nbElemNodeSet;
4510 SMDS_VolumeTool volTool;
4512 TIDSortedNodeSet apexOfPyramid;
4513 const int apexIndex = 4;
4516 // Move medium nodes to the link middle for elements whose corner nodes
4517 // are out of geometrical boundary to fix distorted elements.
4518 force3DOutOfBoundary( *this, compError );
4520 if ( elemType == SMDSAbs_Volume )
4522 while ( elemIt->more() ) // loop on volumes
4524 const SMDS_MeshElement* vol = elemIt->next();
4525 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
4527 double volMinSize2 = -1.;
4528 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
4530 int nbN = volTool.NbFaceNodes( iF );
4531 //nbElemNodeSet.insert( nbN );
4532 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
4533 vector< const QLink* > faceLinks( nbN/2 );
4534 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
4537 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
4538 pLink = links.insert( link ).first;
4539 faceLinks[ iN/2 ] = & *pLink;
4541 if ( link.MediumPos() == SMDS_TOP_3DSPACE )
4543 if ( !link.IsStraight() )
4544 return; // already fixed
4546 else if ( !isCurved )
4548 if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
4549 isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
4553 pFace = faces.insert( QFace( faceLinks )).first;
4554 if ( pFace->NbVolumes() == 0 )
4555 pFace->AddSelfToLinks();
4556 pFace->SetVolume( vol );
4557 // hasRectFaces = hasRectFaces ||
4558 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
4559 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
4562 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
4564 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
4565 faceNodes[4],faceNodes[6] );
4568 // collect pyramid apexes for further correction
4569 if ( vol->NbCornerNodes() == 5 )
4570 apexOfPyramid.insert( vol->GetNode( apexIndex ));
4572 set< QLink >::iterator pLink = links.begin();
4573 for ( ; pLink != links.end(); ++pLink )
4574 pLink->SetContinuesFaces();
4578 while ( elemIt->more() ) // loop on faces
4580 const SMDS_MeshElement* face = elemIt->next();
4581 if ( !face->IsQuadratic() )
4583 //nbElemNodeSet.insert( face->NbNodes() );
4584 int nbN = face->NbNodes()/2;
4585 vector< const QLink* > faceLinks( nbN );
4586 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
4589 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
4590 pLink = links.insert( link ).first;
4591 faceLinks[ iN ] = & *pLink;
4593 link.node1()->GetPosition()->GetTypeOfPosition() < 2 &&
4594 link.node2()->GetPosition()->GetTypeOfPosition() < 2 )
4595 isCurved = !link.IsStraight();
4598 pFace = faces.insert( QFace( faceLinks )).first;
4599 pFace->AddSelfToLinks();
4600 //hasRectFaces = ( hasRectFaces || nbN == 4 );
4604 return; // no curved edges of faces
4606 // 3. Compute displacement of medium nodes
4607 // ---------------------------------------
4609 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones.
4610 TopLoc_Location loc;
4612 // not to treat boundary of volumic sub-mesh.
4613 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
4614 for ( ; isInside < 2; ++isInside )
4616 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
4617 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
4618 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
4620 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
4621 if ( bool(isInside) == pFace->IsBoundary() )
4623 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
4626 // make chain of links connected via continues faces
4629 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
4631 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
4633 vector< TChain > chains;
4634 if ( error == ERR_OK ) { // chain contains continues rectangles
4636 chains[0].splice( chains[0].begin(), rawChain );
4638 else if ( error == ERR_TRI ) { // chain contains continues triangles
4639 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
4640 if ( res != _OK ) { // not quadrangles split into triangles
4641 fixTriaNearBoundary( rawChain, *this );
4645 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
4646 fixPrism( rawChain );
4652 for ( int iC = 0; iC < chains.size(); ++iC )
4654 TChain& chain = chains[iC];
4655 if ( chain.empty() ) continue;
4656 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
4657 MSG("3D straight - ignore");
4660 if ( chain.front()->MediumPos() > bndPos ||
4661 chain.back() ->MediumPos() > bndPos ) {
4662 MSG("Internal chain - ignore");
4665 // mesure chain length and compute link position along the chain
4666 double chainLen = 0;
4667 vector< double > linkPos;
4668 MSGBEG( "Link medium nodes: ");
4669 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
4670 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
4671 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
4672 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4673 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
4674 link1 = chain.erase( link1 );
4675 if ( link1 == chain.end() )
4677 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4680 linkPos.push_back( chainLen );
4683 if ( linkPos.size() < 2 )
4686 gp_Vec move0 = chain.front()->_nodeMove;
4687 gp_Vec move1 = chain.back ()->_nodeMove;
4692 // compute node displacement of end links of chain in parametric space of face
4693 TChainLink& linkOnFace = *(++chain.begin());
4694 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
4695 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
4696 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
4698 face = TopoDS::Face( f );
4699 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
4701 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
4703 TChainLink& link = is1 ? chain.back() : chain.front();
4704 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
4705 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
4706 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
4707 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4708 // uvMove = uvm - uv12
4709 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
4710 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
4711 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
4712 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
4713 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
4714 10 * uvMove.SquareModulus());
4716 if ( isStraight[0] && isStraight[1] ) {
4717 MSG("2D straight - ignore");
4718 continue; // straight - no need to move nodes of internal links
4721 // check if a chain is already fixed
4722 gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
4723 gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
4724 gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
4725 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4726 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
4728 MSG("Already fixed - ignore");
4734 if ( isInside || face.IsNull() )
4736 // compute node displacement of end links in their local coord systems
4738 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
4739 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
4740 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4741 move0.Transform(trsf);
4744 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
4745 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
4746 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4747 move1.Transform(trsf);
4750 // compute displacement of medium nodes
4751 link2 = chain.begin();
4754 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
4756 double r = linkPos[i] / chainLen;
4757 // displacement in local coord system
4758 gp_Vec move = (1. - r) * move0 + r * move1;
4759 if ( isInside || face.IsNull()) {
4760 // transform to global
4761 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
4762 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
4763 gp_Vec x = x01.Normalized() + x12.Normalized();
4764 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
4765 move.Transform(trsf);
4768 // compute 3D displacement by 2D one
4769 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
4770 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
4771 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
4772 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
4773 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
4774 if ( SMDS_FacePosition* nPos =
4775 dynamic_cast< SMDS_FacePosition* >((*link1)->_mediumNode->GetPosition()))
4776 nPos->SetParameters( newUV.X(), newUV.Y() );
4778 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
4779 move.SquareMagnitude())
4781 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
4782 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
4783 MSG( "TOO LONG MOVE \t" <<
4784 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
4785 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
4786 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
4787 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
4791 (*link1)->Move( move );
4792 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
4793 << chain.front()->_mediumNode->GetID() <<"-"
4794 << chain.back ()->_mediumNode->GetID() <<
4795 " by " << move.Magnitude());
4797 } // loop on chains of links
4798 } // loop on 2 directions of propagation from quadrangle
4800 } // fix faces and/or volumes
4805 TIDSortedElemSet biQuadQuas, biQuadTris, triQuadHexa;
4806 const SMDS_MeshElement *biQuadQua, *triQuadHex;
4807 const bool toFixCentralNodes = ( myMesh->NbBiQuadQuadrangles() +
4808 myMesh->NbBiQuadTriangles() +
4809 myMesh->NbTriQuadraticHexas() );
4811 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
4812 if ( pLink->IsMoved() )
4814 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
4815 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
4817 // collect bi-quadratic elements
4818 if ( toFixCentralNodes )
4820 biQuadQua = triQuadHex = 0;
4821 SMDS_ElemIteratorPtr eIt = pLink->_mediumNode->GetInverseElementIterator();
4822 while ( eIt->more() )
4824 const SMDS_MeshElement* e = eIt->next();
4825 switch( e->GetEntityType() ) {
4826 case SMDSEntity_BiQuad_Quadrangle: biQuadQuas.insert( e ); break;
4827 case SMDSEntity_BiQuad_Triangle: biQuadTris.insert( e ); break;
4828 case SMDSEntity_TriQuad_Hexa: triQuadHexa.insert( e ); break;
4835 // Fix positions of central nodes of bi-tri-quadratic elements
4837 // treat bi-quad quadrangles
4839 vector< const SMDS_MeshNode* > nodes( 9 );
4841 TIDSortedElemSet::iterator quadIt = biQuadQuas.begin();
4842 for ( ; quadIt != biQuadQuas.end(); ++quadIt )
4844 const SMDS_MeshElement* quad = *quadIt;
4847 nodes.assign( quad->begin_nodes(), quad->end_nodes() );
4849 TopoDS_Shape S = GetSubShapeByNode( nodes.back(), GetMeshDS() );
4850 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4851 const TopoDS_Face& F = TopoDS::Face( S );
4852 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4853 const double tol = BRep_Tool::Tolerance( F );
4855 for ( int i = 0; i < 8; ++i )
4857 uv[ i ] = GetNodeUV( F, nodes[i], nodes[8], &checkUV );
4858 // as this method is used after mesh generation, UV of nodes is not
4859 // updated according to bending links, so we update
4860 if ( i > 3 && nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4861 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4863 // move the central node
4864 gp_XY uvCent = calcTFI (0.5, 0.5, uv[0],uv[1],uv[2],uv[3],uv[4],uv[5],uv[6],uv[7] );
4865 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4866 GetMeshDS()->MoveNode( nodes[8], p.X(), p.Y(), p.Z());
4870 // treat bi-quad triangles
4872 vector< const SMDS_MeshNode* > nodes;
4874 TIDSortedElemSet::iterator triIt = biQuadTris.begin();
4875 for ( ; triIt != biQuadTris.end(); ++triIt )
4877 const SMDS_MeshElement* tria = *triIt;
4879 const TopoDS_Shape& S = GetMeshDS()->IndexToShape( tria->getshapeId() );
4880 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4881 const TopoDS_Face& F = TopoDS::Face( S );
4882 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4883 const double tol = BRep_Tool::Tolerance( F );
4886 nodes.assign( tria->begin_nodes(), tria->end_nodes() );
4888 for ( int i = 0; i < 6; ++i )
4890 uv[ i ] = GetNodeUV( F, nodes[i], nodes[(i+1)%3], &checkUV );
4891 // as this method is used after mesh generation, UV of nodes is not
4892 // updated according to bending links, so we update
4893 if ( nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4894 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4896 // move the central node
4897 gp_XY uvCent = GetCenterUV( uv[0], uv[1], uv[2], uv[3], uv[4], uv[5] );
4898 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4899 GetMeshDS()->MoveNode( tria->GetNode(6), p.X(), p.Y(), p.Z() );
4903 // treat tri-quadratic hexahedra
4905 SMDS_VolumeTool volExp;
4906 TIDSortedElemSet::iterator hexIt = triQuadHexa.begin();
4907 for ( ; hexIt != triQuadHexa.end(); ++hexIt )
4909 volExp.Set( *hexIt, /*ignoreCentralNodes=*/false );
4911 // fix nodes central in sides
4912 for ( int iQuad = 0; iQuad < volExp.NbFaces(); ++iQuad )
4914 const SMDS_MeshNode** quadNodes = volExp.GetFaceNodes( iQuad );
4915 if ( quadNodes[8]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
4917 gp_XYZ p = calcTFI( 0.5, 0.5,
4918 SMESH_TNodeXYZ( quadNodes[0] ), SMESH_TNodeXYZ( quadNodes[2] ),
4919 SMESH_TNodeXYZ( quadNodes[4] ), SMESH_TNodeXYZ( quadNodes[6] ),
4920 SMESH_TNodeXYZ( quadNodes[1] ), SMESH_TNodeXYZ( quadNodes[3] ),
4921 SMESH_TNodeXYZ( quadNodes[5] ), SMESH_TNodeXYZ( quadNodes[7] ));
4922 GetMeshDS()->MoveNode( quadNodes[8], p.X(), p.Y(), p.Z());
4926 // fix the volume central node
4927 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
4928 const SMDS_MeshNode** hexNodes = volExp.GetNodes();
4930 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( hexNodes[ 0 ] );
4931 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( hexNodes[ 3 ] );
4932 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( hexNodes[ 1 ] );
4933 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( hexNodes[ 2 ] );
4934 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( hexNodes[ 4 ] );
4935 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( hexNodes[ 7 ] );
4936 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( hexNodes[ 5 ] );
4937 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( hexNodes[ 6 ] );
4939 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( hexNodes[ 11 ] );
4940 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( hexNodes[ 9 ] );
4941 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( hexNodes[ 8 ] );
4942 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( hexNodes[ 10 ] );
4943 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( hexNodes[ 15 ] );
4944 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( hexNodes[ 13 ] );
4945 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( hexNodes[ 12 ] );
4946 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( hexNodes[ 14 ] );
4947 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( hexNodes[ 16 ] );
4948 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( hexNodes[ 19 ] );
4949 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( hexNodes[ 17 ] );
4950 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( hexNodes[ 18 ] );
4952 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( hexNodes[ 20 ] );
4953 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( hexNodes[ 25 ] );
4954 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( hexNodes[ 21 ] );
4955 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( hexNodes[ 23 ] );
4956 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( hexNodes[ 24 ] );
4957 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( hexNodes[ 22 ] );
4959 gp_XYZ nCenterParams(0.5, 0.5, 0.5), nCenterCoords;
4960 SMESH_Block::ShellPoint( nCenterParams, pointsOnShapes, nCenterCoords );
4961 GetMeshDS()->MoveNode( hexNodes[26],
4962 nCenterCoords.X(), nCenterCoords.Y(), nCenterCoords.Z());