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() );
246 Handle(Geom_Surface) surface = BRep_Tool::Surface( face, loc );
248 // if ( surface->IsUPeriodic() || surface->IsVPeriodic() ||
249 // surface->IsUClosed() || surface->IsVClosed() )
251 //while ( surface->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
252 //surface = Handle(Geom_RectangularTrimmedSurface)::DownCast( surface )->BasisSurface();
253 GeomAdaptor_Surface surf( surface );
255 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
257 // look for a seam edge
258 const TopoDS_Edge& edge = TopoDS::Edge( exp.Current() );
259 if ( BRep_Tool::IsClosed( edge, face )) {
260 // initialize myPar1, myPar2 and myParIndex
262 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
263 if ( Abs( uv1.Coord(1) - uv2.Coord(1) ) < Abs( uv1.Coord(2) - uv2.Coord(2) ))
265 myParIndex |= U_periodic;
266 myPar1[0] = surf.FirstUParameter();
267 myPar2[0] = surf.LastUParameter();
270 myParIndex |= V_periodic;
271 myPar1[1] = surf.FirstVParameter();
272 myPar2[1] = surf.LastVParameter();
274 // store seam shape indices, negative if shape encounters twice
275 int edgeID = meshDS->ShapeToIndex( edge );
276 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
277 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
278 int vertexID = meshDS->ShapeToIndex( v.Current() );
279 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
283 // look for a degenerated edge
284 if ( SMESH_Algo::isDegenerated( edge )) {
285 myDegenShapeIds.insert( meshDS->ShapeToIndex( edge ));
286 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
287 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
290 if ( !myDegenShapeIds.empty() && !myParIndex ) {
291 if ( surface->IsUPeriodic() || surface->IsUClosed() ) {
292 myParIndex |= U_periodic;
293 myPar1[0] = surf.FirstUParameter();
294 myPar2[0] = surf.LastUParameter();
296 else if ( surface->IsVPeriodic() || surface->IsVClosed() ) {
297 myParIndex |= V_periodic;
298 myPar1[1] = surf.FirstVParameter();
299 myPar2[1] = surf.LastVParameter();
306 //=======================================================================
307 //function : GetNodeUVneedInFaceNode
308 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
309 // Return true if the face is periodic.
310 // If F is Null, answer about sub-shape set through IsQuadraticSubMesh() or
312 //=======================================================================
314 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
316 if ( F.IsNull() ) return !mySeamShapeIds.empty();
318 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
319 return !mySeamShapeIds.empty();
322 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
323 if ( !aSurface.IsNull() )
324 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
329 //=======================================================================
330 //function : IsMedium
332 //=======================================================================
334 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
335 const SMDSAbs_ElementType typeToCheck)
337 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
340 //=======================================================================
341 //function : GetSubShapeByNode
342 //purpose : Return support shape of a node
343 //=======================================================================
345 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
346 const SMESHDS_Mesh* meshDS)
348 int shapeID = node ? node->getshapeId() : 0;
349 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
350 return meshDS->IndexToShape( shapeID );
352 return TopoDS_Shape();
356 //=======================================================================
357 //function : AddTLinkNode
358 //purpose : add a link in my data structure
359 //=======================================================================
361 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
362 const SMDS_MeshNode* n2,
363 const SMDS_MeshNode* n12)
365 // add new record to map
366 SMESH_TLink link( n1, n2 );
367 myTLinkNodeMap.insert( make_pair(link,n12));
370 //================================================================================
372 * \brief Add quadratic links of edge to own data structure
374 //================================================================================
376 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
378 if ( edge->IsQuadratic() )
379 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
382 //================================================================================
384 * \brief Add quadratic links of face to own data structure
386 //================================================================================
388 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
391 switch ( f->NbNodes() ) {
393 // myMapWithCentralNode.insert
394 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2) ),
396 // break; -- add medium nodes as well
398 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
399 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
400 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
403 // myMapWithCentralNode.insert
404 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2),f->GetNode(3) ),
406 // break; -- add medium nodes as well
408 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
409 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
410 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
411 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7)); break;
416 //================================================================================
418 * \brief Add quadratic links of volume to own data structure
420 //================================================================================
422 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
424 if ( volume->IsQuadratic() )
426 SMDS_VolumeTool vTool( volume );
427 const SMDS_MeshNode** nodes = vTool.GetNodes();
429 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
431 const int nbN = vTool.NbFaceNodes( iF );
432 const int* iNodes = vTool.GetFaceNodesIndices( iF );
433 for ( int i = 0; i < nbN; )
435 int iN1 = iNodes[i++];
436 int iN12 = iNodes[i++];
438 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
439 int linkID = iN1 * vTool.NbNodes() + iN2;
440 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
441 if ( it_isNew.second )
442 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
444 addedLinks.erase( it_isNew.first ); // each link encounters only twice
446 if ( vTool.NbNodes() == 27 )
448 const SMDS_MeshNode* nFCenter = nodes[ vTool.GetCenterNodeIndex( iF )];
449 if ( nFCenter->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
450 myMapWithCentralNode.insert
451 ( make_pair( TBiQuad( nodes[ iNodes[0]], nodes[ iNodes[1]],
452 nodes[ iNodes[2]], nodes[ iNodes[3]] ),
459 //================================================================================
461 * \brief Return true if position of nodes on the shape hasn't yet been checked or
462 * the positions proved to be invalid
464 //================================================================================
466 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
468 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
469 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
472 //================================================================================
474 * \brief Set validity of positions of nodes on the shape.
475 * Once set, validity is not changed
477 //================================================================================
479 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
481 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok));
484 //=======================================================================
485 //function : ToFixNodeParameters
486 //purpose : Enables fixing node parameters on EDGEs and FACEs in
487 // GetNodeU(...,check=true), GetNodeUV(...,check=true), CheckNodeUV() and
488 // CheckNodeU() in case if a node lies on a shape set via SetSubShape().
490 //=======================================================================
492 void SMESH_MesherHelper::ToFixNodeParameters(bool toFix)
494 myFixNodeParameters = toFix;
498 //=======================================================================
499 //function : GetUVOnSeam
500 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
501 //=======================================================================
503 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
505 gp_Pnt2d result = uv1;
506 for ( int i = U_periodic; i <= V_periodic ; ++i )
508 if ( myParIndex & i )
510 double p1 = uv1.Coord( i );
511 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
512 if ( myParIndex == i ||
513 dp1 < ( myPar2[i-1] - myPar2[i-1] ) / 100. ||
514 dp2 < ( myPar2[i-1] - myPar2[i-1] ) / 100. )
516 double p2 = uv2.Coord( i );
517 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
518 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
519 result.SetCoord( i, p1Alt );
526 //=======================================================================
527 //function : GetNodeUV
528 //purpose : Return node UV on face
529 //=======================================================================
531 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
532 const SMDS_MeshNode* n,
533 const SMDS_MeshNode* n2,
536 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
538 const SMDS_PositionPtr Pos = n->GetPosition();
540 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
542 // node has position on face
543 const SMDS_FacePosition* fpos =
544 static_cast<const SMDS_FacePosition*>(n->GetPosition());
545 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
547 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
549 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
551 // node has position on edge => it is needed to find
552 // corresponding edge from face, get pcurve for this
553 // edge and retrieve value from this pcurve
554 const SMDS_EdgePosition* epos =
555 static_cast<const SMDS_EdgePosition*>(n->GetPosition());
556 int edgeID = n->getshapeId();
557 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
558 double f, l, u = epos->GetUParameter();
559 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
560 bool validU = ( f < u && u < l );
562 uv = C2d->Value( u );
564 uv.SetCoord( Precision::Infinite(),0.);
565 if ( check || !validU )
566 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ),/*force=*/ !validU );
568 // for a node on a seam edge select one of UVs on 2 pcurves
569 if ( n2 && IsSeamShape( edgeID ) )
571 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
574 { // adjust uv to period
576 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
577 Standard_Boolean isUPeriodic = S->IsUPeriodic();
578 Standard_Boolean isVPeriodic = S->IsVPeriodic();
579 if ( isUPeriodic || isVPeriodic ) {
580 Standard_Real UF,UL,VF,VL;
581 S->Bounds(UF,UL,VF,VL);
583 uv.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
585 uv.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
589 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
591 if ( int vertexID = n->getshapeId() ) {
592 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
594 uv = BRep_Tool::Parameters( V, F );
597 catch (Standard_Failure& exc) {
600 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
601 uvOK = ( V == vert.Current() );
603 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
604 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
605 // get UV of a vertex closest to the node
607 gp_Pnt pn = XYZ( n );
608 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
609 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
610 gp_Pnt p = BRep_Tool::Pnt( curV );
611 double curDist = p.SquareDistance( pn );
612 if ( curDist < dist ) {
614 uv = BRep_Tool::Parameters( curV, F );
615 uvOK = ( dist < DBL_MIN );
621 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
622 for ( ; it.More(); it.Next() ) {
623 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
624 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
626 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
627 if ( !C2d.IsNull() ) {
628 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
629 uv = C2d->Value( u );
637 if ( n2 && IsSeamShape( vertexID ) )
638 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
643 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
652 //=======================================================================
653 //function : CheckNodeUV
654 //purpose : Check and fix node UV on a face
655 //=======================================================================
657 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
658 const SMDS_MeshNode* n,
662 double distXYZ[4]) const
664 int shapeID = n->getshapeId();
665 bool infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ));
666 if ( force || toCheckPosOnShape( shapeID ) || infinit )
668 // check that uv is correct
670 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
671 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
673 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
675 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
677 setPosOnShapeValidity( shapeID, false );
678 if ( !infinit && distXYZ ) {
679 surfPnt.Transform( loc );
681 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
683 // uv incorrect, project the node to surface
684 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
685 projector.Perform( nodePnt );
686 if ( !projector.IsDone() || projector.NbPoints() < 1 )
688 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
691 Quantity_Parameter U,V;
692 projector.LowerDistanceParameters(U,V);
694 surfPnt = surface->Value( U, V );
695 dist = nodePnt.Distance( surfPnt );
697 surfPnt.Transform( loc );
699 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
703 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
706 // store the fixed UV on the face
707 if ( myShape.IsSame(F) && shapeID == myShapeID && myFixNodeParameters )
708 const_cast<SMDS_MeshNode*>(n)->SetPosition
709 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
711 else if ( uv.Modulus() > numeric_limits<double>::min() )
713 setPosOnShapeValidity( shapeID, true );
719 //=======================================================================
720 //function : GetProjector
721 //purpose : Return projector intitialized by given face without location, which is returned
722 //=======================================================================
724 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
725 TopLoc_Location& loc,
728 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
729 int faceID = GetMeshDS()->ShapeToIndex( F );
730 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
731 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
732 if ( i_proj == i2proj.end() )
734 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
735 double U1, U2, V1, V2;
736 surface->Bounds(U1, U2, V1, V2);
737 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
738 proj->Init( surface, U1, U2, V1, V2, tol );
739 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
741 return *( i_proj->second );
746 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
747 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
748 gp_XY_FunPtr(Subtracted);
751 //=======================================================================
752 //function : applyIn2D
753 //purpose : Perform given operation on two 2d points in parameric space of given surface.
754 // It takes into account period of the surface. Use gp_XY_FunPtr macro
755 // to easily define pointer to function of gp_XY class.
756 //=======================================================================
758 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
762 const bool resultInPeriod)
764 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
765 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
766 if ( !isUPeriodic && !isVPeriodic )
769 // move uv2 not far than half-period from uv1
771 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
773 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
776 gp_XY res = fun( uv1, gp_XY(u2,v2) );
778 // move result within period
779 if ( resultInPeriod )
781 Standard_Real UF,UL,VF,VL;
782 surface->Bounds(UF,UL,VF,VL);
784 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
786 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
791 //=======================================================================
792 //function : GetMiddleUV
793 //purpose : Return middle UV taking in account surface period
794 //=======================================================================
796 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
801 // the proper place of getting basic surface seems to be in applyIn2D()
802 // but we put it here to decrease a risk of regressions just before releasing a version
803 Handle(Geom_Surface) surf = surface;
804 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
805 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
807 return applyIn2D( surf, p1, p2, & AverageUV );
810 //=======================================================================
811 //function : GetCenterUV
812 //purpose : Return UV for the central node of a biquadratic triangle
813 //=======================================================================
815 gp_XY SMESH_MesherHelper::GetCenterUV(const gp_XY& uv1,
821 bool * isBadTria/*=0*/)
824 gp_XY uvAvg = ( uv12 + uv23 + uv31 ) / 3.;
826 if (( badTria = (( uvAvg - uv1 ) * ( uvAvg - uv23 ) > 0 )))
827 uvAvg = ( uv1 + uv23 ) / 2.;
828 else if (( badTria = (( uvAvg - uv2 ) * ( uvAvg - uv31 ) > 0 )))
829 uvAvg = ( uv2 + uv31 ) / 2.;
830 else if (( badTria = (( uvAvg - uv3 ) * ( uvAvg - uv12 ) > 0 )))
831 uvAvg = ( uv3 + uv12 ) / 2.;
834 *isBadTria = badTria;
838 //=======================================================================
839 //function : GetNodeU
840 //purpose : Return node U on edge
841 //=======================================================================
843 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
844 const SMDS_MeshNode* n,
845 const SMDS_MeshNode* inEdgeNode,
848 double param = Precision::Infinite();
850 const SMDS_PositionPtr pos = n->GetPosition();
851 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
853 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
854 param = epos->GetUParameter();
856 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
858 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
861 BRep_Tool::Range( E, f,l );
862 double uInEdge = GetNodeU( E, inEdgeNode );
863 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
867 SMESHDS_Mesh * meshDS = GetMeshDS();
868 int vertexID = n->getshapeId();
869 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
870 param = BRep_Tool::Parameter( V, E );
875 double tol = BRep_Tool::Tolerance( E );
876 double f,l; BRep_Tool::Range( E, f,l );
877 bool force = ( param < f-tol || param > l+tol );
878 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
879 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
881 *check = CheckNodeU( E, n, param, 2*tol, force );
886 //=======================================================================
887 //function : CheckNodeU
888 //purpose : Check and fix node U on an edge
889 // Return false if U is bad and could not be fixed
890 //=======================================================================
892 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
893 const SMDS_MeshNode* n,
897 double distXYZ[4]) const
899 int shapeID = n->getshapeId();
900 bool infinit = Precision::IsInfinite( u );
901 if ( force || toCheckPosOnShape( shapeID ) || infinit )
903 TopLoc_Location loc; double f,l;
904 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
905 if ( curve.IsNull() ) // degenerated edge
907 if ( u+tol < f || u-tol > l )
909 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
915 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
916 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
921 curvPnt = curve->Value( u );
922 dist = nodePnt.Distance( curvPnt );
924 curvPnt.Transform( loc );
926 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
931 setPosOnShapeValidity( shapeID, false );
932 // u incorrect, project the node to the curve
933 int edgeID = GetMeshDS()->ShapeToIndex( E );
934 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
935 TID2ProjectorOnCurve::iterator i_proj =
936 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
937 if ( !i_proj->second )
939 i_proj->second = new GeomAPI_ProjectPointOnCurve();
940 i_proj->second->Init( curve, f, l );
942 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
943 projector->Perform( nodePnt );
944 if ( projector->NbPoints() < 1 )
946 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
949 Quantity_Parameter U = projector->LowerDistanceParameter();
951 MESSAGE(" f " << f << " l " << l << " u " << u);
952 curvPnt = curve->Value( u );
953 dist = nodePnt.Distance( curvPnt );
955 curvPnt.Transform( loc );
957 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
961 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
962 MESSAGE("distance " << dist << " " << tol );
965 // store the fixed U on the edge
966 if ( myShape.IsSame(E) && shapeID == myShapeID && myFixNodeParameters )
967 const_cast<SMDS_MeshNode*>(n)->SetPosition
968 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
970 else if ( fabs( u ) > numeric_limits<double>::min() )
972 setPosOnShapeValidity( shapeID, true );
974 if (( u < f-tol || u > l+tol ) && force )
976 MESSAGE("u < f-tol || u > l+tol ; u " << u << " f " << f << " l " << l);
977 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
980 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
981 double period = curve->Period();
982 u = ( u < f ) ? u + period : u - period;
984 catch (Standard_Failure& exc)
994 //=======================================================================
995 //function : GetMediumPos
996 //purpose : Return index and type of the shape (EDGE or FACE only) to
997 // set a medium node on
998 //param : useCurSubShape - if true, returns the shape set via SetSubShape()
1000 //=======================================================================
1002 std::pair<int, TopAbs_ShapeEnum>
1003 SMESH_MesherHelper::GetMediumPos(const SMDS_MeshNode* n1,
1004 const SMDS_MeshNode* n2,
1005 const bool useCurSubShape)
1007 if ( useCurSubShape && !myShape.IsNull() )
1008 return std::make_pair( myShapeID, myShape.ShapeType() );
1010 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1014 if (( myShapeID == n1->getshapeId() || myShapeID == n2->getshapeId() ) && myShapeID > 0 )
1016 shapeType = myShape.ShapeType();
1017 shapeID = myShapeID;
1019 else if ( n1->getshapeId() == n2->getshapeId() )
1021 shapeID = n2->getshapeId();
1022 shape = GetSubShapeByNode( n1, GetMeshDS() );
1026 const SMDS_TypeOfPosition Pos1 = n1->GetPosition()->GetTypeOfPosition();
1027 const SMDS_TypeOfPosition Pos2 = n2->GetPosition()->GetTypeOfPosition();
1029 if ( Pos1 == SMDS_TOP_3DSPACE || Pos2 == SMDS_TOP_3DSPACE )
1032 else if ( Pos1 == SMDS_TOP_FACE || Pos2 == SMDS_TOP_FACE )
1034 if ( Pos1 != SMDS_TOP_FACE || Pos2 != SMDS_TOP_FACE )
1036 if ( Pos1 != SMDS_TOP_FACE ) std::swap( n1,n2 );
1037 TopoDS_Shape F = GetSubShapeByNode( n1, GetMeshDS() );
1038 TopoDS_Shape S = GetSubShapeByNode( n2, GetMeshDS() );
1039 if ( IsSubShape( S, F ))
1041 shapeType = TopAbs_FACE;
1042 shapeID = n1->getshapeId();
1046 else if ( Pos1 == SMDS_TOP_EDGE && Pos2 == SMDS_TOP_EDGE )
1048 TopoDS_Shape E1 = GetSubShapeByNode( n1, GetMeshDS() );
1049 TopoDS_Shape E2 = GetSubShapeByNode( n2, GetMeshDS() );
1050 shape = GetCommonAncestor( E1, E2, *myMesh, TopAbs_FACE );
1052 else if ( Pos1 == SMDS_TOP_VERTEX && Pos2 == SMDS_TOP_VERTEX )
1054 TopoDS_Shape V1 = GetSubShapeByNode( n1, GetMeshDS() );
1055 TopoDS_Shape V2 = GetSubShapeByNode( n2, GetMeshDS() );
1056 shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_EDGE );
1057 if ( shape.IsNull() ) shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_FACE );
1059 else // VERTEX and EDGE
1061 if ( Pos1 != SMDS_TOP_VERTEX ) std::swap( n1,n2 );
1062 TopoDS_Shape V = GetSubShapeByNode( n1, GetMeshDS() );
1063 TopoDS_Shape E = GetSubShapeByNode( n2, GetMeshDS() );
1064 if ( IsSubShape( V, E ))
1067 shape = GetCommonAncestor( V, E, *myMesh, TopAbs_FACE );
1071 if ( !shape.IsNull() )
1074 shapeID = GetMeshDS()->ShapeToIndex( shape );
1075 shapeType = shape.ShapeType();
1077 return make_pair( shapeID, shapeType );
1080 //=======================================================================
1081 //function : GetCentralNode
1082 //purpose : Return existing or create a new central node for a quardilateral
1083 // quadratic face given its 8 nodes.
1084 //@param : force3d - true means node creation in between the given nodes,
1085 // else node position is found on a geometrical face if any.
1086 //=======================================================================
1088 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1089 const SMDS_MeshNode* n2,
1090 const SMDS_MeshNode* n3,
1091 const SMDS_MeshNode* n4,
1092 const SMDS_MeshNode* n12,
1093 const SMDS_MeshNode* n23,
1094 const SMDS_MeshNode* n34,
1095 const SMDS_MeshNode* n41,
1098 SMDS_MeshNode *centralNode = 0; // central node to return
1100 // Find an existing central node
1102 TBiQuad keyOfMap(n1,n2,n3,n4);
1103 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1104 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1105 if ( itMapCentralNode != myMapWithCentralNode.end() )
1107 return (*itMapCentralNode).second;
1110 // Get type of shape for the new central node
1112 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1116 TopTools_ListIteratorOfListOfShape it;
1118 std::map< int, int > faceId2nbNodes;
1119 std::map< int, int > ::iterator itMapWithIdFace;
1121 SMESHDS_Mesh* meshDS = GetMeshDS();
1123 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1124 // on sub-shapes of the FACE
1125 if ( GetMesh()->HasShapeToMesh() )
1127 const SMDS_MeshNode* nodes[] = { n1, n2, n3, n4 };
1128 for(int i = 0; i < 4; i++)
1130 shape = GetSubShapeByNode( nodes[i], meshDS );
1131 if ( shape.IsNull() ) break;
1132 if ( shape.ShapeType() == TopAbs_SOLID )
1134 solidID = nodes[i]->getshapeId();
1135 shapeType = TopAbs_SOLID;
1138 if ( shape.ShapeType() == TopAbs_FACE )
1140 faceID = nodes[i]->getshapeId();
1141 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1142 itMapWithIdFace->second++;
1146 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1147 while ( const TopoDS_Shape* face = it->next() )
1149 faceID = meshDS->ShapeToIndex( *face );
1150 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1151 itMapWithIdFace->second++;
1156 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1158 // find ID of the FACE the four corner nodes belong to
1159 itMapWithIdFace = faceId2nbNodes.begin();
1160 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1162 if ( itMapWithIdFace->second == 4 )
1164 shapeType = TopAbs_FACE;
1165 faceID = (*itMapWithIdFace).first;
1172 if ( shapeType == TopAbs_FACE )
1174 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1181 bool toCheck = true;
1182 if ( !F.IsNull() && !force3d )
1184 uvAvg = calcTFI (0.5, 0.5,
1185 GetNodeUV(F,n1,n3,&toCheck), GetNodeUV(F,n2,n4,&toCheck),
1186 GetNodeUV(F,n3,n1,&toCheck), GetNodeUV(F,n4,n2,&toCheck),
1187 GetNodeUV(F,n12,n3), GetNodeUV(F,n23,n4),
1188 GetNodeUV(F,n34,n2), GetNodeUV(F,n41,n2));
1189 TopLoc_Location loc;
1190 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1191 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1192 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1193 // if ( mySetElemOnShape ) node is not elem!
1194 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1196 else // ( force3d || F.IsNull() )
1198 P = ( SMESH_TNodeXYZ( n1 ) +
1199 SMESH_TNodeXYZ( n2 ) +
1200 SMESH_TNodeXYZ( n3 ) +
1201 SMESH_TNodeXYZ( n4 ) ) / 4;
1202 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1204 if ( !F.IsNull() ) // force3d
1206 uvAvg = (GetNodeUV(F,n1,n3,&toCheck) +
1207 GetNodeUV(F,n2,n4,&toCheck) +
1208 GetNodeUV(F,n3,n1,&toCheck) +
1209 GetNodeUV(F,n4,n2,&toCheck)) / 4;
1210 //CheckNodeUV( F, centralNode, uvAvg, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1211 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1213 else if ( solidID > 0 )
1215 meshDS->SetNodeInVolume( centralNode, solidID );
1217 else if ( myShapeID > 0 && mySetElemOnShape )
1219 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1222 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1226 //=======================================================================
1227 //function : GetCentralNode
1228 //purpose : Return existing or create a new central node for a
1229 // quadratic triangle given its 6 nodes.
1230 //@param : force3d - true means node creation in between the given nodes,
1231 // else node position is found on a geometrical face if any.
1232 //=======================================================================
1234 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1235 const SMDS_MeshNode* n2,
1236 const SMDS_MeshNode* n3,
1237 const SMDS_MeshNode* n12,
1238 const SMDS_MeshNode* n23,
1239 const SMDS_MeshNode* n31,
1242 SMDS_MeshNode *centralNode = 0; // central node to return
1244 // Find an existing central node
1246 TBiQuad keyOfMap(n1,n2,n3);
1247 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1248 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1249 if ( itMapCentralNode != myMapWithCentralNode.end() )
1251 return (*itMapCentralNode).second;
1254 // Get type of shape for the new central node
1256 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1260 TopTools_ListIteratorOfListOfShape it;
1262 std::map< int, int > faceId2nbNodes;
1263 std::map< int, int > ::iterator itMapWithIdFace;
1265 SMESHDS_Mesh* meshDS = GetMeshDS();
1267 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1268 // on sub-shapes of the FACE
1269 if ( GetMesh()->HasShapeToMesh() )
1271 const SMDS_MeshNode* nodes[] = { n1, n2, n3 };
1272 for(int i = 0; i < 3; i++)
1274 shape = GetSubShapeByNode( nodes[i], meshDS );
1275 if ( shape.IsNull() ) break;
1276 if ( shape.ShapeType() == TopAbs_SOLID )
1278 solidID = nodes[i]->getshapeId();
1279 shapeType = TopAbs_SOLID;
1282 if ( shape.ShapeType() == TopAbs_FACE )
1284 faceID = nodes[i]->getshapeId();
1285 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1286 itMapWithIdFace->second++;
1290 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1291 while ( const TopoDS_Shape* face = it->next() )
1293 faceID = meshDS->ShapeToIndex( *face );
1294 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1295 itMapWithIdFace->second++;
1300 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1302 // find ID of the FACE the four corner nodes belong to
1303 itMapWithIdFace = faceId2nbNodes.begin();
1304 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1306 if ( itMapWithIdFace->second == 3 )
1308 shapeType = TopAbs_FACE;
1309 faceID = (*itMapWithIdFace).first;
1319 if ( shapeType == TopAbs_FACE )
1321 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1323 gp_XY uv1 = GetNodeUV( F, n1, n23, &check );
1324 gp_XY uv2 = GetNodeUV( F, n2, n31, &check );
1325 gp_XY uv3 = GetNodeUV( F, n3, n12, &check );
1326 gp_XY uv12 = GetNodeUV( F, n12, n3, &check );
1327 gp_XY uv23 = GetNodeUV( F, n23, n1, &check );
1328 gp_XY uv31 = GetNodeUV( F, n31, n2, &check );
1329 uvAvg = GetCenterUV( uv1,uv2,uv3, uv12,uv23,uv31, &badTria );
1334 // Create a central node
1337 if ( !F.IsNull() && !force3d )
1339 TopLoc_Location loc;
1340 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1341 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1342 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1343 // if ( mySetElemOnShape ) node is not elem!
1344 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1346 else // ( force3d || F.IsNull() )
1348 P = ( SMESH_TNodeXYZ( n12 ) +
1349 SMESH_TNodeXYZ( n23 ) +
1350 SMESH_TNodeXYZ( n31 ) ) / 3;
1351 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1353 if ( !F.IsNull() ) // force3d
1355 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1357 else if ( solidID > 0 )
1359 meshDS->SetNodeInVolume( centralNode, solidID );
1361 else if ( myShapeID > 0 && mySetElemOnShape )
1363 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1366 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1370 //=======================================================================
1371 //function : GetMediumNode
1372 //purpose : Return existing or create a new medium node between given ones
1373 //=======================================================================
1375 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
1376 const SMDS_MeshNode* n2,
1379 // Find existing node
1381 SMESH_TLink link(n1,n2);
1382 ItTLinkNode itLN = myTLinkNodeMap.find( link );
1383 if ( itLN != myTLinkNodeMap.end() ) {
1384 return (*itLN).second;
1387 // Create medium node
1390 SMESHDS_Mesh* meshDS = GetMeshDS();
1392 if ( IsSeamShape( n1->getshapeId() ))
1393 // to get a correct UV of a node on seam, the second node must have checked UV
1394 std::swap( n1, n2 );
1396 // get type of shape for the new medium node
1397 int faceID = -1, edgeID = -1;
1398 TopoDS_Edge E; double u [2];
1399 TopoDS_Face F; gp_XY uv[2];
1400 bool uvOK[2] = { false, false };
1402 pair<int, TopAbs_ShapeEnum> pos = GetMediumPos( n1, n2, mySetElemOnShape );
1403 // calling GetMediumPos() with useCurSubShape=mySetElemOnShape is OK only for the
1404 // case where the lower dim mesh is already constructed, else, nodes on EDGEs are
1405 // assigned to FACE, for example.
1407 // get positions of the given nodes on shapes
1408 if ( pos.second == TopAbs_FACE )
1410 F = TopoDS::Face(meshDS->IndexToShape( faceID = pos.first ));
1411 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
1412 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
1414 else if ( pos.second == TopAbs_EDGE )
1416 const SMDS_PositionPtr Pos1 = n1->GetPosition();
1417 const SMDS_PositionPtr Pos2 = n2->GetPosition();
1418 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1419 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1420 n1->getshapeId() != n2->getshapeId() )
1423 return getMediumNodeOnComposedWire(n1,n2,force3d);
1425 E = TopoDS::Edge(meshDS->IndexToShape( edgeID = pos.first ));
1426 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
1427 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
1430 if ( !force3d & uvOK[0] && uvOK[1] )
1432 // we try to create medium node using UV parameters of
1433 // nodes, else - medium between corresponding 3d points
1436 //if ( uvOK[0] && uvOK[1] )
1438 if ( IsDegenShape( n1->getshapeId() )) {
1439 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
1440 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
1442 else if ( IsDegenShape( n2->getshapeId() )) {
1443 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
1444 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
1447 TopLoc_Location loc;
1448 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
1449 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
1450 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
1451 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1452 // if ( mySetElemOnShape ) node is not elem!
1453 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
1454 myTLinkNodeMap.insert(make_pair(link,n12));
1458 else if ( !E.IsNull() )
1461 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1464 Standard_Boolean isPeriodic = C->IsPeriodic();
1467 Standard_Real Period = C->Period();
1468 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1469 Standard_Real pmid = (u[0]+p)/2.;
1470 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1475 gp_Pnt P = C->Value( U );
1476 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1477 //if ( mySetElemOnShape ) node is not elem!
1478 meshDS->SetNodeOnEdge(n12, edgeID, U);
1479 myTLinkNodeMap.insert(make_pair(link,n12));
1486 double x = ( n1->X() + n2->X() )/2.;
1487 double y = ( n1->Y() + n2->Y() )/2.;
1488 double z = ( n1->Z() + n2->Z() )/2.;
1489 n12 = meshDS->AddNode(x,y,z);
1491 //if ( mySetElemOnShape ) node is not elem!
1495 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1496 CheckNodeUV( F, n12, UV, 2 * BRep_Tool::Tolerance( F ), /*force=*/true);
1497 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1499 else if ( !E.IsNull() )
1501 double U = ( u[0] + u[1] ) / 2.;
1502 CheckNodeU( E, n12, U, 2 * BRep_Tool::Tolerance( E ), /*force=*/true);
1503 meshDS->SetNodeOnEdge(n12, edgeID, U);
1505 else if ( myShapeID > 0 && mySetElemOnShape )
1507 meshDS->SetMeshElementOnShape(n12, myShapeID);
1511 myTLinkNodeMap.insert( make_pair( link, n12 ));
1515 //================================================================================
1517 * \brief Makes a medium node if nodes reside different edges
1519 //================================================================================
1521 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1522 const SMDS_MeshNode* n2,
1525 gp_Pnt middle = 0.5 * XYZ(n1) + 0.5 * XYZ(n2);
1526 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1528 // To find position on edge and 3D position for n12,
1529 // project <middle> to 2 edges and select projection most close to <middle>
1531 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4];
1533 TopoDS_Edge edges[2];
1534 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1537 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1538 TopoDS_Shape shape = GetSubShapeByNode( n, GetMeshDS() );
1539 if ( shape.IsNull() || shape.ShapeType() != TopAbs_EDGE )
1542 // project to get U of projection and distance from middle to projection
1543 TopoDS_Edge edge = edges[ is2nd ] = TopoDS::Edge( shape );
1544 double node2MiddleDist = middle.Distance( XYZ(n) );
1545 double foundU = GetNodeU( edge, n );
1546 CheckNodeU( edge, n12, foundU, 2*BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1547 if ( distXYZ[0] < node2MiddleDist )
1549 distMiddleProj = distXYZ[0];
1554 if ( Precision::IsInfinite( distMiddleProj ))
1556 // both projections failed; set n12 on the edge of n1 with U of a common vertex
1557 TopoDS_Vertex vCommon;
1558 if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1559 u = BRep_Tool::Parameter( vCommon, edges[0] );
1562 double f,l, u0 = GetNodeU( edges[0], n1 );
1563 BRep_Tool::Range( edges[0],f,l );
1564 u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1570 // move n12 to position of a successfull projection
1571 double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1572 if ( !force3d && distMiddleProj > 2*tol )
1574 TopLoc_Location loc; double f,l;
1575 Handle(Geom_Curve) curve = BRep_Tool::Curve( edges[iOkEdge],loc,f,l );
1576 gp_Pnt p = curve->Value( u );
1577 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1580 //if ( mySetElemOnShape ) node is not elem!
1582 int edgeID = GetMeshDS()->ShapeToIndex( edges[iOkEdge] );
1583 if ( edgeID != n12->getshapeId() )
1584 GetMeshDS()->UnSetNodeOnShape( n12 );
1585 GetMeshDS()->SetNodeOnEdge(n12, edgeID, u);
1587 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1592 //=======================================================================
1593 //function : AddNode
1594 //purpose : Creates a node
1595 //=======================================================================
1597 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID,
1600 SMESHDS_Mesh * meshDS = GetMeshDS();
1601 SMDS_MeshNode* node = 0;
1603 node = meshDS->AddNodeWithID( x, y, z, ID );
1605 node = meshDS->AddNode( x, y, z );
1606 if ( mySetElemOnShape && myShapeID > 0 ) { // node is not elem ?
1607 switch ( myShape.ShapeType() ) {
1608 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1609 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1610 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID, u, v); break;
1611 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID, u); break;
1612 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1619 //=======================================================================
1620 //function : AddEdge
1621 //purpose : Creates quadratic or linear edge
1622 //=======================================================================
1624 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1625 const SMDS_MeshNode* n2,
1629 SMESHDS_Mesh * meshDS = GetMeshDS();
1631 SMDS_MeshEdge* edge = 0;
1632 if (myCreateQuadratic) {
1633 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1635 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1637 edge = meshDS->AddEdge(n1, n2, n12);
1641 edge = meshDS->AddEdgeWithID(n1, n2, id);
1643 edge = meshDS->AddEdge(n1, n2);
1646 if ( mySetElemOnShape && myShapeID > 0 )
1647 meshDS->SetMeshElementOnShape( edge, myShapeID );
1652 //=======================================================================
1653 //function : AddFace
1654 //purpose : Creates quadratic or linear triangle
1655 //=======================================================================
1657 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1658 const SMDS_MeshNode* n2,
1659 const SMDS_MeshNode* n3,
1663 SMESHDS_Mesh * meshDS = GetMeshDS();
1664 SMDS_MeshFace* elem = 0;
1666 if( n1==n2 || n2==n3 || n3==n1 )
1669 if(!myCreateQuadratic) {
1671 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1673 elem = meshDS->AddFace(n1, n2, n3);
1676 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1677 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1678 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1679 if(myCreateBiQuadratic)
1681 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n12, n23, n31, force3d);
1683 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, nCenter, id);
1685 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31, nCenter);
1690 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1692 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1695 if ( mySetElemOnShape && myShapeID > 0 )
1696 meshDS->SetMeshElementOnShape( elem, myShapeID );
1701 //=======================================================================
1702 //function : AddFace
1703 //purpose : Creates bi-quadratic, quadratic or linear quadrangle
1704 //=======================================================================
1706 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1707 const SMDS_MeshNode* n2,
1708 const SMDS_MeshNode* n3,
1709 const SMDS_MeshNode* n4,
1713 SMESHDS_Mesh * meshDS = GetMeshDS();
1714 SMDS_MeshFace* elem = 0;
1717 return AddFace(n1,n3,n4,id,force3d);
1720 return AddFace(n1,n2,n4,id,force3d);
1723 return AddFace(n1,n2,n3,id,force3d);
1726 return AddFace(n1,n2,n4,id,force3d);
1729 return AddFace(n1,n2,n3,id,force3d);
1732 return AddFace(n1,n2,n3,id,force3d);
1735 if(!myCreateQuadratic) {
1737 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1739 elem = meshDS->AddFace(n1, n2, n3, n4);
1742 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1743 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1744 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1745 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1746 if(myCreateBiQuadratic)
1748 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n4, n12, n23, n34, n41, force3d);
1750 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, nCenter, id);
1752 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41, nCenter);
1757 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1759 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1762 if ( mySetElemOnShape && myShapeID > 0 )
1763 meshDS->SetMeshElementOnShape( elem, myShapeID );
1768 //=======================================================================
1769 //function : AddPolygonalFace
1770 //purpose : Creates polygon, with additional nodes in quadratic mesh
1771 //=======================================================================
1773 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1777 SMESHDS_Mesh * meshDS = GetMeshDS();
1778 SMDS_MeshFace* elem = 0;
1780 if(!myCreateQuadratic) {
1782 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1784 elem = meshDS->AddPolygonalFace(nodes);
1787 vector<const SMDS_MeshNode*> newNodes;
1788 for ( int i = 0; i < nodes.size(); ++i )
1790 const SMDS_MeshNode* n1 = nodes[i];
1791 const SMDS_MeshNode* n2 = nodes[(i+1)%nodes.size()];
1792 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1793 newNodes.push_back( n1 );
1794 newNodes.push_back( n12 );
1797 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1799 elem = meshDS->AddPolygonalFace(newNodes);
1801 if ( mySetElemOnShape && myShapeID > 0 )
1802 meshDS->SetMeshElementOnShape( elem, myShapeID );
1807 //=======================================================================
1808 //function : AddVolume
1809 //purpose : Creates quadratic or linear prism
1810 //=======================================================================
1812 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1813 const SMDS_MeshNode* n2,
1814 const SMDS_MeshNode* n3,
1815 const SMDS_MeshNode* n4,
1816 const SMDS_MeshNode* n5,
1817 const SMDS_MeshNode* n6,
1821 SMESHDS_Mesh * meshDS = GetMeshDS();
1822 SMDS_MeshVolume* elem = 0;
1823 if(!myCreateQuadratic) {
1825 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1827 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1830 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1831 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1832 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1834 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1835 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1836 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1838 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1839 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1840 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1843 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1844 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1846 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1847 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1849 if ( mySetElemOnShape && myShapeID > 0 )
1850 meshDS->SetMeshElementOnShape( elem, myShapeID );
1855 //=======================================================================
1856 //function : AddVolume
1857 //purpose : Creates quadratic or linear tetrahedron
1858 //=======================================================================
1860 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1861 const SMDS_MeshNode* n2,
1862 const SMDS_MeshNode* n3,
1863 const SMDS_MeshNode* n4,
1867 SMESHDS_Mesh * meshDS = GetMeshDS();
1868 SMDS_MeshVolume* elem = 0;
1869 if(!myCreateQuadratic) {
1871 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1873 elem = meshDS->AddVolume(n1, n2, n3, n4);
1876 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1877 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1878 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1880 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1881 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1882 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1885 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1887 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1889 if ( mySetElemOnShape && myShapeID > 0 )
1890 meshDS->SetMeshElementOnShape( elem, myShapeID );
1895 //=======================================================================
1896 //function : AddVolume
1897 //purpose : Creates quadratic or linear pyramid
1898 //=======================================================================
1900 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1901 const SMDS_MeshNode* n2,
1902 const SMDS_MeshNode* n3,
1903 const SMDS_MeshNode* n4,
1904 const SMDS_MeshNode* n5,
1908 SMDS_MeshVolume* elem = 0;
1909 if(!myCreateQuadratic) {
1911 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1913 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1916 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1917 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1918 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1919 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1921 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1922 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1923 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
1924 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1927 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
1932 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
1934 n15, n25, n35, n45);
1936 if ( mySetElemOnShape && myShapeID > 0 )
1937 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
1942 //=======================================================================
1943 //function : AddVolume
1944 //purpose : Creates bi-quadratic, quadratic or linear hexahedron
1945 //=======================================================================
1947 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1948 const SMDS_MeshNode* n2,
1949 const SMDS_MeshNode* n3,
1950 const SMDS_MeshNode* n4,
1951 const SMDS_MeshNode* n5,
1952 const SMDS_MeshNode* n6,
1953 const SMDS_MeshNode* n7,
1954 const SMDS_MeshNode* n8,
1958 SMESHDS_Mesh * meshDS = GetMeshDS();
1959 SMDS_MeshVolume* elem = 0;
1960 if(!myCreateQuadratic) {
1962 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
1964 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
1967 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1968 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1969 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1970 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1972 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1973 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
1974 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
1975 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
1977 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1978 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
1979 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
1980 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
1981 if(myCreateBiQuadratic)
1983 const SMDS_MeshNode* n1234 = GetCentralNode(n1,n2,n3,n4,n12,n23,n34,n41,force3d);
1984 const SMDS_MeshNode* n1256 = GetCentralNode(n1,n2,n5,n6,n12,n26,n56,n15,force3d);
1985 const SMDS_MeshNode* n2367 = GetCentralNode(n2,n3,n6,n7,n23,n37,n67,n26,force3d);
1986 const SMDS_MeshNode* n3478 = GetCentralNode(n3,n4,n7,n8,n34,n48,n78,n37,force3d);
1987 const SMDS_MeshNode* n1458 = GetCentralNode(n1,n4,n5,n8,n41,n48,n15,n85,force3d);
1988 const SMDS_MeshNode* n5678 = GetCentralNode(n5,n6,n7,n8,n56,n67,n78,n85,force3d);
1990 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
1992 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( n4 );
1993 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( n8 );
1994 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( n3 );
1995 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( n7 );
1996 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( n1 );
1997 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( n5 );
1998 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( n2 );
1999 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( n6 );
2001 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( n48 );
2002 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( n37 );
2003 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( n15 );
2004 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( n26 );
2005 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( n34 );
2006 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( n78 );
2007 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( n12 );
2008 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( n56 );
2009 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( n41 );
2010 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( n85 );
2011 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( n23 );
2012 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( n67 );
2014 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( n3478 );
2015 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( n1256 );
2016 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( n1458 );
2017 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( n2367 );
2018 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( n1234 );
2019 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( n5678 );
2021 gp_XYZ centerCube(0.5, 0.5, 0.5);
2023 SMESH_Block::ShellPoint( centerCube, pointsOnShapes, nCenterElem );
2024 const SMDS_MeshNode* nCenter =
2025 meshDS->AddNode( nCenterElem.X(), nCenterElem.Y(), nCenterElem.Z() );
2026 meshDS->SetNodeInVolume( nCenter, myShapeID );
2029 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2030 n12, n23, n34, n41, n56, n67,
2031 n78, n85, n15, n26, n37, n48,
2032 n1234, n1256, n2367, n3478, n1458, n5678, nCenter, id);
2034 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2035 n12, n23, n34, n41, n56, n67,
2036 n78, n85, n15, n26, n37, n48,
2037 n1234, n1256, n2367, n3478, n1458, n5678, nCenter);
2042 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2043 n12, n23, n34, n41, n56, n67,
2044 n78, n85, n15, n26, n37, n48, id);
2046 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2047 n12, n23, n34, n41, n56, n67,
2048 n78, n85, n15, n26, n37, n48);
2051 if ( mySetElemOnShape && myShapeID > 0 )
2052 meshDS->SetMeshElementOnShape( elem, myShapeID );
2057 //=======================================================================
2058 //function : AddVolume
2059 //purpose : Creates LINEAR!!!!!!!!! octahedron
2060 //=======================================================================
2062 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2063 const SMDS_MeshNode* n2,
2064 const SMDS_MeshNode* n3,
2065 const SMDS_MeshNode* n4,
2066 const SMDS_MeshNode* n5,
2067 const SMDS_MeshNode* n6,
2068 const SMDS_MeshNode* n7,
2069 const SMDS_MeshNode* n8,
2070 const SMDS_MeshNode* n9,
2071 const SMDS_MeshNode* n10,
2072 const SMDS_MeshNode* n11,
2073 const SMDS_MeshNode* n12,
2077 SMESHDS_Mesh * meshDS = GetMeshDS();
2078 SMDS_MeshVolume* elem = 0;
2080 elem = meshDS->AddVolumeWithID(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12,id);
2082 elem = meshDS->AddVolume(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12);
2083 if ( mySetElemOnShape && myShapeID > 0 )
2084 meshDS->SetMeshElementOnShape( elem, myShapeID );
2088 //=======================================================================
2089 //function : AddPolyhedralVolume
2090 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
2091 //=======================================================================
2094 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
2095 const std::vector<int>& quantities,
2099 SMESHDS_Mesh * meshDS = GetMeshDS();
2100 SMDS_MeshVolume* elem = 0;
2101 if(!myCreateQuadratic)
2104 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
2106 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
2110 vector<const SMDS_MeshNode*> newNodes;
2111 vector<int> newQuantities;
2112 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
2114 int nbNodesInFace = quantities[iFace];
2115 newQuantities.push_back(0);
2116 for ( int i = 0; i < nbNodesInFace; ++i )
2118 const SMDS_MeshNode* n1 = nodes[ iN + i ];
2119 newNodes.push_back( n1 );
2120 newQuantities.back()++;
2122 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
2123 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
2124 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
2126 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2127 newNodes.push_back( n12 );
2128 newQuantities.back()++;
2131 iN += nbNodesInFace;
2134 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
2136 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
2138 if ( mySetElemOnShape && myShapeID > 0 )
2139 meshDS->SetMeshElementOnShape( elem, myShapeID );
2146 //================================================================================
2148 * \brief Check if a node belongs to any face of sub-mesh
2150 //================================================================================
2152 bool isNodeInSubMesh( const SMDS_MeshNode* n, const SMESHDS_SubMesh* sm )
2154 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2155 while ( fIt->more() )
2156 if ( sm->Contains( fIt->next() ))
2162 //=======================================================================
2163 //function : IsSameElemGeometry
2164 //purpose : Returns true if all elements of a sub-mesh are of same shape
2165 //=======================================================================
2167 bool SMESH_MesherHelper::IsSameElemGeometry(const SMESHDS_SubMesh* smDS,
2168 SMDSAbs_GeometryType shape,
2169 const bool nullSubMeshRes)
2171 if ( !smDS ) return nullSubMeshRes;
2173 SMDS_ElemIteratorPtr elemIt = smDS->GetElements();
2174 while ( elemIt->more() ) {
2175 const SMDS_MeshElement* e = elemIt->next();
2176 if ( e->GetGeomType() != shape )
2182 //=======================================================================
2183 //function : LoadNodeColumns
2184 //purpose : Load nodes bound to face into a map of node columns
2185 //=======================================================================
2187 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2188 const TopoDS_Face& theFace,
2189 const TopoDS_Edge& theBaseEdge,
2190 SMESHDS_Mesh* theMesh,
2191 SMESH_ProxyMesh* theProxyMesh)
2193 return LoadNodeColumns(theParam2ColumnMap,
2195 std::list<TopoDS_Edge>(1,theBaseEdge),
2200 //=======================================================================
2201 //function : LoadNodeColumns
2202 //purpose : Load nodes bound to face into a map of node columns
2203 //=======================================================================
2205 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2206 const TopoDS_Face& theFace,
2207 const std::list<TopoDS_Edge>& theBaseSide,
2208 SMESHDS_Mesh* theMesh,
2209 SMESH_ProxyMesh* theProxyMesh)
2211 // get a right sub-mesh of theFace
2213 const SMESHDS_SubMesh* faceSubMesh = 0;
2216 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
2217 if ( !faceSubMesh ||
2218 faceSubMesh->NbElements() == 0 ||
2219 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
2221 // can use a proxy sub-mesh with not temporary elements only
2227 faceSubMesh = theMesh->MeshElements( theFace );
2228 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
2231 if ( theParam2ColumnMap.empty() )
2233 // get data of edges for normalization of params
2234 vector< double > length;
2236 list<TopoDS_Edge>::const_iterator edge;
2238 for ( edge = theBaseSide.begin(); edge != theBaseSide.end(); ++edge )
2240 double len = std::max( 1e-10, SMESH_Algo::EdgeLength( *edge ));
2242 length.push_back( len );
2246 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
2247 edge = theBaseSide.begin();
2248 for ( int iE = 0; edge != theBaseSide.end(); ++edge, ++iE )
2250 map< double, const SMDS_MeshNode*> sortedBaseNN;
2251 SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN);
2252 if ( sortedBaseNN.empty() ) continue;
2254 map< double, const SMDS_MeshNode*>::iterator u_n = sortedBaseNN.begin();
2255 if ( theProxyMesh ) // from sortedBaseNN remove nodes not shared by faces of faceSubMesh
2257 const SMDS_MeshNode* n1 = (++sortedBaseNN.begin())->second;
2258 const SMDS_MeshNode* n2 = (++sortedBaseNN.rbegin())->second;
2259 bool allNodesAreProxy = ( n1 != theProxyMesh->GetProxyNode( n1 ) &&
2260 n2 != theProxyMesh->GetProxyNode( n2 ));
2261 if ( allNodesAreProxy )
2262 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2263 u_n->second = theProxyMesh->GetProxyNode( u_n->second );
2265 if ( u_n = sortedBaseNN.begin(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2267 while ( ++u_n != sortedBaseNN.end() && !isNodeInSubMesh( u_n->second, faceSubMesh ));
2268 sortedBaseNN.erase( sortedBaseNN.begin(), u_n );
2270 if ( u_n = --sortedBaseNN.end(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2272 while ( u_n != sortedBaseNN.begin() && !isNodeInSubMesh( (--u_n)->second, faceSubMesh ));
2273 sortedBaseNN.erase( ++u_n, sortedBaseNN.end() );
2275 if ( sortedBaseNN.empty() ) continue;
2279 BRep_Tool::Range( *edge, f, l );
2280 if ( edge->Orientation() == TopAbs_REVERSED ) std::swap( f, l );
2281 const double coeff = 1. / ( l - f ) * length[iE] / fullLen;
2282 const double prevPar = theParam2ColumnMap.empty() ? 0 : theParam2ColumnMap.rbegin()->first;
2283 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2285 double par = prevPar + coeff * ( u_n->first - f );
2286 TParam2ColumnMap::iterator u2nn =
2287 theParam2ColumnMap.insert( theParam2ColumnMap.end(), make_pair( par, TNodeColumn()));
2288 u2nn->second.push_back( u_n->second );
2291 if ( theParam2ColumnMap.empty() )
2296 int prevNbRows = theParam2ColumnMap.begin()->second.size(); // current, at least 1 here
2297 int expectedNbRows = faceSubMesh->NbElements() / ( theParam2ColumnMap.size()-1 ); // to be added
2299 // fill theParam2ColumnMap column by column by passing from nodes on
2300 // theBaseEdge up via mesh faces on theFace
2302 TParam2ColumnMap::iterator par_nVec_1, par_nVec_2;
2303 par_nVec_2 = theParam2ColumnMap.begin();
2304 par_nVec_1 = par_nVec_2++;
2305 TIDSortedElemSet emptySet, avoidSet;
2306 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
2308 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
2309 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
2310 nCol1.resize( prevNbRows + expectedNbRows );
2311 nCol2.resize( prevNbRows + expectedNbRows );
2313 int i1, i2, foundNbRows = 0;
2314 const SMDS_MeshNode *n1 = nCol1[ prevNbRows-1 ];
2315 const SMDS_MeshNode *n2 = nCol2[ prevNbRows-1 ];
2316 // find face sharing node n1 and n2 and belonging to faceSubMesh
2317 while ( const SMDS_MeshElement* face =
2318 SMESH_MeshAlgos::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
2320 if ( faceSubMesh->Contains( face ))
2322 int nbNodes = face->NbCornerNodes();
2325 if ( foundNbRows + 1 > expectedNbRows )
2327 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
2328 n2 = face->GetNode( (i1+2) % 4 );
2329 nCol1[ prevNbRows + foundNbRows] = n1;
2330 nCol2[ prevNbRows + foundNbRows] = n2;
2333 avoidSet.insert( face );
2335 if ( foundNbRows != expectedNbRows )
2339 return ( theParam2ColumnMap.size() > 1 &&
2340 theParam2ColumnMap.begin()->second.size() == prevNbRows + expectedNbRows );
2345 //================================================================================
2347 * \brief Return true if a node is at a corner of a 2D structured mesh of FACE
2349 //================================================================================
2351 bool isCornerOfStructure( const SMDS_MeshNode* n,
2352 const SMESHDS_SubMesh* faceSM,
2353 SMESH_MesherHelper& faceAnalyser )
2355 int nbFacesInSM = 0;
2357 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2358 while ( fIt->more() )
2359 nbFacesInSM += faceSM->Contains( fIt->next() );
2361 if ( nbFacesInSM == 1 )
2364 if ( nbFacesInSM == 2 && n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
2366 return faceAnalyser.IsRealSeam( n->getshapeId() );
2372 //=======================================================================
2373 //function : IsStructured
2374 //purpose : Return true if 2D mesh on FACE is structured
2375 //=======================================================================
2377 bool SMESH_MesherHelper::IsStructured( SMESH_subMesh* faceSM )
2379 SMESHDS_SubMesh* fSM = faceSM->GetSubMeshDS();
2380 if ( !fSM || fSM->NbElements() == 0 )
2383 list< TopoDS_Edge > edges;
2384 list< int > nbEdgesInWires;
2385 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( faceSM->GetSubShape() ),
2386 edges, nbEdgesInWires );
2387 if ( nbWires != 1 /*|| nbEdgesInWires.front() != 4*/ ) // allow composite sides
2390 // algo: find corners of a structure and then analyze nb of faces and
2391 // length of structure sides
2393 SMESHDS_Mesh* meshDS = faceSM->GetFather()->GetMeshDS();
2394 SMESH_MesherHelper faceAnalyser( *faceSM->GetFather() );
2395 faceAnalyser.SetSubShape( faceSM->GetSubShape() );
2397 // rotate edges to get the first node being at corner
2398 // (in principle it's not necessary but so far none SALOME algo can make
2399 // such a structured mesh that all corner nodes are not on VERTEXes)
2400 bool isCorner = false;
2401 int nbRemainEdges = nbEdgesInWires.front();
2403 TopoDS_Vertex V = IthVertex( 0, edges.front() );
2404 isCorner = isCornerOfStructure( SMESH_Algo::VertexNode( V, meshDS ),
2407 edges.splice( edges.end(), edges, edges.begin() );
2411 while ( !isCorner && nbRemainEdges > 0 );
2416 // get all nodes from EDGEs
2417 list< const SMDS_MeshNode* > nodes;
2418 list< TopoDS_Edge >::iterator edge = edges.begin();
2419 for ( ; edge != edges.end(); ++edge )
2421 map< double, const SMDS_MeshNode* > u2Nodes;
2422 if ( !SMESH_Algo::GetSortedNodesOnEdge( meshDS, *edge,
2423 /*skipMedium=*/true, u2Nodes ))
2426 list< const SMDS_MeshNode* > edgeNodes;
2427 map< double, const SMDS_MeshNode* >::iterator u2n = u2Nodes.begin();
2428 for ( ; u2n != u2Nodes.end(); ++u2n )
2429 edgeNodes.push_back( u2n->second );
2430 if ( edge->Orientation() == TopAbs_REVERSED )
2431 edgeNodes.reverse();
2433 if ( !nodes.empty() && nodes.back() == edgeNodes.front() )
2434 edgeNodes.pop_front();
2435 nodes.splice( nodes.end(), edgeNodes, edgeNodes.begin(), edgeNodes.end() );
2438 // get length of structured sides
2439 vector<int> nbEdgesInSide;
2441 list< const SMDS_MeshNode* >::iterator n = ++nodes.begin();
2442 for ( ; n != nodes.end(); ++n )
2445 if ( isCornerOfStructure( *n, fSM, faceAnalyser )) {
2446 nbEdgesInSide.push_back( nbEdges );
2452 if ( nbEdgesInSide.size() != 4 )
2454 if ( nbEdgesInSide[0] != nbEdgesInSide[2] )
2456 if ( nbEdgesInSide[1] != nbEdgesInSide[3] )
2458 if ( nbEdgesInSide[0] * nbEdgesInSide[1] != fSM->NbElements() )
2464 //================================================================================
2466 * \brief Find out elements orientation on a geometrical face
2467 * \param theFace - The face correctly oriented in the shape being meshed
2468 * \retval bool - true if the face normal and the normal of first element
2469 * in the correspoding submesh point in different directions
2471 //================================================================================
2473 bool SMESH_MesherHelper::IsReversedSubMesh (const TopoDS_Face& theFace)
2475 if ( theFace.IsNull() )
2478 // find out orientation of a meshed face
2479 int faceID = GetMeshDS()->ShapeToIndex( theFace );
2480 TopoDS_Shape aMeshedFace = GetMeshDS()->IndexToShape( faceID );
2481 bool isReversed = ( theFace.Orientation() != aMeshedFace.Orientation() );
2483 const SMESHDS_SubMesh * aSubMeshDSFace = GetMeshDS()->MeshElements( faceID );
2484 if ( !aSubMeshDSFace )
2487 // find an element with a good normal
2489 bool normalOK = false;
2491 SMDS_ElemIteratorPtr iteratorElem = aSubMeshDSFace->GetElements();
2492 while ( !normalOK && iteratorElem->more() ) // loop on elements on theFace
2494 const SMDS_MeshElement* elem = iteratorElem->next();
2495 if ( elem && elem->NbCornerNodes() > 2 )
2497 SMESH_TNodeXYZ nPnt[3];
2498 SMDS_ElemIteratorPtr nodesIt = elem->nodesIterator();
2499 int iNodeOnFace = 0, iPosDim = SMDS_TOP_VERTEX;
2500 for ( int iN = 0; nodesIt->more() && iN < 3; ++iN) // loop on nodes
2502 nPnt[ iN ] = nodesIt->next();
2503 if ( nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition() > iPosDim )
2506 iPosDim = nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition();
2510 gp_Vec v01( nPnt[0], nPnt[1] ), v02( nPnt[0], nPnt[2] );
2511 if ( v01.SquareMagnitude() > RealSmall() &&
2512 v02.SquareMagnitude() > RealSmall() )
2515 if (( normalOK = ( Ne.SquareMagnitude() > RealSmall() )))
2516 uv = GetNodeUV( theFace, nPnt[iNodeOnFace]._node, 0, &normalOK );
2523 // face normal at node position
2524 TopLoc_Location loc;
2525 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
2526 // if ( surf.IsNull() || surf->Continuity() < GeomAbs_C1 )
2527 // some surfaces not detected as GeomAbs_C1 are nevertheless correct for meshing
2528 if ( surf.IsNull() || surf->Continuity() < GeomAbs_C0 )
2531 MESSAGE("surf->Continuity() < GeomAbs_C1 " << (surf->Continuity() < GeomAbs_C1));
2534 gp_Vec d1u, d1v; gp_Pnt p;
2535 surf->D1( uv.X(), uv.Y(), p, d1u, d1v );
2536 gp_Vec Nf = (d1u ^ d1v).Transformed( loc );
2538 if ( theFace.Orientation() == TopAbs_REVERSED )
2541 return Ne * Nf < 0.;
2544 //=======================================================================
2546 //purpose : Count nb of sub-shapes
2547 //=======================================================================
2549 int SMESH_MesherHelper::Count(const TopoDS_Shape& shape,
2550 const TopAbs_ShapeEnum type,
2551 const bool ignoreSame)
2554 TopTools_IndexedMapOfShape map;
2555 TopExp::MapShapes( shape, type, map );
2556 return map.Extent();
2560 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2566 //=======================================================================
2567 //function : NbAncestors
2568 //purpose : Return number of unique ancestors of the shape
2569 //=======================================================================
2571 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
2572 const SMESH_Mesh& mesh,
2573 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
2575 TopTools_MapOfShape ancestors;
2576 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
2577 for ( ; ansIt.More(); ansIt.Next() ) {
2578 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
2579 ancestors.Add( ansIt.Value() );
2581 return ancestors.Extent();
2584 //=======================================================================
2585 //function : GetSubShapeOri
2586 //purpose : Return orientation of sub-shape in the main shape
2587 //=======================================================================
2589 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
2590 const TopoDS_Shape& subShape)
2592 TopAbs_Orientation ori = TopAbs_Orientation(-1);
2593 if ( !shape.IsNull() && !subShape.IsNull() )
2595 TopExp_Explorer e( shape, subShape.ShapeType() );
2596 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
2597 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
2598 for ( ; e.More(); e.Next())
2599 if ( subShape.IsSame( e.Current() ))
2602 ori = e.Current().Orientation();
2607 //=======================================================================
2608 //function : IsSubShape
2610 //=======================================================================
2612 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
2613 const TopoDS_Shape& mainShape )
2615 if ( !shape.IsNull() && !mainShape.IsNull() )
2617 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
2620 if ( shape.IsSame( exp.Current() ))
2623 SCRUTE((shape.IsNull()));
2624 SCRUTE((mainShape.IsNull()));
2628 //=======================================================================
2629 //function : IsSubShape
2631 //=======================================================================
2633 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
2635 if ( shape.IsNull() || !aMesh )
2638 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
2640 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
2643 //================================================================================
2645 * \brief Return maximal tolerance of shape
2647 //================================================================================
2649 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
2651 double tol = Precision::Confusion();
2652 TopExp_Explorer exp;
2653 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
2654 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
2655 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
2656 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
2657 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
2658 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
2663 //================================================================================
2665 * \brief Return an angle between two EDGEs sharing a common VERTEX with reference
2666 * of the FACE normal
2667 * \return double - the angle (between -Pi and Pi), negative if the angle is concave,
2668 * 1e100 in case of failure
2669 * \waring Care about order of the EDGEs and their orientation to be as they are
2670 * within the FACE! Don't pass degenerated EDGEs neither!
2672 //================================================================================
2674 double SMESH_MesherHelper::GetAngle( const TopoDS_Edge & theE1,
2675 const TopoDS_Edge & theE2,
2676 const TopoDS_Face & theFace)
2678 double angle = 1e100;
2681 TopoDS_Vertex vCommon;
2682 if ( !TopExp::CommonVertex( theE1, theE2, vCommon ))
2685 Handle(Geom_Curve) c1 = BRep_Tool::Curve( theE1, f,l );
2686 Handle(Geom_Curve) c2 = BRep_Tool::Curve( theE2, f,l );
2687 Handle(Geom2d_Curve) c2d1 = BRep_Tool::CurveOnSurface( theE1, theFace, f,l );
2688 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace );
2689 double p1 = BRep_Tool::Parameter( vCommon, theE1 );
2690 double p2 = BRep_Tool::Parameter( vCommon, theE2 );
2691 if ( c1.IsNull() || c2.IsNull() )
2693 gp_XY uv = c2d1->Value( p1 ).XY();
2694 gp_Vec du, dv; gp_Pnt p;
2695 surf->D1( uv.X(), uv.Y(), p, du, dv );
2696 gp_Vec vec1, vec2, vecRef = du ^ dv;
2699 while ( vecRef.SquareMagnitude() < std::numeric_limits<double>::min() )
2701 double dp = ( l - f ) / 1000.;
2702 p1tmp += dp * (( Abs( p1 - f ) > Abs( p1 - l )) ? +1. : -1.);
2703 uv = c2d1->Value( p1tmp ).XY();
2704 surf->D1( uv.X(), uv.Y(), p, du, dv );
2706 if ( ++nbLoops > 10 )
2709 cout << "SMESH_MesherHelper::GetAngle(): Captured in a sigularity" << endl;
2714 if ( theFace.Orientation() == TopAbs_REVERSED )
2716 c1->D1( p1, p, vec1 );
2717 c2->D1( p2, p, vec2 );
2718 TopoDS_Face F = theFace;
2719 if ( F.Orientation() == TopAbs_INTERNAL )
2720 F.Orientation( TopAbs_FORWARD );
2721 if ( theE1.Orientation() /*GetSubShapeOri( F, theE1 )*/ == TopAbs_REVERSED )
2723 if ( theE2.Orientation() /*GetSubShapeOri( F, theE2 )*/ == TopAbs_REVERSED )
2725 angle = vec1.AngleWithRef( vec2, vecRef );
2733 //================================================================================
2735 * \brief Check if the first and last vertices of an edge are the same
2736 * \param anEdge - the edge to check
2737 * \retval bool - true if same
2739 //================================================================================
2741 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
2743 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2744 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
2745 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
2748 //================================================================================
2750 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
2751 * in the case of INTERNAL edge
2753 //================================================================================
2755 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
2759 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2760 anEdge.Orientation( TopAbs_FORWARD );
2762 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
2763 TopoDS_Iterator vIt( anEdge, CumOri );
2764 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
2767 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
2770 //================================================================================
2772 * \brief Return type of shape contained in a group
2773 * \param group - a shape of type TopAbs_COMPOUND
2774 * \param avoidCompound - not to return TopAbs_COMPOUND
2776 //================================================================================
2778 TopAbs_ShapeEnum SMESH_MesherHelper::GetGroupType(const TopoDS_Shape& group,
2779 const bool avoidCompound)
2781 if ( !group.IsNull() )
2783 if ( group.ShapeType() != TopAbs_COMPOUND )
2784 return group.ShapeType();
2786 // iterate on a compound
2787 TopoDS_Iterator it( group );
2789 return avoidCompound ? GetGroupType( it.Value() ) : it.Value().ShapeType();
2791 return TopAbs_SHAPE;
2794 //=======================================================================
2795 //function : IsQuadraticMesh
2796 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
2797 // quadratic elements will be created.
2798 // Used then generated 3D mesh without geometry.
2799 //=======================================================================
2801 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
2803 int NbAllEdgsAndFaces=0;
2804 int NbQuadFacesAndEdgs=0;
2805 int NbFacesAndEdges=0;
2806 //All faces and edges
2807 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
2808 if ( NbAllEdgsAndFaces == 0 )
2809 return SMESH_MesherHelper::LINEAR;
2811 //Quadratic faces and edges
2812 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
2814 //Linear faces and edges
2815 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
2817 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
2819 return SMESH_MesherHelper::QUADRATIC;
2821 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
2823 return SMESH_MesherHelper::LINEAR;
2826 //Mesh with both type of elements
2827 return SMESH_MesherHelper::COMP;
2830 //=======================================================================
2831 //function : GetOtherParam
2832 //purpose : Return an alternative parameter for a node on seam
2833 //=======================================================================
2835 double SMESH_MesherHelper::GetOtherParam(const double param) const
2837 int i = myParIndex & U_periodic ? 0 : 1;
2838 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
2843 //=======================================================================
2845 * \brief Iterator on ancestors of the given type
2847 //=======================================================================
2849 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
2851 TopTools_ListIteratorOfListOfShape _ancIter;
2852 TopAbs_ShapeEnum _type;
2853 TopTools_MapOfShape _encountered;
2854 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
2855 : _ancIter( ancestors ), _type( type )
2857 if ( _ancIter.More() ) {
2858 if ( _ancIter.Value().ShapeType() != _type ) next();
2859 else _encountered.Add( _ancIter.Value() );
2864 return _ancIter.More();
2866 virtual const TopoDS_Shape* next()
2868 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
2869 if ( _ancIter.More() )
2870 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
2871 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
2879 //=======================================================================
2881 * \brief Return iterator on ancestors of the given type
2883 //=======================================================================
2885 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
2886 const SMESH_Mesh& mesh,
2887 TopAbs_ShapeEnum ancestorType)
2889 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
2892 //=======================================================================
2893 //function : GetCommonAncestor
2894 //purpose : Find a common ancestors of two shapes of the given type
2895 //=======================================================================
2897 TopoDS_Shape SMESH_MesherHelper::GetCommonAncestor(const TopoDS_Shape& shape1,
2898 const TopoDS_Shape& shape2,
2899 const SMESH_Mesh& mesh,
2900 TopAbs_ShapeEnum ancestorType)
2902 TopoDS_Shape commonAnc;
2903 if ( !shape1.IsNull() && !shape2.IsNull() )
2905 PShapeIteratorPtr ancIt = GetAncestors( shape1, mesh, ancestorType );
2906 while ( const TopoDS_Shape* anc = ancIt->next() )
2907 if ( IsSubShape( shape2, *anc ))
2916 //#include <Perf_Meter.hxx>
2918 //=======================================================================
2919 namespace { // Structures used by FixQuadraticElements()
2920 //=======================================================================
2922 #define __DMP__(txt) \
2924 #define MSG(txt) __DMP__(txt<<endl)
2925 #define MSGBEG(txt) __DMP__(txt)
2927 //const double straightTol2 = 1e-33; // to detect straing links
2928 bool isStraightLink(double linkLen2, double middleNodeMove2)
2930 // straight if <node move> < 1/15 * <link length>
2931 return middleNodeMove2 < 1/15./15. * linkLen2;
2935 // ---------------------------------------
2937 * \brief Quadratic link knowing its faces
2939 struct QLink: public SMESH_TLink
2941 const SMDS_MeshNode* _mediumNode;
2942 mutable vector<const QFace* > _faces;
2943 mutable gp_Vec _nodeMove;
2944 mutable int _nbMoves;
2946 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
2947 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
2949 //if ( MediumPos() != SMDS_TOP_3DSPACE )
2950 _nodeMove = MediumPnt() - MiddlePnt();
2952 void SetContinuesFaces() const;
2953 const QFace* GetContinuesFace( const QFace* face ) const;
2954 bool OnBoundary() const;
2955 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
2956 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
2958 SMDS_TypeOfPosition MediumPos() const
2959 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
2960 SMDS_TypeOfPosition EndPos(bool isSecond) const
2961 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
2962 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
2963 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
2965 void Move(const gp_Vec& move, bool sum=false) const
2966 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
2967 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
2968 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
2969 bool IsStraight() const
2970 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
2971 _nodeMove.SquareMagnitude());
2973 bool operator<(const QLink& other) const {
2974 return (node1()->GetID() == other.node1()->GetID() ?
2975 node2()->GetID() < other.node2()->GetID() :
2976 node1()->GetID() < other.node1()->GetID());
2978 // struct PtrComparator {
2979 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
2982 // ---------------------------------------------------------
2984 * \brief Link in the chain of links; it connects two faces
2988 const QLink* _qlink;
2989 mutable const QFace* _qfaces[2];
2991 TChainLink(const QLink* qlink=0):_qlink(qlink) {
2992 _qfaces[0] = _qfaces[1] = 0;
2994 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
2996 bool IsBoundary() const { return !_qfaces[1]; }
2998 void RemoveFace( const QFace* face ) const
2999 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
3001 const QFace* NextFace( const QFace* f ) const
3002 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
3004 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
3005 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
3007 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
3009 operator bool() const { return (_qlink); }
3011 const QLink* operator->() const { return _qlink; }
3013 gp_Vec Normal() const;
3015 bool IsStraight() const;
3017 // --------------------------------------------------------------------
3018 typedef list< TChainLink > TChain;
3019 typedef set < TChainLink > TLinkSet;
3020 typedef TLinkSet::const_iterator TLinkInSet;
3022 const int theFirstStep = 5;
3024 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
3025 // --------------------------------------------------------------------
3027 * \brief Quadratic face shared by two volumes and bound by QLinks
3029 struct QFace: public TIDSortedNodeSet
3031 mutable const SMDS_MeshElement* _volumes[2];
3032 mutable vector< const QLink* > _sides;
3033 mutable bool _sideIsAdded[4]; // added in chain of links
3036 mutable const SMDS_MeshElement* _face;
3039 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
3041 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
3043 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
3045 void AddSelfToLinks() const {
3046 for ( int i = 0; i < _sides.size(); ++i )
3047 _sides[i]->_faces.push_back( this );
3049 int LinkIndex( const QLink* side ) const {
3050 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
3053 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
3055 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
3057 int i = LinkIndex( link._qlink );
3058 if ( i < 0 ) return true;
3059 _sideIsAdded[i] = true;
3060 link.SetFace( this );
3061 // continue from opposite link
3062 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
3064 bool IsBoundary() const { return !_volumes[1]; }
3066 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
3068 bool IsSpoiled(const QLink* bentLink ) const;
3070 TLinkInSet GetBoundaryLink( const TLinkSet& links,
3071 const TChainLink& avoidLink,
3072 TLinkInSet * notBoundaryLink = 0,
3073 const SMDS_MeshNode* nodeToContain = 0,
3074 bool * isAdjacentUsed = 0,
3075 int nbRecursionsLeft = -1) const;
3077 TLinkInSet GetLinkByNode( const TLinkSet& links,
3078 const TChainLink& avoidLink,
3079 const SMDS_MeshNode* nodeToContain) const;
3081 const SMDS_MeshNode* GetNodeInFace() const {
3082 for ( int iL = 0; iL < _sides.size(); ++iL )
3083 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
3087 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
3089 double MoveByBoundary( const TChainLink& theLink,
3090 const gp_Vec& theRefVec,
3091 const TLinkSet& theLinks,
3092 SMESH_MesherHelper* theFaceHelper=0,
3093 const double thePrevLen=0,
3094 const int theStep=theFirstStep,
3095 gp_Vec* theLinkNorm=0,
3096 double theSign=1.0) const;
3099 //================================================================================
3101 * \brief Dump QLink and QFace
3103 ostream& operator << (ostream& out, const QLink& l)
3105 out <<"QLink nodes: "
3106 << l.node1()->GetID() << " - "
3107 << l._mediumNode->GetID() << " - "
3108 << l.node2()->GetID() << endl;
3111 ostream& operator << (ostream& out, const QFace& f)
3113 out <<"QFace nodes: "/*<< &f << " "*/;
3114 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
3115 out << (*n)->GetID() << " ";
3116 out << " \tvolumes: "
3117 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
3118 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
3119 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
3123 //================================================================================
3125 * \brief Construct QFace from QLinks
3127 //================================================================================
3129 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
3131 _volumes[0] = _volumes[1] = 0;
3133 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
3134 _normal.SetCoord(0,0,0);
3135 for ( int i = 1; i < _sides.size(); ++i ) {
3136 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
3137 insert( l1->node1() ); insert( l1->node2() );
3139 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
3140 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
3141 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
3145 double normSqSize = _normal.SquareMagnitude();
3146 if ( normSqSize > numeric_limits<double>::min() )
3147 _normal /= sqrt( normSqSize );
3149 _normal.SetCoord(1e-33,0,0);
3155 //================================================================================
3157 * \brief Make up a chain of links
3158 * \param iSide - link to add first
3159 * \param chain - chain to fill in
3160 * \param pos - postion of medium nodes the links should have
3161 * \param error - out, specifies what is wrong
3162 * \retval bool - false if valid chain can't be built; "valid" means that links
3163 * of the chain belongs to rectangles bounding hexahedrons
3165 //================================================================================
3167 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
3169 if ( iSide >= _sides.size() ) // wrong argument iSide
3171 if ( _sideIsAdded[ iSide ]) // already in chain
3174 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
3177 list< const QFace* > faces( 1, this );
3178 while ( !faces.empty() ) {
3179 const QFace* face = faces.front();
3180 for ( int i = 0; i < face->_sides.size(); ++i ) {
3181 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
3182 face->_sideIsAdded[i] = true;
3183 // find a face side in the chain
3184 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
3185 // TChain::iterator chLink = chain.begin();
3186 // for ( ; chLink != chain.end(); ++chLink )
3187 // if ( chLink->_qlink == face->_sides[i] )
3189 // if ( chLink == chain.end() )
3190 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
3191 // add a face to a chained link and put a continues face in the queue
3192 chLink->SetFace( face );
3193 if ( face->_sides[i]->MediumPos() == pos )
3194 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
3195 if ( contFace->_sides.size() == 3 )
3196 faces.push_back( contFace );
3201 if ( error < ERR_TRI )
3203 chain.insert( chain.end(), links.begin(),links.end() );
3206 _sideIsAdded[iSide] = true; // not to add this link to chain again
3207 const QLink* link = _sides[iSide];
3211 // add link into chain
3212 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
3213 chLink->SetFace( this );
3216 // propagate from a quadrangle to neighbour faces
3217 if ( link->MediumPos() >= pos ) {
3218 int nbLinkFaces = link->_faces.size();
3219 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
3220 // hexahedral mesh or boundary quadrangles - goto a continous face
3221 if ( const QFace* f = link->GetContinuesFace( this ))
3222 if ( f->_sides.size() == 4 )
3223 return f->GetLinkChain( *chLink, chain, pos, error );
3226 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
3227 for ( int i = 0; i < nbLinkFaces; ++i )
3228 if ( link->_faces[i] )
3229 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
3230 if ( error < ERR_PRISM )
3238 //================================================================================
3240 * \brief Return a boundary link of the triangle face
3241 * \param links - set of all links
3242 * \param avoidLink - link not to return
3243 * \param notBoundaryLink - out, neither the returned link nor avoidLink
3244 * \param nodeToContain - node the returned link must contain; if provided, search
3245 * also performed on adjacent faces
3246 * \param isAdjacentUsed - returns true if link is found in adjacent faces
3247 * \param nbRecursionsLeft - to limit recursion
3249 //================================================================================
3251 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
3252 const TChainLink& avoidLink,
3253 TLinkInSet * notBoundaryLink,
3254 const SMDS_MeshNode* nodeToContain,
3255 bool * isAdjacentUsed,
3256 int nbRecursionsLeft) const
3258 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
3260 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
3261 TFaceLinkList adjacentFaces;
3263 for ( int iL = 0; iL < _sides.size(); ++iL )
3265 if ( avoidLink._qlink == _sides[iL] )
3267 TLinkInSet link = links.find( _sides[iL] );
3268 if ( link == linksEnd ) continue;
3269 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
3270 continue; // We work on faces here, don't go inside a solid
3273 if ( link->IsBoundary() ) {
3274 if ( !nodeToContain ||
3275 (*link)->node1() == nodeToContain ||
3276 (*link)->node2() == nodeToContain )
3278 boundaryLink = link;
3279 if ( !notBoundaryLink ) break;
3282 else if ( notBoundaryLink ) {
3283 *notBoundaryLink = link;
3284 if ( boundaryLink != linksEnd ) break;
3287 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
3288 if ( const QFace* adj = link->NextFace( this ))
3289 if ( adj->Contains( nodeToContain ))
3290 adjacentFaces.push_back( make_pair( adj, link ));
3293 if ( isAdjacentUsed ) *isAdjacentUsed = false;
3294 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
3296 if ( nbRecursionsLeft < 0 )
3297 nbRecursionsLeft = nodeToContain->NbInverseElements();
3298 TFaceLinkList::iterator adj = adjacentFaces.begin();
3299 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
3300 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
3301 isAdjacentUsed, nbRecursionsLeft-1);
3302 if ( isAdjacentUsed ) *isAdjacentUsed = true;
3304 return boundaryLink;
3306 //================================================================================
3308 * \brief Return a link ending at the given node but not avoidLink
3310 //================================================================================
3312 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
3313 const TChainLink& avoidLink,
3314 const SMDS_MeshNode* nodeToContain) const
3316 for ( int i = 0; i < _sides.size(); ++i )
3317 if ( avoidLink._qlink != _sides[i] &&
3318 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
3319 return links.find( _sides[ i ]);
3323 //================================================================================
3325 * \brief Return normal to the i-th side pointing outside the face
3327 //================================================================================
3329 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
3331 gp_Vec norm, vecOut;
3332 // if ( uvHelper ) {
3333 // TopoDS_Face face = TopoDS::Face( uvHelper->GetSubShape());
3334 // const SMDS_MeshNode* inFaceNode = uvHelper->GetNodeUVneedInFaceNode() ? GetNodeInFace() : 0;
3335 // gp_XY uv1 = uvHelper->GetNodeUV( face, _sides[i]->node1(), inFaceNode );
3336 // gp_XY uv2 = uvHelper->GetNodeUV( face, _sides[i]->node2(), inFaceNode );
3337 // norm.SetCoord( uv1.Y() - uv2.Y(), uv2.X() - uv1.X(), 0 );
3339 // const QLink* otherLink = _sides[(i + 1) % _sides.size()];
3340 // const SMDS_MeshNode* otherNode =
3341 // otherLink->node1() == _sides[i]->node1() ? otherLink->node2() : otherLink->node1();
3342 // gp_XY pIn = uvHelper->GetNodeUV( face, otherNode, inFaceNode );
3343 // vecOut.SetCoord( uv1.X() - pIn.X(), uv1.Y() - pIn.Y(), 0 );
3346 norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3347 gp_XYZ pIn = ( XYZ( _sides[0]->node1() ) +
3348 XYZ( _sides[0]->node2() ) +
3349 XYZ( _sides[1]->node1() )) / 3.;
3350 vecOut.SetXYZ( _sides[i]->MiddlePnt() - pIn );
3352 if ( norm * vecOut < 0 )
3354 double mag2 = norm.SquareMagnitude();
3355 if ( mag2 > numeric_limits<double>::min() )
3356 norm /= sqrt( mag2 );
3359 //================================================================================
3361 * \brief Move medium node of theLink according to its distance from boundary
3362 * \param theLink - link to fix
3363 * \param theRefVec - movement of boundary
3364 * \param theLinks - all adjacent links of continous triangles
3365 * \param theFaceHelper - helper is not used so far
3366 * \param thePrevLen - distance from the boundary
3367 * \param theStep - number of steps till movement propagation limit
3368 * \param theLinkNorm - out normal to theLink
3369 * \param theSign - 1 or -1 depending on movement of boundary
3370 * \retval double - distance from boundary to propagation limit or other boundary
3372 //================================================================================
3374 double QFace::MoveByBoundary( const TChainLink& theLink,
3375 const gp_Vec& theRefVec,
3376 const TLinkSet& theLinks,
3377 SMESH_MesherHelper* theFaceHelper,
3378 const double thePrevLen,
3380 gp_Vec* theLinkNorm,
3381 double theSign) const
3384 return thePrevLen; // propagation limit reached
3386 int iL; // index of theLink
3387 for ( iL = 0; iL < _sides.size(); ++iL )
3388 if ( theLink._qlink == _sides[ iL ])
3391 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
3392 <<" thePrevLen " << thePrevLen);
3393 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
3395 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
3396 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
3397 if ( theStep == theFirstStep )
3398 theSign = refProj < 0. ? -1. : 1.;
3399 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
3400 return thePrevLen; // to propagate movement forward only, not in side dir or backward
3402 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
3403 TLinkInSet link1 = theLinks.find( _sides[iL1] );
3404 TLinkInSet link2 = theLinks.find( _sides[iL2] );
3405 if ( link1 == theLinks.end() || link2 == theLinks.end() )
3407 const QFace* f1 = link1->NextFace( this ); // adjacent faces
3408 const QFace* f2 = link2->NextFace( this );
3410 // propagate to adjacent faces till limit step or boundary
3411 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
3412 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
3413 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
3414 gp_Vec linkDir2(0,0,0);
3417 if ( f1 && theLink->MediumPos() <= (*link1)->MediumPos() )
3418 len1 = f1->MoveByBoundary
3419 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
3421 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
3423 MSG( " --------------- EXCEPTION");
3428 if ( f2 && theLink->MediumPos() <= (*link2)->MediumPos() )
3429 len2 = f2->MoveByBoundary
3430 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
3432 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
3434 MSG( " --------------- EXCEPTION");
3439 if ( theStep != theFirstStep )
3441 // choose chain length by direction of propagation most codirected with theRefVec
3442 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
3443 fullLen = choose1 ? len1 : len2;
3444 double r = thePrevLen / fullLen;
3446 gp_Vec move = linkNorm * refProj * ( 1 - r );
3447 theLink->Move( move, true );
3449 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
3450 " by " << refProj * ( 1 - r ) << " following " <<
3451 (choose1 ? *link1->_qlink : *link2->_qlink));
3453 if ( theLinkNorm ) *theLinkNorm = linkNorm;
3458 //================================================================================
3460 * \brief Checks if the face is distorted due to bentLink
3462 //================================================================================
3464 bool QFace::IsSpoiled(const QLink* bentLink ) const
3466 // code is valid for convex faces only
3468 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
3469 gc += XYZ( *n ) / size();
3470 for (unsigned i = 0; i < _sides.size(); ++i )
3472 if ( _sides[i] == bentLink ) continue;
3473 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3474 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
3475 if ( linkNorm * vecOut < 0 )
3477 double mag2 = linkNorm.SquareMagnitude();
3478 if ( mag2 > numeric_limits<double>::min() )
3479 linkNorm /= sqrt( mag2 );
3480 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
3481 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
3482 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
3489 //================================================================================
3491 * \brief Find pairs of continues faces
3493 //================================================================================
3495 void QLink::SetContinuesFaces() const
3497 // x0 x - QLink, [-|] - QFace, v - volume
3499 // | Between _faces of link x2 two vertical faces are continues
3500 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
3501 // | to _faces[0] and _faces[1] and horizontal faces to
3502 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
3505 if ( _faces.empty() )
3507 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
3508 if ( _faces[0]->IsBoundary() )
3509 iBoundary[ nbBoundary++ ] = 0;
3510 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
3512 // look for a face bounding none of volumes bound by _faces[0]
3513 bool sameVol = false;
3514 int nbVol = _faces[iF]->NbVolumes();
3515 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
3516 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
3517 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
3520 if ( _faces[iF]->IsBoundary() )
3521 iBoundary[ nbBoundary++ ] = iF;
3523 // Set continues faces: arrange _faces to have
3524 // _faces[0] continues to _faces[1]
3525 // _faces[2] continues to _faces[3]
3526 if ( nbBoundary == 2 ) // bnd faces are continues
3528 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
3530 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
3531 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
3534 else if ( iFaceCont > 0 ) // continues faces found
3536 if ( iFaceCont != 1 )
3537 std::swap( _faces[1], _faces[iFaceCont] );
3539 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
3541 _faces.insert( ++_faces.begin(), 0 );
3544 //================================================================================
3546 * \brief Return a face continues to the given one
3548 //================================================================================
3550 const QFace* QLink::GetContinuesFace( const QFace* face ) const
3552 for ( int i = 0; i < _faces.size(); ++i ) {
3553 if ( _faces[i] == face ) {
3554 int iF = i < 2 ? 1-i : 5-i;
3555 return iF < _faces.size() ? _faces[iF] : 0;
3560 //================================================================================
3562 * \brief True if link is on mesh boundary
3564 //================================================================================
3566 bool QLink::OnBoundary() const
3568 for ( int i = 0; i < _faces.size(); ++i )
3569 if (_faces[i] && _faces[i]->IsBoundary()) return true;
3572 //================================================================================
3574 * \brief Return normal of link of the chain
3576 //================================================================================
3578 gp_Vec TChainLink::Normal() const {
3580 if (_qfaces[0]) norm = _qfaces[0]->_normal;
3581 if (_qfaces[1]) norm += _qfaces[1]->_normal;
3584 //================================================================================
3586 * \brief Test link curvature taking into account size of faces
3588 //================================================================================
3590 bool TChainLink::IsStraight() const
3592 bool isStraight = _qlink->IsStraight();
3593 if ( isStraight && _qfaces[0] && !_qfaces[1] )
3595 int i = _qfaces[0]->LinkIndex( _qlink );
3596 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
3597 gp_XYZ mid1 = _qlink->MiddlePnt();
3598 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
3599 double faceSize2 = (mid1-mid2).SquareModulus();
3600 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
3605 //================================================================================
3607 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
3609 //================================================================================
3611 void fixPrism( TChain& allLinks )
3613 // separate boundary links from internal ones
3614 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
3615 QLinkSet interLinks, bndLinks1, bndLink2;
3617 bool isCurved = false;
3618 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3619 if ( (*lnk)->OnBoundary() )
3620 bndLinks1.insert( lnk->_qlink );
3622 interLinks.insert( lnk->_qlink );
3623 isCurved = isCurved || !lnk->IsStraight();
3626 return; // no need to move
3628 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
3630 while ( !interLinks.empty() && !curBndLinks->empty() )
3632 // propagate movement from boundary links to connected internal links
3633 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
3634 for ( ; bnd != bndEnd; ++bnd )
3636 const QLink* bndLink = *bnd;
3637 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
3639 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
3640 if ( !face ) continue;
3641 // find and move internal link opposite to bndLink within the face
3642 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
3643 const QLink* interLink = face->_sides[ interInd ];
3644 QLinkSet::iterator pInterLink = interLinks.find( interLink );
3645 if ( pInterLink == interLinks.end() ) continue; // not internal link
3646 interLink->Move( bndLink->_nodeMove );
3647 // treated internal links become new boundary ones
3648 interLinks.erase( pInterLink );
3649 newBndLinks->insert( interLink );
3652 curBndLinks->clear();
3653 std::swap( curBndLinks, newBndLinks );
3657 //================================================================================
3659 * \brief Fix links of continues triangles near curved boundary
3661 //================================================================================
3663 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
3665 if ( allLinks.empty() ) return;
3667 TLinkSet linkSet( allLinks.begin(), allLinks.end());
3668 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
3670 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
3672 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
3674 // move iff a boundary link is bent towards inside of a face (issue 0021084)
3675 const QFace* face = linkIt->_qfaces[0];
3676 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
3677 face->_sides[1]->MiddlePnt() +
3678 face->_sides[2]->MiddlePnt() ) / 3.;
3679 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
3680 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
3681 //if ( face->IsSpoiled( linkIt->_qlink ))
3682 if ( linkBentInside )
3683 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
3688 //================================================================================
3690 * \brief Detect rectangular structure of links and build chains from them
3692 //================================================================================
3694 enum TSplitTriaResult {
3695 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
3696 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
3698 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
3699 vector< TChain> & resultChains,
3700 SMDS_TypeOfPosition pos )
3702 // put links in the set and evalute number of result chains by number of boundary links
3705 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3706 linkSet.insert( *lnk );
3707 nbBndLinks += lnk->IsBoundary();
3709 resultChains.clear();
3710 resultChains.reserve( nbBndLinks / 2 );
3712 TLinkInSet linkIt, linksEnd = linkSet.end();
3714 // find a boundary link with corner node; corner node has position pos-2
3715 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
3717 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
3718 const SMDS_MeshNode* corner = 0;
3719 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
3720 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
3725 TLinkInSet startLink = linkIt;
3726 const SMDS_MeshNode* startCorner = corner;
3727 vector< TChain* > rowChains;
3730 while ( startLink != linksEnd) // loop on columns
3732 // We suppose we have a rectangular structure like shown here. We have found a
3733 // corner of the rectangle (startCorner) and a boundary link sharing
3734 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
3735 // --o---o---o structure making several chains at once. One chain (columnChain)
3736 // |\ | /| starts at startLink and continues upward (we look at the structure
3737 // \ | \ | / | from such point that startLink is on the bottom of the structure).
3738 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
3739 // --o---o---o encounter.
3741 // / | \ | \ | startCorner
3746 if ( resultChains.size() == nbBndLinks / 2 )
3748 resultChains.push_back( TChain() );
3749 TChain& columnChain = resultChains.back();
3751 TLinkInSet botLink = startLink; // current horizontal link to go up from
3752 corner = startCorner; // current corner the botLink ends at
3754 while ( botLink != linksEnd ) // loop on rows
3756 // add botLink to the columnChain
3757 columnChain.push_back( *botLink );
3759 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
3761 { // the column ends
3762 if ( botLink == startLink )
3763 return _TWISTED_CHAIN; // issue 0020951
3764 linkSet.erase( botLink );
3765 if ( iRow != rowChains.size() )
3766 return _FEW_ROWS; // different nb of rows in columns
3769 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
3770 // link ending at <corner> (sideLink); there are two cases:
3771 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
3772 // since midQuadLink is not at boundary while sideLink is.
3773 // 2) midQuadLink ends at <corner>
3775 TLinkInSet midQuadLink = linksEnd;
3776 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
3778 if ( isCase2 ) { // find midQuadLink among links of botTria
3779 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
3780 if ( midQuadLink->IsBoundary() )
3781 return _BAD_MIDQUAD;
3783 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
3784 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
3787 columnChain.push_back( *midQuadLink );
3788 if ( iRow >= rowChains.size() ) {
3790 return _MANY_ROWS; // different nb of rows in columns
3791 if ( resultChains.size() == nbBndLinks / 2 )
3793 resultChains.push_back( TChain() );
3794 rowChains.push_back( & resultChains.back() );
3796 rowChains[iRow]->push_back( *sideLink );
3797 rowChains[iRow]->push_back( *midQuadLink );
3799 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
3803 // prepare startCorner and startLink for the next column
3804 startCorner = startLink->NextNode( startCorner );
3806 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
3808 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
3809 // check if no more columns remains
3810 if ( startLink != linksEnd ) {
3811 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
3812 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
3813 startLink = linksEnd; // startLink bounds upTria or botTria
3814 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
3818 // find bottom link and corner for the next row
3819 corner = sideLink->NextNode( corner );
3820 // next bottom link ends at the new corner
3821 linkSet.erase( botLink );
3822 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
3823 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
3825 if ( midQuadLink == startLink || sideLink == startLink )
3826 return _TWISTED_CHAIN; // issue 0020951
3827 linkSet.erase( midQuadLink );
3828 linkSet.erase( sideLink );
3830 // make faces neighboring the found ones be boundary
3831 if ( startLink != linksEnd ) {
3832 const QFace* tria = isCase2 ? botTria : upTria;
3833 for ( int iL = 0; iL < 3; ++iL ) {
3834 linkIt = linkSet.find( tria->_sides[iL] );
3835 if ( linkIt != linksEnd )
3836 linkIt->RemoveFace( tria );
3839 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
3840 botLink->RemoveFace( upTria ); // make next botTria first in vector
3847 // In the linkSet, there must remain the last links of rowChains; add them
3848 if ( linkSet.size() != rowChains.size() )
3849 return _BAD_SET_SIZE;
3850 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
3851 // find the link (startLink) ending at startCorner
3853 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
3854 if ( (*startLink)->node1() == startCorner ) {
3855 corner = (*startLink)->node2(); break;
3857 else if ( (*startLink)->node2() == startCorner) {
3858 corner = (*startLink)->node1(); break;
3861 if ( startLink == linksEnd )
3863 rowChains[ iRow ]->push_back( *startLink );
3864 linkSet.erase( startLink );
3865 startCorner = corner;
3871 //================================================================================
3873 * \brief Place medium nodes at the link middle for elements whose corner nodes
3874 * are out of geometrical boundary to prevent distorting elements.
3875 * Issue 0020982, note 0013990
3877 //================================================================================
3879 void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
3880 SMESH_ComputeErrorPtr& theError)
3882 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
3883 TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
3884 if ( shape.IsNull() ) return;
3886 if ( !theError ) theError = SMESH_ComputeError::New();
3890 if ( shape.ShapeType() == TopAbs_FACE ) // 2D
3892 if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
3894 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
3895 if ( !faceSM ) return;
3897 const TopoDS_Face& face = TopoDS::Face( shape );
3898 Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
3900 TopExp_Explorer edgeIt( face, TopAbs_EDGE );
3901 for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
3903 // check if the EDGE needs checking
3904 const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
3905 if ( SMESH_Algo::isDegenerated( edge ) )
3907 if ( theHelper.IsRealSeam( edge ) &&
3908 edge.Orientation() == TopAbs_REVERSED )
3911 SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
3912 if ( !edgeSM ) continue;
3915 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
3916 BRepAdaptor_Curve curve3D( edge );
3917 switch ( curve3D.GetType() ) {
3918 case GeomAbs_Line: continue;
3919 case GeomAbs_Circle:
3920 case GeomAbs_Ellipse:
3921 case GeomAbs_Hyperbola:
3922 case GeomAbs_Parabola:
3925 gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
3926 curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
3927 gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
3928 surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
3929 gp_Vec fNorm = Du1 ^ Dv1;
3930 if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
3931 continue; // face is normal to the curve3D
3933 gp_Vec curvNorm = fNorm ^ D1;
3934 if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
3935 if ( curvNorm * D2 > 0 )
3936 continue; // convex edge
3938 catch ( Standard_Failure )
3943 // get nodes shared by faces that may be distorted
3944 SMDS_NodeIteratorPtr nodeIt;
3945 if ( edgeSM->NbNodes() > 0 ) {
3946 nodeIt = edgeSM->GetNodes();
3949 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
3951 vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
3952 if ( !vertexSM ) continue;
3953 nodeIt = vertexSM->GetNodes();
3956 // find suspicious faces
3957 TIDSortedElemSet checkedFaces;
3958 vector< const SMDS_MeshNode* > nOnEdge( 2 );
3959 const SMDS_MeshNode* nOnFace;
3960 while ( nodeIt->more() )
3962 const SMDS_MeshNode* n = nodeIt->next();
3963 SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
3964 while ( faceIt->more() )
3966 const SMDS_MeshElement* f = faceIt->next();
3967 if ( !faceSM->Contains( f ) ||
3968 f->NbNodes() < 6 || // check quadratic triangles only
3969 !checkedFaces.insert( f ).second )
3972 // get nodes on EDGE and on FACE of a suspicious face
3973 nOnEdge.clear(); nOnFace = 0;
3974 SMDS_MeshElement::iterator triNode = f->begin_nodes();
3975 for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
3978 if ( n->GetPosition()->GetDim() == 2 )
3981 nOnEdge.push_back( n );
3984 // check if nOnFace is inside the FACE
3985 if ( nOnFace && nOnEdge.size() == 2 )
3987 theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
3988 if ( !SMESH_MeshAlgos::FaceNormal( f, faceNorm, /*normalized=*/false ))
3990 gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
3991 gp_XYZ edgeNorm = faceNorm ^ edgeDir;
3992 n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true );
3993 gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
3994 gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
3995 gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
3996 double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
3997 double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
3998 if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
4000 // nOnFace is out of FACE, move a medium on-edge node to the middle
4001 gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
4002 meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4003 MSG( "move OUT of face " << n );
4004 theError->myBadElements.push_back( f );
4010 if ( !theError->myBadElements.empty() )
4011 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4014 } // 2D ==============================================================================
4016 if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
4018 if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
4019 theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
4021 SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
4022 if ( !solidSM ) return;
4024 // check if the SOLID is bound by concave FACEs
4025 vector< TopoDS_Face > concaveFaces;
4026 TopExp_Explorer faceIt( shape, TopAbs_FACE );
4027 for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4029 const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
4030 if ( !meshDS->MeshElements( face )) continue;
4032 BRepAdaptor_Surface surface( face );
4033 switch ( surface.GetType() ) {
4034 case GeomAbs_Plane: continue;
4035 case GeomAbs_Cylinder:
4037 case GeomAbs_Sphere:
4040 double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
4041 double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
4042 gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
4043 surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
4044 gp_Vec fNorm = Du1 ^ Dv1;
4045 if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
4046 bool concaveU = ( fNorm * Du2 > 1e-100 );
4047 bool concaveV = ( fNorm * Dv2 > 1e-100 );
4048 if ( concaveU || concaveV )
4049 concaveFaces.push_back( face );
4051 catch ( Standard_Failure )
4053 concaveFaces.push_back( face );
4057 if ( concaveFaces.empty() )
4060 // fix 2D mesh on the SOLID
4061 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4063 SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
4064 faceHelper.SetSubShape( faceIt.Current() );
4065 force3DOutOfBoundary( faceHelper, theError );
4068 // get an iterator over faces on concaveFaces
4069 vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
4070 for ( size_t i = 0; i < concaveFaces.size(); ++i )
4071 faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
4072 typedef SMDS_IteratorOnIterators
4073 < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
4074 SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
4076 // a seacher to check if a volume is close to a concave face
4077 std::auto_ptr< SMESH_ElementSearcher > faceSearcher
4078 ( SMESH_MeshAlgos::GetElementSearcher( *theHelper.GetMeshDS(), faceIter ));
4081 //BRepClass3d_SolidClassifier solidClassifier( shape );
4083 TIDSortedElemSet checkedVols, movedNodes;
4084 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4086 const TopoDS_Shape& face = faceIt.Current();
4087 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
4088 if ( !faceSM ) continue;
4090 // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
4091 SMDS_NodeIteratorPtr nodeIt;
4092 if ( faceSM->NbNodes() > 0 ) {
4093 nodeIt = faceSM->GetNodes();
4096 TopExp_Explorer vertex( face, TopAbs_VERTEX );
4097 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
4098 if ( !vertexSM ) continue;
4099 nodeIt = vertexSM->GetNodes();
4102 // find suspicious volumes adjacent to the FACE
4103 vector< const SMDS_MeshNode* > nOnFace( 4 );
4104 const SMDS_MeshNode* nInSolid;
4105 //vector< const SMDS_MeshElement* > intersectedFaces;
4106 while ( nodeIt->more() )
4108 const SMDS_MeshNode* n = nodeIt->next();
4109 SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
4110 while ( volIt->more() )
4112 const SMDS_MeshElement* vol = volIt->next();
4113 int nbN = vol->NbCornerNodes();
4114 if ( ( nbN != 4 && nbN != 5 ) ||
4115 !solidSM->Contains( vol ) ||
4116 !checkedVols.insert( vol ).second )
4119 // get nodes on FACE and in SOLID of a suspicious volume
4120 nOnFace.clear(); nInSolid = 0;
4121 SMDS_MeshElement::iterator volNode = vol->begin_nodes();
4122 for ( int nb = nbN; nb > 0; ++volNode, --nb )
4125 if ( n->GetPosition()->GetDim() == 3 )
4128 nOnFace.push_back( n );
4130 if ( !nInSolid || nOnFace.size() != nbN - 1 )
4133 // get size of the vol
4134 SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
4135 double volLength = pInSolid.SquareDistance( nOnFace[0] );
4136 for ( size_t i = 1; i < nOnFace.size(); ++i )
4138 volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
4141 // check if vol is close to concaveFaces
4142 const SMDS_MeshElement* closeFace =
4143 faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
4145 pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
4148 // check if vol is distorted, i.e. a medium node is much closer
4149 // to nInSolid than the link middle
4150 bool isDistorted = false;
4151 SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
4152 if ( !SMESH_MeshAlgos::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
4154 theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
4155 vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
4156 for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
4157 for ( size_t j = i+1; j < nOnFace.size(); ++j )
4159 SMESH_TLink link( nOnFace[i], nOnFace[j] );
4160 TLinkNodeMap::const_iterator linkIt =
4161 theHelper.GetTLinkNodeMap().find( link );
4162 if ( linkIt != theHelper.GetTLinkNodeMap().end() )
4164 links.push_back( make_pair( linkIt->first, linkIt->second ));
4165 if ( !isDistorted ) {
4166 // compare projections of nInSolid and nMedium to face normal
4167 gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
4168 double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
4169 double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
4170 isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
4174 // move medium nodes to link middle
4177 for ( size_t i = 0; i < links.size(); ++i )
4179 const SMDS_MeshNode* nMedium = links[i].second;
4180 if ( movedNodes.insert( nMedium ).second )
4182 gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
4183 SMESH_TNodeXYZ( links[i].first.node2() ));
4184 meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4185 MSG( "move OUT of solid " << nMedium );
4188 theError->myBadElements.push_back( vol );
4190 } // loop on volumes sharing a node on FACE
4191 } // loop on nodes on FACE
4192 } // loop on FACEs of a SOLID
4194 if ( !theError->myBadElements.empty() )
4195 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4201 //=======================================================================
4203 * \brief Move medium nodes of faces and volumes to fix distorted elements
4204 * \param error - container of fixed distorted elements
4205 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
4207 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
4209 //=======================================================================
4211 void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& compError,
4214 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
4215 if ( getenv("NO_FixQuadraticElements") )
4218 // 0. Apply algorithm to SOLIDs or FACEs
4219 // ----------------------------------------------
4220 if ( myShape.IsNull() ) {
4221 if ( !myMesh->HasShapeToMesh() ) return;
4222 SetSubShape( myMesh->GetShapeToMesh() );
4226 TopTools_IndexedMapOfShape solids;
4227 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
4228 nbSolids = solids.Extent();
4230 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
4231 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
4232 faces.Add( f.Current() ); // not in solid
4234 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
4235 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
4236 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
4237 faces.Add( f.Current() ); // in not meshed solid
4239 else { // fix nodes in the solid and its faces
4241 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
4243 SMESH_MesherHelper h(*myMesh);
4244 h.SetSubShape( s.Current() );
4245 h.ToFixNodeParameters(true);
4246 h.FixQuadraticElements( compError, false );
4249 // fix nodes on geom faces
4251 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
4253 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
4254 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
4255 SMESH_MesherHelper h(*myMesh);
4256 h.SetSubShape( fIt.Key() );
4257 h.ToFixNodeParameters(true);
4258 h.FixQuadraticElements( compError, true);
4260 //perf_print_all_meters(1);
4261 if ( compError && compError->myName == EDITERR_NO_MEDIUM_ON_GEOM )
4262 compError->myComment = "during conversion to quadratic, "
4263 "some medium nodes were not placed on geometry to avoid distorting elements";
4267 // 1. Find out type of elements and get iterator on them
4268 // ---------------------------------------------------
4270 SMDS_ElemIteratorPtr elemIt;
4271 SMDSAbs_ElementType elemType = SMDSAbs_All;
4273 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
4276 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
4277 elemIt = smDS->GetElements();
4278 if ( elemIt->more() ) {
4279 elemType = elemIt->next()->GetType();
4280 elemIt = smDS->GetElements();
4283 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
4286 // 2. Fill in auxiliary data structures
4287 // ----------------------------------
4291 set< QLink >::iterator pLink;
4292 set< QFace >::iterator pFace;
4294 bool isCurved = false;
4295 //bool hasRectFaces = false;
4296 //set<int> nbElemNodeSet;
4297 SMDS_VolumeTool volTool;
4299 TIDSortedNodeSet apexOfPyramid;
4300 const int apexIndex = 4;
4303 // Move medium nodes to the link middle for elements whose corner nodes
4304 // are out of geometrical boundary to fix distorted elements.
4305 force3DOutOfBoundary( *this, compError );
4307 if ( elemType == SMDSAbs_Volume )
4309 while ( elemIt->more() ) // loop on volumes
4311 const SMDS_MeshElement* vol = elemIt->next();
4312 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
4314 double volMinSize2 = -1.;
4315 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
4317 int nbN = volTool.NbFaceNodes( iF );
4318 //nbElemNodeSet.insert( nbN );
4319 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
4320 vector< const QLink* > faceLinks( nbN/2 );
4321 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
4324 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
4325 pLink = links.insert( link ).first;
4326 faceLinks[ iN/2 ] = & *pLink;
4328 if ( link.MediumPos() == SMDS_TOP_3DSPACE )
4330 if ( !link.IsStraight() )
4331 return; // already fixed
4333 else if ( !isCurved )
4335 if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
4336 isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
4340 pFace = faces.insert( QFace( faceLinks )).first;
4341 if ( pFace->NbVolumes() == 0 )
4342 pFace->AddSelfToLinks();
4343 pFace->SetVolume( vol );
4344 // hasRectFaces = hasRectFaces ||
4345 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
4346 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
4349 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
4351 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
4352 faceNodes[4],faceNodes[6] );
4355 // collect pyramid apexes for further correction
4356 if ( vol->NbCornerNodes() == 5 )
4357 apexOfPyramid.insert( vol->GetNode( apexIndex ));
4359 set< QLink >::iterator pLink = links.begin();
4360 for ( ; pLink != links.end(); ++pLink )
4361 pLink->SetContinuesFaces();
4365 while ( elemIt->more() ) // loop on faces
4367 const SMDS_MeshElement* face = elemIt->next();
4368 if ( !face->IsQuadratic() )
4370 //nbElemNodeSet.insert( face->NbNodes() );
4371 int nbN = face->NbNodes()/2;
4372 vector< const QLink* > faceLinks( nbN );
4373 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
4376 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
4377 pLink = links.insert( link ).first;
4378 faceLinks[ iN ] = & *pLink;
4380 link.node1()->GetPosition()->GetTypeOfPosition() < 2 &&
4381 link.node2()->GetPosition()->GetTypeOfPosition() < 2 )
4382 isCurved = !link.IsStraight();
4385 pFace = faces.insert( QFace( faceLinks )).first;
4386 pFace->AddSelfToLinks();
4387 //hasRectFaces = ( hasRectFaces || nbN == 4 );
4391 return; // no curved edges of faces
4393 // 3. Compute displacement of medium nodes
4394 // ---------------------------------------
4396 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones.
4397 TopLoc_Location loc;
4399 // not to treat boundary of volumic sub-mesh.
4400 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
4401 for ( ; isInside < 2; ++isInside )
4403 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
4404 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
4405 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
4407 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
4408 if ( bool(isInside) == pFace->IsBoundary() )
4410 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
4413 // make chain of links connected via continues faces
4416 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
4418 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
4420 vector< TChain > chains;
4421 if ( error == ERR_OK ) { // chain contains continues rectangles
4423 chains[0].splice( chains[0].begin(), rawChain );
4425 else if ( error == ERR_TRI ) { // chain contains continues triangles
4426 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
4427 if ( res != _OK ) { // not quadrangles split into triangles
4428 fixTriaNearBoundary( rawChain, *this );
4432 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
4433 fixPrism( rawChain );
4439 for ( int iC = 0; iC < chains.size(); ++iC )
4441 TChain& chain = chains[iC];
4442 if ( chain.empty() ) continue;
4443 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
4444 MSG("3D straight - ignore");
4447 if ( chain.front()->MediumPos() > bndPos ||
4448 chain.back() ->MediumPos() > bndPos ) {
4449 MSG("Internal chain - ignore");
4452 // mesure chain length and compute link position along the chain
4453 double chainLen = 0;
4454 vector< double > linkPos;
4455 MSGBEG( "Link medium nodes: ");
4456 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
4457 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
4458 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
4459 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4460 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
4461 link1 = chain.erase( link1 );
4462 if ( link1 == chain.end() )
4464 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4467 linkPos.push_back( chainLen );
4470 if ( linkPos.size() < 2 )
4473 gp_Vec move0 = chain.front()->_nodeMove;
4474 gp_Vec move1 = chain.back ()->_nodeMove;
4479 // compute node displacement of end links of chain in parametric space of face
4480 TChainLink& linkOnFace = *(++chain.begin());
4481 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
4482 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
4483 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
4485 face = TopoDS::Face( f );
4486 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
4488 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
4490 TChainLink& link = is1 ? chain.back() : chain.front();
4491 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
4492 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
4493 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
4494 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4495 // uvMove = uvm - uv12
4496 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
4497 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
4498 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
4499 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
4500 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
4501 10 * uvMove.SquareModulus());
4503 if ( isStraight[0] && isStraight[1] ) {
4504 MSG("2D straight - ignore");
4505 continue; // straight - no need to move nodes of internal links
4508 // check if a chain is already fixed
4509 gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
4510 gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
4511 gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
4512 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4513 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
4515 MSG("Already fixed - ignore");
4521 if ( isInside || face.IsNull() )
4523 // compute node displacement of end links in their local coord systems
4525 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
4526 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
4527 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4528 move0.Transform(trsf);
4531 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
4532 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
4533 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4534 move1.Transform(trsf);
4537 // compute displacement of medium nodes
4538 link2 = chain.begin();
4541 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
4543 double r = linkPos[i] / chainLen;
4544 // displacement in local coord system
4545 gp_Vec move = (1. - r) * move0 + r * move1;
4546 if ( isInside || face.IsNull()) {
4547 // transform to global
4548 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
4549 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
4550 gp_Vec x = x01.Normalized() + x12.Normalized();
4551 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
4552 move.Transform(trsf);
4555 // compute 3D displacement by 2D one
4556 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
4557 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
4558 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
4559 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
4560 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
4561 if ( SMDS_FacePosition* nPos =
4562 dynamic_cast< SMDS_FacePosition* >((*link1)->_mediumNode->GetPosition()))
4563 nPos->SetParameters( newUV.X(), newUV.Y() );
4565 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
4566 move.SquareMagnitude())
4568 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
4569 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
4570 MSG( "TOO LONG MOVE \t" <<
4571 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
4572 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
4573 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
4574 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
4578 (*link1)->Move( move );
4579 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
4580 << chain.front()->_mediumNode->GetID() <<"-"
4581 << chain.back ()->_mediumNode->GetID() <<
4582 " by " << move.Magnitude());
4584 } // loop on chains of links
4585 } // loop on 2 directions of propagation from quadrangle
4587 } // fix faces and/or volumes
4592 TIDSortedElemSet biQuadQuas, biQuadTris, triQuadHexa;
4593 const SMDS_MeshElement *biQuadQua, *triQuadHex;
4594 const bool toFixCentralNodes = ( myMesh->NbBiQuadQuadrangles() +
4595 myMesh->NbBiQuadTriangles() +
4596 myMesh->NbTriQuadraticHexas() );
4598 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
4599 if ( pLink->IsMoved() )
4601 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
4602 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
4604 // collect bi-quadratic elements
4605 if ( toFixCentralNodes )
4607 biQuadQua = triQuadHex = 0;
4608 SMDS_ElemIteratorPtr eIt = pLink->_mediumNode->GetInverseElementIterator();
4609 while ( eIt->more() )
4611 const SMDS_MeshElement* e = eIt->next();
4612 switch( e->GetEntityType() ) {
4613 case SMDSEntity_BiQuad_Quadrangle: biQuadQuas.insert( e ); break;
4614 case SMDSEntity_BiQuad_Triangle: biQuadTris.insert( e ); break;
4615 case SMDSEntity_TriQuad_Hexa: triQuadHexa.insert( e ); break;
4622 // Fix positions of central nodes of bi-tri-quadratic elements
4624 // treat bi-quad quadrangles
4626 vector< const SMDS_MeshNode* > nodes( 9 );
4628 TIDSortedElemSet::iterator quadIt = biQuadQuas.begin();
4629 for ( ; quadIt != biQuadQuas.end(); ++quadIt )
4631 const SMDS_MeshElement* quad = *quadIt;
4634 nodes.assign( quad->begin_nodes(), quad->end_nodes() );
4636 TopoDS_Shape S = GetSubShapeByNode( nodes.back(), GetMeshDS() );
4637 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4638 const TopoDS_Face& F = TopoDS::Face( S );
4639 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4640 const double tol = BRep_Tool::Tolerance( F );
4642 for ( int i = 0; i < 8; ++i )
4644 uv[ i ] = GetNodeUV( F, nodes[i], nodes[8], &checkUV );
4645 // as this method is used after mesh generation, UV of nodes is not
4646 // updated according to bending links, so we update
4647 if ( i > 3 && nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4648 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4650 // move the central node
4651 gp_XY uvCent = calcTFI (0.5, 0.5, uv[0],uv[1],uv[2],uv[3],uv[4],uv[5],uv[6],uv[7] );
4652 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4653 GetMeshDS()->MoveNode( nodes[8], p.X(), p.Y(), p.Z());
4657 // treat bi-quad triangles
4659 vector< const SMDS_MeshNode* > nodes;
4661 TIDSortedElemSet::iterator triIt = biQuadTris.begin();
4662 for ( ; triIt != biQuadTris.end(); ++triIt )
4664 const SMDS_MeshElement* tria = *triIt;
4666 const TopoDS_Shape& S = GetMeshDS()->IndexToShape( tria->getshapeId() );
4667 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4668 const TopoDS_Face& F = TopoDS::Face( S );
4669 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4670 const double tol = BRep_Tool::Tolerance( F );
4673 nodes.assign( tria->begin_nodes(), tria->end_nodes() );
4675 for ( int i = 0; i < 6; ++i )
4677 uv[ i ] = GetNodeUV( F, nodes[i], nodes[(i+1)%3], &checkUV );
4678 // as this method is used after mesh generation, UV of nodes is not
4679 // updated according to bending links, so we update
4680 if ( nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4681 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4683 // move the central node
4684 gp_XY uvCent = GetCenterUV( uv[0], uv[1], uv[2], uv[3], uv[4], uv[5] );
4685 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4686 GetMeshDS()->MoveNode( tria->GetNode(6), p.X(), p.Y(), p.Z() );
4690 // treat tri-quadratic hexahedra
4692 SMDS_VolumeTool volExp;
4693 TIDSortedElemSet::iterator hexIt = triQuadHexa.begin();
4694 for ( ; hexIt != triQuadHexa.end(); ++hexIt )
4696 volExp.Set( *hexIt, /*ignoreCentralNodes=*/false );
4698 // fix nodes central in sides
4699 for ( int iQuad = 0; iQuad < volExp.NbFaces(); ++iQuad )
4701 const SMDS_MeshNode** quadNodes = volExp.GetFaceNodes( iQuad );
4702 if ( quadNodes[8]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
4704 gp_XYZ p = calcTFI( 0.5, 0.5,
4705 SMESH_TNodeXYZ( quadNodes[0] ), SMESH_TNodeXYZ( quadNodes[2] ),
4706 SMESH_TNodeXYZ( quadNodes[4] ), SMESH_TNodeXYZ( quadNodes[6] ),
4707 SMESH_TNodeXYZ( quadNodes[1] ), SMESH_TNodeXYZ( quadNodes[3] ),
4708 SMESH_TNodeXYZ( quadNodes[5] ), SMESH_TNodeXYZ( quadNodes[7] ));
4709 GetMeshDS()->MoveNode( quadNodes[8], p.X(), p.Y(), p.Z());
4713 // fix the volume central node
4714 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
4715 const SMDS_MeshNode** hexNodes = volExp.GetNodes();
4717 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( hexNodes[ 0 ] );
4718 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( hexNodes[ 3 ] );
4719 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( hexNodes[ 1 ] );
4720 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( hexNodes[ 2 ] );
4721 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( hexNodes[ 4 ] );
4722 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( hexNodes[ 7 ] );
4723 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( hexNodes[ 5 ] );
4724 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( hexNodes[ 6 ] );
4726 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( hexNodes[ 11 ] );
4727 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( hexNodes[ 9 ] );
4728 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( hexNodes[ 8 ] );
4729 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( hexNodes[ 10 ] );
4730 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( hexNodes[ 15 ] );
4731 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( hexNodes[ 13 ] );
4732 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( hexNodes[ 12 ] );
4733 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( hexNodes[ 14 ] );
4734 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( hexNodes[ 16 ] );
4735 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( hexNodes[ 19 ] );
4736 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( hexNodes[ 17 ] );
4737 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( hexNodes[ 18 ] );
4739 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( hexNodes[ 20 ] );
4740 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( hexNodes[ 25 ] );
4741 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( hexNodes[ 21 ] );
4742 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( hexNodes[ 23 ] );
4743 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( hexNodes[ 24 ] );
4744 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( hexNodes[ 22 ] );
4746 gp_XYZ nCenterParams(0.5, 0.5, 0.5), nCenterCoords;
4747 SMESH_Block::ShellPoint( nCenterParams, pointsOnShapes, nCenterCoords );
4748 GetMeshDS()->MoveNode( hexNodes[26],
4749 nCenterCoords.X(), nCenterCoords.Y(), nCenterCoords.Z());