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 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
385 if ( edge->IsQuadratic() )
386 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
389 //================================================================================
391 * \brief Add quadratic links of face to own data structure
393 //================================================================================
395 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
398 switch ( f->NbNodes() ) {
400 // myMapWithCentralNode.insert
401 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2) ),
403 // break; -- add medium nodes as well
405 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
406 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
407 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
410 // myMapWithCentralNode.insert
411 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2),f->GetNode(3) ),
413 // break; -- add medium nodes as well
415 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
416 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
417 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
418 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7)); break;
423 //================================================================================
425 * \brief Add quadratic links of volume to own data structure
427 //================================================================================
429 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
431 if ( volume->IsQuadratic() )
433 SMDS_VolumeTool vTool( volume );
434 const SMDS_MeshNode** nodes = vTool.GetNodes();
436 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
438 const int nbN = vTool.NbFaceNodes( iF );
439 const int* iNodes = vTool.GetFaceNodesIndices( iF );
440 for ( int i = 0; i < nbN; )
442 int iN1 = iNodes[i++];
443 int iN12 = iNodes[i++];
445 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
446 int linkID = iN1 * vTool.NbNodes() + iN2;
447 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
448 if ( it_isNew.second )
449 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
451 addedLinks.erase( it_isNew.first ); // each link encounters only twice
453 if ( vTool.NbNodes() == 27 )
455 const SMDS_MeshNode* nFCenter = nodes[ vTool.GetCenterNodeIndex( iF )];
456 if ( nFCenter->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
457 myMapWithCentralNode.insert
458 ( make_pair( TBiQuad( nodes[ iNodes[0]], nodes[ iNodes[1]],
459 nodes[ iNodes[2]], nodes[ iNodes[3]] ),
466 //================================================================================
468 * \brief Return true if position of nodes on the shape hasn't yet been checked or
469 * the positions proved to be invalid
471 //================================================================================
473 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
475 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
476 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
479 //================================================================================
481 * \brief Set validity of positions of nodes on the shape.
482 * Once set, validity is not changed
484 //================================================================================
486 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
488 std::map< int,bool >::iterator sh_ok =
489 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok)).first;
494 //=======================================================================
495 //function : ToFixNodeParameters
496 //purpose : Enables fixing node parameters on EDGEs and FACEs in
497 // GetNodeU(...,check=true), GetNodeUV(...,check=true), CheckNodeUV() and
498 // CheckNodeU() in case if a node lies on a shape set via SetSubShape().
500 //=======================================================================
502 void SMESH_MesherHelper::ToFixNodeParameters(bool toFix)
504 myFixNodeParameters = toFix;
508 //=======================================================================
509 //function : GetUVOnSeam
510 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
511 //=======================================================================
513 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
515 gp_Pnt2d result = uv1;
516 for ( int i = U_periodic; i <= V_periodic ; ++i )
518 if ( myParIndex & i )
520 double p1 = uv1.Coord( i );
521 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
522 if ( myParIndex == i ||
523 dp1 < ( myPar2[i-1] - myPar1[i-1] ) / 100. ||
524 dp2 < ( myPar2[i-1] - myPar1[i-1] ) / 100. )
526 double p2 = uv2.Coord( i );
527 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
528 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
529 result.SetCoord( i, p1Alt );
536 //=======================================================================
537 //function : GetNodeUV
538 //purpose : Return node UV on face
539 //=======================================================================
541 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
542 const SMDS_MeshNode* n,
543 const SMDS_MeshNode* n2,
546 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
548 const SMDS_PositionPtr Pos = n->GetPosition();
550 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
552 // node has position on face
553 const SMDS_FacePosition* fpos =
554 static_cast<const SMDS_FacePosition*>( Pos );
555 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
557 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
559 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
561 // node has position on edge => it is needed to find
562 // corresponding edge from face, get pcurve for this
563 // edge and retrieve value from this pcurve
564 const SMDS_EdgePosition* epos =
565 static_cast<const SMDS_EdgePosition*>( Pos );
566 int edgeID = n->getshapeId();
567 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
568 double f, l, u = epos->GetUParameter();
569 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
570 bool validU = ( f < u && u < l );
572 uv = C2d->Value( u );
574 uv.SetCoord( Precision::Infinite(),0.);
575 if ( check || !validU )
576 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ),/*force=*/ !validU );
578 // for a node on a seam edge select one of UVs on 2 pcurves
579 if ( n2 && IsSeamShape( edgeID ) )
581 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
584 { // adjust uv to period
586 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
587 Standard_Boolean isUPeriodic = S->IsUPeriodic();
588 Standard_Boolean isVPeriodic = S->IsVPeriodic();
589 if ( isUPeriodic || isVPeriodic ) {
590 Standard_Real UF,UL,VF,VL;
591 S->Bounds(UF,UL,VF,VL);
593 uv.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
595 uv.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
599 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
601 if ( int vertexID = n->getshapeId() ) {
602 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
604 uv = BRep_Tool::Parameters( V, F );
607 catch (Standard_Failure& exc) {
610 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
611 uvOK = ( V == vert.Current() );
613 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
614 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
615 // get UV of a vertex closest to the node
617 gp_Pnt pn = XYZ( n );
618 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
619 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
620 gp_Pnt p = BRep_Tool::Pnt( curV );
621 double curDist = p.SquareDistance( pn );
622 if ( curDist < dist ) {
624 uv = BRep_Tool::Parameters( curV, F );
625 uvOK = ( dist < DBL_MIN );
631 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
632 for ( ; it.More(); it.Next() ) {
633 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
634 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
636 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
637 if ( !C2d.IsNull() ) {
638 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
639 uv = C2d->Value( u );
647 if ( n2 && IsSeamShape( vertexID ) )
648 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
653 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
662 //=======================================================================
663 //function : CheckNodeUV
664 //purpose : Check and fix node UV on a face
665 //=======================================================================
667 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
668 const SMDS_MeshNode* n,
672 double distXYZ[4]) const
674 int shapeID = n->getshapeId();
675 bool infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ));
676 bool zero = ( uv.X() == 0. && uv.Y() == 0. );
677 if ( force || toCheckPosOnShape( shapeID ) || infinit || zero )
679 // check that uv is correct
681 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
682 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
684 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
686 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
688 setPosOnShapeValidity( shapeID, false );
689 if ( !infinit && distXYZ ) {
690 surfPnt.Transform( loc );
692 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
694 // uv incorrect, project the node to surface
695 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
696 projector.Perform( nodePnt );
697 if ( !projector.IsDone() || projector.NbPoints() < 1 )
699 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
702 Quantity_Parameter U,V;
703 projector.LowerDistanceParameters(U,V);
705 surfPnt = surface->Value( U, V );
706 dist = nodePnt.Distance( surfPnt );
708 surfPnt.Transform( loc );
710 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
714 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
717 // store the fixed UV on the face
718 if ( myShape.IsSame(F) && shapeID == myShapeID && myFixNodeParameters )
719 const_cast<SMDS_MeshNode*>(n)->SetPosition
720 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
722 else if ( uv.Modulus() > numeric_limits<double>::min() )
724 setPosOnShapeValidity( shapeID, true );
730 //=======================================================================
731 //function : GetProjector
732 //purpose : Return projector intitialized by given face without location, which is returned
733 //=======================================================================
735 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
736 TopLoc_Location& loc,
739 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
740 int faceID = GetMeshDS()->ShapeToIndex( F );
741 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
742 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
743 if ( i_proj == i2proj.end() )
745 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
746 double U1, U2, V1, V2;
747 surface->Bounds(U1, U2, V1, V2);
748 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
749 proj->Init( surface, U1, U2, V1, V2, tol );
750 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
752 return *( i_proj->second );
757 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
758 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
759 gp_XY_FunPtr(Subtracted);
762 //=======================================================================
763 //function : applyIn2D
764 //purpose : Perform given operation on two 2d points in parameric space of given surface.
765 // It takes into account period of the surface. Use gp_XY_FunPtr macro
766 // to easily define pointer to function of gp_XY class.
767 //=======================================================================
769 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
773 const bool resultInPeriod)
775 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
776 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
777 if ( !isUPeriodic && !isVPeriodic )
780 // move uv2 not far than half-period from uv1
782 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
784 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
787 gp_XY res = fun( uv1, gp_XY(u2,v2) );
789 // move result within period
790 if ( resultInPeriod )
792 Standard_Real UF,UL,VF,VL;
793 surface->Bounds(UF,UL,VF,VL);
795 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
797 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
802 //=======================================================================
803 //function : GetMiddleUV
804 //purpose : Return middle UV taking in account surface period
805 //=======================================================================
807 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
812 // the proper place of getting basic surface seems to be in applyIn2D()
813 // but we put it here to decrease a risk of regressions just before releasing a version
814 Handle(Geom_Surface) surf = surface;
815 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
816 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
818 return applyIn2D( surf, p1, p2, & AverageUV );
821 //=======================================================================
822 //function : GetCenterUV
823 //purpose : Return UV for the central node of a biquadratic triangle
824 //=======================================================================
826 gp_XY SMESH_MesherHelper::GetCenterUV(const gp_XY& uv1,
832 bool * isBadTria/*=0*/)
835 gp_XY uvAvg = ( uv12 + uv23 + uv31 ) / 3.;
837 if (( badTria = (( uvAvg - uv1 ) * ( uvAvg - uv23 ) > 0 )))
838 uvAvg = ( uv1 + uv23 ) / 2.;
839 else if (( badTria = (( uvAvg - uv2 ) * ( uvAvg - uv31 ) > 0 )))
840 uvAvg = ( uv2 + uv31 ) / 2.;
841 else if (( badTria = (( uvAvg - uv3 ) * ( uvAvg - uv12 ) > 0 )))
842 uvAvg = ( uv3 + uv12 ) / 2.;
845 *isBadTria = badTria;
849 //=======================================================================
850 //function : GetNodeU
851 //purpose : Return node U on edge
852 //=======================================================================
854 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
855 const SMDS_MeshNode* n,
856 const SMDS_MeshNode* inEdgeNode,
859 double param = Precision::Infinite();
861 const SMDS_PositionPtr pos = n->GetPosition();
862 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
864 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
865 param = epos->GetUParameter();
867 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
869 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
872 BRep_Tool::Range( E, f,l );
873 double uInEdge = GetNodeU( E, inEdgeNode );
874 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
878 SMESHDS_Mesh * meshDS = GetMeshDS();
879 int vertexID = n->getshapeId();
880 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
881 param = BRep_Tool::Parameter( V, E );
886 double tol = BRep_Tool::Tolerance( E );
887 double f,l; BRep_Tool::Range( E, f,l );
888 bool force = ( param < f-tol || param > l+tol );
889 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
890 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
892 *check = CheckNodeU( E, n, param, 2*tol, force );
897 //=======================================================================
898 //function : CheckNodeU
899 //purpose : Check and fix node U on an edge
900 // Return false if U is bad and could not be fixed
901 //=======================================================================
903 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
904 const SMDS_MeshNode* n,
908 double distXYZ[4]) const
910 int shapeID = n->getshapeId();
911 bool infinit = Precision::IsInfinite( u );
912 bool zero = ( u == 0. );
913 if ( force || toCheckPosOnShape( shapeID ) || infinit || zero )
915 TopLoc_Location loc; double f,l;
916 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
917 if ( curve.IsNull() ) // degenerated edge
919 if ( u+tol < f || u-tol > l )
921 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
927 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
928 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
933 curvPnt = curve->Value( u );
934 dist = nodePnt.Distance( curvPnt );
936 curvPnt.Transform( loc );
938 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
943 setPosOnShapeValidity( shapeID, false );
944 // u incorrect, project the node to the curve
945 int edgeID = GetMeshDS()->ShapeToIndex( E );
946 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
947 TID2ProjectorOnCurve::iterator i_proj =
948 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
949 if ( !i_proj->second )
951 i_proj->second = new GeomAPI_ProjectPointOnCurve();
952 i_proj->second->Init( curve, f, l );
954 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
955 projector->Perform( nodePnt );
956 if ( projector->NbPoints() < 1 )
958 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
961 Quantity_Parameter U = projector->LowerDistanceParameter();
963 MESSAGE(" f " << f << " l " << l << " u " << u);
964 curvPnt = curve->Value( u );
965 dist = nodePnt.Distance( curvPnt );
967 curvPnt.Transform( loc );
969 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
973 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
974 MESSAGE("distance " << dist << " " << tol );
977 // store the fixed U on the edge
978 if ( myShape.IsSame(E) && shapeID == myShapeID && myFixNodeParameters )
979 const_cast<SMDS_MeshNode*>(n)->SetPosition
980 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
982 else if ( fabs( u ) > numeric_limits<double>::min() )
984 setPosOnShapeValidity( shapeID, true );
986 if (( u < f-tol || u > l+tol ) && force )
988 MESSAGE("u < f-tol || u > l+tol ; u " << u << " f " << f << " l " << l);
989 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
992 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
993 double period = curve->Period();
994 u = ( u < f ) ? u + period : u - period;
996 catch (Standard_Failure& exc)
1006 //=======================================================================
1007 //function : GetMediumPos
1008 //purpose : Return index and type of the shape (EDGE or FACE only) to
1009 // set a medium node on
1010 //param : useCurSubShape - if true, returns the shape set via SetSubShape()
1012 //=======================================================================
1014 std::pair<int, TopAbs_ShapeEnum>
1015 SMESH_MesherHelper::GetMediumPos(const SMDS_MeshNode* n1,
1016 const SMDS_MeshNode* n2,
1017 const bool useCurSubShape)
1019 if ( useCurSubShape && !myShape.IsNull() )
1020 return std::make_pair( myShapeID, myShape.ShapeType() );
1022 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1026 if (( myShapeID == n1->getshapeId() || myShapeID == n2->getshapeId() ) && myShapeID > 0 )
1028 shapeType = myShape.ShapeType();
1029 shapeID = myShapeID;
1031 else if ( n1->getshapeId() == n2->getshapeId() )
1033 shapeID = n2->getshapeId();
1034 shape = GetSubShapeByNode( n1, GetMeshDS() );
1038 const SMDS_TypeOfPosition Pos1 = n1->GetPosition()->GetTypeOfPosition();
1039 const SMDS_TypeOfPosition Pos2 = n2->GetPosition()->GetTypeOfPosition();
1041 if ( Pos1 == SMDS_TOP_3DSPACE || Pos2 == SMDS_TOP_3DSPACE )
1044 else if ( Pos1 == SMDS_TOP_FACE || Pos2 == SMDS_TOP_FACE )
1046 if ( Pos1 != SMDS_TOP_FACE || Pos2 != SMDS_TOP_FACE )
1048 if ( Pos1 != SMDS_TOP_FACE ) std::swap( n1,n2 );
1049 TopoDS_Shape F = GetSubShapeByNode( n1, GetMeshDS() );
1050 TopoDS_Shape S = GetSubShapeByNode( n2, GetMeshDS() );
1051 if ( IsSubShape( S, F ))
1053 shapeType = TopAbs_FACE;
1054 shapeID = n1->getshapeId();
1058 else if ( Pos1 == SMDS_TOP_EDGE && Pos2 == SMDS_TOP_EDGE )
1060 TopoDS_Shape E1 = GetSubShapeByNode( n1, GetMeshDS() );
1061 TopoDS_Shape E2 = GetSubShapeByNode( n2, GetMeshDS() );
1062 shape = GetCommonAncestor( E1, E2, *myMesh, TopAbs_FACE );
1064 else if ( Pos1 == SMDS_TOP_VERTEX && Pos2 == SMDS_TOP_VERTEX )
1066 TopoDS_Shape V1 = GetSubShapeByNode( n1, GetMeshDS() );
1067 TopoDS_Shape V2 = GetSubShapeByNode( n2, GetMeshDS() );
1068 shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_EDGE );
1069 if ( shape.IsNull() ) shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_FACE );
1071 else // VERTEX and EDGE
1073 if ( Pos1 != SMDS_TOP_VERTEX ) std::swap( n1,n2 );
1074 TopoDS_Shape V = GetSubShapeByNode( n1, GetMeshDS() );
1075 TopoDS_Shape E = GetSubShapeByNode( n2, GetMeshDS() );
1076 if ( IsSubShape( V, E ))
1079 shape = GetCommonAncestor( V, E, *myMesh, TopAbs_FACE );
1083 if ( !shape.IsNull() )
1086 shapeID = GetMeshDS()->ShapeToIndex( shape );
1087 shapeType = shape.ShapeType();
1089 return make_pair( shapeID, shapeType );
1092 //=======================================================================
1093 //function : GetCentralNode
1094 //purpose : Return existing or create a new central node for a quardilateral
1095 // quadratic face given its 8 nodes.
1096 //@param : force3d - true means node creation in between the given nodes,
1097 // else node position is found on a geometrical face if any.
1098 //=======================================================================
1100 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1101 const SMDS_MeshNode* n2,
1102 const SMDS_MeshNode* n3,
1103 const SMDS_MeshNode* n4,
1104 const SMDS_MeshNode* n12,
1105 const SMDS_MeshNode* n23,
1106 const SMDS_MeshNode* n34,
1107 const SMDS_MeshNode* n41,
1110 SMDS_MeshNode *centralNode = 0; // central node to return
1112 // Find an existing central node
1114 TBiQuad keyOfMap(n1,n2,n3,n4);
1115 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1116 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1117 if ( itMapCentralNode != myMapWithCentralNode.end() )
1119 return (*itMapCentralNode).second;
1122 // Get type of shape for the new central node
1124 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1128 TopTools_ListIteratorOfListOfShape it;
1130 std::map< int, int > faceId2nbNodes;
1131 std::map< int, int > ::iterator itMapWithIdFace;
1133 SMESHDS_Mesh* meshDS = GetMeshDS();
1135 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1136 // on sub-shapes of the FACE
1137 if ( GetMesh()->HasShapeToMesh() )
1139 const SMDS_MeshNode* nodes[] = { n1, n2, n3, n4 };
1140 for(int i = 0; i < 4; i++)
1142 shape = GetSubShapeByNode( nodes[i], meshDS );
1143 if ( shape.IsNull() ) break;
1144 if ( shape.ShapeType() == TopAbs_SOLID )
1146 solidID = nodes[i]->getshapeId();
1147 shapeType = TopAbs_SOLID;
1150 if ( shape.ShapeType() == TopAbs_FACE )
1152 faceID = nodes[i]->getshapeId();
1153 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1154 itMapWithIdFace->second++;
1158 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1159 while ( const TopoDS_Shape* face = it->next() )
1161 faceID = meshDS->ShapeToIndex( *face );
1162 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1163 itMapWithIdFace->second++;
1168 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1170 // find ID of the FACE the four corner nodes belong to
1171 itMapWithIdFace = faceId2nbNodes.begin();
1172 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1174 if ( itMapWithIdFace->second == 4 )
1176 shapeType = TopAbs_FACE;
1177 faceID = (*itMapWithIdFace).first;
1184 if ( shapeType == TopAbs_FACE )
1186 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1193 bool toCheck = true;
1194 if ( !F.IsNull() && !force3d )
1196 uvAvg = calcTFI (0.5, 0.5,
1197 GetNodeUV(F,n1,n3,&toCheck), GetNodeUV(F,n2,n4,&toCheck),
1198 GetNodeUV(F,n3,n1,&toCheck), GetNodeUV(F,n4,n2,&toCheck),
1199 GetNodeUV(F,n12,n3), GetNodeUV(F,n23,n4),
1200 GetNodeUV(F,n34,n2), GetNodeUV(F,n41,n2));
1201 TopLoc_Location loc;
1202 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1203 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1204 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1205 // if ( mySetElemOnShape ) node is not elem!
1206 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1208 else // ( force3d || F.IsNull() )
1210 P = calcTFI (0.5, 0.5,
1211 SMESH_TNodeXYZ(n1), SMESH_TNodeXYZ(n2),
1212 SMESH_TNodeXYZ(n3), SMESH_TNodeXYZ(n4),
1213 SMESH_TNodeXYZ(n12), SMESH_TNodeXYZ(n23),
1214 SMESH_TNodeXYZ(n34), SMESH_TNodeXYZ(n41));
1215 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1217 if ( !F.IsNull() ) // force3d
1219 uvAvg = (GetNodeUV(F,n1,n3,&toCheck) +
1220 GetNodeUV(F,n2,n4,&toCheck) +
1221 GetNodeUV(F,n3,n1,&toCheck) +
1222 GetNodeUV(F,n4,n2,&toCheck)) / 4;
1223 //CheckNodeUV( F, centralNode, uvAvg, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1224 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1226 else if ( solidID > 0 )
1228 meshDS->SetNodeInVolume( centralNode, solidID );
1230 else if ( myShapeID > 0 && mySetElemOnShape )
1232 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1235 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1239 //=======================================================================
1240 //function : GetCentralNode
1241 //purpose : Return existing or create a new central node for a
1242 // quadratic triangle given its 6 nodes.
1243 //@param : force3d - true means node creation in between the given nodes,
1244 // else node position is found on a geometrical face if any.
1245 //=======================================================================
1247 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1248 const SMDS_MeshNode* n2,
1249 const SMDS_MeshNode* n3,
1250 const SMDS_MeshNode* n12,
1251 const SMDS_MeshNode* n23,
1252 const SMDS_MeshNode* n31,
1255 SMDS_MeshNode *centralNode = 0; // central node to return
1257 // Find an existing central node
1259 TBiQuad keyOfMap(n1,n2,n3);
1260 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1261 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1262 if ( itMapCentralNode != myMapWithCentralNode.end() )
1264 return (*itMapCentralNode).second;
1267 // Get type of shape for the new central node
1269 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1273 TopTools_ListIteratorOfListOfShape it;
1275 std::map< int, int > faceId2nbNodes;
1276 std::map< int, int > ::iterator itMapWithIdFace;
1278 SMESHDS_Mesh* meshDS = GetMeshDS();
1280 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1281 // on sub-shapes of the FACE
1282 if ( GetMesh()->HasShapeToMesh() )
1284 const SMDS_MeshNode* nodes[] = { n1, n2, n3 };
1285 for(int i = 0; i < 3; i++)
1287 shape = GetSubShapeByNode( nodes[i], meshDS );
1288 if ( shape.IsNull() ) break;
1289 if ( shape.ShapeType() == TopAbs_SOLID )
1291 solidID = nodes[i]->getshapeId();
1292 shapeType = TopAbs_SOLID;
1295 if ( shape.ShapeType() == TopAbs_FACE )
1297 faceID = nodes[i]->getshapeId();
1298 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1299 itMapWithIdFace->second++;
1303 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1304 while ( const TopoDS_Shape* face = it->next() )
1306 faceID = meshDS->ShapeToIndex( *face );
1307 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1308 itMapWithIdFace->second++;
1313 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1315 // find ID of the FACE the four corner nodes belong to
1316 itMapWithIdFace = faceId2nbNodes.begin();
1317 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1319 if ( itMapWithIdFace->second == 3 )
1321 shapeType = TopAbs_FACE;
1322 faceID = (*itMapWithIdFace).first;
1332 if ( shapeType == TopAbs_FACE )
1334 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1336 gp_XY uv1 = GetNodeUV( F, n1, n23, &check );
1337 gp_XY uv2 = GetNodeUV( F, n2, n31, &check );
1338 gp_XY uv3 = GetNodeUV( F, n3, n12, &check );
1339 gp_XY uv12 = GetNodeUV( F, n12, n3, &check );
1340 gp_XY uv23 = GetNodeUV( F, n23, n1, &check );
1341 gp_XY uv31 = GetNodeUV( F, n31, n2, &check );
1342 uvAvg = GetCenterUV( uv1,uv2,uv3, uv12,uv23,uv31, &badTria );
1347 // Create a central node
1350 if ( !F.IsNull() && !force3d )
1352 TopLoc_Location loc;
1353 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1354 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1355 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1356 // if ( mySetElemOnShape ) node is not elem!
1357 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1359 else // ( force3d || F.IsNull() )
1361 P = ( SMESH_TNodeXYZ( n12 ) +
1362 SMESH_TNodeXYZ( n23 ) +
1363 SMESH_TNodeXYZ( n31 ) ) / 3;
1364 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1366 if ( !F.IsNull() ) // force3d
1368 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1370 else if ( solidID > 0 )
1372 meshDS->SetNodeInVolume( centralNode, solidID );
1374 else if ( myShapeID > 0 && mySetElemOnShape )
1376 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1379 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1383 //=======================================================================
1384 //function : GetMediumNode
1385 //purpose : Return existing or create a new medium node between given ones
1386 //=======================================================================
1388 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
1389 const SMDS_MeshNode* n2,
1392 // Find existing node
1394 SMESH_TLink link(n1,n2);
1395 ItTLinkNode itLN = myTLinkNodeMap.find( link );
1396 if ( itLN != myTLinkNodeMap.end() ) {
1397 return (*itLN).second;
1400 // Create medium node
1403 SMESHDS_Mesh* meshDS = GetMeshDS();
1405 if ( IsSeamShape( n1->getshapeId() ))
1406 // to get a correct UV of a node on seam, the second node must have checked UV
1407 std::swap( n1, n2 );
1409 // get type of shape for the new medium node
1410 int faceID = -1, edgeID = -1;
1411 TopoDS_Edge E; double u [2];
1412 TopoDS_Face F; gp_XY uv[2];
1413 bool uvOK[2] = { false, false };
1415 pair<int, TopAbs_ShapeEnum> pos = GetMediumPos( n1, n2, mySetElemOnShape );
1416 // calling GetMediumPos() with useCurSubShape=mySetElemOnShape is OK only for the
1417 // case where the lower dim mesh is already constructed, else, nodes on EDGEs are
1418 // assigned to FACE, for example.
1420 // get positions of the given nodes on shapes
1421 if ( pos.second == TopAbs_FACE )
1423 F = TopoDS::Face(meshDS->IndexToShape( faceID = pos.first ));
1424 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
1425 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
1427 else if ( pos.second == TopAbs_EDGE )
1429 const SMDS_PositionPtr Pos1 = n1->GetPosition();
1430 const SMDS_PositionPtr Pos2 = n2->GetPosition();
1431 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1432 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1433 n1->getshapeId() != n2->getshapeId() )
1436 return getMediumNodeOnComposedWire(n1,n2,force3d);
1438 E = TopoDS::Edge(meshDS->IndexToShape( edgeID = pos.first ));
1440 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
1441 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
1443 catch ( Standard_Failure& f )
1445 // issue 22502 / a node is on VERTEX not belonging to E
1446 // issue 22568 / both nodes are on non-connected VERTEXes
1447 return getMediumNodeOnComposedWire(n1,n2,force3d);
1451 if ( !force3d & uvOK[0] && uvOK[1] )
1453 // we try to create medium node using UV parameters of
1454 // nodes, else - medium between corresponding 3d points
1457 //if ( uvOK[0] && uvOK[1] )
1459 if ( IsDegenShape( n1->getshapeId() )) {
1460 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
1461 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
1463 else if ( IsDegenShape( n2->getshapeId() )) {
1464 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
1465 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
1467 TopLoc_Location loc;
1468 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
1469 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
1470 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
1471 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1472 // if ( mySetElemOnShape ) node is not elem!
1473 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
1474 myTLinkNodeMap.insert(make_pair(link,n12));
1478 else if ( !E.IsNull() )
1481 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1484 Standard_Boolean isPeriodic = C->IsPeriodic();
1487 Standard_Real Period = C->Period();
1488 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1489 Standard_Real pmid = (u[0]+p)/2.;
1490 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1495 gp_Pnt P = C->Value( U );
1496 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1497 //if ( mySetElemOnShape ) node is not elem!
1498 meshDS->SetNodeOnEdge(n12, edgeID, U);
1499 myTLinkNodeMap.insert(make_pair(link,n12));
1506 double x = ( n1->X() + n2->X() )/2.;
1507 double y = ( n1->Y() + n2->Y() )/2.;
1508 double z = ( n1->Z() + n2->Z() )/2.;
1509 n12 = meshDS->AddNode(x,y,z);
1511 //if ( mySetElemOnShape ) node is not elem!
1515 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1516 CheckNodeUV( F, n12, UV, 2 * BRep_Tool::Tolerance( F ), /*force=*/true);
1517 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1519 else if ( !E.IsNull() )
1521 double U = ( u[0] + u[1] ) / 2.;
1522 CheckNodeU( E, n12, U, 2 * BRep_Tool::Tolerance( E ), /*force=*/true);
1523 meshDS->SetNodeOnEdge(n12, edgeID, U);
1525 else if ( myShapeID > 0 && mySetElemOnShape )
1527 meshDS->SetMeshElementOnShape(n12, myShapeID);
1531 myTLinkNodeMap.insert( make_pair( link, n12 ));
1535 //================================================================================
1537 * \brief Makes a medium node if nodes reside different edges
1539 //================================================================================
1541 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1542 const SMDS_MeshNode* n2,
1545 SMESH_TNodeXYZ p1( n1 ), p2( n2 );
1546 gp_Pnt middle = 0.5 * p1 + 0.5 * p2;
1547 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1549 // To find position on edge and 3D position for n12,
1550 // project <middle> to 2 edges and select projection most close to <middle>
1552 TopoDS_Edge bestEdge;
1553 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4], f,l;
1555 // get shapes under the nodes
1556 TopoDS_Shape shape[2];
1558 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1560 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1561 TopoDS_Shape S = GetSubShapeByNode( n, GetMeshDS() );
1563 shape[ nbShapes++ ] = S;
1566 vector< TopoDS_Shape > edges;
1567 for ( int iS = 0; iS < nbShapes; ++iS )
1569 switch ( shape[iS].ShapeType() ) {
1572 edges.push_back( shape[iS] );
1578 if ( nbShapes == 2 && iS==0 && shape[1-iS].ShapeType() == TopAbs_VERTEX )
1579 edge = GetCommonAncestor( shape[iS], shape[1-iS], *myMesh, TopAbs_EDGE );
1581 if ( edge.IsNull() )
1583 PShapeIteratorPtr eIt = GetAncestors( shape[iS], *myMesh, TopAbs_EDGE );
1584 while( const TopoDS_Shape* e = eIt->next() )
1585 edges.push_back( *e );
1591 if ( nbShapes == 1 || shape[1-iS].ShapeType() < TopAbs_EDGE )
1592 for ( TopExp_Explorer e( shape[iS], TopAbs_EDGE ); e.More(); e.Next() )
1593 edges.push_back( e.Current() );
1600 // project to get U of projection and distance from middle to projection
1601 for ( size_t iE = 0; iE < edges.size(); ++iE )
1603 const TopoDS_Edge& edge = TopoDS::Edge( edges[ iE ]);
1604 distXYZ[0] = distMiddleProj;
1606 CheckNodeU( edge, n12, testU, 2 * BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1607 if ( distXYZ[0] < distMiddleProj )
1609 distMiddleProj = distXYZ[0];
1615 // // both projections failed; set n12 on the edge of n1 with U of a common vertex
1616 // TopoDS_Vertex vCommon;
1617 // if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1618 // u = BRep_Tool::Parameter( vCommon, edges[0] );
1621 // double f,l, u0 = GetNodeU( edges[0], n1 );
1622 // BRep_Tool::Range( edges[0],f,l );
1623 // u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1626 // distMiddleProj = 0;
1629 if ( !bestEdge.IsNull() )
1631 // move n12 to position of a successfull projection
1632 //double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1633 if ( !force3d /*&& distMiddleProj > 2*tol*/ )
1635 TopLoc_Location loc;
1636 Handle(Geom_Curve) curve = BRep_Tool::Curve( bestEdge,loc,f,l );
1637 gp_Pnt p = curve->Value( u ).Transformed( loc );
1638 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1640 //if ( mySetElemOnShape ) node is not elem!
1642 int edgeID = GetMeshDS()->ShapeToIndex( bestEdge );
1643 if ( edgeID != n12->getshapeId() )
1644 GetMeshDS()->UnSetNodeOnShape( n12 );
1645 GetMeshDS()->SetNodeOnEdge(n12, edgeID, u);
1648 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1653 //=======================================================================
1654 //function : AddNode
1655 //purpose : Creates a node
1656 //=======================================================================
1658 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID,
1661 SMESHDS_Mesh * meshDS = GetMeshDS();
1662 SMDS_MeshNode* node = 0;
1664 node = meshDS->AddNodeWithID( x, y, z, ID );
1666 node = meshDS->AddNode( x, y, z );
1667 if ( mySetElemOnShape && myShapeID > 0 ) { // node is not elem ?
1668 switch ( myShape.ShapeType() ) {
1669 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1670 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1671 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID, u, v); break;
1672 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID, u); break;
1673 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1680 //=======================================================================
1681 //function : AddEdge
1682 //purpose : Creates quadratic or linear edge
1683 //=======================================================================
1685 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1686 const SMDS_MeshNode* n2,
1690 SMESHDS_Mesh * meshDS = GetMeshDS();
1692 SMDS_MeshEdge* edge = 0;
1693 if (myCreateQuadratic) {
1694 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1696 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1698 edge = meshDS->AddEdge(n1, n2, n12);
1702 edge = meshDS->AddEdgeWithID(n1, n2, id);
1704 edge = meshDS->AddEdge(n1, n2);
1707 if ( mySetElemOnShape && myShapeID > 0 )
1708 meshDS->SetMeshElementOnShape( edge, myShapeID );
1713 //=======================================================================
1714 //function : AddFace
1715 //purpose : Creates quadratic or linear triangle
1716 //=======================================================================
1718 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1719 const SMDS_MeshNode* n2,
1720 const SMDS_MeshNode* n3,
1724 SMESHDS_Mesh * meshDS = GetMeshDS();
1725 SMDS_MeshFace* elem = 0;
1727 if( n1==n2 || n2==n3 || n3==n1 )
1730 if(!myCreateQuadratic) {
1732 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1734 elem = meshDS->AddFace(n1, n2, n3);
1737 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1738 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1739 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1740 if(myCreateBiQuadratic)
1742 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n12, n23, n31, force3d);
1744 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, nCenter, id);
1746 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31, nCenter);
1751 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1753 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1756 if ( mySetElemOnShape && myShapeID > 0 )
1757 meshDS->SetMeshElementOnShape( elem, myShapeID );
1762 //=======================================================================
1763 //function : AddFace
1764 //purpose : Creates bi-quadratic, quadratic or linear quadrangle
1765 //=======================================================================
1767 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1768 const SMDS_MeshNode* n2,
1769 const SMDS_MeshNode* n3,
1770 const SMDS_MeshNode* n4,
1774 SMESHDS_Mesh * meshDS = GetMeshDS();
1775 SMDS_MeshFace* elem = 0;
1778 return AddFace(n1,n3,n4,id,force3d);
1781 return AddFace(n1,n2,n4,id,force3d);
1784 return AddFace(n1,n2,n3,id,force3d);
1787 return AddFace(n1,n2,n4,id,force3d);
1790 return AddFace(n1,n2,n3,id,force3d);
1793 return AddFace(n1,n2,n3,id,force3d);
1796 if(!myCreateQuadratic) {
1798 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1800 elem = meshDS->AddFace(n1, n2, n3, n4);
1803 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1804 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1805 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1806 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1807 if(myCreateBiQuadratic)
1809 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n4, n12, n23, n34, n41, force3d);
1811 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, nCenter, id);
1813 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41, nCenter);
1818 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1820 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1823 if ( mySetElemOnShape && myShapeID > 0 )
1824 meshDS->SetMeshElementOnShape( elem, myShapeID );
1829 //=======================================================================
1830 //function : AddPolygonalFace
1831 //purpose : Creates polygon, with additional nodes in quadratic mesh
1832 //=======================================================================
1834 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1838 SMESHDS_Mesh * meshDS = GetMeshDS();
1839 SMDS_MeshFace* elem = 0;
1841 if(!myCreateQuadratic) {
1843 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1845 elem = meshDS->AddPolygonalFace(nodes);
1848 vector<const SMDS_MeshNode*> newNodes;
1849 for ( int i = 0; i < nodes.size(); ++i )
1851 const SMDS_MeshNode* n1 = nodes[i];
1852 const SMDS_MeshNode* n2 = nodes[(i+1)%nodes.size()];
1853 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1854 newNodes.push_back( n1 );
1855 newNodes.push_back( n12 );
1858 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1860 elem = meshDS->AddPolygonalFace(newNodes);
1862 if ( mySetElemOnShape && myShapeID > 0 )
1863 meshDS->SetMeshElementOnShape( elem, myShapeID );
1868 //=======================================================================
1869 //function : AddVolume
1870 //purpose : Creates quadratic or linear prism
1871 //=======================================================================
1873 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1874 const SMDS_MeshNode* n2,
1875 const SMDS_MeshNode* n3,
1876 const SMDS_MeshNode* n4,
1877 const SMDS_MeshNode* n5,
1878 const SMDS_MeshNode* n6,
1882 SMESHDS_Mesh * meshDS = GetMeshDS();
1883 SMDS_MeshVolume* elem = 0;
1884 if(!myCreateQuadratic) {
1886 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1888 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1891 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1892 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1893 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1895 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1896 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1897 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1899 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1900 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1901 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1904 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1905 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1907 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1908 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1910 if ( mySetElemOnShape && myShapeID > 0 )
1911 meshDS->SetMeshElementOnShape( elem, myShapeID );
1916 //=======================================================================
1917 //function : AddVolume
1918 //purpose : Creates quadratic or linear tetrahedron
1919 //=======================================================================
1921 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1922 const SMDS_MeshNode* n2,
1923 const SMDS_MeshNode* n3,
1924 const SMDS_MeshNode* n4,
1928 SMESHDS_Mesh * meshDS = GetMeshDS();
1929 SMDS_MeshVolume* elem = 0;
1930 if(!myCreateQuadratic) {
1932 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1934 elem = meshDS->AddVolume(n1, n2, n3, n4);
1937 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1938 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1939 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1941 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1942 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1943 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1946 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1948 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1950 if ( mySetElemOnShape && myShapeID > 0 )
1951 meshDS->SetMeshElementOnShape( elem, myShapeID );
1956 //=======================================================================
1957 //function : AddVolume
1958 //purpose : Creates quadratic or linear pyramid
1959 //=======================================================================
1961 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1962 const SMDS_MeshNode* n2,
1963 const SMDS_MeshNode* n3,
1964 const SMDS_MeshNode* n4,
1965 const SMDS_MeshNode* n5,
1969 SMDS_MeshVolume* elem = 0;
1970 if(!myCreateQuadratic) {
1972 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1974 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1977 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1978 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1979 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1980 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1982 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1983 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1984 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
1985 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1988 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
1993 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
1995 n15, n25, n35, n45);
1997 if ( mySetElemOnShape && myShapeID > 0 )
1998 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
2003 //=======================================================================
2004 //function : AddVolume
2005 //purpose : Creates bi-quadratic, quadratic or linear hexahedron
2006 //=======================================================================
2008 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2009 const SMDS_MeshNode* n2,
2010 const SMDS_MeshNode* n3,
2011 const SMDS_MeshNode* n4,
2012 const SMDS_MeshNode* n5,
2013 const SMDS_MeshNode* n6,
2014 const SMDS_MeshNode* n7,
2015 const SMDS_MeshNode* n8,
2019 SMESHDS_Mesh * meshDS = GetMeshDS();
2020 SMDS_MeshVolume* elem = 0;
2021 if(!myCreateQuadratic) {
2023 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
2025 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
2028 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2029 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
2030 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
2031 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
2033 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
2034 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
2035 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
2036 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
2038 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
2039 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
2040 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
2041 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
2042 if(myCreateBiQuadratic)
2044 const SMDS_MeshNode* n1234 = GetCentralNode(n1,n2,n3,n4,n12,n23,n34,n41,force3d);
2045 const SMDS_MeshNode* n1256 = GetCentralNode(n1,n2,n5,n6,n12,n26,n56,n15,force3d);
2046 const SMDS_MeshNode* n2367 = GetCentralNode(n2,n3,n6,n7,n23,n37,n67,n26,force3d);
2047 const SMDS_MeshNode* n3478 = GetCentralNode(n3,n4,n7,n8,n34,n48,n78,n37,force3d);
2048 const SMDS_MeshNode* n1458 = GetCentralNode(n1,n4,n5,n8,n41,n48,n15,n85,force3d);
2049 const SMDS_MeshNode* n5678 = GetCentralNode(n5,n6,n7,n8,n56,n67,n78,n85,force3d);
2051 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
2053 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( n4 );
2054 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( n8 );
2055 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( n3 );
2056 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( n7 );
2057 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( n1 );
2058 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( n5 );
2059 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( n2 );
2060 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( n6 );
2062 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( n48 );
2063 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( n37 );
2064 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( n15 );
2065 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( n26 );
2066 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( n34 );
2067 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( n78 );
2068 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( n12 );
2069 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( n56 );
2070 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( n41 );
2071 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( n85 );
2072 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( n23 );
2073 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( n67 );
2075 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( n3478 );
2076 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( n1256 );
2077 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( n1458 );
2078 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( n2367 );
2079 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( n1234 );
2080 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( n5678 );
2082 gp_XYZ centerCube(0.5, 0.5, 0.5);
2084 SMESH_Block::ShellPoint( centerCube, pointsOnShapes, nCenterElem );
2085 const SMDS_MeshNode* nCenter =
2086 meshDS->AddNode( nCenterElem.X(), nCenterElem.Y(), nCenterElem.Z() );
2087 meshDS->SetNodeInVolume( nCenter, myShapeID );
2090 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2091 n12, n23, n34, n41, n56, n67,
2092 n78, n85, n15, n26, n37, n48,
2093 n1234, n1256, n2367, n3478, n1458, n5678, nCenter, id);
2095 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2096 n12, n23, n34, n41, n56, n67,
2097 n78, n85, n15, n26, n37, n48,
2098 n1234, n1256, n2367, n3478, n1458, n5678, nCenter);
2103 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2104 n12, n23, n34, n41, n56, n67,
2105 n78, n85, n15, n26, n37, n48, id);
2107 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2108 n12, n23, n34, n41, n56, n67,
2109 n78, n85, n15, n26, n37, n48);
2112 if ( mySetElemOnShape && myShapeID > 0 )
2113 meshDS->SetMeshElementOnShape( elem, myShapeID );
2118 //=======================================================================
2119 //function : AddVolume
2120 //purpose : Creates LINEAR!!!!!!!!! octahedron
2121 //=======================================================================
2123 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2124 const SMDS_MeshNode* n2,
2125 const SMDS_MeshNode* n3,
2126 const SMDS_MeshNode* n4,
2127 const SMDS_MeshNode* n5,
2128 const SMDS_MeshNode* n6,
2129 const SMDS_MeshNode* n7,
2130 const SMDS_MeshNode* n8,
2131 const SMDS_MeshNode* n9,
2132 const SMDS_MeshNode* n10,
2133 const SMDS_MeshNode* n11,
2134 const SMDS_MeshNode* n12,
2138 SMESHDS_Mesh * meshDS = GetMeshDS();
2139 SMDS_MeshVolume* elem = 0;
2141 elem = meshDS->AddVolumeWithID(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12,id);
2143 elem = meshDS->AddVolume(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12);
2144 if ( mySetElemOnShape && myShapeID > 0 )
2145 meshDS->SetMeshElementOnShape( elem, myShapeID );
2149 //=======================================================================
2150 //function : AddPolyhedralVolume
2151 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
2152 //=======================================================================
2155 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
2156 const std::vector<int>& quantities,
2160 SMESHDS_Mesh * meshDS = GetMeshDS();
2161 SMDS_MeshVolume* elem = 0;
2162 if(!myCreateQuadratic)
2165 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
2167 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
2171 vector<const SMDS_MeshNode*> newNodes;
2172 vector<int> newQuantities;
2173 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
2175 int nbNodesInFace = quantities[iFace];
2176 newQuantities.push_back(0);
2177 for ( int i = 0; i < nbNodesInFace; ++i )
2179 const SMDS_MeshNode* n1 = nodes[ iN + i ];
2180 newNodes.push_back( n1 );
2181 newQuantities.back()++;
2183 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
2184 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
2185 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
2187 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2188 newNodes.push_back( n12 );
2189 newQuantities.back()++;
2192 iN += nbNodesInFace;
2195 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
2197 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
2199 if ( mySetElemOnShape && myShapeID > 0 )
2200 meshDS->SetMeshElementOnShape( elem, myShapeID );
2207 //================================================================================
2209 * \brief Check if a node belongs to any face of sub-mesh
2211 //================================================================================
2213 bool isNodeInSubMesh( const SMDS_MeshNode* n, const SMESHDS_SubMesh* sm )
2215 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2216 while ( fIt->more() )
2217 if ( sm->Contains( fIt->next() ))
2223 //=======================================================================
2224 //function : IsSameElemGeometry
2225 //purpose : Returns true if all elements of a sub-mesh are of same shape
2226 //=======================================================================
2228 bool SMESH_MesherHelper::IsSameElemGeometry(const SMESHDS_SubMesh* smDS,
2229 SMDSAbs_GeometryType shape,
2230 const bool nullSubMeshRes)
2232 if ( !smDS ) return nullSubMeshRes;
2234 SMDS_ElemIteratorPtr elemIt = smDS->GetElements();
2235 while ( elemIt->more() ) {
2236 const SMDS_MeshElement* e = elemIt->next();
2237 if ( e->GetGeomType() != shape )
2243 //=======================================================================
2244 //function : LoadNodeColumns
2245 //purpose : Load nodes bound to face into a map of node columns
2246 //=======================================================================
2248 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2249 const TopoDS_Face& theFace,
2250 const TopoDS_Edge& theBaseEdge,
2251 SMESHDS_Mesh* theMesh,
2252 SMESH_ProxyMesh* theProxyMesh)
2254 return LoadNodeColumns(theParam2ColumnMap,
2256 std::list<TopoDS_Edge>(1,theBaseEdge),
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 std::list<TopoDS_Edge>& theBaseSide,
2269 SMESHDS_Mesh* theMesh,
2270 SMESH_ProxyMesh* theProxyMesh)
2272 // get a right sub-mesh of theFace
2274 const SMESHDS_SubMesh* faceSubMesh = 0;
2277 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
2278 if ( !faceSubMesh ||
2279 faceSubMesh->NbElements() == 0 ||
2280 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
2282 // can use a proxy sub-mesh with not temporary elements only
2288 faceSubMesh = theMesh->MeshElements( theFace );
2289 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
2292 if ( theParam2ColumnMap.empty() )
2294 // get data of edges for normalization of params
2295 vector< double > length;
2297 list<TopoDS_Edge>::const_iterator edge;
2299 for ( edge = theBaseSide.begin(); edge != theBaseSide.end(); ++edge )
2301 double len = std::max( 1e-10, SMESH_Algo::EdgeLength( *edge ));
2303 length.push_back( len );
2307 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
2308 edge = theBaseSide.begin();
2309 for ( int iE = 0; edge != theBaseSide.end(); ++edge, ++iE )
2311 map< double, const SMDS_MeshNode*> sortedBaseNN;
2312 SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN);
2313 if ( sortedBaseNN.empty() ) continue;
2315 map< double, const SMDS_MeshNode*>::iterator u_n = sortedBaseNN.begin();
2316 if ( theProxyMesh ) // from sortedBaseNN remove nodes not shared by faces of faceSubMesh
2318 const SMDS_MeshNode* n1 = (++sortedBaseNN.begin())->second;
2319 const SMDS_MeshNode* n2 = (++sortedBaseNN.rbegin())->second;
2320 bool allNodesAreProxy = ( n1 != theProxyMesh->GetProxyNode( n1 ) &&
2321 n2 != theProxyMesh->GetProxyNode( n2 ));
2322 if ( allNodesAreProxy )
2323 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2324 u_n->second = theProxyMesh->GetProxyNode( u_n->second );
2326 if ( u_n = sortedBaseNN.begin(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2328 while ( ++u_n != sortedBaseNN.end() && !isNodeInSubMesh( u_n->second, faceSubMesh ));
2329 sortedBaseNN.erase( sortedBaseNN.begin(), u_n );
2331 if ( !sortedBaseNN.empty() )
2332 if ( u_n = --sortedBaseNN.end(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2334 while ( u_n != sortedBaseNN.begin() && !isNodeInSubMesh( (--u_n)->second, faceSubMesh ));
2335 sortedBaseNN.erase( ++u_n, sortedBaseNN.end() );
2337 if ( sortedBaseNN.empty() ) continue;
2341 BRep_Tool::Range( *edge, f, l );
2342 if ( edge->Orientation() == TopAbs_REVERSED ) std::swap( f, l );
2343 const double coeff = 1. / ( l - f ) * length[iE] / fullLen;
2344 const double prevPar = theParam2ColumnMap.empty() ? 0 : theParam2ColumnMap.rbegin()->first;
2345 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2347 double par = prevPar + coeff * ( u_n->first - f );
2348 TParam2ColumnMap::iterator u2nn =
2349 theParam2ColumnMap.insert( theParam2ColumnMap.end(), make_pair( par, TNodeColumn()));
2350 u2nn->second.push_back( u_n->second );
2353 if ( theParam2ColumnMap.size() < 2 )
2358 int prevNbRows = theParam2ColumnMap.begin()->second.size(); // current, at least 1 here
2359 int expectedNbRows = faceSubMesh->NbElements() / ( theParam2ColumnMap.size()-1 ); // to be added
2361 // fill theParam2ColumnMap column by column by passing from nodes on
2362 // theBaseEdge up via mesh faces on theFace
2364 TParam2ColumnMap::iterator par_nVec_1, par_nVec_2;
2365 par_nVec_2 = theParam2ColumnMap.begin();
2366 par_nVec_1 = par_nVec_2++;
2367 TIDSortedElemSet emptySet, avoidSet;
2368 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
2370 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
2371 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
2372 nCol1.resize( prevNbRows + expectedNbRows );
2373 nCol2.resize( prevNbRows + expectedNbRows );
2375 int i1, i2, foundNbRows = 0;
2376 const SMDS_MeshNode *n1 = nCol1[ prevNbRows-1 ];
2377 const SMDS_MeshNode *n2 = nCol2[ prevNbRows-1 ];
2378 // find face sharing node n1 and n2 and belonging to faceSubMesh
2379 while ( const SMDS_MeshElement* face =
2380 SMESH_MeshAlgos::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
2382 if ( faceSubMesh->Contains( face ))
2384 int nbNodes = face->NbCornerNodes();
2387 if ( foundNbRows + 1 > expectedNbRows )
2389 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
2390 n2 = face->GetNode( (i1+2) % 4 );
2391 nCol1[ prevNbRows + foundNbRows] = n1;
2392 nCol2[ prevNbRows + foundNbRows] = n2;
2395 avoidSet.insert( face );
2397 if ( foundNbRows != expectedNbRows )
2401 return ( theParam2ColumnMap.size() > 1 &&
2402 theParam2ColumnMap.begin()->second.size() == prevNbRows + expectedNbRows );
2407 //================================================================================
2409 * \brief Return true if a node is at a corner of a 2D structured mesh of FACE
2411 //================================================================================
2413 bool isCornerOfStructure( const SMDS_MeshNode* n,
2414 const SMESHDS_SubMesh* faceSM,
2415 SMESH_MesherHelper& faceAnalyser )
2417 int nbFacesInSM = 0;
2419 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2420 while ( fIt->more() )
2421 nbFacesInSM += faceSM->Contains( fIt->next() );
2423 if ( nbFacesInSM == 1 )
2426 if ( nbFacesInSM == 2 && n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
2428 return faceAnalyser.IsRealSeam( n->getshapeId() );
2434 //=======================================================================
2435 //function : IsStructured
2436 //purpose : Return true if 2D mesh on FACE is structured
2437 //=======================================================================
2439 bool SMESH_MesherHelper::IsStructured( SMESH_subMesh* faceSM )
2441 SMESHDS_SubMesh* fSM = faceSM->GetSubMeshDS();
2442 if ( !fSM || fSM->NbElements() == 0 )
2445 list< TopoDS_Edge > edges;
2446 list< int > nbEdgesInWires;
2447 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( faceSM->GetSubShape() ),
2448 edges, nbEdgesInWires );
2449 if ( nbWires != 1 /*|| nbEdgesInWires.front() != 4*/ ) // allow composite sides
2452 // algo: find corners of a structure and then analyze nb of faces and
2453 // length of structure sides
2455 SMESHDS_Mesh* meshDS = faceSM->GetFather()->GetMeshDS();
2456 SMESH_MesherHelper faceAnalyser( *faceSM->GetFather() );
2457 faceAnalyser.SetSubShape( faceSM->GetSubShape() );
2459 // rotate edges to get the first node being at corner
2460 // (in principle it's not necessary but so far none SALOME algo can make
2461 // such a structured mesh that all corner nodes are not on VERTEXes)
2462 bool isCorner = false;
2463 int nbRemainEdges = nbEdgesInWires.front();
2465 TopoDS_Vertex V = IthVertex( 0, edges.front() );
2466 isCorner = isCornerOfStructure( SMESH_Algo::VertexNode( V, meshDS ),
2469 edges.splice( edges.end(), edges, edges.begin() );
2473 while ( !isCorner && nbRemainEdges > 0 );
2478 // get all nodes from EDGEs
2479 list< const SMDS_MeshNode* > nodes;
2480 list< TopoDS_Edge >::iterator edge = edges.begin();
2481 for ( ; edge != edges.end(); ++edge )
2483 map< double, const SMDS_MeshNode* > u2Nodes;
2484 if ( !SMESH_Algo::GetSortedNodesOnEdge( meshDS, *edge,
2485 /*skipMedium=*/true, u2Nodes ))
2488 list< const SMDS_MeshNode* > edgeNodes;
2489 map< double, const SMDS_MeshNode* >::iterator u2n = u2Nodes.begin();
2490 for ( ; u2n != u2Nodes.end(); ++u2n )
2491 edgeNodes.push_back( u2n->second );
2492 if ( edge->Orientation() == TopAbs_REVERSED )
2493 edgeNodes.reverse();
2495 if ( !nodes.empty() && nodes.back() == edgeNodes.front() )
2496 edgeNodes.pop_front();
2497 nodes.splice( nodes.end(), edgeNodes, edgeNodes.begin(), edgeNodes.end() );
2500 // get length of structured sides
2501 vector<int> nbEdgesInSide;
2503 list< const SMDS_MeshNode* >::iterator n = ++nodes.begin();
2504 for ( ; n != nodes.end(); ++n )
2507 if ( isCornerOfStructure( *n, fSM, faceAnalyser )) {
2508 nbEdgesInSide.push_back( nbEdges );
2514 if ( nbEdgesInSide.size() != 4 )
2516 if ( nbEdgesInSide[0] != nbEdgesInSide[2] )
2518 if ( nbEdgesInSide[1] != nbEdgesInSide[3] )
2520 if ( nbEdgesInSide[0] * nbEdgesInSide[1] != fSM->NbElements() )
2526 //================================================================================
2528 * \brief Find out elements orientation on a geometrical face
2529 * \param theFace - The face correctly oriented in the shape being meshed
2530 * \retval bool - true if the face normal and the normal of first element
2531 * in the correspoding submesh point in different directions
2533 //================================================================================
2535 bool SMESH_MesherHelper::IsReversedSubMesh (const TopoDS_Face& theFace)
2537 if ( theFace.IsNull() )
2540 // find out orientation of a meshed face
2541 int faceID = GetMeshDS()->ShapeToIndex( theFace );
2542 TopoDS_Shape aMeshedFace = GetMeshDS()->IndexToShape( faceID );
2543 bool isReversed = ( theFace.Orientation() != aMeshedFace.Orientation() );
2545 const SMESHDS_SubMesh * aSubMeshDSFace = GetMeshDS()->MeshElements( faceID );
2546 if ( !aSubMeshDSFace )
2549 // find an element with a good normal
2551 bool normalOK = false;
2553 SMDS_ElemIteratorPtr iteratorElem = aSubMeshDSFace->GetElements();
2554 while ( !normalOK && iteratorElem->more() ) // loop on elements on theFace
2556 const SMDS_MeshElement* elem = iteratorElem->next();
2557 if ( elem && elem->NbCornerNodes() > 2 )
2559 SMESH_TNodeXYZ nPnt[3];
2560 SMDS_ElemIteratorPtr nodesIt = elem->nodesIterator();
2561 int iNodeOnFace = 0, iPosDim = SMDS_TOP_VERTEX;
2562 for ( int iN = 0; nodesIt->more() && iN < 3; ++iN) // loop on nodes
2564 nPnt[ iN ] = nodesIt->next();
2565 if ( nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition() > iPosDim )
2568 iPosDim = nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition();
2572 gp_Vec v01( nPnt[0], nPnt[1] ), v02( nPnt[0], nPnt[2] );
2573 if ( v01.SquareMagnitude() > RealSmall() &&
2574 v02.SquareMagnitude() > RealSmall() )
2577 if (( normalOK = ( Ne.SquareMagnitude() > RealSmall() )))
2578 uv = GetNodeUV( theFace, nPnt[iNodeOnFace]._node, 0, &normalOK );
2585 // face normal at node position
2586 TopLoc_Location loc;
2587 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
2588 // if ( surf.IsNull() || surf->Continuity() < GeomAbs_C1 )
2589 // some surfaces not detected as GeomAbs_C1 are nevertheless correct for meshing
2590 if ( surf.IsNull() || surf->Continuity() < GeomAbs_C0 )
2593 MESSAGE("surf->Continuity() < GeomAbs_C1 " << (surf->Continuity() < GeomAbs_C1));
2596 gp_Vec d1u, d1v; gp_Pnt p;
2597 surf->D1( uv.X(), uv.Y(), p, d1u, d1v );
2598 gp_Vec Nf = (d1u ^ d1v).Transformed( loc );
2600 if ( theFace.Orientation() == TopAbs_REVERSED )
2603 return Ne * Nf < 0.;
2606 //=======================================================================
2608 //purpose : Count nb of sub-shapes
2609 //=======================================================================
2611 int SMESH_MesherHelper::Count(const TopoDS_Shape& shape,
2612 const TopAbs_ShapeEnum type,
2613 const bool ignoreSame)
2616 TopTools_IndexedMapOfShape map;
2617 TopExp::MapShapes( shape, type, map );
2618 return map.Extent();
2622 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2628 //=======================================================================
2629 //function : NbAncestors
2630 //purpose : Return number of unique ancestors of the shape
2631 //=======================================================================
2633 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
2634 const SMESH_Mesh& mesh,
2635 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
2637 TopTools_MapOfShape ancestors;
2638 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
2639 for ( ; ansIt.More(); ansIt.Next() ) {
2640 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
2641 ancestors.Add( ansIt.Value() );
2643 return ancestors.Extent();
2646 //=======================================================================
2647 //function : GetSubShapeOri
2648 //purpose : Return orientation of sub-shape in the main shape
2649 //=======================================================================
2651 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
2652 const TopoDS_Shape& subShape)
2654 TopAbs_Orientation ori = TopAbs_Orientation(-1);
2655 if ( !shape.IsNull() && !subShape.IsNull() )
2657 TopExp_Explorer e( shape, subShape.ShapeType() );
2658 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
2659 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
2660 for ( ; e.More(); e.Next())
2661 if ( subShape.IsSame( e.Current() ))
2664 ori = e.Current().Orientation();
2669 //=======================================================================
2670 //function : IsSubShape
2672 //=======================================================================
2674 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
2675 const TopoDS_Shape& mainShape )
2677 if ( !shape.IsNull() && !mainShape.IsNull() )
2679 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
2682 if ( shape.IsSame( exp.Current() ))
2685 SCRUTE((shape.IsNull()));
2686 SCRUTE((mainShape.IsNull()));
2690 //=======================================================================
2691 //function : IsSubShape
2693 //=======================================================================
2695 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
2697 if ( shape.IsNull() || !aMesh )
2700 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
2702 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
2705 //================================================================================
2707 * \brief Return maximal tolerance of shape
2709 //================================================================================
2711 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
2713 double tol = Precision::Confusion();
2714 TopExp_Explorer exp;
2715 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
2716 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
2717 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
2718 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
2719 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
2720 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
2725 //================================================================================
2727 * \brief Return an angle between two EDGEs sharing a common VERTEX with reference
2728 * of the FACE normal
2729 * \return double - the angle (between -Pi and Pi), negative if the angle is concave,
2730 * 1e100 in case of failure
2731 * \waring Care about order of the EDGEs and their orientation to be as they are
2732 * within the FACE! Don't pass degenerated EDGEs neither!
2734 //================================================================================
2736 double SMESH_MesherHelper::GetAngle( const TopoDS_Edge & theE1,
2737 const TopoDS_Edge & theE2,
2738 const TopoDS_Face & theFace,
2739 const TopoDS_Vertex & theCommonV,
2740 gp_Vec* theFaceNormal)
2742 double angle = 1e100;
2746 Handle(Geom_Curve) c1 = BRep_Tool::Curve( theE1, f,l );
2747 Handle(Geom_Curve) c2 = BRep_Tool::Curve( theE2, f,l );
2748 Handle(Geom2d_Curve) c2d1 = BRep_Tool::CurveOnSurface( theE1, theFace, f,l );
2749 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace );
2750 double p1 = BRep_Tool::Parameter( theCommonV, theE1 );
2751 double p2 = BRep_Tool::Parameter( theCommonV, theE2 );
2752 if ( c1.IsNull() || c2.IsNull() )
2754 gp_XY uv = c2d1->Value( p1 ).XY();
2755 gp_Vec du, dv; gp_Pnt p;
2756 surf->D1( uv.X(), uv.Y(), p, du, dv );
2757 gp_Vec vec1, vec2, vecRef = du ^ dv;
2760 while ( vecRef.SquareMagnitude() < 1e-25 )
2762 double dp = ( l - f ) / 1000.;
2763 p1tmp += dp * (( Abs( p1 - f ) > Abs( p1 - l )) ? -1. : +1.);
2764 uv = c2d1->Value( p1tmp ).XY();
2765 surf->D1( uv.X(), uv.Y(), p, du, dv );
2767 if ( ++nbLoops > 10 )
2770 cout << "SMESH_MesherHelper::GetAngle(): Captured in a sigularity" << endl;
2775 if ( theFace.Orientation() == TopAbs_REVERSED )
2777 if ( theFaceNormal ) *theFaceNormal = vecRef;
2779 c1->D1( p1, p, vec1 );
2780 c2->D1( p2, p, vec2 );
2781 // TopoDS_Face F = theFace;
2782 // if ( F.Orientation() == TopAbs_INTERNAL )
2783 // F.Orientation( TopAbs_FORWARD );
2784 if ( theE1.Orientation() /*GetSubShapeOri( F, theE1 )*/ == TopAbs_REVERSED )
2786 if ( theE2.Orientation() /*GetSubShapeOri( F, theE2 )*/ == TopAbs_REVERSED )
2788 angle = vec1.AngleWithRef( vec2, vecRef );
2790 if ( Abs ( angle ) >= 0.99 * M_PI )
2792 BRep_Tool::Range( theE1, f, l );
2793 p1 += 1e-7 * ( p1-f < l-p1 ? +1. : -1. );
2794 c1->D1( p1, p, vec1 );
2795 if ( theE1.Orientation() == TopAbs_REVERSED )
2797 BRep_Tool::Range( theE2, f, l );
2798 p2 += 1e-7 * ( p2-f < l-p2 ? +1. : -1. );
2799 c2->D1( p2, p, vec2 );
2800 if ( theE2.Orientation() == TopAbs_REVERSED )
2802 angle = vec1.AngleWithRef( vec2, vecRef );
2811 //================================================================================
2813 * \brief Check if the first and last vertices of an edge are the same
2814 * \param anEdge - the edge to check
2815 * \retval bool - true if same
2817 //================================================================================
2819 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
2821 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2822 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
2823 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
2826 //================================================================================
2828 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
2829 * in the case of INTERNAL edge
2831 //================================================================================
2833 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
2837 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2838 anEdge.Orientation( TopAbs_FORWARD );
2840 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
2841 TopoDS_Iterator vIt( anEdge, CumOri );
2842 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
2845 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
2848 //================================================================================
2850 * \brief Return type of shape contained in a group
2851 * \param group - a shape of type TopAbs_COMPOUND
2852 * \param avoidCompound - not to return TopAbs_COMPOUND
2854 //================================================================================
2856 TopAbs_ShapeEnum SMESH_MesherHelper::GetGroupType(const TopoDS_Shape& group,
2857 const bool avoidCompound)
2859 if ( !group.IsNull() )
2861 if ( group.ShapeType() != TopAbs_COMPOUND )
2862 return group.ShapeType();
2864 // iterate on a compound
2865 TopoDS_Iterator it( group );
2867 return avoidCompound ? GetGroupType( it.Value() ) : it.Value().ShapeType();
2869 return TopAbs_SHAPE;
2872 //=======================================================================
2873 //function : IsQuadraticMesh
2874 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
2875 // quadratic elements will be created.
2876 // Used then generated 3D mesh without geometry.
2877 //=======================================================================
2879 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
2881 int NbAllEdgsAndFaces=0;
2882 int NbQuadFacesAndEdgs=0;
2883 int NbFacesAndEdges=0;
2884 //All faces and edges
2885 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
2886 if ( NbAllEdgsAndFaces == 0 )
2887 return SMESH_MesherHelper::LINEAR;
2889 //Quadratic faces and edges
2890 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
2892 //Linear faces and edges
2893 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
2895 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
2897 return SMESH_MesherHelper::QUADRATIC;
2899 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
2901 return SMESH_MesherHelper::LINEAR;
2904 //Mesh with both type of elements
2905 return SMESH_MesherHelper::COMP;
2908 //=======================================================================
2909 //function : GetOtherParam
2910 //purpose : Return an alternative parameter for a node on seam
2911 //=======================================================================
2913 double SMESH_MesherHelper::GetOtherParam(const double param) const
2915 int i = myParIndex & U_periodic ? 0 : 1;
2916 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
2921 //=======================================================================
2923 * \brief Iterator on ancestors of the given type
2925 //=======================================================================
2927 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
2929 TopTools_ListIteratorOfListOfShape _ancIter;
2930 TopAbs_ShapeEnum _type;
2931 TopTools_MapOfShape _encountered;
2932 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
2933 : _ancIter( ancestors ), _type( type )
2935 if ( _ancIter.More() ) {
2936 if ( _ancIter.Value().ShapeType() != _type ) next();
2937 else _encountered.Add( _ancIter.Value() );
2942 return _ancIter.More();
2944 virtual const TopoDS_Shape* next()
2946 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
2947 if ( _ancIter.More() )
2948 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
2949 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
2957 //=======================================================================
2959 * \brief Return iterator on ancestors of the given type
2961 //=======================================================================
2963 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
2964 const SMESH_Mesh& mesh,
2965 TopAbs_ShapeEnum ancestorType)
2967 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
2970 //=======================================================================
2971 //function : GetCommonAncestor
2972 //purpose : Find a common ancestors of two shapes of the given type
2973 //=======================================================================
2975 TopoDS_Shape SMESH_MesherHelper::GetCommonAncestor(const TopoDS_Shape& shape1,
2976 const TopoDS_Shape& shape2,
2977 const SMESH_Mesh& mesh,
2978 TopAbs_ShapeEnum ancestorType)
2980 TopoDS_Shape commonAnc;
2981 if ( !shape1.IsNull() && !shape2.IsNull() )
2983 PShapeIteratorPtr ancIt = GetAncestors( shape1, mesh, ancestorType );
2984 while ( const TopoDS_Shape* anc = ancIt->next() )
2985 if ( IsSubShape( shape2, *anc ))
2994 //#include <Perf_Meter.hxx>
2996 //=======================================================================
2997 namespace { // Structures used by FixQuadraticElements()
2998 //=======================================================================
3000 #define __DMP__(txt) \
3002 #define MSG(txt) __DMP__(txt<<endl)
3003 #define MSGBEG(txt) __DMP__(txt)
3005 //const double straightTol2 = 1e-33; // to detect straing links
3006 bool isStraightLink(double linkLen2, double middleNodeMove2)
3008 // straight if <node move> < 1/15 * <link length>
3009 return middleNodeMove2 < 1/15./15. * linkLen2;
3013 // ---------------------------------------
3015 * \brief Quadratic link knowing its faces
3017 struct QLink: public SMESH_TLink
3019 const SMDS_MeshNode* _mediumNode;
3020 mutable vector<const QFace* > _faces;
3021 mutable gp_Vec _nodeMove;
3022 mutable int _nbMoves;
3024 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
3025 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
3027 //if ( MediumPos() != SMDS_TOP_3DSPACE )
3028 _nodeMove = MediumPnt() - MiddlePnt();
3030 void SetContinuesFaces() const;
3031 const QFace* GetContinuesFace( const QFace* face ) const;
3032 bool OnBoundary() const;
3033 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
3034 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
3036 SMDS_TypeOfPosition MediumPos() const
3037 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
3038 SMDS_TypeOfPosition EndPos(bool isSecond) const
3039 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
3040 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
3041 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
3043 void Move(const gp_Vec& move, bool sum=false) const
3044 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
3045 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
3046 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
3047 bool IsStraight() const
3048 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
3049 _nodeMove.SquareMagnitude());
3051 bool operator<(const QLink& other) const {
3052 return (node1()->GetID() == other.node1()->GetID() ?
3053 node2()->GetID() < other.node2()->GetID() :
3054 node1()->GetID() < other.node1()->GetID());
3056 // struct PtrComparator {
3057 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
3060 // ---------------------------------------------------------
3062 * \brief Link in the chain of links; it connects two faces
3066 const QLink* _qlink;
3067 mutable const QFace* _qfaces[2];
3069 TChainLink(const QLink* qlink=0):_qlink(qlink) {
3070 _qfaces[0] = _qfaces[1] = 0;
3072 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
3074 bool IsBoundary() const { return !_qfaces[1]; }
3076 void RemoveFace( const QFace* face ) const
3077 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
3079 const QFace* NextFace( const QFace* f ) const
3080 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
3082 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
3083 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
3085 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
3087 operator bool() const { return (_qlink); }
3089 const QLink* operator->() const { return _qlink; }
3091 gp_Vec Normal() const;
3093 bool IsStraight() const;
3095 // --------------------------------------------------------------------
3096 typedef list< TChainLink > TChain;
3097 typedef set < TChainLink > TLinkSet;
3098 typedef TLinkSet::const_iterator TLinkInSet;
3100 const int theFirstStep = 5;
3102 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
3103 // --------------------------------------------------------------------
3105 * \brief Quadratic face shared by two volumes and bound by QLinks
3107 struct QFace: public TIDSortedNodeSet
3109 mutable const SMDS_MeshElement* _volumes[2];
3110 mutable vector< const QLink* > _sides;
3111 mutable bool _sideIsAdded[4]; // added in chain of links
3114 mutable const SMDS_MeshElement* _face;
3117 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
3119 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
3121 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
3123 void AddSelfToLinks() const {
3124 for ( int i = 0; i < _sides.size(); ++i )
3125 _sides[i]->_faces.push_back( this );
3127 int LinkIndex( const QLink* side ) const {
3128 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
3131 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
3133 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
3135 int i = LinkIndex( link._qlink );
3136 if ( i < 0 ) return true;
3137 _sideIsAdded[i] = true;
3138 link.SetFace( this );
3139 // continue from opposite link
3140 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
3142 bool IsBoundary() const { return !_volumes[1]; }
3144 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
3146 bool IsSpoiled(const QLink* bentLink ) const;
3148 TLinkInSet GetBoundaryLink( const TLinkSet& links,
3149 const TChainLink& avoidLink,
3150 TLinkInSet * notBoundaryLink = 0,
3151 const SMDS_MeshNode* nodeToContain = 0,
3152 bool * isAdjacentUsed = 0,
3153 int nbRecursionsLeft = -1) const;
3155 TLinkInSet GetLinkByNode( const TLinkSet& links,
3156 const TChainLink& avoidLink,
3157 const SMDS_MeshNode* nodeToContain) const;
3159 const SMDS_MeshNode* GetNodeInFace() const {
3160 for ( int iL = 0; iL < _sides.size(); ++iL )
3161 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
3165 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
3167 double MoveByBoundary( const TChainLink& theLink,
3168 const gp_Vec& theRefVec,
3169 const TLinkSet& theLinks,
3170 SMESH_MesherHelper* theFaceHelper=0,
3171 const double thePrevLen=0,
3172 const int theStep=theFirstStep,
3173 gp_Vec* theLinkNorm=0,
3174 double theSign=1.0) const;
3177 //================================================================================
3179 * \brief Dump QLink and QFace
3181 ostream& operator << (ostream& out, const QLink& l)
3183 out <<"QLink nodes: "
3184 << l.node1()->GetID() << " - "
3185 << l._mediumNode->GetID() << " - "
3186 << l.node2()->GetID() << endl;
3189 ostream& operator << (ostream& out, const QFace& f)
3191 out <<"QFace nodes: "/*<< &f << " "*/;
3192 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
3193 out << (*n)->GetID() << " ";
3194 out << " \tvolumes: "
3195 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
3196 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
3197 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
3201 //================================================================================
3203 * \brief Construct QFace from QLinks
3205 //================================================================================
3207 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
3209 _volumes[0] = _volumes[1] = 0;
3211 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
3212 _normal.SetCoord(0,0,0);
3213 for ( int i = 1; i < _sides.size(); ++i ) {
3214 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
3215 insert( l1->node1() ); insert( l1->node2() );
3217 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
3218 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
3219 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
3223 double normSqSize = _normal.SquareMagnitude();
3224 if ( normSqSize > numeric_limits<double>::min() )
3225 _normal /= sqrt( normSqSize );
3227 _normal.SetCoord(1e-33,0,0);
3233 //================================================================================
3235 * \brief Make up a chain of links
3236 * \param iSide - link to add first
3237 * \param chain - chain to fill in
3238 * \param pos - postion of medium nodes the links should have
3239 * \param error - out, specifies what is wrong
3240 * \retval bool - false if valid chain can't be built; "valid" means that links
3241 * of the chain belongs to rectangles bounding hexahedrons
3243 //================================================================================
3245 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
3247 if ( iSide >= _sides.size() ) // wrong argument iSide
3249 if ( _sideIsAdded[ iSide ]) // already in chain
3252 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
3255 list< const QFace* > faces( 1, this );
3256 while ( !faces.empty() ) {
3257 const QFace* face = faces.front();
3258 for ( int i = 0; i < face->_sides.size(); ++i ) {
3259 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
3260 face->_sideIsAdded[i] = true;
3261 // find a face side in the chain
3262 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
3263 // TChain::iterator chLink = chain.begin();
3264 // for ( ; chLink != chain.end(); ++chLink )
3265 // if ( chLink->_qlink == face->_sides[i] )
3267 // if ( chLink == chain.end() )
3268 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
3269 // add a face to a chained link and put a continues face in the queue
3270 chLink->SetFace( face );
3271 if ( face->_sides[i]->MediumPos() == pos )
3272 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
3273 if ( contFace->_sides.size() == 3 )
3274 faces.push_back( contFace );
3279 if ( error < ERR_TRI )
3281 chain.insert( chain.end(), links.begin(),links.end() );
3284 _sideIsAdded[iSide] = true; // not to add this link to chain again
3285 const QLink* link = _sides[iSide];
3289 // add link into chain
3290 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
3291 chLink->SetFace( this );
3294 // propagate from a quadrangle to neighbour faces
3295 if ( link->MediumPos() >= pos ) {
3296 int nbLinkFaces = link->_faces.size();
3297 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
3298 // hexahedral mesh or boundary quadrangles - goto a continous face
3299 if ( const QFace* f = link->GetContinuesFace( this ))
3300 if ( f->_sides.size() == 4 )
3301 return f->GetLinkChain( *chLink, chain, pos, error );
3304 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
3305 for ( int i = 0; i < nbLinkFaces; ++i )
3306 if ( link->_faces[i] )
3307 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
3308 if ( error < ERR_PRISM )
3316 //================================================================================
3318 * \brief Return a boundary link of the triangle face
3319 * \param links - set of all links
3320 * \param avoidLink - link not to return
3321 * \param notBoundaryLink - out, neither the returned link nor avoidLink
3322 * \param nodeToContain - node the returned link must contain; if provided, search
3323 * also performed on adjacent faces
3324 * \param isAdjacentUsed - returns true if link is found in adjacent faces
3325 * \param nbRecursionsLeft - to limit recursion
3327 //================================================================================
3329 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
3330 const TChainLink& avoidLink,
3331 TLinkInSet * notBoundaryLink,
3332 const SMDS_MeshNode* nodeToContain,
3333 bool * isAdjacentUsed,
3334 int nbRecursionsLeft) const
3336 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
3338 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
3339 TFaceLinkList adjacentFaces;
3341 for ( int iL = 0; iL < _sides.size(); ++iL )
3343 if ( avoidLink._qlink == _sides[iL] )
3345 TLinkInSet link = links.find( _sides[iL] );
3346 if ( link == linksEnd ) continue;
3347 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
3348 continue; // We work on faces here, don't go inside a solid
3351 if ( link->IsBoundary() ) {
3352 if ( !nodeToContain ||
3353 (*link)->node1() == nodeToContain ||
3354 (*link)->node2() == nodeToContain )
3356 boundaryLink = link;
3357 if ( !notBoundaryLink ) break;
3360 else if ( notBoundaryLink ) {
3361 *notBoundaryLink = link;
3362 if ( boundaryLink != linksEnd ) break;
3365 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
3366 if ( const QFace* adj = link->NextFace( this ))
3367 if ( adj->Contains( nodeToContain ))
3368 adjacentFaces.push_back( make_pair( adj, link ));
3371 if ( isAdjacentUsed ) *isAdjacentUsed = false;
3372 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
3374 if ( nbRecursionsLeft < 0 )
3375 nbRecursionsLeft = nodeToContain->NbInverseElements();
3376 TFaceLinkList::iterator adj = adjacentFaces.begin();
3377 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
3378 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
3379 isAdjacentUsed, nbRecursionsLeft-1);
3380 if ( isAdjacentUsed ) *isAdjacentUsed = true;
3382 return boundaryLink;
3384 //================================================================================
3386 * \brief Return a link ending at the given node but not avoidLink
3388 //================================================================================
3390 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
3391 const TChainLink& avoidLink,
3392 const SMDS_MeshNode* nodeToContain) const
3394 for ( int i = 0; i < _sides.size(); ++i )
3395 if ( avoidLink._qlink != _sides[i] &&
3396 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
3397 return links.find( _sides[ i ]);
3401 //================================================================================
3403 * \brief Return normal to the i-th side pointing outside the face
3405 //================================================================================
3407 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
3409 gp_Vec norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3410 gp_XYZ pIn = ( _sides[ (i+1)%3 ]->MiddlePnt() +
3411 _sides[ (i+2)%3 ]->MiddlePnt() ) / 2.;
3412 gp_Vec vecOut = ( _sides[i]->MiddlePnt() - pIn );
3414 if ( norm * vecOut < 0 )
3416 double mag2 = norm.SquareMagnitude();
3417 if ( mag2 > numeric_limits<double>::min() )
3418 norm /= sqrt( mag2 );
3421 //================================================================================
3423 * \brief Move medium node of theLink according to its distance from boundary
3424 * \param theLink - link to fix
3425 * \param theRefVec - movement of boundary
3426 * \param theLinks - all adjacent links of continous triangles
3427 * \param theFaceHelper - helper is not used so far
3428 * \param thePrevLen - distance from the boundary
3429 * \param theStep - number of steps till movement propagation limit
3430 * \param theLinkNorm - out normal to theLink
3431 * \param theSign - 1 or -1 depending on movement of boundary
3432 * \retval double - distance from boundary to propagation limit or other boundary
3434 //================================================================================
3436 double QFace::MoveByBoundary( const TChainLink& theLink,
3437 const gp_Vec& theRefVec,
3438 const TLinkSet& theLinks,
3439 SMESH_MesherHelper* theFaceHelper,
3440 const double thePrevLen,
3442 gp_Vec* theLinkNorm,
3443 double theSign) const
3446 return thePrevLen; // propagation limit reached
3448 int iL; // index of theLink
3449 for ( iL = 0; iL < _sides.size(); ++iL )
3450 if ( theLink._qlink == _sides[ iL ])
3453 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
3454 <<" thePrevLen " << thePrevLen);
3455 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
3457 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
3458 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
3459 if ( theStep == theFirstStep )
3460 theSign = refProj < 0. ? -1. : 1.;
3461 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
3462 return thePrevLen; // to propagate movement forward only, not in side dir or backward
3464 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
3465 TLinkInSet link1 = theLinks.find( _sides[iL1] );
3466 TLinkInSet link2 = theLinks.find( _sides[iL2] );
3468 const QFace *f1 = 0, *f2 = 0; // adjacent faces
3469 bool isBndLink1 = true, isBndLink2 = true;
3470 if ( link1 != theLinks.end() && link2 != theLinks.end() )
3472 f1 = link1->NextFace( this );
3473 f2 = link2->NextFace( this );
3475 isBndLink1 = ( theLink->MediumPos() > (*link1)->MediumPos() );
3476 isBndLink2 = ( theLink->MediumPos() > (*link2)->MediumPos() );
3477 if ( theStep == theFirstStep ) // (issue 22541) quad-dominant mesh
3479 if ( !isBndLink1 && !f1 )
3480 f1 = (*link1)->GetContinuesFace( this ); // get a quadrangle face
3481 if ( !isBndLink2 && !f2 )
3482 f2 = (*link2)->GetContinuesFace( this );
3485 else if ( _sides.size() < 4 )
3488 // propagate to adjacent faces till limit step or boundary
3489 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
3490 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
3491 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
3492 gp_Vec linkDir2(0,0,0);
3495 if ( f1 && !isBndLink1 )
3496 len1 = f1->MoveByBoundary
3497 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
3499 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
3501 MSG( " --------------- EXCEPTION");
3506 if ( f2 && !isBndLink2 )
3507 len2 = f2->MoveByBoundary
3508 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
3510 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
3512 MSG( " --------------- EXCEPTION");
3517 if ( theStep != theFirstStep )
3519 // choose chain length by direction of propagation most codirected with theRefVec
3520 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
3521 fullLen = choose1 ? len1 : len2;
3522 double r = thePrevLen / fullLen;
3524 gp_Vec move = linkNorm * refProj * ( 1 - r );
3525 theLink->Move( move, true );
3527 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
3528 " by " << refProj * ( 1 - r ) << " following " <<
3529 (choose1 ? *link1->_qlink : *link2->_qlink)); // warning: link1 can be invalid
3531 if ( theLinkNorm ) *theLinkNorm = linkNorm;
3536 //================================================================================
3538 * \brief Checks if the face is distorted due to bentLink
3540 //================================================================================
3542 bool QFace::IsSpoiled(const QLink* bentLink ) const
3544 // code is valid for convex faces only
3546 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
3547 gc += XYZ( *n ) / size();
3548 for (unsigned i = 0; i < _sides.size(); ++i )
3550 if ( _sides[i] == bentLink ) continue;
3551 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3552 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
3553 if ( linkNorm * vecOut < 0 )
3555 double mag2 = linkNorm.SquareMagnitude();
3556 if ( mag2 > numeric_limits<double>::min() )
3557 linkNorm /= sqrt( mag2 );
3558 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
3559 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
3560 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
3567 //================================================================================
3569 * \brief Find pairs of continues faces
3571 //================================================================================
3573 void QLink::SetContinuesFaces() const
3575 // x0 x - QLink, [-|] - QFace, v - volume
3577 // | Between _faces of link x2 two vertical faces are continues
3578 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
3579 // | to _faces[0] and _faces[1] and horizontal faces to
3580 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
3583 if ( _faces.empty() )
3585 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
3586 if ( _faces[0]->IsBoundary() )
3587 iBoundary[ nbBoundary++ ] = 0;
3588 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
3590 // look for a face bounding none of volumes bound by _faces[0]
3591 bool sameVol = false;
3592 int nbVol = _faces[iF]->NbVolumes();
3593 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
3594 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
3595 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
3598 if ( _faces[iF]->IsBoundary() )
3599 iBoundary[ nbBoundary++ ] = iF;
3601 // Set continues faces: arrange _faces to have
3602 // _faces[0] continues to _faces[1]
3603 // _faces[2] continues to _faces[3]
3604 if ( nbBoundary == 2 ) // bnd faces are continues
3606 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
3608 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
3609 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
3612 else if ( iFaceCont > 0 ) // continues faces found
3614 if ( iFaceCont != 1 )
3615 std::swap( _faces[1], _faces[iFaceCont] );
3617 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
3619 _faces.insert( ++_faces.begin(), (QFace*) 0 );
3622 //================================================================================
3624 * \brief Return a face continues to the given one
3626 //================================================================================
3628 const QFace* QLink::GetContinuesFace( const QFace* face ) const
3630 for ( int i = 0; i < _faces.size(); ++i ) {
3631 if ( _faces[i] == face ) {
3632 int iF = i < 2 ? 1-i : 5-i;
3633 return iF < _faces.size() ? _faces[iF] : 0;
3638 //================================================================================
3640 * \brief True if link is on mesh boundary
3642 //================================================================================
3644 bool QLink::OnBoundary() const
3646 for ( int i = 0; i < _faces.size(); ++i )
3647 if (_faces[i] && _faces[i]->IsBoundary()) return true;
3650 //================================================================================
3652 * \brief Return normal of link of the chain
3654 //================================================================================
3656 gp_Vec TChainLink::Normal() const {
3658 if (_qfaces[0]) norm = _qfaces[0]->_normal;
3659 if (_qfaces[1]) norm += _qfaces[1]->_normal;
3662 //================================================================================
3664 * \brief Test link curvature taking into account size of faces
3666 //================================================================================
3668 bool TChainLink::IsStraight() const
3670 bool isStraight = _qlink->IsStraight();
3671 if ( isStraight && _qfaces[0] && !_qfaces[1] )
3673 int i = _qfaces[0]->LinkIndex( _qlink );
3674 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
3675 gp_XYZ mid1 = _qlink->MiddlePnt();
3676 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
3677 double faceSize2 = (mid1-mid2).SquareModulus();
3678 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
3683 //================================================================================
3685 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
3687 //================================================================================
3689 void fixPrism( TChain& allLinks )
3691 // separate boundary links from internal ones
3692 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
3693 QLinkSet interLinks, bndLinks1, bndLink2;
3695 bool isCurved = false;
3696 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3697 if ( (*lnk)->OnBoundary() )
3698 bndLinks1.insert( lnk->_qlink );
3700 interLinks.insert( lnk->_qlink );
3701 isCurved = isCurved || !lnk->IsStraight();
3704 return; // no need to move
3706 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
3708 while ( !interLinks.empty() && !curBndLinks->empty() )
3710 // propagate movement from boundary links to connected internal links
3711 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
3712 for ( ; bnd != bndEnd; ++bnd )
3714 const QLink* bndLink = *bnd;
3715 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
3717 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
3718 if ( !face ) continue;
3719 // find and move internal link opposite to bndLink within the face
3720 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
3721 const QLink* interLink = face->_sides[ interInd ];
3722 QLinkSet::iterator pInterLink = interLinks.find( interLink );
3723 if ( pInterLink == interLinks.end() ) continue; // not internal link
3724 interLink->Move( bndLink->_nodeMove );
3725 // treated internal links become new boundary ones
3726 interLinks.erase( pInterLink );
3727 newBndLinks->insert( interLink );
3730 curBndLinks->clear();
3731 std::swap( curBndLinks, newBndLinks );
3735 //================================================================================
3737 * \brief Fix links of continues triangles near curved boundary
3739 //================================================================================
3741 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
3743 if ( allLinks.empty() ) return;
3745 TLinkSet linkSet( allLinks.begin(), allLinks.end());
3746 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
3748 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
3750 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
3752 // move iff a boundary link is bent towards inside of a face (issue 0021084)
3753 const QFace* face = linkIt->_qfaces[0];
3754 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
3755 face->_sides[1]->MiddlePnt() +
3756 face->_sides[2]->MiddlePnt() ) / 3.;
3757 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
3758 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
3759 //if ( face->IsSpoiled( linkIt->_qlink ))
3760 if ( linkBentInside )
3761 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
3766 //================================================================================
3768 * \brief Detect rectangular structure of links and build chains from them
3770 //================================================================================
3772 enum TSplitTriaResult {
3773 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
3774 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
3776 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
3777 vector< TChain> & resultChains,
3778 SMDS_TypeOfPosition pos )
3780 // put links in the set and evalute number of result chains by number of boundary links
3783 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3784 linkSet.insert( *lnk );
3785 nbBndLinks += lnk->IsBoundary();
3787 resultChains.clear();
3788 resultChains.reserve( nbBndLinks / 2 );
3790 TLinkInSet linkIt, linksEnd = linkSet.end();
3792 // find a boundary link with corner node; corner node has position pos-2
3793 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
3795 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
3796 const SMDS_MeshNode* corner = 0;
3797 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
3798 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
3803 TLinkInSet startLink = linkIt;
3804 const SMDS_MeshNode* startCorner = corner;
3805 vector< TChain* > rowChains;
3808 while ( startLink != linksEnd) // loop on columns
3810 // We suppose we have a rectangular structure like shown here. We have found a
3811 // corner of the rectangle (startCorner) and a boundary link sharing
3812 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
3813 // --o---o---o structure making several chains at once. One chain (columnChain)
3814 // |\ | /| starts at startLink and continues upward (we look at the structure
3815 // \ | \ | / | from such point that startLink is on the bottom of the structure).
3816 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
3817 // --o---o---o encounter.
3819 // / | \ | \ | startCorner
3824 if ( resultChains.size() == nbBndLinks / 2 )
3826 resultChains.push_back( TChain() );
3827 TChain& columnChain = resultChains.back();
3829 TLinkInSet botLink = startLink; // current horizontal link to go up from
3830 corner = startCorner; // current corner the botLink ends at
3832 while ( botLink != linksEnd ) // loop on rows
3834 // add botLink to the columnChain
3835 columnChain.push_back( *botLink );
3837 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
3839 { // the column ends
3840 if ( botLink == startLink )
3841 return _TWISTED_CHAIN; // issue 0020951
3842 linkSet.erase( botLink );
3843 if ( iRow != rowChains.size() )
3844 return _FEW_ROWS; // different nb of rows in columns
3847 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
3848 // link ending at <corner> (sideLink); there are two cases:
3849 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
3850 // since midQuadLink is not at boundary while sideLink is.
3851 // 2) midQuadLink ends at <corner>
3853 TLinkInSet midQuadLink = linksEnd;
3854 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
3856 if ( isCase2 ) { // find midQuadLink among links of botTria
3857 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
3858 if ( midQuadLink->IsBoundary() )
3859 return _BAD_MIDQUAD;
3861 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
3862 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
3865 columnChain.push_back( *midQuadLink );
3866 if ( iRow >= rowChains.size() ) {
3868 return _MANY_ROWS; // different nb of rows in columns
3869 if ( resultChains.size() == nbBndLinks / 2 )
3871 resultChains.push_back( TChain() );
3872 rowChains.push_back( & resultChains.back() );
3874 rowChains[iRow]->push_back( *sideLink );
3875 rowChains[iRow]->push_back( *midQuadLink );
3877 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
3881 // prepare startCorner and startLink for the next column
3882 startCorner = startLink->NextNode( startCorner );
3884 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
3886 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
3887 // check if no more columns remains
3888 if ( startLink != linksEnd ) {
3889 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
3890 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
3891 startLink = linksEnd; // startLink bounds upTria or botTria
3892 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
3896 // find bottom link and corner for the next row
3897 corner = sideLink->NextNode( corner );
3898 // next bottom link ends at the new corner
3899 linkSet.erase( botLink );
3900 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
3901 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
3903 if ( midQuadLink == startLink || sideLink == startLink )
3904 return _TWISTED_CHAIN; // issue 0020951
3905 linkSet.erase( midQuadLink );
3906 linkSet.erase( sideLink );
3908 // make faces neighboring the found ones be boundary
3909 if ( startLink != linksEnd ) {
3910 const QFace* tria = isCase2 ? botTria : upTria;
3911 for ( int iL = 0; iL < 3; ++iL ) {
3912 linkIt = linkSet.find( tria->_sides[iL] );
3913 if ( linkIt != linksEnd )
3914 linkIt->RemoveFace( tria );
3917 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
3918 botLink->RemoveFace( upTria ); // make next botTria first in vector
3925 // In the linkSet, there must remain the last links of rowChains; add them
3926 if ( linkSet.size() != rowChains.size() )
3927 return _BAD_SET_SIZE;
3928 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
3929 // find the link (startLink) ending at startCorner
3931 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
3932 if ( (*startLink)->node1() == startCorner ) {
3933 corner = (*startLink)->node2(); break;
3935 else if ( (*startLink)->node2() == startCorner) {
3936 corner = (*startLink)->node1(); break;
3939 if ( startLink == linksEnd )
3941 rowChains[ iRow ]->push_back( *startLink );
3942 linkSet.erase( startLink );
3943 startCorner = corner;
3949 //================================================================================
3951 * \brief Place medium nodes at the link middle for elements whose corner nodes
3952 * are out of geometrical boundary to prevent distorting elements.
3953 * Issue 0020982, note 0013990
3955 //================================================================================
3957 void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
3958 SMESH_ComputeErrorPtr& theError)
3960 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
3961 TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
3962 if ( shape.IsNull() ) return;
3964 if ( !theError ) theError = SMESH_ComputeError::New();
3968 if ( shape.ShapeType() == TopAbs_FACE ) // 2D
3970 if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
3972 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
3973 if ( !faceSM ) return;
3975 const TopoDS_Face& face = TopoDS::Face( shape );
3976 Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
3978 TopExp_Explorer edgeIt( face, TopAbs_EDGE );
3979 for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
3981 // check if the EDGE needs checking
3982 const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
3983 if ( SMESH_Algo::isDegenerated( edge ) )
3985 if ( theHelper.IsRealSeam( edge ) &&
3986 edge.Orientation() == TopAbs_REVERSED )
3989 SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
3990 if ( !edgeSM ) continue;
3993 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
3994 BRepAdaptor_Curve curve3D( edge );
3995 switch ( curve3D.GetType() ) {
3996 case GeomAbs_Line: continue;
3997 case GeomAbs_Circle:
3998 case GeomAbs_Ellipse:
3999 case GeomAbs_Hyperbola:
4000 case GeomAbs_Parabola:
4003 gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
4004 curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
4005 gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
4006 surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
4007 gp_Vec fNorm = Du1 ^ Dv1;
4008 if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
4009 continue; // face is normal to the curve3D
4011 gp_Vec curvNorm = fNorm ^ D1;
4012 if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
4013 if ( curvNorm * D2 > 0 )
4014 continue; // convex edge
4016 catch ( Standard_Failure )
4021 // get nodes shared by faces that may be distorted
4022 SMDS_NodeIteratorPtr nodeIt;
4023 if ( edgeSM->NbNodes() > 0 ) {
4024 nodeIt = edgeSM->GetNodes();
4027 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
4029 vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
4030 if ( !vertexSM ) continue;
4031 nodeIt = vertexSM->GetNodes();
4034 // find suspicious faces
4035 TIDSortedElemSet checkedFaces;
4036 vector< const SMDS_MeshNode* > nOnEdge( 2 );
4037 const SMDS_MeshNode* nOnFace;
4038 while ( nodeIt->more() )
4040 const SMDS_MeshNode* n = nodeIt->next();
4041 SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
4042 while ( faceIt->more() )
4044 const SMDS_MeshElement* f = faceIt->next();
4045 if ( !faceSM->Contains( f ) ||
4046 f->NbNodes() < 6 || // check quadratic triangles only
4047 !checkedFaces.insert( f ).second )
4050 // get nodes on EDGE and on FACE of a suspicious face
4051 nOnEdge.clear(); nOnFace = 0;
4052 SMDS_MeshElement::iterator triNode = f->begin_nodes();
4053 for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
4056 if ( n->GetPosition()->GetDim() == 2 )
4059 nOnEdge.push_back( n );
4062 // check if nOnFace is inside the FACE
4063 if ( nOnFace && nOnEdge.size() == 2 )
4065 theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
4066 if ( !SMESH_MeshAlgos::FaceNormal( f, faceNorm, /*normalized=*/false ))
4068 gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
4069 gp_XYZ edgeNorm = faceNorm ^ edgeDir;
4070 n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true );
4071 gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
4072 gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
4073 gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
4074 double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
4075 double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
4076 if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
4078 // nOnFace is out of FACE, move a medium on-edge node to the middle
4079 gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
4080 meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4081 MSG( "move OUT of face " << n );
4082 theError->myBadElements.push_back( f );
4088 if ( !theError->myBadElements.empty() )
4089 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4092 } // 2D ==============================================================================
4094 if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
4096 if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
4097 theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
4099 SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
4100 if ( !solidSM ) return;
4102 // check if the SOLID is bound by concave FACEs
4103 vector< TopoDS_Face > concaveFaces;
4104 TopExp_Explorer faceIt( shape, TopAbs_FACE );
4105 for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4107 const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
4108 if ( !meshDS->MeshElements( face )) continue;
4110 BRepAdaptor_Surface surface( face );
4111 switch ( surface.GetType() ) {
4112 case GeomAbs_Plane: continue;
4113 case GeomAbs_Cylinder:
4115 case GeomAbs_Sphere:
4118 double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
4119 double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
4120 gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
4121 surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
4122 gp_Vec fNorm = Du1 ^ Dv1;
4123 if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
4124 bool concaveU = ( fNorm * Du2 > 1e-100 );
4125 bool concaveV = ( fNorm * Dv2 > 1e-100 );
4126 if ( concaveU || concaveV )
4127 concaveFaces.push_back( face );
4129 catch ( Standard_Failure )
4131 concaveFaces.push_back( face );
4135 if ( concaveFaces.empty() )
4138 // fix 2D mesh on the SOLID
4139 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4141 SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
4142 faceHelper.SetSubShape( faceIt.Current() );
4143 force3DOutOfBoundary( faceHelper, theError );
4146 // get an iterator over faces on concaveFaces
4147 vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
4148 for ( size_t i = 0; i < concaveFaces.size(); ++i )
4149 faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
4150 typedef SMDS_IteratorOnIterators
4151 < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
4152 SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
4154 // a seacher to check if a volume is close to a concave face
4155 std::auto_ptr< SMESH_ElementSearcher > faceSearcher
4156 ( SMESH_MeshAlgos::GetElementSearcher( *theHelper.GetMeshDS(), faceIter ));
4159 //BRepClass3d_SolidClassifier solidClassifier( shape );
4161 TIDSortedElemSet checkedVols, movedNodes;
4162 //for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4163 for ( size_t iF = 0; iF < concaveFaces.size(); ++iF ) // loop on concave FACEs
4165 //const TopoDS_Shape& face = faceIt.Current();
4166 const TopoDS_Shape& face = concaveFaces[ iF ];
4167 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
4168 if ( !faceSM ) continue;
4170 // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
4171 SMDS_NodeIteratorPtr nodeIt;
4172 if ( faceSM->NbNodes() > 0 ) {
4173 nodeIt = faceSM->GetNodes();
4176 TopExp_Explorer vertex( face, TopAbs_VERTEX );
4177 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
4178 if ( !vertexSM ) continue;
4179 nodeIt = vertexSM->GetNodes();
4181 // get ids of sub-shapes of the FACE
4183 SMESH_subMeshIteratorPtr smIt =
4184 theHelper.GetMesh()->GetSubMesh( face )->getDependsOnIterator(/*includeSelf=*/true);
4185 while ( smIt->more() )
4186 subIDs.insert( smIt->next()->GetId() );
4188 // find suspicious volumes adjacent to the FACE
4189 vector< const SMDS_MeshNode* > nOnFace( 4 );
4190 const SMDS_MeshNode* nInSolid;
4191 while ( nodeIt->more() )
4193 const SMDS_MeshNode* n = nodeIt->next();
4194 SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
4195 while ( volIt->more() )
4197 const SMDS_MeshElement* vol = volIt->next();
4198 int nbN = vol->NbCornerNodes();
4199 if ( ( nbN != 4 && nbN != 5 ) ||
4200 !solidSM->Contains( vol ) ||
4201 !checkedVols.insert( vol ).second )
4204 // get nodes on FACE and in SOLID of a suspicious volume
4205 nOnFace.clear(); nInSolid = 0;
4206 SMDS_MeshElement::iterator volNode = vol->begin_nodes();
4207 for ( int nb = nbN; nb > 0; ++volNode, --nb )
4210 if ( n->GetPosition()->GetDim() == 3 )
4212 else if ( subIDs.count( n->getshapeId() ))
4213 nOnFace.push_back( n );
4217 if ( !nInSolid || nOnFace.size() != nbN - 1 )
4220 // get size of the vol
4221 SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
4222 double volLength = pInSolid.SquareDistance( nOnFace[0] );
4223 for ( size_t i = 1; i < nOnFace.size(); ++i )
4225 volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
4228 // check if vol is close to concaveFaces
4229 const SMDS_MeshElement* closeFace =
4230 faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
4232 pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
4235 // check if vol is distorted, i.e. a medium node is much closer
4236 // to nInSolid than the link middle
4237 bool isDistorted = false;
4238 SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
4239 if ( !SMESH_MeshAlgos::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
4241 theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
4242 vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
4243 for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
4244 for ( size_t j = i+1; j < nOnFace.size(); ++j )
4246 SMESH_TLink link( nOnFace[i], nOnFace[j] );
4247 TLinkNodeMap::const_iterator linkIt =
4248 theHelper.GetTLinkNodeMap().find( link );
4249 if ( linkIt != theHelper.GetTLinkNodeMap().end() )
4251 links.push_back( make_pair( linkIt->first, linkIt->second ));
4252 if ( !isDistorted ) {
4253 // compare projections of nInSolid and nMedium to face normal
4254 gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
4255 double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
4256 double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
4257 isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
4261 // move medium nodes to link middle
4264 for ( size_t i = 0; i < links.size(); ++i )
4266 const SMDS_MeshNode* nMedium = links[i].second;
4267 if ( movedNodes.insert( nMedium ).second )
4269 gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
4270 SMESH_TNodeXYZ( links[i].first.node2() ));
4271 meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4272 MSG( "move OUT of solid " << nMedium );
4275 theError->myBadElements.push_back( vol );
4277 } // loop on volumes sharing a node on FACE
4278 } // loop on nodes on FACE
4279 } // loop on FACEs of a SOLID
4281 if ( !theError->myBadElements.empty() )
4282 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4288 //=======================================================================
4290 * \brief Move medium nodes of faces and volumes to fix distorted elements
4291 * \param error - container of fixed distorted elements
4292 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
4294 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
4296 //=======================================================================
4298 void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& compError,
4301 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
4302 if ( getenv("NO_FixQuadraticElements") )
4305 // 0. Apply algorithm to SOLIDs or FACEs
4306 // ----------------------------------------------
4307 if ( myShape.IsNull() ) {
4308 if ( !myMesh->HasShapeToMesh() ) return;
4309 SetSubShape( myMesh->GetShapeToMesh() );
4313 TopTools_IndexedMapOfShape solids;
4314 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
4315 nbSolids = solids.Extent();
4317 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
4318 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
4319 faces.Add( f.Current() ); // not in solid
4321 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
4322 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
4323 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
4324 faces.Add( f.Current() ); // in not meshed solid
4326 else { // fix nodes in the solid and its faces
4328 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
4330 SMESH_MesherHelper h(*myMesh);
4331 h.SetSubShape( s.Current() );
4332 h.ToFixNodeParameters(true);
4333 h.FixQuadraticElements( compError, false );
4336 // fix nodes on geom faces
4338 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
4340 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
4341 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
4342 SMESH_MesherHelper h(*myMesh);
4343 h.SetSubShape( fIt.Key() );
4344 h.ToFixNodeParameters(true);
4345 h.FixQuadraticElements( compError, true);
4347 //perf_print_all_meters(1);
4348 if ( compError && compError->myName == EDITERR_NO_MEDIUM_ON_GEOM )
4349 compError->myComment = "during conversion to quadratic, "
4350 "some medium nodes were not placed on geometry to avoid distorting elements";
4354 // 1. Find out type of elements and get iterator on them
4355 // ---------------------------------------------------
4357 SMDS_ElemIteratorPtr elemIt;
4358 SMDSAbs_ElementType elemType = SMDSAbs_All;
4360 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
4363 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
4364 elemIt = smDS->GetElements();
4365 if ( elemIt->more() ) {
4366 elemType = elemIt->next()->GetType();
4367 elemIt = smDS->GetElements();
4370 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
4373 // 2. Fill in auxiliary data structures
4374 // ----------------------------------
4378 set< QLink >::iterator pLink;
4379 set< QFace >::iterator pFace;
4381 bool isCurved = false;
4382 //bool hasRectFaces = false;
4383 //set<int> nbElemNodeSet;
4384 SMDS_VolumeTool volTool;
4386 TIDSortedNodeSet apexOfPyramid;
4387 const int apexIndex = 4;
4390 // Move medium nodes to the link middle for elements whose corner nodes
4391 // are out of geometrical boundary to fix distorted elements.
4392 force3DOutOfBoundary( *this, compError );
4394 if ( elemType == SMDSAbs_Volume )
4396 while ( elemIt->more() ) // loop on volumes
4398 const SMDS_MeshElement* vol = elemIt->next();
4399 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
4401 double volMinSize2 = -1.;
4402 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
4404 int nbN = volTool.NbFaceNodes( iF );
4405 //nbElemNodeSet.insert( nbN );
4406 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
4407 vector< const QLink* > faceLinks( nbN/2 );
4408 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
4411 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
4412 pLink = links.insert( link ).first;
4413 faceLinks[ iN/2 ] = & *pLink;
4415 if ( link.MediumPos() == SMDS_TOP_3DSPACE )
4417 if ( !link.IsStraight() )
4418 return; // already fixed
4420 else if ( !isCurved )
4422 if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
4423 isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
4427 pFace = faces.insert( QFace( faceLinks )).first;
4428 if ( pFace->NbVolumes() == 0 )
4429 pFace->AddSelfToLinks();
4430 pFace->SetVolume( vol );
4431 // hasRectFaces = hasRectFaces ||
4432 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
4433 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
4436 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
4438 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
4439 faceNodes[4],faceNodes[6] );
4442 // collect pyramid apexes for further correction
4443 if ( vol->NbCornerNodes() == 5 )
4444 apexOfPyramid.insert( vol->GetNode( apexIndex ));
4446 set< QLink >::iterator pLink = links.begin();
4447 for ( ; pLink != links.end(); ++pLink )
4448 pLink->SetContinuesFaces();
4452 while ( elemIt->more() ) // loop on faces
4454 const SMDS_MeshElement* face = elemIt->next();
4455 if ( !face->IsQuadratic() )
4457 //nbElemNodeSet.insert( face->NbNodes() );
4458 int nbN = face->NbNodes()/2;
4459 vector< const QLink* > faceLinks( nbN );
4460 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
4463 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
4464 pLink = links.insert( link ).first;
4465 faceLinks[ iN ] = & *pLink;
4467 link.node1()->GetPosition()->GetTypeOfPosition() < 2 &&
4468 link.node2()->GetPosition()->GetTypeOfPosition() < 2 )
4469 isCurved = !link.IsStraight();
4472 pFace = faces.insert( QFace( faceLinks )).first;
4473 pFace->AddSelfToLinks();
4474 //hasRectFaces = ( hasRectFaces || nbN == 4 );
4478 return; // no curved edges of faces
4480 // 3. Compute displacement of medium nodes
4481 // ---------------------------------------
4483 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones.
4484 TopLoc_Location loc;
4486 // not to treat boundary of volumic sub-mesh.
4487 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
4488 for ( ; isInside < 2; ++isInside )
4490 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
4491 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
4492 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
4494 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
4495 if ( bool(isInside) == pFace->IsBoundary() )
4497 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
4500 // make chain of links connected via continues faces
4503 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
4505 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
4507 vector< TChain > chains;
4508 if ( error == ERR_OK ) { // chain contains continues rectangles
4510 chains[0].splice( chains[0].begin(), rawChain );
4512 else if ( error == ERR_TRI ) { // chain contains continues triangles
4513 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
4514 if ( res != _OK ) { // not quadrangles split into triangles
4515 fixTriaNearBoundary( rawChain, *this );
4519 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
4520 fixPrism( rawChain );
4526 for ( int iC = 0; iC < chains.size(); ++iC )
4528 TChain& chain = chains[iC];
4529 if ( chain.empty() ) continue;
4530 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
4531 MSG("3D straight - ignore");
4534 if ( chain.front()->MediumPos() > bndPos ||
4535 chain.back() ->MediumPos() > bndPos ) {
4536 MSG("Internal chain - ignore");
4539 // mesure chain length and compute link position along the chain
4540 double chainLen = 0;
4541 vector< double > linkPos;
4542 MSGBEG( "Link medium nodes: ");
4543 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
4544 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
4545 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
4546 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4547 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
4548 link1 = chain.erase( link1 );
4549 if ( link1 == chain.end() )
4551 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4554 linkPos.push_back( chainLen );
4557 if ( linkPos.size() < 2 )
4560 gp_Vec move0 = chain.front()->_nodeMove;
4561 gp_Vec move1 = chain.back ()->_nodeMove;
4566 // compute node displacement of end links of chain in parametric space of face
4567 TChainLink& linkOnFace = *(++chain.begin());
4568 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
4569 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
4570 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
4572 face = TopoDS::Face( f );
4573 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
4575 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
4577 TChainLink& link = is1 ? chain.back() : chain.front();
4578 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
4579 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
4580 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
4581 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4582 // uvMove = uvm - uv12
4583 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
4584 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
4585 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
4586 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
4587 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
4588 10 * uvMove.SquareModulus());
4590 if ( isStraight[0] && isStraight[1] ) {
4591 MSG("2D straight - ignore");
4592 continue; // straight - no need to move nodes of internal links
4595 // check if a chain is already fixed
4596 gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
4597 gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
4598 gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
4599 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4600 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
4602 MSG("Already fixed - ignore");
4608 if ( isInside || face.IsNull() )
4610 // compute node displacement of end links in their local coord systems
4612 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
4613 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
4614 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4615 move0.Transform(trsf);
4618 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
4619 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
4620 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4621 move1.Transform(trsf);
4624 // compute displacement of medium nodes
4625 link2 = chain.begin();
4628 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
4630 double r = linkPos[i] / chainLen;
4631 // displacement in local coord system
4632 gp_Vec move = (1. - r) * move0 + r * move1;
4633 if ( isInside || face.IsNull()) {
4634 // transform to global
4635 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
4636 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
4637 gp_Vec x = x01.Normalized() + x12.Normalized();
4638 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
4639 move.Transform(trsf);
4642 // compute 3D displacement by 2D one
4643 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
4644 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
4645 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
4646 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
4647 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
4648 if ( SMDS_FacePosition* nPos =
4649 dynamic_cast< SMDS_FacePosition* >((*link1)->_mediumNode->GetPosition()))
4650 nPos->SetParameters( newUV.X(), newUV.Y() );
4652 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
4653 move.SquareMagnitude())
4655 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
4656 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
4657 MSG( "TOO LONG MOVE \t" <<
4658 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
4659 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
4660 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
4661 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
4665 (*link1)->Move( move );
4666 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
4667 << chain.front()->_mediumNode->GetID() <<"-"
4668 << chain.back ()->_mediumNode->GetID() <<
4669 " by " << move.Magnitude());
4671 } // loop on chains of links
4672 } // loop on 2 directions of propagation from quadrangle
4674 } // fix faces and/or volumes
4679 TIDSortedElemSet biQuadQuas, biQuadTris, triQuadHexa;
4680 const SMDS_MeshElement *biQuadQua, *triQuadHex;
4681 const bool toFixCentralNodes = ( myMesh->NbBiQuadQuadrangles() +
4682 myMesh->NbBiQuadTriangles() +
4683 myMesh->NbTriQuadraticHexas() );
4685 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
4686 if ( pLink->IsMoved() )
4688 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
4689 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
4691 // collect bi-quadratic elements
4692 if ( toFixCentralNodes )
4694 biQuadQua = triQuadHex = 0;
4695 SMDS_ElemIteratorPtr eIt = pLink->_mediumNode->GetInverseElementIterator();
4696 while ( eIt->more() )
4698 const SMDS_MeshElement* e = eIt->next();
4699 switch( e->GetEntityType() ) {
4700 case SMDSEntity_BiQuad_Quadrangle: biQuadQuas.insert( e ); break;
4701 case SMDSEntity_BiQuad_Triangle: biQuadTris.insert( e ); break;
4702 case SMDSEntity_TriQuad_Hexa: triQuadHexa.insert( e ); break;
4709 // Fix positions of central nodes of bi-tri-quadratic elements
4711 // treat bi-quad quadrangles
4713 vector< const SMDS_MeshNode* > nodes( 9 );
4715 TIDSortedElemSet::iterator quadIt = biQuadQuas.begin();
4716 for ( ; quadIt != biQuadQuas.end(); ++quadIt )
4718 const SMDS_MeshElement* quad = *quadIt;
4721 nodes.assign( quad->begin_nodes(), quad->end_nodes() );
4723 TopoDS_Shape S = GetSubShapeByNode( nodes.back(), GetMeshDS() );
4724 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4725 const TopoDS_Face& F = TopoDS::Face( S );
4726 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4727 const double tol = BRep_Tool::Tolerance( F );
4729 for ( int i = 0; i < 8; ++i )
4731 uv[ i ] = GetNodeUV( F, nodes[i], nodes[8], &checkUV );
4732 // as this method is used after mesh generation, UV of nodes is not
4733 // updated according to bending links, so we update
4734 if ( i > 3 && nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4735 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4737 // move the central node
4738 gp_XY uvCent = calcTFI (0.5, 0.5, uv[0],uv[1],uv[2],uv[3],uv[4],uv[5],uv[6],uv[7] );
4739 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4740 GetMeshDS()->MoveNode( nodes[8], p.X(), p.Y(), p.Z());
4744 // treat bi-quad triangles
4746 vector< const SMDS_MeshNode* > nodes;
4748 TIDSortedElemSet::iterator triIt = biQuadTris.begin();
4749 for ( ; triIt != biQuadTris.end(); ++triIt )
4751 const SMDS_MeshElement* tria = *triIt;
4753 const TopoDS_Shape& S = GetMeshDS()->IndexToShape( tria->getshapeId() );
4754 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4755 const TopoDS_Face& F = TopoDS::Face( S );
4756 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4757 const double tol = BRep_Tool::Tolerance( F );
4760 nodes.assign( tria->begin_nodes(), tria->end_nodes() );
4762 for ( int i = 0; i < 6; ++i )
4764 uv[ i ] = GetNodeUV( F, nodes[i], nodes[(i+1)%3], &checkUV );
4765 // as this method is used after mesh generation, UV of nodes is not
4766 // updated according to bending links, so we update
4767 if ( nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4768 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4770 // move the central node
4771 gp_XY uvCent = GetCenterUV( uv[0], uv[1], uv[2], uv[3], uv[4], uv[5] );
4772 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4773 GetMeshDS()->MoveNode( tria->GetNode(6), p.X(), p.Y(), p.Z() );
4777 // treat tri-quadratic hexahedra
4779 SMDS_VolumeTool volExp;
4780 TIDSortedElemSet::iterator hexIt = triQuadHexa.begin();
4781 for ( ; hexIt != triQuadHexa.end(); ++hexIt )
4783 volExp.Set( *hexIt, /*ignoreCentralNodes=*/false );
4785 // fix nodes central in sides
4786 for ( int iQuad = 0; iQuad < volExp.NbFaces(); ++iQuad )
4788 const SMDS_MeshNode** quadNodes = volExp.GetFaceNodes( iQuad );
4789 if ( quadNodes[8]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
4791 gp_XYZ p = calcTFI( 0.5, 0.5,
4792 SMESH_TNodeXYZ( quadNodes[0] ), SMESH_TNodeXYZ( quadNodes[2] ),
4793 SMESH_TNodeXYZ( quadNodes[4] ), SMESH_TNodeXYZ( quadNodes[6] ),
4794 SMESH_TNodeXYZ( quadNodes[1] ), SMESH_TNodeXYZ( quadNodes[3] ),
4795 SMESH_TNodeXYZ( quadNodes[5] ), SMESH_TNodeXYZ( quadNodes[7] ));
4796 GetMeshDS()->MoveNode( quadNodes[8], p.X(), p.Y(), p.Z());
4800 // fix the volume central node
4801 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
4802 const SMDS_MeshNode** hexNodes = volExp.GetNodes();
4804 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( hexNodes[ 0 ] );
4805 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( hexNodes[ 3 ] );
4806 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( hexNodes[ 1 ] );
4807 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( hexNodes[ 2 ] );
4808 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( hexNodes[ 4 ] );
4809 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( hexNodes[ 7 ] );
4810 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( hexNodes[ 5 ] );
4811 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( hexNodes[ 6 ] );
4813 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( hexNodes[ 11 ] );
4814 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( hexNodes[ 9 ] );
4815 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( hexNodes[ 8 ] );
4816 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( hexNodes[ 10 ] );
4817 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( hexNodes[ 15 ] );
4818 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( hexNodes[ 13 ] );
4819 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( hexNodes[ 12 ] );
4820 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( hexNodes[ 14 ] );
4821 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( hexNodes[ 16 ] );
4822 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( hexNodes[ 19 ] );
4823 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( hexNodes[ 17 ] );
4824 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( hexNodes[ 18 ] );
4826 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( hexNodes[ 20 ] );
4827 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( hexNodes[ 25 ] );
4828 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( hexNodes[ 21 ] );
4829 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( hexNodes[ 23 ] );
4830 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( hexNodes[ 24 ] );
4831 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( hexNodes[ 22 ] );
4833 gp_XYZ nCenterParams(0.5, 0.5, 0.5), nCenterCoords;
4834 SMESH_Block::ShellPoint( nCenterParams, pointsOnShapes, nCenterCoords );
4835 GetMeshDS()->MoveNode( hexNodes[26],
4836 nCenterCoords.X(), nCenterCoords.Y(), nCenterCoords.Z());