1 // Copyright (C) 2007-2014 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License, or (at your option) any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 // File: SMESH_MesherHelper.cxx
24 // Created: 15.02.06 15:22:41
25 // Author: Sergey KUUL
27 #include "SMESH_MesherHelper.hxx"
29 #include "SMDS_EdgePosition.hxx"
30 #include "SMDS_FaceOfNodes.hxx"
31 #include "SMDS_FacePosition.hxx"
32 #include "SMDS_IteratorOnIterators.hxx"
33 #include "SMDS_VolumeTool.hxx"
34 #include "SMESH_Block.hxx"
35 #include "SMESH_MeshAlgos.hxx"
36 #include "SMESH_ProxyMesh.hxx"
37 #include "SMESH_subMesh.hxx"
39 #include <BRepAdaptor_Curve.hxx>
40 #include <BRepAdaptor_Surface.hxx>
41 #include <BRepTools.hxx>
42 #include <BRep_Tool.hxx>
43 #include <Geom2d_Curve.hxx>
44 #include <GeomAPI_ProjectPointOnCurve.hxx>
45 #include <GeomAPI_ProjectPointOnSurf.hxx>
46 #include <Geom_Curve.hxx>
47 #include <Geom_RectangularTrimmedSurface.hxx>
48 #include <Geom_Surface.hxx>
49 #include <ShapeAnalysis.hxx>
51 #include <TopExp_Explorer.hxx>
52 #include <TopTools_ListIteratorOfListOfShape.hxx>
53 #include <TopTools_MapIteratorOfMapOfShape.hxx>
54 #include <TopTools_MapOfShape.hxx>
57 #include <gp_Pnt2d.hxx>
58 #include <gp_Trsf.hxx>
60 #include <Standard_Failure.hxx>
61 #include <Standard_ErrorHandler.hxx>
63 #include <utilities.h>
69 #define RETURN_BAD_RESULT(msg) { MESSAGE(msg); return false; }
73 gp_XYZ XYZ(const SMDS_MeshNode* n) { return gp_XYZ(n->X(), n->Y(), n->Z()); }
75 enum { U_periodic = 1, V_periodic = 2 };
78 //================================================================================
82 //================================================================================
84 SMESH_MesherHelper::SMESH_MesherHelper(SMESH_Mesh& theMesh)
88 myCreateQuadratic(false),
89 myCreateBiQuadratic(false),
90 myFixNodeParameters(false)
92 myPar1[0] = myPar2[0] = myPar1[1] = myPar2[1] = 0;
93 mySetElemOnShape = ( ! myMesh->HasShapeToMesh() );
96 //=======================================================================
97 //function : ~SMESH_MesherHelper
99 //=======================================================================
101 SMESH_MesherHelper::~SMESH_MesherHelper()
104 TID2ProjectorOnSurf::iterator i_proj = myFace2Projector.begin();
105 for ( ; i_proj != myFace2Projector.end(); ++i_proj )
106 delete i_proj->second;
109 TID2ProjectorOnCurve::iterator i_proj = myEdge2Projector.begin();
110 for ( ; i_proj != myEdge2Projector.end(); ++i_proj )
111 delete i_proj->second;
115 //=======================================================================
116 //function : IsQuadraticSubMesh
117 //purpose : Check submesh for given shape: if all elements on this shape
118 // are quadratic, quadratic elements will be created.
119 // Also fill myTLinkNodeMap
120 //=======================================================================
122 bool SMESH_MesherHelper::IsQuadraticSubMesh(const TopoDS_Shape& aSh)
124 SMESHDS_Mesh* meshDS = GetMeshDS();
125 // we can create quadratic elements only if all elements
126 // created on sub-shapes of given shape are quadratic
127 // also we have to fill myTLinkNodeMap
128 myCreateQuadratic = true;
129 mySeamShapeIds.clear();
130 myDegenShapeIds.clear();
131 TopAbs_ShapeEnum subType( aSh.ShapeType()==TopAbs_FACE ? TopAbs_EDGE : TopAbs_FACE );
132 if ( aSh.ShapeType()==TopAbs_COMPOUND )
134 TopoDS_Iterator subIt( aSh );
136 subType = ( subIt.Value().ShapeType()==TopAbs_FACE ) ? TopAbs_EDGE : TopAbs_FACE;
138 SMDSAbs_ElementType elemType( subType==TopAbs_FACE ? SMDSAbs_Face : SMDSAbs_Edge );
141 int nbOldLinks = myTLinkNodeMap.size();
143 if ( !myMesh->HasShapeToMesh() )
145 if (( myCreateQuadratic = myMesh->NbFaces( ORDER_QUADRATIC )))
147 SMDS_FaceIteratorPtr fIt = meshDS->facesIterator();
148 while ( fIt->more() )
149 AddTLinks( static_cast< const SMDS_MeshFace* >( fIt->next() ));
154 TopExp_Explorer exp( aSh, subType );
155 TopTools_MapOfShape checkedSubShapes;
156 for (; exp.More() && myCreateQuadratic; exp.Next()) {
157 if ( !checkedSubShapes.Add( exp.Current() ))
158 continue; // needed if aSh is compound of solids
159 if ( SMESHDS_SubMesh * subMesh = meshDS->MeshElements( exp.Current() )) {
160 if ( SMDS_ElemIteratorPtr it = subMesh->GetElements() ) {
162 const SMDS_MeshElement* e = it->next();
163 if ( e->GetType() != elemType || !e->IsQuadratic() ) {
164 myCreateQuadratic = false;
169 switch ( e->NbCornerNodes() ) {
171 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(2)); break;
173 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(3));
174 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(4));
175 AddTLinkNode(e->GetNode(2),e->GetNode(0),e->GetNode(5)); break;
177 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(4));
178 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(5));
179 AddTLinkNode(e->GetNode(2),e->GetNode(3),e->GetNode(6));
180 AddTLinkNode(e->GetNode(3),e->GetNode(0),e->GetNode(7));
183 myCreateQuadratic = false;
193 if ( nbOldLinks == myTLinkNodeMap.size() )
194 myCreateQuadratic = false;
196 if(!myCreateQuadratic) {
197 myTLinkNodeMap.clear();
201 return myCreateQuadratic;
204 //=======================================================================
205 //function : SetSubShape
206 //purpose : Set geometry to make elements on
207 //=======================================================================
209 void SMESH_MesherHelper::SetSubShape(const int aShID)
211 if ( aShID == myShapeID )
214 SetSubShape( GetMeshDS()->IndexToShape( aShID ));
216 SetSubShape( TopoDS_Shape() );
219 //=======================================================================
220 //function : SetSubShape
221 //purpose : Set geometry to create elements on
222 //=======================================================================
224 void SMESH_MesherHelper::SetSubShape(const TopoDS_Shape& aSh)
226 if ( myShape.IsSame( aSh ))
230 mySeamShapeIds.clear();
231 myDegenShapeIds.clear();
233 if ( myShape.IsNull() ) {
237 SMESHDS_Mesh* meshDS = GetMeshDS();
238 myShapeID = meshDS->ShapeToIndex(aSh);
241 // treatment of periodic faces
242 for ( TopExp_Explorer eF( aSh, TopAbs_FACE ); eF.More(); eF.Next() )
244 const TopoDS_Face& face = TopoDS::Face( eF.Current() );
246 Handle(Geom_Surface) surface = BRep_Tool::Surface( face, loc );
248 // if ( surface->IsUPeriodic() || surface->IsVPeriodic() ||
249 // surface->IsUClosed() || surface->IsVClosed() )
251 //while ( surface->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
252 //surface = Handle(Geom_RectangularTrimmedSurface)::DownCast( surface )->BasisSurface();
253 GeomAdaptor_Surface surf( surface );
255 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
257 // look for a seam edge
258 const TopoDS_Edge& edge = TopoDS::Edge( exp.Current() );
259 if ( BRep_Tool::IsClosed( edge, face )) {
260 // initialize myPar1, myPar2 and myParIndex
262 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
263 if ( Abs( uv1.Coord(1) - uv2.Coord(1) ) < Abs( uv1.Coord(2) - uv2.Coord(2) ))
265 myParIndex |= U_periodic;
266 myPar1[0] = surf.FirstUParameter();
267 myPar2[0] = surf.LastUParameter();
270 myParIndex |= V_periodic;
271 myPar1[1] = surf.FirstVParameter();
272 myPar2[1] = surf.LastVParameter();
274 // store seam shape indices, negative if shape encounters twice
275 int edgeID = meshDS->ShapeToIndex( edge );
276 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
277 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
278 int vertexID = meshDS->ShapeToIndex( v.Current() );
279 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
283 // look for a degenerated edge
284 if ( SMESH_Algo::isDegenerated( edge )) {
285 myDegenShapeIds.insert( meshDS->ShapeToIndex( edge ));
286 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
287 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
290 if ( !myDegenShapeIds.empty() && !myParIndex ) {
291 if ( surface->IsUPeriodic() || surface->IsUClosed() ) {
292 myParIndex |= U_periodic;
293 myPar1[0] = surf.FirstUParameter();
294 myPar2[0] = surf.LastUParameter();
296 else if ( surface->IsVPeriodic() || surface->IsVClosed() ) {
297 myParIndex |= V_periodic;
298 myPar1[1] = surf.FirstVParameter();
299 myPar2[1] = surf.LastVParameter();
306 //=======================================================================
307 //function : GetNodeUVneedInFaceNode
308 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
309 // Return true if the face is periodic.
310 // If F is Null, answer about sub-shape set through IsQuadraticSubMesh() or
312 //=======================================================================
314 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
316 if ( F.IsNull() ) return !mySeamShapeIds.empty();
318 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
319 return !mySeamShapeIds.empty();
322 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
323 if ( !aSurface.IsNull() )
324 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
329 //=======================================================================
330 //function : IsMedium
332 //=======================================================================
334 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
335 const SMDSAbs_ElementType typeToCheck)
337 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
340 //=======================================================================
341 //function : GetSubShapeByNode
342 //purpose : Return support shape of a node
343 //=======================================================================
345 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
346 const SMESHDS_Mesh* meshDS)
348 int shapeID = node ? node->getshapeId() : 0;
349 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
350 return meshDS->IndexToShape( shapeID );
352 return TopoDS_Shape();
356 //=======================================================================
357 //function : AddTLinkNode
358 //purpose : add a link in my data structure
359 //=======================================================================
361 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
362 const SMDS_MeshNode* n2,
363 const SMDS_MeshNode* n12)
365 // add new record to map
366 SMESH_TLink link( n1, n2 );
367 myTLinkNodeMap.insert( make_pair(link,n12));
370 //================================================================================
372 * \brief Add quadratic links of edge to own data structure
374 //================================================================================
376 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
378 if ( edge->IsQuadratic() )
379 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
382 //================================================================================
384 * \brief Add quadratic links of face to own data structure
386 //================================================================================
388 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
391 switch ( f->NbNodes() ) {
393 // myMapWithCentralNode.insert
394 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2) ),
396 // break; -- add medium nodes as well
398 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
399 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
400 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
403 // myMapWithCentralNode.insert
404 // ( make_pair( TBiQuad( f->GetNode(0),f->GetNode(1),f->GetNode(2),f->GetNode(3) ),
406 // break; -- add medium nodes as well
408 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
409 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
410 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
411 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7)); break;
416 //================================================================================
418 * \brief Add quadratic links of volume to own data structure
420 //================================================================================
422 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
424 if ( volume->IsQuadratic() )
426 SMDS_VolumeTool vTool( volume );
427 const SMDS_MeshNode** nodes = vTool.GetNodes();
429 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
431 const int nbN = vTool.NbFaceNodes( iF );
432 const int* iNodes = vTool.GetFaceNodesIndices( iF );
433 for ( int i = 0; i < nbN; )
435 int iN1 = iNodes[i++];
436 int iN12 = iNodes[i++];
438 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
439 int linkID = iN1 * vTool.NbNodes() + iN2;
440 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
441 if ( it_isNew.second )
442 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
444 addedLinks.erase( it_isNew.first ); // each link encounters only twice
446 if ( vTool.NbNodes() == 27 )
448 const SMDS_MeshNode* nFCenter = nodes[ vTool.GetCenterNodeIndex( iF )];
449 if ( nFCenter->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
450 myMapWithCentralNode.insert
451 ( make_pair( TBiQuad( nodes[ iNodes[0]], nodes[ iNodes[1]],
452 nodes[ iNodes[2]], nodes[ iNodes[3]] ),
459 //================================================================================
461 * \brief Return true if position of nodes on the shape hasn't yet been checked or
462 * the positions proved to be invalid
464 //================================================================================
466 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
468 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
469 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
472 //================================================================================
474 * \brief Set validity of positions of nodes on the shape.
475 * Once set, validity is not changed
477 //================================================================================
479 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
481 std::map< int,bool >::iterator sh_ok =
482 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok)).first;
487 //=======================================================================
488 //function : ToFixNodeParameters
489 //purpose : Enables fixing node parameters on EDGEs and FACEs in
490 // GetNodeU(...,check=true), GetNodeUV(...,check=true), CheckNodeUV() and
491 // CheckNodeU() in case if a node lies on a shape set via SetSubShape().
493 //=======================================================================
495 void SMESH_MesherHelper::ToFixNodeParameters(bool toFix)
497 myFixNodeParameters = toFix;
501 //=======================================================================
502 //function : GetUVOnSeam
503 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
504 //=======================================================================
506 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
508 gp_Pnt2d result = uv1;
509 for ( int i = U_periodic; i <= V_periodic ; ++i )
511 if ( myParIndex & i )
513 double p1 = uv1.Coord( i );
514 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
515 if ( myParIndex == i ||
516 dp1 < ( myPar2[i-1] - myPar2[i-1] ) / 100. ||
517 dp2 < ( myPar2[i-1] - myPar2[i-1] ) / 100. )
519 double p2 = uv2.Coord( i );
520 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
521 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
522 result.SetCoord( i, p1Alt );
529 //=======================================================================
530 //function : GetNodeUV
531 //purpose : Return node UV on face
532 //=======================================================================
534 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
535 const SMDS_MeshNode* n,
536 const SMDS_MeshNode* n2,
539 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
541 const SMDS_PositionPtr Pos = n->GetPosition();
543 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
545 // node has position on face
546 const SMDS_FacePosition* fpos =
547 static_cast<const SMDS_FacePosition*>(n->GetPosition());
548 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
550 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
552 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
554 // node has position on edge => it is needed to find
555 // corresponding edge from face, get pcurve for this
556 // edge and retrieve value from this pcurve
557 const SMDS_EdgePosition* epos =
558 static_cast<const SMDS_EdgePosition*>(n->GetPosition());
559 int edgeID = n->getshapeId();
560 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
561 double f, l, u = epos->GetUParameter();
562 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
563 bool validU = ( f < u && u < l );
565 uv = C2d->Value( u );
567 uv.SetCoord( Precision::Infinite(),0.);
568 if ( check || !validU )
569 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ),/*force=*/ !validU );
571 // for a node on a seam edge select one of UVs on 2 pcurves
572 if ( n2 && IsSeamShape( edgeID ) )
574 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
577 { // adjust uv to period
579 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
580 Standard_Boolean isUPeriodic = S->IsUPeriodic();
581 Standard_Boolean isVPeriodic = S->IsVPeriodic();
582 if ( isUPeriodic || isVPeriodic ) {
583 Standard_Real UF,UL,VF,VL;
584 S->Bounds(UF,UL,VF,VL);
586 uv.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
588 uv.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
592 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
594 if ( int vertexID = n->getshapeId() ) {
595 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
597 uv = BRep_Tool::Parameters( V, F );
600 catch (Standard_Failure& exc) {
603 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
604 uvOK = ( V == vert.Current() );
606 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
607 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
608 // get UV of a vertex closest to the node
610 gp_Pnt pn = XYZ( n );
611 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
612 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
613 gp_Pnt p = BRep_Tool::Pnt( curV );
614 double curDist = p.SquareDistance( pn );
615 if ( curDist < dist ) {
617 uv = BRep_Tool::Parameters( curV, F );
618 uvOK = ( dist < DBL_MIN );
624 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
625 for ( ; it.More(); it.Next() ) {
626 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
627 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
629 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
630 if ( !C2d.IsNull() ) {
631 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
632 uv = C2d->Value( u );
640 if ( n2 && IsSeamShape( vertexID ) )
641 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
646 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
655 //=======================================================================
656 //function : CheckNodeUV
657 //purpose : Check and fix node UV on a face
658 //=======================================================================
660 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
661 const SMDS_MeshNode* n,
665 double distXYZ[4]) const
667 int shapeID = n->getshapeId();
668 bool infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ));
669 bool zero = ( uv.X() == 0. && uv.Y() == 0. );
670 if ( force || toCheckPosOnShape( shapeID ) || infinit || zero )
672 // check that uv is correct
674 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
675 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
677 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
679 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
681 setPosOnShapeValidity( shapeID, false );
682 if ( !infinit && distXYZ ) {
683 surfPnt.Transform( loc );
685 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
687 // uv incorrect, project the node to surface
688 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
689 projector.Perform( nodePnt );
690 if ( !projector.IsDone() || projector.NbPoints() < 1 )
692 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
695 Quantity_Parameter U,V;
696 projector.LowerDistanceParameters(U,V);
698 surfPnt = surface->Value( U, V );
699 dist = nodePnt.Distance( surfPnt );
701 surfPnt.Transform( loc );
703 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
707 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
710 // store the fixed UV on the face
711 if ( myShape.IsSame(F) && shapeID == myShapeID && myFixNodeParameters )
712 const_cast<SMDS_MeshNode*>(n)->SetPosition
713 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
715 else if ( uv.Modulus() > numeric_limits<double>::min() )
717 setPosOnShapeValidity( shapeID, true );
723 //=======================================================================
724 //function : GetProjector
725 //purpose : Return projector intitialized by given face without location, which is returned
726 //=======================================================================
728 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
729 TopLoc_Location& loc,
732 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
733 int faceID = GetMeshDS()->ShapeToIndex( F );
734 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
735 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
736 if ( i_proj == i2proj.end() )
738 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
739 double U1, U2, V1, V2;
740 surface->Bounds(U1, U2, V1, V2);
741 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
742 proj->Init( surface, U1, U2, V1, V2, tol );
743 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
745 return *( i_proj->second );
750 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
751 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
752 gp_XY_FunPtr(Subtracted);
755 //=======================================================================
756 //function : applyIn2D
757 //purpose : Perform given operation on two 2d points in parameric space of given surface.
758 // It takes into account period of the surface. Use gp_XY_FunPtr macro
759 // to easily define pointer to function of gp_XY class.
760 //=======================================================================
762 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
766 const bool resultInPeriod)
768 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
769 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
770 if ( !isUPeriodic && !isVPeriodic )
773 // move uv2 not far than half-period from uv1
775 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
777 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
780 gp_XY res = fun( uv1, gp_XY(u2,v2) );
782 // move result within period
783 if ( resultInPeriod )
785 Standard_Real UF,UL,VF,VL;
786 surface->Bounds(UF,UL,VF,VL);
788 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
790 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
795 //=======================================================================
796 //function : GetMiddleUV
797 //purpose : Return middle UV taking in account surface period
798 //=======================================================================
800 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
805 // the proper place of getting basic surface seems to be in applyIn2D()
806 // but we put it here to decrease a risk of regressions just before releasing a version
807 Handle(Geom_Surface) surf = surface;
808 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
809 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
811 return applyIn2D( surf, p1, p2, & AverageUV );
814 //=======================================================================
815 //function : GetCenterUV
816 //purpose : Return UV for the central node of a biquadratic triangle
817 //=======================================================================
819 gp_XY SMESH_MesherHelper::GetCenterUV(const gp_XY& uv1,
825 bool * isBadTria/*=0*/)
828 gp_XY uvAvg = ( uv12 + uv23 + uv31 ) / 3.;
830 if (( badTria = (( uvAvg - uv1 ) * ( uvAvg - uv23 ) > 0 )))
831 uvAvg = ( uv1 + uv23 ) / 2.;
832 else if (( badTria = (( uvAvg - uv2 ) * ( uvAvg - uv31 ) > 0 )))
833 uvAvg = ( uv2 + uv31 ) / 2.;
834 else if (( badTria = (( uvAvg - uv3 ) * ( uvAvg - uv12 ) > 0 )))
835 uvAvg = ( uv3 + uv12 ) / 2.;
838 *isBadTria = badTria;
842 //=======================================================================
843 //function : GetNodeU
844 //purpose : Return node U on edge
845 //=======================================================================
847 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
848 const SMDS_MeshNode* n,
849 const SMDS_MeshNode* inEdgeNode,
852 double param = Precision::Infinite();
854 const SMDS_PositionPtr pos = n->GetPosition();
855 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
857 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
858 param = epos->GetUParameter();
860 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
862 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
865 BRep_Tool::Range( E, f,l );
866 double uInEdge = GetNodeU( E, inEdgeNode );
867 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
871 SMESHDS_Mesh * meshDS = GetMeshDS();
872 int vertexID = n->getshapeId();
873 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
874 param = BRep_Tool::Parameter( V, E );
879 double tol = BRep_Tool::Tolerance( E );
880 double f,l; BRep_Tool::Range( E, f,l );
881 bool force = ( param < f-tol || param > l+tol );
882 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
883 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
885 *check = CheckNodeU( E, n, param, 2*tol, force );
890 //=======================================================================
891 //function : CheckNodeU
892 //purpose : Check and fix node U on an edge
893 // Return false if U is bad and could not be fixed
894 //=======================================================================
896 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
897 const SMDS_MeshNode* n,
901 double distXYZ[4]) const
903 int shapeID = n->getshapeId();
904 bool infinit = Precision::IsInfinite( u );
905 bool zero = ( u == 0. );
906 if ( force || toCheckPosOnShape( shapeID ) || infinit || zero )
908 TopLoc_Location loc; double f,l;
909 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
910 if ( curve.IsNull() ) // degenerated edge
912 if ( u+tol < f || u-tol > l )
914 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
920 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
921 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
926 curvPnt = curve->Value( u );
927 dist = nodePnt.Distance( curvPnt );
929 curvPnt.Transform( loc );
931 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
936 setPosOnShapeValidity( shapeID, false );
937 // u incorrect, project the node to the curve
938 int edgeID = GetMeshDS()->ShapeToIndex( E );
939 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
940 TID2ProjectorOnCurve::iterator i_proj =
941 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
942 if ( !i_proj->second )
944 i_proj->second = new GeomAPI_ProjectPointOnCurve();
945 i_proj->second->Init( curve, f, l );
947 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
948 projector->Perform( nodePnt );
949 if ( projector->NbPoints() < 1 )
951 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
954 Quantity_Parameter U = projector->LowerDistanceParameter();
956 MESSAGE(" f " << f << " l " << l << " u " << u);
957 curvPnt = curve->Value( u );
958 dist = nodePnt.Distance( curvPnt );
960 curvPnt.Transform( loc );
962 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
966 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
967 MESSAGE("distance " << dist << " " << tol );
970 // store the fixed U on the edge
971 if ( myShape.IsSame(E) && shapeID == myShapeID && myFixNodeParameters )
972 const_cast<SMDS_MeshNode*>(n)->SetPosition
973 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
975 else if ( fabs( u ) > numeric_limits<double>::min() )
977 setPosOnShapeValidity( shapeID, true );
979 if (( u < f-tol || u > l+tol ) && force )
981 MESSAGE("u < f-tol || u > l+tol ; u " << u << " f " << f << " l " << l);
982 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
985 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
986 double period = curve->Period();
987 u = ( u < f ) ? u + period : u - period;
989 catch (Standard_Failure& exc)
999 //=======================================================================
1000 //function : GetMediumPos
1001 //purpose : Return index and type of the shape (EDGE or FACE only) to
1002 // set a medium node on
1003 //param : useCurSubShape - if true, returns the shape set via SetSubShape()
1005 //=======================================================================
1007 std::pair<int, TopAbs_ShapeEnum>
1008 SMESH_MesherHelper::GetMediumPos(const SMDS_MeshNode* n1,
1009 const SMDS_MeshNode* n2,
1010 const bool useCurSubShape)
1012 if ( useCurSubShape && !myShape.IsNull() )
1013 return std::make_pair( myShapeID, myShape.ShapeType() );
1015 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1019 if (( myShapeID == n1->getshapeId() || myShapeID == n2->getshapeId() ) && myShapeID > 0 )
1021 shapeType = myShape.ShapeType();
1022 shapeID = myShapeID;
1024 else if ( n1->getshapeId() == n2->getshapeId() )
1026 shapeID = n2->getshapeId();
1027 shape = GetSubShapeByNode( n1, GetMeshDS() );
1031 const SMDS_TypeOfPosition Pos1 = n1->GetPosition()->GetTypeOfPosition();
1032 const SMDS_TypeOfPosition Pos2 = n2->GetPosition()->GetTypeOfPosition();
1034 if ( Pos1 == SMDS_TOP_3DSPACE || Pos2 == SMDS_TOP_3DSPACE )
1037 else if ( Pos1 == SMDS_TOP_FACE || Pos2 == SMDS_TOP_FACE )
1039 if ( Pos1 != SMDS_TOP_FACE || Pos2 != SMDS_TOP_FACE )
1041 if ( Pos1 != SMDS_TOP_FACE ) std::swap( n1,n2 );
1042 TopoDS_Shape F = GetSubShapeByNode( n1, GetMeshDS() );
1043 TopoDS_Shape S = GetSubShapeByNode( n2, GetMeshDS() );
1044 if ( IsSubShape( S, F ))
1046 shapeType = TopAbs_FACE;
1047 shapeID = n1->getshapeId();
1051 else if ( Pos1 == SMDS_TOP_EDGE && Pos2 == SMDS_TOP_EDGE )
1053 TopoDS_Shape E1 = GetSubShapeByNode( n1, GetMeshDS() );
1054 TopoDS_Shape E2 = GetSubShapeByNode( n2, GetMeshDS() );
1055 shape = GetCommonAncestor( E1, E2, *myMesh, TopAbs_FACE );
1057 else if ( Pos1 == SMDS_TOP_VERTEX && Pos2 == SMDS_TOP_VERTEX )
1059 TopoDS_Shape V1 = GetSubShapeByNode( n1, GetMeshDS() );
1060 TopoDS_Shape V2 = GetSubShapeByNode( n2, GetMeshDS() );
1061 shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_EDGE );
1062 if ( shape.IsNull() ) shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_FACE );
1064 else // VERTEX and EDGE
1066 if ( Pos1 != SMDS_TOP_VERTEX ) std::swap( n1,n2 );
1067 TopoDS_Shape V = GetSubShapeByNode( n1, GetMeshDS() );
1068 TopoDS_Shape E = GetSubShapeByNode( n2, GetMeshDS() );
1069 if ( IsSubShape( V, E ))
1072 shape = GetCommonAncestor( V, E, *myMesh, TopAbs_FACE );
1076 if ( !shape.IsNull() )
1079 shapeID = GetMeshDS()->ShapeToIndex( shape );
1080 shapeType = shape.ShapeType();
1082 return make_pair( shapeID, shapeType );
1085 //=======================================================================
1086 //function : GetCentralNode
1087 //purpose : Return existing or create a new central node for a quardilateral
1088 // quadratic face given its 8 nodes.
1089 //@param : force3d - true means node creation in between the given nodes,
1090 // else node position is found on a geometrical face if any.
1091 //=======================================================================
1093 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1094 const SMDS_MeshNode* n2,
1095 const SMDS_MeshNode* n3,
1096 const SMDS_MeshNode* n4,
1097 const SMDS_MeshNode* n12,
1098 const SMDS_MeshNode* n23,
1099 const SMDS_MeshNode* n34,
1100 const SMDS_MeshNode* n41,
1103 SMDS_MeshNode *centralNode = 0; // central node to return
1105 // Find an existing central node
1107 TBiQuad keyOfMap(n1,n2,n3,n4);
1108 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1109 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1110 if ( itMapCentralNode != myMapWithCentralNode.end() )
1112 return (*itMapCentralNode).second;
1115 // Get type of shape for the new central node
1117 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1121 TopTools_ListIteratorOfListOfShape it;
1123 std::map< int, int > faceId2nbNodes;
1124 std::map< int, int > ::iterator itMapWithIdFace;
1126 SMESHDS_Mesh* meshDS = GetMeshDS();
1128 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1129 // on sub-shapes of the FACE
1130 if ( GetMesh()->HasShapeToMesh() )
1132 const SMDS_MeshNode* nodes[] = { n1, n2, n3, n4 };
1133 for(int i = 0; i < 4; i++)
1135 shape = GetSubShapeByNode( nodes[i], meshDS );
1136 if ( shape.IsNull() ) break;
1137 if ( shape.ShapeType() == TopAbs_SOLID )
1139 solidID = nodes[i]->getshapeId();
1140 shapeType = TopAbs_SOLID;
1143 if ( shape.ShapeType() == TopAbs_FACE )
1145 faceID = nodes[i]->getshapeId();
1146 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1147 itMapWithIdFace->second++;
1151 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1152 while ( const TopoDS_Shape* face = it->next() )
1154 faceID = meshDS->ShapeToIndex( *face );
1155 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1156 itMapWithIdFace->second++;
1161 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1163 // find ID of the FACE the four corner nodes belong to
1164 itMapWithIdFace = faceId2nbNodes.begin();
1165 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1167 if ( itMapWithIdFace->second == 4 )
1169 shapeType = TopAbs_FACE;
1170 faceID = (*itMapWithIdFace).first;
1177 if ( shapeType == TopAbs_FACE )
1179 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1186 bool toCheck = true;
1187 if ( !F.IsNull() && !force3d )
1189 uvAvg = calcTFI (0.5, 0.5,
1190 GetNodeUV(F,n1,n3,&toCheck), GetNodeUV(F,n2,n4,&toCheck),
1191 GetNodeUV(F,n3,n1,&toCheck), GetNodeUV(F,n4,n2,&toCheck),
1192 GetNodeUV(F,n12,n3), GetNodeUV(F,n23,n4),
1193 GetNodeUV(F,n34,n2), GetNodeUV(F,n41,n2));
1194 TopLoc_Location loc;
1195 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1196 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1197 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1198 // if ( mySetElemOnShape ) node is not elem!
1199 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1201 else // ( force3d || F.IsNull() )
1203 P = ( SMESH_TNodeXYZ( n1 ) +
1204 SMESH_TNodeXYZ( n2 ) +
1205 SMESH_TNodeXYZ( n3 ) +
1206 SMESH_TNodeXYZ( n4 ) ) / 4;
1207 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1209 if ( !F.IsNull() ) // force3d
1211 uvAvg = (GetNodeUV(F,n1,n3,&toCheck) +
1212 GetNodeUV(F,n2,n4,&toCheck) +
1213 GetNodeUV(F,n3,n1,&toCheck) +
1214 GetNodeUV(F,n4,n2,&toCheck)) / 4;
1215 //CheckNodeUV( F, centralNode, uvAvg, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1216 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1218 else if ( solidID > 0 )
1220 meshDS->SetNodeInVolume( centralNode, solidID );
1222 else if ( myShapeID > 0 && mySetElemOnShape )
1224 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1227 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1231 //=======================================================================
1232 //function : GetCentralNode
1233 //purpose : Return existing or create a new central node for a
1234 // quadratic triangle given its 6 nodes.
1235 //@param : force3d - true means node creation in between the given nodes,
1236 // else node position is found on a geometrical face if any.
1237 //=======================================================================
1239 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1240 const SMDS_MeshNode* n2,
1241 const SMDS_MeshNode* n3,
1242 const SMDS_MeshNode* n12,
1243 const SMDS_MeshNode* n23,
1244 const SMDS_MeshNode* n31,
1247 SMDS_MeshNode *centralNode = 0; // central node to return
1249 // Find an existing central node
1251 TBiQuad keyOfMap(n1,n2,n3);
1252 std::map<TBiQuad, const SMDS_MeshNode* >::iterator itMapCentralNode;
1253 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1254 if ( itMapCentralNode != myMapWithCentralNode.end() )
1256 return (*itMapCentralNode).second;
1259 // Get type of shape for the new central node
1261 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1265 TopTools_ListIteratorOfListOfShape it;
1267 std::map< int, int > faceId2nbNodes;
1268 std::map< int, int > ::iterator itMapWithIdFace;
1270 SMESHDS_Mesh* meshDS = GetMeshDS();
1272 // check if a face lies on a FACE, i.e. its all corner nodes lie either on the FACE or
1273 // on sub-shapes of the FACE
1274 if ( GetMesh()->HasShapeToMesh() )
1276 const SMDS_MeshNode* nodes[] = { n1, n2, n3 };
1277 for(int i = 0; i < 3; i++)
1279 shape = GetSubShapeByNode( nodes[i], meshDS );
1280 if ( shape.IsNull() ) break;
1281 if ( shape.ShapeType() == TopAbs_SOLID )
1283 solidID = nodes[i]->getshapeId();
1284 shapeType = TopAbs_SOLID;
1287 if ( shape.ShapeType() == TopAbs_FACE )
1289 faceID = nodes[i]->getshapeId();
1290 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1291 itMapWithIdFace->second++;
1295 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1296 while ( const TopoDS_Shape* face = it->next() )
1298 faceID = meshDS->ShapeToIndex( *face );
1299 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1300 itMapWithIdFace->second++;
1305 if ( solidID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1307 // find ID of the FACE the four corner nodes belong to
1308 itMapWithIdFace = faceId2nbNodes.begin();
1309 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1311 if ( itMapWithIdFace->second == 3 )
1313 shapeType = TopAbs_FACE;
1314 faceID = (*itMapWithIdFace).first;
1324 if ( shapeType == TopAbs_FACE )
1326 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1328 gp_XY uv1 = GetNodeUV( F, n1, n23, &check );
1329 gp_XY uv2 = GetNodeUV( F, n2, n31, &check );
1330 gp_XY uv3 = GetNodeUV( F, n3, n12, &check );
1331 gp_XY uv12 = GetNodeUV( F, n12, n3, &check );
1332 gp_XY uv23 = GetNodeUV( F, n23, n1, &check );
1333 gp_XY uv31 = GetNodeUV( F, n31, n2, &check );
1334 uvAvg = GetCenterUV( uv1,uv2,uv3, uv12,uv23,uv31, &badTria );
1339 // Create a central node
1342 if ( !F.IsNull() && !force3d )
1344 TopLoc_Location loc;
1345 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1346 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1347 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1348 // if ( mySetElemOnShape ) node is not elem!
1349 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1351 else // ( force3d || F.IsNull() )
1353 P = ( SMESH_TNodeXYZ( n12 ) +
1354 SMESH_TNodeXYZ( n23 ) +
1355 SMESH_TNodeXYZ( n31 ) ) / 3;
1356 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1358 if ( !F.IsNull() ) // force3d
1360 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1362 else if ( solidID > 0 )
1364 meshDS->SetNodeInVolume( centralNode, solidID );
1366 else if ( myShapeID > 0 && mySetElemOnShape )
1368 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1371 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1375 //=======================================================================
1376 //function : GetMediumNode
1377 //purpose : Return existing or create a new medium node between given ones
1378 //=======================================================================
1380 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
1381 const SMDS_MeshNode* n2,
1384 // Find existing node
1386 SMESH_TLink link(n1,n2);
1387 ItTLinkNode itLN = myTLinkNodeMap.find( link );
1388 if ( itLN != myTLinkNodeMap.end() ) {
1389 return (*itLN).second;
1392 // Create medium node
1395 SMESHDS_Mesh* meshDS = GetMeshDS();
1397 if ( IsSeamShape( n1->getshapeId() ))
1398 // to get a correct UV of a node on seam, the second node must have checked UV
1399 std::swap( n1, n2 );
1401 // get type of shape for the new medium node
1402 int faceID = -1, edgeID = -1;
1403 TopoDS_Edge E; double u [2];
1404 TopoDS_Face F; gp_XY uv[2];
1405 bool uvOK[2] = { false, false };
1407 pair<int, TopAbs_ShapeEnum> pos = GetMediumPos( n1, n2, mySetElemOnShape );
1408 // calling GetMediumPos() with useCurSubShape=mySetElemOnShape is OK only for the
1409 // case where the lower dim mesh is already constructed, else, nodes on EDGEs are
1410 // assigned to FACE, for example.
1412 // get positions of the given nodes on shapes
1413 if ( pos.second == TopAbs_FACE )
1415 F = TopoDS::Face(meshDS->IndexToShape( faceID = pos.first ));
1416 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
1417 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
1419 else if ( pos.second == TopAbs_EDGE )
1421 const SMDS_PositionPtr Pos1 = n1->GetPosition();
1422 const SMDS_PositionPtr Pos2 = n2->GetPosition();
1423 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1424 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1425 n1->getshapeId() != n2->getshapeId() )
1428 return getMediumNodeOnComposedWire(n1,n2,force3d);
1430 E = TopoDS::Edge(meshDS->IndexToShape( edgeID = pos.first ));
1432 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
1433 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
1435 catch ( Standard_Failure& f )
1437 // issue 22502 / a node is on VERTEX not belonging to E
1438 return getMediumNodeOnComposedWire(n1,n2,force3d);
1442 if ( !force3d & uvOK[0] && uvOK[1] )
1444 // we try to create medium node using UV parameters of
1445 // nodes, else - medium between corresponding 3d points
1448 //if ( uvOK[0] && uvOK[1] )
1450 if ( IsDegenShape( n1->getshapeId() )) {
1451 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
1452 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
1454 else if ( IsDegenShape( n2->getshapeId() )) {
1455 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
1456 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
1459 TopLoc_Location loc;
1460 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
1461 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
1462 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
1463 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1464 // if ( mySetElemOnShape ) node is not elem!
1465 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
1466 myTLinkNodeMap.insert(make_pair(link,n12));
1470 else if ( !E.IsNull() )
1473 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1476 Standard_Boolean isPeriodic = C->IsPeriodic();
1479 Standard_Real Period = C->Period();
1480 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1481 Standard_Real pmid = (u[0]+p)/2.;
1482 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1487 gp_Pnt P = C->Value( U );
1488 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1489 //if ( mySetElemOnShape ) node is not elem!
1490 meshDS->SetNodeOnEdge(n12, edgeID, U);
1491 myTLinkNodeMap.insert(make_pair(link,n12));
1498 double x = ( n1->X() + n2->X() )/2.;
1499 double y = ( n1->Y() + n2->Y() )/2.;
1500 double z = ( n1->Z() + n2->Z() )/2.;
1501 n12 = meshDS->AddNode(x,y,z);
1503 //if ( mySetElemOnShape ) node is not elem!
1507 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1508 CheckNodeUV( F, n12, UV, 2 * BRep_Tool::Tolerance( F ), /*force=*/true);
1509 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1511 else if ( !E.IsNull() )
1513 double U = ( u[0] + u[1] ) / 2.;
1514 CheckNodeU( E, n12, U, 2 * BRep_Tool::Tolerance( E ), /*force=*/true);
1515 meshDS->SetNodeOnEdge(n12, edgeID, U);
1517 else if ( myShapeID > 0 && mySetElemOnShape )
1519 meshDS->SetMeshElementOnShape(n12, myShapeID);
1523 myTLinkNodeMap.insert( make_pair( link, n12 ));
1527 //================================================================================
1529 * \brief Makes a medium node if nodes reside different edges
1531 //================================================================================
1533 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1534 const SMDS_MeshNode* n2,
1537 gp_Pnt middle = 0.5 * XYZ(n1) + 0.5 * XYZ(n2);
1538 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1540 // To find position on edge and 3D position for n12,
1541 // project <middle> to 2 edges and select projection most close to <middle>
1543 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4];
1545 TopoDS_Edge edges[2];
1546 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1549 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1550 TopoDS_Shape shape = GetSubShapeByNode( n, GetMeshDS() );
1551 if ( shape.IsNull() || shape.ShapeType() != TopAbs_EDGE )
1554 // project to get U of projection and distance from middle to projection
1555 TopoDS_Edge edge = edges[ is2nd ] = TopoDS::Edge( shape );
1556 double node2MiddleDist = middle.Distance( XYZ(n) );
1557 double foundU = GetNodeU( edge, n );
1558 CheckNodeU( edge, n12, foundU, 2*BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1559 if ( distXYZ[0] < node2MiddleDist )
1561 distMiddleProj = distXYZ[0];
1566 if ( Precision::IsInfinite( distMiddleProj ))
1568 // both projections failed; set n12 on the edge of n1 with U of a common vertex
1569 TopoDS_Vertex vCommon;
1570 if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1571 u = BRep_Tool::Parameter( vCommon, edges[0] );
1574 double f,l, u0 = GetNodeU( edges[0], n1 );
1575 BRep_Tool::Range( edges[0],f,l );
1576 u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1582 // move n12 to position of a successfull projection
1583 double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1584 if ( !force3d && distMiddleProj > 2*tol )
1586 TopLoc_Location loc; double f,l;
1587 Handle(Geom_Curve) curve = BRep_Tool::Curve( edges[iOkEdge],loc,f,l );
1588 gp_Pnt p = curve->Value( u );
1589 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1592 //if ( mySetElemOnShape ) node is not elem!
1594 int edgeID = GetMeshDS()->ShapeToIndex( edges[iOkEdge] );
1595 if ( edgeID != n12->getshapeId() )
1596 GetMeshDS()->UnSetNodeOnShape( n12 );
1597 GetMeshDS()->SetNodeOnEdge(n12, edgeID, u);
1599 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1604 //=======================================================================
1605 //function : AddNode
1606 //purpose : Creates a node
1607 //=======================================================================
1609 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID,
1612 SMESHDS_Mesh * meshDS = GetMeshDS();
1613 SMDS_MeshNode* node = 0;
1615 node = meshDS->AddNodeWithID( x, y, z, ID );
1617 node = meshDS->AddNode( x, y, z );
1618 if ( mySetElemOnShape && myShapeID > 0 ) { // node is not elem ?
1619 switch ( myShape.ShapeType() ) {
1620 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1621 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1622 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID, u, v); break;
1623 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID, u); break;
1624 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1631 //=======================================================================
1632 //function : AddEdge
1633 //purpose : Creates quadratic or linear edge
1634 //=======================================================================
1636 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1637 const SMDS_MeshNode* n2,
1641 SMESHDS_Mesh * meshDS = GetMeshDS();
1643 SMDS_MeshEdge* edge = 0;
1644 if (myCreateQuadratic) {
1645 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1647 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1649 edge = meshDS->AddEdge(n1, n2, n12);
1653 edge = meshDS->AddEdgeWithID(n1, n2, id);
1655 edge = meshDS->AddEdge(n1, n2);
1658 if ( mySetElemOnShape && myShapeID > 0 )
1659 meshDS->SetMeshElementOnShape( edge, myShapeID );
1664 //=======================================================================
1665 //function : AddFace
1666 //purpose : Creates quadratic or linear triangle
1667 //=======================================================================
1669 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1670 const SMDS_MeshNode* n2,
1671 const SMDS_MeshNode* n3,
1675 SMESHDS_Mesh * meshDS = GetMeshDS();
1676 SMDS_MeshFace* elem = 0;
1678 if( n1==n2 || n2==n3 || n3==n1 )
1681 if(!myCreateQuadratic) {
1683 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1685 elem = meshDS->AddFace(n1, n2, n3);
1688 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1689 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1690 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1691 if(myCreateBiQuadratic)
1693 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n12, n23, n31, force3d);
1695 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, nCenter, id);
1697 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31, nCenter);
1702 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1704 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1707 if ( mySetElemOnShape && myShapeID > 0 )
1708 meshDS->SetMeshElementOnShape( elem, myShapeID );
1713 //=======================================================================
1714 //function : AddFace
1715 //purpose : Creates bi-quadratic, quadratic or linear quadrangle
1716 //=======================================================================
1718 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1719 const SMDS_MeshNode* n2,
1720 const SMDS_MeshNode* n3,
1721 const SMDS_MeshNode* n4,
1725 SMESHDS_Mesh * meshDS = GetMeshDS();
1726 SMDS_MeshFace* elem = 0;
1729 return AddFace(n1,n3,n4,id,force3d);
1732 return AddFace(n1,n2,n4,id,force3d);
1735 return AddFace(n1,n2,n3,id,force3d);
1738 return AddFace(n1,n2,n4,id,force3d);
1741 return AddFace(n1,n2,n3,id,force3d);
1744 return AddFace(n1,n2,n3,id,force3d);
1747 if(!myCreateQuadratic) {
1749 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1751 elem = meshDS->AddFace(n1, n2, n3, n4);
1754 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1755 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1756 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1757 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1758 if(myCreateBiQuadratic)
1760 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n4, n12, n23, n34, n41, force3d);
1762 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, nCenter, id);
1764 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41, nCenter);
1769 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1771 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1774 if ( mySetElemOnShape && myShapeID > 0 )
1775 meshDS->SetMeshElementOnShape( elem, myShapeID );
1780 //=======================================================================
1781 //function : AddPolygonalFace
1782 //purpose : Creates polygon, with additional nodes in quadratic mesh
1783 //=======================================================================
1785 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1789 SMESHDS_Mesh * meshDS = GetMeshDS();
1790 SMDS_MeshFace* elem = 0;
1792 if(!myCreateQuadratic) {
1794 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1796 elem = meshDS->AddPolygonalFace(nodes);
1799 vector<const SMDS_MeshNode*> newNodes;
1800 for ( int i = 0; i < nodes.size(); ++i )
1802 const SMDS_MeshNode* n1 = nodes[i];
1803 const SMDS_MeshNode* n2 = nodes[(i+1)%nodes.size()];
1804 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1805 newNodes.push_back( n1 );
1806 newNodes.push_back( n12 );
1809 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1811 elem = meshDS->AddPolygonalFace(newNodes);
1813 if ( mySetElemOnShape && myShapeID > 0 )
1814 meshDS->SetMeshElementOnShape( elem, myShapeID );
1819 //=======================================================================
1820 //function : AddVolume
1821 //purpose : Creates quadratic or linear prism
1822 //=======================================================================
1824 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1825 const SMDS_MeshNode* n2,
1826 const SMDS_MeshNode* n3,
1827 const SMDS_MeshNode* n4,
1828 const SMDS_MeshNode* n5,
1829 const SMDS_MeshNode* n6,
1833 SMESHDS_Mesh * meshDS = GetMeshDS();
1834 SMDS_MeshVolume* elem = 0;
1835 if(!myCreateQuadratic) {
1837 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1839 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1842 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1843 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1844 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1846 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1847 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1848 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1850 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1851 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1852 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1855 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1856 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1858 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1859 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1861 if ( mySetElemOnShape && myShapeID > 0 )
1862 meshDS->SetMeshElementOnShape( elem, myShapeID );
1867 //=======================================================================
1868 //function : AddVolume
1869 //purpose : Creates quadratic or linear tetrahedron
1870 //=======================================================================
1872 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1873 const SMDS_MeshNode* n2,
1874 const SMDS_MeshNode* n3,
1875 const SMDS_MeshNode* n4,
1879 SMESHDS_Mesh * meshDS = GetMeshDS();
1880 SMDS_MeshVolume* elem = 0;
1881 if(!myCreateQuadratic) {
1883 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1885 elem = meshDS->AddVolume(n1, n2, n3, n4);
1888 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1889 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1890 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1892 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1893 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1894 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1897 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1899 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1901 if ( mySetElemOnShape && myShapeID > 0 )
1902 meshDS->SetMeshElementOnShape( elem, myShapeID );
1907 //=======================================================================
1908 //function : AddVolume
1909 //purpose : Creates quadratic or linear pyramid
1910 //=======================================================================
1912 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1913 const SMDS_MeshNode* n2,
1914 const SMDS_MeshNode* n3,
1915 const SMDS_MeshNode* n4,
1916 const SMDS_MeshNode* n5,
1920 SMDS_MeshVolume* elem = 0;
1921 if(!myCreateQuadratic) {
1923 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1925 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1928 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1929 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1930 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1931 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1933 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1934 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1935 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
1936 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1939 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
1944 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
1946 n15, n25, n35, n45);
1948 if ( mySetElemOnShape && myShapeID > 0 )
1949 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
1954 //=======================================================================
1955 //function : AddVolume
1956 //purpose : Creates bi-quadratic, quadratic or linear hexahedron
1957 //=======================================================================
1959 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1960 const SMDS_MeshNode* n2,
1961 const SMDS_MeshNode* n3,
1962 const SMDS_MeshNode* n4,
1963 const SMDS_MeshNode* n5,
1964 const SMDS_MeshNode* n6,
1965 const SMDS_MeshNode* n7,
1966 const SMDS_MeshNode* n8,
1970 SMESHDS_Mesh * meshDS = GetMeshDS();
1971 SMDS_MeshVolume* elem = 0;
1972 if(!myCreateQuadratic) {
1974 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
1976 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
1979 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1980 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1981 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1982 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1984 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1985 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
1986 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
1987 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
1989 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1990 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
1991 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
1992 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
1993 if(myCreateBiQuadratic)
1995 const SMDS_MeshNode* n1234 = GetCentralNode(n1,n2,n3,n4,n12,n23,n34,n41,force3d);
1996 const SMDS_MeshNode* n1256 = GetCentralNode(n1,n2,n5,n6,n12,n26,n56,n15,force3d);
1997 const SMDS_MeshNode* n2367 = GetCentralNode(n2,n3,n6,n7,n23,n37,n67,n26,force3d);
1998 const SMDS_MeshNode* n3478 = GetCentralNode(n3,n4,n7,n8,n34,n48,n78,n37,force3d);
1999 const SMDS_MeshNode* n1458 = GetCentralNode(n1,n4,n5,n8,n41,n48,n15,n85,force3d);
2000 const SMDS_MeshNode* n5678 = GetCentralNode(n5,n6,n7,n8,n56,n67,n78,n85,force3d);
2002 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
2004 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( n4 );
2005 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( n8 );
2006 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( n3 );
2007 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( n7 );
2008 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( n1 );
2009 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( n5 );
2010 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( n2 );
2011 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( n6 );
2013 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( n48 );
2014 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( n37 );
2015 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( n15 );
2016 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( n26 );
2017 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( n34 );
2018 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( n78 );
2019 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( n12 );
2020 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( n56 );
2021 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( n41 );
2022 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( n85 );
2023 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( n23 );
2024 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( n67 );
2026 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( n3478 );
2027 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( n1256 );
2028 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( n1458 );
2029 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( n2367 );
2030 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( n1234 );
2031 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( n5678 );
2033 gp_XYZ centerCube(0.5, 0.5, 0.5);
2035 SMESH_Block::ShellPoint( centerCube, pointsOnShapes, nCenterElem );
2036 const SMDS_MeshNode* nCenter =
2037 meshDS->AddNode( nCenterElem.X(), nCenterElem.Y(), nCenterElem.Z() );
2038 meshDS->SetNodeInVolume( nCenter, myShapeID );
2041 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2042 n12, n23, n34, n41, n56, n67,
2043 n78, n85, n15, n26, n37, n48,
2044 n1234, n1256, n2367, n3478, n1458, n5678, nCenter, id);
2046 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2047 n12, n23, n34, n41, n56, n67,
2048 n78, n85, n15, n26, n37, n48,
2049 n1234, n1256, n2367, n3478, n1458, n5678, nCenter);
2054 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
2055 n12, n23, n34, n41, n56, n67,
2056 n78, n85, n15, n26, n37, n48, id);
2058 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
2059 n12, n23, n34, n41, n56, n67,
2060 n78, n85, n15, n26, n37, n48);
2063 if ( mySetElemOnShape && myShapeID > 0 )
2064 meshDS->SetMeshElementOnShape( elem, myShapeID );
2069 //=======================================================================
2070 //function : AddVolume
2071 //purpose : Creates LINEAR!!!!!!!!! octahedron
2072 //=======================================================================
2074 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
2075 const SMDS_MeshNode* n2,
2076 const SMDS_MeshNode* n3,
2077 const SMDS_MeshNode* n4,
2078 const SMDS_MeshNode* n5,
2079 const SMDS_MeshNode* n6,
2080 const SMDS_MeshNode* n7,
2081 const SMDS_MeshNode* n8,
2082 const SMDS_MeshNode* n9,
2083 const SMDS_MeshNode* n10,
2084 const SMDS_MeshNode* n11,
2085 const SMDS_MeshNode* n12,
2089 SMESHDS_Mesh * meshDS = GetMeshDS();
2090 SMDS_MeshVolume* elem = 0;
2092 elem = meshDS->AddVolumeWithID(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12,id);
2094 elem = meshDS->AddVolume(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12);
2095 if ( mySetElemOnShape && myShapeID > 0 )
2096 meshDS->SetMeshElementOnShape( elem, myShapeID );
2100 //=======================================================================
2101 //function : AddPolyhedralVolume
2102 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
2103 //=======================================================================
2106 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
2107 const std::vector<int>& quantities,
2111 SMESHDS_Mesh * meshDS = GetMeshDS();
2112 SMDS_MeshVolume* elem = 0;
2113 if(!myCreateQuadratic)
2116 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
2118 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
2122 vector<const SMDS_MeshNode*> newNodes;
2123 vector<int> newQuantities;
2124 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
2126 int nbNodesInFace = quantities[iFace];
2127 newQuantities.push_back(0);
2128 for ( int i = 0; i < nbNodesInFace; ++i )
2130 const SMDS_MeshNode* n1 = nodes[ iN + i ];
2131 newNodes.push_back( n1 );
2132 newQuantities.back()++;
2134 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
2135 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
2136 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
2138 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
2139 newNodes.push_back( n12 );
2140 newQuantities.back()++;
2143 iN += nbNodesInFace;
2146 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
2148 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
2150 if ( mySetElemOnShape && myShapeID > 0 )
2151 meshDS->SetMeshElementOnShape( elem, myShapeID );
2158 //================================================================================
2160 * \brief Check if a node belongs to any face of sub-mesh
2162 //================================================================================
2164 bool isNodeInSubMesh( const SMDS_MeshNode* n, const SMESHDS_SubMesh* sm )
2166 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2167 while ( fIt->more() )
2168 if ( sm->Contains( fIt->next() ))
2174 //=======================================================================
2175 //function : IsSameElemGeometry
2176 //purpose : Returns true if all elements of a sub-mesh are of same shape
2177 //=======================================================================
2179 bool SMESH_MesherHelper::IsSameElemGeometry(const SMESHDS_SubMesh* smDS,
2180 SMDSAbs_GeometryType shape,
2181 const bool nullSubMeshRes)
2183 if ( !smDS ) return nullSubMeshRes;
2185 SMDS_ElemIteratorPtr elemIt = smDS->GetElements();
2186 while ( elemIt->more() ) {
2187 const SMDS_MeshElement* e = elemIt->next();
2188 if ( e->GetGeomType() != shape )
2194 //=======================================================================
2195 //function : LoadNodeColumns
2196 //purpose : Load nodes bound to face into a map of node columns
2197 //=======================================================================
2199 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2200 const TopoDS_Face& theFace,
2201 const TopoDS_Edge& theBaseEdge,
2202 SMESHDS_Mesh* theMesh,
2203 SMESH_ProxyMesh* theProxyMesh)
2205 return LoadNodeColumns(theParam2ColumnMap,
2207 std::list<TopoDS_Edge>(1,theBaseEdge),
2212 //=======================================================================
2213 //function : LoadNodeColumns
2214 //purpose : Load nodes bound to face into a map of node columns
2215 //=======================================================================
2217 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
2218 const TopoDS_Face& theFace,
2219 const std::list<TopoDS_Edge>& theBaseSide,
2220 SMESHDS_Mesh* theMesh,
2221 SMESH_ProxyMesh* theProxyMesh)
2223 // get a right sub-mesh of theFace
2225 const SMESHDS_SubMesh* faceSubMesh = 0;
2228 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
2229 if ( !faceSubMesh ||
2230 faceSubMesh->NbElements() == 0 ||
2231 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
2233 // can use a proxy sub-mesh with not temporary elements only
2239 faceSubMesh = theMesh->MeshElements( theFace );
2240 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
2243 if ( theParam2ColumnMap.empty() )
2245 // get data of edges for normalization of params
2246 vector< double > length;
2248 list<TopoDS_Edge>::const_iterator edge;
2250 for ( edge = theBaseSide.begin(); edge != theBaseSide.end(); ++edge )
2252 double len = std::max( 1e-10, SMESH_Algo::EdgeLength( *edge ));
2254 length.push_back( len );
2258 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
2259 edge = theBaseSide.begin();
2260 for ( int iE = 0; edge != theBaseSide.end(); ++edge, ++iE )
2262 map< double, const SMDS_MeshNode*> sortedBaseNN;
2263 SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN);
2264 if ( sortedBaseNN.empty() ) continue;
2266 map< double, const SMDS_MeshNode*>::iterator u_n = sortedBaseNN.begin();
2267 if ( theProxyMesh ) // from sortedBaseNN remove nodes not shared by faces of faceSubMesh
2269 const SMDS_MeshNode* n1 = (++sortedBaseNN.begin())->second;
2270 const SMDS_MeshNode* n2 = (++sortedBaseNN.rbegin())->second;
2271 bool allNodesAreProxy = ( n1 != theProxyMesh->GetProxyNode( n1 ) &&
2272 n2 != theProxyMesh->GetProxyNode( n2 ));
2273 if ( allNodesAreProxy )
2274 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2275 u_n->second = theProxyMesh->GetProxyNode( u_n->second );
2277 if ( u_n = sortedBaseNN.begin(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2279 while ( ++u_n != sortedBaseNN.end() && !isNodeInSubMesh( u_n->second, faceSubMesh ));
2280 sortedBaseNN.erase( sortedBaseNN.begin(), u_n );
2282 if ( u_n = --sortedBaseNN.end(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2284 while ( u_n != sortedBaseNN.begin() && !isNodeInSubMesh( (--u_n)->second, faceSubMesh ));
2285 sortedBaseNN.erase( ++u_n, sortedBaseNN.end() );
2287 if ( sortedBaseNN.empty() ) continue;
2291 BRep_Tool::Range( *edge, f, l );
2292 if ( edge->Orientation() == TopAbs_REVERSED ) std::swap( f, l );
2293 const double coeff = 1. / ( l - f ) * length[iE] / fullLen;
2294 const double prevPar = theParam2ColumnMap.empty() ? 0 : theParam2ColumnMap.rbegin()->first;
2295 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2297 double par = prevPar + coeff * ( u_n->first - f );
2298 TParam2ColumnMap::iterator u2nn =
2299 theParam2ColumnMap.insert( theParam2ColumnMap.end(), make_pair( par, TNodeColumn()));
2300 u2nn->second.push_back( u_n->second );
2303 if ( theParam2ColumnMap.empty() )
2308 int prevNbRows = theParam2ColumnMap.begin()->second.size(); // current, at least 1 here
2309 int expectedNbRows = faceSubMesh->NbElements() / ( theParam2ColumnMap.size()-1 ); // to be added
2311 // fill theParam2ColumnMap column by column by passing from nodes on
2312 // theBaseEdge up via mesh faces on theFace
2314 TParam2ColumnMap::iterator par_nVec_1, par_nVec_2;
2315 par_nVec_2 = theParam2ColumnMap.begin();
2316 par_nVec_1 = par_nVec_2++;
2317 TIDSortedElemSet emptySet, avoidSet;
2318 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
2320 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
2321 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
2322 nCol1.resize( prevNbRows + expectedNbRows );
2323 nCol2.resize( prevNbRows + expectedNbRows );
2325 int i1, i2, foundNbRows = 0;
2326 const SMDS_MeshNode *n1 = nCol1[ prevNbRows-1 ];
2327 const SMDS_MeshNode *n2 = nCol2[ prevNbRows-1 ];
2328 // find face sharing node n1 and n2 and belonging to faceSubMesh
2329 while ( const SMDS_MeshElement* face =
2330 SMESH_MeshAlgos::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
2332 if ( faceSubMesh->Contains( face ))
2334 int nbNodes = face->NbCornerNodes();
2337 if ( foundNbRows + 1 > expectedNbRows )
2339 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
2340 n2 = face->GetNode( (i1+2) % 4 );
2341 nCol1[ prevNbRows + foundNbRows] = n1;
2342 nCol2[ prevNbRows + foundNbRows] = n2;
2345 avoidSet.insert( face );
2347 if ( foundNbRows != expectedNbRows )
2351 return ( theParam2ColumnMap.size() > 1 &&
2352 theParam2ColumnMap.begin()->second.size() == prevNbRows + expectedNbRows );
2357 //================================================================================
2359 * \brief Return true if a node is at a corner of a 2D structured mesh of FACE
2361 //================================================================================
2363 bool isCornerOfStructure( const SMDS_MeshNode* n,
2364 const SMESHDS_SubMesh* faceSM,
2365 SMESH_MesherHelper& faceAnalyser )
2367 int nbFacesInSM = 0;
2369 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2370 while ( fIt->more() )
2371 nbFacesInSM += faceSM->Contains( fIt->next() );
2373 if ( nbFacesInSM == 1 )
2376 if ( nbFacesInSM == 2 && n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
2378 return faceAnalyser.IsRealSeam( n->getshapeId() );
2384 //=======================================================================
2385 //function : IsStructured
2386 //purpose : Return true if 2D mesh on FACE is structured
2387 //=======================================================================
2389 bool SMESH_MesherHelper::IsStructured( SMESH_subMesh* faceSM )
2391 SMESHDS_SubMesh* fSM = faceSM->GetSubMeshDS();
2392 if ( !fSM || fSM->NbElements() == 0 )
2395 list< TopoDS_Edge > edges;
2396 list< int > nbEdgesInWires;
2397 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( faceSM->GetSubShape() ),
2398 edges, nbEdgesInWires );
2399 if ( nbWires != 1 /*|| nbEdgesInWires.front() != 4*/ ) // allow composite sides
2402 // algo: find corners of a structure and then analyze nb of faces and
2403 // length of structure sides
2405 SMESHDS_Mesh* meshDS = faceSM->GetFather()->GetMeshDS();
2406 SMESH_MesherHelper faceAnalyser( *faceSM->GetFather() );
2407 faceAnalyser.SetSubShape( faceSM->GetSubShape() );
2409 // rotate edges to get the first node being at corner
2410 // (in principle it's not necessary but so far none SALOME algo can make
2411 // such a structured mesh that all corner nodes are not on VERTEXes)
2412 bool isCorner = false;
2413 int nbRemainEdges = nbEdgesInWires.front();
2415 TopoDS_Vertex V = IthVertex( 0, edges.front() );
2416 isCorner = isCornerOfStructure( SMESH_Algo::VertexNode( V, meshDS ),
2419 edges.splice( edges.end(), edges, edges.begin() );
2423 while ( !isCorner && nbRemainEdges > 0 );
2428 // get all nodes from EDGEs
2429 list< const SMDS_MeshNode* > nodes;
2430 list< TopoDS_Edge >::iterator edge = edges.begin();
2431 for ( ; edge != edges.end(); ++edge )
2433 map< double, const SMDS_MeshNode* > u2Nodes;
2434 if ( !SMESH_Algo::GetSortedNodesOnEdge( meshDS, *edge,
2435 /*skipMedium=*/true, u2Nodes ))
2438 list< const SMDS_MeshNode* > edgeNodes;
2439 map< double, const SMDS_MeshNode* >::iterator u2n = u2Nodes.begin();
2440 for ( ; u2n != u2Nodes.end(); ++u2n )
2441 edgeNodes.push_back( u2n->second );
2442 if ( edge->Orientation() == TopAbs_REVERSED )
2443 edgeNodes.reverse();
2445 if ( !nodes.empty() && nodes.back() == edgeNodes.front() )
2446 edgeNodes.pop_front();
2447 nodes.splice( nodes.end(), edgeNodes, edgeNodes.begin(), edgeNodes.end() );
2450 // get length of structured sides
2451 vector<int> nbEdgesInSide;
2453 list< const SMDS_MeshNode* >::iterator n = ++nodes.begin();
2454 for ( ; n != nodes.end(); ++n )
2457 if ( isCornerOfStructure( *n, fSM, faceAnalyser )) {
2458 nbEdgesInSide.push_back( nbEdges );
2464 if ( nbEdgesInSide.size() != 4 )
2466 if ( nbEdgesInSide[0] != nbEdgesInSide[2] )
2468 if ( nbEdgesInSide[1] != nbEdgesInSide[3] )
2470 if ( nbEdgesInSide[0] * nbEdgesInSide[1] != fSM->NbElements() )
2476 //================================================================================
2478 * \brief Find out elements orientation on a geometrical face
2479 * \param theFace - The face correctly oriented in the shape being meshed
2480 * \retval bool - true if the face normal and the normal of first element
2481 * in the correspoding submesh point in different directions
2483 //================================================================================
2485 bool SMESH_MesherHelper::IsReversedSubMesh (const TopoDS_Face& theFace)
2487 if ( theFace.IsNull() )
2490 // find out orientation of a meshed face
2491 int faceID = GetMeshDS()->ShapeToIndex( theFace );
2492 TopoDS_Shape aMeshedFace = GetMeshDS()->IndexToShape( faceID );
2493 bool isReversed = ( theFace.Orientation() != aMeshedFace.Orientation() );
2495 const SMESHDS_SubMesh * aSubMeshDSFace = GetMeshDS()->MeshElements( faceID );
2496 if ( !aSubMeshDSFace )
2499 // find an element with a good normal
2501 bool normalOK = false;
2503 SMDS_ElemIteratorPtr iteratorElem = aSubMeshDSFace->GetElements();
2504 while ( !normalOK && iteratorElem->more() ) // loop on elements on theFace
2506 const SMDS_MeshElement* elem = iteratorElem->next();
2507 if ( elem && elem->NbCornerNodes() > 2 )
2509 SMESH_TNodeXYZ nPnt[3];
2510 SMDS_ElemIteratorPtr nodesIt = elem->nodesIterator();
2511 int iNodeOnFace = 0, iPosDim = SMDS_TOP_VERTEX;
2512 for ( int iN = 0; nodesIt->more() && iN < 3; ++iN) // loop on nodes
2514 nPnt[ iN ] = nodesIt->next();
2515 if ( nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition() > iPosDim )
2518 iPosDim = nPnt[ iN ]._node->GetPosition()->GetTypeOfPosition();
2522 gp_Vec v01( nPnt[0], nPnt[1] ), v02( nPnt[0], nPnt[2] );
2523 if ( v01.SquareMagnitude() > RealSmall() &&
2524 v02.SquareMagnitude() > RealSmall() )
2527 if (( normalOK = ( Ne.SquareMagnitude() > RealSmall() )))
2528 uv = GetNodeUV( theFace, nPnt[iNodeOnFace]._node, 0, &normalOK );
2535 // face normal at node position
2536 TopLoc_Location loc;
2537 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
2538 // if ( surf.IsNull() || surf->Continuity() < GeomAbs_C1 )
2539 // some surfaces not detected as GeomAbs_C1 are nevertheless correct for meshing
2540 if ( surf.IsNull() || surf->Continuity() < GeomAbs_C0 )
2543 MESSAGE("surf->Continuity() < GeomAbs_C1 " << (surf->Continuity() < GeomAbs_C1));
2546 gp_Vec d1u, d1v; gp_Pnt p;
2547 surf->D1( uv.X(), uv.Y(), p, d1u, d1v );
2548 gp_Vec Nf = (d1u ^ d1v).Transformed( loc );
2550 if ( theFace.Orientation() == TopAbs_REVERSED )
2553 return Ne * Nf < 0.;
2556 //=======================================================================
2558 //purpose : Count nb of sub-shapes
2559 //=======================================================================
2561 int SMESH_MesherHelper::Count(const TopoDS_Shape& shape,
2562 const TopAbs_ShapeEnum type,
2563 const bool ignoreSame)
2566 TopTools_IndexedMapOfShape map;
2567 TopExp::MapShapes( shape, type, map );
2568 return map.Extent();
2572 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2578 //=======================================================================
2579 //function : NbAncestors
2580 //purpose : Return number of unique ancestors of the shape
2581 //=======================================================================
2583 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
2584 const SMESH_Mesh& mesh,
2585 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
2587 TopTools_MapOfShape ancestors;
2588 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
2589 for ( ; ansIt.More(); ansIt.Next() ) {
2590 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
2591 ancestors.Add( ansIt.Value() );
2593 return ancestors.Extent();
2596 //=======================================================================
2597 //function : GetSubShapeOri
2598 //purpose : Return orientation of sub-shape in the main shape
2599 //=======================================================================
2601 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
2602 const TopoDS_Shape& subShape)
2604 TopAbs_Orientation ori = TopAbs_Orientation(-1);
2605 if ( !shape.IsNull() && !subShape.IsNull() )
2607 TopExp_Explorer e( shape, subShape.ShapeType() );
2608 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
2609 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
2610 for ( ; e.More(); e.Next())
2611 if ( subShape.IsSame( e.Current() ))
2614 ori = e.Current().Orientation();
2619 //=======================================================================
2620 //function : IsSubShape
2622 //=======================================================================
2624 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
2625 const TopoDS_Shape& mainShape )
2627 if ( !shape.IsNull() && !mainShape.IsNull() )
2629 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
2632 if ( shape.IsSame( exp.Current() ))
2635 SCRUTE((shape.IsNull()));
2636 SCRUTE((mainShape.IsNull()));
2640 //=======================================================================
2641 //function : IsSubShape
2643 //=======================================================================
2645 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
2647 if ( shape.IsNull() || !aMesh )
2650 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
2652 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
2655 //================================================================================
2657 * \brief Return maximal tolerance of shape
2659 //================================================================================
2661 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
2663 double tol = Precision::Confusion();
2664 TopExp_Explorer exp;
2665 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
2666 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
2667 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
2668 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
2669 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
2670 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
2675 //================================================================================
2677 * \brief Return an angle between two EDGEs sharing a common VERTEX with reference
2678 * of the FACE normal
2679 * \return double - the angle (between -Pi and Pi), negative if the angle is concave,
2680 * 1e100 in case of failure
2681 * \waring Care about order of the EDGEs and their orientation to be as they are
2682 * within the FACE! Don't pass degenerated EDGEs neither!
2684 //================================================================================
2686 double SMESH_MesherHelper::GetAngle( const TopoDS_Edge & theE1,
2687 const TopoDS_Edge & theE2,
2688 const TopoDS_Face & theFace)
2690 double angle = 1e100;
2693 TopoDS_Vertex vCommon;
2694 if ( !TopExp::CommonVertex( theE1, theE2, vCommon ))
2697 Handle(Geom_Curve) c1 = BRep_Tool::Curve( theE1, f,l );
2698 Handle(Geom_Curve) c2 = BRep_Tool::Curve( theE2, f,l );
2699 Handle(Geom2d_Curve) c2d1 = BRep_Tool::CurveOnSurface( theE1, theFace, f,l );
2700 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace );
2701 double p1 = BRep_Tool::Parameter( vCommon, theE1 );
2702 double p2 = BRep_Tool::Parameter( vCommon, theE2 );
2703 if ( c1.IsNull() || c2.IsNull() )
2705 gp_XY uv = c2d1->Value( p1 ).XY();
2706 gp_Vec du, dv; gp_Pnt p;
2707 surf->D1( uv.X(), uv.Y(), p, du, dv );
2708 gp_Vec vec1, vec2, vecRef = du ^ dv;
2711 while ( vecRef.SquareMagnitude() < std::numeric_limits<double>::min() )
2713 double dp = ( l - f ) / 1000.;
2714 p1tmp += dp * (( Abs( p1 - f ) > Abs( p1 - l )) ? +1. : -1.);
2715 uv = c2d1->Value( p1tmp ).XY();
2716 surf->D1( uv.X(), uv.Y(), p, du, dv );
2718 if ( ++nbLoops > 10 )
2721 cout << "SMESH_MesherHelper::GetAngle(): Captured in a sigularity" << endl;
2726 if ( theFace.Orientation() == TopAbs_REVERSED )
2728 c1->D1( p1, p, vec1 );
2729 c2->D1( p2, p, vec2 );
2730 TopoDS_Face F = theFace;
2731 if ( F.Orientation() == TopAbs_INTERNAL )
2732 F.Orientation( TopAbs_FORWARD );
2733 if ( theE1.Orientation() /*GetSubShapeOri( F, theE1 )*/ == TopAbs_REVERSED )
2735 if ( theE2.Orientation() /*GetSubShapeOri( F, theE2 )*/ == TopAbs_REVERSED )
2737 angle = vec1.AngleWithRef( vec2, vecRef );
2745 //================================================================================
2747 * \brief Check if the first and last vertices of an edge are the same
2748 * \param anEdge - the edge to check
2749 * \retval bool - true if same
2751 //================================================================================
2753 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
2755 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2756 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
2757 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
2760 //================================================================================
2762 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
2763 * in the case of INTERNAL edge
2765 //================================================================================
2767 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
2771 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2772 anEdge.Orientation( TopAbs_FORWARD );
2774 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
2775 TopoDS_Iterator vIt( anEdge, CumOri );
2776 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
2779 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
2782 //================================================================================
2784 * \brief Return type of shape contained in a group
2785 * \param group - a shape of type TopAbs_COMPOUND
2786 * \param avoidCompound - not to return TopAbs_COMPOUND
2788 //================================================================================
2790 TopAbs_ShapeEnum SMESH_MesherHelper::GetGroupType(const TopoDS_Shape& group,
2791 const bool avoidCompound)
2793 if ( !group.IsNull() )
2795 if ( group.ShapeType() != TopAbs_COMPOUND )
2796 return group.ShapeType();
2798 // iterate on a compound
2799 TopoDS_Iterator it( group );
2801 return avoidCompound ? GetGroupType( it.Value() ) : it.Value().ShapeType();
2803 return TopAbs_SHAPE;
2806 //=======================================================================
2807 //function : IsQuadraticMesh
2808 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
2809 // quadratic elements will be created.
2810 // Used then generated 3D mesh without geometry.
2811 //=======================================================================
2813 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
2815 int NbAllEdgsAndFaces=0;
2816 int NbQuadFacesAndEdgs=0;
2817 int NbFacesAndEdges=0;
2818 //All faces and edges
2819 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
2820 if ( NbAllEdgsAndFaces == 0 )
2821 return SMESH_MesherHelper::LINEAR;
2823 //Quadratic faces and edges
2824 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
2826 //Linear faces and edges
2827 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
2829 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
2831 return SMESH_MesherHelper::QUADRATIC;
2833 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
2835 return SMESH_MesherHelper::LINEAR;
2838 //Mesh with both type of elements
2839 return SMESH_MesherHelper::COMP;
2842 //=======================================================================
2843 //function : GetOtherParam
2844 //purpose : Return an alternative parameter for a node on seam
2845 //=======================================================================
2847 double SMESH_MesherHelper::GetOtherParam(const double param) const
2849 int i = myParIndex & U_periodic ? 0 : 1;
2850 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
2855 //=======================================================================
2857 * \brief Iterator on ancestors of the given type
2859 //=======================================================================
2861 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
2863 TopTools_ListIteratorOfListOfShape _ancIter;
2864 TopAbs_ShapeEnum _type;
2865 TopTools_MapOfShape _encountered;
2866 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
2867 : _ancIter( ancestors ), _type( type )
2869 if ( _ancIter.More() ) {
2870 if ( _ancIter.Value().ShapeType() != _type ) next();
2871 else _encountered.Add( _ancIter.Value() );
2876 return _ancIter.More();
2878 virtual const TopoDS_Shape* next()
2880 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
2881 if ( _ancIter.More() )
2882 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
2883 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
2891 //=======================================================================
2893 * \brief Return iterator on ancestors of the given type
2895 //=======================================================================
2897 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
2898 const SMESH_Mesh& mesh,
2899 TopAbs_ShapeEnum ancestorType)
2901 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
2904 //=======================================================================
2905 //function : GetCommonAncestor
2906 //purpose : Find a common ancestors of two shapes of the given type
2907 //=======================================================================
2909 TopoDS_Shape SMESH_MesherHelper::GetCommonAncestor(const TopoDS_Shape& shape1,
2910 const TopoDS_Shape& shape2,
2911 const SMESH_Mesh& mesh,
2912 TopAbs_ShapeEnum ancestorType)
2914 TopoDS_Shape commonAnc;
2915 if ( !shape1.IsNull() && !shape2.IsNull() )
2917 PShapeIteratorPtr ancIt = GetAncestors( shape1, mesh, ancestorType );
2918 while ( const TopoDS_Shape* anc = ancIt->next() )
2919 if ( IsSubShape( shape2, *anc ))
2928 //#include <Perf_Meter.hxx>
2930 //=======================================================================
2931 namespace { // Structures used by FixQuadraticElements()
2932 //=======================================================================
2934 #define __DMP__(txt) \
2936 #define MSG(txt) __DMP__(txt<<endl)
2937 #define MSGBEG(txt) __DMP__(txt)
2939 //const double straightTol2 = 1e-33; // to detect straing links
2940 bool isStraightLink(double linkLen2, double middleNodeMove2)
2942 // straight if <node move> < 1/15 * <link length>
2943 return middleNodeMove2 < 1/15./15. * linkLen2;
2947 // ---------------------------------------
2949 * \brief Quadratic link knowing its faces
2951 struct QLink: public SMESH_TLink
2953 const SMDS_MeshNode* _mediumNode;
2954 mutable vector<const QFace* > _faces;
2955 mutable gp_Vec _nodeMove;
2956 mutable int _nbMoves;
2958 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
2959 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
2961 //if ( MediumPos() != SMDS_TOP_3DSPACE )
2962 _nodeMove = MediumPnt() - MiddlePnt();
2964 void SetContinuesFaces() const;
2965 const QFace* GetContinuesFace( const QFace* face ) const;
2966 bool OnBoundary() const;
2967 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
2968 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
2970 SMDS_TypeOfPosition MediumPos() const
2971 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
2972 SMDS_TypeOfPosition EndPos(bool isSecond) const
2973 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
2974 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
2975 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
2977 void Move(const gp_Vec& move, bool sum=false) const
2978 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
2979 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
2980 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
2981 bool IsStraight() const
2982 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
2983 _nodeMove.SquareMagnitude());
2985 bool operator<(const QLink& other) const {
2986 return (node1()->GetID() == other.node1()->GetID() ?
2987 node2()->GetID() < other.node2()->GetID() :
2988 node1()->GetID() < other.node1()->GetID());
2990 // struct PtrComparator {
2991 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
2994 // ---------------------------------------------------------
2996 * \brief Link in the chain of links; it connects two faces
3000 const QLink* _qlink;
3001 mutable const QFace* _qfaces[2];
3003 TChainLink(const QLink* qlink=0):_qlink(qlink) {
3004 _qfaces[0] = _qfaces[1] = 0;
3006 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
3008 bool IsBoundary() const { return !_qfaces[1]; }
3010 void RemoveFace( const QFace* face ) const
3011 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
3013 const QFace* NextFace( const QFace* f ) const
3014 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
3016 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
3017 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
3019 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
3021 operator bool() const { return (_qlink); }
3023 const QLink* operator->() const { return _qlink; }
3025 gp_Vec Normal() const;
3027 bool IsStraight() const;
3029 // --------------------------------------------------------------------
3030 typedef list< TChainLink > TChain;
3031 typedef set < TChainLink > TLinkSet;
3032 typedef TLinkSet::const_iterator TLinkInSet;
3034 const int theFirstStep = 5;
3036 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
3037 // --------------------------------------------------------------------
3039 * \brief Quadratic face shared by two volumes and bound by QLinks
3041 struct QFace: public TIDSortedNodeSet
3043 mutable const SMDS_MeshElement* _volumes[2];
3044 mutable vector< const QLink* > _sides;
3045 mutable bool _sideIsAdded[4]; // added in chain of links
3048 mutable const SMDS_MeshElement* _face;
3051 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
3053 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
3055 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
3057 void AddSelfToLinks() const {
3058 for ( int i = 0; i < _sides.size(); ++i )
3059 _sides[i]->_faces.push_back( this );
3061 int LinkIndex( const QLink* side ) const {
3062 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
3065 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
3067 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
3069 int i = LinkIndex( link._qlink );
3070 if ( i < 0 ) return true;
3071 _sideIsAdded[i] = true;
3072 link.SetFace( this );
3073 // continue from opposite link
3074 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
3076 bool IsBoundary() const { return !_volumes[1]; }
3078 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
3080 bool IsSpoiled(const QLink* bentLink ) const;
3082 TLinkInSet GetBoundaryLink( const TLinkSet& links,
3083 const TChainLink& avoidLink,
3084 TLinkInSet * notBoundaryLink = 0,
3085 const SMDS_MeshNode* nodeToContain = 0,
3086 bool * isAdjacentUsed = 0,
3087 int nbRecursionsLeft = -1) const;
3089 TLinkInSet GetLinkByNode( const TLinkSet& links,
3090 const TChainLink& avoidLink,
3091 const SMDS_MeshNode* nodeToContain) const;
3093 const SMDS_MeshNode* GetNodeInFace() const {
3094 for ( int iL = 0; iL < _sides.size(); ++iL )
3095 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
3099 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
3101 double MoveByBoundary( const TChainLink& theLink,
3102 const gp_Vec& theRefVec,
3103 const TLinkSet& theLinks,
3104 SMESH_MesherHelper* theFaceHelper=0,
3105 const double thePrevLen=0,
3106 const int theStep=theFirstStep,
3107 gp_Vec* theLinkNorm=0,
3108 double theSign=1.0) const;
3111 //================================================================================
3113 * \brief Dump QLink and QFace
3115 ostream& operator << (ostream& out, const QLink& l)
3117 out <<"QLink nodes: "
3118 << l.node1()->GetID() << " - "
3119 << l._mediumNode->GetID() << " - "
3120 << l.node2()->GetID() << endl;
3123 ostream& operator << (ostream& out, const QFace& f)
3125 out <<"QFace nodes: "/*<< &f << " "*/;
3126 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
3127 out << (*n)->GetID() << " ";
3128 out << " \tvolumes: "
3129 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
3130 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
3131 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
3135 //================================================================================
3137 * \brief Construct QFace from QLinks
3139 //================================================================================
3141 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
3143 _volumes[0] = _volumes[1] = 0;
3145 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
3146 _normal.SetCoord(0,0,0);
3147 for ( int i = 1; i < _sides.size(); ++i ) {
3148 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
3149 insert( l1->node1() ); insert( l1->node2() );
3151 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
3152 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
3153 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
3157 double normSqSize = _normal.SquareMagnitude();
3158 if ( normSqSize > numeric_limits<double>::min() )
3159 _normal /= sqrt( normSqSize );
3161 _normal.SetCoord(1e-33,0,0);
3167 //================================================================================
3169 * \brief Make up a chain of links
3170 * \param iSide - link to add first
3171 * \param chain - chain to fill in
3172 * \param pos - postion of medium nodes the links should have
3173 * \param error - out, specifies what is wrong
3174 * \retval bool - false if valid chain can't be built; "valid" means that links
3175 * of the chain belongs to rectangles bounding hexahedrons
3177 //================================================================================
3179 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
3181 if ( iSide >= _sides.size() ) // wrong argument iSide
3183 if ( _sideIsAdded[ iSide ]) // already in chain
3186 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
3189 list< const QFace* > faces( 1, this );
3190 while ( !faces.empty() ) {
3191 const QFace* face = faces.front();
3192 for ( int i = 0; i < face->_sides.size(); ++i ) {
3193 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
3194 face->_sideIsAdded[i] = true;
3195 // find a face side in the chain
3196 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
3197 // TChain::iterator chLink = chain.begin();
3198 // for ( ; chLink != chain.end(); ++chLink )
3199 // if ( chLink->_qlink == face->_sides[i] )
3201 // if ( chLink == chain.end() )
3202 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
3203 // add a face to a chained link and put a continues face in the queue
3204 chLink->SetFace( face );
3205 if ( face->_sides[i]->MediumPos() == pos )
3206 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
3207 if ( contFace->_sides.size() == 3 )
3208 faces.push_back( contFace );
3213 if ( error < ERR_TRI )
3215 chain.insert( chain.end(), links.begin(),links.end() );
3218 _sideIsAdded[iSide] = true; // not to add this link to chain again
3219 const QLink* link = _sides[iSide];
3223 // add link into chain
3224 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
3225 chLink->SetFace( this );
3228 // propagate from a quadrangle to neighbour faces
3229 if ( link->MediumPos() >= pos ) {
3230 int nbLinkFaces = link->_faces.size();
3231 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
3232 // hexahedral mesh or boundary quadrangles - goto a continous face
3233 if ( const QFace* f = link->GetContinuesFace( this ))
3234 if ( f->_sides.size() == 4 )
3235 return f->GetLinkChain( *chLink, chain, pos, error );
3238 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
3239 for ( int i = 0; i < nbLinkFaces; ++i )
3240 if ( link->_faces[i] )
3241 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
3242 if ( error < ERR_PRISM )
3250 //================================================================================
3252 * \brief Return a boundary link of the triangle face
3253 * \param links - set of all links
3254 * \param avoidLink - link not to return
3255 * \param notBoundaryLink - out, neither the returned link nor avoidLink
3256 * \param nodeToContain - node the returned link must contain; if provided, search
3257 * also performed on adjacent faces
3258 * \param isAdjacentUsed - returns true if link is found in adjacent faces
3259 * \param nbRecursionsLeft - to limit recursion
3261 //================================================================================
3263 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
3264 const TChainLink& avoidLink,
3265 TLinkInSet * notBoundaryLink,
3266 const SMDS_MeshNode* nodeToContain,
3267 bool * isAdjacentUsed,
3268 int nbRecursionsLeft) const
3270 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
3272 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
3273 TFaceLinkList adjacentFaces;
3275 for ( int iL = 0; iL < _sides.size(); ++iL )
3277 if ( avoidLink._qlink == _sides[iL] )
3279 TLinkInSet link = links.find( _sides[iL] );
3280 if ( link == linksEnd ) continue;
3281 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
3282 continue; // We work on faces here, don't go inside a solid
3285 if ( link->IsBoundary() ) {
3286 if ( !nodeToContain ||
3287 (*link)->node1() == nodeToContain ||
3288 (*link)->node2() == nodeToContain )
3290 boundaryLink = link;
3291 if ( !notBoundaryLink ) break;
3294 else if ( notBoundaryLink ) {
3295 *notBoundaryLink = link;
3296 if ( boundaryLink != linksEnd ) break;
3299 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
3300 if ( const QFace* adj = link->NextFace( this ))
3301 if ( adj->Contains( nodeToContain ))
3302 adjacentFaces.push_back( make_pair( adj, link ));
3305 if ( isAdjacentUsed ) *isAdjacentUsed = false;
3306 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
3308 if ( nbRecursionsLeft < 0 )
3309 nbRecursionsLeft = nodeToContain->NbInverseElements();
3310 TFaceLinkList::iterator adj = adjacentFaces.begin();
3311 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
3312 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
3313 isAdjacentUsed, nbRecursionsLeft-1);
3314 if ( isAdjacentUsed ) *isAdjacentUsed = true;
3316 return boundaryLink;
3318 //================================================================================
3320 * \brief Return a link ending at the given node but not avoidLink
3322 //================================================================================
3324 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
3325 const TChainLink& avoidLink,
3326 const SMDS_MeshNode* nodeToContain) const
3328 for ( int i = 0; i < _sides.size(); ++i )
3329 if ( avoidLink._qlink != _sides[i] &&
3330 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
3331 return links.find( _sides[ i ]);
3335 //================================================================================
3337 * \brief Return normal to the i-th side pointing outside the face
3339 //================================================================================
3341 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
3343 gp_Vec norm, vecOut;
3344 // if ( uvHelper ) {
3345 // TopoDS_Face face = TopoDS::Face( uvHelper->GetSubShape());
3346 // const SMDS_MeshNode* inFaceNode = uvHelper->GetNodeUVneedInFaceNode() ? GetNodeInFace() : 0;
3347 // gp_XY uv1 = uvHelper->GetNodeUV( face, _sides[i]->node1(), inFaceNode );
3348 // gp_XY uv2 = uvHelper->GetNodeUV( face, _sides[i]->node2(), inFaceNode );
3349 // norm.SetCoord( uv1.Y() - uv2.Y(), uv2.X() - uv1.X(), 0 );
3351 // const QLink* otherLink = _sides[(i + 1) % _sides.size()];
3352 // const SMDS_MeshNode* otherNode =
3353 // otherLink->node1() == _sides[i]->node1() ? otherLink->node2() : otherLink->node1();
3354 // gp_XY pIn = uvHelper->GetNodeUV( face, otherNode, inFaceNode );
3355 // vecOut.SetCoord( uv1.X() - pIn.X(), uv1.Y() - pIn.Y(), 0 );
3358 norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3359 gp_XYZ pIn = ( XYZ( _sides[0]->node1() ) +
3360 XYZ( _sides[0]->node2() ) +
3361 XYZ( _sides[1]->node1() )) / 3.;
3362 vecOut.SetXYZ( _sides[i]->MiddlePnt() - pIn );
3364 if ( norm * vecOut < 0 )
3366 double mag2 = norm.SquareMagnitude();
3367 if ( mag2 > numeric_limits<double>::min() )
3368 norm /= sqrt( mag2 );
3371 //================================================================================
3373 * \brief Move medium node of theLink according to its distance from boundary
3374 * \param theLink - link to fix
3375 * \param theRefVec - movement of boundary
3376 * \param theLinks - all adjacent links of continous triangles
3377 * \param theFaceHelper - helper is not used so far
3378 * \param thePrevLen - distance from the boundary
3379 * \param theStep - number of steps till movement propagation limit
3380 * \param theLinkNorm - out normal to theLink
3381 * \param theSign - 1 or -1 depending on movement of boundary
3382 * \retval double - distance from boundary to propagation limit or other boundary
3384 //================================================================================
3386 double QFace::MoveByBoundary( const TChainLink& theLink,
3387 const gp_Vec& theRefVec,
3388 const TLinkSet& theLinks,
3389 SMESH_MesherHelper* theFaceHelper,
3390 const double thePrevLen,
3392 gp_Vec* theLinkNorm,
3393 double theSign) const
3396 return thePrevLen; // propagation limit reached
3398 int iL; // index of theLink
3399 for ( iL = 0; iL < _sides.size(); ++iL )
3400 if ( theLink._qlink == _sides[ iL ])
3403 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
3404 <<" thePrevLen " << thePrevLen);
3405 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
3407 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
3408 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
3409 if ( theStep == theFirstStep )
3410 theSign = refProj < 0. ? -1. : 1.;
3411 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
3412 return thePrevLen; // to propagate movement forward only, not in side dir or backward
3414 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
3415 TLinkInSet link1 = theLinks.find( _sides[iL1] );
3416 TLinkInSet link2 = theLinks.find( _sides[iL2] );
3417 if ( link1 == theLinks.end() || link2 == theLinks.end() )
3419 const QFace* f1 = link1->NextFace( this ); // adjacent faces
3420 const QFace* f2 = link2->NextFace( this );
3422 // propagate to adjacent faces till limit step or boundary
3423 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
3424 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
3425 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
3426 gp_Vec linkDir2(0,0,0);
3429 if ( f1 && theLink->MediumPos() <= (*link1)->MediumPos() )
3430 len1 = f1->MoveByBoundary
3431 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
3433 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
3435 MSG( " --------------- EXCEPTION");
3440 if ( f2 && theLink->MediumPos() <= (*link2)->MediumPos() )
3441 len2 = f2->MoveByBoundary
3442 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
3444 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
3446 MSG( " --------------- EXCEPTION");
3451 if ( theStep != theFirstStep )
3453 // choose chain length by direction of propagation most codirected with theRefVec
3454 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
3455 fullLen = choose1 ? len1 : len2;
3456 double r = thePrevLen / fullLen;
3458 gp_Vec move = linkNorm * refProj * ( 1 - r );
3459 theLink->Move( move, true );
3461 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
3462 " by " << refProj * ( 1 - r ) << " following " <<
3463 (choose1 ? *link1->_qlink : *link2->_qlink));
3465 if ( theLinkNorm ) *theLinkNorm = linkNorm;
3470 //================================================================================
3472 * \brief Checks if the face is distorted due to bentLink
3474 //================================================================================
3476 bool QFace::IsSpoiled(const QLink* bentLink ) const
3478 // code is valid for convex faces only
3480 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
3481 gc += XYZ( *n ) / size();
3482 for (unsigned i = 0; i < _sides.size(); ++i )
3484 if ( _sides[i] == bentLink ) continue;
3485 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3486 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
3487 if ( linkNorm * vecOut < 0 )
3489 double mag2 = linkNorm.SquareMagnitude();
3490 if ( mag2 > numeric_limits<double>::min() )
3491 linkNorm /= sqrt( mag2 );
3492 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
3493 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
3494 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
3501 //================================================================================
3503 * \brief Find pairs of continues faces
3505 //================================================================================
3507 void QLink::SetContinuesFaces() const
3509 // x0 x - QLink, [-|] - QFace, v - volume
3511 // | Between _faces of link x2 two vertical faces are continues
3512 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
3513 // | to _faces[0] and _faces[1] and horizontal faces to
3514 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
3517 if ( _faces.empty() )
3519 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
3520 if ( _faces[0]->IsBoundary() )
3521 iBoundary[ nbBoundary++ ] = 0;
3522 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
3524 // look for a face bounding none of volumes bound by _faces[0]
3525 bool sameVol = false;
3526 int nbVol = _faces[iF]->NbVolumes();
3527 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
3528 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
3529 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
3532 if ( _faces[iF]->IsBoundary() )
3533 iBoundary[ nbBoundary++ ] = iF;
3535 // Set continues faces: arrange _faces to have
3536 // _faces[0] continues to _faces[1]
3537 // _faces[2] continues to _faces[3]
3538 if ( nbBoundary == 2 ) // bnd faces are continues
3540 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
3542 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
3543 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
3546 else if ( iFaceCont > 0 ) // continues faces found
3548 if ( iFaceCont != 1 )
3549 std::swap( _faces[1], _faces[iFaceCont] );
3551 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
3553 _faces.insert( ++_faces.begin(), 0 );
3556 //================================================================================
3558 * \brief Return a face continues to the given one
3560 //================================================================================
3562 const QFace* QLink::GetContinuesFace( const QFace* face ) const
3564 for ( int i = 0; i < _faces.size(); ++i ) {
3565 if ( _faces[i] == face ) {
3566 int iF = i < 2 ? 1-i : 5-i;
3567 return iF < _faces.size() ? _faces[iF] : 0;
3572 //================================================================================
3574 * \brief True if link is on mesh boundary
3576 //================================================================================
3578 bool QLink::OnBoundary() const
3580 for ( int i = 0; i < _faces.size(); ++i )
3581 if (_faces[i] && _faces[i]->IsBoundary()) return true;
3584 //================================================================================
3586 * \brief Return normal of link of the chain
3588 //================================================================================
3590 gp_Vec TChainLink::Normal() const {
3592 if (_qfaces[0]) norm = _qfaces[0]->_normal;
3593 if (_qfaces[1]) norm += _qfaces[1]->_normal;
3596 //================================================================================
3598 * \brief Test link curvature taking into account size of faces
3600 //================================================================================
3602 bool TChainLink::IsStraight() const
3604 bool isStraight = _qlink->IsStraight();
3605 if ( isStraight && _qfaces[0] && !_qfaces[1] )
3607 int i = _qfaces[0]->LinkIndex( _qlink );
3608 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
3609 gp_XYZ mid1 = _qlink->MiddlePnt();
3610 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
3611 double faceSize2 = (mid1-mid2).SquareModulus();
3612 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
3617 //================================================================================
3619 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
3621 //================================================================================
3623 void fixPrism( TChain& allLinks )
3625 // separate boundary links from internal ones
3626 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
3627 QLinkSet interLinks, bndLinks1, bndLink2;
3629 bool isCurved = false;
3630 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3631 if ( (*lnk)->OnBoundary() )
3632 bndLinks1.insert( lnk->_qlink );
3634 interLinks.insert( lnk->_qlink );
3635 isCurved = isCurved || !lnk->IsStraight();
3638 return; // no need to move
3640 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
3642 while ( !interLinks.empty() && !curBndLinks->empty() )
3644 // propagate movement from boundary links to connected internal links
3645 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
3646 for ( ; bnd != bndEnd; ++bnd )
3648 const QLink* bndLink = *bnd;
3649 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
3651 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
3652 if ( !face ) continue;
3653 // find and move internal link opposite to bndLink within the face
3654 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
3655 const QLink* interLink = face->_sides[ interInd ];
3656 QLinkSet::iterator pInterLink = interLinks.find( interLink );
3657 if ( pInterLink == interLinks.end() ) continue; // not internal link
3658 interLink->Move( bndLink->_nodeMove );
3659 // treated internal links become new boundary ones
3660 interLinks.erase( pInterLink );
3661 newBndLinks->insert( interLink );
3664 curBndLinks->clear();
3665 std::swap( curBndLinks, newBndLinks );
3669 //================================================================================
3671 * \brief Fix links of continues triangles near curved boundary
3673 //================================================================================
3675 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
3677 if ( allLinks.empty() ) return;
3679 TLinkSet linkSet( allLinks.begin(), allLinks.end());
3680 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
3682 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
3684 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
3686 // move iff a boundary link is bent towards inside of a face (issue 0021084)
3687 const QFace* face = linkIt->_qfaces[0];
3688 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
3689 face->_sides[1]->MiddlePnt() +
3690 face->_sides[2]->MiddlePnt() ) / 3.;
3691 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
3692 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
3693 //if ( face->IsSpoiled( linkIt->_qlink ))
3694 if ( linkBentInside )
3695 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
3700 //================================================================================
3702 * \brief Detect rectangular structure of links and build chains from them
3704 //================================================================================
3706 enum TSplitTriaResult {
3707 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
3708 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
3710 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
3711 vector< TChain> & resultChains,
3712 SMDS_TypeOfPosition pos )
3714 // put links in the set and evalute number of result chains by number of boundary links
3717 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3718 linkSet.insert( *lnk );
3719 nbBndLinks += lnk->IsBoundary();
3721 resultChains.clear();
3722 resultChains.reserve( nbBndLinks / 2 );
3724 TLinkInSet linkIt, linksEnd = linkSet.end();
3726 // find a boundary link with corner node; corner node has position pos-2
3727 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
3729 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
3730 const SMDS_MeshNode* corner = 0;
3731 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
3732 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
3737 TLinkInSet startLink = linkIt;
3738 const SMDS_MeshNode* startCorner = corner;
3739 vector< TChain* > rowChains;
3742 while ( startLink != linksEnd) // loop on columns
3744 // We suppose we have a rectangular structure like shown here. We have found a
3745 // corner of the rectangle (startCorner) and a boundary link sharing
3746 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
3747 // --o---o---o structure making several chains at once. One chain (columnChain)
3748 // |\ | /| starts at startLink and continues upward (we look at the structure
3749 // \ | \ | / | from such point that startLink is on the bottom of the structure).
3750 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
3751 // --o---o---o encounter.
3753 // / | \ | \ | startCorner
3758 if ( resultChains.size() == nbBndLinks / 2 )
3760 resultChains.push_back( TChain() );
3761 TChain& columnChain = resultChains.back();
3763 TLinkInSet botLink = startLink; // current horizontal link to go up from
3764 corner = startCorner; // current corner the botLink ends at
3766 while ( botLink != linksEnd ) // loop on rows
3768 // add botLink to the columnChain
3769 columnChain.push_back( *botLink );
3771 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
3773 { // the column ends
3774 if ( botLink == startLink )
3775 return _TWISTED_CHAIN; // issue 0020951
3776 linkSet.erase( botLink );
3777 if ( iRow != rowChains.size() )
3778 return _FEW_ROWS; // different nb of rows in columns
3781 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
3782 // link ending at <corner> (sideLink); there are two cases:
3783 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
3784 // since midQuadLink is not at boundary while sideLink is.
3785 // 2) midQuadLink ends at <corner>
3787 TLinkInSet midQuadLink = linksEnd;
3788 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
3790 if ( isCase2 ) { // find midQuadLink among links of botTria
3791 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
3792 if ( midQuadLink->IsBoundary() )
3793 return _BAD_MIDQUAD;
3795 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
3796 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
3799 columnChain.push_back( *midQuadLink );
3800 if ( iRow >= rowChains.size() ) {
3802 return _MANY_ROWS; // different nb of rows in columns
3803 if ( resultChains.size() == nbBndLinks / 2 )
3805 resultChains.push_back( TChain() );
3806 rowChains.push_back( & resultChains.back() );
3808 rowChains[iRow]->push_back( *sideLink );
3809 rowChains[iRow]->push_back( *midQuadLink );
3811 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
3815 // prepare startCorner and startLink for the next column
3816 startCorner = startLink->NextNode( startCorner );
3818 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
3820 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
3821 // check if no more columns remains
3822 if ( startLink != linksEnd ) {
3823 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
3824 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
3825 startLink = linksEnd; // startLink bounds upTria or botTria
3826 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
3830 // find bottom link and corner for the next row
3831 corner = sideLink->NextNode( corner );
3832 // next bottom link ends at the new corner
3833 linkSet.erase( botLink );
3834 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
3835 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
3837 if ( midQuadLink == startLink || sideLink == startLink )
3838 return _TWISTED_CHAIN; // issue 0020951
3839 linkSet.erase( midQuadLink );
3840 linkSet.erase( sideLink );
3842 // make faces neighboring the found ones be boundary
3843 if ( startLink != linksEnd ) {
3844 const QFace* tria = isCase2 ? botTria : upTria;
3845 for ( int iL = 0; iL < 3; ++iL ) {
3846 linkIt = linkSet.find( tria->_sides[iL] );
3847 if ( linkIt != linksEnd )
3848 linkIt->RemoveFace( tria );
3851 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
3852 botLink->RemoveFace( upTria ); // make next botTria first in vector
3859 // In the linkSet, there must remain the last links of rowChains; add them
3860 if ( linkSet.size() != rowChains.size() )
3861 return _BAD_SET_SIZE;
3862 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
3863 // find the link (startLink) ending at startCorner
3865 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
3866 if ( (*startLink)->node1() == startCorner ) {
3867 corner = (*startLink)->node2(); break;
3869 else if ( (*startLink)->node2() == startCorner) {
3870 corner = (*startLink)->node1(); break;
3873 if ( startLink == linksEnd )
3875 rowChains[ iRow ]->push_back( *startLink );
3876 linkSet.erase( startLink );
3877 startCorner = corner;
3883 //================================================================================
3885 * \brief Place medium nodes at the link middle for elements whose corner nodes
3886 * are out of geometrical boundary to prevent distorting elements.
3887 * Issue 0020982, note 0013990
3889 //================================================================================
3891 void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
3892 SMESH_ComputeErrorPtr& theError)
3894 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
3895 TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
3896 if ( shape.IsNull() ) return;
3898 if ( !theError ) theError = SMESH_ComputeError::New();
3902 if ( shape.ShapeType() == TopAbs_FACE ) // 2D
3904 if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
3906 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
3907 if ( !faceSM ) return;
3909 const TopoDS_Face& face = TopoDS::Face( shape );
3910 Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
3912 TopExp_Explorer edgeIt( face, TopAbs_EDGE );
3913 for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
3915 // check if the EDGE needs checking
3916 const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
3917 if ( SMESH_Algo::isDegenerated( edge ) )
3919 if ( theHelper.IsRealSeam( edge ) &&
3920 edge.Orientation() == TopAbs_REVERSED )
3923 SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
3924 if ( !edgeSM ) continue;
3927 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
3928 BRepAdaptor_Curve curve3D( edge );
3929 switch ( curve3D.GetType() ) {
3930 case GeomAbs_Line: continue;
3931 case GeomAbs_Circle:
3932 case GeomAbs_Ellipse:
3933 case GeomAbs_Hyperbola:
3934 case GeomAbs_Parabola:
3937 gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
3938 curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
3939 gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
3940 surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
3941 gp_Vec fNorm = Du1 ^ Dv1;
3942 if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
3943 continue; // face is normal to the curve3D
3945 gp_Vec curvNorm = fNorm ^ D1;
3946 if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
3947 if ( curvNorm * D2 > 0 )
3948 continue; // convex edge
3950 catch ( Standard_Failure )
3955 // get nodes shared by faces that may be distorted
3956 SMDS_NodeIteratorPtr nodeIt;
3957 if ( edgeSM->NbNodes() > 0 ) {
3958 nodeIt = edgeSM->GetNodes();
3961 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
3963 vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
3964 if ( !vertexSM ) continue;
3965 nodeIt = vertexSM->GetNodes();
3968 // find suspicious faces
3969 TIDSortedElemSet checkedFaces;
3970 vector< const SMDS_MeshNode* > nOnEdge( 2 );
3971 const SMDS_MeshNode* nOnFace;
3972 while ( nodeIt->more() )
3974 const SMDS_MeshNode* n = nodeIt->next();
3975 SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
3976 while ( faceIt->more() )
3978 const SMDS_MeshElement* f = faceIt->next();
3979 if ( !faceSM->Contains( f ) ||
3980 f->NbNodes() < 6 || // check quadratic triangles only
3981 !checkedFaces.insert( f ).second )
3984 // get nodes on EDGE and on FACE of a suspicious face
3985 nOnEdge.clear(); nOnFace = 0;
3986 SMDS_MeshElement::iterator triNode = f->begin_nodes();
3987 for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
3990 if ( n->GetPosition()->GetDim() == 2 )
3993 nOnEdge.push_back( n );
3996 // check if nOnFace is inside the FACE
3997 if ( nOnFace && nOnEdge.size() == 2 )
3999 theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
4000 if ( !SMESH_MeshAlgos::FaceNormal( f, faceNorm, /*normalized=*/false ))
4002 gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
4003 gp_XYZ edgeNorm = faceNorm ^ edgeDir;
4004 n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true );
4005 gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
4006 gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
4007 gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
4008 double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
4009 double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
4010 if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
4012 // nOnFace is out of FACE, move a medium on-edge node to the middle
4013 gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
4014 meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4015 MSG( "move OUT of face " << n );
4016 theError->myBadElements.push_back( f );
4022 if ( !theError->myBadElements.empty() )
4023 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4026 } // 2D ==============================================================================
4028 if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
4030 if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
4031 theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
4033 SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
4034 if ( !solidSM ) return;
4036 // check if the SOLID is bound by concave FACEs
4037 vector< TopoDS_Face > concaveFaces;
4038 TopExp_Explorer faceIt( shape, TopAbs_FACE );
4039 for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4041 const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
4042 if ( !meshDS->MeshElements( face )) continue;
4044 BRepAdaptor_Surface surface( face );
4045 switch ( surface.GetType() ) {
4046 case GeomAbs_Plane: continue;
4047 case GeomAbs_Cylinder:
4049 case GeomAbs_Sphere:
4052 double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
4053 double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
4054 gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
4055 surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
4056 gp_Vec fNorm = Du1 ^ Dv1;
4057 if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
4058 bool concaveU = ( fNorm * Du2 > 1e-100 );
4059 bool concaveV = ( fNorm * Dv2 > 1e-100 );
4060 if ( concaveU || concaveV )
4061 concaveFaces.push_back( face );
4063 catch ( Standard_Failure )
4065 concaveFaces.push_back( face );
4069 if ( concaveFaces.empty() )
4072 // fix 2D mesh on the SOLID
4073 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4075 SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
4076 faceHelper.SetSubShape( faceIt.Current() );
4077 force3DOutOfBoundary( faceHelper, theError );
4080 // get an iterator over faces on concaveFaces
4081 vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
4082 for ( size_t i = 0; i < concaveFaces.size(); ++i )
4083 faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
4084 typedef SMDS_IteratorOnIterators
4085 < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
4086 SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
4088 // a seacher to check if a volume is close to a concave face
4089 std::auto_ptr< SMESH_ElementSearcher > faceSearcher
4090 ( SMESH_MeshAlgos::GetElementSearcher( *theHelper.GetMeshDS(), faceIter ));
4093 //BRepClass3d_SolidClassifier solidClassifier( shape );
4095 TIDSortedElemSet checkedVols, movedNodes;
4096 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
4098 const TopoDS_Shape& face = faceIt.Current();
4099 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
4100 if ( !faceSM ) continue;
4102 // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
4103 SMDS_NodeIteratorPtr nodeIt;
4104 if ( faceSM->NbNodes() > 0 ) {
4105 nodeIt = faceSM->GetNodes();
4108 TopExp_Explorer vertex( face, TopAbs_VERTEX );
4109 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
4110 if ( !vertexSM ) continue;
4111 nodeIt = vertexSM->GetNodes();
4114 // find suspicious volumes adjacent to the FACE
4115 vector< const SMDS_MeshNode* > nOnFace( 4 );
4116 const SMDS_MeshNode* nInSolid;
4117 //vector< const SMDS_MeshElement* > intersectedFaces;
4118 while ( nodeIt->more() )
4120 const SMDS_MeshNode* n = nodeIt->next();
4121 SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
4122 while ( volIt->more() )
4124 const SMDS_MeshElement* vol = volIt->next();
4125 int nbN = vol->NbCornerNodes();
4126 if ( ( nbN != 4 && nbN != 5 ) ||
4127 !solidSM->Contains( vol ) ||
4128 !checkedVols.insert( vol ).second )
4131 // get nodes on FACE and in SOLID of a suspicious volume
4132 nOnFace.clear(); nInSolid = 0;
4133 SMDS_MeshElement::iterator volNode = vol->begin_nodes();
4134 for ( int nb = nbN; nb > 0; ++volNode, --nb )
4137 if ( n->GetPosition()->GetDim() == 3 )
4140 nOnFace.push_back( n );
4142 if ( !nInSolid || nOnFace.size() != nbN - 1 )
4145 // get size of the vol
4146 SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
4147 double volLength = pInSolid.SquareDistance( nOnFace[0] );
4148 for ( size_t i = 1; i < nOnFace.size(); ++i )
4150 volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
4153 // check if vol is close to concaveFaces
4154 const SMDS_MeshElement* closeFace =
4155 faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
4157 pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
4160 // check if vol is distorted, i.e. a medium node is much closer
4161 // to nInSolid than the link middle
4162 bool isDistorted = false;
4163 SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
4164 if ( !SMESH_MeshAlgos::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
4166 theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
4167 vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
4168 for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
4169 for ( size_t j = i+1; j < nOnFace.size(); ++j )
4171 SMESH_TLink link( nOnFace[i], nOnFace[j] );
4172 TLinkNodeMap::const_iterator linkIt =
4173 theHelper.GetTLinkNodeMap().find( link );
4174 if ( linkIt != theHelper.GetTLinkNodeMap().end() )
4176 links.push_back( make_pair( linkIt->first, linkIt->second ));
4177 if ( !isDistorted ) {
4178 // compare projections of nInSolid and nMedium to face normal
4179 gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
4180 double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
4181 double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
4182 isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
4186 // move medium nodes to link middle
4189 for ( size_t i = 0; i < links.size(); ++i )
4191 const SMDS_MeshNode* nMedium = links[i].second;
4192 if ( movedNodes.insert( nMedium ).second )
4194 gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
4195 SMESH_TNodeXYZ( links[i].first.node2() ));
4196 meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
4197 MSG( "move OUT of solid " << nMedium );
4200 theError->myBadElements.push_back( vol );
4202 } // loop on volumes sharing a node on FACE
4203 } // loop on nodes on FACE
4204 } // loop on FACEs of a SOLID
4206 if ( !theError->myBadElements.empty() )
4207 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
4213 //=======================================================================
4215 * \brief Move medium nodes of faces and volumes to fix distorted elements
4216 * \param error - container of fixed distorted elements
4217 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
4219 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
4221 //=======================================================================
4223 void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& compError,
4226 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
4227 if ( getenv("NO_FixQuadraticElements") )
4230 // 0. Apply algorithm to SOLIDs or FACEs
4231 // ----------------------------------------------
4232 if ( myShape.IsNull() ) {
4233 if ( !myMesh->HasShapeToMesh() ) return;
4234 SetSubShape( myMesh->GetShapeToMesh() );
4238 TopTools_IndexedMapOfShape solids;
4239 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
4240 nbSolids = solids.Extent();
4242 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
4243 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
4244 faces.Add( f.Current() ); // not in solid
4246 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
4247 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
4248 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
4249 faces.Add( f.Current() ); // in not meshed solid
4251 else { // fix nodes in the solid and its faces
4253 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
4255 SMESH_MesherHelper h(*myMesh);
4256 h.SetSubShape( s.Current() );
4257 h.ToFixNodeParameters(true);
4258 h.FixQuadraticElements( compError, false );
4261 // fix nodes on geom faces
4263 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
4265 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
4266 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
4267 SMESH_MesherHelper h(*myMesh);
4268 h.SetSubShape( fIt.Key() );
4269 h.ToFixNodeParameters(true);
4270 h.FixQuadraticElements( compError, true);
4272 //perf_print_all_meters(1);
4273 if ( compError && compError->myName == EDITERR_NO_MEDIUM_ON_GEOM )
4274 compError->myComment = "during conversion to quadratic, "
4275 "some medium nodes were not placed on geometry to avoid distorting elements";
4279 // 1. Find out type of elements and get iterator on them
4280 // ---------------------------------------------------
4282 SMDS_ElemIteratorPtr elemIt;
4283 SMDSAbs_ElementType elemType = SMDSAbs_All;
4285 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
4288 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
4289 elemIt = smDS->GetElements();
4290 if ( elemIt->more() ) {
4291 elemType = elemIt->next()->GetType();
4292 elemIt = smDS->GetElements();
4295 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
4298 // 2. Fill in auxiliary data structures
4299 // ----------------------------------
4303 set< QLink >::iterator pLink;
4304 set< QFace >::iterator pFace;
4306 bool isCurved = false;
4307 //bool hasRectFaces = false;
4308 //set<int> nbElemNodeSet;
4309 SMDS_VolumeTool volTool;
4311 TIDSortedNodeSet apexOfPyramid;
4312 const int apexIndex = 4;
4315 // Move medium nodes to the link middle for elements whose corner nodes
4316 // are out of geometrical boundary to fix distorted elements.
4317 force3DOutOfBoundary( *this, compError );
4319 if ( elemType == SMDSAbs_Volume )
4321 while ( elemIt->more() ) // loop on volumes
4323 const SMDS_MeshElement* vol = elemIt->next();
4324 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
4326 double volMinSize2 = -1.;
4327 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
4329 int nbN = volTool.NbFaceNodes( iF );
4330 //nbElemNodeSet.insert( nbN );
4331 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
4332 vector< const QLink* > faceLinks( nbN/2 );
4333 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
4336 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
4337 pLink = links.insert( link ).first;
4338 faceLinks[ iN/2 ] = & *pLink;
4340 if ( link.MediumPos() == SMDS_TOP_3DSPACE )
4342 if ( !link.IsStraight() )
4343 return; // already fixed
4345 else if ( !isCurved )
4347 if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
4348 isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
4352 pFace = faces.insert( QFace( faceLinks )).first;
4353 if ( pFace->NbVolumes() == 0 )
4354 pFace->AddSelfToLinks();
4355 pFace->SetVolume( vol );
4356 // hasRectFaces = hasRectFaces ||
4357 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
4358 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
4361 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
4363 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
4364 faceNodes[4],faceNodes[6] );
4367 // collect pyramid apexes for further correction
4368 if ( vol->NbCornerNodes() == 5 )
4369 apexOfPyramid.insert( vol->GetNode( apexIndex ));
4371 set< QLink >::iterator pLink = links.begin();
4372 for ( ; pLink != links.end(); ++pLink )
4373 pLink->SetContinuesFaces();
4377 while ( elemIt->more() ) // loop on faces
4379 const SMDS_MeshElement* face = elemIt->next();
4380 if ( !face->IsQuadratic() )
4382 //nbElemNodeSet.insert( face->NbNodes() );
4383 int nbN = face->NbNodes()/2;
4384 vector< const QLink* > faceLinks( nbN );
4385 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
4388 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
4389 pLink = links.insert( link ).first;
4390 faceLinks[ iN ] = & *pLink;
4392 link.node1()->GetPosition()->GetTypeOfPosition() < 2 &&
4393 link.node2()->GetPosition()->GetTypeOfPosition() < 2 )
4394 isCurved = !link.IsStraight();
4397 pFace = faces.insert( QFace( faceLinks )).first;
4398 pFace->AddSelfToLinks();
4399 //hasRectFaces = ( hasRectFaces || nbN == 4 );
4403 return; // no curved edges of faces
4405 // 3. Compute displacement of medium nodes
4406 // ---------------------------------------
4408 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones.
4409 TopLoc_Location loc;
4411 // not to treat boundary of volumic sub-mesh.
4412 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
4413 for ( ; isInside < 2; ++isInside )
4415 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
4416 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
4417 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
4419 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
4420 if ( bool(isInside) == pFace->IsBoundary() )
4422 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
4425 // make chain of links connected via continues faces
4428 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
4430 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
4432 vector< TChain > chains;
4433 if ( error == ERR_OK ) { // chain contains continues rectangles
4435 chains[0].splice( chains[0].begin(), rawChain );
4437 else if ( error == ERR_TRI ) { // chain contains continues triangles
4438 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
4439 if ( res != _OK ) { // not quadrangles split into triangles
4440 fixTriaNearBoundary( rawChain, *this );
4444 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
4445 fixPrism( rawChain );
4451 for ( int iC = 0; iC < chains.size(); ++iC )
4453 TChain& chain = chains[iC];
4454 if ( chain.empty() ) continue;
4455 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
4456 MSG("3D straight - ignore");
4459 if ( chain.front()->MediumPos() > bndPos ||
4460 chain.back() ->MediumPos() > bndPos ) {
4461 MSG("Internal chain - ignore");
4464 // mesure chain length and compute link position along the chain
4465 double chainLen = 0;
4466 vector< double > linkPos;
4467 MSGBEG( "Link medium nodes: ");
4468 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
4469 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
4470 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
4471 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4472 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
4473 link1 = chain.erase( link1 );
4474 if ( link1 == chain.end() )
4476 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4479 linkPos.push_back( chainLen );
4482 if ( linkPos.size() < 2 )
4485 gp_Vec move0 = chain.front()->_nodeMove;
4486 gp_Vec move1 = chain.back ()->_nodeMove;
4491 // compute node displacement of end links of chain in parametric space of face
4492 TChainLink& linkOnFace = *(++chain.begin());
4493 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
4494 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
4495 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
4497 face = TopoDS::Face( f );
4498 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
4500 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
4502 TChainLink& link = is1 ? chain.back() : chain.front();
4503 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
4504 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
4505 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
4506 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4507 // uvMove = uvm - uv12
4508 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
4509 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
4510 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
4511 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
4512 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
4513 10 * uvMove.SquareModulus());
4515 if ( isStraight[0] && isStraight[1] ) {
4516 MSG("2D straight - ignore");
4517 continue; // straight - no need to move nodes of internal links
4520 // check if a chain is already fixed
4521 gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
4522 gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
4523 gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
4524 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4525 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
4527 MSG("Already fixed - ignore");
4533 if ( isInside || face.IsNull() )
4535 // compute node displacement of end links in their local coord systems
4537 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
4538 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
4539 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4540 move0.Transform(trsf);
4543 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
4544 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
4545 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4546 move1.Transform(trsf);
4549 // compute displacement of medium nodes
4550 link2 = chain.begin();
4553 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
4555 double r = linkPos[i] / chainLen;
4556 // displacement in local coord system
4557 gp_Vec move = (1. - r) * move0 + r * move1;
4558 if ( isInside || face.IsNull()) {
4559 // transform to global
4560 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
4561 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
4562 gp_Vec x = x01.Normalized() + x12.Normalized();
4563 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
4564 move.Transform(trsf);
4567 // compute 3D displacement by 2D one
4568 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
4569 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
4570 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
4571 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
4572 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
4573 if ( SMDS_FacePosition* nPos =
4574 dynamic_cast< SMDS_FacePosition* >((*link1)->_mediumNode->GetPosition()))
4575 nPos->SetParameters( newUV.X(), newUV.Y() );
4577 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
4578 move.SquareMagnitude())
4580 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
4581 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
4582 MSG( "TOO LONG MOVE \t" <<
4583 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
4584 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
4585 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
4586 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
4590 (*link1)->Move( move );
4591 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
4592 << chain.front()->_mediumNode->GetID() <<"-"
4593 << chain.back ()->_mediumNode->GetID() <<
4594 " by " << move.Magnitude());
4596 } // loop on chains of links
4597 } // loop on 2 directions of propagation from quadrangle
4599 } // fix faces and/or volumes
4604 TIDSortedElemSet biQuadQuas, biQuadTris, triQuadHexa;
4605 const SMDS_MeshElement *biQuadQua, *triQuadHex;
4606 const bool toFixCentralNodes = ( myMesh->NbBiQuadQuadrangles() +
4607 myMesh->NbBiQuadTriangles() +
4608 myMesh->NbTriQuadraticHexas() );
4610 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
4611 if ( pLink->IsMoved() )
4613 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
4614 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
4616 // collect bi-quadratic elements
4617 if ( toFixCentralNodes )
4619 biQuadQua = triQuadHex = 0;
4620 SMDS_ElemIteratorPtr eIt = pLink->_mediumNode->GetInverseElementIterator();
4621 while ( eIt->more() )
4623 const SMDS_MeshElement* e = eIt->next();
4624 switch( e->GetEntityType() ) {
4625 case SMDSEntity_BiQuad_Quadrangle: biQuadQuas.insert( e ); break;
4626 case SMDSEntity_BiQuad_Triangle: biQuadTris.insert( e ); break;
4627 case SMDSEntity_TriQuad_Hexa: triQuadHexa.insert( e ); break;
4634 // Fix positions of central nodes of bi-tri-quadratic elements
4636 // treat bi-quad quadrangles
4638 vector< const SMDS_MeshNode* > nodes( 9 );
4640 TIDSortedElemSet::iterator quadIt = biQuadQuas.begin();
4641 for ( ; quadIt != biQuadQuas.end(); ++quadIt )
4643 const SMDS_MeshElement* quad = *quadIt;
4646 nodes.assign( quad->begin_nodes(), quad->end_nodes() );
4648 TopoDS_Shape S = GetSubShapeByNode( nodes.back(), GetMeshDS() );
4649 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4650 const TopoDS_Face& F = TopoDS::Face( S );
4651 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4652 const double tol = BRep_Tool::Tolerance( F );
4654 for ( int i = 0; i < 8; ++i )
4656 uv[ i ] = GetNodeUV( F, nodes[i], nodes[8], &checkUV );
4657 // as this method is used after mesh generation, UV of nodes is not
4658 // updated according to bending links, so we update
4659 if ( i > 3 && nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4660 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4662 // move the central node
4663 gp_XY uvCent = calcTFI (0.5, 0.5, uv[0],uv[1],uv[2],uv[3],uv[4],uv[5],uv[6],uv[7] );
4664 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4665 GetMeshDS()->MoveNode( nodes[8], p.X(), p.Y(), p.Z());
4669 // treat bi-quad triangles
4671 vector< const SMDS_MeshNode* > nodes;
4673 TIDSortedElemSet::iterator triIt = biQuadTris.begin();
4674 for ( ; triIt != biQuadTris.end(); ++triIt )
4676 const SMDS_MeshElement* tria = *triIt;
4678 const TopoDS_Shape& S = GetMeshDS()->IndexToShape( tria->getshapeId() );
4679 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4680 const TopoDS_Face& F = TopoDS::Face( S );
4681 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4682 const double tol = BRep_Tool::Tolerance( F );
4685 nodes.assign( tria->begin_nodes(), tria->end_nodes() );
4687 for ( int i = 0; i < 6; ++i )
4689 uv[ i ] = GetNodeUV( F, nodes[i], nodes[(i+1)%3], &checkUV );
4690 // as this method is used after mesh generation, UV of nodes is not
4691 // updated according to bending links, so we update
4692 if ( nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4693 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4695 // move the central node
4696 gp_XY uvCent = GetCenterUV( uv[0], uv[1], uv[2], uv[3], uv[4], uv[5] );
4697 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4698 GetMeshDS()->MoveNode( tria->GetNode(6), p.X(), p.Y(), p.Z() );
4702 // treat tri-quadratic hexahedra
4704 SMDS_VolumeTool volExp;
4705 TIDSortedElemSet::iterator hexIt = triQuadHexa.begin();
4706 for ( ; hexIt != triQuadHexa.end(); ++hexIt )
4708 volExp.Set( *hexIt, /*ignoreCentralNodes=*/false );
4710 // fix nodes central in sides
4711 for ( int iQuad = 0; iQuad < volExp.NbFaces(); ++iQuad )
4713 const SMDS_MeshNode** quadNodes = volExp.GetFaceNodes( iQuad );
4714 if ( quadNodes[8]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
4716 gp_XYZ p = calcTFI( 0.5, 0.5,
4717 SMESH_TNodeXYZ( quadNodes[0] ), SMESH_TNodeXYZ( quadNodes[2] ),
4718 SMESH_TNodeXYZ( quadNodes[4] ), SMESH_TNodeXYZ( quadNodes[6] ),
4719 SMESH_TNodeXYZ( quadNodes[1] ), SMESH_TNodeXYZ( quadNodes[3] ),
4720 SMESH_TNodeXYZ( quadNodes[5] ), SMESH_TNodeXYZ( quadNodes[7] ));
4721 GetMeshDS()->MoveNode( quadNodes[8], p.X(), p.Y(), p.Z());
4725 // fix the volume central node
4726 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
4727 const SMDS_MeshNode** hexNodes = volExp.GetNodes();
4729 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( hexNodes[ 0 ] );
4730 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( hexNodes[ 3 ] );
4731 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( hexNodes[ 1 ] );
4732 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( hexNodes[ 2 ] );
4733 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( hexNodes[ 4 ] );
4734 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( hexNodes[ 7 ] );
4735 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( hexNodes[ 5 ] );
4736 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( hexNodes[ 6 ] );
4738 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( hexNodes[ 11 ] );
4739 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( hexNodes[ 9 ] );
4740 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( hexNodes[ 8 ] );
4741 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( hexNodes[ 10 ] );
4742 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( hexNodes[ 15 ] );
4743 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( hexNodes[ 13 ] );
4744 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( hexNodes[ 12 ] );
4745 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( hexNodes[ 14 ] );
4746 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( hexNodes[ 16 ] );
4747 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( hexNodes[ 19 ] );
4748 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( hexNodes[ 17 ] );
4749 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( hexNodes[ 18 ] );
4751 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( hexNodes[ 20 ] );
4752 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( hexNodes[ 25 ] );
4753 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( hexNodes[ 21 ] );
4754 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( hexNodes[ 23 ] );
4755 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( hexNodes[ 24 ] );
4756 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( hexNodes[ 22 ] );
4758 gp_XYZ nCenterParams(0.5, 0.5, 0.5), nCenterCoords;
4759 SMESH_Block::ShellPoint( nCenterParams, pointsOnShapes, nCenterCoords );
4760 GetMeshDS()->MoveNode( hexNodes[26],
4761 nCenterCoords.X(), nCenterCoords.Y(), nCenterCoords.Z());