1 // Copyright (C) 2007-2012 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.
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_ProxyMesh.hxx"
36 #include "SMESH_subMesh.hxx"
38 #include <BRepAdaptor_Curve.hxx>
39 #include <BRepAdaptor_Surface.hxx>
40 #include <BRepTools.hxx>
41 #include <BRep_Tool.hxx>
42 #include <Geom2d_Curve.hxx>
43 #include <GeomAPI_ProjectPointOnCurve.hxx>
44 #include <GeomAPI_ProjectPointOnSurf.hxx>
45 #include <Geom_Curve.hxx>
46 #include <Geom_RectangularTrimmedSurface.hxx>
47 #include <Geom_Surface.hxx>
48 #include <ShapeAnalysis.hxx>
50 #include <TopExp_Explorer.hxx>
51 #include <TopTools_ListIteratorOfListOfShape.hxx>
52 #include <TopTools_MapIteratorOfMapOfShape.hxx>
53 #include <TopTools_MapOfShape.hxx>
56 #include <gp_Pnt2d.hxx>
57 #include <gp_Trsf.hxx>
59 #include <Standard_Failure.hxx>
60 #include <Standard_ErrorHandler.hxx>
62 #include <utilities.h>
68 #define RETURN_BAD_RESULT(msg) { MESSAGE(msg); return false; }
72 gp_XYZ XYZ(const SMDS_MeshNode* n) { return gp_XYZ(n->X(), n->Y(), n->Z()); }
74 enum { U_periodic = 1, V_periodic = 2 };
77 //================================================================================
81 //================================================================================
83 SMESH_MesherHelper::SMESH_MesherHelper(SMESH_Mesh& theMesh)
87 myCreateQuadratic(false),
88 myCreateBiQuadratic(false),
89 myFixNodeParameters(false)
91 myPar1[0] = myPar2[0] = myPar1[1] = myPar2[1] = 0;
92 mySetElemOnShape = ( ! myMesh->HasShapeToMesh() );
95 //=======================================================================
96 //function : ~SMESH_MesherHelper
98 //=======================================================================
100 SMESH_MesherHelper::~SMESH_MesherHelper()
103 TID2ProjectorOnSurf::iterator i_proj = myFace2Projector.begin();
104 for ( ; i_proj != myFace2Projector.end(); ++i_proj )
105 delete i_proj->second;
108 TID2ProjectorOnCurve::iterator i_proj = myEdge2Projector.begin();
109 for ( ; i_proj != myEdge2Projector.end(); ++i_proj )
110 delete i_proj->second;
114 //=======================================================================
115 //function : IsQuadraticSubMesh
116 //purpose : Check submesh for given shape: if all elements on this shape
117 // are quadratic, quadratic elements will be created.
118 // Also fill myTLinkNodeMap
119 //=======================================================================
121 bool SMESH_MesherHelper::IsQuadraticSubMesh(const TopoDS_Shape& aSh)
123 SMESHDS_Mesh* meshDS = GetMeshDS();
124 // we can create quadratic elements only if all elements
125 // created on sub-shapes of given shape are quadratic
126 // also we have to fill myTLinkNodeMap
127 myCreateQuadratic = true;
128 mySeamShapeIds.clear();
129 myDegenShapeIds.clear();
130 TopAbs_ShapeEnum subType( aSh.ShapeType()==TopAbs_FACE ? TopAbs_EDGE : TopAbs_FACE );
131 if ( aSh.ShapeType()==TopAbs_COMPOUND )
133 TopoDS_Iterator subIt( aSh );
135 subType = ( subIt.Value().ShapeType()==TopAbs_FACE ) ? TopAbs_EDGE : TopAbs_FACE;
137 SMDSAbs_ElementType elemType( subType==TopAbs_FACE ? SMDSAbs_Face : SMDSAbs_Edge );
140 int nbOldLinks = myTLinkNodeMap.size();
142 if ( !myMesh->HasShapeToMesh() )
144 if (( myCreateQuadratic = myMesh->NbFaces( ORDER_QUADRATIC )))
146 SMDS_FaceIteratorPtr fIt = meshDS->facesIterator();
147 while ( fIt->more() )
148 AddTLinks( static_cast< const SMDS_MeshFace* >( fIt->next() ));
153 TopExp_Explorer exp( aSh, subType );
154 TopTools_MapOfShape checkedSubShapes;
155 for (; exp.More() && myCreateQuadratic; exp.Next()) {
156 if ( !checkedSubShapes.Add( exp.Current() ))
157 continue; // needed if aSh is compound of solids
158 if ( SMESHDS_SubMesh * subMesh = meshDS->MeshElements( exp.Current() )) {
159 if ( SMDS_ElemIteratorPtr it = subMesh->GetElements() ) {
161 const SMDS_MeshElement* e = it->next();
162 if ( e->GetType() != elemType || !e->IsQuadratic() ) {
163 myCreateQuadratic = false;
168 switch ( e->NbNodes() ) {
170 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(2)); break;
172 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(3));
173 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(4));
174 AddTLinkNode(e->GetNode(2),e->GetNode(0),e->GetNode(5)); break;
176 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(4));
177 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(5));
178 AddTLinkNode(e->GetNode(2),e->GetNode(3),e->GetNode(6));
179 AddTLinkNode(e->GetNode(3),e->GetNode(0),e->GetNode(7));
182 myCreateQuadratic = false;
192 if ( nbOldLinks == myTLinkNodeMap.size() )
193 myCreateQuadratic = false;
195 if(!myCreateQuadratic) {
196 myTLinkNodeMap.clear();
200 return myCreateQuadratic;
203 //=======================================================================
204 //function : SetSubShape
205 //purpose : Set geometry to make elements on
206 //=======================================================================
208 void SMESH_MesherHelper::SetSubShape(const int aShID)
210 if ( aShID == myShapeID )
213 SetSubShape( GetMeshDS()->IndexToShape( aShID ));
215 SetSubShape( TopoDS_Shape() );
218 //=======================================================================
219 //function : SetSubShape
220 //purpose : Set geometry to create elements on
221 //=======================================================================
223 void SMESH_MesherHelper::SetSubShape(const TopoDS_Shape& aSh)
225 if ( myShape.IsSame( aSh ))
229 mySeamShapeIds.clear();
230 myDegenShapeIds.clear();
232 if ( myShape.IsNull() ) {
236 SMESHDS_Mesh* meshDS = GetMeshDS();
237 myShapeID = meshDS->ShapeToIndex(aSh);
240 // treatment of periodic faces
241 for ( TopExp_Explorer eF( aSh, TopAbs_FACE ); eF.More(); eF.Next() )
243 const TopoDS_Face& face = TopoDS::Face( eF.Current() );
245 Handle(Geom_Surface) surface = BRep_Tool::Surface( face, loc );
247 if ( surface->IsUPeriodic() || surface->IsVPeriodic() ||
248 surface->IsUClosed() || surface->IsVClosed() )
250 //while ( surface->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
251 //surface = Handle(Geom_RectangularTrimmedSurface)::DownCast( surface )->BasisSurface();
252 GeomAdaptor_Surface surf( surface );
254 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
256 // look for a seam edge
257 const TopoDS_Edge& edge = TopoDS::Edge( exp.Current() );
258 if ( BRep_Tool::IsClosed( edge, face )) {
259 // initialize myPar1, myPar2 and myParIndex
261 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
262 if ( Abs( uv1.Coord(1) - uv2.Coord(1) ) < Abs( uv1.Coord(2) - uv2.Coord(2) ))
264 myParIndex |= U_periodic;
265 myPar1[0] = surf.FirstUParameter();
266 myPar2[0] = surf.LastUParameter();
269 myParIndex |= V_periodic;
270 myPar1[1] = surf.FirstVParameter();
271 myPar2[1] = surf.LastVParameter();
273 // store seam shape indices, negative if shape encounters twice
274 int edgeID = meshDS->ShapeToIndex( edge );
275 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
276 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
277 int vertexID = meshDS->ShapeToIndex( v.Current() );
278 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
282 // look for a degenerated edge
283 if ( BRep_Tool::Degenerated( edge )) {
284 myDegenShapeIds.insert( meshDS->ShapeToIndex( edge ));
285 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
286 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
289 if ( !myDegenShapeIds.empty() && !myParIndex ) {
290 if ( surface->IsUPeriodic() || surface->IsUClosed() ) {
291 myParIndex |= U_periodic;
292 myPar1[0] = surf.FirstUParameter();
293 myPar2[0] = surf.LastUParameter();
295 else if ( surface->IsVPeriodic() || surface->IsVClosed() ) {
296 myParIndex |= V_periodic;
297 myPar1[1] = surf.FirstVParameter();
298 myPar2[1] = surf.LastVParameter();
305 //=======================================================================
306 //function : GetNodeUVneedInFaceNode
307 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
308 // Return true if the face is periodic.
309 // If F is Null, answer about sub-shape set through IsQuadraticSubMesh() or
311 //=======================================================================
313 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
315 if ( F.IsNull() ) return !mySeamShapeIds.empty();
317 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
318 return !mySeamShapeIds.empty();
321 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
322 if ( !aSurface.IsNull() )
323 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
328 //=======================================================================
329 //function : IsMedium
331 //=======================================================================
333 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
334 const SMDSAbs_ElementType typeToCheck)
336 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
339 //=======================================================================
340 //function : GetSubShapeByNode
341 //purpose : Return support shape of a node
342 //=======================================================================
344 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
345 const SMESHDS_Mesh* meshDS)
347 int shapeID = node ? node->getshapeId() : 0;
348 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
349 return meshDS->IndexToShape( shapeID );
351 return TopoDS_Shape();
355 //=======================================================================
356 //function : AddTLinkNode
357 //purpose : add a link in my data structure
358 //=======================================================================
360 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
361 const SMDS_MeshNode* n2,
362 const SMDS_MeshNode* n12)
364 // add new record to map
365 SMESH_TLink link( n1, n2 );
366 myTLinkNodeMap.insert( make_pair(link,n12));
369 //================================================================================
371 * \brief Add quadratic links of edge to own data structure
373 //================================================================================
375 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
377 if ( edge->IsQuadratic() )
378 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
381 //================================================================================
383 * \brief Add quadratic links of face to own data structure
385 //================================================================================
387 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
390 switch ( f->NbNodes() ) {
392 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
393 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
394 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
396 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
397 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
398 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
399 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7));
404 //================================================================================
406 * \brief Add quadratic links of volume to own data structure
408 //================================================================================
410 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
412 if ( volume->IsQuadratic() )
414 SMDS_VolumeTool vTool( volume );
415 const SMDS_MeshNode** nodes = vTool.GetNodes();
417 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
419 const int nbN = vTool.NbFaceNodes( iF );
420 const int* iNodes = vTool.GetFaceNodesIndices( iF );
421 for ( int i = 0; i < nbN; )
423 int iN1 = iNodes[i++];
424 int iN12 = iNodes[i++];
426 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
427 int linkID = iN1 * vTool.NbNodes() + iN2;
428 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
429 if ( it_isNew.second )
430 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
432 addedLinks.erase( it_isNew.first ); // each link encounters only twice
438 //================================================================================
440 * \brief Return true if position of nodes on the shape hasn't yet been checked or
441 * the positions proved to be invalid
443 //================================================================================
445 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
447 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
448 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
451 //================================================================================
453 * \brief Set validity of positions of nodes on the shape.
454 * Once set, validity is not changed
456 //================================================================================
458 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
460 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok));
463 //=======================================================================
464 //function : ToFixNodeParameters
465 //purpose : Enables fixing node parameters on EDGEs and FACEs in
466 // GetNodeU(...,check=true), GetNodeUV(...,check=true), CheckNodeUV() and
467 // CheckNodeU() in case if a node lies on a shape set via SetSubShape().
469 //=======================================================================
471 void SMESH_MesherHelper::ToFixNodeParameters(bool toFix)
473 myFixNodeParameters = toFix;
477 //=======================================================================
478 //function : GetUVOnSeam
479 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
480 //=======================================================================
482 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
484 gp_Pnt2d result = uv1;
485 for ( int i = U_periodic; i <= V_periodic ; ++i )
487 if ( myParIndex & i )
489 double p1 = uv1.Coord( i );
490 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
491 if ( myParIndex == i ||
492 dp1 < ( myPar2[i-1] - myPar2[i-1] ) / 100. ||
493 dp2 < ( myPar2[i-1] - myPar2[i-1] ) / 100. )
495 double p2 = uv2.Coord( i );
496 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
497 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
498 result.SetCoord( i, p1Alt );
505 //=======================================================================
506 //function : GetNodeUV
507 //purpose : Return node UV on face
508 //=======================================================================
510 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
511 const SMDS_MeshNode* n,
512 const SMDS_MeshNode* n2,
515 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
517 const SMDS_PositionPtr Pos = n->GetPosition();
519 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
521 // node has position on face
522 const SMDS_FacePosition* fpos =
523 static_cast<const SMDS_FacePosition*>(n->GetPosition());
524 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
526 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
528 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
530 // node has position on edge => it is needed to find
531 // corresponding edge from face, get pcurve for this
532 // edge and retrieve value from this pcurve
533 const SMDS_EdgePosition* epos =
534 static_cast<const SMDS_EdgePosition*>(n->GetPosition());
535 int edgeID = n->getshapeId();
536 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
537 double f, l, u = epos->GetUParameter();
538 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
539 bool validU = ( f < u && u < l );
541 uv = C2d->Value( u );
543 uv.SetCoord( Precision::Infinite(),0.);
544 if ( check || !validU )
545 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ),/*force=*/ !validU );
547 // for a node on a seam edge select one of UVs on 2 pcurves
548 if ( n2 && IsSeamShape( edgeID ) )
550 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
553 { // adjust uv to period
555 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
556 Standard_Boolean isUPeriodic = S->IsUPeriodic();
557 Standard_Boolean isVPeriodic = S->IsVPeriodic();
558 if ( isUPeriodic || isVPeriodic ) {
559 Standard_Real UF,UL,VF,VL;
560 S->Bounds(UF,UL,VF,VL);
562 uv.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
564 uv.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
568 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
570 if ( int vertexID = n->getshapeId() ) {
571 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
573 uv = BRep_Tool::Parameters( V, F );
576 catch (Standard_Failure& exc) {
579 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
580 uvOK = ( V == vert.Current() );
583 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
584 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
586 // get UV of a vertex closest to the node
588 gp_Pnt pn = XYZ( n );
589 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
590 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
591 gp_Pnt p = BRep_Tool::Pnt( curV );
592 double curDist = p.SquareDistance( pn );
593 if ( curDist < dist ) {
595 uv = BRep_Tool::Parameters( curV, F );
596 uvOK = ( dist < DBL_MIN );
602 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
603 for ( ; it.More(); it.Next() ) {
604 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
605 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
607 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
608 if ( !C2d.IsNull() ) {
609 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
610 uv = C2d->Value( u );
618 if ( n2 && IsSeamShape( vertexID ) )
619 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
624 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
633 //=======================================================================
634 //function : CheckNodeUV
635 //purpose : Check and fix node UV on a face
636 //=======================================================================
638 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
639 const SMDS_MeshNode* n,
643 double distXYZ[4]) const
645 int shapeID = n->getshapeId();
646 bool infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ));
647 if ( force || toCheckPosOnShape( shapeID ) || infinit )
649 // check that uv is correct
651 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
652 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
654 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
656 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
658 setPosOnShapeValidity( shapeID, false );
659 if ( !infinit && distXYZ ) {
660 surfPnt.Transform( loc );
662 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
664 // uv incorrect, project the node to surface
665 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
666 projector.Perform( nodePnt );
667 if ( !projector.IsDone() || projector.NbPoints() < 1 )
669 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
672 Quantity_Parameter U,V;
673 projector.LowerDistanceParameters(U,V);
675 surfPnt = surface->Value( U, V );
676 dist = nodePnt.Distance( surfPnt );
678 surfPnt.Transform( loc );
680 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
684 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
687 // store the fixed UV on the face
688 if ( myShape.IsSame(F) && shapeID == myShapeID && myFixNodeParameters )
689 const_cast<SMDS_MeshNode*>(n)->SetPosition
690 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
692 else if ( uv.Modulus() > numeric_limits<double>::min() )
694 setPosOnShapeValidity( shapeID, true );
700 //=======================================================================
701 //function : GetProjector
702 //purpose : Return projector intitialized by given face without location, which is returned
703 //=======================================================================
705 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
706 TopLoc_Location& loc,
709 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
710 int faceID = GetMeshDS()->ShapeToIndex( F );
711 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
712 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
713 if ( i_proj == i2proj.end() )
715 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
716 double U1, U2, V1, V2;
717 surface->Bounds(U1, U2, V1, V2);
718 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
719 proj->Init( surface, U1, U2, V1, V2, tol );
720 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
722 return *( i_proj->second );
727 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
728 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
729 gp_XY_FunPtr(Subtracted);
732 //=======================================================================
733 //function : applyIn2D
734 //purpose : Perform given operation on two 2d points in parameric space of given surface.
735 // It takes into account period of the surface. Use gp_XY_FunPtr macro
736 // to easily define pointer to function of gp_XY class.
737 //=======================================================================
739 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
743 const bool resultInPeriod)
745 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
746 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
747 if ( !isUPeriodic && !isVPeriodic )
750 // move uv2 not far than half-period from uv1
752 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
754 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
757 gp_XY res = fun( uv1, gp_XY(u2,v2) );
759 // move result within period
760 if ( resultInPeriod )
762 Standard_Real UF,UL,VF,VL;
763 surface->Bounds(UF,UL,VF,VL);
765 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
767 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
772 //=======================================================================
773 //function : GetMiddleUV
774 //purpose : Return middle UV taking in account surface period
775 //=======================================================================
777 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
782 // the proper place of getting basic surface seems to be in applyIn2D()
783 // but we put it here to decrease a risk of regressions just before releasing a version
784 Handle(Geom_Surface) surf = surface;
785 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
786 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
788 return applyIn2D( surf, p1, p2, & AverageUV );
791 //=======================================================================
792 //function : GetNodeU
793 //purpose : Return node U on edge
794 //=======================================================================
796 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
797 const SMDS_MeshNode* n,
798 const SMDS_MeshNode* inEdgeNode,
801 double param = Precision::Infinite();
803 const SMDS_PositionPtr pos = n->GetPosition();
804 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
806 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
807 param = epos->GetUParameter();
809 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
811 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
814 BRep_Tool::Range( E, f,l );
815 double uInEdge = GetNodeU( E, inEdgeNode );
816 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
820 SMESHDS_Mesh * meshDS = GetMeshDS();
821 int vertexID = n->getshapeId();
822 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
823 param = BRep_Tool::Parameter( V, E );
828 double tol = BRep_Tool::Tolerance( E );
829 double f,l; BRep_Tool::Range( E, f,l );
830 bool force = ( param < f-tol || param > l+tol );
831 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
832 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
834 *check = CheckNodeU( E, n, param, 2*tol, force );
839 //=======================================================================
840 //function : CheckNodeU
841 //purpose : Check and fix node U on an edge
842 // Return false if U is bad and could not be fixed
843 //=======================================================================
845 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
846 const SMDS_MeshNode* n,
850 double distXYZ[4]) const
852 int shapeID = n->getshapeId();
853 if ( force || toCheckPosOnShape( shapeID ))
855 TopLoc_Location loc; double f,l;
856 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
857 if ( curve.IsNull() ) // degenerated edge
859 if ( u+tol < f || u-tol > l )
861 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
867 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
868 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
869 gp_Pnt curvPnt = curve->Value( u );
870 double dist = nodePnt.Distance( curvPnt );
872 curvPnt.Transform( loc );
874 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
878 setPosOnShapeValidity( shapeID, false );
879 // u incorrect, project the node to the curve
880 int edgeID = GetMeshDS()->ShapeToIndex( E );
881 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
882 TID2ProjectorOnCurve::iterator i_proj =
883 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
884 if ( !i_proj->second )
886 i_proj->second = new GeomAPI_ProjectPointOnCurve();
887 i_proj->second->Init( curve, f, l );
889 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
890 projector->Perform( nodePnt );
891 if ( projector->NbPoints() < 1 )
893 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
896 Quantity_Parameter U = projector->LowerDistanceParameter();
898 curvPnt = curve->Value( u );
899 dist = nodePnt.Distance( curvPnt );
901 curvPnt.Transform( loc );
903 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
907 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
908 MESSAGE("distance " << dist << " " << tol );
911 // store the fixed U on the edge
912 if ( myShape.IsSame(E) && shapeID == myShapeID && myFixNodeParameters )
913 const_cast<SMDS_MeshNode*>(n)->SetPosition
914 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
916 else if ( fabs( u ) > numeric_limits<double>::min() )
918 setPosOnShapeValidity( shapeID, true );
920 if (( u < f-tol || u > l+tol ) && force )
922 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
925 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
926 double period = curve->Period();
927 u = ( u < f ) ? u + period : u - period;
929 catch (Standard_Failure& exc)
939 //=======================================================================
940 //function : GetMediumPos
941 //purpose : Return index and type of the shape (EDGE or FACE only) to
942 // set a medium node on
943 //param : useCurSubShape - if true, returns the shape set via SetSubShape()
945 //=======================================================================
947 std::pair<int, TopAbs_ShapeEnum>
948 SMESH_MesherHelper::GetMediumPos(const SMDS_MeshNode* n1,
949 const SMDS_MeshNode* n2,
950 const bool useCurSubShape)
952 if ( useCurSubShape && !myShape.IsNull() )
953 return std::make_pair( myShapeID, myShape.ShapeType() );
955 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
959 if (( myShapeID == n1->getshapeId() || myShapeID == n2->getshapeId() ) && myShapeID > 0 )
961 shapeType = myShape.ShapeType();
964 else if ( n1->getshapeId() == n2->getshapeId() )
966 shapeID = n2->getshapeId();
967 shape = GetSubShapeByNode( n1, GetMeshDS() );
971 const SMDS_TypeOfPosition Pos1 = n1->GetPosition()->GetTypeOfPosition();
972 const SMDS_TypeOfPosition Pos2 = n2->GetPosition()->GetTypeOfPosition();
974 if ( Pos1 == SMDS_TOP_3DSPACE || Pos2 == SMDS_TOP_3DSPACE )
977 else if ( Pos1 == SMDS_TOP_FACE || Pos2 == SMDS_TOP_FACE )
979 if ( Pos1 != SMDS_TOP_FACE || Pos2 != SMDS_TOP_FACE )
981 if ( Pos1 != SMDS_TOP_FACE ) std::swap( n1,n2 );
982 TopoDS_Shape F = GetSubShapeByNode( n1, GetMeshDS() );
983 TopoDS_Shape S = GetSubShapeByNode( n2, GetMeshDS() );
984 if ( IsSubShape( S, F ))
986 shapeType = TopAbs_FACE;
987 shapeID = n1->getshapeId();
991 else if ( Pos1 == SMDS_TOP_EDGE && Pos2 == SMDS_TOP_EDGE )
993 TopoDS_Shape E1 = GetSubShapeByNode( n1, GetMeshDS() );
994 TopoDS_Shape E2 = GetSubShapeByNode( n2, GetMeshDS() );
995 shape = GetCommonAncestor( E1, E2, *myMesh, TopAbs_FACE );
997 else if ( Pos1 == SMDS_TOP_VERTEX && Pos2 == SMDS_TOP_VERTEX )
999 TopoDS_Shape V1 = GetSubShapeByNode( n1, GetMeshDS() );
1000 TopoDS_Shape V2 = GetSubShapeByNode( n2, GetMeshDS() );
1001 shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_EDGE );
1002 if ( shape.IsNull() ) shape = GetCommonAncestor( V1, V2, *myMesh, TopAbs_FACE );
1004 else // VERTEX and EDGE
1006 if ( Pos1 != SMDS_TOP_VERTEX ) std::swap( n1,n2 );
1007 TopoDS_Shape V = GetSubShapeByNode( n1, GetMeshDS() );
1008 TopoDS_Shape E = GetSubShapeByNode( n2, GetMeshDS() );
1009 if ( IsSubShape( V, E ))
1012 shape = GetCommonAncestor( V, E, *myMesh, TopAbs_FACE );
1016 if ( !shape.IsNull() )
1019 shapeID = GetMeshDS()->ShapeToIndex( shape );
1020 shapeType = shape.ShapeType();
1022 return make_pair( shapeID, shapeType );
1025 //=======================================================================
1026 //function : GetCentralNode
1027 //purpose : Return existing or create a new central node for a quardilateral
1028 // quadratic face given its 8 nodes.
1029 //@param : force3d - true means node creation in between the given nodes,
1030 // else node position is found on a geometrical face if any.
1031 //=======================================================================
1033 const SMDS_MeshNode* SMESH_MesherHelper::GetCentralNode(const SMDS_MeshNode* n1,
1034 const SMDS_MeshNode* n2,
1035 const SMDS_MeshNode* n3,
1036 const SMDS_MeshNode* n4,
1037 const SMDS_MeshNode* n12,
1038 const SMDS_MeshNode* n23,
1039 const SMDS_MeshNode* n34,
1040 const SMDS_MeshNode* n41,
1043 SMDS_MeshNode *centralNode = 0; // central node to return
1045 // Find an existing central node
1047 TBiQuad keyOfMap(n1,n2,n3,n4);
1048 std::map<TBiQuad, SMDS_MeshNode* >::iterator itMapCentralNode;
1049 itMapCentralNode = myMapWithCentralNode.find( keyOfMap );
1050 if ( itMapCentralNode != myMapWithCentralNode.end() )
1052 return (*itMapCentralNode).second;
1055 // Get type of shape for the new central node
1057 TopAbs_ShapeEnum shapeType = TopAbs_SHAPE;
1061 TopTools_ListIteratorOfListOfShape it;
1063 std::map< int, int > faceId2nbNodes;
1064 std::map< int, int > ::iterator itMapWithIdFace;
1066 SMESHDS_Mesh* meshDS = GetMeshDS();
1068 // check if a face lie on a FACE, i.e. its all corner nodes lie either on the FACE or
1069 // on sub-shapes of the FACE
1070 if ( GetMesh()->HasShapeToMesh() )
1072 const SMDS_MeshNode* nodes[] = { n1, n2, n3, n4 };
1073 for(int i = 0; i < 4; i++)
1075 shape = GetSubShapeByNode( nodes[i], meshDS );
1076 if ( shape.IsNull() ) break;
1077 if ( shape.ShapeType() == TopAbs_SOLID )
1079 shapeID = nodes[i]->getshapeId();
1080 shapeType = TopAbs_SOLID;
1083 if ( shape.ShapeType() == TopAbs_FACE )
1085 faceID = nodes[i]->getshapeId();
1086 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1087 itMapWithIdFace->second++;
1091 PShapeIteratorPtr it = GetAncestors(shape, *GetMesh(), TopAbs_FACE );
1092 while ( const TopoDS_Shape* face = it->next() )
1094 faceID = meshDS->ShapeToIndex( *face );
1095 itMapWithIdFace = faceId2nbNodes.insert( std::make_pair( faceID, 0 ) ).first;
1096 itMapWithIdFace->second++;
1101 if ( shapeID < 1 && !faceId2nbNodes.empty() ) // SOLID not found
1103 // find ID of the FACE the four corner nodes belong to
1104 itMapWithIdFace = faceId2nbNodes.begin();
1105 for ( ; itMapWithIdFace != faceId2nbNodes.end(); ++itMapWithIdFace)
1107 if ( itMapWithIdFace->second == 4 )
1109 shapeType = TopAbs_FACE;
1110 faceID = (*itMapWithIdFace).first;
1117 if ( shapeType == TopAbs_FACE )
1119 F = TopoDS::Face( meshDS->IndexToShape( faceID ));
1130 uvAvg = calcTFI (0.5, 0.5,
1131 GetNodeUV(F,n1,n3), GetNodeUV(F,n2,n4),
1132 GetNodeUV(F,n3,n1), GetNodeUV(F,n4,n2),
1133 GetNodeUV(F,n12,n3), GetNodeUV(F,n23,n4),
1134 GetNodeUV(F,n34,n2), GetNodeUV(F,n41,n2));
1135 TopLoc_Location loc;
1136 Handle( Geom_Surface ) S = BRep_Tool::Surface( F, loc );
1137 P = S->Value( uvAvg.X(), uvAvg.Y() ).Transformed( loc );
1138 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1139 // if ( mySetElemOnShape ) node is not elem!
1140 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1141 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1146 P = ( SMESH_TNodeXYZ( n1 ) +
1147 SMESH_TNodeXYZ( n2 ) +
1148 SMESH_TNodeXYZ( n3 ) +
1149 SMESH_TNodeXYZ( n4 ) ) / 4;
1150 centralNode = meshDS->AddNode( P.X(), P.Y(), P.Z() );
1154 uvAvg = (GetNodeUV(F,n1,n3) +
1155 GetNodeUV(F,n2,n4) +
1156 GetNodeUV(F,n3,n1) +
1157 GetNodeUV(F,n4,n2)) / 4;
1158 CheckNodeUV( F, centralNode, uvAvg, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1159 meshDS->SetNodeOnFace( centralNode, faceID, uvAvg.X(), uvAvg.Y() );
1161 else if ( shapeID > 0 )
1163 meshDS->SetNodeInVolume( centralNode, shapeID );
1165 else if ( myShapeID > 0 && mySetElemOnShape )
1167 meshDS->SetMeshElementOnShape( centralNode, myShapeID );
1169 myMapWithCentralNode.insert( std::make_pair( keyOfMap, centralNode ) );
1173 //=======================================================================
1174 //function : GetMediumNode
1175 //purpose : Return existing or create a new medium node between given ones
1176 //=======================================================================
1178 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
1179 const SMDS_MeshNode* n2,
1182 // Find existing node
1184 SMESH_TLink link(n1,n2);
1185 ItTLinkNode itLN = myTLinkNodeMap.find( link );
1186 if ( itLN != myTLinkNodeMap.end() ) {
1187 return (*itLN).second;
1190 // Create medium node
1193 SMESHDS_Mesh* meshDS = GetMeshDS();
1195 if ( IsSeamShape( n1->getshapeId() ))
1196 // to get a correct UV of a node on seam, the second node must have checked UV
1197 std::swap( n1, n2 );
1199 // get type of shape for the new medium node
1200 int faceID = -1, edgeID = -1;
1201 TopoDS_Edge E; double u [2];
1202 TopoDS_Face F; gp_XY uv[2];
1203 bool uvOK[2] = { false, false };
1205 pair<int, TopAbs_ShapeEnum> pos = GetMediumPos( n1, n2, mySetElemOnShape );
1207 // get positions of the given nodes on shapes
1208 if ( pos.second == TopAbs_FACE )
1210 F = TopoDS::Face(meshDS->IndexToShape( faceID = pos.first ));
1211 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
1212 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
1214 else if ( pos.second == TopAbs_EDGE )
1216 const SMDS_PositionPtr Pos1 = n1->GetPosition();
1217 const SMDS_PositionPtr Pos2 = n2->GetPosition();
1218 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1219 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
1220 n1->getshapeId() != n2->getshapeId() )
1223 return getMediumNodeOnComposedWire(n1,n2,force3d);
1225 E = TopoDS::Edge(meshDS->IndexToShape( edgeID = pos.first ));
1226 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
1227 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
1230 if ( !force3d & uvOK[0] && uvOK[1] )
1232 // we try to create medium node using UV parameters of
1233 // nodes, else - medium between corresponding 3d points
1236 //if ( uvOK[0] && uvOK[1] )
1238 if ( IsDegenShape( n1->getshapeId() )) {
1239 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
1240 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
1242 else if ( IsDegenShape( n2->getshapeId() )) {
1243 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
1244 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
1247 TopLoc_Location loc;
1248 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
1249 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
1250 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
1251 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1252 // if ( mySetElemOnShape ) node is not elem!
1253 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
1254 myTLinkNodeMap.insert(make_pair(link,n12));
1258 else if ( !E.IsNull() )
1261 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1264 Standard_Boolean isPeriodic = C->IsPeriodic();
1267 Standard_Real Period = C->Period();
1268 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1269 Standard_Real pmid = (u[0]+p)/2.;
1270 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1275 gp_Pnt P = C->Value( U );
1276 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1277 //if ( mySetElemOnShape ) node is not elem!
1278 meshDS->SetNodeOnEdge(n12, edgeID, U);
1279 myTLinkNodeMap.insert(make_pair(link,n12));
1286 double x = ( n1->X() + n2->X() )/2.;
1287 double y = ( n1->Y() + n2->Y() )/2.;
1288 double z = ( n1->Z() + n2->Z() )/2.;
1289 n12 = meshDS->AddNode(x,y,z);
1291 //if ( mySetElemOnShape ) node is not elem!
1295 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1296 CheckNodeUV( F, n12, UV, 2 * BRep_Tool::Tolerance( F ), /*force=*/true);
1297 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1299 else if ( !E.IsNull() )
1301 double U = ( u[0] + u[1] ) / 2.;
1302 CheckNodeU( E, n12, U, 2 * BRep_Tool::Tolerance( E ), /*force=*/true);
1303 meshDS->SetNodeOnEdge(n12, edgeID, U);
1305 else if ( myShapeID > 0 && mySetElemOnShape )
1307 meshDS->SetMeshElementOnShape(n12, myShapeID);
1311 myTLinkNodeMap.insert( make_pair( link, n12 ));
1315 //================================================================================
1317 * \brief Makes a medium node if nodes reside different edges
1319 //================================================================================
1321 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1322 const SMDS_MeshNode* n2,
1325 gp_Pnt middle = 0.5 * XYZ(n1) + 0.5 * XYZ(n2);
1326 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1328 // To find position on edge and 3D position for n12,
1329 // project <middle> to 2 edges and select projection most close to <middle>
1331 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4];
1333 TopoDS_Edge edges[2];
1334 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1337 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1338 TopoDS_Shape shape = GetSubShapeByNode( n, GetMeshDS() );
1339 if ( shape.IsNull() || shape.ShapeType() != TopAbs_EDGE )
1342 // project to get U of projection and distance from middle to projection
1343 TopoDS_Edge edge = edges[ is2nd ] = TopoDS::Edge( shape );
1344 double node2MiddleDist = middle.Distance( XYZ(n) );
1345 double foundU = GetNodeU( edge, n );
1346 CheckNodeU( edge, n12, foundU, 2*BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1347 if ( distXYZ[0] < node2MiddleDist )
1349 distMiddleProj = distXYZ[0];
1354 if ( Precision::IsInfinite( distMiddleProj ))
1356 // both projections failed; set n12 on the edge of n1 with U of a common vertex
1357 TopoDS_Vertex vCommon;
1358 if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1359 u = BRep_Tool::Parameter( vCommon, edges[0] );
1362 double f,l, u0 = GetNodeU( edges[0], n1 );
1363 BRep_Tool::Range( edges[0],f,l );
1364 u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1370 // move n12 to position of a successfull projection
1371 double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1372 if ( !force3d && distMiddleProj > 2*tol )
1374 TopLoc_Location loc; double f,l;
1375 Handle(Geom_Curve) curve = BRep_Tool::Curve( edges[iOkEdge],loc,f,l );
1376 gp_Pnt p = curve->Value( u );
1377 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1380 //if ( mySetElemOnShape ) node is not elem!
1381 GetMeshDS()->SetNodeOnEdge(n12, edges[iOkEdge], u);
1383 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1388 //=======================================================================
1389 //function : AddNode
1390 //purpose : Creates a node
1391 //=======================================================================
1393 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID,
1396 SMESHDS_Mesh * meshDS = GetMeshDS();
1397 SMDS_MeshNode* node = 0;
1399 node = meshDS->AddNodeWithID( x, y, z, ID );
1401 node = meshDS->AddNode( x, y, z );
1402 if ( mySetElemOnShape && myShapeID > 0 ) { // node is not elem ?
1403 switch ( myShape.ShapeType() ) {
1404 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1405 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1406 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID, u, v); break;
1407 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID, u); break;
1408 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1415 //=======================================================================
1416 //function : AddEdge
1417 //purpose : Creates quadratic or linear edge
1418 //=======================================================================
1420 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1421 const SMDS_MeshNode* n2,
1425 SMESHDS_Mesh * meshDS = GetMeshDS();
1427 SMDS_MeshEdge* edge = 0;
1428 if (myCreateQuadratic) {
1429 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1431 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1433 edge = meshDS->AddEdge(n1, n2, n12);
1437 edge = meshDS->AddEdgeWithID(n1, n2, id);
1439 edge = meshDS->AddEdge(n1, n2);
1442 if ( mySetElemOnShape && myShapeID > 0 )
1443 meshDS->SetMeshElementOnShape( edge, myShapeID );
1448 //=======================================================================
1449 //function : AddFace
1450 //purpose : Creates quadratic or linear triangle
1451 //=======================================================================
1453 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1454 const SMDS_MeshNode* n2,
1455 const SMDS_MeshNode* n3,
1459 SMESHDS_Mesh * meshDS = GetMeshDS();
1460 SMDS_MeshFace* elem = 0;
1462 if( n1==n2 || n2==n3 || n3==n1 )
1465 if(!myCreateQuadratic) {
1467 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1469 elem = meshDS->AddFace(n1, n2, n3);
1472 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1473 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1474 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1477 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1479 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1481 if ( mySetElemOnShape && myShapeID > 0 )
1482 meshDS->SetMeshElementOnShape( elem, myShapeID );
1487 //=======================================================================
1488 //function : AddFace
1489 //purpose : Creates bi-quadratic, quadratic or linear quadrangle
1490 //=======================================================================
1492 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1493 const SMDS_MeshNode* n2,
1494 const SMDS_MeshNode* n3,
1495 const SMDS_MeshNode* n4,
1499 SMESHDS_Mesh * meshDS = GetMeshDS();
1500 SMDS_MeshFace* elem = 0;
1503 return AddFace(n1,n3,n4,id,force3d);
1506 return AddFace(n1,n2,n4,id,force3d);
1509 return AddFace(n1,n2,n3,id,force3d);
1512 return AddFace(n1,n2,n4,id,force3d);
1515 return AddFace(n1,n2,n3,id,force3d);
1518 return AddFace(n1,n2,n3,id,force3d);
1521 if(!myCreateQuadratic) {
1523 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1525 elem = meshDS->AddFace(n1, n2, n3, n4);
1528 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1529 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1530 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1531 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1532 if(myCreateBiQuadratic)
1534 const SMDS_MeshNode* nCenter = GetCentralNode(n1, n2, n3, n4, n12, n23, n34, n41, force3d);
1536 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, nCenter, id);
1538 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41, nCenter);
1543 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1545 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1548 if ( mySetElemOnShape && myShapeID > 0 )
1549 meshDS->SetMeshElementOnShape( elem, myShapeID );
1554 //=======================================================================
1555 //function : AddPolygonalFace
1556 //purpose : Creates polygon, with additional nodes in quadratic mesh
1557 //=======================================================================
1559 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1563 SMESHDS_Mesh * meshDS = GetMeshDS();
1564 SMDS_MeshFace* elem = 0;
1566 if(!myCreateQuadratic) {
1568 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1570 elem = meshDS->AddPolygonalFace(nodes);
1573 vector<const SMDS_MeshNode*> newNodes;
1574 for ( int i = 0; i < nodes.size(); ++i )
1576 const SMDS_MeshNode* n1 = nodes[i];
1577 const SMDS_MeshNode* n2 = nodes[(i+1)%nodes.size()];
1578 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1579 newNodes.push_back( n1 );
1580 newNodes.push_back( n12 );
1583 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1585 elem = meshDS->AddPolygonalFace(newNodes);
1587 if ( mySetElemOnShape && myShapeID > 0 )
1588 meshDS->SetMeshElementOnShape( elem, myShapeID );
1593 //=======================================================================
1594 //function : AddVolume
1595 //purpose : Creates quadratic or linear prism
1596 //=======================================================================
1598 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1599 const SMDS_MeshNode* n2,
1600 const SMDS_MeshNode* n3,
1601 const SMDS_MeshNode* n4,
1602 const SMDS_MeshNode* n5,
1603 const SMDS_MeshNode* n6,
1607 SMESHDS_Mesh * meshDS = GetMeshDS();
1608 SMDS_MeshVolume* elem = 0;
1609 if(!myCreateQuadratic) {
1611 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1613 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1616 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1617 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1618 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1620 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1621 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1622 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1624 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1625 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1626 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1629 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1630 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1632 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1633 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1635 if ( mySetElemOnShape && myShapeID > 0 )
1636 meshDS->SetMeshElementOnShape( elem, myShapeID );
1641 //=======================================================================
1642 //function : AddVolume
1643 //purpose : Creates quadratic or linear tetrahedron
1644 //=======================================================================
1646 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1647 const SMDS_MeshNode* n2,
1648 const SMDS_MeshNode* n3,
1649 const SMDS_MeshNode* n4,
1653 SMESHDS_Mesh * meshDS = GetMeshDS();
1654 SMDS_MeshVolume* elem = 0;
1655 if(!myCreateQuadratic) {
1657 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1659 elem = meshDS->AddVolume(n1, n2, n3, n4);
1662 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1663 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1664 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1666 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1667 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1668 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1671 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1673 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1675 if ( mySetElemOnShape && myShapeID > 0 )
1676 meshDS->SetMeshElementOnShape( elem, myShapeID );
1681 //=======================================================================
1682 //function : AddVolume
1683 //purpose : Creates quadratic or linear pyramid
1684 //=======================================================================
1686 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1687 const SMDS_MeshNode* n2,
1688 const SMDS_MeshNode* n3,
1689 const SMDS_MeshNode* n4,
1690 const SMDS_MeshNode* n5,
1694 SMDS_MeshVolume* elem = 0;
1695 if(!myCreateQuadratic) {
1697 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1699 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1702 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1703 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1704 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1705 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1707 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1708 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1709 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
1710 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1713 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
1718 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
1720 n15, n25, n35, n45);
1722 if ( mySetElemOnShape && myShapeID > 0 )
1723 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
1728 //=======================================================================
1729 //function : AddVolume
1730 //purpose : Creates bi-quadratic, quadratic or linear hexahedron
1731 //=======================================================================
1733 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1734 const SMDS_MeshNode* n2,
1735 const SMDS_MeshNode* n3,
1736 const SMDS_MeshNode* n4,
1737 const SMDS_MeshNode* n5,
1738 const SMDS_MeshNode* n6,
1739 const SMDS_MeshNode* n7,
1740 const SMDS_MeshNode* n8,
1744 SMESHDS_Mesh * meshDS = GetMeshDS();
1745 SMDS_MeshVolume* elem = 0;
1746 if(!myCreateQuadratic) {
1748 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
1750 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
1753 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1754 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1755 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1756 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1758 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1759 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
1760 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
1761 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
1763 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1764 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
1765 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
1766 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
1767 if(myCreateBiQuadratic)
1769 const SMDS_MeshNode* n1234 = GetCentralNode(n1,n2,n3,n4,n12,n23,n34,n41,force3d);
1770 const SMDS_MeshNode* n1256 = GetCentralNode(n1,n2,n5,n6,n12,n26,n56,n15,force3d);
1771 const SMDS_MeshNode* n2367 = GetCentralNode(n2,n3,n6,n7,n23,n37,n67,n26,force3d);
1772 const SMDS_MeshNode* n3478 = GetCentralNode(n3,n4,n7,n8,n34,n48,n78,n37,force3d);
1773 const SMDS_MeshNode* n1458 = GetCentralNode(n1,n4,n5,n8,n41,n48,n15,n85,force3d);
1774 const SMDS_MeshNode* n5678 = GetCentralNode(n5,n6,n7,n8,n56,n67,n78,n85,force3d);
1776 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
1778 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( n4 );
1779 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( n8 );
1780 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( n3 );
1781 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( n7 );
1782 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( n1 );
1783 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( n5 );
1784 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( n2 );
1785 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( n6 );
1787 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( n48 );
1788 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( n37 );
1789 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( n15 );
1790 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( n26 );
1791 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( n34 );
1792 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( n78 );
1793 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( n12 );
1794 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( n56 );
1795 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( n41 );
1796 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( n85 );
1797 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( n23 );
1798 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( n67 );
1800 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( n3478 );
1801 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( n1256 );
1802 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( n1458 );
1803 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( n2367 );
1804 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( n1234 );
1805 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( n5678 );
1807 gp_XYZ centerCube(0.5, 0.5, 0.5);
1809 SMESH_Block::ShellPoint( centerCube, pointsOnShapes, nCenterElem );
1810 const SMDS_MeshNode* nCenter =
1811 meshDS->AddNode( nCenterElem.X(), nCenterElem.Y(), nCenterElem.Z() );
1812 meshDS->SetNodeInVolume( nCenter, myShapeID );
1815 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
1816 n12, n23, n34, n41, n56, n67,
1817 n78, n85, n15, n26, n37, n48,
1818 n1234, n1256, n2367, n3478, n1458, n5678, nCenter, id);
1820 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
1821 n12, n23, n34, n41, n56, n67,
1822 n78, n85, n15, n26, n37, n48,
1823 n1234, n1256, n2367, n3478, n1458, n5678, nCenter);
1828 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
1829 n12, n23, n34, n41, n56, n67,
1830 n78, n85, n15, n26, n37, n48, id);
1832 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
1833 n12, n23, n34, n41, n56, n67,
1834 n78, n85, n15, n26, n37, n48);
1837 if ( mySetElemOnShape && myShapeID > 0 )
1838 meshDS->SetMeshElementOnShape( elem, myShapeID );
1843 //=======================================================================
1844 //function : AddVolume
1845 //purpose : Creates LINEAR!!!!!!!!! octahedron
1846 //=======================================================================
1848 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1849 const SMDS_MeshNode* n2,
1850 const SMDS_MeshNode* n3,
1851 const SMDS_MeshNode* n4,
1852 const SMDS_MeshNode* n5,
1853 const SMDS_MeshNode* n6,
1854 const SMDS_MeshNode* n7,
1855 const SMDS_MeshNode* n8,
1856 const SMDS_MeshNode* n9,
1857 const SMDS_MeshNode* n10,
1858 const SMDS_MeshNode* n11,
1859 const SMDS_MeshNode* n12,
1863 SMESHDS_Mesh * meshDS = GetMeshDS();
1864 SMDS_MeshVolume* elem = 0;
1866 elem = meshDS->AddVolumeWithID(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12,id);
1868 elem = meshDS->AddVolume(n1,n2,n3,n4,n5,n6,n7,n8,n9,n10,n11,n12);
1869 if ( mySetElemOnShape && myShapeID > 0 )
1870 meshDS->SetMeshElementOnShape( elem, myShapeID );
1874 //=======================================================================
1875 //function : AddPolyhedralVolume
1876 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
1877 //=======================================================================
1880 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
1881 const std::vector<int>& quantities,
1885 SMESHDS_Mesh * meshDS = GetMeshDS();
1886 SMDS_MeshVolume* elem = 0;
1887 if(!myCreateQuadratic)
1890 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
1892 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
1896 vector<const SMDS_MeshNode*> newNodes;
1897 vector<int> newQuantities;
1898 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
1900 int nbNodesInFace = quantities[iFace];
1901 newQuantities.push_back(0);
1902 for ( int i = 0; i < nbNodesInFace; ++i )
1904 const SMDS_MeshNode* n1 = nodes[ iN + i ];
1905 newNodes.push_back( n1 );
1906 newQuantities.back()++;
1908 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
1909 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
1910 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
1912 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1913 newNodes.push_back( n12 );
1914 newQuantities.back()++;
1917 iN += nbNodesInFace;
1920 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
1922 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
1924 if ( mySetElemOnShape && myShapeID > 0 )
1925 meshDS->SetMeshElementOnShape( elem, myShapeID );
1932 //================================================================================
1934 * \brief Check if a node belongs to any face of sub-mesh
1936 //================================================================================
1938 bool isNodeInSubMesh( const SMDS_MeshNode* n, const SMESHDS_SubMesh* sm )
1940 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
1941 while ( fIt->more() )
1942 if ( sm->Contains( fIt->next() ))
1948 //=======================================================================
1949 //function : IsSameElemGeometry
1950 //purpose : Returns true if all elements of a sub-mesh are of same shape
1951 //=======================================================================
1953 bool SMESH_MesherHelper::IsSameElemGeometry(const SMESHDS_SubMesh* smDS,
1954 SMDSAbs_GeometryType shape,
1955 const bool nullSubMeshRes)
1957 if ( !smDS ) return nullSubMeshRes;
1959 SMDS_ElemIteratorPtr elemIt = smDS->GetElements();
1960 while ( elemIt->more() ) {
1961 const SMDS_MeshElement* e = elemIt->next();
1962 if ( e->GetGeomType() != shape )
1968 //=======================================================================
1969 //function : LoadNodeColumns
1970 //purpose : Load nodes bound to face into a map of node columns
1971 //=======================================================================
1973 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
1974 const TopoDS_Face& theFace,
1975 const TopoDS_Edge& theBaseEdge,
1976 SMESHDS_Mesh* theMesh,
1977 SMESH_ProxyMesh* theProxyMesh)
1979 return LoadNodeColumns(theParam2ColumnMap,
1981 std::list<TopoDS_Edge>(1,theBaseEdge),
1986 //=======================================================================
1987 //function : LoadNodeColumns
1988 //purpose : Load nodes bound to face into a map of node columns
1989 //=======================================================================
1991 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
1992 const TopoDS_Face& theFace,
1993 const std::list<TopoDS_Edge>& theBaseSide,
1994 SMESHDS_Mesh* theMesh,
1995 SMESH_ProxyMesh* theProxyMesh)
1997 // get a right sub-mesh of theFace
1999 const SMESHDS_SubMesh* faceSubMesh = 0;
2002 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
2003 if ( !faceSubMesh ||
2004 faceSubMesh->NbElements() == 0 ||
2005 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
2007 // can use a proxy sub-mesh with not temporary elements only
2013 faceSubMesh = theMesh->MeshElements( theFace );
2014 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
2017 if ( theParam2ColumnMap.empty() )
2019 // get data of edges for normalization of params
2020 vector< double > length;
2022 list<TopoDS_Edge>::const_iterator edge;
2024 for ( edge = theBaseSide.begin(); edge != theBaseSide.end(); ++edge )
2026 double len = std::max( 1e-10, SMESH_Algo::EdgeLength( *edge ));
2028 length.push_back( len );
2032 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
2033 edge = theBaseSide.begin();
2034 for ( int iE = 0; edge != theBaseSide.end(); ++edge, ++iE )
2036 map< double, const SMDS_MeshNode*> sortedBaseNN;
2037 SMESH_Algo::GetSortedNodesOnEdge( theMesh, *edge,/*noMedium=*/true, sortedBaseNN);
2038 if ( sortedBaseNN.empty() ) continue;
2040 map< double, const SMDS_MeshNode*>::iterator u_n = sortedBaseNN.begin();
2041 if ( theProxyMesh ) // from sortedBaseNN remove nodes not shared by faces of faceSubMesh
2043 const SMDS_MeshNode* n1 = (++sortedBaseNN.begin())->second;
2044 const SMDS_MeshNode* n2 = (++sortedBaseNN.rbegin())->second;
2045 bool allNodesAreProxy = ( n1 != theProxyMesh->GetProxyNode( n1 ) &&
2046 n2 != theProxyMesh->GetProxyNode( n2 ));
2047 if ( allNodesAreProxy )
2048 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2049 u_n->second = theProxyMesh->GetProxyNode( u_n->second );
2051 if ( u_n = sortedBaseNN.begin(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2053 while ( ++u_n != sortedBaseNN.end() && !isNodeInSubMesh( u_n->second, faceSubMesh ));
2054 sortedBaseNN.erase( sortedBaseNN.begin(), u_n );
2056 if ( u_n = --sortedBaseNN.end(), !isNodeInSubMesh( u_n->second, faceSubMesh ))
2058 while ( u_n != sortedBaseNN.begin() && !isNodeInSubMesh( (--u_n)->second, faceSubMesh ));
2059 sortedBaseNN.erase( ++u_n, sortedBaseNN.end() );
2061 if ( sortedBaseNN.empty() ) continue;
2065 BRep_Tool::Range( *edge, f, l );
2066 if ( edge->Orientation() == TopAbs_REVERSED ) std::swap( f, l );
2067 const double coeff = 1. / ( l - f ) * length[iE] / fullLen;
2068 const double prevPar = theParam2ColumnMap.empty() ? 0 : theParam2ColumnMap.rbegin()->first;
2069 for ( u_n = sortedBaseNN.begin(); u_n != sortedBaseNN.end(); u_n++ )
2071 double par = prevPar + coeff * ( u_n->first - f );
2072 TParam2ColumnMap::iterator u2nn =
2073 theParam2ColumnMap.insert( theParam2ColumnMap.end(), make_pair( par, TNodeColumn()));
2074 u2nn->second.push_back( u_n->second );
2077 if ( theParam2ColumnMap.empty() )
2082 int prevNbRows = theParam2ColumnMap.begin()->second.size(); // current, at least 1 here
2083 int expectedNbRows = faceSubMesh->NbElements() / ( theParam2ColumnMap.size()-1 ); // to be added
2085 // fill theParam2ColumnMap column by column by passing from nodes on
2086 // theBaseEdge up via mesh faces on theFace
2088 TParam2ColumnMap::iterator par_nVec_1, par_nVec_2;
2089 par_nVec_2 = theParam2ColumnMap.begin();
2090 par_nVec_1 = par_nVec_2++;
2091 TIDSortedElemSet emptySet, avoidSet;
2092 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
2094 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
2095 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
2096 nCol1.resize( prevNbRows + expectedNbRows );
2097 nCol2.resize( prevNbRows + expectedNbRows );
2099 int i1, i2, foundNbRows = 0;
2100 const SMDS_MeshNode *n1 = nCol1[ prevNbRows-1 ];
2101 const SMDS_MeshNode *n2 = nCol2[ prevNbRows-1 ];
2102 // find face sharing node n1 and n2 and belonging to faceSubMesh
2103 while ( const SMDS_MeshElement* face =
2104 SMESH_MeshEditor::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
2106 if ( faceSubMesh->Contains( face ))
2108 int nbNodes = face->NbCornerNodes();
2111 if ( foundNbRows + 1 > expectedNbRows )
2113 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
2114 n2 = face->GetNode( (i1+2) % 4 );
2115 nCol1[ prevNbRows + foundNbRows] = n1;
2116 nCol2[ prevNbRows + foundNbRows] = n2;
2119 avoidSet.insert( face );
2121 if ( foundNbRows != expectedNbRows )
2125 return ( theParam2ColumnMap.size() > 1 &&
2126 theParam2ColumnMap.begin()->second.size() == prevNbRows + expectedNbRows );
2131 //================================================================================
2133 * \brief Return true if a node is at a corner of a 2D structured mesh of FACE
2135 //================================================================================
2137 bool isCornerOfStructure( const SMDS_MeshNode* n,
2138 const SMESHDS_SubMesh* faceSM,
2139 SMESH_MesherHelper& faceAnalyser )
2141 int nbFacesInSM = 0;
2143 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator( SMDSAbs_Face );
2144 while ( fIt->more() )
2145 nbFacesInSM += faceSM->Contains( fIt->next() );
2147 if ( nbFacesInSM == 1 )
2150 if ( nbFacesInSM == 2 && n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
2152 return faceAnalyser.IsRealSeam( n->getshapeId() );
2158 //=======================================================================
2159 //function : IsStructured
2160 //purpose : Return true if 2D mesh on FACE is structured
2161 //=======================================================================
2163 bool SMESH_MesherHelper::IsStructured( SMESH_subMesh* faceSM )
2165 SMESHDS_SubMesh* fSM = faceSM->GetSubMeshDS();
2166 if ( !fSM || fSM->NbElements() == 0 )
2169 list< TopoDS_Edge > edges;
2170 list< int > nbEdgesInWires;
2171 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( faceSM->GetSubShape() ),
2172 edges, nbEdgesInWires );
2173 if ( nbWires != 1 /*|| nbEdgesInWires.front() != 4*/ ) // allow composite sides
2176 // algo: find corners of a structure and then analyze nb of faces and
2177 // length of structure sides
2179 SMESHDS_Mesh* meshDS = faceSM->GetFather()->GetMeshDS();
2180 SMESH_MesherHelper faceAnalyser( *faceSM->GetFather() );
2181 faceAnalyser.SetSubShape( faceSM->GetSubShape() );
2183 // rotate edges to get the first node being at corner
2184 // (in principle it's not necessary but so far none SALOME algo can make
2185 // such a structured mesh that all corner nodes are not on VERTEXes)
2186 bool isCorner = false;
2187 int nbRemainEdges = nbEdgesInWires.front();
2189 TopoDS_Vertex V = IthVertex( 0, edges.front() );
2190 isCorner = isCornerOfStructure( SMESH_Algo::VertexNode( V, meshDS ),
2193 edges.splice( edges.end(), edges, edges.begin() );
2197 while ( !isCorner && nbRemainEdges > 0 );
2202 // get all nodes from EDGEs
2203 list< const SMDS_MeshNode* > nodes;
2204 list< TopoDS_Edge >::iterator edge = edges.begin();
2205 for ( ; edge != edges.end(); ++edge )
2207 map< double, const SMDS_MeshNode* > u2Nodes;
2208 if ( !SMESH_Algo::GetSortedNodesOnEdge( meshDS, *edge,
2209 /*skipMedium=*/true, u2Nodes ))
2212 list< const SMDS_MeshNode* > edgeNodes;
2213 map< double, const SMDS_MeshNode* >::iterator u2n = u2Nodes.begin();
2214 for ( ; u2n != u2Nodes.end(); ++u2n )
2215 edgeNodes.push_back( u2n->second );
2216 if ( edge->Orientation() == TopAbs_REVERSED )
2217 edgeNodes.reverse();
2219 if ( !nodes.empty() && nodes.back() == edgeNodes.front() )
2220 edgeNodes.pop_front();
2221 nodes.splice( nodes.end(), edgeNodes, edgeNodes.begin(), edgeNodes.end() );
2224 // get length of structured sides
2225 vector<int> nbEdgesInSide;
2227 list< const SMDS_MeshNode* >::iterator n = ++nodes.begin();
2228 for ( ; n != nodes.end(); ++n )
2231 if ( isCornerOfStructure( *n, fSM, faceAnalyser )) {
2232 nbEdgesInSide.push_back( nbEdges );
2238 if ( nbEdgesInSide.size() != 4 )
2240 if ( nbEdgesInSide[0] != nbEdgesInSide[2] )
2242 if ( nbEdgesInSide[1] != nbEdgesInSide[3] )
2244 if ( nbEdgesInSide[0] * nbEdgesInSide[1] != fSM->NbElements() )
2250 //================================================================================
2252 * \brief Find out elements orientation on a geometrical face
2253 * \param theFace - The face correctly oriented in the shape being meshed
2254 * \retval bool - true if the face normal and the normal of first element
2255 * in the correspoding submesh point in different directions
2257 //================================================================================
2259 bool SMESH_MesherHelper::IsReversedSubMesh (const TopoDS_Face& theFace)
2261 if ( theFace.IsNull() )
2264 // find out orientation of a meshed face
2265 int faceID = GetMeshDS()->ShapeToIndex( theFace );
2266 TopoDS_Shape aMeshedFace = GetMeshDS()->IndexToShape( faceID );
2267 bool isReversed = ( theFace.Orientation() != aMeshedFace.Orientation() );
2269 const SMESHDS_SubMesh * aSubMeshDSFace = GetMeshDS()->MeshElements( faceID );
2270 if ( !aSubMeshDSFace )
2273 // find an element with a good normal
2275 bool normalOK = false;
2277 SMDS_ElemIteratorPtr iteratorElem = aSubMeshDSFace->GetElements();
2278 while ( !normalOK && iteratorElem->more() ) // loop on elements on theFace
2280 const SMDS_MeshElement* elem = iteratorElem->next();
2281 if ( elem && elem->NbCornerNodes() > 2 )
2283 SMESH_TNodeXYZ nPnt[3];
2284 SMDS_ElemIteratorPtr nodesIt = elem->nodesIterator();
2285 for ( int iN = 0; nodesIt->more() && iN < 3; ++iN) // loop on nodes
2286 nPnt[ iN ] = nodesIt->next();
2289 gp_Vec v01( nPnt[0], nPnt[1] ), v02( nPnt[0], nPnt[2] );
2290 if ( v01.SquareMagnitude() > RealSmall() &&
2291 v02.SquareMagnitude() > RealSmall() )
2294 if (( normalOK = ( Ne.SquareMagnitude() > RealSmall() )))
2295 uv = GetNodeUV( theFace, nPnt[0]._node, nPnt[2]._node, &normalOK );
2302 // face normal at node position
2303 TopLoc_Location loc;
2304 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
2305 // if ( surf.IsNull() || surf->Continuity() < GeomAbs_C1 )
2306 // some surfaces not detected as GeomAbs_C1 are nevertheless correct for meshing
2307 if ( surf.IsNull() || surf->Continuity() < GeomAbs_C0 )
2310 MESSAGE("surf->Continuity() < GeomAbs_C1 " << (surf->Continuity() < GeomAbs_C1));
2313 gp_Vec d1u, d1v; gp_Pnt p;
2314 surf->D1( uv.X(), uv.Y(), p, d1u, d1v );
2315 gp_Vec Nf = (d1u ^ d1v).Transformed( loc );
2317 if ( theFace.Orientation() == TopAbs_REVERSED )
2320 return Ne * Nf < 0.;
2323 //=======================================================================
2325 //purpose : Count nb of sub-shapes
2326 //=======================================================================
2328 int SMESH_MesherHelper::Count(const TopoDS_Shape& shape,
2329 const TopAbs_ShapeEnum type,
2330 const bool ignoreSame)
2333 TopTools_IndexedMapOfShape map;
2334 TopExp::MapShapes( shape, type, map );
2335 return map.Extent();
2339 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2345 //=======================================================================
2346 //function : NbAncestors
2347 //purpose : Return number of unique ancestors of the shape
2348 //=======================================================================
2350 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
2351 const SMESH_Mesh& mesh,
2352 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
2354 TopTools_MapOfShape ancestors;
2355 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
2356 for ( ; ansIt.More(); ansIt.Next() ) {
2357 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
2358 ancestors.Add( ansIt.Value() );
2360 return ancestors.Extent();
2363 //=======================================================================
2364 //function : GetSubShapeOri
2365 //purpose : Return orientation of sub-shape in the main shape
2366 //=======================================================================
2368 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
2369 const TopoDS_Shape& subShape)
2371 TopAbs_Orientation ori = TopAbs_Orientation(-1);
2372 if ( !shape.IsNull() && !subShape.IsNull() )
2374 TopExp_Explorer e( shape, subShape.ShapeType() );
2375 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
2376 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
2377 for ( ; e.More(); e.Next())
2378 if ( subShape.IsSame( e.Current() ))
2381 ori = e.Current().Orientation();
2386 //=======================================================================
2387 //function : IsSubShape
2389 //=======================================================================
2391 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
2392 const TopoDS_Shape& mainShape )
2394 if ( !shape.IsNull() && !mainShape.IsNull() )
2396 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
2399 if ( shape.IsSame( exp.Current() ))
2402 SCRUTE((shape.IsNull()));
2403 SCRUTE((mainShape.IsNull()));
2407 //=======================================================================
2408 //function : IsSubShape
2410 //=======================================================================
2412 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
2414 if ( shape.IsNull() || !aMesh )
2417 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
2419 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
2422 //================================================================================
2424 * \brief Return maximal tolerance of shape
2426 //================================================================================
2428 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
2430 double tol = Precision::Confusion();
2431 TopExp_Explorer exp;
2432 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
2433 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
2434 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
2435 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
2436 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
2437 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
2442 //================================================================================
2444 * \brief Check if the first and last vertices of an edge are the same
2445 * \param anEdge - the edge to check
2446 * \retval bool - true if same
2448 //================================================================================
2450 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
2452 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2453 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
2454 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
2457 //================================================================================
2459 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
2460 * in the case of INTERNAL edge
2462 //================================================================================
2464 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
2468 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
2469 anEdge.Orientation( TopAbs_FORWARD );
2471 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
2472 TopoDS_Iterator vIt( anEdge, CumOri );
2473 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
2476 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
2479 //================================================================================
2481 * \brief Return type of shape contained in a group
2482 * \param group - a shape of type TopAbs_COMPOUND
2483 * \param avoidCompound - not to return TopAbs_COMPOUND
2485 //================================================================================
2487 TopAbs_ShapeEnum SMESH_MesherHelper::GetGroupType(const TopoDS_Shape& group,
2488 const bool avoidCompound)
2490 if ( !group.IsNull() )
2492 if ( group.ShapeType() != TopAbs_COMPOUND )
2493 return group.ShapeType();
2495 // iterate on a compound
2496 TopoDS_Iterator it( group );
2498 return avoidCompound ? GetGroupType( it.Value() ) : it.Value().ShapeType();
2500 return TopAbs_SHAPE;
2503 //=======================================================================
2504 //function : IsQuadraticMesh
2505 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
2506 // quadratic elements will be created.
2507 // Used then generated 3D mesh without geometry.
2508 //=======================================================================
2510 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
2512 int NbAllEdgsAndFaces=0;
2513 int NbQuadFacesAndEdgs=0;
2514 int NbFacesAndEdges=0;
2515 //All faces and edges
2516 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
2517 if ( NbAllEdgsAndFaces == 0 )
2518 return SMESH_MesherHelper::LINEAR;
2520 //Quadratic faces and edges
2521 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
2523 //Linear faces and edges
2524 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
2526 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
2528 return SMESH_MesherHelper::QUADRATIC;
2530 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
2532 return SMESH_MesherHelper::LINEAR;
2535 //Mesh with both type of elements
2536 return SMESH_MesherHelper::COMP;
2539 //=======================================================================
2540 //function : GetOtherParam
2541 //purpose : Return an alternative parameter for a node on seam
2542 //=======================================================================
2544 double SMESH_MesherHelper::GetOtherParam(const double param) const
2546 int i = myParIndex & U_periodic ? 0 : 1;
2547 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
2552 //=======================================================================
2554 * \brief Iterator on ancestors of the given type
2556 //=======================================================================
2558 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
2560 TopTools_ListIteratorOfListOfShape _ancIter;
2561 TopAbs_ShapeEnum _type;
2562 TopTools_MapOfShape _encountered;
2563 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
2564 : _ancIter( ancestors ), _type( type )
2566 if ( _ancIter.More() ) {
2567 if ( _ancIter.Value().ShapeType() != _type ) next();
2568 else _encountered.Add( _ancIter.Value() );
2573 return _ancIter.More();
2575 virtual const TopoDS_Shape* next()
2577 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
2578 if ( _ancIter.More() )
2579 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
2580 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
2588 //=======================================================================
2590 * \brief Return iterator on ancestors of the given type
2592 //=======================================================================
2594 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
2595 const SMESH_Mesh& mesh,
2596 TopAbs_ShapeEnum ancestorType)
2598 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
2601 //=======================================================================
2602 //function : GetCommonAncestor
2603 //purpose : Find a common ancestors of two shapes of the given type
2604 //=======================================================================
2606 TopoDS_Shape SMESH_MesherHelper::GetCommonAncestor(const TopoDS_Shape& shape1,
2607 const TopoDS_Shape& shape2,
2608 const SMESH_Mesh& mesh,
2609 TopAbs_ShapeEnum ancestorType)
2611 TopoDS_Shape commonAnc;
2612 if ( !shape1.IsNull() && !shape2.IsNull() )
2614 PShapeIteratorPtr ancIt = GetAncestors( shape1, mesh, ancestorType );
2615 while ( const TopoDS_Shape* anc = ancIt->next() )
2616 if ( IsSubShape( shape2, *anc ))
2625 //#include <Perf_Meter.hxx>
2627 //=======================================================================
2628 namespace { // Structures used by FixQuadraticElements()
2629 //=======================================================================
2631 #define __DMP__(txt) \
2633 #define MSG(txt) __DMP__(txt<<endl)
2634 #define MSGBEG(txt) __DMP__(txt)
2636 //const double straightTol2 = 1e-33; // to detect straing links
2637 bool isStraightLink(double linkLen2, double middleNodeMove2)
2639 // straight if <node move> < 1/15 * <link length>
2640 return middleNodeMove2 < 1/15./15. * linkLen2;
2644 // ---------------------------------------
2646 * \brief Quadratic link knowing its faces
2648 struct QLink: public SMESH_TLink
2650 const SMDS_MeshNode* _mediumNode;
2651 mutable vector<const QFace* > _faces;
2652 mutable gp_Vec _nodeMove;
2653 mutable int _nbMoves;
2655 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
2656 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
2658 //if ( MediumPos() != SMDS_TOP_3DSPACE )
2659 _nodeMove = MediumPnt() - MiddlePnt();
2661 void SetContinuesFaces() const;
2662 const QFace* GetContinuesFace( const QFace* face ) const;
2663 bool OnBoundary() const;
2664 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
2665 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
2667 SMDS_TypeOfPosition MediumPos() const
2668 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
2669 SMDS_TypeOfPosition EndPos(bool isSecond) const
2670 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
2671 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
2672 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
2674 void Move(const gp_Vec& move, bool sum=false) const
2675 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
2676 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
2677 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
2678 bool IsStraight() const
2679 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
2680 _nodeMove.SquareMagnitude());
2682 bool operator<(const QLink& other) const {
2683 return (node1()->GetID() == other.node1()->GetID() ?
2684 node2()->GetID() < other.node2()->GetID() :
2685 node1()->GetID() < other.node1()->GetID());
2687 // struct PtrComparator {
2688 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
2691 // ---------------------------------------------------------
2693 * \brief Link in the chain of links; it connects two faces
2697 const QLink* _qlink;
2698 mutable const QFace* _qfaces[2];
2700 TChainLink(const QLink* qlink=0):_qlink(qlink) {
2701 _qfaces[0] = _qfaces[1] = 0;
2703 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
2705 bool IsBoundary() const { return !_qfaces[1]; }
2707 void RemoveFace( const QFace* face ) const
2708 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
2710 const QFace* NextFace( const QFace* f ) const
2711 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
2713 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
2714 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
2716 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
2718 operator bool() const { return (_qlink); }
2720 const QLink* operator->() const { return _qlink; }
2722 gp_Vec Normal() const;
2724 bool IsStraight() const;
2726 // --------------------------------------------------------------------
2727 typedef list< TChainLink > TChain;
2728 typedef set < TChainLink > TLinkSet;
2729 typedef TLinkSet::const_iterator TLinkInSet;
2731 const int theFirstStep = 5;
2733 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
2734 // --------------------------------------------------------------------
2736 * \brief Quadratic face shared by two volumes and bound by QLinks
2738 struct QFace: public TIDSortedNodeSet
2740 mutable const SMDS_MeshElement* _volumes[2];
2741 mutable vector< const QLink* > _sides;
2742 mutable bool _sideIsAdded[4]; // added in chain of links
2745 mutable const SMDS_MeshElement* _face;
2748 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
2750 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
2752 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
2754 void AddSelfToLinks() const {
2755 for ( int i = 0; i < _sides.size(); ++i )
2756 _sides[i]->_faces.push_back( this );
2758 int LinkIndex( const QLink* side ) const {
2759 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
2762 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
2764 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
2766 int i = LinkIndex( link._qlink );
2767 if ( i < 0 ) return true;
2768 _sideIsAdded[i] = true;
2769 link.SetFace( this );
2770 // continue from opposite link
2771 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
2773 bool IsBoundary() const { return !_volumes[1]; }
2775 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
2777 bool IsSpoiled(const QLink* bentLink ) const;
2779 TLinkInSet GetBoundaryLink( const TLinkSet& links,
2780 const TChainLink& avoidLink,
2781 TLinkInSet * notBoundaryLink = 0,
2782 const SMDS_MeshNode* nodeToContain = 0,
2783 bool * isAdjacentUsed = 0,
2784 int nbRecursionsLeft = -1) const;
2786 TLinkInSet GetLinkByNode( const TLinkSet& links,
2787 const TChainLink& avoidLink,
2788 const SMDS_MeshNode* nodeToContain) const;
2790 const SMDS_MeshNode* GetNodeInFace() const {
2791 for ( int iL = 0; iL < _sides.size(); ++iL )
2792 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
2796 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
2798 double MoveByBoundary( const TChainLink& theLink,
2799 const gp_Vec& theRefVec,
2800 const TLinkSet& theLinks,
2801 SMESH_MesherHelper* theFaceHelper=0,
2802 const double thePrevLen=0,
2803 const int theStep=theFirstStep,
2804 gp_Vec* theLinkNorm=0,
2805 double theSign=1.0) const;
2808 //================================================================================
2810 * \brief Dump QLink and QFace
2812 ostream& operator << (ostream& out, const QLink& l)
2814 out <<"QLink nodes: "
2815 << l.node1()->GetID() << " - "
2816 << l._mediumNode->GetID() << " - "
2817 << l.node2()->GetID() << endl;
2820 ostream& operator << (ostream& out, const QFace& f)
2822 out <<"QFace nodes: "/*<< &f << " "*/;
2823 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
2824 out << (*n)->GetID() << " ";
2825 out << " \tvolumes: "
2826 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
2827 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
2828 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
2832 //================================================================================
2834 * \brief Construct QFace from QLinks
2836 //================================================================================
2838 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
2840 _volumes[0] = _volumes[1] = 0;
2842 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
2843 _normal.SetCoord(0,0,0);
2844 for ( int i = 1; i < _sides.size(); ++i ) {
2845 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
2846 insert( l1->node1() ); insert( l1->node2() );
2848 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
2849 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
2850 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
2854 double normSqSize = _normal.SquareMagnitude();
2855 if ( normSqSize > numeric_limits<double>::min() )
2856 _normal /= sqrt( normSqSize );
2858 _normal.SetCoord(1e-33,0,0);
2864 //================================================================================
2866 * \brief Make up a chain of links
2867 * \param iSide - link to add first
2868 * \param chain - chain to fill in
2869 * \param pos - postion of medium nodes the links should have
2870 * \param error - out, specifies what is wrong
2871 * \retval bool - false if valid chain can't be built; "valid" means that links
2872 * of the chain belongs to rectangles bounding hexahedrons
2874 //================================================================================
2876 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
2878 if ( iSide >= _sides.size() ) // wrong argument iSide
2880 if ( _sideIsAdded[ iSide ]) // already in chain
2883 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
2886 list< const QFace* > faces( 1, this );
2887 while ( !faces.empty() ) {
2888 const QFace* face = faces.front();
2889 for ( int i = 0; i < face->_sides.size(); ++i ) {
2890 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
2891 face->_sideIsAdded[i] = true;
2892 // find a face side in the chain
2893 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
2894 // TChain::iterator chLink = chain.begin();
2895 // for ( ; chLink != chain.end(); ++chLink )
2896 // if ( chLink->_qlink == face->_sides[i] )
2898 // if ( chLink == chain.end() )
2899 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
2900 // add a face to a chained link and put a continues face in the queue
2901 chLink->SetFace( face );
2902 if ( face->_sides[i]->MediumPos() == pos )
2903 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
2904 if ( contFace->_sides.size() == 3 )
2905 faces.push_back( contFace );
2910 if ( error < ERR_TRI )
2912 chain.insert( chain.end(), links.begin(),links.end() );
2915 _sideIsAdded[iSide] = true; // not to add this link to chain again
2916 const QLink* link = _sides[iSide];
2920 // add link into chain
2921 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
2922 chLink->SetFace( this );
2925 // propagate from quadrangle to neighbour faces
2926 if ( link->MediumPos() >= pos ) {
2927 int nbLinkFaces = link->_faces.size();
2928 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
2929 // hexahedral mesh or boundary quadrangles - goto a continous face
2930 if ( const QFace* f = link->GetContinuesFace( this ))
2931 if ( f->_sides.size() == 4 )
2932 return f->GetLinkChain( *chLink, chain, pos, error );
2935 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
2936 for ( int i = 0; i < nbLinkFaces; ++i )
2937 if ( link->_faces[i] )
2938 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
2939 if ( error < ERR_PRISM )
2947 //================================================================================
2949 * \brief Return a boundary link of the triangle face
2950 * \param links - set of all links
2951 * \param avoidLink - link not to return
2952 * \param notBoundaryLink - out, neither the returned link nor avoidLink
2953 * \param nodeToContain - node the returned link must contain; if provided, search
2954 * also performed on adjacent faces
2955 * \param isAdjacentUsed - returns true if link is found in adjacent faces
2956 * \param nbRecursionsLeft - to limit recursion
2958 //================================================================================
2960 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
2961 const TChainLink& avoidLink,
2962 TLinkInSet * notBoundaryLink,
2963 const SMDS_MeshNode* nodeToContain,
2964 bool * isAdjacentUsed,
2965 int nbRecursionsLeft) const
2967 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
2969 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
2970 TFaceLinkList adjacentFaces;
2972 for ( int iL = 0; iL < _sides.size(); ++iL )
2974 if ( avoidLink._qlink == _sides[iL] )
2976 TLinkInSet link = links.find( _sides[iL] );
2977 if ( link == linksEnd ) continue;
2978 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
2979 continue; // We work on faces here, don't go inside a solid
2982 if ( link->IsBoundary() ) {
2983 if ( !nodeToContain ||
2984 (*link)->node1() == nodeToContain ||
2985 (*link)->node2() == nodeToContain )
2987 boundaryLink = link;
2988 if ( !notBoundaryLink ) break;
2991 else if ( notBoundaryLink ) {
2992 *notBoundaryLink = link;
2993 if ( boundaryLink != linksEnd ) break;
2996 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
2997 if ( const QFace* adj = link->NextFace( this ))
2998 if ( adj->Contains( nodeToContain ))
2999 adjacentFaces.push_back( make_pair( adj, link ));
3002 if ( isAdjacentUsed ) *isAdjacentUsed = false;
3003 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
3005 if ( nbRecursionsLeft < 0 )
3006 nbRecursionsLeft = nodeToContain->NbInverseElements();
3007 TFaceLinkList::iterator adj = adjacentFaces.begin();
3008 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
3009 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
3010 isAdjacentUsed, nbRecursionsLeft-1);
3011 if ( isAdjacentUsed ) *isAdjacentUsed = true;
3013 return boundaryLink;
3015 //================================================================================
3017 * \brief Return a link ending at the given node but not avoidLink
3019 //================================================================================
3021 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
3022 const TChainLink& avoidLink,
3023 const SMDS_MeshNode* nodeToContain) const
3025 for ( int i = 0; i < _sides.size(); ++i )
3026 if ( avoidLink._qlink != _sides[i] &&
3027 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
3028 return links.find( _sides[ i ]);
3032 //================================================================================
3034 * \brief Return normal to the i-th side pointing outside the face
3036 //================================================================================
3038 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
3040 gp_Vec norm, vecOut;
3041 // if ( uvHelper ) {
3042 // TopoDS_Face face = TopoDS::Face( uvHelper->GetSubShape());
3043 // const SMDS_MeshNode* inFaceNode = uvHelper->GetNodeUVneedInFaceNode() ? GetNodeInFace() : 0;
3044 // gp_XY uv1 = uvHelper->GetNodeUV( face, _sides[i]->node1(), inFaceNode );
3045 // gp_XY uv2 = uvHelper->GetNodeUV( face, _sides[i]->node2(), inFaceNode );
3046 // norm.SetCoord( uv1.Y() - uv2.Y(), uv2.X() - uv1.X(), 0 );
3048 // const QLink* otherLink = _sides[(i + 1) % _sides.size()];
3049 // const SMDS_MeshNode* otherNode =
3050 // otherLink->node1() == _sides[i]->node1() ? otherLink->node2() : otherLink->node1();
3051 // gp_XY pIn = uvHelper->GetNodeUV( face, otherNode, inFaceNode );
3052 // vecOut.SetCoord( uv1.X() - pIn.X(), uv1.Y() - pIn.Y(), 0 );
3055 norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3056 gp_XYZ pIn = ( XYZ( _sides[0]->node1() ) +
3057 XYZ( _sides[0]->node2() ) +
3058 XYZ( _sides[1]->node1() )) / 3.;
3059 vecOut.SetXYZ( _sides[i]->MiddlePnt() - pIn );
3061 if ( norm * vecOut < 0 )
3063 double mag2 = norm.SquareMagnitude();
3064 if ( mag2 > numeric_limits<double>::min() )
3065 norm /= sqrt( mag2 );
3068 //================================================================================
3070 * \brief Move medium node of theLink according to its distance from boundary
3071 * \param theLink - link to fix
3072 * \param theRefVec - movement of boundary
3073 * \param theLinks - all adjacent links of continous triangles
3074 * \param theFaceHelper - helper is not used so far
3075 * \param thePrevLen - distance from the boundary
3076 * \param theStep - number of steps till movement propagation limit
3077 * \param theLinkNorm - out normal to theLink
3078 * \param theSign - 1 or -1 depending on movement of boundary
3079 * \retval double - distance from boundary to propagation limit or other boundary
3081 //================================================================================
3083 double QFace::MoveByBoundary( const TChainLink& theLink,
3084 const gp_Vec& theRefVec,
3085 const TLinkSet& theLinks,
3086 SMESH_MesherHelper* theFaceHelper,
3087 const double thePrevLen,
3089 gp_Vec* theLinkNorm,
3090 double theSign) const
3093 return thePrevLen; // propagation limit reached
3095 int iL; // index of theLink
3096 for ( iL = 0; iL < _sides.size(); ++iL )
3097 if ( theLink._qlink == _sides[ iL ])
3100 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
3101 <<" thePrevLen " << thePrevLen);
3102 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
3104 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
3105 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
3106 if ( theStep == theFirstStep )
3107 theSign = refProj < 0. ? -1. : 1.;
3108 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
3109 return thePrevLen; // to propagate movement forward only, not in side dir or backward
3111 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
3112 TLinkInSet link1 = theLinks.find( _sides[iL1] );
3113 TLinkInSet link2 = theLinks.find( _sides[iL2] );
3114 if ( link1 == theLinks.end() || link2 == theLinks.end() )
3116 const QFace* f1 = link1->NextFace( this ); // adjacent faces
3117 const QFace* f2 = link2->NextFace( this );
3119 // propagate to adjacent faces till limit step or boundary
3120 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
3121 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
3122 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
3123 gp_Vec linkDir2(0,0,0);
3126 if ( f1 && theLink->MediumPos() <= (*link1)->MediumPos() )
3127 len1 = f1->MoveByBoundary
3128 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
3130 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
3132 MSG( " --------------- EXCEPTION");
3137 if ( f2 && theLink->MediumPos() <= (*link2)->MediumPos() )
3138 len2 = f2->MoveByBoundary
3139 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
3141 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
3143 MSG( " --------------- EXCEPTION");
3148 if ( theStep != theFirstStep )
3150 // choose chain length by direction of propagation most codirected with theRefVec
3151 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
3152 fullLen = choose1 ? len1 : len2;
3153 double r = thePrevLen / fullLen;
3155 gp_Vec move = linkNorm * refProj * ( 1 - r );
3156 theLink->Move( move, true );
3158 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
3159 " by " << refProj * ( 1 - r ) << " following " <<
3160 (choose1 ? *link1->_qlink : *link2->_qlink));
3162 if ( theLinkNorm ) *theLinkNorm = linkNorm;
3167 //================================================================================
3169 * \brief Checks if the face is distorted due to bentLink
3171 //================================================================================
3173 bool QFace::IsSpoiled(const QLink* bentLink ) const
3175 // code is valid for convex faces only
3177 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
3178 gc += XYZ( *n ) / size();
3179 for (unsigned i = 0; i < _sides.size(); ++i )
3181 if ( _sides[i] == bentLink ) continue;
3182 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
3183 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
3184 if ( linkNorm * vecOut < 0 )
3186 double mag2 = linkNorm.SquareMagnitude();
3187 if ( mag2 > numeric_limits<double>::min() )
3188 linkNorm /= sqrt( mag2 );
3189 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
3190 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
3191 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
3198 //================================================================================
3200 * \brief Find pairs of continues faces
3202 //================================================================================
3204 void QLink::SetContinuesFaces() const
3206 // x0 x - QLink, [-|] - QFace, v - volume
3208 // | Between _faces of link x2 two vertical faces are continues
3209 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
3210 // | to _faces[0] and _faces[1] and horizontal faces to
3211 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
3214 if ( _faces.empty() )
3216 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
3217 if ( _faces[0]->IsBoundary() )
3218 iBoundary[ nbBoundary++ ] = 0;
3219 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
3221 // look for a face bounding none of volumes bound by _faces[0]
3222 bool sameVol = false;
3223 int nbVol = _faces[iF]->NbVolumes();
3224 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
3225 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
3226 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
3229 if ( _faces[iF]->IsBoundary() )
3230 iBoundary[ nbBoundary++ ] = iF;
3232 // Set continues faces: arrange _faces to have
3233 // _faces[0] continues to _faces[1]
3234 // _faces[2] continues to _faces[3]
3235 if ( nbBoundary == 2 ) // bnd faces are continues
3237 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
3239 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
3240 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
3243 else if ( iFaceCont > 0 ) // continues faces found
3245 if ( iFaceCont != 1 )
3246 std::swap( _faces[1], _faces[iFaceCont] );
3248 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
3250 _faces.insert( ++_faces.begin(), 0 );
3253 //================================================================================
3255 * \brief Return a face continues to the given one
3257 //================================================================================
3259 const QFace* QLink::GetContinuesFace( const QFace* face ) const
3261 for ( int i = 0; i < _faces.size(); ++i ) {
3262 if ( _faces[i] == face ) {
3263 int iF = i < 2 ? 1-i : 5-i;
3264 return iF < _faces.size() ? _faces[iF] : 0;
3269 //================================================================================
3271 * \brief True if link is on mesh boundary
3273 //================================================================================
3275 bool QLink::OnBoundary() const
3277 for ( int i = 0; i < _faces.size(); ++i )
3278 if (_faces[i] && _faces[i]->IsBoundary()) return true;
3281 //================================================================================
3283 * \brief Return normal of link of the chain
3285 //================================================================================
3287 gp_Vec TChainLink::Normal() const {
3289 if (_qfaces[0]) norm = _qfaces[0]->_normal;
3290 if (_qfaces[1]) norm += _qfaces[1]->_normal;
3293 //================================================================================
3295 * \brief Test link curvature taking into account size of faces
3297 //================================================================================
3299 bool TChainLink::IsStraight() const
3301 bool isStraight = _qlink->IsStraight();
3302 if ( isStraight && _qfaces[0] && !_qfaces[1] )
3304 int i = _qfaces[0]->LinkIndex( _qlink );
3305 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
3306 gp_XYZ mid1 = _qlink->MiddlePnt();
3307 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
3308 double faceSize2 = (mid1-mid2).SquareModulus();
3309 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
3314 //================================================================================
3316 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
3318 //================================================================================
3320 void fixPrism( TChain& allLinks )
3322 // separate boundary links from internal ones
3323 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
3324 QLinkSet interLinks, bndLinks1, bndLink2;
3326 bool isCurved = false;
3327 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3328 if ( (*lnk)->OnBoundary() )
3329 bndLinks1.insert( lnk->_qlink );
3331 interLinks.insert( lnk->_qlink );
3332 isCurved = isCurved || !lnk->IsStraight();
3335 return; // no need to move
3337 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
3339 while ( !interLinks.empty() && !curBndLinks->empty() )
3341 // propagate movement from boundary links to connected internal links
3342 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
3343 for ( ; bnd != bndEnd; ++bnd )
3345 const QLink* bndLink = *bnd;
3346 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
3348 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
3349 if ( !face ) continue;
3350 // find and move internal link opposite to bndLink within the face
3351 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
3352 const QLink* interLink = face->_sides[ interInd ];
3353 QLinkSet::iterator pInterLink = interLinks.find( interLink );
3354 if ( pInterLink == interLinks.end() ) continue; // not internal link
3355 interLink->Move( bndLink->_nodeMove );
3356 // treated internal links become new boundary ones
3357 interLinks. erase( pInterLink );
3358 newBndLinks->insert( interLink );
3361 curBndLinks->clear();
3362 std::swap( curBndLinks, newBndLinks );
3366 //================================================================================
3368 * \brief Fix links of continues triangles near curved boundary
3370 //================================================================================
3372 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
3374 if ( allLinks.empty() ) return;
3376 TLinkSet linkSet( allLinks.begin(), allLinks.end());
3377 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
3379 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
3381 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
3383 // move iff a boundary link is bent towards inside of a face (issue 0021084)
3384 const QFace* face = linkIt->_qfaces[0];
3385 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
3386 face->_sides[1]->MiddlePnt() +
3387 face->_sides[2]->MiddlePnt() ) / 3.;
3388 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
3389 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
3390 //if ( face->IsSpoiled( linkIt->_qlink ))
3391 if ( linkBentInside )
3392 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
3397 //================================================================================
3399 * \brief Detect rectangular structure of links and build chains from them
3401 //================================================================================
3403 enum TSplitTriaResult {
3404 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
3405 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
3407 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
3408 vector< TChain> & resultChains,
3409 SMDS_TypeOfPosition pos )
3411 // put links in the set and evalute number of result chains by number of boundary links
3414 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
3415 linkSet.insert( *lnk );
3416 nbBndLinks += lnk->IsBoundary();
3418 resultChains.clear();
3419 resultChains.reserve( nbBndLinks / 2 );
3421 TLinkInSet linkIt, linksEnd = linkSet.end();
3423 // find a boundary link with corner node; corner node has position pos-2
3424 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
3426 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
3427 const SMDS_MeshNode* corner = 0;
3428 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
3429 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
3434 TLinkInSet startLink = linkIt;
3435 const SMDS_MeshNode* startCorner = corner;
3436 vector< TChain* > rowChains;
3439 while ( startLink != linksEnd) // loop on columns
3441 // We suppose we have a rectangular structure like shown here. We have found a
3442 // corner of the rectangle (startCorner) and a boundary link sharing
3443 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
3444 // --o---o---o structure making several chains at once. One chain (columnChain)
3445 // |\ | /| starts at startLink and continues upward (we look at the structure
3446 // \ | \ | / | from such point that startLink is on the bottom of the structure).
3447 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
3448 // --o---o---o encounter.
3450 // / | \ | \ | startCorner
3455 if ( resultChains.size() == nbBndLinks / 2 )
3457 resultChains.push_back( TChain() );
3458 TChain& columnChain = resultChains.back();
3460 TLinkInSet botLink = startLink; // current horizontal link to go up from
3461 corner = startCorner; // current corner the botLink ends at
3463 while ( botLink != linksEnd ) // loop on rows
3465 // add botLink to the columnChain
3466 columnChain.push_back( *botLink );
3468 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
3470 { // the column ends
3471 if ( botLink == startLink )
3472 return _TWISTED_CHAIN; // issue 0020951
3473 linkSet.erase( botLink );
3474 if ( iRow != rowChains.size() )
3475 return _FEW_ROWS; // different nb of rows in columns
3478 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
3479 // link ending at <corner> (sideLink); there are two cases:
3480 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
3481 // since midQuadLink is not at boundary while sideLink is.
3482 // 2) midQuadLink ends at <corner>
3484 TLinkInSet midQuadLink = linksEnd;
3485 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
3487 if ( isCase2 ) { // find midQuadLink among links of botTria
3488 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
3489 if ( midQuadLink->IsBoundary() )
3490 return _BAD_MIDQUAD;
3492 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
3493 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
3496 columnChain.push_back( *midQuadLink );
3497 if ( iRow >= rowChains.size() ) {
3499 return _MANY_ROWS; // different nb of rows in columns
3500 if ( resultChains.size() == nbBndLinks / 2 )
3502 resultChains.push_back( TChain() );
3503 rowChains.push_back( & resultChains.back() );
3505 rowChains[iRow]->push_back( *sideLink );
3506 rowChains[iRow]->push_back( *midQuadLink );
3508 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
3512 // prepare startCorner and startLink for the next column
3513 startCorner = startLink->NextNode( startCorner );
3515 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
3517 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
3518 // check if no more columns remains
3519 if ( startLink != linksEnd ) {
3520 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
3521 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
3522 startLink = linksEnd; // startLink bounds upTria or botTria
3523 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
3527 // find bottom link and corner for the next row
3528 corner = sideLink->NextNode( corner );
3529 // next bottom link ends at the new corner
3530 linkSet.erase( botLink );
3531 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
3532 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
3534 if ( midQuadLink == startLink || sideLink == startLink )
3535 return _TWISTED_CHAIN; // issue 0020951
3536 linkSet.erase( midQuadLink );
3537 linkSet.erase( sideLink );
3539 // make faces neighboring the found ones be boundary
3540 if ( startLink != linksEnd ) {
3541 const QFace* tria = isCase2 ? botTria : upTria;
3542 for ( int iL = 0; iL < 3; ++iL ) {
3543 linkIt = linkSet.find( tria->_sides[iL] );
3544 if ( linkIt != linksEnd )
3545 linkIt->RemoveFace( tria );
3548 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
3549 botLink->RemoveFace( upTria ); // make next botTria first in vector
3556 // In the linkSet, there must remain the last links of rowChains; add them
3557 if ( linkSet.size() != rowChains.size() )
3558 return _BAD_SET_SIZE;
3559 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
3560 // find the link (startLink) ending at startCorner
3562 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
3563 if ( (*startLink)->node1() == startCorner ) {
3564 corner = (*startLink)->node2(); break;
3566 else if ( (*startLink)->node2() == startCorner) {
3567 corner = (*startLink)->node1(); break;
3570 if ( startLink == linksEnd )
3572 rowChains[ iRow ]->push_back( *startLink );
3573 linkSet.erase( startLink );
3574 startCorner = corner;
3580 //================================================================================
3582 * \brief Place medium nodes at the link middle for elements whose corner nodes
3583 * are out of geometrical boundary to prevent distorting elements.
3584 * Issue 0020982, note 0013990
3586 //================================================================================
3588 void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
3589 SMESH_ComputeErrorPtr& theError)
3591 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
3592 TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
3593 if ( shape.IsNull() ) return;
3595 if ( !theError ) theError = SMESH_ComputeError::New();
3599 if ( shape.ShapeType() == TopAbs_FACE ) // 2D
3601 if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
3603 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
3604 if ( !faceSM ) return;
3606 const TopoDS_Face& face = TopoDS::Face( shape );
3607 Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
3609 TopExp_Explorer edgeIt( face, TopAbs_EDGE );
3610 for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
3612 // check if the EDGE needs checking
3613 const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
3614 if ( BRep_Tool::Degenerated( edge ) )
3616 if ( theHelper.IsRealSeam( edge ) &&
3617 edge.Orientation() == TopAbs_REVERSED )
3620 SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
3621 if ( !edgeSM ) continue;
3624 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
3625 BRepAdaptor_Curve curve3D( edge );
3626 switch ( curve3D.GetType() ) {
3627 case GeomAbs_Line: continue;
3628 case GeomAbs_Circle:
3629 case GeomAbs_Ellipse:
3630 case GeomAbs_Hyperbola:
3631 case GeomAbs_Parabola:
3634 gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
3635 curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
3636 gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
3637 surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
3638 gp_Vec fNorm = Du1 ^ Dv1;
3639 if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
3640 continue; // face is normal to the curve3D
3642 gp_Vec curvNorm = fNorm ^ D1;
3643 if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
3644 if ( curvNorm * D2 > 0 )
3645 continue; // convex edge
3647 catch ( Standard_Failure )
3652 // get nodes shared by faces that may be distorted
3653 SMDS_NodeIteratorPtr nodeIt;
3654 if ( edgeSM->NbNodes() > 0 ) {
3655 nodeIt = edgeSM->GetNodes();
3658 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
3660 vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
3661 if ( !vertexSM ) continue;
3662 nodeIt = vertexSM->GetNodes();
3665 // find suspicious faces
3666 TIDSortedElemSet checkedFaces;
3667 vector< const SMDS_MeshNode* > nOnEdge( 2 );
3668 const SMDS_MeshNode* nOnFace;
3669 while ( nodeIt->more() )
3671 const SMDS_MeshNode* n = nodeIt->next();
3672 SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
3673 while ( faceIt->more() )
3675 const SMDS_MeshElement* f = faceIt->next();
3676 if ( !faceSM->Contains( f ) ||
3677 f->NbNodes() != 6 || // check quadratic triangles only
3678 !checkedFaces.insert( f ).second )
3681 // get nodes on EDGE and on FACE of a suspicious face
3682 nOnEdge.clear(); nOnFace = 0;
3683 SMDS_MeshElement::iterator triNode = f->begin_nodes();
3684 for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
3687 if ( n->GetPosition()->GetDim() == 2 )
3690 nOnEdge.push_back( n );
3693 // check if nOnFace is inside the FACE
3694 if ( nOnFace && nOnEdge.size() == 2 )
3696 theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
3697 if ( !SMESH_Algo::FaceNormal( f, faceNorm, /*normalized=*/false ))
3699 gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
3700 gp_XYZ edgeNorm = faceNorm ^ edgeDir;
3701 n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true );
3702 gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
3703 gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
3704 gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
3705 double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
3706 double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
3707 if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
3709 // nOnFace is out of FACE, move a medium on-edge node to the middle
3710 gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
3711 meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
3712 MSG( "move OUT of face " << n );
3713 theError->myBadElements.push_back( f );
3719 if ( !theError->myBadElements.empty() )
3720 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
3723 } // 2D ==============================================================================
3725 if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
3727 if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
3728 theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
3730 SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
3731 if ( !solidSM ) return;
3733 // check if the SOLID is bound by concave FACEs
3734 vector< TopoDS_Face > concaveFaces;
3735 TopExp_Explorer faceIt( shape, TopAbs_FACE );
3736 for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
3738 const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
3739 if ( !meshDS->MeshElements( face )) continue;
3741 BRepAdaptor_Surface surface( face );
3742 switch ( surface.GetType() ) {
3743 case GeomAbs_Plane: continue;
3744 case GeomAbs_Cylinder:
3746 case GeomAbs_Sphere:
3749 double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
3750 double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
3751 gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
3752 surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
3753 gp_Vec fNorm = Du1 ^ Dv1;
3754 if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
3755 bool concaveU = ( fNorm * Du2 > 1e-100 );
3756 bool concaveV = ( fNorm * Dv2 > 1e-100 );
3757 if ( concaveU || concaveV )
3758 concaveFaces.push_back( face );
3760 catch ( Standard_Failure )
3762 concaveFaces.push_back( face );
3766 if ( concaveFaces.empty() )
3769 // fix 2D mesh on the SOLID
3770 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
3772 SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
3773 faceHelper.SetSubShape( faceIt.Current() );
3774 force3DOutOfBoundary( faceHelper, theError );
3777 // get an iterator over faces on concaveFaces
3778 vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
3779 for ( size_t i = 0; i < concaveFaces.size(); ++i )
3780 faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
3781 typedef SMDS_IteratorOnIterators
3782 < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
3783 SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
3785 // a seacher to check if a volume is close to a concave face
3786 std::auto_ptr< SMESH_ElementSearcher > faceSearcher
3787 ( SMESH_MeshEditor( theHelper.GetMesh() ).GetElementSearcher( faceIter ));
3790 //BRepClass3d_SolidClassifier solidClassifier( shape );
3792 TIDSortedElemSet checkedVols, movedNodes;
3793 for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
3795 const TopoDS_Shape& face = faceIt.Current();
3796 SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
3797 if ( !faceSM ) continue;
3799 // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
3800 SMDS_NodeIteratorPtr nodeIt;
3801 if ( faceSM->NbNodes() > 0 ) {
3802 nodeIt = faceSM->GetNodes();
3805 TopExp_Explorer vertex( face, TopAbs_VERTEX );
3806 SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
3807 if ( !vertexSM ) continue;
3808 nodeIt = vertexSM->GetNodes();
3811 // find suspicious volumes adjacent to the FACE
3812 vector< const SMDS_MeshNode* > nOnFace( 4 );
3813 const SMDS_MeshNode* nInSolid;
3814 //vector< const SMDS_MeshElement* > intersectedFaces;
3815 while ( nodeIt->more() )
3817 const SMDS_MeshNode* n = nodeIt->next();
3818 SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
3819 while ( volIt->more() )
3821 const SMDS_MeshElement* vol = volIt->next();
3822 int nbN = vol->NbCornerNodes();
3823 if ( ( nbN != 4 && nbN != 5 ) ||
3824 !solidSM->Contains( vol ) ||
3825 !checkedVols.insert( vol ).second )
3828 // get nodes on FACE and in SOLID of a suspicious volume
3829 nOnFace.clear(); nInSolid = 0;
3830 SMDS_MeshElement::iterator volNode = vol->begin_nodes();
3831 for ( int nb = nbN; nb > 0; ++volNode, --nb )
3834 if ( n->GetPosition()->GetDim() == 3 )
3837 nOnFace.push_back( n );
3839 if ( !nInSolid || nOnFace.size() != nbN - 1 )
3842 // get size of the vol
3843 SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
3844 double volLength = pInSolid.SquareDistance( nOnFace[0] );
3845 for ( size_t i = 1; i < nOnFace.size(); ++i )
3847 volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
3850 // check if vol is close to concaveFaces
3851 const SMDS_MeshElement* closeFace =
3852 faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
3854 pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
3857 // check if vol is distorted, i.e. a medium node is much closer
3858 // to nInSolid than the link middle
3859 bool isDistorted = false;
3860 SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
3861 if ( !SMESH_Algo::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
3863 theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
3864 vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
3865 for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
3866 for ( size_t j = i+1; j < nOnFace.size(); ++j )
3868 SMESH_TLink link( nOnFace[i], nOnFace[j] );
3869 TLinkNodeMap::const_iterator linkIt =
3870 theHelper.GetTLinkNodeMap().find( link );
3871 if ( linkIt != theHelper.GetTLinkNodeMap().end() )
3873 links.push_back( make_pair( linkIt->first, linkIt->second ));
3874 if ( !isDistorted ) {
3875 // compare projections of nInSolid and nMedium to face normal
3876 gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
3877 double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
3878 double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
3879 isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
3883 // move medium nodes to link middle
3886 for ( size_t i = 0; i < links.size(); ++i )
3888 const SMDS_MeshNode* nMedium = links[i].second;
3889 if ( movedNodes.insert( nMedium ).second )
3891 gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
3892 SMESH_TNodeXYZ( links[i].first.node2() ));
3893 meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
3894 MSG( "move OUT of solid " << nMedium );
3897 theError->myBadElements.push_back( vol );
3899 } // loop on volumes sharing a node on FACE
3900 } // loop on nodes on FACE
3901 } // loop on FACEs of a SOLID
3903 if ( !theError->myBadElements.empty() )
3904 theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
3910 //=======================================================================
3912 * \brief Move medium nodes of faces and volumes to fix distorted elements
3913 * \param error - container of fixed distorted elements
3914 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
3916 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
3918 //=======================================================================
3920 void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& compError,
3923 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
3924 if ( getenv("NO_FixQuadraticElements") )
3927 // 0. Apply algorithm to SOLIDs or FACEs
3928 // ----------------------------------------------
3929 if ( myShape.IsNull() ) {
3930 if ( !myMesh->HasShapeToMesh() ) return;
3931 SetSubShape( myMesh->GetShapeToMesh() );
3935 TopTools_IndexedMapOfShape solids;
3936 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
3937 nbSolids = solids.Extent();
3939 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
3940 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
3941 faces.Add( f.Current() ); // not in solid
3943 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
3944 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
3945 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
3946 faces.Add( f.Current() ); // in not meshed solid
3948 else { // fix nodes in the solid and its faces
3950 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
3952 SMESH_MesherHelper h(*myMesh);
3953 h.SetSubShape( s.Current() );
3954 h.ToFixNodeParameters(true);
3955 h.FixQuadraticElements( compError, false );
3958 // fix nodes on geom faces
3960 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
3962 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
3963 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
3964 SMESH_MesherHelper h(*myMesh);
3965 h.SetSubShape( fIt.Key() );
3966 h.ToFixNodeParameters(true);
3967 h.FixQuadraticElements( compError, true);
3969 //perf_print_all_meters(1);
3970 if ( compError && compError->myName == EDITERR_NO_MEDIUM_ON_GEOM )
3971 compError->myComment = "during conversion to quadratic, "
3972 "some medium nodes were not placed on geometry to avoid distorting elements";
3976 // 1. Find out type of elements and get iterator on them
3977 // ---------------------------------------------------
3979 SMDS_ElemIteratorPtr elemIt;
3980 SMDSAbs_ElementType elemType = SMDSAbs_All;
3982 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
3985 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
3986 elemIt = smDS->GetElements();
3987 if ( elemIt->more() ) {
3988 elemType = elemIt->next()->GetType();
3989 elemIt = smDS->GetElements();
3992 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
3995 // 2. Fill in auxiliary data structures
3996 // ----------------------------------
4000 set< QLink >::iterator pLink;
4001 set< QFace >::iterator pFace;
4003 bool isCurved = false;
4004 //bool hasRectFaces = false;
4005 //set<int> nbElemNodeSet;
4006 SMDS_VolumeTool volTool;
4008 TIDSortedNodeSet apexOfPyramid;
4009 const int apexIndex = 4;
4012 // Move medium nodes to the link middle for elements whose corner nodes
4013 // are out of geometrical boundary to fix distorted elements.
4014 force3DOutOfBoundary( *this, compError );
4016 if ( elemType == SMDSAbs_Volume )
4018 while ( elemIt->more() ) // loop on volumes
4020 const SMDS_MeshElement* vol = elemIt->next();
4021 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
4023 double volMinSize2 = -1.;
4024 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
4026 int nbN = volTool.NbFaceNodes( iF );
4027 //nbElemNodeSet.insert( nbN );
4028 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
4029 vector< const QLink* > faceLinks( nbN/2 );
4030 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
4033 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
4034 pLink = links.insert( link ).first;
4035 faceLinks[ iN/2 ] = & *pLink;
4037 if ( link.MediumPos() == SMDS_TOP_3DSPACE )
4039 if ( !link.IsStraight() )
4040 return; // already fixed
4042 else if ( !isCurved )
4044 if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
4045 isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
4049 pFace = faces.insert( QFace( faceLinks )).first;
4050 if ( pFace->NbVolumes() == 0 )
4051 pFace->AddSelfToLinks();
4052 pFace->SetVolume( vol );
4053 // hasRectFaces = hasRectFaces ||
4054 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
4055 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
4058 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
4060 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
4061 faceNodes[4],faceNodes[6] );
4064 // collect pyramid apexes for further correction
4065 if ( vol->NbCornerNodes() == 5 )
4066 apexOfPyramid.insert( vol->GetNode( apexIndex ));
4068 set< QLink >::iterator pLink = links.begin();
4069 for ( ; pLink != links.end(); ++pLink )
4070 pLink->SetContinuesFaces();
4074 while ( elemIt->more() ) // loop on faces
4076 const SMDS_MeshElement* face = elemIt->next();
4077 if ( !face->IsQuadratic() )
4079 //nbElemNodeSet.insert( face->NbNodes() );
4080 int nbN = face->NbNodes()/2;
4081 vector< const QLink* > faceLinks( nbN );
4082 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
4085 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
4086 pLink = links.insert( link ).first;
4087 faceLinks[ iN ] = & *pLink;
4089 link.node1()->GetPosition()->GetTypeOfPosition() < 2 &&
4090 link.node2()->GetPosition()->GetTypeOfPosition() < 2 )
4091 isCurved = !link.IsStraight();
4094 pFace = faces.insert( QFace( faceLinks )).first;
4095 pFace->AddSelfToLinks();
4096 //hasRectFaces = ( hasRectFaces || nbN == 4 );
4100 return; // no curved edges of faces
4102 // 3. Compute displacement of medium nodes
4103 // ---------------------------------------
4105 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones.
4106 TopLoc_Location loc;
4108 // not to treat boundary of volumic sub-mesh.
4109 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
4110 for ( ; isInside < 2; ++isInside )
4112 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
4113 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
4114 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
4116 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
4117 if ( bool(isInside) == pFace->IsBoundary() )
4119 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
4122 // make chain of links connected via continues faces
4125 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
4127 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
4129 vector< TChain > chains;
4130 if ( error == ERR_OK ) { // chain contains continues rectangles
4132 chains[0].splice( chains[0].begin(), rawChain );
4134 else if ( error == ERR_TRI ) { // chain contains continues triangles
4135 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
4136 if ( res != _OK ) { // not quadrangles split into triangles
4137 fixTriaNearBoundary( rawChain, *this );
4141 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
4142 fixPrism( rawChain );
4148 for ( int iC = 0; iC < chains.size(); ++iC )
4150 TChain& chain = chains[iC];
4151 if ( chain.empty() ) continue;
4152 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
4153 MSG("3D straight - ignore");
4156 if ( chain.front()->MediumPos() > bndPos ||
4157 chain.back() ->MediumPos() > bndPos ) {
4158 MSG("Internal chain - ignore");
4161 // mesure chain length and compute link position along the chain
4162 double chainLen = 0;
4163 vector< double > linkPos;
4164 MSGBEG( "Link medium nodes: ");
4165 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
4166 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
4167 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
4168 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4169 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
4170 link1 = chain.erase( link1 );
4171 if ( link1 == chain.end() )
4173 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
4176 linkPos.push_back( chainLen );
4179 if ( linkPos.size() < 2 )
4182 gp_Vec move0 = chain.front()->_nodeMove;
4183 gp_Vec move1 = chain.back ()->_nodeMove;
4188 // compute node displacement of end links of chain in parametric space of face
4189 TChainLink& linkOnFace = *(++chain.begin());
4190 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
4191 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
4192 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
4194 face = TopoDS::Face( f );
4195 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
4197 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
4199 TChainLink& link = is1 ? chain.back() : chain.front();
4200 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
4201 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
4202 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
4203 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4204 // uvMove = uvm - uv12
4205 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
4206 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
4207 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
4208 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
4209 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
4210 10 * uvMove.SquareModulus());
4212 if ( isStraight[0] && isStraight[1] ) {
4213 MSG("2D straight - ignore");
4214 continue; // straight - no need to move nodes of internal links
4217 // check if a chain is already fixed
4218 gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
4219 gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
4220 gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
4221 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
4222 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
4224 MSG("Already fixed - ignore");
4230 if ( isInside || face.IsNull() )
4232 // compute node displacement of end links in their local coord systems
4234 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
4235 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
4236 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4237 move0.Transform(trsf);
4240 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
4241 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
4242 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
4243 move1.Transform(trsf);
4246 // compute displacement of medium nodes
4247 link2 = chain.begin();
4250 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
4252 double r = linkPos[i] / chainLen;
4253 // displacement in local coord system
4254 gp_Vec move = (1. - r) * move0 + r * move1;
4255 if ( isInside || face.IsNull()) {
4256 // transform to global
4257 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
4258 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
4259 gp_Vec x = x01.Normalized() + x12.Normalized();
4260 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
4261 move.Transform(trsf);
4264 // compute 3D displacement by 2D one
4265 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
4266 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
4267 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
4268 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
4269 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
4271 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
4272 move.SquareMagnitude())
4274 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
4275 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
4276 MSG( "TOO LONG MOVE \t" <<
4277 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
4278 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
4279 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
4280 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
4284 (*link1)->Move( move );
4285 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
4286 << chain.front()->_mediumNode->GetID() <<"-"
4287 << chain.back ()->_mediumNode->GetID() <<
4288 " by " << move.Magnitude());
4290 } // loop on chains of links
4291 } // loop on 2 directions of propagation from quadrangle
4293 } // fix faces and/or volumes
4298 TIDSortedElemSet biQuadQuas, triQuadHexa;
4299 const SMDS_MeshElement *biQuadQua, *triQuadHex;
4300 const bool toFixCentralNodes = ( myMesh->NbBiQuadQuadrangles() +
4301 myMesh->NbTriQuadraticHexas() );
4303 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
4304 if ( pLink->IsMoved() )
4306 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
4307 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
4309 // collect bi-quadratic elements
4310 if ( toFixCentralNodes )
4312 biQuadQua = triQuadHex = 0;
4313 SMDS_ElemIteratorPtr eIt = pLink->_mediumNode->GetInverseElementIterator();
4314 while ( eIt->more() )
4316 const SMDS_MeshElement* e = eIt->next();
4317 SMDSAbs_EntityType type = e->GetEntityType();
4318 if ( type == SMDSEntity_BiQuad_Quadrangle )
4319 biQuadQuas.insert( e );
4320 else if ( type == SMDSEntity_TriQuad_Hexa )
4321 triQuadHexa.insert( e );
4327 // Fix positions of central nodes of bi-tri-quadratic elements
4329 // treat bi-quad quadrangles
4331 vector< const SMDS_MeshNode* > nodes( 9 );
4333 //TIDSortedNodeSet checkedNodes;
4334 TIDSortedElemSet::iterator quadIt = biQuadQuas.begin();
4335 for ( ; quadIt != biQuadQuas.end(); ++quadIt )
4337 const SMDS_MeshElement* quad = *quadIt;
4340 nodes.assign( quad->begin_nodes(), quad->end_nodes() );
4342 TopoDS_Shape S = GetSubShapeByNode( nodes.back(), GetMeshDS() );
4343 if ( S.IsNull() || S.ShapeType() != TopAbs_FACE ) continue;
4344 const TopoDS_Face& F = TopoDS::Face( S );
4345 Handle( Geom_Surface ) surf = BRep_Tool::Surface( F, loc );
4346 const double tol = BRep_Tool::Tolerance( F );
4348 for ( int i = 0; i < 8; ++i )
4350 uv[ i ] = GetNodeUV( F, nodes[i], nodes[8], &checkUV );
4351 // as this method is used after mesh generation, UV of nodes is not
4352 // updated according to bending links, so we update
4353 if ( i > 3 && nodes[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
4354 CheckNodeUV( F, nodes[i], uv[ i ], 2*tol, /*force=*/true );
4356 // move central node
4357 gp_XY uvCent = calcTFI (0.5, 0.5, uv[0],uv[1],uv[2],uv[3],uv[4],uv[5],uv[6],uv[7] );
4358 gp_Pnt p = surf->Value( uvCent.X(), uvCent.Y() ).Transformed( loc );
4359 GetMeshDS()->MoveNode( nodes[8], p.X(), p.Y(), p.Z());
4363 // treat tri-quadratic hexahedra
4365 SMDS_VolumeTool volExp;
4366 TIDSortedElemSet::iterator hexIt = triQuadHexa.begin();
4367 for ( ; hexIt != triQuadHexa.end(); ++hexIt )
4369 volExp.Set( *hexIt, /*ignoreCentralNodes=*/false );
4371 // fix nodes central in sides
4372 for ( int iQuad = 0; iQuad < volExp.NbFaces(); ++iQuad )
4374 const SMDS_MeshNode** quadNodes = volExp.GetFaceNodes( iQuad );
4375 if ( quadNodes[8]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_3DSPACE )
4377 gp_XYZ p = calcTFI( 0.5, 0.5,
4378 SMESH_TNodeXYZ( quadNodes[0] ), SMESH_TNodeXYZ( quadNodes[2] ),
4379 SMESH_TNodeXYZ( quadNodes[4] ), SMESH_TNodeXYZ( quadNodes[6] ),
4380 SMESH_TNodeXYZ( quadNodes[1] ), SMESH_TNodeXYZ( quadNodes[3] ),
4381 SMESH_TNodeXYZ( quadNodes[5] ), SMESH_TNodeXYZ( quadNodes[7] ));
4382 GetMeshDS()->MoveNode( quadNodes[8], p.X(), p.Y(), p.Z());
4386 // fix the volume central node
4387 vector<gp_XYZ> pointsOnShapes( SMESH_Block::ID_Shell );
4388 const SMDS_MeshNode** hexNodes = volExp.GetNodes();
4390 pointsOnShapes[ SMESH_Block::ID_V000 ] = SMESH_TNodeXYZ( hexNodes[ 0 ] );
4391 pointsOnShapes[ SMESH_Block::ID_V100 ] = SMESH_TNodeXYZ( hexNodes[ 3 ] );
4392 pointsOnShapes[ SMESH_Block::ID_V010 ] = SMESH_TNodeXYZ( hexNodes[ 1 ] );
4393 pointsOnShapes[ SMESH_Block::ID_V110 ] = SMESH_TNodeXYZ( hexNodes[ 2 ] );
4394 pointsOnShapes[ SMESH_Block::ID_V001 ] = SMESH_TNodeXYZ( hexNodes[ 4 ] );
4395 pointsOnShapes[ SMESH_Block::ID_V101 ] = SMESH_TNodeXYZ( hexNodes[ 7 ] );
4396 pointsOnShapes[ SMESH_Block::ID_V011 ] = SMESH_TNodeXYZ( hexNodes[ 5 ] );
4397 pointsOnShapes[ SMESH_Block::ID_V111 ] = SMESH_TNodeXYZ( hexNodes[ 6 ] );
4399 pointsOnShapes[ SMESH_Block::ID_Ex00 ] = SMESH_TNodeXYZ( hexNodes[ 11 ] );
4400 pointsOnShapes[ SMESH_Block::ID_Ex10 ] = SMESH_TNodeXYZ( hexNodes[ 9 ] );
4401 pointsOnShapes[ SMESH_Block::ID_E0y0 ] = SMESH_TNodeXYZ( hexNodes[ 8 ] );
4402 pointsOnShapes[ SMESH_Block::ID_E1y0 ] = SMESH_TNodeXYZ( hexNodes[ 10 ] );
4403 pointsOnShapes[ SMESH_Block::ID_Ex01 ] = SMESH_TNodeXYZ( hexNodes[ 15 ] );
4404 pointsOnShapes[ SMESH_Block::ID_Ex11 ] = SMESH_TNodeXYZ( hexNodes[ 13 ] );
4405 pointsOnShapes[ SMESH_Block::ID_E0y1 ] = SMESH_TNodeXYZ( hexNodes[ 12 ] );
4406 pointsOnShapes[ SMESH_Block::ID_E1y1 ] = SMESH_TNodeXYZ( hexNodes[ 14 ] );
4407 pointsOnShapes[ SMESH_Block::ID_E00z ] = SMESH_TNodeXYZ( hexNodes[ 16 ] );
4408 pointsOnShapes[ SMESH_Block::ID_E10z ] = SMESH_TNodeXYZ( hexNodes[ 19 ] );
4409 pointsOnShapes[ SMESH_Block::ID_E01z ] = SMESH_TNodeXYZ( hexNodes[ 17 ] );
4410 pointsOnShapes[ SMESH_Block::ID_E11z ] = SMESH_TNodeXYZ( hexNodes[ 18 ] );
4412 pointsOnShapes[ SMESH_Block::ID_Fxy0 ] = SMESH_TNodeXYZ( hexNodes[ 20 ] );
4413 pointsOnShapes[ SMESH_Block::ID_Fxy1 ] = SMESH_TNodeXYZ( hexNodes[ 25 ] );
4414 pointsOnShapes[ SMESH_Block::ID_Fx0z ] = SMESH_TNodeXYZ( hexNodes[ 21 ] );
4415 pointsOnShapes[ SMESH_Block::ID_Fx1z ] = SMESH_TNodeXYZ( hexNodes[ 23 ] );
4416 pointsOnShapes[ SMESH_Block::ID_F0yz ] = SMESH_TNodeXYZ( hexNodes[ 24 ] );
4417 pointsOnShapes[ SMESH_Block::ID_F1yz ] = SMESH_TNodeXYZ( hexNodes[ 22 ] );
4419 gp_XYZ nCenterParams(0.5, 0.5, 0.5), nCenterCoords;
4420 SMESH_Block::ShellPoint( nCenterParams, pointsOnShapes, nCenterCoords );
4421 GetMeshDS()->MoveNode( hexNodes[26],
4422 nCenterCoords.X(), nCenterCoords.Y(), nCenterCoords.Z());
4427 // Move the apex of pyramid together with the most curved link.
4428 // TIDSortedNodeSet::iterator apexIt = apexOfPyramid.begin();
4429 // for ( ; apexIt != apexOfPyramid.end(); ++apexIt )
4431 // SMESH_TNodeXYZ apex = *apexIt;
4433 // gp_Vec maxMove( 0,0,0 );
4434 // double maxMoveSize2 = 0;
4436 // // shift of node index to get medium nodes between the base nodes
4437 // const int base2MediumShift = 5;
4439 // // find maximal movement of medium node
4440 // SMDS_ElemIteratorPtr volIt = apex._node->GetInverseElementIterator( SMDSAbs_Volume );
4441 // vector< const SMDS_MeshElement* > pyramids;
4442 // while ( volIt->more() )
4444 // const SMDS_MeshElement* pyram = volIt->next();
4445 // if ( pyram->GetEntityType() != SMDSEntity_Quad_Pyramid ) continue;
4446 // pyramids.push_back( pyram );
4448 // for ( int iBase = 0; iBase < apexIndex; ++iBase )
4450 // SMESH_TNodeXYZ medium = pyram->GetNode( iBase + base2MediumShift );
4451 // if ( medium._node->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
4453 // SMESH_TNodeXYZ n1 = pyram->GetNode( iBase );
4454 // SMESH_TNodeXYZ n2 = pyram->GetNode( ( iBase+1 ) % 4 );
4455 // gp_Pnt middle = 0.5 * ( n1 + n2 );
4456 // gp_Vec move( middle, medium );
4457 // double moveSize2 = move.SquareMagnitude();
4458 // if ( moveSize2 > maxMoveSize2 )
4459 // maxMove = move, maxMoveSize2 = moveSize2;
4465 // if ( maxMoveSize2 > 1e-20 )
4467 // apex += maxMove.XYZ();
4468 // GetMeshDS()->MoveNode( apex._node, apex.X(), apex.Y(), apex.Z());
4470 // // move medium nodes neighboring the apex to the middle
4471 // const int base2MediumShift_2 = 9;
4472 // for ( unsigned i = 0; i < pyramids.size(); ++i )
4473 // for ( int iBase = 0; iBase < apexIndex; ++iBase )
4475 // SMESH_TNodeXYZ base = pyramids[i]->GetNode( iBase );
4476 // const SMDS_MeshNode* medium = pyramids[i]->GetNode( iBase + base2MediumShift_2 );
4477 // gp_XYZ middle = 0.5 * ( apex + base );
4478 // GetMeshDS()->MoveNode( medium, middle.X(), middle.Y(), middle.Z());