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 // if ( surface->IsUPeriodic() || surface->IsVPeriodic() ||
247 // surface->IsUClosed() || surface->IsVClosed() )
249 //while ( surface->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
250 //surface = Handle(Geom_RectangularTrimmedSurface)::DownCast( surface )->BasisSurface();
252 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
254 // look for a seam edge
255 TopoDS_Edge edge = TopoDS::Edge( exp.Current() );
256 if ( BRep_Tool::IsClosed( edge, face )) {
257 // initialize myPar1, myPar2 and myParIndex
259 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
260 if ( Abs( uv1.Coord(1) - uv2.Coord(1) ) < Abs( uv1.Coord(2) - uv2.Coord(2) ))
262 double u1 = uv1.Coord(1);
264 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
265 double u2 = uv1.Coord(1);
266 myParIndex |= U_periodic;
267 myPar1[0] = Min( u1, u2 );
268 myPar2[0] = Max( u1, u2 );
271 double v1 = uv1.Coord(2);
273 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
274 double v2 = uv1.Coord(2);
275 myParIndex |= V_periodic;
276 myPar1[1] = Min( v1, v2 );
277 myPar2[1] = Max( v1, v2 );
279 // store seam shape indices, negative if shape encounters twice
280 int edgeID = meshDS->ShapeToIndex( edge );
281 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
282 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
283 int vertexID = meshDS->ShapeToIndex( v.Current() );
284 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
288 // look for a degenerated edge
289 if ( SMESH_Algo::isDegenerated( edge )) {
290 myDegenShapeIds.insert( meshDS->ShapeToIndex( edge ));
291 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
292 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
295 if ( !myDegenShapeIds.empty() && !myParIndex )
297 BRepAdaptor_Surface surf( face, false );
298 if ( surf.IsUPeriodic() || surf.IsUClosed() ) {
299 myParIndex |= U_periodic;
300 myPar1[0] = surf.FirstUParameter();
301 myPar2[0] = surf.LastUParameter();
303 else if ( surf.IsVPeriodic() || surf.IsVClosed() ) {
304 myParIndex |= V_periodic;
305 myPar1[1] = surf.FirstVParameter();
306 myPar2[1] = surf.LastVParameter();
313 //=======================================================================
314 //function : GetNodeUVneedInFaceNode
315 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
316 // Return true if the face is periodic.
317 // If F is Null, answer about sub-shape set through IsQuadraticSubMesh() or
319 //=======================================================================
321 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
323 if ( F.IsNull() ) return !mySeamShapeIds.empty();
325 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
326 return !mySeamShapeIds.empty();
329 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
330 if ( !aSurface.IsNull() )
331 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
336 //=======================================================================
337 //function : IsMedium
339 //=======================================================================
341 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
342 const SMDSAbs_ElementType typeToCheck)
344 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
347 //=======================================================================
348 //function : GetSubShapeByNode
349 //purpose : Return support shape of a node
350 //=======================================================================
352 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
353 const SMESHDS_Mesh* meshDS)
355 int shapeID = node ? node->getshapeId() : 0;
356 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
357 return meshDS->IndexToShape( shapeID );
359 return TopoDS_Shape();
363 //=======================================================================
364 //function : AddTLinkNode
365 //purpose : add a link in my data structure
366 //=======================================================================
368 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
369 const SMDS_MeshNode* n2,
370 const SMDS_MeshNode* n12)
372 // add new record to map
373 SMESH_TLink link( n1, n2 );
374 myTLinkNodeMap.insert( make_pair(link,n12));
377 //================================================================================
379 * \brief Add quadratic links of edge to own data structure
381 //================================================================================
383 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
385 if ( edge && edge->IsQuadratic() )
386 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
392 //================================================================================
394 * \brief Add quadratic links of face to own data structure
396 //================================================================================
398 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
402 switch ( f->NbNodes() ) {
404 // myMapWithCentralNode.insert
405 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2) ),
407 // break; -- add medium nodes as well
409 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
410 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
411 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
414 // myMapWithCentralNode.insert
415 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2),f->GetNode(3) ),
417 // break; -- add medium nodes as well
419 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
420 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
421 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
422 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7)); break;
429 //================================================================================
431 * \brief Add quadratic links of volume to own data structure
433 //================================================================================
435 bool SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
437 if ( volume->IsQuadratic() )
439 SMDS_VolumeTool vTool( volume );
440 const SMDS_MeshNode** nodes = vTool.GetNodes();
442 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
444 const int nbN = vTool.NbFaceNodes( iF );
445 const int* iNodes = vTool.GetFaceNodesIndices( iF );
446 for ( int i = 0; i < nbN; )
448 int iN1 = iNodes[i++];
449 int iN12 = iNodes[i++];
451 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
452 int linkID = iN1 * vTool.NbNodes() + iN2;
453 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
454 if ( it_isNew.second )
455 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
457 addedLinks.erase( it_isNew.first ); // each link encounters only twice
459 if ( vTool.NbNodes() == 27 )
461 const SMDS_MeshNode* nFCenter = nodes[ vTool.GetCenterNodeIndex( iF )];
462 if ( nFCenter->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
463 myMapWithCentralNode.insert
464 ( make_pair( TBiQuad( nodes[ iNodes[0]], nodes[ iNodes[1]],
465 nodes[ iNodes[2]], nodes[ iNodes[3]] ),
474 //================================================================================
476 * \brief Return true if position of nodes on the shape hasn't yet been checked or
477 * the positions proved to be invalid
479 //================================================================================
481 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
483 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
484 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
487 //================================================================================
489 * \brief Set validity of positions of nodes on the shape.
490 * Once set, validity is not changed
492 //================================================================================
494 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
496 std::map< int,bool >::iterator sh_ok =
497 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok)).first;
502 //=======================================================================
503 //function : ToFixNodeParameters
504 //purpose : Enables fixing node parameters on EDGEs and FACEs in
505 // GetNodeU(...,check=true), GetNodeUV(...,check=true), CheckNodeUV() and
506 // CheckNodeU() in case if a node lies on a shape set via SetSubShape().
508 //=======================================================================
510 void SMESH_MesherHelper::ToFixNodeParameters(bool toFix)
512 myFixNodeParameters = toFix;
516 //=======================================================================
517 //function : GetUVOnSeam
518 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
519 //=======================================================================
521 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
523 gp_Pnt2d result = uv1;
524 for ( int i = U_periodic; i <= V_periodic ; ++i )
526 if ( myParIndex & i )
528 double p1 = uv1.Coord( i );
529 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
530 if ( myParIndex == i ||
531 dp1 < ( myPar2[i-1] - myPar1[i-1] ) / 100. ||
532 dp2 < ( myPar2[i-1] - myPar1[i-1] ) / 100. )
534 double p2 = uv2.Coord( i );
535 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
536 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
537 result.SetCoord( i, p1Alt );
544 //=======================================================================
545 //function : GetNodeUV
546 //purpose : Return node UV on face
547 //=======================================================================
549 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
550 const SMDS_MeshNode* n,
551 const SMDS_MeshNode* n2,
554 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
556 const SMDS_PositionPtr Pos = n->GetPosition();
558 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
560 // node has position on face
561 const SMDS_FacePosition* fpos =
562 static_cast<const SMDS_FacePosition*>( Pos );
563 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
565 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
567 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
569 // node has position on edge => it is needed to find
570 // corresponding edge from face, get pcurve for this
571 // edge and retrieve value from this pcurve
572 const SMDS_EdgePosition* epos =
573 static_cast<const SMDS_EdgePosition*>( Pos );
574 int edgeID = n->getshapeId();
575 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
576 double f, l, u = epos->GetUParameter();
577 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
578 bool validU = ( f < u && u < l );
580 uv = C2d->Value( u );
582 uv.SetCoord( Precision::Infinite(),0.);
583 if ( check || !validU )
584 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ),/*force=*/ !validU );
586 // for a node on a seam edge select one of UVs on 2 pcurves
587 if ( n2 && IsSeamShape( edgeID ) )
589 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
592 { // adjust uv to period
594 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
595 Standard_Boolean isUPeriodic = S->IsUPeriodic();
596 Standard_Boolean isVPeriodic = S->IsVPeriodic();
598 if ( isUPeriodic || isVPeriodic ) {
599 Standard_Real UF,UL,VF,VL;
600 S->Bounds(UF,UL,VF,VL);
602 newUV.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
604 newUV.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
608 gp_Pnt2d uv2 = GetNodeUV( F, n2, 0, check );
609 if ( isUPeriodic && Abs( uv.X()-uv2.X() ) < Abs( newUV.X()-uv2.X() ))
610 newUV.SetX( uv.X() );
611 if ( isVPeriodic && Abs( uv.Y()-uv2.Y() ) < Abs( newUV.Y()-uv2.Y() ))
612 newUV.SetY( uv.Y() );
617 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
619 if ( int vertexID = n->getshapeId() ) {
620 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
622 uv = BRep_Tool::Parameters( V, F );
625 catch (Standard_Failure& exc) {
628 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
629 uvOK = ( V == vert.Current() );
631 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
632 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
633 // get UV of a vertex closest to the node
635 gp_Pnt pn = XYZ( n );
636 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
637 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
638 gp_Pnt p = BRep_Tool::Pnt( curV );
639 double curDist = p.SquareDistance( pn );
640 if ( curDist < dist ) {
642 uv = BRep_Tool::Parameters( curV, F );
643 uvOK = ( dist < DBL_MIN );
649 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
650 for ( ; it.More(); it.Next() ) {
651 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
652 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
654 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
655 if ( !C2d.IsNull() ) {
656 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
657 uv = C2d->Value( u );
665 if ( n2 && IsSeamShape( vertexID ) )
666 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
671 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
680 //=======================================================================
681 //function : CheckNodeUV
682 //purpose : Check and fix node UV on a face
683 //=======================================================================
685 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
686 const SMDS_MeshNode* n,
690 double distXYZ[4]) const
692 int shapeID = n->getshapeId();
693 bool infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ));
694 bool zero = ( uv.X() == 0. && uv.Y() == 0. );
695 if ( force || toCheckPosOnShape( shapeID ) || infinit || zero )
697 // check that uv is correct
699 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
700 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
702 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
704 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
706 setPosOnShapeValidity( shapeID, false );
707 if ( !infinit && distXYZ ) {
708 surfPnt.Transform( loc );
710 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
712 // uv incorrect, project the node to surface
713 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
714 projector.Perform( nodePnt );
715 if ( !projector.IsDone() || projector.NbPoints() < 1 )
717 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
720 Quantity_Parameter U,V;
721 projector.LowerDistanceParameters(U,V);
723 surfPnt = surface->Value( U, V );
724 dist = nodePnt.Distance( surfPnt );
726 surfPnt.Transform( loc );
728 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
732 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
735 // store the fixed UV on the face
736 if ( myShape.IsSame(F) && shapeID == myShapeID && myFixNodeParameters )
737 const_cast<SMDS_MeshNode*>(n)->SetPosition
738 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
740 else if ( uv.Modulus() > numeric_limits<double>::min() )
742 setPosOnShapeValidity( shapeID, true );
748 //=======================================================================
749 //function : GetProjector
750 //purpose : Return projector intitialized by given face without location, which is returned
751 //=======================================================================
753 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
754 TopLoc_Location& loc,
757 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
758 int faceID = GetMeshDS()->ShapeToIndex( F );
759 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
760 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
761 if ( i_proj == i2proj.end() )
763 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
764 double U1, U2, V1, V2;
765 surface->Bounds(U1, U2, V1, V2);
766 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
767 proj->Init( surface, U1, U2, V1, V2, tol );
768 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
770 return *( i_proj->second );
775 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
776 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
777 gp_XY_FunPtr(Subtracted);
780 //=======================================================================
781 //function : applyIn2D
782 //purpose : Perform given operation on two 2d points in parameric space of given surface.
783 // It takes into account period of the surface. Use gp_XY_FunPtr macro
784 // to easily define pointer to function of gp_XY class.
785 //=======================================================================
787 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
791 const bool resultInPeriod)
793 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
794 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
795 if ( !isUPeriodic && !isVPeriodic )
798 // move uv2 not far than half-period from uv1
800 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
802 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
805 gp_XY res = fun( uv1, gp_XY(u2,v2) );
807 // move result within period
808 if ( resultInPeriod )
810 Standard_Real UF,UL,VF,VL;
811 surface->Bounds(UF,UL,VF,VL);
813 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
815 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
820 //=======================================================================
821 //function : GetMiddleUV
822 //purpose : Return middle UV taking in account surface period
823 //=======================================================================
825 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
830 // the proper place of getting basic surface seems to be in applyIn2D()
831 // but we put it here to decrease a risk of regressions just before releasing a version
832 Handle(Geom_Surface) surf = surface;
833 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
834 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
836 return applyIn2D( surf, p1, p2, & AverageUV );
839 //=======================================================================
840 //function : GetCenterUV
841 //purpose : Return UV for the central node of a biquadratic triangle
842 //=======================================================================
844 gp_XY SMESH_MesherHelper::GetCenterUV(const gp_XY& uv1,
850 bool * isBadTria/*=0*/)
853 gp_XY uvAvg = ( uv12 + uv23 + uv31 ) / 3.;
855 if (( badTria = (( uvAvg - uv1 ) * ( uvAvg - uv23 ) > 0 )))
856 uvAvg = ( uv1 + uv23 ) / 2.;
857 else if (( badTria = (( uvAvg - uv2 ) * ( uvAvg - uv31 ) > 0 )))
858 uvAvg = ( uv2 + uv31 ) / 2.;
859 else if (( badTria = (( uvAvg - uv3 ) * ( uvAvg - uv12 ) > 0 )))
860 uvAvg = ( uv3 + uv12 ) / 2.;
863 *isBadTria = badTria;
867 //=======================================================================
868 //function : GetNodeU
869 //purpose : Return node U on edge
870 //=======================================================================
872 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
873 const SMDS_MeshNode* n,
874 const SMDS_MeshNode* inEdgeNode,
877 double param = Precision::Infinite();
879 const SMDS_PositionPtr pos = n->GetPosition();
880 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
882 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
883 param = epos->GetUParameter();
885 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
887 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
890 BRep_Tool::Range( E, f,l );
891 double uInEdge = GetNodeU( E, inEdgeNode );
892 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
896 SMESHDS_Mesh * meshDS = GetMeshDS();
897 int vertexID = n->getshapeId();
898 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
899 param = BRep_Tool::Parameter( V, E );
904 double tol = BRep_Tool::Tolerance( E );
905 double f,l; BRep_Tool::Range( E, f,l );
906 bool force = ( param < f-tol || param > l+tol );
907 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
908 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
910 *check = CheckNodeU( E, n, param, 2*tol, force );
915 //=======================================================================
916 //function : CheckNodeU
917 //purpose : Check and fix node U on an edge
918 // Return false if U is bad and could not be fixed
919 //=======================================================================
921 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
922 const SMDS_MeshNode* n,
926 double distXYZ[4]) const
928 int shapeID = n->getshapeId();
929 bool infinit = Precision::IsInfinite( u );
930 bool zero = ( u == 0. );
931 if ( force || toCheckPosOnShape( shapeID ) || infinit || zero )
933 TopLoc_Location loc; double f,l;
934 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
935 if ( curve.IsNull() ) // degenerated edge
937 if ( u+tol < f || u-tol > l )
939 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
945 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
946 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
951 curvPnt = curve->Value( u );
952 dist = nodePnt.Distance( curvPnt );
954 curvPnt.Transform( loc );
956 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
961 setPosOnShapeValidity( shapeID, false );
962 // u incorrect, project the node to the curve
963 int edgeID = GetMeshDS()->ShapeToIndex( E );
964 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
965 TID2ProjectorOnCurve::iterator i_proj =
966 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
967 if ( !i_proj->second )
969 i_proj->second = new GeomAPI_ProjectPointOnCurve();
970 i_proj->second->Init( curve, f, l );
972 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
973 projector->Perform( nodePnt );
974 if ( projector->NbPoints() < 1 )
976 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
979 Quantity_Parameter U = projector->LowerDistanceParameter();
981 MESSAGE(" f " << f << " l " << l << " u " << u);
982 curvPnt = curve->Value( u );
983 dist = nodePnt.Distance( curvPnt );
985 curvPnt.Transform( loc );
987 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
991 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
992 MESSAGE("distance " << dist << " " << tol );
995 // store the fixed U on the edge
996 if ( myShape.IsSame(E) && shapeID == myShapeID && myFixNodeParameters )
997 const_cast<SMDS_MeshNode*>(n)->SetPosition
998 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
1000 else if ( fabs( u ) > numeric_limits<double>::min() )
1002 setPosOnShapeValidity( shapeID, true );
1004 if (( u < f-tol || u > l+tol ) && force )
1006 MESSAGE("u < f-tol || u > l+tol ; u " << u << " f " << f << " l " << l);
1007 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
1010 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
1011 double period = curve->Period();
1012 u = ( u < f ) ? u + period : u - period;
1014 catch (Standard_Failure& exc)
1024 //=======================================================================
1025 //function : GetMediumPos
1026 //purpose : Return index and type of the shape (EDGE or FACE only) to
1027 // set a medium node on
1028 //param : useCurSubShape - if true, returns the shape set via SetSubShape()
1030 //=======================================================================
1032 std::pair<int, TopAbs_ShapeEnum>
1033 SMESH_MesherHelper::GetMediumPos(const SMDS_MeshNode* n1,
1034 const SMDS_MeshNode* n2,
1035 const bool useCurSubShape)
1037 if ( useCurSubShape && !myShape.IsNull() )
1038 return std::make_pair( myShapeID, myShape.ShapeType() );
1040 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1044 if (( myShapeID == n1->getshapeId() || myShapeID == n2->getshapeId() ) && myShapeID > 0 )
1046 shapeType = myShape.ShapeType();
1047 shapeID = myShapeID;
1049 else if ( n1->getshapeId() == n2->getshapeId() )
1051 shapeID = n2->getshapeId();
1052 shape = GetSubShapeByNode( n1, GetMeshDS() );
1056 const SMDS_TypeOfPosition Pos1 = n1->GetPosition()->GetTypeOfPosition();
1057 const SMDS_TypeOfPosition Pos2 = n2->GetPosition()->GetTypeOfPosition();
1059 if ( Pos1 == SMDS_TOP_3DSPACE || Pos2 == SMDS_TOP_3DSPACE )
1062 else if ( Pos1 == SMDS_TOP_FACE || Pos2 == SMDS_TOP_FACE )
1064 if ( Pos1 != SMDS_TOP_FACE || Pos2 != SMDS_TOP_FACE )
1066 if ( Pos1 != SMDS_TOP_FACE ) std::swap( n1,n2 );
1067 TopoDS_Shape F = GetSubShapeByNode( n1, GetMeshDS() );
1068 TopoDS_Shape S = GetSubShapeByNode( n2, GetMeshDS() );
1069 if ( IsSubShape( S, F ))
1071 shapeType = TopAbs_FACE;
1072 shapeID = n1->getshapeId();
1076 else if ( Pos1 == SMDS_TOP_EDGE && Pos2 == SMDS_TOP_EDGE )
1078 TopoDS_Shape E1 = GetSubShapeByNode( n1, GetMeshDS() );
1079 TopoDS_Shape E2 = GetSubShapeByNode( n2, GetMeshDS() );
1080 shape = GetCommonAncestor( E1, E2, *myMesh, TopAbs_FACE );
1082 else if ( Pos1 == SMDS_TOP_VERTEX && Pos2 == SMDS_TOP_VERTEX )
1084 TopoDS_Shape V1 = GetSubShapeByNode( n1, GetMeshDS() );
1085 TopoDS_Shape V2 = GetSubShapeByNode( n2, GetMeshDS() );
1086 shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_EDGE );
1087 if ( shape.IsNull() ) shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_FACE );
1089 else // VERTEX and EDGE
1091 if ( Pos1 != SMDS_TOP_VERTEX ) std::swap( n1,n2 );
1092 TopoDS_Shape V = GetSubShapeByNode( n1, GetMeshDS() );
1093 TopoDS_Shape E = GetSubShapeByNode( n2, GetMeshDS() );
1094 if ( IsSubShape( V, E ))
1097 shape = GetCommonAncestor( V, E, *myMesh, TopAbs_FACE );
1101 if ( !shape.IsNull() )
1104 shapeID = GetMeshDS()->ShapeToIndex( shape );
1105 shapeType = shape.ShapeType();
1107 return make_pair( shapeID, shapeType );
1110 //=======================================================================
1111 //function : GetCentralNode
1112 //purpose : Return existing or create a new central node for a quardilateral
1113 // quadratic face given its 8 nodes.
1114 //@param : force3d - true means node creation in between the given nodes,
1115 // else node position is found on a geometrical face if any.
1116 //=======================================================================
1118 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1119 const SMDS_MeshNode* n2,
1120 const SMDS_MeshNode* n3,
1121 const SMDS_MeshNode* n4,
1122 const SMDS_MeshNode* n12,
1123 const SMDS_MeshNode* n23,
1124 const SMDS_MeshNode* n34,
1125 const SMDS_MeshNode* n41,
1128 SMDS_MeshNode *centralNode = 0; // central node to return
1130 // Find an existing central node
1132 TBiQuad keyOfMap(n1,n2,n3,n4);
1133 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1134 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1135 if ( itMapCentralNode != myMapWithCentralNode.end() )
1137 return (*itMapCentralNode).second;
1140 // Get type of shape for the new central node
1142 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1146 TopTools_ListIteratorOfListOfShape it;
1148 std::map< int, int > faceId2nbNodes;
1149 std::map< int, int > ::iterator itMapWithIdFace;
1151 SMESHDS_Mesh* meshDS = GetMeshDS();
1153 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1154 // on sub-shapes of the FACE
1155 if ( GetMesh()->HasShapeToMesh() )
1157 const SMDS_MeshNode* nodes[] = { n1, n2, n3, n4 };
1158 for(int i = 0; i < 4; i++)
1160 shape = GetSubShapeByNode( nodes[i], meshDS );
1161 if ( shape.IsNull() ) break;
1162 if ( shape.ShapeType() == TopAbs_SOLID )
1164 solidID = nodes[i]->getshapeId();
1165 shapeType = TopAbs_SOLID;
1168 if ( shape.ShapeType() == TopAbs_FACE )
1170 faceID = nodes[i]->getshapeId();
1171 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1172 itMapWithIdFace->second++;
1176 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1177 while ( const TopoDS_Shape* face = it->next() )
1179 faceID = meshDS->ShapeToIndex( *face );
1180 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1181 itMapWithIdFace->second++;
1186 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1188 // find ID of the FACE the four corner nodes belong to
1189 itMapWithIdFace = faceId2nbNodes.begin();
1190 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1192 if ( itMapWithIdFace->second == 4 )
1194 shapeType = TopAbs_FACE;
1195 faceID = (*itMapWithIdFace).first;
1202 if ( shapeType == TopAbs_FACE )
1204 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1211 bool toCheck = true;
1212 if ( !F.IsNull() && !force3d )
1214 uvAvg = calcTFI (0.5, 0.5,
1215 GetNodeUV(F,n1,n3,&toCheck), GetNodeUV(F,n2,n4,&toCheck),
1216 GetNodeUV(F,n3,n1,&toCheck), GetNodeUV(F,n4,n2,&toCheck),
1217 GetNodeUV(F,n12,n3), GetNodeUV(F,n23,n4),
1218 GetNodeUV(F,n34,n2), GetNodeUV(F,n41,n2));
1219 TopLoc_Location loc;
1220 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1221 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1222 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1223 // if ( mySetElemOnShape ) node is not elem!
1224 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1226 else // ( force3d || F.IsNull() )
1228 P = calcTFI (0.5, 0.5,
1229 SMESH_TNodeXYZ(n1), SMESH_TNodeXYZ(n2),
1230 SMESH_TNodeXYZ(n3), SMESH_TNodeXYZ(n4),
1231 SMESH_TNodeXYZ(n12), SMESH_TNodeXYZ(n23),
1232 SMESH_TNodeXYZ(n34), SMESH_TNodeXYZ(n41));
1233 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1235 if ( !F.IsNull() ) // force3d
1237 uvAvg = (GetNodeUV(F,n1,n3,&toCheck) +
1238 GetNodeUV(F,n2,n4,&toCheck) +
1239 GetNodeUV(F,n3,n1,&toCheck) +
1240 GetNodeUV(F,n4,n2,&toCheck)) / 4;
1241 //CheckNodeUV( F, centralNode, uvAvg, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1242 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1244 else if ( solidID > 0 )
1246 meshDS->SetNodeInVolume( centralNode, solidID );
1248 else if ( myShapeID > 0 && mySetElemOnShape )
1250 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1253 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1257 //=======================================================================
1258 //function : GetCentralNode
1259 //purpose : Return existing or create a new central node for a
1260 // quadratic triangle given its 6 nodes.
1261 //@param : force3d - true means node creation in between the given nodes,
1262 // else node position is found on a geometrical face if any.
1263 //=======================================================================
1265 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1266 const SMDS_MeshNode* n2,
1267 const SMDS_MeshNode* n3,
1268 const SMDS_MeshNode* n12,
1269 const SMDS_MeshNode* n23,
1270 const SMDS_MeshNode* n31,
1273 SMDS_MeshNode *centralNode = 0; // central node to return
1275 // Find an existing central node
1277 TBiQuad keyOfMap(n1,n2,n3);
1278 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1279 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1280 if ( itMapCentralNode != myMapWithCentralNode.end() )
1282 return (*itMapCentralNode).second;
1285 // Get type of shape for the new central node
1287 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1291 TopTools_ListIteratorOfListOfShape it;
1293 std::map< int, int > faceId2nbNodes;
1294 std::map< int, int > ::iterator itMapWithIdFace;
1296 SMESHDS_Mesh* meshDS = GetMeshDS();
1298 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1299 // on sub-shapes of the FACE
1300 if ( GetMesh()->HasShapeToMesh() )
1302 const SMDS_MeshNode* nodes[] = { n1, n2, n3 };
1303 for(int i = 0; i < 3; i++)
1305 shape = GetSubShapeByNode( nodes[i], meshDS );
1306 if ( shape.IsNull() ) break;
1307 if ( shape.ShapeType() == TopAbs_SOLID )
1309 solidID = nodes[i]->getshapeId();
1310 shapeType = TopAbs_SOLID;
1313 if ( shape.ShapeType() == TopAbs_FACE )
1315 faceID = nodes[i]->getshapeId();
1316 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1317 itMapWithIdFace->second++;
1321 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1322 while ( const TopoDS_Shape* face = it->next() )
1324 faceID = meshDS->ShapeToIndex( *face );
1325 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1326 itMapWithIdFace->second++;
1331 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1333 // find ID of the FACE the four corner nodes belong to
1334 itMapWithIdFace = faceId2nbNodes.begin();
1335 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1337 if ( itMapWithIdFace->second == 3 )
1339 shapeType = TopAbs_FACE;
1340 faceID = (*itMapWithIdFace).first;
1350 if ( shapeType == TopAbs_FACE )
1352 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1354 gp_XY uv1 = GetNodeUV( F, n1, n23, &check );
1355 gp_XY uv2 = GetNodeUV( F, n2, n31, &check );
1356 gp_XY uv3 = GetNodeUV( F, n3, n12, &check );
1357 gp_XY uv12 = GetNodeUV( F, n12, n3, &check );
1358 gp_XY uv23 = GetNodeUV( F, n23, n1, &check );
1359 gp_XY uv31 = GetNodeUV( F, n31, n2, &check );
1360 uvAvg = GetCenterUV( uv1,uv2,uv3, uv12,uv23,uv31, &badTria );
1365 // Create a central node
1368 if ( !F.IsNull() && !force3d )
1370 TopLoc_Location loc;
1371 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1372 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1373 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1374 // if ( mySetElemOnShape ) node is not elem!
1375 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1377 else // ( force3d || F.IsNull() )
1379 P = ( SMESH_TNodeXYZ( n12 ) +
1380 SMESH_TNodeXYZ( n23 ) +
1381 SMESH_TNodeXYZ( n31 ) ) / 3;
1382 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1384 if ( !F.IsNull() ) // force3d
1386 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1388 else if ( solidID > 0 )
1390 meshDS->SetNodeInVolume( centralNode, solidID );
1392 else if ( myShapeID > 0 && mySetElemOnShape )
1394 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1397 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1401 //=======================================================================
1402 //function : GetMediumNode
1403 //purpose : Return existing or create a new medium node between given ones
1404 //=======================================================================
1406 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
1407 const SMDS_MeshNode* n2,
1410 // Find existing node
1412 SMESH_TLink link(n1,n2);
1413 ItTLinkNode itLN = myTLinkNodeMap.find( link );
1414 if ( itLN != myTLinkNodeMap.end() ) {
1415 return (*itLN).second;
1418 // Create medium node
1421 SMESHDS_Mesh* meshDS = GetMeshDS();
1423 if ( IsSeamShape( n1->getshapeId() ))
1424 // to get a correct UV of a node on seam, the second node must have checked UV
1425 std::swap( n1, n2 );
1427 // get type of shape for the new medium node
1428 int faceID = -1, edgeID = -1;
1429 TopoDS_Edge E; double u [2];
1430 TopoDS_Face F; gp_XY uv[2];
1431 bool uvOK[2] = { false, false };
1433 pair<int, TopAbs_ShapeEnum> pos = GetMediumPos( n1, n2, mySetElemOnShape );
1434 // calling GetMediumPos() with useCurSubShape=mySetElemOnShape is OK only for the
1435 // case where the lower dim mesh is already constructed, else, nodes on EDGEs are
1436 // assigned to FACE, for example.
1438 // get positions of the given nodes on shapes
1439 if ( pos.second == TopAbs_FACE )
1441 F = TopoDS::Face(meshDS->IndexToShape( faceID = pos.first ));
1442 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
1443 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
1445 else if ( pos.second == TopAbs_EDGE )
1447 const SMDS_PositionPtr Pos1 = n1->GetPosition();
1448 const SMDS_PositionPtr Pos2 = n2->GetPosition();
1449 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1450 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1451 n1->getshapeId() != n2->getshapeId() )
1454 return getMediumNodeOnComposedWire(n1,n2,force3d);
1456 E = TopoDS::Edge(meshDS->IndexToShape( edgeID = pos.first ));
1458 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
1459 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
1461 catch ( Standard_Failure& f )
1463 // issue 22502 / a node is on VERTEX not belonging to E
1464 // issue 22568 / both nodes are on non-connected VERTEXes
1465 return getMediumNodeOnComposedWire(n1,n2,force3d);
1469 if ( !force3d & uvOK[0] && uvOK[1] )
1471 // we try to create medium node using UV parameters of
1472 // nodes, else - medium between corresponding 3d points
1475 //if ( uvOK[0] && uvOK[1] )
1477 if ( IsDegenShape( n1->getshapeId() )) {
1478 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
1479 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
1481 else if ( IsDegenShape( n2->getshapeId() )) {
1482 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
1483 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
1485 TopLoc_Location loc;
1486 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
1487 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
1488 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
1489 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1490 // if ( mySetElemOnShape ) node is not elem!
1491 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
1492 myTLinkNodeMap.insert(make_pair(link,n12));
1496 else if ( !E.IsNull() )
1499 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1502 Standard_Boolean isPeriodic = C->IsPeriodic();
1505 Standard_Real Period = C->Period();
1506 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1507 Standard_Real pmid = (u[0]+p)/2.;
1508 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1513 gp_Pnt P = C->Value( U );
1514 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1515 //if ( mySetElemOnShape ) node is not elem!
1516 meshDS->SetNodeOnEdge(n12, edgeID, U);
1517 myTLinkNodeMap.insert(make_pair(link,n12));
1524 double x = ( n1->X() + n2->X() )/2.;
1525 double y = ( n1->Y() + n2->Y() )/2.;
1526 double z = ( n1->Z() + n2->Z() )/2.;
1527 n12 = meshDS->AddNode(x,y,z);
1529 //if ( mySetElemOnShape ) node is not elem!
1533 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1534 CheckNodeUV( F, n12, UV, 2 * BRep_Tool::Tolerance( F ), /*force=*/true);
1535 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1537 else if ( !E.IsNull() )
1539 double U = ( u[0] + u[1] ) / 2.;
1540 CheckNodeU( E, n12, U, 2 * BRep_Tool::Tolerance( E ), /*force=*/true);
1541 meshDS->SetNodeOnEdge(n12, edgeID, U);
1543 else if ( myShapeID > 0 && mySetElemOnShape )
1545 meshDS->SetMeshElementOnShape(n12, myShapeID);
1549 myTLinkNodeMap.insert( make_pair( link, n12 ));
1553 //================================================================================
1555 * \brief Makes a medium node if nodes reside different edges
1557 //================================================================================
1559 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1560 const SMDS_MeshNode* n2,
1563 SMESH_TNodeXYZ p1( n1 ), p2( n2 );
1564 gp_Pnt middle = 0.5 * p1 + 0.5 * p2;
1565 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1567 // To find position on edge and 3D position for n12,
1568 // project <middle> to 2 edges and select projection most close to <middle>
1570 TopoDS_Edge bestEdge;
1571 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4], f,l;
1573 // get shapes under the nodes
1574 TopoDS_Shape shape[2];
1576 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1578 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1579 TopoDS_Shape S = GetSubShapeByNode( n, GetMeshDS() );
1581 shape[ nbShapes++ ] = S;
1584 vector< TopoDS_Shape > edges;
1585 for ( int iS = 0; iS < nbShapes; ++iS )
1587 switch ( shape[iS].ShapeType() ) {
1590 edges.push_back( shape[iS] );
1596 if ( nbShapes == 2 && iS==0 && shape[1-iS].ShapeType() == TopAbs_VERTEX )
1597 edge = GetCommonAncestor( shape[iS], shape[1-iS], *myMesh, TopAbs_EDGE );
1599 if ( edge.IsNull() )
1601 PShapeIteratorPtr eIt = GetAncestors( shape[iS], *myMesh, TopAbs_EDGE );
1602 while( const TopoDS_Shape* e = eIt->next() )
1603 edges.push_back( *e );
1609 if ( nbShapes == 1 || shape[1-iS].ShapeType() < TopAbs_EDGE )
1610 for ( TopExp_Explorer e( shape[iS], TopAbs_EDGE ); e.More(); e.Next() )
1611 edges.push_back( e.Current() );
1618 // project to get U of projection and distance from middle to projection
1619 for ( size_t iE = 0; iE < edges.size(); ++iE )
1621 const TopoDS_Edge& edge = TopoDS::Edge( edges[ iE ]);
1622 distXYZ[0] = distMiddleProj;
1624 CheckNodeU( edge, n12, testU, 2 * BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1625 if ( distXYZ[0] < distMiddleProj )
1627 distMiddleProj = distXYZ[0];
1633 // // both projections failed; set n12 on the edge of n1 with U of a common vertex
1634 // TopoDS_Vertex vCommon;
1635 // if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1636 // u = BRep_Tool::Parameter( vCommon, edges[0] );
1639 // double f,l, u0 = GetNodeU( edges[0], n1 );
1640 // BRep_Tool::Range( edges[0],f,l );
1641 // u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1644 // distMiddleProj = 0;
1647 if ( !bestEdge.IsNull() )
1649 // move n12 to position of a successfull projection
1650 //double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1651 if ( !force3d /*&& distMiddleProj > 2*tol*/ )
1653 TopLoc_Location loc;
1654 Handle(Geom_Curve) curve = BRep_Tool::Curve( bestEdge,loc,f,l );
1655 gp_Pnt p = curve->Value( u ).Transformed( loc );
1656 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1658 //if ( mySetElemOnShape ) node is not elem!
1660 int edgeID = GetMeshDS()->ShapeToIndex( bestEdge );
1661 if ( edgeID != n12->getshapeId() )
1662 GetMeshDS()->UnSetNodeOnShape( n12 );
1663 GetMeshDS()->SetNodeOnEdge(n12, edgeID, u);
1666 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1671 //=======================================================================
1672 //function : AddNode
1673 //purpose : Creates a node
1674 //=======================================================================
1676 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID,
1679 SMESHDS_Mesh * meshDS = GetMeshDS();
1680 SMDS_MeshNode* node = 0;
1682 node = meshDS->AddNodeWithID( x, y, z, ID );
1684 node = meshDS->AddNode( x, y, z );
1685 if ( mySetElemOnShape && myShapeID > 0 ) { // node is not elem ?
1686 switch ( myShape.ShapeType() ) {
1687 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1688 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1689 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID, u, v); break;
1690 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID, u); break;
1691 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1698 //=======================================================================
1699 //function : AddEdge
1700 //purpose : Creates quadratic or linear edge
1701 //=======================================================================
1703 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1704 const SMDS_MeshNode* n2,
1708 SMESHDS_Mesh * meshDS = GetMeshDS();
1710 SMDS_MeshEdge* edge = 0;
1711 if (myCreateQuadratic) {
1712 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1714 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1716 edge = meshDS->AddEdge(n1, n2, n12);
1720 edge = meshDS->AddEdgeWithID(n1, n2, id);
1722 edge = meshDS->AddEdge(n1, n2);
1725 if ( mySetElemOnShape && myShapeID > 0 )
1726 meshDS->SetMeshElementOnShape( edge, myShapeID );
1731 //=======================================================================
1732 //function : AddFace
1733 //purpose : Creates quadratic or linear triangle
1734 //=======================================================================
1736 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1737 const SMDS_MeshNode* n2,
1738 const SMDS_MeshNode* n3,
1742 SMESHDS_Mesh * meshDS = GetMeshDS();
1743 SMDS_MeshFace* elem = 0;
1745 if( n1==n2 || n2==n3 || n3==n1 )
1748 if(!myCreateQuadratic) {
1750 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1752 elem = meshDS->AddFace(n1, n2, n3);
1755 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1756 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1757 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1758 if(myCreateBiQuadratic)
1760 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n12, n23, n31, force3d);
1762 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, nCenter, id);
1764 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31, nCenter);
1769 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1771 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1774 if ( mySetElemOnShape && myShapeID > 0 )
1775 meshDS->SetMeshElementOnShape( elem, myShapeID );
1780 //=======================================================================
1781 //function : AddFace
1782 //purpose : Creates bi-quadratic, quadratic or linear quadrangle
1783 //=======================================================================
1785 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1786 const SMDS_MeshNode* n2,
1787 const SMDS_MeshNode* n3,
1788 const SMDS_MeshNode* n4,
1792 SMESHDS_Mesh * meshDS = GetMeshDS();
1793 SMDS_MeshFace* elem = 0;
1796 return AddFace(n1,n3,n4,id,force3d);
1799 return AddFace(n1,n2,n4,id,force3d);
1802 return AddFace(n1,n2,n3,id,force3d);
1805 return AddFace(n1,n2,n4,id,force3d);
1808 return AddFace(n1,n2,n3,id,force3d);
1811 return AddFace(n1,n2,n3,id,force3d);
1814 if(!myCreateQuadratic) {
1816 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1818 elem = meshDS->AddFace(n1, n2, n3, n4);
1821 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1822 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1823 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1824 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1825 if(myCreateBiQuadratic)
1827 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n4, n12, n23, n34, n41, force3d);
1829 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, nCenter, id);
1831 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41, nCenter);
1836 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1838 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1841 if ( mySetElemOnShape && myShapeID > 0 )
1842 meshDS->SetMeshElementOnShape( elem, myShapeID );
1847 //=======================================================================
1848 //function : AddPolygonalFace
1849 //purpose : Creates polygon, with additional nodes in quadratic mesh
1850 //=======================================================================
1852 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1856 SMESHDS_Mesh * meshDS = GetMeshDS();
1857 SMDS_MeshFace* elem = 0;
1859 if(!myCreateQuadratic) {
1861 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1863 elem = meshDS->AddPolygonalFace(nodes);
1866 vector<const SMDS_MeshNode*> newNodes;
1867 for ( int i = 0; i < nodes.size(); ++i )
1869 const SMDS_MeshNode* n1 = nodes[i];
1870 const SMDS_MeshNode* n2 = nodes[(i+1)%nodes.size()];
1871 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1872 newNodes.push_back( n1 );
1873 newNodes.push_back( n12 );
1876 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1878 elem = meshDS->AddPolygonalFace(newNodes);
1880 if ( mySetElemOnShape && myShapeID > 0 )
1881 meshDS->SetMeshElementOnShape( elem, myShapeID );
1886 //=======================================================================
1887 //function : AddVolume
1888 //purpose : Creates quadratic or linear prism
1889 //=======================================================================
1891 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1892 const SMDS_MeshNode* n2,
1893 const SMDS_MeshNode* n3,
1894 const SMDS_MeshNode* n4,
1895 const SMDS_MeshNode* n5,
1896 const SMDS_MeshNode* n6,
1900 SMESHDS_Mesh * meshDS = GetMeshDS();
1901 SMDS_MeshVolume* elem = 0;
1902 if(!myCreateQuadratic) {
1904 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1906 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1909 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1910 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1911 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1913 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1914 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1915 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1917 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1918 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1919 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1922 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1923 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1925 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1926 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1928 if ( mySetElemOnShape && myShapeID > 0 )
1929 meshDS->SetMeshElementOnShape( elem, myShapeID );
1934 //=======================================================================
1935 //function : AddVolume
1936 //purpose : Creates quadratic or linear tetrahedron
1937 //=======================================================================
1939 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1940 const SMDS_MeshNode* n2,
1941 const SMDS_MeshNode* n3,
1942 const SMDS_MeshNode* n4,
1946 SMESHDS_Mesh * meshDS = GetMeshDS();
1947 SMDS_MeshVolume* elem = 0;
1948 if(!myCreateQuadratic) {
1950 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1952 elem = meshDS->AddVolume(n1, n2, n3, n4);
1955 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1956 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1957 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1959 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1960 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1961 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1964 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1966 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1968 if ( mySetElemOnShape && myShapeID > 0 )
1969 meshDS->SetMeshElementOnShape( elem, myShapeID );
1974 //=======================================================================
1975 //function : AddVolume
1976 //purpose : Creates quadratic or linear pyramid
1977 //=======================================================================
1979 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1980 const SMDS_MeshNode* n2,
1981 const SMDS_MeshNode* n3,
1982 const SMDS_MeshNode* n4,
1983 const SMDS_MeshNode* n5,
1987 SMDS_MeshVolume* elem = 0;
1988 if(!myCreateQuadratic) {
1990 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1992 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1995 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1996 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1997 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1998 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
2000 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
2001 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
2002 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
2003 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
2006 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
2011 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
2013 n15, n25, n35, n45);
2015 if ( mySetElemOnShape && myShapeID > 0 )
2016 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
2021 //=======================================================================
2022 //function : AddVolume
2023 //purpose : Creates bi-quadratic, quadratic or linear hexahedron
2024 //=======================================================================
2026 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2027 const SMDS_MeshNode* n2,
2028 const SMDS_MeshNode* n3,
2029 const SMDS_MeshNode* n4,
2030 const SMDS_MeshNode* n5,
2031 const SMDS_MeshNode* n6,
2032 const SMDS_MeshNode* n7,
2033 const SMDS_MeshNode* n8,
2037 SMESHDS_Mesh * meshDS = GetMeshDS();
2038 SMDS_MeshVolume* elem = 0;
2039 if(!myCreateQuadratic) {
2041 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
2043 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
2046 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2047 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
2048 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
2049 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
2051 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
2052 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
2053 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
2054 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
2056 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
2057 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
2058 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
2059 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
2060 if(myCreateBiQuadratic)
2062 const SMDS_MeshNode* n1234 = GetCentralNode(n1,n2,n3,n4,n12,n23,n34,n41,force3d);
2063 const SMDS_MeshNode* n1256 = GetCentralNode(n1,n2,n5,n6,n12,n26,n56,n15,force3d);
2064 const SMDS_MeshNode* n2367 = GetCentralNode(n2,n3,n6,n7,n23,n37,n67,n26,force3d);
2065 const SMDS_MeshNode* n3478 = GetCentralNode(n3,n4,n7,n8,n34,n48,n78,n37,force3d);
2066 const SMDS_MeshNode* n1458 = GetCentralNode(n1,n4,n5,n8,n41,n48,n15,n85,force3d);
2067 const SMDS_MeshNode* n5678 = GetCentralNode(n5,n6,n7,n8,n56,n67,n78,n85,force3d);
2069 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
2071 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( n4 );
2072 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( n8 );
2073 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( n3 );
2074 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( n7 );
2075 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( n1 );
2076 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( n5 );
2077 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( n2 );
2078 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( n6 );
2080 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( n48 );
2081 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( n37 );
2082 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( n15 );
2083 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( n26 );
2084 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( n34 );
2085 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( n78 );
2086 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( n12 );
2087 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( n56 );
2088 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( n41 );
2089 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( n85 );
2090 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( n23 );
2091 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( n67 );
2093 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( n3478 );
2094 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( n1256 );
2095 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( n1458 );
2096 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( n2367 );
2097 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( n1234 );
2098 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( n5678 );
2100 gp_XYZ centerCube(0.5, 0.5, 0.5);
2102 SMESH_Block::ShellPoint( centerCube, pointsOnShapes, nCenterElem );
2103 const SMDS_MeshNode* nCenter =
2104 meshDS->AddNode( nCenterElem.X(), nCenterElem.Y(), nCenterElem.Z() );
2105 meshDS->SetNodeInVolume( nCenter, myShapeID );
2108 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2109 n12, n23, n34, n41, n56, n67,
2110 n78, n85, n15, n26, n37, n48,
2111 n1234, n1256, n2367, n3478, n1458, n5678, nCenter, id);
2113 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2114 n12, n23, n34, n41, n56, n67,
2115 n78, n85, n15, n26, n37, n48,
2116 n1234, n1256, n2367, n3478, n1458, n5678, nCenter);
2121 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2122 n12, n23, n34, n41, n56, n67,
2123 n78, n85, n15, n26, n37, n48, id);
2125 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2126 n12, n23, n34, n41, n56, n67,
2127 n78, n85, n15, n26, n37, n48);
2130 if ( mySetElemOnShape && myShapeID > 0 )
2131 meshDS->SetMeshElementOnShape( elem, myShapeID );
2136 //=======================================================================
2137 //function : AddVolume
2138 //purpose : Creates LINEAR!!!!!!!!! octahedron
2139 //=======================================================================
2141 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2142 const SMDS_MeshNode* n2,
2143 const SMDS_MeshNode* n3,
2144 const SMDS_MeshNode* n4,
2145 const SMDS_MeshNode* n5,
2146 const SMDS_MeshNode* n6,
2147 const SMDS_MeshNode* n7,
2148 const SMDS_MeshNode* n8,
2149 const SMDS_MeshNode* n9,
2150 const SMDS_MeshNode* n10,
2151 const SMDS_MeshNode* n11,
2152 const SMDS_MeshNode* n12,
2156 SMESHDS_Mesh * meshDS = GetMeshDS();
2157 SMDS_MeshVolume* elem = 0;
2159 elem = meshDS->AddVolumeWithID(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12,id);
2161 elem = meshDS->AddVolume(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12);
2162 if ( mySetElemOnShape && myShapeID > 0 )
2163 meshDS->SetMeshElementOnShape( elem, myShapeID );
2167 //=======================================================================
2168 //function : AddPolyhedralVolume
2169 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
2170 //=======================================================================
2173 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
2174 const std::vector<int>& quantities,
2178 SMESHDS_Mesh * meshDS = GetMeshDS();
2179 SMDS_MeshVolume* elem = 0;
2180 if(!myCreateQuadratic)
2183 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
2185 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
2189 vector<const SMDS_MeshNode*> newNodes;
2190 vector<int> newQuantities;
2191 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
2193 int nbNodesInFace = quantities[iFace];
2194 newQuantities.push_back(0);
2195 for ( int i = 0; i < nbNodesInFace; ++i )
2197 const SMDS_MeshNode* n1 = nodes[ iN + i ];
2198 newNodes.push_back( n1 );
2199 newQuantities.back()++;
2201 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
2202 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
2203 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
2205 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2206 newNodes.push_back( n12 );
2207 newQuantities.back()++;
2210 iN += nbNodesInFace;
2213 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
2215 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
2217 if ( mySetElemOnShape && myShapeID > 0 )
2218 meshDS->SetMeshElementOnShape( elem, myShapeID );
2225 //================================================================================
2227 * \brief Check if a node belongs to any face of sub-mesh
2229 //================================================================================
2231 bool isNodeInSubMesh( const SMDS_MeshNode* n, const SMESHDS_SubMesh* sm )
2233 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2234 while ( fIt->more() )
2235 if ( sm->Contains( fIt->next() ))
2241 //=======================================================================
2242 //function : IsSameElemGeometry
2243 //purpose : Returns true if all elements of a sub-mesh are of same shape
2244 //=======================================================================
2246 bool SMESH_MesherHelper::IsSameElemGeometry(const SMESHDS_SubMesh* smDS,
2247 SMDSAbs_GeometryType shape,
2248 const bool nullSubMeshRes)
2250 if ( !smDS ) return nullSubMeshRes;
2252 SMDS_ElemIteratorPtr elemIt = smDS->GetElements();
2253 while ( elemIt->more() ) {
2254 const SMDS_MeshElement* e = elemIt->next();
2255 if ( e->GetGeomType() != shape )
2261 //=======================================================================
2262 //function : LoadNodeColumns
2263 //purpose : Load nodes bound to face into a map of node columns
2264 //=======================================================================
2266 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2267 const TopoDS_Face& theFace,
2268 const TopoDS_Edge& theBaseEdge,
2269 SMESHDS_Mesh* theMesh,
2270 SMESH_ProxyMesh* theProxyMesh)
2272 return LoadNodeColumns(theParam2ColumnMap,
2274 std::list<TopoDS_Edge>(1,theBaseEdge),
2279 //=======================================================================
2280 //function : LoadNodeColumns
2281 //purpose : Load nodes bound to face into a map of node columns
2282 //=======================================================================
2284 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2285 const TopoDS_Face& theFace,
2286 const std::list<TopoDS_Edge>& theBaseSide,
2287 SMESHDS_Mesh* theMesh,
2288 SMESH_ProxyMesh* theProxyMesh)
2290 // get a right sub-mesh of theFace
2292 const SMESHDS_SubMesh* faceSubMesh = 0;
2295 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
2296 if ( !faceSubMesh ||
2297 faceSubMesh->NbElements() == 0 ||
2298 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
2300 // can use a proxy sub-mesh with not temporary elements only
2306 faceSubMesh = theMesh->MeshElements( theFace );
2307 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
2310 if ( theParam2ColumnMap.empty() )
2312 // get data of edges for normalization of params
2313 vector< double > length;
2315 list<TopoDS_Edge>::const_iterator edge;
2317 for ( edge = theBaseSide.begin(); edge != theBaseSide.end(); ++edge )
2319 double len = std::max( 1e-10, SMESH_Algo::EdgeLength( *edge ));
2321 length.push_back( len );
2325 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
2326 edge = theBaseSide.begin();
2327 for ( int iE = 0; edge != theBaseSide.end(); ++edge, ++iE )
2329 map< double, const SMDS_MeshNode*> sortedBaseNN;
2330 SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN);
2331 if ( sortedBaseNN.empty() ) continue;
2333 map< double, const SMDS_MeshNode*>::iterator u_n = sortedBaseNN.begin();
2334 if ( theProxyMesh ) // from sortedBaseNN remove nodes not shared by faces of faceSubMesh
2336 const SMDS_MeshNode* n1 = (++sortedBaseNN.begin())->second;
2337 const SMDS_MeshNode* n2 = (++sortedBaseNN.rbegin())->second;
2338 bool allNodesAreProxy = ( n1 != theProxyMesh->GetProxyNode( n1 ) &&
2339 n2 != theProxyMesh->GetProxyNode( n2 ));
2340 if ( allNodesAreProxy )
2341 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2342 u_n->second = theProxyMesh->GetProxyNode( u_n->second );
2344 if ( u_n = sortedBaseNN.begin(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2346 while ( ++u_n != sortedBaseNN.end() && !isNodeInSubMesh( u_n->second, faceSubMesh ));
2347 sortedBaseNN.erase( sortedBaseNN.begin(), u_n );
2349 if ( !sortedBaseNN.empty() )
2350 if ( u_n = --sortedBaseNN.end(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2352 while ( u_n != sortedBaseNN.begin() && !isNodeInSubMesh( (--u_n)->second, faceSubMesh ));
2353 sortedBaseNN.erase( ++u_n, sortedBaseNN.end() );
2355 if ( sortedBaseNN.empty() ) continue;
2359 BRep_Tool::Range( *edge, f, l );
2360 if ( edge->Orientation() == TopAbs_REVERSED ) std::swap( f, l );
2361 const double coeff = 1. / ( l - f ) * length[iE] / fullLen;
2362 const double prevPar = theParam2ColumnMap.empty() ? 0 : theParam2ColumnMap.rbegin()->first;
2363 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2365 double par = prevPar + coeff * ( u_n->first - f );
2366 TParam2ColumnMap::iterator u2nn =
2367 theParam2ColumnMap.insert( theParam2ColumnMap.end(), make_pair( par, TNodeColumn()));
2368 u2nn->second.push_back( u_n->second );
2371 if ( theParam2ColumnMap.size() < 2 )
2376 int prevNbRows = theParam2ColumnMap.begin()->second.size(); // current, at least 1 here
2377 int expectedNbRows = faceSubMesh->NbElements() / ( theParam2ColumnMap.size()-1 ); // to be added
2379 // fill theParam2ColumnMap column by column by passing from nodes on
2380 // theBaseEdge up via mesh faces on theFace
2382 TParam2ColumnMap::iterator par_nVec_1, par_nVec_2;
2383 par_nVec_2 = theParam2ColumnMap.begin();
2384 par_nVec_1 = par_nVec_2++;
2385 TIDSortedElemSet emptySet, avoidSet;
2386 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
2388 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
2389 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
2390 nCol1.resize( prevNbRows + expectedNbRows );
2391 nCol2.resize( prevNbRows + expectedNbRows );
2393 int i1, i2, foundNbRows = 0;
2394 const SMDS_MeshNode *n1 = nCol1[ prevNbRows-1 ];
2395 const SMDS_MeshNode *n2 = nCol2[ prevNbRows-1 ];
2396 // find face sharing node n1 and n2 and belonging to faceSubMesh
2397 while ( const SMDS_MeshElement* face =
2398 SMESH_MeshAlgos::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
2400 if ( faceSubMesh->Contains( face ))
2402 int nbNodes = face->NbCornerNodes();
2405 if ( foundNbRows + 1 > expectedNbRows )
2407 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
2408 n2 = face->GetNode( (i1+2) % 4 );
2409 nCol1[ prevNbRows + foundNbRows] = n1;
2410 nCol2[ prevNbRows + foundNbRows] = n2;
2413 avoidSet.insert( face );
2415 if ( foundNbRows != expectedNbRows )
2419 return ( theParam2ColumnMap.size() > 1 &&
2420 theParam2ColumnMap.begin()->second.size() == prevNbRows + expectedNbRows );
2425 //================================================================================
2427 * \brief Return true if a node is at a corner of a 2D structured mesh of FACE
2429 //================================================================================
2431 bool isCornerOfStructure( const SMDS_MeshNode* n,
2432 const SMESHDS_SubMesh* faceSM,
2433 SMESH_MesherHelper& faceAnalyser )
2435 int nbFacesInSM = 0;
2437 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2438 while ( fIt->more() )
2439 nbFacesInSM += faceSM->Contains( fIt->next() );
2441 if ( nbFacesInSM == 1 )
2444 if ( nbFacesInSM == 2 && n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
2446 return faceAnalyser.IsRealSeam( n->getshapeId() );
2452 //=======================================================================
2453 //function : IsStructured
2454 //purpose : Return true if 2D mesh on FACE is structured
2455 //=======================================================================
2457 bool SMESH_MesherHelper::IsStructured( SMESH_subMesh* faceSM )
2459 SMESHDS_SubMesh* fSM = faceSM->GetSubMeshDS();
2460 if ( !fSM || fSM->NbElements() == 0 )
2463 list< TopoDS_Edge > edges;
2464 list< int > nbEdgesInWires;
2465 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( faceSM->GetSubShape() ),
2466 edges, nbEdgesInWires );
2467 if ( nbWires != 1 /*|| nbEdgesInWires.front() != 4*/ ) // allow composite sides
2470 // algo: find corners of a structure and then analyze nb of faces and
2471 // length of structure sides
2473 SMESHDS_Mesh* meshDS = faceSM->GetFather()->GetMeshDS();
2474 SMESH_MesherHelper faceAnalyser( *faceSM->GetFather() );
2475 faceAnalyser.SetSubShape( faceSM->GetSubShape() );
2477 // rotate edges to get the first node being at corner
2478 // (in principle it's not necessary but so far none SALOME algo can make
2479 // such a structured mesh that all corner nodes are not on VERTEXes)
2480 bool isCorner = false;
2481 int nbRemainEdges = nbEdgesInWires.front();
2483 TopoDS_Vertex V = IthVertex( 0, edges.front() );
2484 isCorner = isCornerOfStructure( SMESH_Algo::VertexNode( V, meshDS ),
2487 edges.splice( edges.end(), edges, edges.begin() );
2491 while ( !isCorner && nbRemainEdges > 0 );
2496 // get all nodes from EDGEs
2497 list< const SMDS_MeshNode* > nodes;
2498 list< TopoDS_Edge >::iterator edge = edges.begin();
2499 for ( ; edge != edges.end(); ++edge )
2501 map< double, const SMDS_MeshNode* > u2Nodes;
2502 if ( !SMESH_Algo::GetSortedNodesOnEdge( meshDS, *edge,
2503 /*skipMedium=*/true, u2Nodes ))
2506 list< const SMDS_MeshNode* > edgeNodes;
2507 map< double, const SMDS_MeshNode* >::iterator u2n = u2Nodes.begin();
2508 for ( ; u2n != u2Nodes.end(); ++u2n )
2509 edgeNodes.push_back( u2n->second );
2510 if ( edge->Orientation() == TopAbs_REVERSED )
2511 edgeNodes.reverse();
2513 if ( !nodes.empty() && nodes.back() == edgeNodes.front() )
2514 edgeNodes.pop_front();
2515 nodes.splice( nodes.end(), edgeNodes, edgeNodes.begin(), edgeNodes.end() );
2518 // get length of structured sides
2519 vector<int> nbEdgesInSide;
2521 list< const SMDS_MeshNode* >::iterator n = ++nodes.begin();
2522 for ( ; n != nodes.end(); ++n )
2525 if ( isCornerOfStructure( *n, fSM, faceAnalyser )) {
2526 nbEdgesInSide.push_back( nbEdges );
2532 if ( nbEdgesInSide.size() != 4 )
2534 if ( nbEdgesInSide[0] != nbEdgesInSide[2] )
2536 if ( nbEdgesInSide[1] != nbEdgesInSide[3] )
2538 if ( nbEdgesInSide[0] * nbEdgesInSide[1] != fSM->NbElements() )
2544 //================================================================================
2546 * \brief Find out elements orientation on a geometrical face
2547 * \param theFace - The face correctly oriented in the shape being meshed
2548 * \retval bool - true if the face normal and the normal of first element
2549 * in the correspoding submesh point in different directions
2551 //================================================================================
2553 bool SMESH_MesherHelper::IsReversedSubMesh (const TopoDS_Face& theFace)
2555 if ( theFace.IsNull() )
2558 // find out orientation of a meshed face
2559 int faceID = GetMeshDS()->ShapeToIndex( theFace );
2560 TopoDS_Shape aMeshedFace = GetMeshDS()->IndexToShape( faceID );
2561 bool isReversed = ( theFace.Orientation() != aMeshedFace.Orientation() );
2563 const SMESHDS_SubMesh * aSubMeshDSFace = GetMeshDS()->MeshElements( faceID );
2564 if ( !aSubMeshDSFace )
2567 // find an element with a good normal
2569 bool normalOK = false;
2571 SMDS_ElemIteratorPtr iteratorElem = aSubMeshDSFace->GetElements();
2572 while ( !normalOK && iteratorElem->more() ) // loop on elements on theFace
2574 const SMDS_MeshElement* elem = iteratorElem->next();
2575 if ( elem && elem->NbCornerNodes() > 2 )
2577 SMESH_TNodeXYZ nPnt[3];
2578 SMDS_ElemIteratorPtr nodesIt = elem->nodesIterator();
2579 int iNodeOnFace = 0, iPosDim = SMDS_TOP_VERTEX;
2580 for ( int iN = 0; nodesIt->more() && iN < 3; ++iN) // loop on nodes
2582 nPnt[ iN ] = nodesIt->next();
2583 if ( nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition() > iPosDim )
2586 iPosDim = nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition();
2590 gp_Vec v01( nPnt[0], nPnt[1] ), v02( nPnt[0], nPnt[2] );
2591 if ( v01.SquareMagnitude() > RealSmall() &&
2592 v02.SquareMagnitude() > RealSmall() )
2595 if (( normalOK = ( Ne.SquareMagnitude() > RealSmall() )))
2596 uv = GetNodeUV( theFace, nPnt[iNodeOnFace]._node, 0, &normalOK );
2603 // face normal at node position
2604 TopLoc_Location loc;
2605 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
2606 // if ( surf.IsNull() || surf->Continuity() < GeomAbs_C1 )
2607 // some surfaces not detected as GeomAbs_C1 are nevertheless correct for meshing
2608 if ( surf.IsNull() || surf->Continuity() < GeomAbs_C0 )
2611 MESSAGE("surf->Continuity() < GeomAbs_C1 " << (surf->Continuity() < GeomAbs_C1));
2614 gp_Vec d1u, d1v; gp_Pnt p;
2615 surf->D1( uv.X(), uv.Y(), p, d1u, d1v );
2616 gp_Vec Nf = (d1u ^ d1v).Transformed( loc );
2618 if ( theFace.Orientation() == TopAbs_REVERSED )
2621 return Ne * Nf < 0.;
2624 //=======================================================================
2626 //purpose : Count nb of sub-shapes
2627 //=======================================================================
2629 int SMESH_MesherHelper::Count(const TopoDS_Shape& shape,
2630 const TopAbs_ShapeEnum type,
2631 const bool ignoreSame)
2634 TopTools_IndexedMapOfShape map;
2635 TopExp::MapShapes( shape, type, map );
2636 return map.Extent();
2640 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2646 //=======================================================================
2647 //function : NbAncestors
2648 //purpose : Return number of unique ancestors of the shape
2649 //=======================================================================
2651 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
2652 const SMESH_Mesh& mesh,
2653 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
2655 TopTools_MapOfShape ancestors;
2656 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
2657 for ( ; ansIt.More(); ansIt.Next() ) {
2658 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
2659 ancestors.Add( ansIt.Value() );
2661 return ancestors.Extent();
2664 //=======================================================================
2665 //function : GetSubShapeOri
2666 //purpose : Return orientation of sub-shape in the main shape
2667 //=======================================================================
2669 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
2670 const TopoDS_Shape& subShape)
2672 TopAbs_Orientation ori = TopAbs_Orientation(-1);
2673 if ( !shape.IsNull() && !subShape.IsNull() )
2675 TopExp_Explorer e( shape, subShape.ShapeType() );
2676 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
2677 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
2678 for ( ; e.More(); e.Next())
2679 if ( subShape.IsSame( e.Current() ))
2682 ori = e.Current().Orientation();
2687 //=======================================================================
2688 //function : IsSubShape
2690 //=======================================================================
2692 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
2693 const TopoDS_Shape& mainShape )
2695 if ( !shape.IsNull() && !mainShape.IsNull() )
2697 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
2700 if ( shape.IsSame( exp.Current() ))
2703 SCRUTE((shape.IsNull()));
2704 SCRUTE((mainShape.IsNull()));
2708 //=======================================================================
2709 //function : IsSubShape
2711 //=======================================================================
2713 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
2715 if ( shape.IsNull() || !aMesh )
2718 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
2720 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
2723 //================================================================================
2725 * \brief Return maximal tolerance of shape
2727 //================================================================================
2729 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
2731 double tol = Precision::Confusion();
2732 TopExp_Explorer exp;
2733 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
2734 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
2735 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
2736 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
2737 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
2738 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
2743 //================================================================================
2745 * \brief Return an angle between two EDGEs sharing a common VERTEX with reference
2746 * of the FACE normal
2747 * \return double - the angle (between -Pi and Pi), negative if the angle is concave,
2748 * 1e100 in case of failure
2749 * \waring Care about order of the EDGEs and their orientation to be as they are
2750 * within the FACE! Don't pass degenerated EDGEs neither!
2752 //================================================================================
2754 double SMESH_MesherHelper::GetAngle( const TopoDS_Edge & theE1,
2755 const TopoDS_Edge & theE2,
2756 const TopoDS_Face & theFace,
2757 const TopoDS_Vertex & theCommonV,
2758 gp_Vec* theFaceNormal)
2760 double angle = 1e100;
2764 Handle(Geom_Curve) c1 = BRep_Tool::Curve( theE1, f,l );
2765 Handle(Geom_Curve) c2 = BRep_Tool::Curve( theE2, f,l );
2766 Handle(Geom2d_Curve) c2d1 = BRep_Tool::CurveOnSurface( theE1, theFace, f,l );
2767 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace );
2768 double p1 = BRep_Tool::Parameter( theCommonV, theE1 );
2769 double p2 = BRep_Tool::Parameter( theCommonV, theE2 );
2770 if ( c1.IsNull() || c2.IsNull() )
2772 gp_XY uv = c2d1->Value( p1 ).XY();
2773 gp_Vec du, dv; gp_Pnt p;
2774 surf->D1( uv.X(), uv.Y(), p, du, dv );
2775 gp_Vec vec1, vec2, vecRef = du ^ dv;
2778 while ( vecRef.SquareMagnitude() < 1e-25 )
2780 double dp = ( l - f ) / 1000.;
2781 p1tmp += dp * (( Abs( p1 - f ) > Abs( p1 - l )) ? -1. : +1.);
2782 uv = c2d1->Value( p1tmp ).XY();
2783 surf->D1( uv.X(), uv.Y(), p, du, dv );
2785 if ( ++nbLoops > 10 )
2788 cout << "SMESH_MesherHelper::GetAngle(): Captured in a sigularity" << endl;
2793 if ( theFace.Orientation() == TopAbs_REVERSED )
2795 if ( theFaceNormal ) *theFaceNormal = vecRef;
2797 c1->D1( p1, p, vec1 );
2798 c2->D1( p2, p, vec2 );
2799 // TopoDS_Face F = theFace;
2800 // if ( F.Orientation() == TopAbs_INTERNAL )
2801 // F.Orientation( TopAbs_FORWARD );
2802 if ( theE1.Orientation() /*GetSubShapeOri( F, theE1 )*/ == TopAbs_REVERSED )
2804 if ( theE2.Orientation() /*GetSubShapeOri( F, theE2 )*/ == TopAbs_REVERSED )
2806 angle = vec1.AngleWithRef( vec2, vecRef );
2808 if ( Abs ( angle ) >= 0.99 * M_PI )
2810 BRep_Tool::Range( theE1, f, l );
2811 p1 += 1e-7 * ( p1-f < l-p1 ? +1. : -1. );
2812 c1->D1( p1, p, vec1 );
2813 if ( theE1.Orientation() == TopAbs_REVERSED )
2815 BRep_Tool::Range( theE2, f, l );
2816 p2 += 1e-7 * ( p2-f < l-p2 ? +1. : -1. );
2817 c2->D1( p2, p, vec2 );
2818 if ( theE2.Orientation() == TopAbs_REVERSED )
2820 angle = vec1.AngleWithRef( vec2, vecRef );
2829 //================================================================================
2831 * \brief Check if the first and last vertices of an edge are the same
2832 * \param anEdge - the edge to check
2833 * \retval bool - true if same
2835 //================================================================================
2837 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
2839 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2840 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
2841 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
2844 //================================================================================
2846 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
2847 * in the case of INTERNAL edge
2849 //================================================================================
2851 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
2855 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2856 anEdge.Orientation( TopAbs_FORWARD );
2858 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
2859 TopoDS_Iterator vIt( anEdge, CumOri );
2860 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
2863 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
2866 //================================================================================
2868 * \brief Return type of shape contained in a group
2869 * \param group - a shape of type TopAbs_COMPOUND
2870 * \param avoidCompound - not to return TopAbs_COMPOUND
2872 //================================================================================
2874 TopAbs_ShapeEnum SMESH_MesherHelper::GetGroupType(const TopoDS_Shape& group,
2875 const bool avoidCompound)
2877 if ( !group.IsNull() )
2879 if ( group.ShapeType() != TopAbs_COMPOUND )
2880 return group.ShapeType();
2882 // iterate on a compound
2883 TopoDS_Iterator it( group );
2885 return avoidCompound ? GetGroupType( it.Value() ) : it.Value().ShapeType();
2887 return TopAbs_SHAPE;
2890 //=======================================================================
2891 //function : IsQuadraticMesh
2892 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
2893 // quadratic elements will be created.
2894 // Used then generated 3D mesh without geometry.
2895 //=======================================================================
2897 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
2899 int NbAllEdgsAndFaces=0;
2900 int NbQuadFacesAndEdgs=0;
2901 int NbFacesAndEdges=0;
2902 //All faces and edges
2903 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
2904 if ( NbAllEdgsAndFaces == 0 )
2905 return SMESH_MesherHelper::LINEAR;
2907 //Quadratic faces and edges
2908 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
2910 //Linear faces and edges
2911 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
2913 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
2915 return SMESH_MesherHelper::QUADRATIC;
2917 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
2919 return SMESH_MesherHelper::LINEAR;
2922 //Mesh with both type of elements
2923 return SMESH_MesherHelper::COMP;
2926 //=======================================================================
2927 //function : GetOtherParam
2928 //purpose : Return an alternative parameter for a node on seam
2929 //=======================================================================
2931 double SMESH_MesherHelper::GetOtherParam(const double param) const
2933 int i = myParIndex & U_periodic ? 0 : 1;
2934 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
2939 //=======================================================================
2941 * \brief Iterator on ancestors of the given type
2943 //=======================================================================
2945 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
2947 TopTools_ListIteratorOfListOfShape _ancIter;
2948 TopAbs_ShapeEnum _type;
2949 TopTools_MapOfShape _encountered;
2950 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
2951 : _ancIter( ancestors ), _type( type )
2953 if ( _ancIter.More() ) {
2954 if ( _ancIter.Value().ShapeType() != _type ) next();
2955 else _encountered.Add( _ancIter.Value() );
2960 return _ancIter.More();
2962 virtual const TopoDS_Shape* next()
2964 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
2965 if ( _ancIter.More() )
2966 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
2967 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
2975 //=======================================================================
2977 * \brief Return iterator on ancestors of the given type
2979 //=======================================================================
2981 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
2982 const SMESH_Mesh& mesh,
2983 TopAbs_ShapeEnum ancestorType)
2985 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
2988 //=======================================================================
2989 //function : GetCommonAncestor
2990 //purpose : Find a common ancestors of two shapes of the given type
2991 //=======================================================================
2993 TopoDS_Shape SMESH_MesherHelper::GetCommonAncestor(const TopoDS_Shape& shape1,
2994 const TopoDS_Shape& shape2,
2995 const SMESH_Mesh& mesh,
2996 TopAbs_ShapeEnum ancestorType)
2998 TopoDS_Shape commonAnc;
2999 if ( !shape1.IsNull() && !shape2.IsNull() )
3001 PShapeIteratorPtr ancIt = GetAncestors( shape1, mesh, ancestorType );
3002 while ( const TopoDS_Shape* anc = ancIt->next() )
3003 if ( IsSubShape( shape2, *anc ))
3012 //#include <Perf_Meter.hxx>
3014 //=======================================================================
3015 namespace { // Structures used by FixQuadraticElements()
3016 //=======================================================================
3018 #define __DMP__(txt) \
3020 #define MSG(txt) __DMP__(txt<<endl)
3021 #define MSGBEG(txt) __DMP__(txt)
3023 //const double straightTol2 = 1e-33; // to detect straing links
3024 bool isStraightLink(double linkLen2, double middleNodeMove2)
3026 // straight if <node move> < 1/15 * <link length>
3027 return middleNodeMove2 < 1/15./15. * linkLen2;
3031 // ---------------------------------------
3033 * \brief Quadratic link knowing its faces
3035 struct QLink: public SMESH_TLink
3037 const SMDS_MeshNode* _mediumNode;
3038 mutable vector<const QFace* > _faces;
3039 mutable gp_Vec _nodeMove;
3040 mutable int _nbMoves;
3042 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
3043 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
3045 //if ( MediumPos() != SMDS_TOP_3DSPACE )
3046 _nodeMove = MediumPnt() - MiddlePnt();
3048 void SetContinuesFaces() const;
3049 const QFace* GetContinuesFace( const QFace* face ) const;
3050 bool OnBoundary() const;
3051 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
3052 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
3054 SMDS_TypeOfPosition MediumPos() const
3055 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
3056 SMDS_TypeOfPosition EndPos(bool isSecond) const
3057 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
3058 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
3059 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
3061 void Move(const gp_Vec& move, bool sum=false) const
3062 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
3063 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
3064 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
3065 bool IsStraight() const
3066 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
3067 _nodeMove.SquareMagnitude());
3069 bool operator<(const QLink& other) const {
3070 return (node1()->GetID() == other.node1()->GetID() ?
3071 node2()->GetID() < other.node2()->GetID() :
3072 node1()->GetID() < other.node1()->GetID());
3074 // struct PtrComparator {
3075 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
3078 // ---------------------------------------------------------
3080 * \brief Link in the chain of links; it connects two faces
3084 const QLink* _qlink;
3085 mutable const QFace* _qfaces[2];
3087 TChainLink(const QLink* qlink=0):_qlink(qlink) {
3088 _qfaces[0] = _qfaces[1] = 0;
3090 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
3092 bool IsBoundary() const { return !_qfaces[1]; }
3094 void RemoveFace( const QFace* face ) const
3095 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
3097 const QFace* NextFace( const QFace* f ) const
3098 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
3100 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
3101 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
3103 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
3105 operator bool() const { return (_qlink); }
3107 const QLink* operator->() const { return _qlink; }
3109 gp_Vec Normal() const;
3111 bool IsStraight() const;
3113 // --------------------------------------------------------------------
3114 typedef list< TChainLink > TChain;
3115 typedef set < TChainLink > TLinkSet;
3116 typedef TLinkSet::const_iterator TLinkInSet;
3118 const int theFirstStep = 5;
3120 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
3121 // --------------------------------------------------------------------
3123 * \brief Quadratic face shared by two volumes and bound by QLinks
3125 struct QFace: public TIDSortedNodeSet
3127 mutable const SMDS_MeshElement* _volumes[2];
3128 mutable vector< const QLink* > _sides;
3129 mutable bool _sideIsAdded[4]; // added in chain of links
3132 mutable const SMDS_MeshElement* _face;
3135 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
3137 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
3139 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
3141 void AddSelfToLinks() const {
3142 for ( int i = 0; i < _sides.size(); ++i )
3143 _sides[i]->_faces.push_back( this );
3145 int LinkIndex( const QLink* side ) const {
3146 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
3149 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
3151 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
3153 int i = LinkIndex( link._qlink );
3154 if ( i < 0 ) return true;
3155 _sideIsAdded[i] = true;
3156 link.SetFace( this );
3157 // continue from opposite link
3158 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
3160 bool IsBoundary() const { return !_volumes[1]; }
3162 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
3164 bool IsSpoiled(const QLink* bentLink ) const;
3166 TLinkInSet GetBoundaryLink( const TLinkSet& links,
3167 const TChainLink& avoidLink,
3168 TLinkInSet * notBoundaryLink = 0,
3169 const SMDS_MeshNode* nodeToContain = 0,
3170 bool * isAdjacentUsed = 0,
3171 int nbRecursionsLeft = -1) const;
3173 TLinkInSet GetLinkByNode( const TLinkSet& links,
3174 const TChainLink& avoidLink,
3175 const SMDS_MeshNode* nodeToContain) const;
3177 const SMDS_MeshNode* GetNodeInFace() const {
3178 for ( int iL = 0; iL < _sides.size(); ++iL )
3179 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
3183 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
3185 double MoveByBoundary( const TChainLink& theLink,
3186 const gp_Vec& theRefVec,
3187 const TLinkSet& theLinks,
3188 SMESH_MesherHelper* theFaceHelper=0,
3189 const double thePrevLen=0,
3190 const int theStep=theFirstStep,
3191 gp_Vec* theLinkNorm=0,
3192 double theSign=1.0) const;
3195 //================================================================================
3197 * \brief Dump QLink and QFace
3199 ostream& operator << (ostream& out, const QLink& l)
3201 out <<"QLink nodes: "
3202 << l.node1()->GetID() << " - "
3203 << l._mediumNode->GetID() << " - "
3204 << l.node2()->GetID() << endl;
3207 ostream& operator << (ostream& out, const QFace& f)
3209 out <<"QFace nodes: "/*<< &f << " "*/;
3210 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
3211 out << (*n)->GetID() << " ";
3212 out << " \tvolumes: "
3213 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
3214 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
3215 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
3219 //================================================================================
3221 * \brief Construct QFace from QLinks
3223 //================================================================================
3225 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
3227 _volumes[0] = _volumes[1] = 0;
3229 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
3230 _normal.SetCoord(0,0,0);
3231 for ( int i = 1; i < _sides.size(); ++i ) {
3232 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
3233 insert( l1->node1() ); insert( l1->node2() );
3235 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
3236 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
3237 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
3241 double normSqSize = _normal.SquareMagnitude();
3242 if ( normSqSize > numeric_limits<double>::min() )
3243 _normal /= sqrt( normSqSize );
3245 _normal.SetCoord(1e-33,0,0);
3251 //================================================================================
3253 * \brief Make up a chain of links
3254 * \param iSide - link to add first
3255 * \param chain - chain to fill in
3256 * \param pos - postion of medium nodes the links should have
3257 * \param error - out, specifies what is wrong
3258 * \retval bool - false if valid chain can't be built; "valid" means that links
3259 * of the chain belongs to rectangles bounding hexahedrons
3261 //================================================================================
3263 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
3265 if ( iSide >= _sides.size() ) // wrong argument iSide
3267 if ( _sideIsAdded[ iSide ]) // already in chain
3270 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
3273 list< const QFace* > faces( 1, this );
3274 while ( !faces.empty() ) {
3275 const QFace* face = faces.front();
3276 for ( int i = 0; i < face->_sides.size(); ++i ) {
3277 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
3278 face->_sideIsAdded[i] = true;
3279 // find a face side in the chain
3280 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
3281 // TChain::iterator chLink = chain.begin();
3282 // for ( ; chLink != chain.end(); ++chLink )
3283 // if ( chLink->_qlink == face->_sides[i] )
3285 // if ( chLink == chain.end() )
3286 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
3287 // add a face to a chained link and put a continues face in the queue
3288 chLink->SetFace( face );
3289 if ( face->_sides[i]->MediumPos() == pos )
3290 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
3291 if ( contFace->_sides.size() == 3 )
3292 faces.push_back( contFace );
3297 if ( error < ERR_TRI )
3299 chain.insert( chain.end(), links.begin(),links.end() );
3302 _sideIsAdded[iSide] = true; // not to add this link to chain again
3303 const QLink* link = _sides[iSide];
3307 // add link into chain
3308 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
3309 chLink->SetFace( this );
3312 // propagate from a quadrangle to neighbour faces
3313 if ( link->MediumPos() >= pos ) {
3314 int nbLinkFaces = link->_faces.size();
3315 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
3316 // hexahedral mesh or boundary quadrangles - goto a continous face
3317 if ( const QFace* f = link->GetContinuesFace( this ))
3318 if ( f->_sides.size() == 4 )
3319 return f->GetLinkChain( *chLink, chain, pos, error );
3322 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
3323 for ( int i = 0; i < nbLinkFaces; ++i )
3324 if ( link->_faces[i] )
3325 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
3326 if ( error < ERR_PRISM )
3334 //================================================================================
3336 * \brief Return a boundary link of the triangle face
3337 * \param links - set of all links
3338 * \param avoidLink - link not to return
3339 * \param notBoundaryLink - out, neither the returned link nor avoidLink
3340 * \param nodeToContain - node the returned link must contain; if provided, search
3341 * also performed on adjacent faces
3342 * \param isAdjacentUsed - returns true if link is found in adjacent faces
3343 * \param nbRecursionsLeft - to limit recursion
3345 //================================================================================
3347 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
3348 const TChainLink& avoidLink,
3349 TLinkInSet * notBoundaryLink,
3350 const SMDS_MeshNode* nodeToContain,
3351 bool * isAdjacentUsed,
3352 int nbRecursionsLeft) const
3354 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
3356 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
3357 TFaceLinkList adjacentFaces;
3359 for ( int iL = 0; iL < _sides.size(); ++iL )
3361 if ( avoidLink._qlink == _sides[iL] )
3363 TLinkInSet link = links.find( _sides[iL] );
3364 if ( link == linksEnd ) continue;
3365 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
3366 continue; // We work on faces here, don't go inside a solid
3369 if ( link->IsBoundary() ) {
3370 if ( !nodeToContain ||
3371 (*link)->node1() == nodeToContain ||
3372 (*link)->node2() == nodeToContain )
3374 boundaryLink = link;
3375 if ( !notBoundaryLink ) break;
3378 else if ( notBoundaryLink ) {
3379 *notBoundaryLink = link;
3380 if ( boundaryLink != linksEnd ) break;
3383 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
3384 if ( const QFace* adj = link->NextFace( this ))
3385 if ( adj->Contains( nodeToContain ))
3386 adjacentFaces.push_back( make_pair( adj, link ));
3389 if ( isAdjacentUsed ) *isAdjacentUsed = false;
3390 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
3392 if ( nbRecursionsLeft < 0 )
3393 nbRecursionsLeft = nodeToContain->NbInverseElements();
3394 TFaceLinkList::iterator adj = adjacentFaces.begin();
3395 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
3396 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
3397 isAdjacentUsed, nbRecursionsLeft-1);
3398 if ( isAdjacentUsed ) *isAdjacentUsed = true;
3400 return boundaryLink;
3402 //================================================================================
3404 * \brief Return a link ending at the given node but not avoidLink
3406 //================================================================================
3408 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
3409 const TChainLink& avoidLink,
3410 const SMDS_MeshNode* nodeToContain) const
3412 for ( int i = 0; i < _sides.size(); ++i )
3413 if ( avoidLink._qlink != _sides[i] &&
3414 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
3415 return links.find( _sides[ i ]);
3419 //================================================================================
3421 * \brief Return normal to the i-th side pointing outside the face
3423 //================================================================================
3425 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
3427 gp_Vec norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3428 gp_XYZ pIn = ( _sides[ (i+1)%3 ]->MiddlePnt() +
3429 _sides[ (i+2)%3 ]->MiddlePnt() ) / 2.;
3430 gp_Vec vecOut = ( _sides[i]->MiddlePnt() - pIn );
3432 if ( norm * vecOut < 0 )
3434 double mag2 = norm.SquareMagnitude();
3435 if ( mag2 > numeric_limits<double>::min() )
3436 norm /= sqrt( mag2 );
3439 //================================================================================
3441 * \brief Move medium node of theLink according to its distance from boundary
3442 * \param theLink - link to fix
3443 * \param theRefVec - movement of boundary
3444 * \param theLinks - all adjacent links of continous triangles
3445 * \param theFaceHelper - helper is not used so far
3446 * \param thePrevLen - distance from the boundary
3447 * \param theStep - number of steps till movement propagation limit
3448 * \param theLinkNorm - out normal to theLink
3449 * \param theSign - 1 or -1 depending on movement of boundary
3450 * \retval double - distance from boundary to propagation limit or other boundary
3452 //================================================================================
3454 double QFace::MoveByBoundary( const TChainLink& theLink,
3455 const gp_Vec& theRefVec,
3456 const TLinkSet& theLinks,
3457 SMESH_MesherHelper* theFaceHelper,
3458 const double thePrevLen,
3460 gp_Vec* theLinkNorm,
3461 double theSign) const
3464 return thePrevLen; // propagation limit reached
3466 int iL; // index of theLink
3467 for ( iL = 0; iL < _sides.size(); ++iL )
3468 if ( theLink._qlink == _sides[ iL ])
3471 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
3472 <<" thePrevLen " << thePrevLen);
3473 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
3475 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
3476 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
3477 if ( theStep == theFirstStep )
3478 theSign = refProj < 0. ? -1. : 1.;
3479 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
3480 return thePrevLen; // to propagate movement forward only, not in side dir or backward
3482 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
3483 TLinkInSet link1 = theLinks.find( _sides[iL1] );
3484 TLinkInSet link2 = theLinks.find( _sides[iL2] );
3486 const QFace *f1 = 0, *f2 = 0; // adjacent faces
3487 bool isBndLink1 = true, isBndLink2 = true;
3488 if ( link1 != theLinks.end() && link2 != theLinks.end() )
3490 f1 = link1->NextFace( this );
3491 f2 = link2->NextFace( this );
3493 isBndLink1 = ( theLink->MediumPos() > (*link1)->MediumPos() );
3494 isBndLink2 = ( theLink->MediumPos() > (*link2)->MediumPos() );
3495 if ( theStep == theFirstStep ) // (issue 22541) quad-dominant mesh
3497 if ( !isBndLink1 && !f1 )
3498 f1 = (*link1)->GetContinuesFace( this ); // get a quadrangle face
3499 if ( !isBndLink2 && !f2 )
3500 f2 = (*link2)->GetContinuesFace( this );
3503 else if ( _sides.size() < 4 )
3506 // propagate to adjacent faces till limit step or boundary
3507 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
3508 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
3509 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
3510 gp_Vec linkDir2(0,0,0);
3513 if ( f1 && !isBndLink1 )
3514 len1 = f1->MoveByBoundary
3515 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
3517 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
3519 MSG( " --------------- EXCEPTION");
3524 if ( f2 && !isBndLink2 )
3525 len2 = f2->MoveByBoundary
3526 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
3528 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
3530 MSG( " --------------- EXCEPTION");
3535 if ( theStep != theFirstStep )
3537 // choose chain length by direction of propagation most codirected with theRefVec
3538 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
3539 fullLen = choose1 ? len1 : len2;
3540 double r = thePrevLen / fullLen;
3542 gp_Vec move = linkNorm * refProj * ( 1 - r );
3543 theLink->Move( move, true );
3545 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
3546 " by " << refProj * ( 1 - r ) << " following " <<
3547 (choose1 ? *link1->_qlink : *link2->_qlink)); // warning: link1 can be invalid
3549 if ( theLinkNorm ) *theLinkNorm = linkNorm;
3554 //================================================================================
3556 * \brief Checks if the face is distorted due to bentLink
3558 //================================================================================
3560 bool QFace::IsSpoiled(const QLink* bentLink ) const
3562 // code is valid for convex faces only
3564 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
3565 gc += XYZ( *n ) / size();
3566 for (unsigned i = 0; i < _sides.size(); ++i )
3568 if ( _sides[i] == bentLink ) continue;
3569 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3570 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
3571 if ( linkNorm * vecOut < 0 )
3573 double mag2 = linkNorm.SquareMagnitude();
3574 if ( mag2 > numeric_limits<double>::min() )
3575 linkNorm /= sqrt( mag2 );
3576 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
3577 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
3578 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
3585 //================================================================================
3587 * \brief Find pairs of continues faces
3589 //================================================================================
3591 void QLink::SetContinuesFaces() const
3593 // x0 x - QLink, [-|] - QFace, v - volume
3595 // | Between _faces of link x2 two vertical faces are continues
3596 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
3597 // | to _faces[0] and _faces[1] and horizontal faces to
3598 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
3601 if ( _faces.empty() )
3603 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
3604 if ( _faces[0]->IsBoundary() )
3605 iBoundary[ nbBoundary++ ] = 0;
3606 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
3608 // look for a face bounding none of volumes bound by _faces[0]
3609 bool sameVol = false;
3610 int nbVol = _faces[iF]->NbVolumes();
3611 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
3612 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
3613 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
3616 if ( _faces[iF]->IsBoundary() )
3617 iBoundary[ nbBoundary++ ] = iF;
3619 // Set continues faces: arrange _faces to have
3620 // _faces[0] continues to _faces[1]
3621 // _faces[2] continues to _faces[3]
3622 if ( nbBoundary == 2 ) // bnd faces are continues
3624 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
3626 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
3627 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
3630 else if ( iFaceCont > 0 ) // continues faces found
3632 if ( iFaceCont != 1 )
3633 std::swap( _faces[1], _faces[iFaceCont] );
3635 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
3637 _faces.insert( ++_faces.begin(), (QFace*) 0 );
3640 //================================================================================
3642 * \brief Return a face continues to the given one
3644 //================================================================================
3646 const QFace* QLink::GetContinuesFace( const QFace* face ) const
3648 for ( int i = 0; i < _faces.size(); ++i ) {
3649 if ( _faces[i] == face ) {
3650 int iF = i < 2 ? 1-i : 5-i;
3651 return iF < _faces.size() ? _faces[iF] : 0;
3656 //================================================================================
3658 * \brief True if link is on mesh boundary
3660 //================================================================================
3662 bool QLink::OnBoundary() const
3664 for ( int i = 0; i < _faces.size(); ++i )
3665 if (_faces[i] && _faces[i]->IsBoundary()) return true;
3668 //================================================================================
3670 * \brief Return normal of link of the chain
3672 //================================================================================
3674 gp_Vec TChainLink::Normal() const {
3676 if (_qfaces[0]) norm = _qfaces[0]->_normal;
3677 if (_qfaces[1]) norm += _qfaces[1]->_normal;
3680 //================================================================================
3682 * \brief Test link curvature taking into account size of faces
3684 //================================================================================
3686 bool TChainLink::IsStraight() const
3688 bool isStraight = _qlink->IsStraight();
3689 if ( isStraight && _qfaces[0] && !_qfaces[1] )
3691 int i = _qfaces[0]->LinkIndex( _qlink );
3692 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
3693 gp_XYZ mid1 = _qlink->MiddlePnt();
3694 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
3695 double faceSize2 = (mid1-mid2).SquareModulus();
3696 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
3701 //================================================================================
3703 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
3705 //================================================================================
3707 void fixPrism( TChain& allLinks )
3709 // separate boundary links from internal ones
3710 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
3711 QLinkSet interLinks, bndLinks1, bndLink2;
3713 bool isCurved = false;
3714 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3715 if ( (*lnk)->OnBoundary() )
3716 bndLinks1.insert( lnk->_qlink );
3718 interLinks.insert( lnk->_qlink );
3719 isCurved = isCurved || !lnk->IsStraight();
3722 return; // no need to move
3724 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
3726 while ( !interLinks.empty() && !curBndLinks->empty() )
3728 // propagate movement from boundary links to connected internal links
3729 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
3730 for ( ; bnd != bndEnd; ++bnd )
3732 const QLink* bndLink = *bnd;
3733 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
3735 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
3736 if ( !face ) continue;
3737 // find and move internal link opposite to bndLink within the face
3738 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
3739 const QLink* interLink = face->_sides[ interInd ];
3740 QLinkSet::iterator pInterLink = interLinks.find( interLink );
3741 if ( pInterLink == interLinks.end() ) continue; // not internal link
3742 interLink->Move( bndLink->_nodeMove );
3743 // treated internal links become new boundary ones
3744 interLinks.erase( pInterLink );
3745 newBndLinks->insert( interLink );
3748 curBndLinks->clear();
3749 std::swap( curBndLinks, newBndLinks );
3753 //================================================================================
3755 * \brief Fix links of continues triangles near curved boundary
3757 //================================================================================
3759 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
3761 if ( allLinks.empty() ) return;
3763 TLinkSet linkSet( allLinks.begin(), allLinks.end());
3764 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
3766 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
3768 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
3770 // move iff a boundary link is bent towards inside of a face (issue 0021084)
3771 const QFace* face = linkIt->_qfaces[0];
3772 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
3773 face->_sides[1]->MiddlePnt() +
3774 face->_sides[2]->MiddlePnt() ) / 3.;
3775 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
3776 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
3777 //if ( face->IsSpoiled( linkIt->_qlink ))
3778 if ( linkBentInside )
3779 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
3784 //================================================================================
3786 * \brief Detect rectangular structure of links and build chains from them
3788 //================================================================================
3790 enum TSplitTriaResult {
3791 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
3792 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
3794 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
3795 vector< TChain> & resultChains,
3796 SMDS_TypeOfPosition pos )
3798 // put links in the set and evalute number of result chains by number of boundary links
3801 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3802 linkSet.insert( *lnk );
3803 nbBndLinks += lnk->IsBoundary();
3805 resultChains.clear();
3806 resultChains.reserve( nbBndLinks / 2 );
3808 TLinkInSet linkIt, linksEnd = linkSet.end();
3810 // find a boundary link with corner node; corner node has position pos-2
3811 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
3813 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
3814 const SMDS_MeshNode* corner = 0;
3815 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
3816 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
3821 TLinkInSet startLink = linkIt;
3822 const SMDS_MeshNode* startCorner = corner;
3823 vector< TChain* > rowChains;
3826 while ( startLink != linksEnd) // loop on columns
3828 // We suppose we have a rectangular structure like shown here. We have found a
3829 // corner of the rectangle (startCorner) and a boundary link sharing
3830 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
3831 // --o---o---o structure making several chains at once. One chain (columnChain)
3832 // |\ | /| starts at startLink and continues upward (we look at the structure
3833 // \ | \ | / | from such point that startLink is on the bottom of the structure).
3834 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
3835 // --o---o---o encounter.
3837 // / | \ | \ | startCorner
3842 if ( resultChains.size() == nbBndLinks / 2 )
3844 resultChains.push_back( TChain() );
3845 TChain& columnChain = resultChains.back();
3847 TLinkInSet botLink = startLink; // current horizontal link to go up from
3848 corner = startCorner; // current corner the botLink ends at
3850 while ( botLink != linksEnd ) // loop on rows
3852 // add botLink to the columnChain
3853 columnChain.push_back( *botLink );
3855 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
3857 { // the column ends
3858 if ( botLink == startLink )
3859 return _TWISTED_CHAIN; // issue 0020951
3860 linkSet.erase( botLink );
3861 if ( iRow != rowChains.size() )
3862 return _FEW_ROWS; // different nb of rows in columns
3865 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
3866 // link ending at <corner> (sideLink); there are two cases:
3867 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
3868 // since midQuadLink is not at boundary while sideLink is.
3869 // 2) midQuadLink ends at <corner>
3871 TLinkInSet midQuadLink = linksEnd;
3872 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
3874 if ( isCase2 ) { // find midQuadLink among links of botTria
3875 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
3876 if ( midQuadLink->IsBoundary() )
3877 return _BAD_MIDQUAD;
3879 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
3880 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
3883 columnChain.push_back( *midQuadLink );
3884 if ( iRow >= rowChains.size() ) {
3886 return _MANY_ROWS; // different nb of rows in columns
3887 if ( resultChains.size() == nbBndLinks / 2 )
3889 resultChains.push_back( TChain() );
3890 rowChains.push_back( & resultChains.back() );
3892 rowChains[iRow]->push_back( *sideLink );
3893 rowChains[iRow]->push_back( *midQuadLink );
3895 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
3899 // prepare startCorner and startLink for the next column
3900 startCorner = startLink->NextNode( startCorner );
3902 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
3904 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
3905 // check if no more columns remains
3906 if ( startLink != linksEnd ) {
3907 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
3908 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
3909 startLink = linksEnd; // startLink bounds upTria or botTria
3910 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
3914 // find bottom link and corner for the next row
3915 corner = sideLink->NextNode( corner );
3916 // next bottom link ends at the new corner
3917 linkSet.erase( botLink );
3918 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
3919 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
3921 if ( midQuadLink == startLink || sideLink == startLink )
3922 return _TWISTED_CHAIN; // issue 0020951
3923 linkSet.erase( midQuadLink );
3924 linkSet.erase( sideLink );
3926 // make faces neighboring the found ones be boundary
3927 if ( startLink != linksEnd ) {
3928 const QFace* tria = isCase2 ? botTria : upTria;
3929 for ( int iL = 0; iL < 3; ++iL ) {
3930 linkIt = linkSet.find( tria->_sides[iL] );
3931 if ( linkIt != linksEnd )
3932 linkIt->RemoveFace( tria );
3935 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
3936 botLink->RemoveFace( upTria ); // make next botTria first in vector
3943 // In the linkSet, there must remain the last links of rowChains; add them
3944 if ( linkSet.size() != rowChains.size() )
3945 return _BAD_SET_SIZE;
3946 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
3947 // find the link (startLink) ending at startCorner
3949 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
3950 if ( (*startLink)->node1() == startCorner ) {
3951 corner = (*startLink)->node2(); break;
3953 else if ( (*startLink)->node2() == startCorner) {
3954 corner = (*startLink)->node1(); break;
3957 if ( startLink == linksEnd )
3959 rowChains[ iRow ]->push_back( *startLink );
3960 linkSet.erase( startLink );
3961 startCorner = corner;
3967 //================================================================================
3969 * \brief Place medium nodes at the link middle for elements whose corner nodes
3970 * are out of geometrical boundary to prevent distorting elements.
3971 * Issue 0020982, note 0013990
3973 //================================================================================
3975 void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
3976 SMESH_ComputeErrorPtr& theError)
3978 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
3979 TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
3980 if ( shape.IsNull() ) return;
3982 if ( !theError ) theError = SMESH_ComputeError::New();
3986 if ( shape.ShapeType() == TopAbs_FACE ) // 2D
3988 if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
3990 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
3991 if ( !faceSM ) return;
3993 const TopoDS_Face& face = TopoDS::Face( shape );
3994 Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
3996 TopExp_Explorer edgeIt( face, TopAbs_EDGE );
3997 for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
3999 // check if the EDGE needs checking
4000 const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
4001 if ( SMESH_Algo::isDegenerated( edge ) )
4003 if ( theHelper.IsRealSeam( edge ) &&
4004 edge.Orientation() == TopAbs_REVERSED )
4007 SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
4008 if ( !edgeSM ) continue;
4011 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
4012 BRepAdaptor_Curve curve3D( edge );
4013 switch ( curve3D.GetType() ) {
4014 case GeomAbs_Line: continue;
4015 case GeomAbs_Circle:
4016 case GeomAbs_Ellipse:
4017 case GeomAbs_Hyperbola:
4018 case GeomAbs_Parabola:
4021 gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
4022 curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
4023 gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
4024 surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
4025 gp_Vec fNorm = Du1 ^ Dv1;
4026 if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
4027 continue; // face is normal to the curve3D
4029 gp_Vec curvNorm = fNorm ^ D1;
4030 if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
4031 if ( curvNorm * D2 > 0 )
4032 continue; // convex edge
4034 catch ( Standard_Failure )
4039 // get nodes shared by faces that may be distorted
4040 SMDS_NodeIteratorPtr nodeIt;
4041 if ( edgeSM->NbNodes() > 0 ) {
4042 nodeIt = edgeSM->GetNodes();
4045 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
4047 vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
4048 if ( !vertexSM ) continue;
4049 nodeIt = vertexSM->GetNodes();
4052 // find suspicious faces
4053 TIDSortedElemSet checkedFaces;
4054 vector< const SMDS_MeshNode* > nOnEdge( 2 );
4055 const SMDS_MeshNode* nOnFace;
4056 while ( nodeIt->more() )
4058 const SMDS_MeshNode* n = nodeIt->next();
4059 SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
4060 while ( faceIt->more() )
4062 const SMDS_MeshElement* f = faceIt->next();
4063 if ( !faceSM->Contains( f ) ||
4064 f->NbNodes() < 6 || // check quadratic triangles only
4065 !checkedFaces.insert( f ).second )
4068 // get nodes on EDGE and on FACE of a suspicious face
4069 nOnEdge.clear(); nOnFace = 0;
4070 SMDS_MeshElement::iterator triNode = f->begin_nodes();
4071 for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
4074 if ( n->GetPosition()->GetDim() == 2 )
4077 nOnEdge.push_back( n );
4080 // check if nOnFace is inside the FACE
4081 if ( nOnFace && nOnEdge.size() == 2 )
4083 theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
4084 if ( !SMESH_MeshAlgos::FaceNormal( f, faceNorm, /*normalized=*/false ))
4086 gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
4087 gp_XYZ edgeNorm = faceNorm ^ edgeDir;
4088 n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true );
4089 gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
4090 gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
4091 gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
4092 double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
4093 double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
4094 if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
4096 // nOnFace is out of FACE, move a medium on-edge node to the middle
4097 gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
4098 meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4099 MSG( "move OUT of face " << n );
4100 theError->myBadElements.push_back( f );
4106 if ( !theError->myBadElements.empty() )
4107 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4110 } // 2D ==============================================================================
4112 if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
4114 if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
4115 theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
4117 SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
4118 if ( !solidSM ) return;
4120 // check if the SOLID is bound by concave FACEs
4121 vector< TopoDS_Face > concaveFaces;
4122 TopExp_Explorer faceIt( shape, TopAbs_FACE );
4123 for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4125 const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
4126 if ( !meshDS->MeshElements( face )) continue;
4128 BRepAdaptor_Surface surface( face );
4129 switch ( surface.GetType() ) {
4130 case GeomAbs_Plane: continue;
4131 case GeomAbs_Cylinder:
4133 case GeomAbs_Sphere:
4136 double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
4137 double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
4138 gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
4139 surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
4140 gp_Vec fNorm = Du1 ^ Dv1;
4141 if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
4142 bool concaveU = ( fNorm * Du2 > 1e-100 );
4143 bool concaveV = ( fNorm * Dv2 > 1e-100 );
4144 if ( concaveU || concaveV )
4145 concaveFaces.push_back( face );
4147 catch ( Standard_Failure )
4149 concaveFaces.push_back( face );
4153 if ( concaveFaces.empty() )
4156 // fix 2D mesh on the SOLID
4157 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4159 SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
4160 faceHelper.SetSubShape( faceIt.Current() );
4161 force3DOutOfBoundary( faceHelper, theError );
4164 // get an iterator over faces on concaveFaces
4165 vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
4166 for ( size_t i = 0; i < concaveFaces.size(); ++i )
4167 faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
4168 typedef SMDS_IteratorOnIterators
4169 < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
4170 SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
4172 // a seacher to check if a volume is close to a concave face
4173 std::auto_ptr< SMESH_ElementSearcher > faceSearcher
4174 ( SMESH_MeshAlgos::GetElementSearcher( *theHelper.GetMeshDS(), faceIter ));
4177 //BRepClass3d_SolidClassifier solidClassifier( shape );
4179 TIDSortedElemSet checkedVols, movedNodes;
4180 //for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4181 for ( size_t iF = 0; iF < concaveFaces.size(); ++iF ) // loop on concave FACEs
4183 //const TopoDS_Shape& face = faceIt.Current();
4184 const TopoDS_Shape& face = concaveFaces[ iF ];
4185 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
4186 if ( !faceSM ) continue;
4188 // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
4189 SMDS_NodeIteratorPtr nodeIt;
4190 if ( faceSM->NbNodes() > 0 ) {
4191 nodeIt = faceSM->GetNodes();
4194 TopExp_Explorer vertex( face, TopAbs_VERTEX );
4195 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
4196 if ( !vertexSM ) continue;
4197 nodeIt = vertexSM->GetNodes();
4199 // get ids of sub-shapes of the FACE
4201 SMESH_subMeshIteratorPtr smIt =
4202 theHelper.GetMesh()->GetSubMesh( face )->getDependsOnIterator(/*includeSelf=*/true);
4203 while ( smIt->more() )
4204 subIDs.insert( smIt->next()->GetId() );
4206 // find suspicious volumes adjacent to the FACE
4207 vector< const SMDS_MeshNode* > nOnFace( 4 );
4208 const SMDS_MeshNode* nInSolid;
4209 while ( nodeIt->more() )
4211 const SMDS_MeshNode* n = nodeIt->next();
4212 SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
4213 while ( volIt->more() )
4215 const SMDS_MeshElement* vol = volIt->next();
4216 int nbN = vol->NbCornerNodes();
4217 if ( ( nbN != 4 && nbN != 5 ) ||
4218 !solidSM->Contains( vol ) ||
4219 !checkedVols.insert( vol ).second )
4222 // get nodes on FACE and in SOLID of a suspicious volume
4223 nOnFace.clear(); nInSolid = 0;
4224 SMDS_MeshElement::iterator volNode = vol->begin_nodes();
4225 for ( int nb = nbN; nb > 0; ++volNode, --nb )
4228 if ( n->GetPosition()->GetDim() == 3 )
4230 else if ( subIDs.count( n->getshapeId() ))
4231 nOnFace.push_back( n );
4235 if ( !nInSolid || nOnFace.size() != nbN - 1 )
4238 // get size of the vol
4239 SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
4240 double volLength = pInSolid.SquareDistance( nOnFace[0] );
4241 for ( size_t i = 1; i < nOnFace.size(); ++i )
4243 volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
4246 // check if vol is close to concaveFaces
4247 const SMDS_MeshElement* closeFace =
4248 faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
4250 pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
4253 // check if vol is distorted, i.e. a medium node is much closer
4254 // to nInSolid than the link middle
4255 bool isDistorted = false;
4256 SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
4257 if ( !SMESH_MeshAlgos::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
4259 theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
4260 vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
4261 for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
4262 for ( size_t j = i+1; j < nOnFace.size(); ++j )
4264 SMESH_TLink link( nOnFace[i], nOnFace[j] );
4265 TLinkNodeMap::const_iterator linkIt =
4266 theHelper.GetTLinkNodeMap().find( link );
4267 if ( linkIt != theHelper.GetTLinkNodeMap().end() )
4269 links.push_back( make_pair( linkIt->first, linkIt->second ));
4270 if ( !isDistorted ) {
4271 // compare projections of nInSolid and nMedium to face normal
4272 gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
4273 double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
4274 double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
4275 isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
4279 // move medium nodes to link middle
4282 for ( size_t i = 0; i < links.size(); ++i )
4284 const SMDS_MeshNode* nMedium = links[i].second;
4285 if ( movedNodes.insert( nMedium ).second )
4287 gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
4288 SMESH_TNodeXYZ( links[i].first.node2() ));
4289 meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4290 MSG( "move OUT of solid " << nMedium );
4293 theError->myBadElements.push_back( vol );
4295 } // loop on volumes sharing a node on FACE
4296 } // loop on nodes on FACE
4297 } // loop on FACEs of a SOLID
4299 if ( !theError->myBadElements.empty() )
4300 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4306 //=======================================================================
4308 * \brief Move medium nodes of faces and volumes to fix distorted elements
4309 * \param error - container of fixed distorted elements
4310 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
4312 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
4314 //=======================================================================
4316 void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& compError,
4319 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
4320 if ( getenv("NO_FixQuadraticElements") )
4323 // 0. Apply algorithm to SOLIDs or FACEs
4324 // ----------------------------------------------
4325 if ( myShape.IsNull() ) {
4326 if ( !myMesh->HasShapeToMesh() ) return;
4327 SetSubShape( myMesh->GetShapeToMesh() );
4331 TopTools_IndexedMapOfShape solids;
4332 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
4333 nbSolids = solids.Extent();
4335 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
4336 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
4337 faces.Add( f.Current() ); // not in solid
4339 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
4340 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
4341 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
4342 faces.Add( f.Current() ); // in not meshed solid
4344 else { // fix nodes in the solid and its faces
4346 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
4348 SMESH_MesherHelper h(*myMesh);
4349 h.SetSubShape( s.Current() );
4350 h.ToFixNodeParameters(true);
4351 h.FixQuadraticElements( compError, false );
4354 // fix nodes on geom faces
4356 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
4358 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
4359 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
4360 SMESH_MesherHelper h(*myMesh);
4361 h.SetSubShape( fIt.Key() );
4362 h.ToFixNodeParameters(true);
4363 h.FixQuadraticElements( compError, true);
4365 //perf_print_all_meters(1);
4366 if ( compError && compError->myName == EDITERR_NO_MEDIUM_ON_GEOM )
4367 compError->myComment = "during conversion to quadratic, "
4368 "some medium nodes were not placed on geometry to avoid distorting elements";
4372 // 1. Find out type of elements and get iterator on them
4373 // ---------------------------------------------------
4375 SMDS_ElemIteratorPtr elemIt;
4376 SMDSAbs_ElementType elemType = SMDSAbs_All;
4378 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
4381 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
4382 elemIt = smDS->GetElements();
4383 if ( elemIt->more() ) {
4384 elemType = elemIt->next()->GetType();
4385 elemIt = smDS->GetElements();
4388 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
4391 // 2. Fill in auxiliary data structures
4392 // ----------------------------------
4396 set< QLink >::iterator pLink;
4397 set< QFace >::iterator pFace;
4399 bool isCurved = false;
4400 //bool hasRectFaces = false;
4401 //set<int> nbElemNodeSet;
4402 SMDS_VolumeTool volTool;
4404 TIDSortedNodeSet apexOfPyramid;
4405 const int apexIndex = 4;
4408 // Move medium nodes to the link middle for elements whose corner nodes
4409 // are out of geometrical boundary to fix distorted elements.
4410 force3DOutOfBoundary( *this, compError );
4412 if ( elemType == SMDSAbs_Volume )
4414 while ( elemIt->more() ) // loop on volumes
4416 const SMDS_MeshElement* vol = elemIt->next();
4417 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
4419 double volMinSize2 = -1.;
4420 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
4422 int nbN = volTool.NbFaceNodes( iF );
4423 //nbElemNodeSet.insert( nbN );
4424 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
4425 vector< const QLink* > faceLinks( nbN/2 );
4426 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
4429 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
4430 pLink = links.insert( link ).first;
4431 faceLinks[ iN/2 ] = & *pLink;
4433 if ( link.MediumPos() == SMDS_TOP_3DSPACE )
4435 if ( !link.IsStraight() )
4436 return; // already fixed
4438 else if ( !isCurved )
4440 if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
4441 isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
4445 pFace = faces.insert( QFace( faceLinks )).first;
4446 if ( pFace->NbVolumes() == 0 )
4447 pFace->AddSelfToLinks();
4448 pFace->SetVolume( vol );
4449 // hasRectFaces = hasRectFaces ||
4450 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
4451 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
4454 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
4456 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
4457 faceNodes[4],faceNodes[6] );
4460 // collect pyramid apexes for further correction
4461 if ( vol->NbCornerNodes() == 5 )
4462 apexOfPyramid.insert( vol->GetNode( apexIndex ));
4464 set< QLink >::iterator pLink = links.begin();
4465 for ( ; pLink != links.end(); ++pLink )
4466 pLink->SetContinuesFaces();
4470 while ( elemIt->more() ) // loop on faces
4472 const SMDS_MeshElement* face = elemIt->next();
4473 if ( !face->IsQuadratic() )
4475 //nbElemNodeSet.insert( face->NbNodes() );
4476 int nbN = face->NbNodes()/2;
4477 vector< const QLink* > faceLinks( nbN );
4478 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
4481 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
4482 pLink = links.insert( link ).first;
4483 faceLinks[ iN ] = & *pLink;
4485 link.node1()->GetPosition()->GetTypeOfPosition() < 2 &&
4486 link.node2()->GetPosition()->GetTypeOfPosition() < 2 )
4487 isCurved = !link.IsStraight();
4490 pFace = faces.insert( QFace( faceLinks )).first;
4491 pFace->AddSelfToLinks();
4492 //hasRectFaces = ( hasRectFaces || nbN == 4 );
4496 return; // no curved edges of faces
4498 // 3. Compute displacement of medium nodes
4499 // ---------------------------------------
4501 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones.
4502 TopLoc_Location loc;
4504 // not to treat boundary of volumic sub-mesh.
4505 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
4506 for ( ; isInside < 2; ++isInside )
4508 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
4509 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
4510 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
4512 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
4513 if ( bool(isInside) == pFace->IsBoundary() )
4515 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
4518 // make chain of links connected via continues faces
4521 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
4523 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
4525 vector< TChain > chains;
4526 if ( error == ERR_OK ) { // chain contains continues rectangles
4528 chains[0].splice( chains[0].begin(), rawChain );
4530 else if ( error == ERR_TRI ) { // chain contains continues triangles
4531 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
4532 if ( res != _OK ) { // not quadrangles split into triangles
4533 fixTriaNearBoundary( rawChain, *this );
4537 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
4538 fixPrism( rawChain );
4544 for ( int iC = 0; iC < chains.size(); ++iC )
4546 TChain& chain = chains[iC];
4547 if ( chain.empty() ) continue;
4548 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
4549 MSG("3D straight - ignore");
4552 if ( chain.front()->MediumPos() > bndPos ||
4553 chain.back() ->MediumPos() > bndPos ) {
4554 MSG("Internal chain - ignore");
4557 // mesure chain length and compute link position along the chain
4558 double chainLen = 0;
4559 vector< double > linkPos;
4560 MSGBEG( "Link medium nodes: ");
4561 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
4562 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
4563 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
4564 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4565 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
4566 link1 = chain.erase( link1 );
4567 if ( link1 == chain.end() )
4569 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4572 linkPos.push_back( chainLen );
4575 if ( linkPos.size() < 2 )
4578 gp_Vec move0 = chain.front()->_nodeMove;
4579 gp_Vec move1 = chain.back ()->_nodeMove;
4584 // compute node displacement of end links of chain in parametric space of face
4585 TChainLink& linkOnFace = *(++chain.begin());
4586 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
4587 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
4588 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
4590 face = TopoDS::Face( f );
4591 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
4593 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
4595 TChainLink& link = is1 ? chain.back() : chain.front();
4596 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
4597 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
4598 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
4599 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4600 // uvMove = uvm - uv12
4601 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
4602 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
4603 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
4604 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
4605 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
4606 10 * uvMove.SquareModulus());
4608 if ( isStraight[0] && isStraight[1] ) {
4609 MSG("2D straight - ignore");
4610 continue; // straight - no need to move nodes of internal links
4613 // check if a chain is already fixed
4614 gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
4615 gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
4616 gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
4617 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4618 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
4620 MSG("Already fixed - ignore");
4626 if ( isInside || face.IsNull() )
4628 // compute node displacement of end links in their local coord systems
4630 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
4631 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
4632 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4633 move0.Transform(trsf);
4636 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
4637 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
4638 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4639 move1.Transform(trsf);
4642 // compute displacement of medium nodes
4643 link2 = chain.begin();
4646 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
4648 double r = linkPos[i] / chainLen;
4649 // displacement in local coord system
4650 gp_Vec move = (1. - r) * move0 + r * move1;
4651 if ( isInside || face.IsNull()) {
4652 // transform to global
4653 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
4654 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
4655 gp_Vec x = x01.Normalized() + x12.Normalized();
4656 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
4657 move.Transform(trsf);
4660 // compute 3D displacement by 2D one
4661 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
4662 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
4663 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
4664 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
4665 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
4666 if ( SMDS_FacePosition* nPos =
4667 dynamic_cast< SMDS_FacePosition* >((*link1)->_mediumNode->GetPosition()))
4668 nPos->SetParameters( newUV.X(), newUV.Y() );
4670 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
4671 move.SquareMagnitude())
4673 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
4674 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
4675 MSG( "TOO LONG MOVE \t" <<
4676 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
4677 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
4678 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
4679 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
4683 (*link1)->Move( move );
4684 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
4685 << chain.front()->_mediumNode->GetID() <<"-"
4686 << chain.back ()->_mediumNode->GetID() <<
4687 " by " << move.Magnitude());
4689 } // loop on chains of links
4690 } // loop on 2 directions of propagation from quadrangle
4692 } // fix faces and/or volumes
4697 TIDSortedElemSet biQuadQuas, biQuadTris, triQuadHexa;
4698 const SMDS_MeshElement *biQuadQua, *triQuadHex;
4699 const bool toFixCentralNodes = ( myMesh->NbBiQuadQuadrangles() +
4700 myMesh->NbBiQuadTriangles() +
4701 myMesh->NbTriQuadraticHexas() );
4703 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
4704 if ( pLink->IsMoved() )
4706 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
4707 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
4709 // collect bi-quadratic elements
4710 if ( toFixCentralNodes )
4712 biQuadQua = triQuadHex = 0;
4713 SMDS_ElemIteratorPtr eIt = pLink->_mediumNode->GetInverseElementIterator();
4714 while ( eIt->more() )
4716 const SMDS_MeshElement* e = eIt->next();
4717 switch( e->GetEntityType() ) {
4718 case SMDSEntity_BiQuad_Quadrangle: biQuadQuas.insert( e ); break;
4719 case SMDSEntity_BiQuad_Triangle: biQuadTris.insert( e ); break;
4720 case SMDSEntity_TriQuad_Hexa: triQuadHexa.insert( e ); break;
4727 // Fix positions of central nodes of bi-tri-quadratic elements
4729 // treat bi-quad quadrangles
4731 vector< const SMDS_MeshNode* > nodes( 9 );
4733 TIDSortedElemSet::iterator quadIt = biQuadQuas.begin();
4734 for ( ; quadIt != biQuadQuas.end(); ++quadIt )
4736 const SMDS_MeshElement* quad = *quadIt;
4739 nodes.assign( quad->begin_nodes(), quad->end_nodes() );
4741 TopoDS_Shape S = GetSubShapeByNode( nodes.back(), GetMeshDS() );
4742 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4743 const TopoDS_Face& F = TopoDS::Face( S );
4744 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4745 const double tol = BRep_Tool::Tolerance( F );
4747 for ( int i = 0; i < 8; ++i )
4749 uv[ i ] = GetNodeUV( F, nodes[i], nodes[8], &checkUV );
4750 // as this method is used after mesh generation, UV of nodes is not
4751 // updated according to bending links, so we update
4752 if ( i > 3 && nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4753 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4755 // move the central node
4756 gp_XY uvCent = calcTFI (0.5, 0.5, uv[0],uv[1],uv[2],uv[3],uv[4],uv[5],uv[6],uv[7] );
4757 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4758 GetMeshDS()->MoveNode( nodes[8], p.X(), p.Y(), p.Z());
4762 // treat bi-quad triangles
4764 vector< const SMDS_MeshNode* > nodes;
4766 TIDSortedElemSet::iterator triIt = biQuadTris.begin();
4767 for ( ; triIt != biQuadTris.end(); ++triIt )
4769 const SMDS_MeshElement* tria = *triIt;
4771 const TopoDS_Shape& S = GetMeshDS()->IndexToShape( tria->getshapeId() );
4772 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4773 const TopoDS_Face& F = TopoDS::Face( S );
4774 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4775 const double tol = BRep_Tool::Tolerance( F );
4778 nodes.assign( tria->begin_nodes(), tria->end_nodes() );
4780 for ( int i = 0; i < 6; ++i )
4782 uv[ i ] = GetNodeUV( F, nodes[i], nodes[(i+1)%3], &checkUV );
4783 // as this method is used after mesh generation, UV of nodes is not
4784 // updated according to bending links, so we update
4785 if ( nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4786 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4788 // move the central node
4789 gp_XY uvCent = GetCenterUV( uv[0], uv[1], uv[2], uv[3], uv[4], uv[5] );
4790 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4791 GetMeshDS()->MoveNode( tria->GetNode(6), p.X(), p.Y(), p.Z() );
4795 // treat tri-quadratic hexahedra
4797 SMDS_VolumeTool volExp;
4798 TIDSortedElemSet::iterator hexIt = triQuadHexa.begin();
4799 for ( ; hexIt != triQuadHexa.end(); ++hexIt )
4801 volExp.Set( *hexIt, /*ignoreCentralNodes=*/false );
4803 // fix nodes central in sides
4804 for ( int iQuad = 0; iQuad < volExp.NbFaces(); ++iQuad )
4806 const SMDS_MeshNode** quadNodes = volExp.GetFaceNodes( iQuad );
4807 if ( quadNodes[8]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
4809 gp_XYZ p = calcTFI( 0.5, 0.5,
4810 SMESH_TNodeXYZ( quadNodes[0] ), SMESH_TNodeXYZ( quadNodes[2] ),
4811 SMESH_TNodeXYZ( quadNodes[4] ), SMESH_TNodeXYZ( quadNodes[6] ),
4812 SMESH_TNodeXYZ( quadNodes[1] ), SMESH_TNodeXYZ( quadNodes[3] ),
4813 SMESH_TNodeXYZ( quadNodes[5] ), SMESH_TNodeXYZ( quadNodes[7] ));
4814 GetMeshDS()->MoveNode( quadNodes[8], p.X(), p.Y(), p.Z());
4818 // fix the volume central node
4819 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
4820 const SMDS_MeshNode** hexNodes = volExp.GetNodes();
4822 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( hexNodes[ 0 ] );
4823 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( hexNodes[ 3 ] );
4824 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( hexNodes[ 1 ] );
4825 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( hexNodes[ 2 ] );
4826 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( hexNodes[ 4 ] );
4827 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( hexNodes[ 7 ] );
4828 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( hexNodes[ 5 ] );
4829 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( hexNodes[ 6 ] );
4831 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( hexNodes[ 11 ] );
4832 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( hexNodes[ 9 ] );
4833 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( hexNodes[ 8 ] );
4834 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( hexNodes[ 10 ] );
4835 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( hexNodes[ 15 ] );
4836 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( hexNodes[ 13 ] );
4837 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( hexNodes[ 12 ] );
4838 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( hexNodes[ 14 ] );
4839 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( hexNodes[ 16 ] );
4840 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( hexNodes[ 19 ] );
4841 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( hexNodes[ 17 ] );
4842 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( hexNodes[ 18 ] );
4844 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( hexNodes[ 20 ] );
4845 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( hexNodes[ 25 ] );
4846 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( hexNodes[ 21 ] );
4847 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( hexNodes[ 23 ] );
4848 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( hexNodes[ 24 ] );
4849 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( hexNodes[ 22 ] );
4851 gp_XYZ nCenterParams(0.5, 0.5, 0.5), nCenterCoords;
4852 SMESH_Block::ShellPoint( nCenterParams, pointsOnShapes, nCenterCoords );
4853 GetMeshDS()->MoveNode( hexNodes[26],
4854 nCenterCoords.X(), nCenterCoords.Y(), nCenterCoords.Z());