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();
257 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
259 // look for a "seam" edge, actually an edge on period boundary
260 const TopoDS_Edge& edge = TopoDS::Edge( exp.Current() );
263 bool isSeam = BRep_Tool::IsClosed( edge, face );
267 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
268 const double du = Abs( uv1.Coord(1) - uv2.Coord(1) );
269 const double dv = Abs( uv1.Coord(2) - uv2.Coord(2) );
270 if ( du < Precision::PConfusion() )
272 isSeam = ( Abs( uv1.Coord(1) - myPar1[0] ) < Precision::PConfusion() ||
273 Abs( uv1.Coord(1) - myPar2[0] ) < Precision::PConfusion() );
275 else if ( dv < Precision::PConfusion() )
277 isSeam = ( Abs( uv1.Coord(2) - myPar1[1] ) < Precision::PConfusion() ||
278 Abs( uv1.Coord(2) - myPar2[1] ) < Precision::PConfusion() );
283 // store seam shape indices, negative if shape encounters twice
284 int edgeID = meshDS->ShapeToIndex( edge );
285 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
286 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
287 int vertexID = meshDS->ShapeToIndex( v.Current() );
288 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
292 // look for a degenerated edge
293 if ( SMESH_Algo::isDegenerated( edge )) {
294 myDegenShapeIds.insert( meshDS->ShapeToIndex( edge ));
295 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
296 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
302 //=======================================================================
303 //function : GetNodeUVneedInFaceNode
304 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
305 // Return true if the face is periodic.
306 // If F is Null, answer about sub-shape set through IsQuadraticSubMesh() or
308 //=======================================================================
310 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
312 if ( F.IsNull() ) return !mySeamShapeIds.empty();
314 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
315 return !mySeamShapeIds.empty();
318 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
319 if ( !aSurface.IsNull() )
320 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
325 //=======================================================================
326 //function : IsMedium
328 //=======================================================================
330 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
331 const SMDSAbs_ElementType typeToCheck)
333 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
336 //=======================================================================
337 //function : GetSubShapeByNode
338 //purpose : Return support shape of a node
339 //=======================================================================
341 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
342 const SMESHDS_Mesh* meshDS)
344 int shapeID = node ? node->getshapeId() : 0;
345 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
346 return meshDS->IndexToShape( shapeID );
348 return TopoDS_Shape();
352 //=======================================================================
353 //function : AddTLinkNode
354 //purpose : add a link in my data structure
355 //=======================================================================
357 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
358 const SMDS_MeshNode* n2,
359 const SMDS_MeshNode* n12)
361 // add new record to map
362 SMESH_TLink link( n1, n2 );
363 myTLinkNodeMap.insert( make_pair(link,n12));
366 //================================================================================
368 * \brief Add quadratic links of edge to own data structure
370 //================================================================================
372 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
374 if ( edge && edge->IsQuadratic() )
375 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
381 //================================================================================
383 * \brief Add quadratic links of face to own data structure
385 //================================================================================
387 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
391 switch ( f->NbNodes() ) {
393 // myMapWithCentralNode.insert
394 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2) ),
396 // break; -- add medium nodes as well
398 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
399 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
400 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
403 // myMapWithCentralNode.insert
404 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2),f->GetNode(3) ),
406 // break; -- add medium nodes as well
408 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
409 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
410 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
411 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7)); break;
418 //================================================================================
420 * \brief Add quadratic links of volume to own data structure
422 //================================================================================
424 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
426 if ( volume->IsQuadratic() )
428 SMDS_VolumeTool vTool( volume );
429 const SMDS_MeshNode** nodes = vTool.GetNodes();
431 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
433 const int nbN = vTool.NbFaceNodes( iF );
434 const int* iNodes = vTool.GetFaceNodesIndices( iF );
435 for ( int i = 0; i < nbN; )
437 int iN1 = iNodes[i++];
438 int iN12 = iNodes[i++];
440 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
441 int linkID = iN1 * vTool.NbNodes() + iN2;
442 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
443 if ( it_isNew.second )
444 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
446 addedLinks.erase( it_isNew.first ); // each link encounters only twice
448 if ( vTool.NbNodes() == 27 )
450 const SMDS_MeshNode* nFCenter = nodes[ vTool.GetCenterNodeIndex( iF )];
451 if ( nFCenter->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
452 myMapWithCentralNode.insert
453 ( make_pair( TBiQuad( nodes[ iNodes[0]], nodes[ iNodes[1]],
454 nodes[ iNodes[2]], nodes[ iNodes[3]] ),
463 //================================================================================
465 * \brief Return true if position of nodes on the shape hasn't yet been checked or
466 * the positions proved to be invalid
468 //================================================================================
470 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
472 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
473 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
476 //================================================================================
478 * \brief Set validity of positions of nodes on the shape.
479 * Once set, validity is not changed
481 //================================================================================
483 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
485 std::map< int,bool >::iterator sh_ok =
486 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok)).first;
491 //=======================================================================
492 //function : ToFixNodeParameters
493 //purpose : Enables fixing node parameters on EDGEs and FACEs in
494 // GetNodeU(...,check=true), GetNodeUV(...,check=true), CheckNodeUV() and
495 // CheckNodeU() in case if a node lies on a shape set via SetSubShape().
497 //=======================================================================
499 void SMESH_MesherHelper::ToFixNodeParameters(bool toFix)
501 myFixNodeParameters = toFix;
505 //=======================================================================
506 //function : GetUVOnSeam
507 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
508 //=======================================================================
510 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
512 gp_Pnt2d result = uv1;
513 for ( int i = U_periodic; i <= V_periodic ; ++i )
515 if ( myParIndex & i )
517 double p1 = uv1.Coord( i );
518 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
519 if ( myParIndex == i ||
520 dp1 < ( myPar2[i-1] - myPar1[i-1] ) / 100. ||
521 dp2 < ( myPar2[i-1] - myPar1[i-1] ) / 100. )
523 double p2 = uv2.Coord( i );
524 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
525 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
526 result.SetCoord( i, p1Alt );
533 //=======================================================================
534 //function : GetNodeUV
535 //purpose : Return node UV on face
536 //=======================================================================
538 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
539 const SMDS_MeshNode* n,
540 const SMDS_MeshNode* n2,
543 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
545 const SMDS_PositionPtr Pos = n->GetPosition();
547 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
549 // node has position on face
550 const SMDS_FacePosition* fpos =
551 static_cast<const SMDS_FacePosition*>( Pos );
552 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
554 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
556 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
558 // node has position on edge => it is needed to find
559 // corresponding edge from face, get pcurve for this
560 // edge and retrieve value from this pcurve
561 const SMDS_EdgePosition* epos =
562 static_cast<const SMDS_EdgePosition*>( Pos );
563 int edgeID = n->getshapeId();
564 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
565 double f, l, u = epos->GetUParameter();
566 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
567 bool validU = ( f < u && u < l );
569 uv = C2d->Value( u );
571 uv.SetCoord( Precision::Infinite(),0.);
572 if ( check || !validU )
573 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ),/*force=*/ !validU );
575 // for a node on a seam edge select one of UVs on 2 pcurves
576 if ( n2 && IsSeamShape( edgeID ) )
578 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
581 { // adjust uv to period
583 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
584 Standard_Boolean isUPeriodic = S->IsUPeriodic();
585 Standard_Boolean isVPeriodic = S->IsVPeriodic();
587 if ( isUPeriodic || isVPeriodic ) {
588 Standard_Real UF,UL,VF,VL;
589 S->Bounds(UF,UL,VF,VL);
591 newUV.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
593 newUV.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
597 gp_Pnt2d uv2 = GetNodeUV( F, n2, 0, check );
598 if ( isUPeriodic && Abs( uv.X()-uv2.X() ) < Abs( newUV.X()-uv2.X() ))
599 newUV.SetX( uv.X() );
600 if ( isVPeriodic && Abs( uv.Y()-uv2.Y() ) < Abs( newUV.Y()-uv2.Y() ))
601 newUV.SetY( uv.Y() );
606 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
608 if ( int vertexID = n->getshapeId() ) {
609 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
611 uv = BRep_Tool::Parameters( V, F );
614 catch (Standard_Failure& exc) {
617 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
618 uvOK = ( V == vert.Current() );
620 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
621 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
622 // get UV of a vertex closest to the node
624 gp_Pnt pn = XYZ( n );
625 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
626 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
627 gp_Pnt p = BRep_Tool::Pnt( curV );
628 double curDist = p.SquareDistance( pn );
629 if ( curDist < dist ) {
631 uv = BRep_Tool::Parameters( curV, F );
632 uvOK = ( dist < DBL_MIN );
638 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
639 for ( ; it.More(); it.Next() ) {
640 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
641 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
643 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
644 if ( !C2d.IsNull() ) {
645 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
646 uv = C2d->Value( u );
654 if ( n2 && IsSeamShape( vertexID ) )
655 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
660 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
669 //=======================================================================
670 //function : CheckNodeUV
671 //purpose : Check and fix node UV on a face
672 //=======================================================================
674 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
675 const SMDS_MeshNode* n,
679 double distXYZ[4]) const
681 int shapeID = n->getshapeId();
682 bool infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ));
683 bool zero = ( uv.X() == 0. && uv.Y() == 0. );
684 if ( force || toCheckPosOnShape( shapeID ) || infinit || zero )
686 // check that uv is correct
688 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
689 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
691 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
693 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
695 setPosOnShapeValidity( shapeID, false );
696 if ( !infinit && distXYZ ) {
697 surfPnt.Transform( loc );
699 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
701 // uv incorrect, project the node to surface
702 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
703 projector.Perform( nodePnt );
704 if ( !projector.IsDone() || projector.NbPoints() < 1 )
706 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
709 Quantity_Parameter U,V;
710 projector.LowerDistanceParameters(U,V);
712 surfPnt = surface->Value( U, V );
713 dist = nodePnt.Distance( surfPnt );
715 surfPnt.Transform( loc );
717 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
721 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
724 // store the fixed UV on the face
725 if ( myShape.IsSame(F) && shapeID == myShapeID && myFixNodeParameters )
726 const_cast<SMDS_MeshNode*>(n)->SetPosition
727 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
729 else if ( uv.Modulus() > numeric_limits<double>::min() )
731 setPosOnShapeValidity( shapeID, true );
737 //=======================================================================
738 //function : GetProjector
739 //purpose : Return projector intitialized by given face without location, which is returned
740 //=======================================================================
742 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
743 TopLoc_Location& loc,
746 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
747 int faceID = GetMeshDS()->ShapeToIndex( F );
748 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
749 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
750 if ( i_proj == i2proj.end() )
752 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
753 double U1, U2, V1, V2;
754 surface->Bounds(U1, U2, V1, V2);
755 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
756 proj->Init( surface, U1, U2, V1, V2, tol );
757 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
759 return *( i_proj->second );
764 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
765 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
766 gp_XY_FunPtr(Subtracted);
769 //=======================================================================
770 //function : applyIn2D
771 //purpose : Perform given operation on two 2d points in parameric space of given surface.
772 // It takes into account period of the surface. Use gp_XY_FunPtr macro
773 // to easily define pointer to function of gp_XY class.
774 //=======================================================================
776 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
780 const bool resultInPeriod)
782 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
783 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
784 if ( !isUPeriodic && !isVPeriodic )
787 // move uv2 not far than half-period from uv1
789 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
791 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
794 gp_XY res = fun( uv1, gp_XY(u2,v2) );
796 // move result within period
797 if ( resultInPeriod )
799 Standard_Real UF,UL,VF,VL;
800 surface->Bounds(UF,UL,VF,VL);
802 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
804 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
809 //=======================================================================
810 //function : GetMiddleUV
811 //purpose : Return middle UV taking in account surface period
812 //=======================================================================
814 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
819 // the proper place of getting basic surface seems to be in applyIn2D()
820 // but we put it here to decrease a risk of regressions just before releasing a version
821 Handle(Geom_Surface) surf = surface;
822 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
823 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
825 return applyIn2D( surf, p1, p2, & AverageUV );
828 //=======================================================================
829 //function : GetCenterUV
830 //purpose : Return UV for the central node of a biquadratic triangle
831 //=======================================================================
833 gp_XY SMESH_MesherHelper::GetCenterUV(const gp_XY& uv1,
839 bool * isBadTria/*=0*/)
842 gp_XY uvAvg = ( uv12 + uv23 + uv31 ) / 3.;
844 if (( badTria = (( uvAvg - uv1 ) * ( uvAvg - uv23 ) > 0 )))
845 uvAvg = ( uv1 + uv23 ) / 2.;
846 else if (( badTria = (( uvAvg - uv2 ) * ( uvAvg - uv31 ) > 0 )))
847 uvAvg = ( uv2 + uv31 ) / 2.;
848 else if (( badTria = (( uvAvg - uv3 ) * ( uvAvg - uv12 ) > 0 )))
849 uvAvg = ( uv3 + uv12 ) / 2.;
852 *isBadTria = badTria;
856 //=======================================================================
857 //function : GetNodeU
858 //purpose : Return node U on edge
859 //=======================================================================
861 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
862 const SMDS_MeshNode* n,
863 const SMDS_MeshNode* inEdgeNode,
866 double param = Precision::Infinite();
868 const SMDS_PositionPtr pos = n->GetPosition();
869 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
871 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
872 param = epos->GetUParameter();
874 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
876 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
879 BRep_Tool::Range( E, f,l );
880 double uInEdge = GetNodeU( E, inEdgeNode );
881 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
885 SMESHDS_Mesh * meshDS = GetMeshDS();
886 int vertexID = n->getshapeId();
887 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
888 param = BRep_Tool::Parameter( V, E );
893 double tol = BRep_Tool::Tolerance( E );
894 double f,l; BRep_Tool::Range( E, f,l );
895 bool force = ( param < f-tol || param > l+tol );
896 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
897 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
899 *check = CheckNodeU( E, n, param, 2*tol, force );
904 //=======================================================================
905 //function : CheckNodeU
906 //purpose : Check and fix node U on an edge
907 // Return false if U is bad and could not be fixed
908 //=======================================================================
910 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
911 const SMDS_MeshNode* n,
915 double distXYZ[4]) const
917 int shapeID = n->getshapeId();
918 bool infinit = Precision::IsInfinite( u );
919 bool zero = ( u == 0. );
920 if ( force || toCheckPosOnShape( shapeID ) || infinit || zero )
922 TopLoc_Location loc; double f,l;
923 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
924 if ( curve.IsNull() ) // degenerated edge
926 if ( u+tol < f || u-tol > l )
928 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
934 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
935 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
940 curvPnt = curve->Value( u );
941 dist = nodePnt.Distance( curvPnt );
943 curvPnt.Transform( loc );
945 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
950 setPosOnShapeValidity( shapeID, false );
951 // u incorrect, project the node to the curve
952 int edgeID = GetMeshDS()->ShapeToIndex( E );
953 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
954 TID2ProjectorOnCurve::iterator i_proj =
955 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
956 if ( !i_proj->second )
958 i_proj->second = new GeomAPI_ProjectPointOnCurve();
959 i_proj->second->Init( curve, f, l );
961 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
962 projector->Perform( nodePnt );
963 if ( projector->NbPoints() < 1 )
965 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
968 Quantity_Parameter U = projector->LowerDistanceParameter();
970 MESSAGE(" f " << f << " l " << l << " u " << u);
971 curvPnt = curve->Value( u );
972 dist = nodePnt.Distance( curvPnt );
974 curvPnt.Transform( loc );
976 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
980 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
981 MESSAGE("distance " << dist << " " << tol );
984 // store the fixed U on the edge
985 if ( myShape.IsSame(E) && shapeID == myShapeID && myFixNodeParameters )
986 const_cast<SMDS_MeshNode*>(n)->SetPosition
987 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
989 else if ( fabs( u ) > numeric_limits<double>::min() )
991 setPosOnShapeValidity( shapeID, true );
993 if (( u < f-tol || u > l+tol ) && force )
995 MESSAGE("u < f-tol || u > l+tol ; u " << u << " f " << f << " l " << l);
996 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
999 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
1000 double period = curve->Period();
1001 u = ( u < f ) ? u + period : u - period;
1003 catch (Standard_Failure& exc)
1013 //=======================================================================
1014 //function : GetMediumPos
1015 //purpose : Return index and type of the shape (EDGE or FACE only) to
1016 // set a medium node on
1017 //param : useCurSubShape - if true, returns the shape set via SetSubShape()
1019 //=======================================================================
1021 std::pair<int, TopAbs_ShapeEnum>
1022 SMESH_MesherHelper::GetMediumPos(const SMDS_MeshNode* n1,
1023 const SMDS_MeshNode* n2,
1024 const bool useCurSubShape)
1026 if ( useCurSubShape && !myShape.IsNull() )
1027 return std::make_pair( myShapeID, myShape.ShapeType() );
1029 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1033 if (( myShapeID == n1->getshapeId() || myShapeID == n2->getshapeId() ) && myShapeID > 0 )
1035 shapeType = myShape.ShapeType();
1036 shapeID = myShapeID;
1038 else if ( n1->getshapeId() == n2->getshapeId() )
1040 shapeID = n2->getshapeId();
1041 shape = GetSubShapeByNode( n1, GetMeshDS() );
1045 const SMDS_TypeOfPosition Pos1 = n1->GetPosition()->GetTypeOfPosition();
1046 const SMDS_TypeOfPosition Pos2 = n2->GetPosition()->GetTypeOfPosition();
1048 if ( Pos1 == SMDS_TOP_3DSPACE || Pos2 == SMDS_TOP_3DSPACE )
1051 else if ( Pos1 == SMDS_TOP_FACE || Pos2 == SMDS_TOP_FACE )
1053 if ( Pos1 != SMDS_TOP_FACE || Pos2 != SMDS_TOP_FACE )
1055 if ( Pos1 != SMDS_TOP_FACE ) std::swap( n1,n2 );
1056 TopoDS_Shape F = GetSubShapeByNode( n1, GetMeshDS() );
1057 TopoDS_Shape S = GetSubShapeByNode( n2, GetMeshDS() );
1058 if ( IsSubShape( S, F ))
1060 shapeType = TopAbs_FACE;
1061 shapeID = n1->getshapeId();
1065 else if ( Pos1 == SMDS_TOP_EDGE && Pos2 == SMDS_TOP_EDGE )
1067 TopoDS_Shape E1 = GetSubShapeByNode( n1, GetMeshDS() );
1068 TopoDS_Shape E2 = GetSubShapeByNode( n2, GetMeshDS() );
1069 shape = GetCommonAncestor( E1, E2, *myMesh, TopAbs_FACE );
1071 else if ( Pos1 == SMDS_TOP_VERTEX && Pos2 == SMDS_TOP_VERTEX )
1073 TopoDS_Shape V1 = GetSubShapeByNode( n1, GetMeshDS() );
1074 TopoDS_Shape V2 = GetSubShapeByNode( n2, GetMeshDS() );
1075 shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_EDGE );
1076 if ( shape.IsNull() ) shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_FACE );
1078 else // VERTEX and EDGE
1080 if ( Pos1 != SMDS_TOP_VERTEX ) std::swap( n1,n2 );
1081 TopoDS_Shape V = GetSubShapeByNode( n1, GetMeshDS() );
1082 TopoDS_Shape E = GetSubShapeByNode( n2, GetMeshDS() );
1083 if ( IsSubShape( V, E ))
1086 shape = GetCommonAncestor( V, E, *myMesh, TopAbs_FACE );
1090 if ( !shape.IsNull() )
1093 shapeID = GetMeshDS()->ShapeToIndex( shape );
1094 shapeType = shape.ShapeType();
1096 return make_pair( shapeID, shapeType );
1099 //=======================================================================
1100 //function : GetCentralNode
1101 //purpose : Return existing or create a new central node for a quardilateral
1102 // quadratic face given its 8 nodes.
1103 //@param : force3d - true means node creation in between the given nodes,
1104 // else node position is found on a geometrical face if any.
1105 //=======================================================================
1107 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1108 const SMDS_MeshNode* n2,
1109 const SMDS_MeshNode* n3,
1110 const SMDS_MeshNode* n4,
1111 const SMDS_MeshNode* n12,
1112 const SMDS_MeshNode* n23,
1113 const SMDS_MeshNode* n34,
1114 const SMDS_MeshNode* n41,
1117 SMDS_MeshNode *centralNode = 0; // central node to return
1119 // Find an existing central node
1121 TBiQuad keyOfMap(n1,n2,n3,n4);
1122 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1123 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1124 if ( itMapCentralNode != myMapWithCentralNode.end() )
1126 return (*itMapCentralNode).second;
1129 // Get type of shape for the new central node
1131 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1135 TopTools_ListIteratorOfListOfShape it;
1137 std::map< int, int > faceId2nbNodes;
1138 std::map< int, int > ::iterator itMapWithIdFace;
1140 SMESHDS_Mesh* meshDS = GetMeshDS();
1142 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1143 // on sub-shapes of the FACE
1144 if ( GetMesh()->HasShapeToMesh() )
1146 const SMDS_MeshNode* nodes[] = { n1, n2, n3, n4 };
1147 for(int i = 0; i < 4; i++)
1149 shape = GetSubShapeByNode( nodes[i], meshDS );
1150 if ( shape.IsNull() ) break;
1151 if ( shape.ShapeType() == TopAbs_SOLID )
1153 solidID = nodes[i]->getshapeId();
1154 shapeType = TopAbs_SOLID;
1157 if ( shape.ShapeType() == TopAbs_FACE )
1159 faceID = nodes[i]->getshapeId();
1160 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1161 itMapWithIdFace->second++;
1165 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1166 while ( const TopoDS_Shape* face = it->next() )
1168 faceID = meshDS->ShapeToIndex( *face );
1169 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1170 itMapWithIdFace->second++;
1175 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1177 // find ID of the FACE the four corner nodes belong to
1178 itMapWithIdFace = faceId2nbNodes.begin();
1179 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1181 if ( itMapWithIdFace->second == 4 )
1183 shapeType = TopAbs_FACE;
1184 faceID = (*itMapWithIdFace).first;
1191 if ( shapeType == TopAbs_FACE )
1193 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1200 bool toCheck = true;
1201 if ( !F.IsNull() && !force3d )
1203 uvAvg = calcTFI (0.5, 0.5,
1204 GetNodeUV(F,n1,n3,&toCheck), GetNodeUV(F,n2,n4,&toCheck),
1205 GetNodeUV(F,n3,n1,&toCheck), GetNodeUV(F,n4,n2,&toCheck),
1206 GetNodeUV(F,n12,n3), GetNodeUV(F,n23,n4),
1207 GetNodeUV(F,n34,n2), GetNodeUV(F,n41,n2));
1208 TopLoc_Location loc;
1209 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1210 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1211 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1212 // if ( mySetElemOnShape ) node is not elem!
1213 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1215 else // ( force3d || F.IsNull() )
1217 P = calcTFI (0.5, 0.5,
1218 SMESH_TNodeXYZ(n1), SMESH_TNodeXYZ(n2),
1219 SMESH_TNodeXYZ(n3), SMESH_TNodeXYZ(n4),
1220 SMESH_TNodeXYZ(n12), SMESH_TNodeXYZ(n23),
1221 SMESH_TNodeXYZ(n34), SMESH_TNodeXYZ(n41));
1222 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1224 if ( !F.IsNull() ) // force3d
1226 uvAvg = (GetNodeUV(F,n1,n3,&toCheck) +
1227 GetNodeUV(F,n2,n4,&toCheck) +
1228 GetNodeUV(F,n3,n1,&toCheck) +
1229 GetNodeUV(F,n4,n2,&toCheck)) / 4;
1230 //CheckNodeUV( F, centralNode, uvAvg, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1231 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1233 else if ( solidID > 0 )
1235 meshDS->SetNodeInVolume( centralNode, solidID );
1237 else if ( myShapeID > 0 && mySetElemOnShape )
1239 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1242 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1246 //=======================================================================
1247 //function : GetCentralNode
1248 //purpose : Return existing or create a new central node for a
1249 // quadratic triangle given its 6 nodes.
1250 //@param : force3d - true means node creation in between the given nodes,
1251 // else node position is found on a geometrical face if any.
1252 //=======================================================================
1254 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1255 const SMDS_MeshNode* n2,
1256 const SMDS_MeshNode* n3,
1257 const SMDS_MeshNode* n12,
1258 const SMDS_MeshNode* n23,
1259 const SMDS_MeshNode* n31,
1262 SMDS_MeshNode *centralNode = 0; // central node to return
1264 // Find an existing central node
1266 TBiQuad keyOfMap(n1,n2,n3);
1267 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1268 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1269 if ( itMapCentralNode != myMapWithCentralNode.end() )
1271 return (*itMapCentralNode).second;
1274 // Get type of shape for the new central node
1276 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1280 TopTools_ListIteratorOfListOfShape it;
1282 std::map< int, int > faceId2nbNodes;
1283 std::map< int, int > ::iterator itMapWithIdFace;
1285 SMESHDS_Mesh* meshDS = GetMeshDS();
1287 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1288 // on sub-shapes of the FACE
1289 if ( GetMesh()->HasShapeToMesh() )
1291 const SMDS_MeshNode* nodes[] = { n1, n2, n3 };
1292 for(int i = 0; i < 3; i++)
1294 shape = GetSubShapeByNode( nodes[i], meshDS );
1295 if ( shape.IsNull() ) break;
1296 if ( shape.ShapeType() == TopAbs_SOLID )
1298 solidID = nodes[i]->getshapeId();
1299 shapeType = TopAbs_SOLID;
1302 if ( shape.ShapeType() == TopAbs_FACE )
1304 faceID = nodes[i]->getshapeId();
1305 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1306 itMapWithIdFace->second++;
1310 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1311 while ( const TopoDS_Shape* face = it->next() )
1313 faceID = meshDS->ShapeToIndex( *face );
1314 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1315 itMapWithIdFace->second++;
1320 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1322 // find ID of the FACE the four corner nodes belong to
1323 itMapWithIdFace = faceId2nbNodes.begin();
1324 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1326 if ( itMapWithIdFace->second == 3 )
1328 shapeType = TopAbs_FACE;
1329 faceID = (*itMapWithIdFace).first;
1339 if ( shapeType == TopAbs_FACE )
1341 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1343 gp_XY uv1 = GetNodeUV( F, n1, n23, &check );
1344 gp_XY uv2 = GetNodeUV( F, n2, n31, &check );
1345 gp_XY uv3 = GetNodeUV( F, n3, n12, &check );
1346 gp_XY uv12 = GetNodeUV( F, n12, n3, &check );
1347 gp_XY uv23 = GetNodeUV( F, n23, n1, &check );
1348 gp_XY uv31 = GetNodeUV( F, n31, n2, &check );
1349 uvAvg = GetCenterUV( uv1,uv2,uv3, uv12,uv23,uv31, &badTria );
1354 // Create a central node
1357 if ( !F.IsNull() && !force3d )
1359 TopLoc_Location loc;
1360 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1361 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1362 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1363 // if ( mySetElemOnShape ) node is not elem!
1364 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1366 else // ( force3d || F.IsNull() )
1368 P = ( SMESH_TNodeXYZ( n12 ) +
1369 SMESH_TNodeXYZ( n23 ) +
1370 SMESH_TNodeXYZ( n31 ) ) / 3;
1371 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1373 if ( !F.IsNull() ) // force3d
1375 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1377 else if ( solidID > 0 )
1379 meshDS->SetNodeInVolume( centralNode, solidID );
1381 else if ( myShapeID > 0 && mySetElemOnShape )
1383 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1386 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1390 //=======================================================================
1391 //function : GetMediumNode
1392 //purpose : Return existing or create a new medium node between given ones
1393 //=======================================================================
1395 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
1396 const SMDS_MeshNode* n2,
1399 // Find existing node
1401 SMESH_TLink link(n1,n2);
1402 ItTLinkNode itLN = myTLinkNodeMap.find( link );
1403 if ( itLN != myTLinkNodeMap.end() ) {
1404 return (*itLN).second;
1407 // Create medium node
1410 SMESHDS_Mesh* meshDS = GetMeshDS();
1412 if ( IsSeamShape( n1->getshapeId() ))
1413 // to get a correct UV of a node on seam, the second node must have checked UV
1414 std::swap( n1, n2 );
1416 // get type of shape for the new medium node
1417 int faceID = -1, edgeID = -1;
1418 TopoDS_Edge E; double u [2];
1419 TopoDS_Face F; gp_XY uv[2];
1420 bool uvOK[2] = { false, false };
1422 pair<int, TopAbs_ShapeEnum> pos = GetMediumPos( n1, n2, mySetElemOnShape );
1423 // calling GetMediumPos() with useCurSubShape=mySetElemOnShape is OK only for the
1424 // case where the lower dim mesh is already constructed, else, nodes on EDGEs are
1425 // assigned to FACE, for example.
1427 // get positions of the given nodes on shapes
1428 if ( pos.second == TopAbs_FACE )
1430 F = TopoDS::Face(meshDS->IndexToShape( faceID = pos.first ));
1431 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
1432 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
1434 else if ( pos.second == TopAbs_EDGE )
1436 const SMDS_PositionPtr Pos1 = n1->GetPosition();
1437 const SMDS_PositionPtr Pos2 = n2->GetPosition();
1438 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1439 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1440 n1->getshapeId() != n2->getshapeId() )
1443 return getMediumNodeOnComposedWire(n1,n2,force3d);
1445 E = TopoDS::Edge(meshDS->IndexToShape( edgeID = pos.first ));
1447 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
1448 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
1450 catch ( Standard_Failure& f )
1452 // issue 22502 / a node is on VERTEX not belonging to E
1453 // issue 22568 / both nodes are on non-connected VERTEXes
1454 return getMediumNodeOnComposedWire(n1,n2,force3d);
1458 if ( !force3d & uvOK[0] && uvOK[1] )
1460 // we try to create medium node using UV parameters of
1461 // nodes, else - medium between corresponding 3d points
1464 //if ( uvOK[0] && uvOK[1] )
1466 if ( IsDegenShape( n1->getshapeId() )) {
1467 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
1468 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
1470 else if ( IsDegenShape( n2->getshapeId() )) {
1471 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
1472 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
1474 TopLoc_Location loc;
1475 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
1476 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
1477 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
1478 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1479 // if ( mySetElemOnShape ) node is not elem!
1480 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
1481 myTLinkNodeMap.insert(make_pair(link,n12));
1485 else if ( !E.IsNull() )
1488 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1491 Standard_Boolean isPeriodic = C->IsPeriodic();
1494 Standard_Real Period = C->Period();
1495 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1496 Standard_Real pmid = (u[0]+p)/2.;
1497 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1502 gp_Pnt P = C->Value( U );
1503 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1504 //if ( mySetElemOnShape ) node is not elem!
1505 meshDS->SetNodeOnEdge(n12, edgeID, U);
1506 myTLinkNodeMap.insert(make_pair(link,n12));
1513 double x = ( n1->X() + n2->X() )/2.;
1514 double y = ( n1->Y() + n2->Y() )/2.;
1515 double z = ( n1->Z() + n2->Z() )/2.;
1516 n12 = meshDS->AddNode(x,y,z);
1518 //if ( mySetElemOnShape ) node is not elem!
1522 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1523 CheckNodeUV( F, n12, UV, 2 * BRep_Tool::Tolerance( F ), /*force=*/true);
1524 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1526 else if ( !E.IsNull() )
1528 double U = ( u[0] + u[1] ) / 2.;
1529 CheckNodeU( E, n12, U, 2 * BRep_Tool::Tolerance( E ), /*force=*/true);
1530 meshDS->SetNodeOnEdge(n12, edgeID, U);
1532 else if ( myShapeID > 0 && mySetElemOnShape )
1534 meshDS->SetMeshElementOnShape(n12, myShapeID);
1538 myTLinkNodeMap.insert( make_pair( link, n12 ));
1542 //================================================================================
1544 * \brief Makes a medium node if nodes reside different edges
1546 //================================================================================
1548 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1549 const SMDS_MeshNode* n2,
1552 SMESH_TNodeXYZ p1( n1 ), p2( n2 );
1553 gp_Pnt middle = 0.5 * p1 + 0.5 * p2;
1554 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1556 // To find position on edge and 3D position for n12,
1557 // project <middle> to 2 edges and select projection most close to <middle>
1559 TopoDS_Edge bestEdge;
1560 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4], f,l;
1562 // get shapes under the nodes
1563 TopoDS_Shape shape[2];
1565 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1567 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1568 TopoDS_Shape S = GetSubShapeByNode( n, GetMeshDS() );
1570 shape[ nbShapes++ ] = S;
1573 vector< TopoDS_Shape > edges;
1574 for ( int iS = 0; iS < nbShapes; ++iS )
1576 switch ( shape[iS].ShapeType() ) {
1579 edges.push_back( shape[iS] );
1585 if ( nbShapes == 2 && iS==0 && shape[1-iS].ShapeType() == TopAbs_VERTEX )
1586 edge = GetCommonAncestor( shape[iS], shape[1-iS], *myMesh, TopAbs_EDGE );
1588 if ( edge.IsNull() )
1590 PShapeIteratorPtr eIt = GetAncestors( shape[iS], *myMesh, TopAbs_EDGE );
1591 while( const TopoDS_Shape* e = eIt->next() )
1592 edges.push_back( *e );
1598 if ( nbShapes == 1 || shape[1-iS].ShapeType() < TopAbs_EDGE )
1599 for ( TopExp_Explorer e( shape[iS], TopAbs_EDGE ); e.More(); e.Next() )
1600 edges.push_back( e.Current() );
1607 // project to get U of projection and distance from middle to projection
1608 for ( size_t iE = 0; iE < edges.size(); ++iE )
1610 const TopoDS_Edge& edge = TopoDS::Edge( edges[ iE ]);
1611 distXYZ[0] = distMiddleProj;
1613 CheckNodeU( edge, n12, testU, 2 * BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1614 if ( distXYZ[0] < distMiddleProj )
1616 distMiddleProj = distXYZ[0];
1622 // // both projections failed; set n12 on the edge of n1 with U of a common vertex
1623 // TopoDS_Vertex vCommon;
1624 // if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1625 // u = BRep_Tool::Parameter( vCommon, edges[0] );
1628 // double f,l, u0 = GetNodeU( edges[0], n1 );
1629 // BRep_Tool::Range( edges[0],f,l );
1630 // u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1633 // distMiddleProj = 0;
1636 if ( !bestEdge.IsNull() )
1638 // move n12 to position of a successfull projection
1639 //double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1640 if ( !force3d /*&& distMiddleProj > 2*tol*/ )
1642 TopLoc_Location loc;
1643 Handle(Geom_Curve) curve = BRep_Tool::Curve( bestEdge,loc,f,l );
1644 gp_Pnt p = curve->Value( u ).Transformed( loc );
1645 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1647 //if ( mySetElemOnShape ) node is not elem!
1649 int edgeID = GetMeshDS()->ShapeToIndex( bestEdge );
1650 if ( edgeID != n12->getshapeId() )
1651 GetMeshDS()->UnSetNodeOnShape( n12 );
1652 GetMeshDS()->SetNodeOnEdge(n12, edgeID, u);
1655 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1660 //=======================================================================
1661 //function : AddNode
1662 //purpose : Creates a node
1663 //=======================================================================
1665 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID,
1668 SMESHDS_Mesh * meshDS = GetMeshDS();
1669 SMDS_MeshNode* node = 0;
1671 node = meshDS->AddNodeWithID( x, y, z, ID );
1673 node = meshDS->AddNode( x, y, z );
1674 if ( mySetElemOnShape && myShapeID > 0 ) { // node is not elem ?
1675 switch ( myShape.ShapeType() ) {
1676 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1677 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1678 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID, u, v); break;
1679 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID, u); break;
1680 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1687 //=======================================================================
1688 //function : AddEdge
1689 //purpose : Creates quadratic or linear edge
1690 //=======================================================================
1692 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1693 const SMDS_MeshNode* n2,
1697 SMESHDS_Mesh * meshDS = GetMeshDS();
1699 SMDS_MeshEdge* edge = 0;
1700 if (myCreateQuadratic) {
1701 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1703 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1705 edge = meshDS->AddEdge(n1, n2, n12);
1709 edge = meshDS->AddEdgeWithID(n1, n2, id);
1711 edge = meshDS->AddEdge(n1, n2);
1714 if ( mySetElemOnShape && myShapeID > 0 )
1715 meshDS->SetMeshElementOnShape( edge, myShapeID );
1720 //=======================================================================
1721 //function : AddFace
1722 //purpose : Creates quadratic or linear triangle
1723 //=======================================================================
1725 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1726 const SMDS_MeshNode* n2,
1727 const SMDS_MeshNode* n3,
1731 SMESHDS_Mesh * meshDS = GetMeshDS();
1732 SMDS_MeshFace* elem = 0;
1734 if( n1==n2 || n2==n3 || n3==n1 )
1737 if(!myCreateQuadratic) {
1739 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1741 elem = meshDS->AddFace(n1, n2, n3);
1744 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1745 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1746 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1747 if(myCreateBiQuadratic)
1749 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n12, n23, n31, force3d);
1751 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, nCenter, id);
1753 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31, nCenter);
1758 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1760 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1763 if ( mySetElemOnShape && myShapeID > 0 )
1764 meshDS->SetMeshElementOnShape( elem, myShapeID );
1769 //=======================================================================
1770 //function : AddFace
1771 //purpose : Creates bi-quadratic, quadratic or linear quadrangle
1772 //=======================================================================
1774 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1775 const SMDS_MeshNode* n2,
1776 const SMDS_MeshNode* n3,
1777 const SMDS_MeshNode* n4,
1781 SMESHDS_Mesh * meshDS = GetMeshDS();
1782 SMDS_MeshFace* elem = 0;
1785 return AddFace(n1,n3,n4,id,force3d);
1788 return AddFace(n1,n2,n4,id,force3d);
1791 return AddFace(n1,n2,n3,id,force3d);
1794 return AddFace(n1,n2,n4,id,force3d);
1797 return AddFace(n1,n2,n3,id,force3d);
1800 return AddFace(n1,n2,n3,id,force3d);
1803 if(!myCreateQuadratic) {
1805 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1807 elem = meshDS->AddFace(n1, n2, n3, n4);
1810 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1811 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1812 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1813 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1814 if(myCreateBiQuadratic)
1816 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n4, n12, n23, n34, n41, force3d);
1818 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, nCenter, id);
1820 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41, nCenter);
1825 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1827 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1830 if ( mySetElemOnShape && myShapeID > 0 )
1831 meshDS->SetMeshElementOnShape( elem, myShapeID );
1836 //=======================================================================
1837 //function : AddPolygonalFace
1838 //purpose : Creates polygon, with additional nodes in quadratic mesh
1839 //=======================================================================
1841 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1845 SMESHDS_Mesh * meshDS = GetMeshDS();
1846 SMDS_MeshFace* elem = 0;
1848 if(!myCreateQuadratic) {
1850 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1852 elem = meshDS->AddPolygonalFace(nodes);
1855 vector<const SMDS_MeshNode*> newNodes;
1856 for ( int i = 0; i < nodes.size(); ++i )
1858 const SMDS_MeshNode* n1 = nodes[i];
1859 const SMDS_MeshNode* n2 = nodes[(i+1)%nodes.size()];
1860 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1861 newNodes.push_back( n1 );
1862 newNodes.push_back( n12 );
1865 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1867 elem = meshDS->AddPolygonalFace(newNodes);
1869 if ( mySetElemOnShape && myShapeID > 0 )
1870 meshDS->SetMeshElementOnShape( elem, myShapeID );
1875 //=======================================================================
1876 //function : AddVolume
1877 //purpose : Creates quadratic or linear prism
1878 //=======================================================================
1880 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1881 const SMDS_MeshNode* n2,
1882 const SMDS_MeshNode* n3,
1883 const SMDS_MeshNode* n4,
1884 const SMDS_MeshNode* n5,
1885 const SMDS_MeshNode* n6,
1889 SMESHDS_Mesh * meshDS = GetMeshDS();
1890 SMDS_MeshVolume* elem = 0;
1891 if(!myCreateQuadratic) {
1893 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1895 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1898 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1899 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1900 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1902 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1903 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1904 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1906 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1907 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1908 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1911 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1912 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1914 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1915 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1917 if ( mySetElemOnShape && myShapeID > 0 )
1918 meshDS->SetMeshElementOnShape( elem, myShapeID );
1923 //=======================================================================
1924 //function : AddVolume
1925 //purpose : Creates quadratic or linear tetrahedron
1926 //=======================================================================
1928 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1929 const SMDS_MeshNode* n2,
1930 const SMDS_MeshNode* n3,
1931 const SMDS_MeshNode* n4,
1935 SMESHDS_Mesh * meshDS = GetMeshDS();
1936 SMDS_MeshVolume* elem = 0;
1937 if(!myCreateQuadratic) {
1939 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1941 elem = meshDS->AddVolume(n1, n2, n3, n4);
1944 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1945 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1946 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1948 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1949 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1950 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1953 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1955 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1957 if ( mySetElemOnShape && myShapeID > 0 )
1958 meshDS->SetMeshElementOnShape( elem, myShapeID );
1963 //=======================================================================
1964 //function : AddVolume
1965 //purpose : Creates quadratic or linear pyramid
1966 //=======================================================================
1968 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1969 const SMDS_MeshNode* n2,
1970 const SMDS_MeshNode* n3,
1971 const SMDS_MeshNode* n4,
1972 const SMDS_MeshNode* n5,
1976 SMDS_MeshVolume* elem = 0;
1977 if(!myCreateQuadratic) {
1979 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1981 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1984 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1985 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1986 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1987 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1989 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1990 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1991 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
1992 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1995 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
2000 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
2002 n15, n25, n35, n45);
2004 if ( mySetElemOnShape && myShapeID > 0 )
2005 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
2010 //=======================================================================
2011 //function : AddVolume
2012 //purpose : Creates bi-quadratic, quadratic or linear hexahedron
2013 //=======================================================================
2015 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2016 const SMDS_MeshNode* n2,
2017 const SMDS_MeshNode* n3,
2018 const SMDS_MeshNode* n4,
2019 const SMDS_MeshNode* n5,
2020 const SMDS_MeshNode* n6,
2021 const SMDS_MeshNode* n7,
2022 const SMDS_MeshNode* n8,
2026 SMESHDS_Mesh * meshDS = GetMeshDS();
2027 SMDS_MeshVolume* elem = 0;
2028 if(!myCreateQuadratic) {
2030 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
2032 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
2035 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2036 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
2037 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
2038 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
2040 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
2041 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
2042 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
2043 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
2045 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
2046 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
2047 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
2048 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
2049 if(myCreateBiQuadratic)
2051 const SMDS_MeshNode* n1234 = GetCentralNode(n1,n2,n3,n4,n12,n23,n34,n41,force3d);
2052 const SMDS_MeshNode* n1256 = GetCentralNode(n1,n2,n5,n6,n12,n26,n56,n15,force3d);
2053 const SMDS_MeshNode* n2367 = GetCentralNode(n2,n3,n6,n7,n23,n37,n67,n26,force3d);
2054 const SMDS_MeshNode* n3478 = GetCentralNode(n3,n4,n7,n8,n34,n48,n78,n37,force3d);
2055 const SMDS_MeshNode* n1458 = GetCentralNode(n1,n4,n5,n8,n41,n48,n15,n85,force3d);
2056 const SMDS_MeshNode* n5678 = GetCentralNode(n5,n6,n7,n8,n56,n67,n78,n85,force3d);
2058 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
2060 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( n4 );
2061 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( n8 );
2062 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( n3 );
2063 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( n7 );
2064 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( n1 );
2065 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( n5 );
2066 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( n2 );
2067 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( n6 );
2069 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( n48 );
2070 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( n37 );
2071 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( n15 );
2072 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( n26 );
2073 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( n34 );
2074 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( n78 );
2075 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( n12 );
2076 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( n56 );
2077 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( n41 );
2078 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( n85 );
2079 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( n23 );
2080 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( n67 );
2082 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( n3478 );
2083 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( n1256 );
2084 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( n1458 );
2085 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( n2367 );
2086 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( n1234 );
2087 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( n5678 );
2089 gp_XYZ centerCube(0.5, 0.5, 0.5);
2091 SMESH_Block::ShellPoint( centerCube, pointsOnShapes, nCenterElem );
2092 const SMDS_MeshNode* nCenter =
2093 meshDS->AddNode( nCenterElem.X(), nCenterElem.Y(), nCenterElem.Z() );
2094 meshDS->SetNodeInVolume( nCenter, myShapeID );
2097 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2098 n12, n23, n34, n41, n56, n67,
2099 n78, n85, n15, n26, n37, n48,
2100 n1234, n1256, n2367, n3478, n1458, n5678, nCenter, id);
2102 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2103 n12, n23, n34, n41, n56, n67,
2104 n78, n85, n15, n26, n37, n48,
2105 n1234, n1256, n2367, n3478, n1458, n5678, nCenter);
2110 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2111 n12, n23, n34, n41, n56, n67,
2112 n78, n85, n15, n26, n37, n48, id);
2114 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2115 n12, n23, n34, n41, n56, n67,
2116 n78, n85, n15, n26, n37, n48);
2119 if ( mySetElemOnShape && myShapeID > 0 )
2120 meshDS->SetMeshElementOnShape( elem, myShapeID );
2125 //=======================================================================
2126 //function : AddVolume
2127 //purpose : Creates LINEAR!!!!!!!!! octahedron
2128 //=======================================================================
2130 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2131 const SMDS_MeshNode* n2,
2132 const SMDS_MeshNode* n3,
2133 const SMDS_MeshNode* n4,
2134 const SMDS_MeshNode* n5,
2135 const SMDS_MeshNode* n6,
2136 const SMDS_MeshNode* n7,
2137 const SMDS_MeshNode* n8,
2138 const SMDS_MeshNode* n9,
2139 const SMDS_MeshNode* n10,
2140 const SMDS_MeshNode* n11,
2141 const SMDS_MeshNode* n12,
2145 SMESHDS_Mesh * meshDS = GetMeshDS();
2146 SMDS_MeshVolume* elem = 0;
2148 elem = meshDS->AddVolumeWithID(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12,id);
2150 elem = meshDS->AddVolume(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12);
2151 if ( mySetElemOnShape && myShapeID > 0 )
2152 meshDS->SetMeshElementOnShape( elem, myShapeID );
2156 //=======================================================================
2157 //function : AddPolyhedralVolume
2158 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
2159 //=======================================================================
2162 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
2163 const std::vector<int>& quantities,
2167 SMESHDS_Mesh * meshDS = GetMeshDS();
2168 SMDS_MeshVolume* elem = 0;
2169 if(!myCreateQuadratic)
2172 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
2174 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
2178 vector<const SMDS_MeshNode*> newNodes;
2179 vector<int> newQuantities;
2180 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
2182 int nbNodesInFace = quantities[iFace];
2183 newQuantities.push_back(0);
2184 for ( int i = 0; i < nbNodesInFace; ++i )
2186 const SMDS_MeshNode* n1 = nodes[ iN + i ];
2187 newNodes.push_back( n1 );
2188 newQuantities.back()++;
2190 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
2191 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
2192 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
2194 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2195 newNodes.push_back( n12 );
2196 newQuantities.back()++;
2199 iN += nbNodesInFace;
2202 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
2204 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
2206 if ( mySetElemOnShape && myShapeID > 0 )
2207 meshDS->SetMeshElementOnShape( elem, myShapeID );
2214 //================================================================================
2216 * \brief Check if a node belongs to any face of sub-mesh
2218 //================================================================================
2220 bool isNodeInSubMesh( const SMDS_MeshNode* n, const SMESHDS_SubMesh* sm )
2222 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2223 while ( fIt->more() )
2224 if ( sm->Contains( fIt->next() ))
2230 //=======================================================================
2231 //function : IsSameElemGeometry
2232 //purpose : Returns true if all elements of a sub-mesh are of same shape
2233 //=======================================================================
2235 bool SMESH_MesherHelper::IsSameElemGeometry(const SMESHDS_SubMesh* smDS,
2236 SMDSAbs_GeometryType shape,
2237 const bool nullSubMeshRes)
2239 if ( !smDS ) return nullSubMeshRes;
2241 SMDS_ElemIteratorPtr elemIt = smDS->GetElements();
2242 while ( elemIt->more() ) {
2243 const SMDS_MeshElement* e = elemIt->next();
2244 if ( e->GetGeomType() != shape )
2250 //=======================================================================
2251 //function : LoadNodeColumns
2252 //purpose : Load nodes bound to face into a map of node columns
2253 //=======================================================================
2255 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2256 const TopoDS_Face& theFace,
2257 const TopoDS_Edge& theBaseEdge,
2258 SMESHDS_Mesh* theMesh,
2259 SMESH_ProxyMesh* theProxyMesh)
2261 return LoadNodeColumns(theParam2ColumnMap,
2263 std::list<TopoDS_Edge>(1,theBaseEdge),
2268 //=======================================================================
2269 //function : LoadNodeColumns
2270 //purpose : Load nodes bound to face into a map of node columns
2271 //=======================================================================
2273 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2274 const TopoDS_Face& theFace,
2275 const std::list<TopoDS_Edge>& theBaseSide,
2276 SMESHDS_Mesh* theMesh,
2277 SMESH_ProxyMesh* theProxyMesh)
2279 // get a right sub-mesh of theFace
2281 const SMESHDS_SubMesh* faceSubMesh = 0;
2284 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
2285 if ( !faceSubMesh ||
2286 faceSubMesh->NbElements() == 0 ||
2287 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
2289 // can use a proxy sub-mesh with not temporary elements only
2295 faceSubMesh = theMesh->MeshElements( theFace );
2296 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
2299 if ( theParam2ColumnMap.empty() )
2301 // get data of edges for normalization of params
2302 vector< double > length;
2304 list<TopoDS_Edge>::const_iterator edge;
2306 for ( edge = theBaseSide.begin(); edge != theBaseSide.end(); ++edge )
2308 double len = std::max( 1e-10, SMESH_Algo::EdgeLength( *edge ));
2310 length.push_back( len );
2314 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
2315 edge = theBaseSide.begin();
2316 for ( int iE = 0; edge != theBaseSide.end(); ++edge, ++iE )
2318 map< double, const SMDS_MeshNode*> sortedBaseNN;
2319 SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN);
2320 if ( sortedBaseNN.empty() ) continue;
2322 map< double, const SMDS_MeshNode*>::iterator u_n = sortedBaseNN.begin();
2323 if ( theProxyMesh ) // from sortedBaseNN remove nodes not shared by faces of faceSubMesh
2325 const SMDS_MeshNode* n1 = (++sortedBaseNN.begin())->second;
2326 const SMDS_MeshNode* n2 = (++sortedBaseNN.rbegin())->second;
2327 bool allNodesAreProxy = ( n1 != theProxyMesh->GetProxyNode( n1 ) &&
2328 n2 != theProxyMesh->GetProxyNode( n2 ));
2329 if ( allNodesAreProxy )
2330 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2331 u_n->second = theProxyMesh->GetProxyNode( u_n->second );
2333 if ( u_n = sortedBaseNN.begin(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2335 while ( ++u_n != sortedBaseNN.end() && !isNodeInSubMesh( u_n->second, faceSubMesh ));
2336 sortedBaseNN.erase( sortedBaseNN.begin(), u_n );
2338 if ( !sortedBaseNN.empty() )
2339 if ( u_n = --sortedBaseNN.end(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2341 while ( u_n != sortedBaseNN.begin() && !isNodeInSubMesh( (--u_n)->second, faceSubMesh ));
2342 sortedBaseNN.erase( ++u_n, sortedBaseNN.end() );
2344 if ( sortedBaseNN.empty() ) continue;
2348 BRep_Tool::Range( *edge, f, l );
2349 if ( edge->Orientation() == TopAbs_REVERSED ) std::swap( f, l );
2350 const double coeff = 1. / ( l - f ) * length[iE] / fullLen;
2351 const double prevPar = theParam2ColumnMap.empty() ? 0 : theParam2ColumnMap.rbegin()->first;
2352 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2354 double par = prevPar + coeff * ( u_n->first - f );
2355 TParam2ColumnMap::iterator u2nn =
2356 theParam2ColumnMap.insert( theParam2ColumnMap.end(), make_pair( par, TNodeColumn()));
2357 u2nn->second.push_back( u_n->second );
2360 if ( theParam2ColumnMap.size() < 2 )
2365 int prevNbRows = theParam2ColumnMap.begin()->second.size(); // current, at least 1 here
2366 int expectedNbRows = faceSubMesh->NbElements() / ( theParam2ColumnMap.size()-1 ); // to be added
2368 // fill theParam2ColumnMap column by column by passing from nodes on
2369 // theBaseEdge up via mesh faces on theFace
2371 TParam2ColumnMap::iterator par_nVec_1, par_nVec_2;
2372 par_nVec_2 = theParam2ColumnMap.begin();
2373 par_nVec_1 = par_nVec_2++;
2374 TIDSortedElemSet emptySet, avoidSet;
2375 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
2377 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
2378 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
2379 nCol1.resize( prevNbRows + expectedNbRows );
2380 nCol2.resize( prevNbRows + expectedNbRows );
2382 int i1, i2, foundNbRows = 0;
2383 const SMDS_MeshNode *n1 = nCol1[ prevNbRows-1 ];
2384 const SMDS_MeshNode *n2 = nCol2[ prevNbRows-1 ];
2385 // find face sharing node n1 and n2 and belonging to faceSubMesh
2386 while ( const SMDS_MeshElement* face =
2387 SMESH_MeshAlgos::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
2389 if ( faceSubMesh->Contains( face ))
2391 int nbNodes = face->NbCornerNodes();
2394 if ( foundNbRows + 1 > expectedNbRows )
2396 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
2397 n2 = face->GetNode( (i1+2) % 4 );
2398 nCol1[ prevNbRows + foundNbRows] = n1;
2399 nCol2[ prevNbRows + foundNbRows] = n2;
2402 avoidSet.insert( face );
2404 if ( foundNbRows != expectedNbRows )
2408 return ( theParam2ColumnMap.size() > 1 &&
2409 theParam2ColumnMap.begin()->second.size() == prevNbRows + expectedNbRows );
2414 //================================================================================
2416 * \brief Return true if a node is at a corner of a 2D structured mesh of FACE
2418 //================================================================================
2420 bool isCornerOfStructure( const SMDS_MeshNode* n,
2421 const SMESHDS_SubMesh* faceSM,
2422 SMESH_MesherHelper& faceAnalyser )
2424 int nbFacesInSM = 0;
2426 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2427 while ( fIt->more() )
2428 nbFacesInSM += faceSM->Contains( fIt->next() );
2430 if ( nbFacesInSM == 1 )
2433 if ( nbFacesInSM == 2 && n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
2435 return faceAnalyser.IsRealSeam( n->getshapeId() );
2441 //=======================================================================
2442 //function : IsStructured
2443 //purpose : Return true if 2D mesh on FACE is structured
2444 //=======================================================================
2446 bool SMESH_MesherHelper::IsStructured( SMESH_subMesh* faceSM )
2448 SMESHDS_SubMesh* fSM = faceSM->GetSubMeshDS();
2449 if ( !fSM || fSM->NbElements() == 0 )
2452 list< TopoDS_Edge > edges;
2453 list< int > nbEdgesInWires;
2454 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( faceSM->GetSubShape() ),
2455 edges, nbEdgesInWires );
2456 if ( nbWires != 1 /*|| nbEdgesInWires.front() != 4*/ ) // allow composite sides
2459 // algo: find corners of a structure and then analyze nb of faces and
2460 // length of structure sides
2462 SMESHDS_Mesh* meshDS = faceSM->GetFather()->GetMeshDS();
2463 SMESH_MesherHelper faceAnalyser( *faceSM->GetFather() );
2464 faceAnalyser.SetSubShape( faceSM->GetSubShape() );
2466 // rotate edges to get the first node being at corner
2467 // (in principle it's not necessary but so far none SALOME algo can make
2468 // such a structured mesh that all corner nodes are not on VERTEXes)
2469 bool isCorner = false;
2470 int nbRemainEdges = nbEdgesInWires.front();
2472 TopoDS_Vertex V = IthVertex( 0, edges.front() );
2473 isCorner = isCornerOfStructure( SMESH_Algo::VertexNode( V, meshDS ),
2476 edges.splice( edges.end(), edges, edges.begin() );
2480 while ( !isCorner && nbRemainEdges > 0 );
2485 // get all nodes from EDGEs
2486 list< const SMDS_MeshNode* > nodes;
2487 list< TopoDS_Edge >::iterator edge = edges.begin();
2488 for ( ; edge != edges.end(); ++edge )
2490 map< double, const SMDS_MeshNode* > u2Nodes;
2491 if ( !SMESH_Algo::GetSortedNodesOnEdge( meshDS, *edge,
2492 /*skipMedium=*/true, u2Nodes ))
2495 list< const SMDS_MeshNode* > edgeNodes;
2496 map< double, const SMDS_MeshNode* >::iterator u2n = u2Nodes.begin();
2497 for ( ; u2n != u2Nodes.end(); ++u2n )
2498 edgeNodes.push_back( u2n->second );
2499 if ( edge->Orientation() == TopAbs_REVERSED )
2500 edgeNodes.reverse();
2502 if ( !nodes.empty() && nodes.back() == edgeNodes.front() )
2503 edgeNodes.pop_front();
2504 nodes.splice( nodes.end(), edgeNodes, edgeNodes.begin(), edgeNodes.end() );
2507 // get length of structured sides
2508 vector<int> nbEdgesInSide;
2510 list< const SMDS_MeshNode* >::iterator n = ++nodes.begin();
2511 for ( ; n != nodes.end(); ++n )
2514 if ( isCornerOfStructure( *n, fSM, faceAnalyser )) {
2515 nbEdgesInSide.push_back( nbEdges );
2521 if ( nbEdgesInSide.size() != 4 )
2523 if ( nbEdgesInSide[0] != nbEdgesInSide[2] )
2525 if ( nbEdgesInSide[1] != nbEdgesInSide[3] )
2527 if ( nbEdgesInSide[0] * nbEdgesInSide[1] != fSM->NbElements() )
2533 //=======================================================================
2534 //function : IsDistorted2D
2535 //purpose : Return true if 2D mesh on FACE is ditorted
2536 //=======================================================================
2538 bool SMESH_MesherHelper::IsDistorted2D( SMESH_subMesh* faceSM )
2540 if ( !faceSM || faceSM->GetSubShape().ShapeType() != TopAbs_FACE )
2543 bool haveBadFaces = false;
2545 SMESH_MesherHelper helper( *faceSM->GetFather() );
2546 helper.SetSubShape( faceSM->GetSubShape() );
2548 const TopoDS_Face& F = TopoDS::Face( faceSM->GetSubShape() );
2549 SMESHDS_SubMesh* smDS = helper.GetMeshDS()->MeshElements( F );
2550 if ( !smDS || smDS->NbElements() == 0 ) return false;
2552 SMDS_ElemIteratorPtr faceIt = smDS->GetElements();
2553 double prevArea2D = 0;
2554 vector< const SMDS_MeshNode* > nodes;
2556 while ( faceIt->more() && !haveBadFaces )
2558 const SMDS_MeshElement* face = faceIt->next();
2561 nodes.resize( face->NbCornerNodes() );
2562 SMDS_MeshElement::iterator n = face->begin_nodes();
2563 for ( size_t i = 0; i < nodes.size(); ++n, ++i )
2566 // avoid elems on degenarate shapes as UV on them can be wrong
2567 if ( helper.HasDegeneratedEdges() )
2569 bool isOnDegen = false;
2570 for ( size_t i = 0; ( i < nodes.size() && !isOnDegen ); ++i )
2571 isOnDegen = helper.IsDegenShape( nodes[ i ]->getshapeId() );
2575 // prepare to getting UVs
2576 const SMDS_MeshNode* inFaceNode = 0;
2577 if ( helper.HasSeam() ) {
2578 for ( size_t i = 0; ( i < nodes.size() && !inFaceNode ); ++i )
2579 if ( !helper.IsSeamShape( nodes[ i ]->getshapeId() ))
2580 inFaceNode = nodes[ i ];
2585 uv.resize( nodes.size() );
2586 for ( size_t i = 0; i < nodes.size(); ++i )
2587 uv[ i ] = helper.GetNodeUV( F, nodes[ i ], inFaceNode );
2589 // compare orientation of triangles
2590 for ( int iT = 0, nbT = nodes.size()-2; iT < nbT; ++iT )
2592 gp_XY v1 = uv[ iT+1 ] - uv[ 0 ];
2593 gp_XY v2 = uv[ iT+2 ] - uv[ 0 ];
2594 double area2D = v2 ^ v1;
2595 if (( haveBadFaces = ( area2D * prevArea2D < 0 )))
2597 prevArea2D = area2D;
2601 return haveBadFaces;
2604 //================================================================================
2606 * \brief Find out elements orientation on a geometrical face
2607 * \param theFace - The face correctly oriented in the shape being meshed
2608 * \retval bool - true if the face normal and the normal of first element
2609 * in the correspoding submesh point in different directions
2611 //================================================================================
2613 bool SMESH_MesherHelper::IsReversedSubMesh (const TopoDS_Face& theFace)
2615 if ( theFace.IsNull() )
2618 // find out orientation of a meshed face
2619 int faceID = GetMeshDS()->ShapeToIndex( theFace );
2620 TopoDS_Shape aMeshedFace = GetMeshDS()->IndexToShape( faceID );
2621 bool isReversed = ( theFace.Orientation() != aMeshedFace.Orientation() );
2623 const SMESHDS_SubMesh * aSubMeshDSFace = GetMeshDS()->MeshElements( faceID );
2624 if ( !aSubMeshDSFace )
2627 // find an element with a good normal
2629 bool normalOK = false;
2631 SMDS_ElemIteratorPtr iteratorElem = aSubMeshDSFace->GetElements();
2632 while ( !normalOK && iteratorElem->more() ) // loop on elements on theFace
2634 const SMDS_MeshElement* elem = iteratorElem->next();
2635 if ( elem && elem->NbCornerNodes() > 2 )
2637 SMESH_TNodeXYZ nPnt[3];
2638 SMDS_ElemIteratorPtr nodesIt = elem->nodesIterator();
2639 int iNodeOnFace = 0, iPosDim = SMDS_TOP_VERTEX;
2640 for ( int iN = 0; nodesIt->more() && iN < 3; ++iN) // loop on nodes
2642 nPnt[ iN ] = nodesIt->next();
2643 if ( nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition() > iPosDim )
2646 iPosDim = nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition();
2650 gp_Vec v01( nPnt[0], nPnt[1] ), v02( nPnt[0], nPnt[2] );
2651 if ( v01.SquareMagnitude() > RealSmall() &&
2652 v02.SquareMagnitude() > RealSmall() )
2655 if (( normalOK = ( Ne.SquareMagnitude() > RealSmall() )))
2656 uv = GetNodeUV( theFace, nPnt[iNodeOnFace]._node, 0, &normalOK );
2663 // face normal at node position
2664 TopLoc_Location loc;
2665 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
2666 // if ( surf.IsNull() || surf->Continuity() < GeomAbs_C1 )
2667 // some surfaces not detected as GeomAbs_C1 are nevertheless correct for meshing
2668 if ( surf.IsNull() || surf->Continuity() < GeomAbs_C0 )
2671 MESSAGE("surf->Continuity() < GeomAbs_C1 " << (surf->Continuity() < GeomAbs_C1));
2674 gp_Vec d1u, d1v; gp_Pnt p;
2675 surf->D1( uv.X(), uv.Y(), p, d1u, d1v );
2676 gp_Vec Nf = (d1u ^ d1v).Transformed( loc );
2678 if ( theFace.Orientation() == TopAbs_REVERSED )
2681 return Ne * Nf < 0.;
2684 //=======================================================================
2686 //purpose : Count nb of sub-shapes
2687 //=======================================================================
2689 int SMESH_MesherHelper::Count(const TopoDS_Shape& shape,
2690 const TopAbs_ShapeEnum type,
2691 const bool ignoreSame)
2694 TopTools_IndexedMapOfShape map;
2695 TopExp::MapShapes( shape, type, map );
2696 return map.Extent();
2700 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2706 //=======================================================================
2707 //function : NbAncestors
2708 //purpose : Return number of unique ancestors of the shape
2709 //=======================================================================
2711 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
2712 const SMESH_Mesh& mesh,
2713 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
2715 TopTools_MapOfShape ancestors;
2716 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
2717 for ( ; ansIt.More(); ansIt.Next() ) {
2718 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
2719 ancestors.Add( ansIt.Value() );
2721 return ancestors.Extent();
2724 //=======================================================================
2725 //function : GetSubShapeOri
2726 //purpose : Return orientation of sub-shape in the main shape
2727 //=======================================================================
2729 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
2730 const TopoDS_Shape& subShape)
2732 TopAbs_Orientation ori = TopAbs_Orientation(-1);
2733 if ( !shape.IsNull() && !subShape.IsNull() )
2735 TopExp_Explorer e( shape, subShape.ShapeType() );
2736 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
2737 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
2738 for ( ; e.More(); e.Next())
2739 if ( subShape.IsSame( e.Current() ))
2742 ori = e.Current().Orientation();
2747 //=======================================================================
2748 //function : IsSubShape
2750 //=======================================================================
2752 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
2753 const TopoDS_Shape& mainShape )
2755 if ( !shape.IsNull() && !mainShape.IsNull() )
2757 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
2760 if ( shape.IsSame( exp.Current() ))
2763 SCRUTE((shape.IsNull()));
2764 SCRUTE((mainShape.IsNull()));
2768 //=======================================================================
2769 //function : IsSubShape
2771 //=======================================================================
2773 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
2775 if ( shape.IsNull() || !aMesh )
2778 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
2780 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
2783 //================================================================================
2785 * \brief Return maximal tolerance of shape
2787 //================================================================================
2789 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
2791 double tol = Precision::Confusion();
2792 TopExp_Explorer exp;
2793 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
2794 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
2795 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
2796 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
2797 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
2798 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
2803 //================================================================================
2805 * \brief Return an angle between two EDGEs sharing a common VERTEX with reference
2806 * of the FACE normal
2807 * \return double - the angle (between -Pi and Pi), negative if the angle is concave,
2808 * 1e100 in case of failure
2809 * \waring Care about order of the EDGEs and their orientation to be as they are
2810 * within the FACE! Don't pass degenerated EDGEs neither!
2812 //================================================================================
2814 double SMESH_MesherHelper::GetAngle( const TopoDS_Edge & theE1,
2815 const TopoDS_Edge & theE2,
2816 const TopoDS_Face & theFace,
2817 const TopoDS_Vertex & theCommonV,
2818 gp_Vec* theFaceNormal)
2820 double angle = 1e100;
2824 Handle(Geom_Curve) c1 = BRep_Tool::Curve( theE1, f,l );
2825 Handle(Geom_Curve) c2 = BRep_Tool::Curve( theE2, f,l );
2826 Handle(Geom2d_Curve) c2d1 = BRep_Tool::CurveOnSurface( theE1, theFace, f,l );
2827 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace );
2828 double p1 = BRep_Tool::Parameter( theCommonV, theE1 );
2829 double p2 = BRep_Tool::Parameter( theCommonV, theE2 );
2830 if ( c1.IsNull() || c2.IsNull() )
2832 gp_XY uv = c2d1->Value( p1 ).XY();
2833 gp_Vec du, dv; gp_Pnt p;
2834 surf->D1( uv.X(), uv.Y(), p, du, dv );
2835 gp_Vec vec1, vec2, vecRef = du ^ dv;
2838 while ( vecRef.SquareMagnitude() < 1e-25 )
2840 double dp = ( l - f ) / 1000.;
2841 p1tmp += dp * (( Abs( p1 - f ) > Abs( p1 - l )) ? -1. : +1.);
2842 uv = c2d1->Value( p1tmp ).XY();
2843 surf->D1( uv.X(), uv.Y(), p, du, dv );
2845 if ( ++nbLoops > 10 )
2848 cout << "SMESH_MesherHelper::GetAngle(): Captured in a sigularity" << endl;
2853 if ( theFace.Orientation() == TopAbs_REVERSED )
2855 if ( theFaceNormal ) *theFaceNormal = vecRef;
2857 c1->D1( p1, p, vec1 );
2858 c2->D1( p2, p, vec2 );
2859 // TopoDS_Face F = theFace;
2860 // if ( F.Orientation() == TopAbs_INTERNAL )
2861 // F.Orientation( TopAbs_FORWARD );
2862 if ( theE1.Orientation() /*GetSubShapeOri( F, theE1 )*/ == TopAbs_REVERSED )
2864 if ( theE2.Orientation() /*GetSubShapeOri( F, theE2 )*/ == TopAbs_REVERSED )
2866 angle = vec1.AngleWithRef( vec2, vecRef );
2868 if ( Abs ( angle ) >= 0.99 * M_PI )
2870 BRep_Tool::Range( theE1, f, l );
2871 p1 += 1e-7 * ( p1-f < l-p1 ? +1. : -1. );
2872 c1->D1( p1, p, vec1 );
2873 if ( theE1.Orientation() == TopAbs_REVERSED )
2875 BRep_Tool::Range( theE2, f, l );
2876 p2 += 1e-7 * ( p2-f < l-p2 ? +1. : -1. );
2877 c2->D1( p2, p, vec2 );
2878 if ( theE2.Orientation() == TopAbs_REVERSED )
2880 angle = vec1.AngleWithRef( vec2, vecRef );
2889 //================================================================================
2891 * \brief Check if the first and last vertices of an edge are the same
2892 * \param anEdge - the edge to check
2893 * \retval bool - true if same
2895 //================================================================================
2897 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
2899 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2900 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
2901 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
2904 //================================================================================
2906 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
2907 * in the case of INTERNAL edge
2909 //================================================================================
2911 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
2915 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2916 anEdge.Orientation( TopAbs_FORWARD );
2918 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
2919 TopoDS_Iterator vIt( anEdge, CumOri );
2920 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
2923 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
2926 //================================================================================
2928 * \brief Return type of shape contained in a group
2929 * \param group - a shape of type TopAbs_COMPOUND
2930 * \param avoidCompound - not to return TopAbs_COMPOUND
2932 //================================================================================
2934 TopAbs_ShapeEnum SMESH_MesherHelper::GetGroupType(const TopoDS_Shape& group,
2935 const bool avoidCompound)
2937 if ( !group.IsNull() )
2939 if ( group.ShapeType() != TopAbs_COMPOUND )
2940 return group.ShapeType();
2942 // iterate on a compound
2943 TopoDS_Iterator it( group );
2945 return avoidCompound ? GetGroupType( it.Value() ) : it.Value().ShapeType();
2947 return TopAbs_SHAPE;
2950 //=======================================================================
2951 //function : IsQuadraticMesh
2952 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
2953 // quadratic elements will be created.
2954 // Used then generated 3D mesh without geometry.
2955 //=======================================================================
2957 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
2959 int NbAllEdgsAndFaces=0;
2960 int NbQuadFacesAndEdgs=0;
2961 int NbFacesAndEdges=0;
2962 //All faces and edges
2963 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
2964 if ( NbAllEdgsAndFaces == 0 )
2965 return SMESH_MesherHelper::LINEAR;
2967 //Quadratic faces and edges
2968 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
2970 //Linear faces and edges
2971 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
2973 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
2975 return SMESH_MesherHelper::QUADRATIC;
2977 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
2979 return SMESH_MesherHelper::LINEAR;
2982 //Mesh with both type of elements
2983 return SMESH_MesherHelper::COMP;
2986 //=======================================================================
2987 //function : GetOtherParam
2988 //purpose : Return an alternative parameter for a node on seam
2989 //=======================================================================
2991 double SMESH_MesherHelper::GetOtherParam(const double param) const
2993 int i = myParIndex & U_periodic ? 0 : 1;
2994 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
2999 //=======================================================================
3001 * \brief Iterator on ancestors of the given type
3003 //=======================================================================
3005 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
3007 TopTools_ListIteratorOfListOfShape _ancIter;
3008 TopAbs_ShapeEnum _type;
3009 TopTools_MapOfShape _encountered;
3010 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
3011 : _ancIter( ancestors ), _type( type )
3013 if ( _ancIter.More() ) {
3014 if ( _ancIter.Value().ShapeType() != _type ) next();
3015 else _encountered.Add( _ancIter.Value() );
3020 return _ancIter.More();
3022 virtual const TopoDS_Shape* next()
3024 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
3025 if ( _ancIter.More() )
3026 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
3027 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
3035 //=======================================================================
3037 * \brief Return iterator on ancestors of the given type
3039 //=======================================================================
3041 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
3042 const SMESH_Mesh& mesh,
3043 TopAbs_ShapeEnum ancestorType)
3045 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
3048 //=======================================================================
3049 //function : GetCommonAncestor
3050 //purpose : Find a common ancestors of two shapes of the given type
3051 //=======================================================================
3053 TopoDS_Shape SMESH_MesherHelper::GetCommonAncestor(const TopoDS_Shape& shape1,
3054 const TopoDS_Shape& shape2,
3055 const SMESH_Mesh& mesh,
3056 TopAbs_ShapeEnum ancestorType)
3058 TopoDS_Shape commonAnc;
3059 if ( !shape1.IsNull() && !shape2.IsNull() )
3061 PShapeIteratorPtr ancIt = GetAncestors( shape1, mesh, ancestorType );
3062 while ( const TopoDS_Shape* anc = ancIt->next() )
3063 if ( IsSubShape( shape2, *anc ))
3072 //#include <Perf_Meter.hxx>
3074 //=======================================================================
3075 namespace { // Structures used by FixQuadraticElements()
3076 //=======================================================================
3078 #define __DMP__(txt) \
3080 #define MSG(txt) __DMP__(txt<<endl)
3081 #define MSGBEG(txt) __DMP__(txt)
3083 //const double straightTol2 = 1e-33; // to detect straing links
3084 bool isStraightLink(double linkLen2, double middleNodeMove2)
3086 // straight if <node move> < 1/15 * <link length>
3087 return middleNodeMove2 < 1/15./15. * linkLen2;
3091 // ---------------------------------------
3093 * \brief Quadratic link knowing its faces
3095 struct QLink: public SMESH_TLink
3097 const SMDS_MeshNode* _mediumNode;
3098 mutable vector<const QFace* > _faces;
3099 mutable gp_Vec _nodeMove;
3100 mutable int _nbMoves;
3102 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
3103 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
3105 //if ( MediumPos() != SMDS_TOP_3DSPACE )
3106 _nodeMove = MediumPnt() - MiddlePnt();
3108 void SetContinuesFaces() const;
3109 const QFace* GetContinuesFace( const QFace* face ) const;
3110 bool OnBoundary() const;
3111 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
3112 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
3114 SMDS_TypeOfPosition MediumPos() const
3115 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
3116 SMDS_TypeOfPosition EndPos(bool isSecond) const
3117 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
3118 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
3119 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
3121 void Move(const gp_Vec& move, bool sum=false) const
3122 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
3123 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
3124 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
3125 bool IsStraight() const
3126 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
3127 _nodeMove.SquareMagnitude());
3129 bool operator<(const QLink& other) const {
3130 return (node1()->GetID() == other.node1()->GetID() ?
3131 node2()->GetID() < other.node2()->GetID() :
3132 node1()->GetID() < other.node1()->GetID());
3134 // struct PtrComparator {
3135 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
3138 // ---------------------------------------------------------
3140 * \brief Link in the chain of links; it connects two faces
3144 const QLink* _qlink;
3145 mutable const QFace* _qfaces[2];
3147 TChainLink(const QLink* qlink=0):_qlink(qlink) {
3148 _qfaces[0] = _qfaces[1] = 0;
3150 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
3152 bool IsBoundary() const { return !_qfaces[1]; }
3154 void RemoveFace( const QFace* face ) const
3155 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
3157 const QFace* NextFace( const QFace* f ) const
3158 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
3160 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
3161 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
3163 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
3165 operator bool() const { return (_qlink); }
3167 const QLink* operator->() const { return _qlink; }
3169 gp_Vec Normal() const;
3171 bool IsStraight() const;
3173 // --------------------------------------------------------------------
3174 typedef list< TChainLink > TChain;
3175 typedef set < TChainLink > TLinkSet;
3176 typedef TLinkSet::const_iterator TLinkInSet;
3178 const int theFirstStep = 5;
3180 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
3181 // --------------------------------------------------------------------
3183 * \brief Quadratic face shared by two volumes and bound by QLinks
3185 struct QFace: public TIDSortedNodeSet
3187 mutable const SMDS_MeshElement* _volumes[2];
3188 mutable vector< const QLink* > _sides;
3189 mutable bool _sideIsAdded[4]; // added in chain of links
3192 mutable const SMDS_MeshElement* _face;
3195 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
3197 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
3199 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
3201 void AddSelfToLinks() const {
3202 for ( int i = 0; i < _sides.size(); ++i )
3203 _sides[i]->_faces.push_back( this );
3205 int LinkIndex( const QLink* side ) const {
3206 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
3209 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
3211 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
3213 int i = LinkIndex( link._qlink );
3214 if ( i < 0 ) return true;
3215 _sideIsAdded[i] = true;
3216 link.SetFace( this );
3217 // continue from opposite link
3218 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
3220 bool IsBoundary() const { return !_volumes[1]; }
3222 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
3224 bool IsSpoiled(const QLink* bentLink ) const;
3226 TLinkInSet GetBoundaryLink( const TLinkSet& links,
3227 const TChainLink& avoidLink,
3228 TLinkInSet * notBoundaryLink = 0,
3229 const SMDS_MeshNode* nodeToContain = 0,
3230 bool * isAdjacentUsed = 0,
3231 int nbRecursionsLeft = -1) const;
3233 TLinkInSet GetLinkByNode( const TLinkSet& links,
3234 const TChainLink& avoidLink,
3235 const SMDS_MeshNode* nodeToContain) const;
3237 const SMDS_MeshNode* GetNodeInFace() const {
3238 for ( int iL = 0; iL < _sides.size(); ++iL )
3239 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
3243 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
3245 double MoveByBoundary( const TChainLink& theLink,
3246 const gp_Vec& theRefVec,
3247 const TLinkSet& theLinks,
3248 SMESH_MesherHelper* theFaceHelper=0,
3249 const double thePrevLen=0,
3250 const int theStep=theFirstStep,
3251 gp_Vec* theLinkNorm=0,
3252 double theSign=1.0) const;
3255 //================================================================================
3257 * \brief Dump QLink and QFace
3259 ostream& operator << (ostream& out, const QLink& l)
3261 out <<"QLink nodes: "
3262 << l.node1()->GetID() << " - "
3263 << l._mediumNode->GetID() << " - "
3264 << l.node2()->GetID() << endl;
3267 ostream& operator << (ostream& out, const QFace& f)
3269 out <<"QFace nodes: "/*<< &f << " "*/;
3270 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
3271 out << (*n)->GetID() << " ";
3272 out << " \tvolumes: "
3273 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
3274 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
3275 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
3279 //================================================================================
3281 * \brief Construct QFace from QLinks
3283 //================================================================================
3285 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
3287 _volumes[0] = _volumes[1] = 0;
3289 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
3290 _normal.SetCoord(0,0,0);
3291 for ( int i = 1; i < _sides.size(); ++i ) {
3292 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
3293 insert( l1->node1() ); insert( l1->node2() );
3295 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
3296 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
3297 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
3301 double normSqSize = _normal.SquareMagnitude();
3302 if ( normSqSize > numeric_limits<double>::min() )
3303 _normal /= sqrt( normSqSize );
3305 _normal.SetCoord(1e-33,0,0);
3311 //================================================================================
3313 * \brief Make up a chain of links
3314 * \param iSide - link to add first
3315 * \param chain - chain to fill in
3316 * \param pos - postion of medium nodes the links should have
3317 * \param error - out, specifies what is wrong
3318 * \retval bool - false if valid chain can't be built; "valid" means that links
3319 * of the chain belongs to rectangles bounding hexahedrons
3321 //================================================================================
3323 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
3325 if ( iSide >= _sides.size() ) // wrong argument iSide
3327 if ( _sideIsAdded[ iSide ]) // already in chain
3330 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
3333 list< const QFace* > faces( 1, this );
3334 while ( !faces.empty() ) {
3335 const QFace* face = faces.front();
3336 for ( int i = 0; i < face->_sides.size(); ++i ) {
3337 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
3338 face->_sideIsAdded[i] = true;
3339 // find a face side in the chain
3340 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
3341 // TChain::iterator chLink = chain.begin();
3342 // for ( ; chLink != chain.end(); ++chLink )
3343 // if ( chLink->_qlink == face->_sides[i] )
3345 // if ( chLink == chain.end() )
3346 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
3347 // add a face to a chained link and put a continues face in the queue
3348 chLink->SetFace( face );
3349 if ( face->_sides[i]->MediumPos() == pos )
3350 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
3351 if ( contFace->_sides.size() == 3 )
3352 faces.push_back( contFace );
3357 if ( error < ERR_TRI )
3359 chain.insert( chain.end(), links.begin(),links.end() );
3362 _sideIsAdded[iSide] = true; // not to add this link to chain again
3363 const QLink* link = _sides[iSide];
3367 // add link into chain
3368 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
3369 chLink->SetFace( this );
3372 // propagate from a quadrangle to neighbour faces
3373 if ( link->MediumPos() >= pos ) {
3374 int nbLinkFaces = link->_faces.size();
3375 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
3376 // hexahedral mesh or boundary quadrangles - goto a continous face
3377 if ( const QFace* f = link->GetContinuesFace( this ))
3378 if ( f->_sides.size() == 4 )
3379 return f->GetLinkChain( *chLink, chain, pos, error );
3382 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
3383 for ( int i = 0; i < nbLinkFaces; ++i )
3384 if ( link->_faces[i] )
3385 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
3386 if ( error < ERR_PRISM )
3394 //================================================================================
3396 * \brief Return a boundary link of the triangle face
3397 * \param links - set of all links
3398 * \param avoidLink - link not to return
3399 * \param notBoundaryLink - out, neither the returned link nor avoidLink
3400 * \param nodeToContain - node the returned link must contain; if provided, search
3401 * also performed on adjacent faces
3402 * \param isAdjacentUsed - returns true if link is found in adjacent faces
3403 * \param nbRecursionsLeft - to limit recursion
3405 //================================================================================
3407 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
3408 const TChainLink& avoidLink,
3409 TLinkInSet * notBoundaryLink,
3410 const SMDS_MeshNode* nodeToContain,
3411 bool * isAdjacentUsed,
3412 int nbRecursionsLeft) const
3414 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
3416 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
3417 TFaceLinkList adjacentFaces;
3419 for ( int iL = 0; iL < _sides.size(); ++iL )
3421 if ( avoidLink._qlink == _sides[iL] )
3423 TLinkInSet link = links.find( _sides[iL] );
3424 if ( link == linksEnd ) continue;
3425 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
3426 continue; // We work on faces here, don't go inside a solid
3429 if ( link->IsBoundary() ) {
3430 if ( !nodeToContain ||
3431 (*link)->node1() == nodeToContain ||
3432 (*link)->node2() == nodeToContain )
3434 boundaryLink = link;
3435 if ( !notBoundaryLink ) break;
3438 else if ( notBoundaryLink ) {
3439 *notBoundaryLink = link;
3440 if ( boundaryLink != linksEnd ) break;
3443 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
3444 if ( const QFace* adj = link->NextFace( this ))
3445 if ( adj->Contains( nodeToContain ))
3446 adjacentFaces.push_back( make_pair( adj, link ));
3449 if ( isAdjacentUsed ) *isAdjacentUsed = false;
3450 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
3452 if ( nbRecursionsLeft < 0 )
3453 nbRecursionsLeft = nodeToContain->NbInverseElements();
3454 TFaceLinkList::iterator adj = adjacentFaces.begin();
3455 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
3456 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
3457 isAdjacentUsed, nbRecursionsLeft-1);
3458 if ( isAdjacentUsed ) *isAdjacentUsed = true;
3460 return boundaryLink;
3462 //================================================================================
3464 * \brief Return a link ending at the given node but not avoidLink
3466 //================================================================================
3468 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
3469 const TChainLink& avoidLink,
3470 const SMDS_MeshNode* nodeToContain) const
3472 for ( int i = 0; i < _sides.size(); ++i )
3473 if ( avoidLink._qlink != _sides[i] &&
3474 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
3475 return links.find( _sides[ i ]);
3479 //================================================================================
3481 * \brief Return normal to the i-th side pointing outside the face
3483 //================================================================================
3485 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
3487 gp_Vec norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3488 gp_XYZ pIn = ( _sides[ (i+1)%3 ]->MiddlePnt() +
3489 _sides[ (i+2)%3 ]->MiddlePnt() ) / 2.;
3490 gp_Vec vecOut = ( _sides[i]->MiddlePnt() - pIn );
3492 if ( norm * vecOut < 0 )
3494 double mag2 = norm.SquareMagnitude();
3495 if ( mag2 > numeric_limits<double>::min() )
3496 norm /= sqrt( mag2 );
3499 //================================================================================
3501 * \brief Move medium node of theLink according to its distance from boundary
3502 * \param theLink - link to fix
3503 * \param theRefVec - movement of boundary
3504 * \param theLinks - all adjacent links of continous triangles
3505 * \param theFaceHelper - helper is not used so far
3506 * \param thePrevLen - distance from the boundary
3507 * \param theStep - number of steps till movement propagation limit
3508 * \param theLinkNorm - out normal to theLink
3509 * \param theSign - 1 or -1 depending on movement of boundary
3510 * \retval double - distance from boundary to propagation limit or other boundary
3512 //================================================================================
3514 double QFace::MoveByBoundary( const TChainLink& theLink,
3515 const gp_Vec& theRefVec,
3516 const TLinkSet& theLinks,
3517 SMESH_MesherHelper* theFaceHelper,
3518 const double thePrevLen,
3520 gp_Vec* theLinkNorm,
3521 double theSign) const
3524 return thePrevLen; // propagation limit reached
3526 int iL; // index of theLink
3527 for ( iL = 0; iL < _sides.size(); ++iL )
3528 if ( theLink._qlink == _sides[ iL ])
3531 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
3532 <<" thePrevLen " << thePrevLen);
3533 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
3535 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
3536 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
3537 if ( theStep == theFirstStep )
3538 theSign = refProj < 0. ? -1. : 1.;
3539 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
3540 return thePrevLen; // to propagate movement forward only, not in side dir or backward
3542 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
3543 TLinkInSet link1 = theLinks.find( _sides[iL1] );
3544 TLinkInSet link2 = theLinks.find( _sides[iL2] );
3546 const QFace *f1 = 0, *f2 = 0; // adjacent faces
3547 bool isBndLink1 = true, isBndLink2 = true;
3548 if ( link1 != theLinks.end() && link2 != theLinks.end() )
3550 f1 = link1->NextFace( this );
3551 f2 = link2->NextFace( this );
3553 isBndLink1 = ( theLink->MediumPos() > (*link1)->MediumPos() );
3554 isBndLink2 = ( theLink->MediumPos() > (*link2)->MediumPos() );
3555 if ( theStep == theFirstStep ) // (issue 22541) quad-dominant mesh
3557 if ( !isBndLink1 && !f1 )
3558 f1 = (*link1)->GetContinuesFace( this ); // get a quadrangle face
3559 if ( !isBndLink2 && !f2 )
3560 f2 = (*link2)->GetContinuesFace( this );
3563 else if ( _sides.size() < 4 )
3566 // propagate to adjacent faces till limit step or boundary
3567 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
3568 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
3569 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
3570 gp_Vec linkDir2(0,0,0);
3573 if ( f1 && !isBndLink1 )
3574 len1 = f1->MoveByBoundary
3575 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
3577 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
3579 MSG( " --------------- EXCEPTION");
3584 if ( f2 && !isBndLink2 )
3585 len2 = f2->MoveByBoundary
3586 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
3588 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
3590 MSG( " --------------- EXCEPTION");
3595 if ( theStep != theFirstStep )
3597 // choose chain length by direction of propagation most codirected with theRefVec
3598 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
3599 fullLen = choose1 ? len1 : len2;
3600 double r = thePrevLen / fullLen;
3602 gp_Vec move = linkNorm * refProj * ( 1 - r );
3603 theLink->Move( move, true );
3605 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
3606 " by " << refProj * ( 1 - r ) << " following " <<
3607 (choose1 ? *link1->_qlink : *link2->_qlink)); // warning: link1 can be invalid
3609 if ( theLinkNorm ) *theLinkNorm = linkNorm;
3614 //================================================================================
3616 * \brief Checks if the face is distorted due to bentLink
3618 //================================================================================
3620 bool QFace::IsSpoiled(const QLink* bentLink ) const
3622 // code is valid for convex faces only
3624 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
3625 gc += XYZ( *n ) / size();
3626 for (unsigned i = 0; i < _sides.size(); ++i )
3628 if ( _sides[i] == bentLink ) continue;
3629 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3630 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
3631 if ( linkNorm * vecOut < 0 )
3633 double mag2 = linkNorm.SquareMagnitude();
3634 if ( mag2 > numeric_limits<double>::min() )
3635 linkNorm /= sqrt( mag2 );
3636 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
3637 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
3638 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
3645 //================================================================================
3647 * \brief Find pairs of continues faces
3649 //================================================================================
3651 void QLink::SetContinuesFaces() const
3653 // x0 x - QLink, [-|] - QFace, v - volume
3655 // | Between _faces of link x2 two vertical faces are continues
3656 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
3657 // | to _faces[0] and _faces[1] and horizontal faces to
3658 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
3661 if ( _faces.empty() )
3663 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
3664 if ( _faces[0]->IsBoundary() )
3665 iBoundary[ nbBoundary++ ] = 0;
3666 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
3668 // look for a face bounding none of volumes bound by _faces[0]
3669 bool sameVol = false;
3670 int nbVol = _faces[iF]->NbVolumes();
3671 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
3672 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
3673 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
3676 if ( _faces[iF]->IsBoundary() )
3677 iBoundary[ nbBoundary++ ] = iF;
3679 // Set continues faces: arrange _faces to have
3680 // _faces[0] continues to _faces[1]
3681 // _faces[2] continues to _faces[3]
3682 if ( nbBoundary == 2 ) // bnd faces are continues
3684 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
3686 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
3687 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
3690 else if ( iFaceCont > 0 ) // continues faces found
3692 if ( iFaceCont != 1 )
3693 std::swap( _faces[1], _faces[iFaceCont] );
3695 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
3697 _faces.insert( ++_faces.begin(), (QFace*) 0 );
3700 //================================================================================
3702 * \brief Return a face continues to the given one
3704 //================================================================================
3706 const QFace* QLink::GetContinuesFace( const QFace* face ) const
3708 for ( int i = 0; i < _faces.size(); ++i ) {
3709 if ( _faces[i] == face ) {
3710 int iF = i < 2 ? 1-i : 5-i;
3711 return iF < _faces.size() ? _faces[iF] : 0;
3716 //================================================================================
3718 * \brief True if link is on mesh boundary
3720 //================================================================================
3722 bool QLink::OnBoundary() const
3724 for ( int i = 0; i < _faces.size(); ++i )
3725 if (_faces[i] && _faces[i]->IsBoundary()) return true;
3728 //================================================================================
3730 * \brief Return normal of link of the chain
3732 //================================================================================
3734 gp_Vec TChainLink::Normal() const {
3736 if (_qfaces[0]) norm = _qfaces[0]->_normal;
3737 if (_qfaces[1]) norm += _qfaces[1]->_normal;
3740 //================================================================================
3742 * \brief Test link curvature taking into account size of faces
3744 //================================================================================
3746 bool TChainLink::IsStraight() const
3748 bool isStraight = _qlink->IsStraight();
3749 if ( isStraight && _qfaces[0] && !_qfaces[1] )
3751 int i = _qfaces[0]->LinkIndex( _qlink );
3752 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
3753 gp_XYZ mid1 = _qlink->MiddlePnt();
3754 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
3755 double faceSize2 = (mid1-mid2).SquareModulus();
3756 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
3761 //================================================================================
3763 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
3765 //================================================================================
3767 void fixPrism( TChain& allLinks )
3769 // separate boundary links from internal ones
3770 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
3771 QLinkSet interLinks, bndLinks1, bndLink2;
3773 bool isCurved = false;
3774 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3775 if ( (*lnk)->OnBoundary() )
3776 bndLinks1.insert( lnk->_qlink );
3778 interLinks.insert( lnk->_qlink );
3779 isCurved = isCurved || !lnk->IsStraight();
3782 return; // no need to move
3784 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
3786 while ( !interLinks.empty() && !curBndLinks->empty() )
3788 // propagate movement from boundary links to connected internal links
3789 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
3790 for ( ; bnd != bndEnd; ++bnd )
3792 const QLink* bndLink = *bnd;
3793 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
3795 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
3796 if ( !face ) continue;
3797 // find and move internal link opposite to bndLink within the face
3798 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
3799 const QLink* interLink = face->_sides[ interInd ];
3800 QLinkSet::iterator pInterLink = interLinks.find( interLink );
3801 if ( pInterLink == interLinks.end() ) continue; // not internal link
3802 interLink->Move( bndLink->_nodeMove );
3803 // treated internal links become new boundary ones
3804 interLinks.erase( pInterLink );
3805 newBndLinks->insert( interLink );
3808 curBndLinks->clear();
3809 std::swap( curBndLinks, newBndLinks );
3813 //================================================================================
3815 * \brief Fix links of continues triangles near curved boundary
3817 //================================================================================
3819 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
3821 if ( allLinks.empty() ) return;
3823 TLinkSet linkSet( allLinks.begin(), allLinks.end());
3824 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
3826 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
3828 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
3830 // move iff a boundary link is bent towards inside of a face (issue 0021084)
3831 const QFace* face = linkIt->_qfaces[0];
3832 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
3833 face->_sides[1]->MiddlePnt() +
3834 face->_sides[2]->MiddlePnt() ) / 3.;
3835 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
3836 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
3837 //if ( face->IsSpoiled( linkIt->_qlink ))
3838 if ( linkBentInside )
3839 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
3844 //================================================================================
3846 * \brief Detect rectangular structure of links and build chains from them
3848 //================================================================================
3850 enum TSplitTriaResult {
3851 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
3852 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
3854 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
3855 vector< TChain> & resultChains,
3856 SMDS_TypeOfPosition pos )
3858 // put links in the set and evalute number of result chains by number of boundary links
3861 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3862 linkSet.insert( *lnk );
3863 nbBndLinks += lnk->IsBoundary();
3865 resultChains.clear();
3866 resultChains.reserve( nbBndLinks / 2 );
3868 TLinkInSet linkIt, linksEnd = linkSet.end();
3870 // find a boundary link with corner node; corner node has position pos-2
3871 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
3873 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
3874 const SMDS_MeshNode* corner = 0;
3875 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
3876 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
3881 TLinkInSet startLink = linkIt;
3882 const SMDS_MeshNode* startCorner = corner;
3883 vector< TChain* > rowChains;
3886 while ( startLink != linksEnd) // loop on columns
3888 // We suppose we have a rectangular structure like shown here. We have found a
3889 // corner of the rectangle (startCorner) and a boundary link sharing
3890 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
3891 // --o---o---o structure making several chains at once. One chain (columnChain)
3892 // |\ | /| starts at startLink and continues upward (we look at the structure
3893 // \ | \ | / | from such point that startLink is on the bottom of the structure).
3894 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
3895 // --o---o---o encounter.
3897 // / | \ | \ | startCorner
3902 if ( resultChains.size() == nbBndLinks / 2 )
3904 resultChains.push_back( TChain() );
3905 TChain& columnChain = resultChains.back();
3907 TLinkInSet botLink = startLink; // current horizontal link to go up from
3908 corner = startCorner; // current corner the botLink ends at
3910 while ( botLink != linksEnd ) // loop on rows
3912 // add botLink to the columnChain
3913 columnChain.push_back( *botLink );
3915 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
3917 { // the column ends
3918 if ( botLink == startLink )
3919 return _TWISTED_CHAIN; // issue 0020951
3920 linkSet.erase( botLink );
3921 if ( iRow != rowChains.size() )
3922 return _FEW_ROWS; // different nb of rows in columns
3925 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
3926 // link ending at <corner> (sideLink); there are two cases:
3927 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
3928 // since midQuadLink is not at boundary while sideLink is.
3929 // 2) midQuadLink ends at <corner>
3931 TLinkInSet midQuadLink = linksEnd;
3932 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
3934 if ( isCase2 ) { // find midQuadLink among links of botTria
3935 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
3936 if ( midQuadLink->IsBoundary() )
3937 return _BAD_MIDQUAD;
3939 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
3940 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
3943 columnChain.push_back( *midQuadLink );
3944 if ( iRow >= rowChains.size() ) {
3946 return _MANY_ROWS; // different nb of rows in columns
3947 if ( resultChains.size() == nbBndLinks / 2 )
3949 resultChains.push_back( TChain() );
3950 rowChains.push_back( & resultChains.back() );
3952 rowChains[iRow]->push_back( *sideLink );
3953 rowChains[iRow]->push_back( *midQuadLink );
3955 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
3959 // prepare startCorner and startLink for the next column
3960 startCorner = startLink->NextNode( startCorner );
3962 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
3964 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
3965 // check if no more columns remains
3966 if ( startLink != linksEnd ) {
3967 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
3968 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
3969 startLink = linksEnd; // startLink bounds upTria or botTria
3970 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
3974 // find bottom link and corner for the next row
3975 corner = sideLink->NextNode( corner );
3976 // next bottom link ends at the new corner
3977 linkSet.erase( botLink );
3978 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
3979 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
3981 if ( midQuadLink == startLink || sideLink == startLink )
3982 return _TWISTED_CHAIN; // issue 0020951
3983 linkSet.erase( midQuadLink );
3984 linkSet.erase( sideLink );
3986 // make faces neighboring the found ones be boundary
3987 if ( startLink != linksEnd ) {
3988 const QFace* tria = isCase2 ? botTria : upTria;
3989 for ( int iL = 0; iL < 3; ++iL ) {
3990 linkIt = linkSet.find( tria->_sides[iL] );
3991 if ( linkIt != linksEnd )
3992 linkIt->RemoveFace( tria );
3995 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
3996 botLink->RemoveFace( upTria ); // make next botTria first in vector
4003 // In the linkSet, there must remain the last links of rowChains; add them
4004 if ( linkSet.size() != rowChains.size() )
4005 return _BAD_SET_SIZE;
4006 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
4007 // find the link (startLink) ending at startCorner
4009 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
4010 if ( (*startLink)->node1() == startCorner ) {
4011 corner = (*startLink)->node2(); break;
4013 else if ( (*startLink)->node2() == startCorner) {
4014 corner = (*startLink)->node1(); break;
4017 if ( startLink == linksEnd )
4019 rowChains[ iRow ]->push_back( *startLink );
4020 linkSet.erase( startLink );
4021 startCorner = corner;
4027 //================================================================================
4029 * \brief Place medium nodes at the link middle for elements whose corner nodes
4030 * are out of geometrical boundary to prevent distorting elements.
4031 * Issue 0020982, note 0013990
4033 //================================================================================
4035 void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
4036 SMESH_ComputeErrorPtr& theError)
4038 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
4039 TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
4040 if ( shape.IsNull() ) return;
4042 if ( !theError ) theError = SMESH_ComputeError::New();
4046 if ( shape.ShapeType() == TopAbs_FACE ) // 2D
4048 if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
4050 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
4051 if ( !faceSM ) return;
4053 const TopoDS_Face& face = TopoDS::Face( shape );
4054 Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
4056 TopExp_Explorer edgeIt( face, TopAbs_EDGE );
4057 for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
4059 // check if the EDGE needs checking
4060 const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
4061 if ( SMESH_Algo::isDegenerated( edge ) )
4063 if ( theHelper.IsRealSeam( edge ) &&
4064 edge.Orientation() == TopAbs_REVERSED )
4067 SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
4068 if ( !edgeSM ) continue;
4071 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
4072 BRepAdaptor_Curve curve3D( edge );
4073 switch ( curve3D.GetType() ) {
4074 case GeomAbs_Line: continue;
4075 case GeomAbs_Circle:
4076 case GeomAbs_Ellipse:
4077 case GeomAbs_Hyperbola:
4078 case GeomAbs_Parabola:
4081 gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
4082 curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
4083 gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
4084 surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
4085 gp_Vec fNorm = Du1 ^ Dv1;
4086 if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
4087 continue; // face is normal to the curve3D
4089 gp_Vec curvNorm = fNorm ^ D1;
4090 if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
4091 if ( curvNorm * D2 > 0 )
4092 continue; // convex edge
4094 catch ( Standard_Failure )
4099 // get nodes shared by faces that may be distorted
4100 SMDS_NodeIteratorPtr nodeIt;
4101 if ( edgeSM->NbNodes() > 0 ) {
4102 nodeIt = edgeSM->GetNodes();
4105 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
4107 vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
4108 if ( !vertexSM ) continue;
4109 nodeIt = vertexSM->GetNodes();
4112 // find suspicious faces
4113 TIDSortedElemSet checkedFaces;
4114 vector< const SMDS_MeshNode* > nOnEdge( 2 );
4115 const SMDS_MeshNode* nOnFace;
4116 while ( nodeIt->more() )
4118 const SMDS_MeshNode* n = nodeIt->next();
4119 SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
4120 while ( faceIt->more() )
4122 const SMDS_MeshElement* f = faceIt->next();
4123 if ( !faceSM->Contains( f ) ||
4124 f->NbNodes() < 6 || // check quadratic triangles only
4125 !checkedFaces.insert( f ).second )
4128 // get nodes on EDGE and on FACE of a suspicious face
4129 nOnEdge.clear(); nOnFace = 0;
4130 SMDS_MeshElement::iterator triNode = f->begin_nodes();
4131 for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
4134 if ( n->GetPosition()->GetDim() == 2 )
4137 nOnEdge.push_back( n );
4140 // check if nOnFace is inside the FACE
4141 if ( nOnFace && nOnEdge.size() == 2 )
4143 theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
4144 if ( !SMESH_MeshAlgos::FaceNormal( f, faceNorm, /*normalized=*/false ))
4146 gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
4147 gp_XYZ edgeNorm = faceNorm ^ edgeDir;
4148 n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true );
4149 gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
4150 gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
4151 gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
4152 double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
4153 double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
4154 if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
4156 // nOnFace is out of FACE, move a medium on-edge node to the middle
4157 gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
4158 meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4159 MSG( "move OUT of face " << n );
4160 theError->myBadElements.push_back( f );
4166 if ( !theError->myBadElements.empty() )
4167 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4170 } // 2D ==============================================================================
4172 if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
4174 if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
4175 theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
4177 SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
4178 if ( !solidSM ) return;
4180 // check if the SOLID is bound by concave FACEs
4181 vector< TopoDS_Face > concaveFaces;
4182 TopExp_Explorer faceIt( shape, TopAbs_FACE );
4183 for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4185 const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
4186 if ( !meshDS->MeshElements( face )) continue;
4188 BRepAdaptor_Surface surface( face );
4189 switch ( surface.GetType() ) {
4190 case GeomAbs_Plane: continue;
4191 case GeomAbs_Cylinder:
4193 case GeomAbs_Sphere:
4196 double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
4197 double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
4198 gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
4199 surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
4200 gp_Vec fNorm = Du1 ^ Dv1;
4201 if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
4202 bool concaveU = ( fNorm * Du2 > 1e-100 );
4203 bool concaveV = ( fNorm * Dv2 > 1e-100 );
4204 if ( concaveU || concaveV )
4205 concaveFaces.push_back( face );
4207 catch ( Standard_Failure )
4209 concaveFaces.push_back( face );
4213 if ( concaveFaces.empty() )
4216 // fix 2D mesh on the SOLID
4217 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4219 SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
4220 faceHelper.SetSubShape( faceIt.Current() );
4221 force3DOutOfBoundary( faceHelper, theError );
4224 // get an iterator over faces on concaveFaces
4225 vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
4226 for ( size_t i = 0; i < concaveFaces.size(); ++i )
4227 faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
4228 typedef SMDS_IteratorOnIterators
4229 < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
4230 SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
4232 // a seacher to check if a volume is close to a concave face
4233 std::auto_ptr< SMESH_ElementSearcher > faceSearcher
4234 ( SMESH_MeshAlgos::GetElementSearcher( *theHelper.GetMeshDS(), faceIter ));
4237 //BRepClass3d_SolidClassifier solidClassifier( shape );
4239 TIDSortedElemSet checkedVols, movedNodes;
4240 //for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4241 for ( size_t iF = 0; iF < concaveFaces.size(); ++iF ) // loop on concave FACEs
4243 //const TopoDS_Shape& face = faceIt.Current();
4244 const TopoDS_Shape& face = concaveFaces[ iF ];
4245 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
4246 if ( !faceSM ) continue;
4248 // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
4249 SMDS_NodeIteratorPtr nodeIt;
4250 if ( faceSM->NbNodes() > 0 ) {
4251 nodeIt = faceSM->GetNodes();
4254 TopExp_Explorer vertex( face, TopAbs_VERTEX );
4255 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
4256 if ( !vertexSM ) continue;
4257 nodeIt = vertexSM->GetNodes();
4259 // get ids of sub-shapes of the FACE
4261 SMESH_subMeshIteratorPtr smIt =
4262 theHelper.GetMesh()->GetSubMesh( face )->getDependsOnIterator(/*includeSelf=*/true);
4263 while ( smIt->more() )
4264 subIDs.insert( smIt->next()->GetId() );
4266 // find suspicious volumes adjacent to the FACE
4267 vector< const SMDS_MeshNode* > nOnFace( 4 );
4268 const SMDS_MeshNode* nInSolid;
4269 while ( nodeIt->more() )
4271 const SMDS_MeshNode* n = nodeIt->next();
4272 SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
4273 while ( volIt->more() )
4275 const SMDS_MeshElement* vol = volIt->next();
4276 int nbN = vol->NbCornerNodes();
4277 if ( ( nbN != 4 && nbN != 5 ) ||
4278 !solidSM->Contains( vol ) ||
4279 !checkedVols.insert( vol ).second )
4282 // get nodes on FACE and in SOLID of a suspicious volume
4283 nOnFace.clear(); nInSolid = 0;
4284 SMDS_MeshElement::iterator volNode = vol->begin_nodes();
4285 for ( int nb = nbN; nb > 0; ++volNode, --nb )
4288 if ( n->GetPosition()->GetDim() == 3 )
4290 else if ( subIDs.count( n->getshapeId() ))
4291 nOnFace.push_back( n );
4295 if ( !nInSolid || nOnFace.size() != nbN - 1 )
4298 // get size of the vol
4299 SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
4300 double volLength = pInSolid.SquareDistance( nOnFace[0] );
4301 for ( size_t i = 1; i < nOnFace.size(); ++i )
4303 volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
4306 // check if vol is close to concaveFaces
4307 const SMDS_MeshElement* closeFace =
4308 faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
4310 pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
4313 // check if vol is distorted, i.e. a medium node is much closer
4314 // to nInSolid than the link middle
4315 bool isDistorted = false;
4316 SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
4317 if ( !SMESH_MeshAlgos::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
4319 theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
4320 vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
4321 for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
4322 for ( size_t j = i+1; j < nOnFace.size(); ++j )
4324 SMESH_TLink link( nOnFace[i], nOnFace[j] );
4325 TLinkNodeMap::const_iterator linkIt =
4326 theHelper.GetTLinkNodeMap().find( link );
4327 if ( linkIt != theHelper.GetTLinkNodeMap().end() )
4329 links.push_back( make_pair( linkIt->first, linkIt->second ));
4330 if ( !isDistorted ) {
4331 // compare projections of nInSolid and nMedium to face normal
4332 gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
4333 double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
4334 double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
4335 isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
4339 // move medium nodes to link middle
4342 for ( size_t i = 0; i < links.size(); ++i )
4344 const SMDS_MeshNode* nMedium = links[i].second;
4345 if ( movedNodes.insert( nMedium ).second )
4347 gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
4348 SMESH_TNodeXYZ( links[i].first.node2() ));
4349 meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4350 MSG( "move OUT of solid " << nMedium );
4353 theError->myBadElements.push_back( vol );
4355 } // loop on volumes sharing a node on FACE
4356 } // loop on nodes on FACE
4357 } // loop on FACEs of a SOLID
4359 if ( !theError->myBadElements.empty() )
4360 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4366 //=======================================================================
4368 * \brief Move medium nodes of faces and volumes to fix distorted elements
4369 * \param error - container of fixed distorted elements
4370 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
4372 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
4374 //=======================================================================
4376 void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& compError,
4379 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
4380 if ( getenv("NO_FixQuadraticElements") )
4383 // 0. Apply algorithm to SOLIDs or FACEs
4384 // ----------------------------------------------
4385 if ( myShape.IsNull() ) {
4386 if ( !myMesh->HasShapeToMesh() ) return;
4387 SetSubShape( myMesh->GetShapeToMesh() );
4391 TopTools_IndexedMapOfShape solids;
4392 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
4393 nbSolids = solids.Extent();
4395 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
4396 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
4397 faces.Add( f.Current() ); // not in solid
4399 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
4400 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
4401 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
4402 faces.Add( f.Current() ); // in not meshed solid
4404 else { // fix nodes in the solid and its faces
4406 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
4408 SMESH_MesherHelper h(*myMesh);
4409 h.SetSubShape( s.Current() );
4410 h.ToFixNodeParameters(true);
4411 h.FixQuadraticElements( compError, false );
4414 // fix nodes on geom faces
4416 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
4418 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
4419 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
4420 SMESH_MesherHelper h(*myMesh);
4421 h.SetSubShape( fIt.Key() );
4422 h.ToFixNodeParameters(true);
4423 h.FixQuadraticElements( compError, true);
4425 //perf_print_all_meters(1);
4426 if ( compError && compError->myName == EDITERR_NO_MEDIUM_ON_GEOM )
4427 compError->myComment = "during conversion to quadratic, "
4428 "some medium nodes were not placed on geometry to avoid distorting elements";
4432 // 1. Find out type of elements and get iterator on them
4433 // ---------------------------------------------------
4435 SMDS_ElemIteratorPtr elemIt;
4436 SMDSAbs_ElementType elemType = SMDSAbs_All;
4438 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
4441 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
4442 elemIt = smDS->GetElements();
4443 if ( elemIt->more() ) {
4444 elemType = elemIt->next()->GetType();
4445 elemIt = smDS->GetElements();
4448 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
4451 // 2. Fill in auxiliary data structures
4452 // ----------------------------------
4456 set< QLink >::iterator pLink;
4457 set< QFace >::iterator pFace;
4459 bool isCurved = false;
4460 //bool hasRectFaces = false;
4461 //set<int> nbElemNodeSet;
4462 SMDS_VolumeTool volTool;
4464 TIDSortedNodeSet apexOfPyramid;
4465 const int apexIndex = 4;
4468 // Move medium nodes to the link middle for elements whose corner nodes
4469 // are out of geometrical boundary to fix distorted elements.
4470 force3DOutOfBoundary( *this, compError );
4472 if ( elemType == SMDSAbs_Volume )
4474 while ( elemIt->more() ) // loop on volumes
4476 const SMDS_MeshElement* vol = elemIt->next();
4477 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
4479 double volMinSize2 = -1.;
4480 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
4482 int nbN = volTool.NbFaceNodes( iF );
4483 //nbElemNodeSet.insert( nbN );
4484 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
4485 vector< const QLink* > faceLinks( nbN/2 );
4486 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
4489 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
4490 pLink = links.insert( link ).first;
4491 faceLinks[ iN/2 ] = & *pLink;
4493 if ( link.MediumPos() == SMDS_TOP_3DSPACE )
4495 if ( !link.IsStraight() )
4496 return; // already fixed
4498 else if ( !isCurved )
4500 if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
4501 isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
4505 pFace = faces.insert( QFace( faceLinks )).first;
4506 if ( pFace->NbVolumes() == 0 )
4507 pFace->AddSelfToLinks();
4508 pFace->SetVolume( vol );
4509 // hasRectFaces = hasRectFaces ||
4510 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
4511 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
4514 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
4516 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
4517 faceNodes[4],faceNodes[6] );
4520 // collect pyramid apexes for further correction
4521 if ( vol->NbCornerNodes() == 5 )
4522 apexOfPyramid.insert( vol->GetNode( apexIndex ));
4524 set< QLink >::iterator pLink = links.begin();
4525 for ( ; pLink != links.end(); ++pLink )
4526 pLink->SetContinuesFaces();
4530 while ( elemIt->more() ) // loop on faces
4532 const SMDS_MeshElement* face = elemIt->next();
4533 if ( !face->IsQuadratic() )
4535 //nbElemNodeSet.insert( face->NbNodes() );
4536 int nbN = face->NbNodes()/2;
4537 vector< const QLink* > faceLinks( nbN );
4538 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
4541 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
4542 pLink = links.insert( link ).first;
4543 faceLinks[ iN ] = & *pLink;
4545 link.node1()->GetPosition()->GetTypeOfPosition() < 2 &&
4546 link.node2()->GetPosition()->GetTypeOfPosition() < 2 )
4547 isCurved = !link.IsStraight();
4550 pFace = faces.insert( QFace( faceLinks )).first;
4551 pFace->AddSelfToLinks();
4552 //hasRectFaces = ( hasRectFaces || nbN == 4 );
4556 return; // no curved edges of faces
4558 // 3. Compute displacement of medium nodes
4559 // ---------------------------------------
4561 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones.
4562 TopLoc_Location loc;
4564 // not to treat boundary of volumic sub-mesh.
4565 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
4566 for ( ; isInside < 2; ++isInside )
4568 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
4569 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
4570 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
4572 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
4573 if ( bool(isInside) == pFace->IsBoundary() )
4575 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
4578 // make chain of links connected via continues faces
4581 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
4583 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
4585 vector< TChain > chains;
4586 if ( error == ERR_OK ) { // chain contains continues rectangles
4588 chains[0].splice( chains[0].begin(), rawChain );
4590 else if ( error == ERR_TRI ) { // chain contains continues triangles
4591 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
4592 if ( res != _OK ) { // not quadrangles split into triangles
4593 fixTriaNearBoundary( rawChain, *this );
4597 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
4598 fixPrism( rawChain );
4604 for ( int iC = 0; iC < chains.size(); ++iC )
4606 TChain& chain = chains[iC];
4607 if ( chain.empty() ) continue;
4608 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
4609 MSG("3D straight - ignore");
4612 if ( chain.front()->MediumPos() > bndPos ||
4613 chain.back() ->MediumPos() > bndPos ) {
4614 MSG("Internal chain - ignore");
4617 // mesure chain length and compute link position along the chain
4618 double chainLen = 0;
4619 vector< double > linkPos;
4620 MSGBEG( "Link medium nodes: ");
4621 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
4622 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
4623 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
4624 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4625 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
4626 link1 = chain.erase( link1 );
4627 if ( link1 == chain.end() )
4629 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4632 linkPos.push_back( chainLen );
4635 if ( linkPos.size() < 2 )
4638 gp_Vec move0 = chain.front()->_nodeMove;
4639 gp_Vec move1 = chain.back ()->_nodeMove;
4644 // compute node displacement of end links of chain in parametric space of face
4645 TChainLink& linkOnFace = *(++chain.begin());
4646 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
4647 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
4648 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
4650 face = TopoDS::Face( f );
4651 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
4653 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
4655 TChainLink& link = is1 ? chain.back() : chain.front();
4656 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
4657 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
4658 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
4659 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4660 // uvMove = uvm - uv12
4661 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
4662 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
4663 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
4664 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
4665 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
4666 10 * uvMove.SquareModulus());
4668 if ( isStraight[0] && isStraight[1] ) {
4669 MSG("2D straight - ignore");
4670 continue; // straight - no need to move nodes of internal links
4673 // check if a chain is already fixed
4674 gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
4675 gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
4676 gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
4677 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4678 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
4680 MSG("Already fixed - ignore");
4686 if ( isInside || face.IsNull() )
4688 // compute node displacement of end links in their local coord systems
4690 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
4691 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
4692 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4693 move0.Transform(trsf);
4696 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
4697 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
4698 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4699 move1.Transform(trsf);
4702 // compute displacement of medium nodes
4703 link2 = chain.begin();
4706 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
4708 double r = linkPos[i] / chainLen;
4709 // displacement in local coord system
4710 gp_Vec move = (1. - r) * move0 + r * move1;
4711 if ( isInside || face.IsNull()) {
4712 // transform to global
4713 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
4714 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
4715 gp_Vec x = x01.Normalized() + x12.Normalized();
4716 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
4717 move.Transform(trsf);
4720 // compute 3D displacement by 2D one
4721 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
4722 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
4723 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
4724 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
4725 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
4726 if ( SMDS_FacePosition* nPos =
4727 dynamic_cast< SMDS_FacePosition* >((*link1)->_mediumNode->GetPosition()))
4728 nPos->SetParameters( newUV.X(), newUV.Y() );
4730 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
4731 move.SquareMagnitude())
4733 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
4734 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
4735 MSG( "TOO LONG MOVE \t" <<
4736 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
4737 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
4738 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
4739 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
4743 (*link1)->Move( move );
4744 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
4745 << chain.front()->_mediumNode->GetID() <<"-"
4746 << chain.back ()->_mediumNode->GetID() <<
4747 " by " << move.Magnitude());
4749 } // loop on chains of links
4750 } // loop on 2 directions of propagation from quadrangle
4752 } // fix faces and/or volumes
4757 TIDSortedElemSet biQuadQuas, biQuadTris, triQuadHexa;
4758 const SMDS_MeshElement *biQuadQua, *triQuadHex;
4759 const bool toFixCentralNodes = ( myMesh->NbBiQuadQuadrangles() +
4760 myMesh->NbBiQuadTriangles() +
4761 myMesh->NbTriQuadraticHexas() );
4763 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
4764 if ( pLink->IsMoved() )
4766 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
4767 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
4769 // collect bi-quadratic elements
4770 if ( toFixCentralNodes )
4772 biQuadQua = triQuadHex = 0;
4773 SMDS_ElemIteratorPtr eIt = pLink->_mediumNode->GetInverseElementIterator();
4774 while ( eIt->more() )
4776 const SMDS_MeshElement* e = eIt->next();
4777 switch( e->GetEntityType() ) {
4778 case SMDSEntity_BiQuad_Quadrangle: biQuadQuas.insert( e ); break;
4779 case SMDSEntity_BiQuad_Triangle: biQuadTris.insert( e ); break;
4780 case SMDSEntity_TriQuad_Hexa: triQuadHexa.insert( e ); break;
4787 // Fix positions of central nodes of bi-tri-quadratic elements
4789 // treat bi-quad quadrangles
4791 vector< const SMDS_MeshNode* > nodes( 9 );
4793 TIDSortedElemSet::iterator quadIt = biQuadQuas.begin();
4794 for ( ; quadIt != biQuadQuas.end(); ++quadIt )
4796 const SMDS_MeshElement* quad = *quadIt;
4799 nodes.assign( quad->begin_nodes(), quad->end_nodes() );
4801 TopoDS_Shape S = GetSubShapeByNode( nodes.back(), GetMeshDS() );
4802 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4803 const TopoDS_Face& F = TopoDS::Face( S );
4804 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4805 const double tol = BRep_Tool::Tolerance( F );
4807 for ( int i = 0; i < 8; ++i )
4809 uv[ i ] = GetNodeUV( F, nodes[i], nodes[8], &checkUV );
4810 // as this method is used after mesh generation, UV of nodes is not
4811 // updated according to bending links, so we update
4812 if ( i > 3 && nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4813 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4815 // move the central node
4816 gp_XY uvCent = calcTFI (0.5, 0.5, uv[0],uv[1],uv[2],uv[3],uv[4],uv[5],uv[6],uv[7] );
4817 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4818 GetMeshDS()->MoveNode( nodes[8], p.X(), p.Y(), p.Z());
4822 // treat bi-quad triangles
4824 vector< const SMDS_MeshNode* > nodes;
4826 TIDSortedElemSet::iterator triIt = biQuadTris.begin();
4827 for ( ; triIt != biQuadTris.end(); ++triIt )
4829 const SMDS_MeshElement* tria = *triIt;
4831 const TopoDS_Shape& S = GetMeshDS()->IndexToShape( tria->getshapeId() );
4832 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4833 const TopoDS_Face& F = TopoDS::Face( S );
4834 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4835 const double tol = BRep_Tool::Tolerance( F );
4838 nodes.assign( tria->begin_nodes(), tria->end_nodes() );
4840 for ( int i = 0; i < 6; ++i )
4842 uv[ i ] = GetNodeUV( F, nodes[i], nodes[(i+1)%3], &checkUV );
4843 // as this method is used after mesh generation, UV of nodes is not
4844 // updated according to bending links, so we update
4845 if ( nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4846 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4848 // move the central node
4849 gp_XY uvCent = GetCenterUV( uv[0], uv[1], uv[2], uv[3], uv[4], uv[5] );
4850 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4851 GetMeshDS()->MoveNode( tria->GetNode(6), p.X(), p.Y(), p.Z() );
4855 // treat tri-quadratic hexahedra
4857 SMDS_VolumeTool volExp;
4858 TIDSortedElemSet::iterator hexIt = triQuadHexa.begin();
4859 for ( ; hexIt != triQuadHexa.end(); ++hexIt )
4861 volExp.Set( *hexIt, /*ignoreCentralNodes=*/false );
4863 // fix nodes central in sides
4864 for ( int iQuad = 0; iQuad < volExp.NbFaces(); ++iQuad )
4866 const SMDS_MeshNode** quadNodes = volExp.GetFaceNodes( iQuad );
4867 if ( quadNodes[8]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
4869 gp_XYZ p = calcTFI( 0.5, 0.5,
4870 SMESH_TNodeXYZ( quadNodes[0] ), SMESH_TNodeXYZ( quadNodes[2] ),
4871 SMESH_TNodeXYZ( quadNodes[4] ), SMESH_TNodeXYZ( quadNodes[6] ),
4872 SMESH_TNodeXYZ( quadNodes[1] ), SMESH_TNodeXYZ( quadNodes[3] ),
4873 SMESH_TNodeXYZ( quadNodes[5] ), SMESH_TNodeXYZ( quadNodes[7] ));
4874 GetMeshDS()->MoveNode( quadNodes[8], p.X(), p.Y(), p.Z());
4878 // fix the volume central node
4879 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
4880 const SMDS_MeshNode** hexNodes = volExp.GetNodes();
4882 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( hexNodes[ 0 ] );
4883 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( hexNodes[ 3 ] );
4884 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( hexNodes[ 1 ] );
4885 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( hexNodes[ 2 ] );
4886 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( hexNodes[ 4 ] );
4887 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( hexNodes[ 7 ] );
4888 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( hexNodes[ 5 ] );
4889 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( hexNodes[ 6 ] );
4891 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( hexNodes[ 11 ] );
4892 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( hexNodes[ 9 ] );
4893 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( hexNodes[ 8 ] );
4894 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( hexNodes[ 10 ] );
4895 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( hexNodes[ 15 ] );
4896 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( hexNodes[ 13 ] );
4897 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( hexNodes[ 12 ] );
4898 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( hexNodes[ 14 ] );
4899 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( hexNodes[ 16 ] );
4900 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( hexNodes[ 19 ] );
4901 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( hexNodes[ 17 ] );
4902 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( hexNodes[ 18 ] );
4904 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( hexNodes[ 20 ] );
4905 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( hexNodes[ 25 ] );
4906 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( hexNodes[ 21 ] );
4907 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( hexNodes[ 23 ] );
4908 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( hexNodes[ 24 ] );
4909 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( hexNodes[ 22 ] );
4911 gp_XYZ nCenterParams(0.5, 0.5, 0.5), nCenterCoords;
4912 SMESH_Block::ShellPoint( nCenterParams, pointsOnShapes, nCenterCoords );
4913 GetMeshDS()->MoveNode( hexNodes[26],
4914 nCenterCoords.X(), nCenterCoords.Y(), nCenterCoords.Z());