1 // Copyright (C) 2007-2011 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_FacePosition.hxx"
30 #include "SMDS_EdgePosition.hxx"
31 #include "SMDS_VolumeTool.hxx"
32 #include "SMESH_subMesh.hxx"
33 #include "SMESH_ProxyMesh.hxx"
35 #include <BRepAdaptor_Surface.hxx>
36 #include <BRepTools.hxx>
37 #include <BRepTools_WireExplorer.hxx>
38 #include <BRep_Tool.hxx>
39 #include <Geom2d_Curve.hxx>
40 #include <GeomAPI_ProjectPointOnCurve.hxx>
41 #include <GeomAPI_ProjectPointOnSurf.hxx>
42 #include <Geom_Curve.hxx>
43 #include <Geom_RectangularTrimmedSurface.hxx>
44 #include <Geom_Surface.hxx>
45 #include <ShapeAnalysis.hxx>
47 #include <TopExp_Explorer.hxx>
48 #include <TopTools_ListIteratorOfListOfShape.hxx>
49 #include <TopTools_MapIteratorOfMapOfShape.hxx>
50 #include <TopTools_MapOfShape.hxx>
53 #include <gp_Pnt2d.hxx>
54 #include <gp_Trsf.hxx>
56 #include <Standard_Failure.hxx>
57 #include <Standard_ErrorHandler.hxx>
59 #include <utilities.h>
65 #define RETURN_BAD_RESULT(msg) { MESSAGE(msg); return false; }
69 gp_XYZ XYZ(const SMDS_MeshNode* n) { return gp_XYZ(n->X(), n->Y(), n->Z()); }
71 enum { U_periodic = 1, V_periodic = 2 };
74 //================================================================================
78 //================================================================================
80 SMESH_MesherHelper::SMESH_MesherHelper(SMESH_Mesh& theMesh)
81 : myParIndex(0), myMesh(&theMesh), myShapeID(0), myCreateQuadratic(false)
83 myPar1[0] = myPar2[0] = myPar1[1] = myPar2[1] = 0;
84 mySetElemOnShape = ( ! myMesh->HasShapeToMesh() );
87 //=======================================================================
88 //function : ~SMESH_MesherHelper
90 //=======================================================================
92 SMESH_MesherHelper::~SMESH_MesherHelper()
95 TID2ProjectorOnSurf::iterator i_proj = myFace2Projector.begin();
96 for ( ; i_proj != myFace2Projector.end(); ++i_proj )
97 delete i_proj->second;
100 TID2ProjectorOnCurve::iterator i_proj = myEdge2Projector.begin();
101 for ( ; i_proj != myEdge2Projector.end(); ++i_proj )
102 delete i_proj->second;
106 //=======================================================================
107 //function : IsQuadraticSubMesh
108 //purpose : Check submesh for given shape: if all elements on this shape
109 // are quadratic, quadratic elements will be created.
110 // Also fill myTLinkNodeMap
111 //=======================================================================
113 bool SMESH_MesherHelper::IsQuadraticSubMesh(const TopoDS_Shape& aSh)
115 SMESHDS_Mesh* meshDS = GetMeshDS();
116 // we can create quadratic elements only if all elements
117 // created on subshapes of given shape are quadratic
118 // also we have to fill myTLinkNodeMap
119 myCreateQuadratic = true;
120 mySeamShapeIds.clear();
121 myDegenShapeIds.clear();
122 TopAbs_ShapeEnum subType( aSh.ShapeType()==TopAbs_FACE ? TopAbs_EDGE : TopAbs_FACE );
123 SMDSAbs_ElementType elemType( subType==TopAbs_FACE ? SMDSAbs_Face : SMDSAbs_Edge );
125 int nbOldLinks = myTLinkNodeMap.size();
127 if ( !myMesh->HasShapeToMesh() )
129 if (( myCreateQuadratic = myMesh->NbFaces( ORDER_QUADRATIC )))
131 SMDS_FaceIteratorPtr fIt = meshDS->facesIterator();
132 while ( fIt->more() )
133 AddTLinks( static_cast< const SMDS_MeshFace* >( fIt->next() ));
138 TopExp_Explorer exp( aSh, subType );
139 TopTools_MapOfShape checkedSubShapes;
140 for (; exp.More() && myCreateQuadratic; exp.Next()) {
141 if ( !checkedSubShapes.Add( exp.Current() ))
142 continue; // needed if aSh is compound of solids
143 if ( SMESHDS_SubMesh * subMesh = meshDS->MeshElements( exp.Current() )) {
144 if ( SMDS_ElemIteratorPtr it = subMesh->GetElements() ) {
146 const SMDS_MeshElement* e = it->next();
147 if ( e->GetType() != elemType || !e->IsQuadratic() ) {
148 myCreateQuadratic = false;
153 switch ( e->NbNodes() ) {
155 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(2)); break;
157 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(3));
158 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(4));
159 AddTLinkNode(e->GetNode(2),e->GetNode(0),e->GetNode(5)); break;
161 AddTLinkNode(e->GetNode(0),e->GetNode(1),e->GetNode(4));
162 AddTLinkNode(e->GetNode(1),e->GetNode(2),e->GetNode(5));
163 AddTLinkNode(e->GetNode(2),e->GetNode(3),e->GetNode(6));
164 AddTLinkNode(e->GetNode(3),e->GetNode(0),e->GetNode(7));
167 myCreateQuadratic = false;
177 if ( nbOldLinks == myTLinkNodeMap.size() )
178 myCreateQuadratic = false;
180 if(!myCreateQuadratic) {
181 myTLinkNodeMap.clear();
185 return myCreateQuadratic;
188 //=======================================================================
189 //function : SetSubShape
190 //purpose : Set geomerty to make elements on
191 //=======================================================================
193 void SMESH_MesherHelper::SetSubShape(const int aShID)
195 if ( aShID == myShapeID )
198 SetSubShape( GetMeshDS()->IndexToShape( aShID ));
200 SetSubShape( TopoDS_Shape() );
203 //=======================================================================
204 //function : SetSubShape
205 //purpose : Set geomerty to create elements on
206 //=======================================================================
208 void SMESH_MesherHelper::SetSubShape(const TopoDS_Shape& aSh)
210 if ( myShape.IsSame( aSh ))
214 mySeamShapeIds.clear();
215 myDegenShapeIds.clear();
217 if ( myShape.IsNull() ) {
221 SMESHDS_Mesh* meshDS = GetMeshDS();
222 myShapeID = meshDS->ShapeToIndex(aSh);
225 // treatment of periodic faces
226 for ( TopExp_Explorer eF( aSh, TopAbs_FACE ); eF.More(); eF.Next() )
228 const TopoDS_Face& face = TopoDS::Face( eF.Current() );
230 Handle(Geom_Surface) surface = BRep_Tool::Surface( face, loc );
232 if ( surface->IsUPeriodic() || surface->IsVPeriodic() ||
233 surface->IsUClosed() || surface->IsVClosed() )
235 //while ( surface->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
236 //surface = Handle(Geom_RectangularTrimmedSurface)::DownCast( surface )->BasisSurface();
237 GeomAdaptor_Surface surf( surface );
239 for (TopExp_Explorer exp( face, TopAbs_EDGE ); exp.More(); exp.Next())
241 // look for a seam edge
242 const TopoDS_Edge& edge = TopoDS::Edge( exp.Current() );
243 if ( BRep_Tool::IsClosed( edge, face )) {
244 // initialize myPar1, myPar2 and myParIndex
246 BRep_Tool::UVPoints( edge, face, uv1, uv2 );
247 if ( Abs( uv1.Coord(1) - uv2.Coord(1) ) < Abs( uv1.Coord(2) - uv2.Coord(2) ))
249 myParIndex |= U_periodic;
250 myPar1[0] = surf.FirstUParameter();
251 myPar2[0] = surf.LastUParameter();
254 myParIndex |= V_periodic;
255 myPar1[1] = surf.FirstVParameter();
256 myPar2[1] = surf.LastVParameter();
258 // store seam shape indices, negative if shape encounters twice
259 int edgeID = meshDS->ShapeToIndex( edge );
260 mySeamShapeIds.insert( IsSeamShape( edgeID ) ? -edgeID : edgeID );
261 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() ) {
262 int vertexID = meshDS->ShapeToIndex( v.Current() );
263 mySeamShapeIds.insert( IsSeamShape( vertexID ) ? -vertexID : vertexID );
267 // look for a degenerated edge
268 if ( BRep_Tool::Degenerated( edge )) {
269 myDegenShapeIds.insert( meshDS->ShapeToIndex( edge ));
270 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next() )
271 myDegenShapeIds.insert( meshDS->ShapeToIndex( v.Current() ));
278 //=======================================================================
279 //function : GetNodeUVneedInFaceNode
280 //purpose : Check if inFaceNode argument is necessary for call GetNodeUV(F,..)
281 // Return true if the face is periodic.
282 // If F is Null, answer about subshape set through IsQuadraticSubMesh() or
284 //=======================================================================
286 bool SMESH_MesherHelper::GetNodeUVneedInFaceNode(const TopoDS_Face& F) const
288 if ( F.IsNull() ) return !mySeamShapeIds.empty();
290 if ( !F.IsNull() && !myShape.IsNull() && myShape.IsSame( F ))
291 return !mySeamShapeIds.empty();
294 Handle(Geom_Surface) aSurface = BRep_Tool::Surface( F,loc );
295 if ( !aSurface.IsNull() )
296 return ( aSurface->IsUPeriodic() || aSurface->IsVPeriodic() );
301 //=======================================================================
302 //function : IsMedium
304 //=======================================================================
306 bool SMESH_MesherHelper::IsMedium(const SMDS_MeshNode* node,
307 const SMDSAbs_ElementType typeToCheck)
309 return SMESH_MeshEditor::IsMedium( node, typeToCheck );
312 //=======================================================================
313 //function : GetSubShapeByNode
314 //purpose : Return support shape of a node
315 //=======================================================================
317 TopoDS_Shape SMESH_MesherHelper::GetSubShapeByNode(const SMDS_MeshNode* node,
318 const SMESHDS_Mesh* meshDS)
320 int shapeID = node->getshapeId();
321 if ( 0 < shapeID && shapeID <= meshDS->MaxShapeIndex() )
322 return meshDS->IndexToShape( shapeID );
324 return TopoDS_Shape();
328 //=======================================================================
329 //function : AddTLinkNode
330 //purpose : add a link in my data structure
331 //=======================================================================
333 void SMESH_MesherHelper::AddTLinkNode(const SMDS_MeshNode* n1,
334 const SMDS_MeshNode* n2,
335 const SMDS_MeshNode* n12)
337 // add new record to map
338 SMESH_TLink link( n1, n2 );
339 myTLinkNodeMap.insert( make_pair(link,n12));
342 //================================================================================
344 * \brief Add quadratic links of edge to own data structure
346 //================================================================================
348 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshEdge* edge)
350 if ( edge->IsQuadratic() )
351 AddTLinkNode(edge->GetNode(0), edge->GetNode(1), edge->GetNode(2));
354 //================================================================================
356 * \brief Add quadratic links of face to own data structure
358 //================================================================================
360 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshFace* f)
363 switch ( f->NbNodes() ) {
365 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(3));
366 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(4));
367 AddTLinkNode(f->GetNode(2),f->GetNode(0),f->GetNode(5)); break;
369 AddTLinkNode(f->GetNode(0),f->GetNode(1),f->GetNode(4));
370 AddTLinkNode(f->GetNode(1),f->GetNode(2),f->GetNode(5));
371 AddTLinkNode(f->GetNode(2),f->GetNode(3),f->GetNode(6));
372 AddTLinkNode(f->GetNode(3),f->GetNode(0),f->GetNode(7));
377 //================================================================================
379 * \brief Add quadratic links of volume to own data structure
381 //================================================================================
383 void SMESH_MesherHelper::AddTLinks(const SMDS_MeshVolume* volume)
385 if ( volume->IsQuadratic() )
387 SMDS_VolumeTool vTool( volume );
388 const SMDS_MeshNode** nodes = vTool.GetNodes();
390 for ( int iF = 1; iF < vTool.NbFaces(); ++iF )
392 const int nbN = vTool.NbFaceNodes( iF );
393 const int* iNodes = vTool.GetFaceNodesIndices( iF );
394 for ( int i = 0; i < nbN; )
396 int iN1 = iNodes[i++];
397 int iN12 = iNodes[i++];
398 int iN2 = iNodes[i++];
399 if ( iN1 > iN2 ) std::swap( iN1, iN2 );
400 int linkID = iN1 * vTool.NbNodes() + iN2;
401 pair< set<int>::iterator, bool > it_isNew = addedLinks.insert( linkID );
402 if ( it_isNew.second )
403 AddTLinkNode( nodes[iN1], nodes[iN2], nodes[iN12] );
405 addedLinks.erase( it_isNew.first ); // each link encounters only twice
411 //================================================================================
413 * \brief Return true if position of nodes on the shape hasn't yet been checked or
414 * the positions proved to be invalid
416 //================================================================================
418 bool SMESH_MesherHelper::toCheckPosOnShape(int shapeID ) const
420 map< int,bool >::const_iterator id_ok = myNodePosShapesValidity.find( shapeID );
421 return ( id_ok == myNodePosShapesValidity.end() || !id_ok->second );
424 //================================================================================
426 * \brief Set validity of positions of nodes on the shape.
427 * Once set, validity is not changed
429 //================================================================================
431 void SMESH_MesherHelper::setPosOnShapeValidity(int shapeID, bool ok ) const
433 ((SMESH_MesherHelper*)this)->myNodePosShapesValidity.insert( make_pair( shapeID, ok));
436 //=======================================================================
437 //function : GetUVOnSeam
438 //purpose : Select UV on either of 2 pcurves of a seam edge, closest to the given UV
439 //=======================================================================
441 gp_Pnt2d SMESH_MesherHelper::GetUVOnSeam( const gp_Pnt2d& uv1, const gp_Pnt2d& uv2 ) const
443 gp_Pnt2d result = uv1;
444 for ( int i = U_periodic; i <= V_periodic ; ++i )
446 if ( myParIndex & i )
448 double p1 = uv1.Coord( i );
449 double dp1 = Abs( p1-myPar1[i-1]), dp2 = Abs( p1-myPar2[i-1]);
450 if ( myParIndex == i ||
451 dp1 < ( myPar2[i-1] - myPar2[i-1] ) / 100. ||
452 dp2 < ( myPar2[i-1] - myPar2[i-1] ) / 100. )
454 double p2 = uv2.Coord( i );
455 double p1Alt = ( dp1 < dp2 ) ? myPar2[i-1] : myPar1[i-1];
456 if ( Abs( p2 - p1 ) > Abs( p2 - p1Alt ))
457 result.SetCoord( i, p1Alt );
464 //=======================================================================
465 //function : GetNodeUV
466 //purpose : Return node UV on face
467 //=======================================================================
469 gp_XY SMESH_MesherHelper::GetNodeUV(const TopoDS_Face& F,
470 const SMDS_MeshNode* n,
471 const SMDS_MeshNode* n2,
474 gp_Pnt2d uv( Precision::Infinite(), Precision::Infinite() );
475 const SMDS_PositionPtr Pos = n->GetPosition();
477 if(Pos->GetTypeOfPosition()==SMDS_TOP_FACE)
479 // node has position on face
480 const SMDS_FacePosition* fpos =
481 static_cast<const SMDS_FacePosition*>(n->GetPosition());
482 uv.SetCoord(fpos->GetUParameter(),fpos->GetVParameter());
484 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
486 else if(Pos->GetTypeOfPosition()==SMDS_TOP_EDGE)
488 // node has position on edge => it is needed to find
489 // corresponding edge from face, get pcurve for this
490 // edge and retrieve value from this pcurve
491 const SMDS_EdgePosition* epos =
492 static_cast<const SMDS_EdgePosition*>(n->GetPosition());
493 int edgeID = n->getshapeId();
494 TopoDS_Edge E = TopoDS::Edge(GetMeshDS()->IndexToShape(edgeID));
495 double f, l, u = epos->GetUParameter();
496 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(E, F, f, l);
497 bool validU = ( f < u && u < l );
499 uv = C2d->Value( u );
501 uv.SetCoord( Precision::Infinite(),0.);
502 if ( check || !validU )
503 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ),/*force=*/ !validU );
505 // for a node on a seam edge select one of UVs on 2 pcurves
506 if ( n2 && IsSeamShape( edgeID ) )
508 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0, check ));
511 { // adjust uv to period
513 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
514 Standard_Boolean isUPeriodic = S->IsUPeriodic();
515 Standard_Boolean isVPeriodic = S->IsVPeriodic();
516 if ( isUPeriodic || isVPeriodic ) {
517 Standard_Real UF,UL,VF,VL;
518 S->Bounds(UF,UL,VF,VL);
520 uv.SetX( uv.X() + ShapeAnalysis::AdjustToPeriod(uv.X(),UF,UL));
522 uv.SetY( uv.Y() + ShapeAnalysis::AdjustToPeriod(uv.Y(),VF,VL));
526 else if(Pos->GetTypeOfPosition()==SMDS_TOP_VERTEX)
528 if ( int vertexID = n->getshapeId() ) {
529 const TopoDS_Vertex& V = TopoDS::Vertex(GetMeshDS()->IndexToShape(vertexID));
531 uv = BRep_Tool::Parameters( V, F );
534 catch (Standard_Failure& exc) {
537 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() )
538 uvOK = ( V == vert.Current() );
541 MESSAGE ( "SMESH_MesherHelper::GetNodeUV(); Vertex " << vertexID
542 << " not in face " << GetMeshDS()->ShapeToIndex( F ) );
544 // get UV of a vertex closest to the node
546 gp_Pnt pn = XYZ( n );
547 for ( TopExp_Explorer vert(F,TopAbs_VERTEX); !uvOK && vert.More(); vert.Next() ) {
548 TopoDS_Vertex curV = TopoDS::Vertex( vert.Current() );
549 gp_Pnt p = BRep_Tool::Pnt( curV );
550 double curDist = p.SquareDistance( pn );
551 if ( curDist < dist ) {
553 uv = BRep_Tool::Parameters( curV, F );
554 uvOK = ( dist < DBL_MIN );
560 TopTools_ListIteratorOfListOfShape it( myMesh->GetAncestors( V ));
561 for ( ; it.More(); it.Next() ) {
562 if ( it.Value().ShapeType() == TopAbs_EDGE ) {
563 const TopoDS_Edge & edge = TopoDS::Edge( it.Value() );
565 Handle(Geom2d_Curve) C2d = BRep_Tool::CurveOnSurface(edge, F, f, l);
566 if ( !C2d.IsNull() ) {
567 double u = ( V == TopExp::FirstVertex( edge ) ) ? f : l;
568 uv = C2d->Value( u );
576 if ( n2 && IsSeamShape( vertexID ) )
577 uv = GetUVOnSeam( uv, GetNodeUV( F, n2, 0 ));
582 uvOK = CheckNodeUV( F, n, uv.ChangeCoord(), 10*MaxTolerance( F ));
591 //=======================================================================
592 //function : CheckNodeUV
593 //purpose : Check and fix node UV on a face
594 //=======================================================================
596 bool SMESH_MesherHelper::CheckNodeUV(const TopoDS_Face& F,
597 const SMDS_MeshNode* n,
601 double distXYZ[4]) const
603 int shapeID = n->getshapeId();
604 bool infinit = ( Precision::IsInfinite( uv.X() ) || Precision::IsInfinite( uv.Y() ));
605 if ( force || toCheckPosOnShape( shapeID ) || infinit )
607 // check that uv is correct
609 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
610 gp_Pnt nodePnt = XYZ( n ), surfPnt(0,0,0);
612 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
614 (dist = nodePnt.Distance( surfPnt = surface->Value( uv.X(), uv.Y() ))) > tol )
616 setPosOnShapeValidity( shapeID, false );
617 if ( !infinit && distXYZ ) {
618 surfPnt.Transform( loc );
620 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
622 // uv incorrect, project the node to surface
623 GeomAPI_ProjectPointOnSurf& projector = GetProjector( F, loc, tol );
624 projector.Perform( nodePnt );
625 if ( !projector.IsDone() || projector.NbPoints() < 1 )
627 MESSAGE( "SMESH_MesherHelper::CheckNodeUV() failed to project" );
630 Quantity_Parameter U,V;
631 projector.LowerDistanceParameters(U,V);
633 surfPnt = surface->Value( U, V );
634 dist = nodePnt.Distance( surfPnt );
636 surfPnt.Transform( loc );
638 distXYZ[1] = surfPnt.X(); distXYZ[2] = surfPnt.Y(); distXYZ[3]=surfPnt.Z();
642 MESSAGE( "SMESH_MesherHelper::CheckNodeUV(), invalid projection" );
645 // store the fixed UV on the face
646 if ( myShape.IsSame(F) && shapeID == myShapeID )
647 const_cast<SMDS_MeshNode*>(n)->SetPosition
648 ( SMDS_PositionPtr( new SMDS_FacePosition( U, V )));
650 else if ( uv.Modulus() > numeric_limits<double>::min() )
652 setPosOnShapeValidity( shapeID, true );
658 //=======================================================================
659 //function : GetProjector
660 //purpose : Return projector intitialized by given face without location, which is returned
661 //=======================================================================
663 GeomAPI_ProjectPointOnSurf& SMESH_MesherHelper::GetProjector(const TopoDS_Face& F,
664 TopLoc_Location& loc,
667 Handle(Geom_Surface) surface = BRep_Tool::Surface( F,loc );
668 int faceID = GetMeshDS()->ShapeToIndex( F );
669 TID2ProjectorOnSurf& i2proj = const_cast< TID2ProjectorOnSurf&>( myFace2Projector );
670 TID2ProjectorOnSurf::iterator i_proj = i2proj.find( faceID );
671 if ( i_proj == i2proj.end() )
673 if ( tol == 0 ) tol = BRep_Tool::Tolerance( F );
674 double U1, U2, V1, V2;
675 surface->Bounds(U1, U2, V1, V2);
676 GeomAPI_ProjectPointOnSurf* proj = new GeomAPI_ProjectPointOnSurf();
677 proj->Init( surface, U1, U2, V1, V2, tol );
678 i_proj = i2proj.insert( make_pair( faceID, proj )).first;
680 return *( i_proj->second );
685 gp_XY AverageUV(const gp_XY& uv1, const gp_XY& uv2) { return ( uv1 + uv2 ) / 2.; }
686 gp_XY_FunPtr(Added); // define gp_XY_Added pointer to function calling gp_XY::Added(gp_XY)
687 gp_XY_FunPtr(Subtracted);
690 //=======================================================================
691 //function : applyIn2D
692 //purpose : Perform given operation on two 2d points in parameric space of given surface.
693 // It takes into account period of the surface. Use gp_XY_FunPtr macro
694 // to easily define pointer to function of gp_XY class.
695 //=======================================================================
697 gp_XY SMESH_MesherHelper::applyIn2D(const Handle(Geom_Surface)& surface,
701 const bool resultInPeriod)
703 Standard_Boolean isUPeriodic = surface.IsNull() ? false : surface->IsUPeriodic();
704 Standard_Boolean isVPeriodic = surface.IsNull() ? false : surface->IsVPeriodic();
705 if ( !isUPeriodic && !isVPeriodic )
708 // move uv2 not far than half-period from uv1
710 uv2.X()+(isUPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.X(),uv1.X(),surface->UPeriod()) :0);
712 uv2.Y()+(isVPeriodic ? ShapeAnalysis::AdjustByPeriod(uv2.Y(),uv1.Y(),surface->VPeriod()) :0);
715 gp_XY res = fun( uv1, gp_XY(u2,v2) );
717 // move result within period
718 if ( resultInPeriod )
720 Standard_Real UF,UL,VF,VL;
721 surface->Bounds(UF,UL,VF,VL);
723 res.SetX( res.X() + ShapeAnalysis::AdjustToPeriod(res.X(),UF,UL));
725 res.SetY( res.Y() + ShapeAnalysis::AdjustToPeriod(res.Y(),VF,VL));
730 //=======================================================================
731 //function : GetMiddleUV
732 //purpose : Return middle UV taking in account surface period
733 //=======================================================================
735 gp_XY SMESH_MesherHelper::GetMiddleUV(const Handle(Geom_Surface)& surface,
740 // the proper place of getting basic surface seems to be in applyIn2D()
741 // but we put it here to decrease a risk of regressions just before releasing a version
742 Handle(Geom_Surface) surf = surface;
743 while ( !surf.IsNull() && surf->IsKind(STANDARD_TYPE(Geom_RectangularTrimmedSurface )))
744 surf = Handle(Geom_RectangularTrimmedSurface)::DownCast( surf )->BasisSurface();
746 return applyIn2D( surf, p1, p2, & AverageUV );
749 //=======================================================================
750 //function : GetNodeU
751 //purpose : Return node U on edge
752 //=======================================================================
754 double SMESH_MesherHelper::GetNodeU(const TopoDS_Edge& E,
755 const SMDS_MeshNode* n,
756 const SMDS_MeshNode* inEdgeNode,
760 const SMDS_PositionPtr pos = n->GetPosition();
761 if ( pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
763 const SMDS_EdgePosition* epos = static_cast<const SMDS_EdgePosition*>( pos );
764 param = epos->GetUParameter();
766 else if( pos->GetTypeOfPosition() == SMDS_TOP_VERTEX )
768 if ( inEdgeNode && TopExp::FirstVertex( E ).IsSame( TopExp::LastVertex( E ))) // issue 0020128
771 BRep_Tool::Range( E, f,l );
772 double uInEdge = GetNodeU( E, inEdgeNode );
773 param = ( fabs( uInEdge - f ) < fabs( l - uInEdge )) ? f : l;
777 SMESHDS_Mesh * meshDS = GetMeshDS();
778 int vertexID = n->getshapeId();
779 const TopoDS_Vertex& V = TopoDS::Vertex(meshDS->IndexToShape(vertexID));
780 param = BRep_Tool::Parameter( V, E );
785 double tol = BRep_Tool::Tolerance( E );
786 double f,l; BRep_Tool::Range( E, f,l );
787 bool force = ( param < f-tol || param > l+tol );
788 if ( !force && pos->GetTypeOfPosition()==SMDS_TOP_EDGE )
789 force = ( GetMeshDS()->ShapeToIndex( E ) != n->getshapeId() );
791 *check = CheckNodeU( E, n, param, 2*tol, force );
796 //=======================================================================
797 //function : CheckNodeU
798 //purpose : Check and fix node U on an edge
799 // Return false if U is bad and could not be fixed
800 //=======================================================================
802 bool SMESH_MesherHelper::CheckNodeU(const TopoDS_Edge& E,
803 const SMDS_MeshNode* n,
807 double distXYZ[4]) const
809 int shapeID = n->getshapeId();
810 if ( force || toCheckPosOnShape( shapeID ))
812 TopLoc_Location loc; double f,l;
813 Handle(Geom_Curve) curve = BRep_Tool::Curve( E,loc,f,l );
814 if ( curve.IsNull() ) // degenerated edge
816 if ( u+tol < f || u-tol > l )
818 double r = Max( 0.5, 1 - tol*n->GetID()); // to get a unique u on edge
824 gp_Pnt nodePnt = SMESH_TNodeXYZ( n );
825 if ( !loc.IsIdentity() ) nodePnt.Transform( loc.Transformation().Inverted() );
826 gp_Pnt curvPnt = curve->Value( u );
827 double dist = nodePnt.Distance( curvPnt );
829 curvPnt.Transform( loc );
831 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
835 setPosOnShapeValidity( shapeID, false );
836 // u incorrect, project the node to the curve
837 int edgeID = GetMeshDS()->ShapeToIndex( E );
838 TID2ProjectorOnCurve& i2proj = const_cast< TID2ProjectorOnCurve&>( myEdge2Projector );
839 TID2ProjectorOnCurve::iterator i_proj =
840 i2proj.insert( make_pair( edgeID, (GeomAPI_ProjectPointOnCurve*) 0 )).first;
841 if ( !i_proj->second )
843 i_proj->second = new GeomAPI_ProjectPointOnCurve();
844 i_proj->second->Init( curve, f, l );
846 GeomAPI_ProjectPointOnCurve* projector = i_proj->second;
847 projector->Perform( nodePnt );
848 if ( projector->NbPoints() < 1 )
850 MESSAGE( "SMESH_MesherHelper::CheckNodeU() failed to project" );
853 Quantity_Parameter U = projector->LowerDistanceParameter();
855 curvPnt = curve->Value( u );
856 dist = nodePnt.Distance( curvPnt );
858 curvPnt.Transform( loc );
860 distXYZ[1] = curvPnt.X(); distXYZ[2] = curvPnt.Y(); distXYZ[3]=curvPnt.Z();
864 MESSAGE( "SMESH_MesherHelper::CheckNodeU(), invalid projection" );
865 MESSAGE("distance " << dist << " " << tol );
868 // store the fixed U on the edge
869 if ( myShape.IsSame(E) && shapeID == myShapeID )
870 const_cast<SMDS_MeshNode*>(n)->SetPosition
871 ( SMDS_PositionPtr( new SMDS_EdgePosition( U )));
873 else if ( fabs( u ) > numeric_limits<double>::min() )
875 setPosOnShapeValidity( shapeID, true );
877 if (( u < f-tol || u > l+tol ) && force )
879 // node is on vertex but is set on periodic but trimmed edge (issue 0020890)
882 // do not use IsPeriodic() as Geom_TrimmedCurve::IsPeriodic () returns false
883 double period = curve->Period();
884 u = ( u < f ) ? u + period : u - period;
886 catch (Standard_Failure& exc)
896 //=======================================================================
897 //function : GetMediumNode
898 //purpose : Return existing or create new medium nodes between given ones
899 //=======================================================================
901 const SMDS_MeshNode* SMESH_MesherHelper::GetMediumNode(const SMDS_MeshNode* n1,
902 const SMDS_MeshNode* n2,
905 // Find existing node
907 SMESH_TLink link(n1,n2);
908 ItTLinkNode itLN = myTLinkNodeMap.find( link );
909 if ( itLN != myTLinkNodeMap.end() ) {
910 return (*itLN).second;
913 // Create medium node
916 SMESHDS_Mesh* meshDS = GetMeshDS();
918 if ( IsSeamShape( n1->getshapeId() ))
919 // to get a correct UV of a node on seam, the second node must have checked UV
922 // get type of shape for the new medium node
923 int faceID = -1, edgeID = -1;
924 const SMDS_PositionPtr Pos1 = n1->GetPosition();
925 const SMDS_PositionPtr Pos2 = n2->GetPosition();
927 TopoDS_Edge E; double u [2];
928 TopoDS_Face F; gp_XY uv[2];
929 bool uvOK[2] = { false, false };
931 if( myShape.IsNull() )
933 if( Pos1->GetTypeOfPosition()==SMDS_TOP_FACE ) {
934 faceID = n1->getshapeId();
936 else if( Pos2->GetTypeOfPosition()==SMDS_TOP_FACE ) {
937 faceID = n2->getshapeId();
940 if( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE ) {
941 edgeID = n1->getshapeId();
943 if( Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE ) {
944 edgeID = n2->getshapeId();
947 // get positions of the given nodes on shapes
948 TopAbs_ShapeEnum shapeType = myShape.IsNull() ? TopAbs_SHAPE : myShape.ShapeType();
949 if ( faceID>0 || shapeType == TopAbs_FACE)
951 if( myShape.IsNull() )
952 F = TopoDS::Face(meshDS->IndexToShape(faceID));
954 F = TopoDS::Face(myShape);
957 uv[0] = GetNodeUV(F,n1,n2, force3d ? 0 : &uvOK[0]);
958 uv[1] = GetNodeUV(F,n2,n1, force3d ? 0 : &uvOK[1]);
960 else if (edgeID>0 || shapeType == TopAbs_EDGE)
962 if ( Pos1->GetTypeOfPosition()==SMDS_TOP_EDGE &&
963 Pos2->GetTypeOfPosition()==SMDS_TOP_EDGE &&
964 n1->getshapeId() != n2->getshapeId() ) // issue 0021006
965 return getMediumNodeOnComposedWire(n1,n2,force3d);
967 if( myShape.IsNull() )
968 E = TopoDS::Edge(meshDS->IndexToShape(edgeID));
970 E = TopoDS::Edge(myShape);
973 u[0] = GetNodeU(E,n1,n2, force3d ? 0 : &uvOK[0]);
974 u[1] = GetNodeU(E,n2,n1, force3d ? 0 : &uvOK[1]);
978 // we try to create medium node using UV parameters of
979 // nodes, else - medium between corresponding 3d points
982 if ( uvOK[0] && uvOK[1] )
984 if ( IsDegenShape( n1->getshapeId() )) {
985 if ( myParIndex & U_periodic ) uv[0].SetCoord( 1, uv[1].Coord( 1 ));
986 else uv[0].SetCoord( 2, uv[1].Coord( 2 ));
988 else if ( IsDegenShape( n2->getshapeId() )) {
989 if ( myParIndex & U_periodic ) uv[1].SetCoord( 1, uv[0].Coord( 1 ));
990 else uv[1].SetCoord( 2, uv[0].Coord( 2 ));
994 Handle(Geom_Surface) S = BRep_Tool::Surface(F,loc);
995 gp_XY UV = GetMiddleUV( S, uv[0], uv[1] );
996 gp_Pnt P = S->Value( UV.X(), UV.Y() ).Transformed(loc);
997 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
998 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y());
999 myTLinkNodeMap.insert(make_pair(link,n12));
1003 else if ( !E.IsNull() )
1006 Handle(Geom_Curve) C = BRep_Tool::Curve(E, f, l);
1009 Standard_Boolean isPeriodic = C->IsPeriodic();
1012 Standard_Real Period = C->Period();
1013 Standard_Real p = u[1]+ShapeAnalysis::AdjustByPeriod(u[1],u[0],Period);
1014 Standard_Real pmid = (u[0]+p)/2.;
1015 U = pmid+ShapeAnalysis::AdjustToPeriod(pmid,C->FirstParameter(),C->LastParameter());
1020 gp_Pnt P = C->Value( U );
1021 n12 = meshDS->AddNode(P.X(), P.Y(), P.Z());
1022 meshDS->SetNodeOnEdge(n12, edgeID, U);
1023 myTLinkNodeMap.insert(make_pair(link,n12));
1030 double x = ( n1->X() + n2->X() )/2.;
1031 double y = ( n1->Y() + n2->Y() )/2.;
1032 double z = ( n1->Z() + n2->Z() )/2.;
1033 n12 = meshDS->AddNode(x,y,z);
1037 gp_XY UV = ( uv[0] + uv[1] ) / 2.;
1038 CheckNodeUV( F, n12, UV, 2*BRep_Tool::Tolerance( F ), /*force=*/true);
1039 meshDS->SetNodeOnFace(n12, faceID, UV.X(), UV.Y() );
1041 else if ( !E.IsNull() )
1043 double U = ( u[0] + u[1] ) / 2.;
1044 CheckNodeU( E, n12, U, 2*BRep_Tool::Tolerance( E ), /*force=*/true);
1045 meshDS->SetNodeOnEdge(n12, edgeID, U);
1047 else if ( myShapeID > 0 )
1049 meshDS->SetNodeInVolume(n12, myShapeID);
1052 myTLinkNodeMap.insert( make_pair( link, n12 ));
1056 //================================================================================
1058 * \brief Makes a medium node if nodes reside different edges
1060 //================================================================================
1062 const SMDS_MeshNode* SMESH_MesherHelper::getMediumNodeOnComposedWire(const SMDS_MeshNode* n1,
1063 const SMDS_MeshNode* n2,
1066 gp_Pnt middle = 0.5 * XYZ(n1) + 0.5 * XYZ(n2);
1067 SMDS_MeshNode* n12 = AddNode( middle.X(), middle.Y(), middle.Z() );
1069 // To find position on edge and 3D position for n12,
1070 // project <middle> to 2 edges and select projection most close to <middle>
1072 double u = 0, distMiddleProj = Precision::Infinite(), distXYZ[4];
1074 TopoDS_Edge edges[2];
1075 for ( int is2nd = 0; is2nd < 2; ++is2nd )
1078 const SMDS_MeshNode* n = is2nd ? n2 : n1;
1079 TopoDS_Shape shape = GetSubShapeByNode( n, GetMeshDS() );
1080 if ( shape.IsNull() || shape.ShapeType() != TopAbs_EDGE )
1083 // project to get U of projection and distance from middle to projection
1084 TopoDS_Edge edge = edges[ is2nd ] = TopoDS::Edge( shape );
1085 double node2MiddleDist = middle.Distance( XYZ(n) );
1086 double foundU = GetNodeU( edge, n );
1087 CheckNodeU( edge, n12, foundU, 2*BRep_Tool::Tolerance(edge), /*force=*/true, distXYZ );
1088 if ( distXYZ[0] < node2MiddleDist )
1090 distMiddleProj = distXYZ[0];
1095 if ( Precision::IsInfinite( distMiddleProj ))
1097 // both projections failed; set n12 on the edge of n1 with U of a common vertex
1098 TopoDS_Vertex vCommon;
1099 if ( TopExp::CommonVertex( edges[0], edges[1], vCommon ))
1100 u = BRep_Tool::Parameter( vCommon, edges[0] );
1103 double f,l, u0 = GetNodeU( edges[0], n1 );
1104 BRep_Tool::Range( edges[0],f,l );
1105 u = ( fabs(u0-f) < fabs(u0-l) ) ? f : l;
1111 // move n12 to position of a successfull projection
1112 double tol = BRep_Tool::Tolerance(edges[ iOkEdge ]);
1113 if ( !force3d && distMiddleProj > 2*tol )
1115 TopLoc_Location loc; double f,l;
1116 Handle(Geom_Curve) curve = BRep_Tool::Curve( edges[iOkEdge],loc,f,l );
1117 gp_Pnt p = curve->Value( u );
1118 GetMeshDS()->MoveNode( n12, p.X(), p.Y(), p.Z() );
1121 GetMeshDS()->SetNodeOnEdge(n12, edges[iOkEdge], u);
1123 myTLinkNodeMap.insert( make_pair( SMESH_TLink(n1,n2), n12 ));
1128 //=======================================================================
1129 //function : AddNode
1130 //purpose : Creates a node
1131 //=======================================================================
1133 SMDS_MeshNode* SMESH_MesherHelper::AddNode(double x, double y, double z, int ID)
1135 SMESHDS_Mesh * meshDS = GetMeshDS();
1136 SMDS_MeshNode* node = 0;
1138 node = meshDS->AddNodeWithID( x, y, z, ID );
1140 node = meshDS->AddNode( x, y, z );
1141 if ( mySetElemOnShape && myShapeID > 0 ) {
1142 switch ( myShape.ShapeType() ) {
1143 case TopAbs_SOLID: meshDS->SetNodeInVolume( node, myShapeID); break;
1144 case TopAbs_SHELL: meshDS->SetNodeInVolume( node, myShapeID); break;
1145 case TopAbs_FACE: meshDS->SetNodeOnFace( node, myShapeID); break;
1146 case TopAbs_EDGE: meshDS->SetNodeOnEdge( node, myShapeID); break;
1147 case TopAbs_VERTEX: meshDS->SetNodeOnVertex( node, myShapeID); break;
1154 //=======================================================================
1155 //function : AddEdge
1156 //purpose : Creates quadratic or linear edge
1157 //=======================================================================
1159 SMDS_MeshEdge* SMESH_MesherHelper::AddEdge(const SMDS_MeshNode* n1,
1160 const SMDS_MeshNode* n2,
1164 SMESHDS_Mesh * meshDS = GetMeshDS();
1166 SMDS_MeshEdge* edge = 0;
1167 if (myCreateQuadratic) {
1168 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1170 edge = meshDS->AddEdgeWithID(n1, n2, n12, id);
1172 edge = meshDS->AddEdge(n1, n2, n12);
1176 edge = meshDS->AddEdgeWithID(n1, n2, id);
1178 edge = meshDS->AddEdge(n1, n2);
1181 if ( mySetElemOnShape && myShapeID > 0 )
1182 meshDS->SetMeshElementOnShape( edge, myShapeID );
1187 //=======================================================================
1188 //function : AddFace
1189 //purpose : Creates quadratic or linear triangle
1190 //=======================================================================
1192 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1193 const SMDS_MeshNode* n2,
1194 const SMDS_MeshNode* n3,
1198 SMESHDS_Mesh * meshDS = GetMeshDS();
1199 SMDS_MeshFace* elem = 0;
1201 if( n1==n2 || n2==n3 || n3==n1 )
1204 if(!myCreateQuadratic) {
1206 elem = meshDS->AddFaceWithID(n1, n2, n3, id);
1208 elem = meshDS->AddFace(n1, n2, n3);
1211 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1212 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1213 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1216 elem = meshDS->AddFaceWithID(n1, n2, n3, n12, n23, n31, id);
1218 elem = meshDS->AddFace(n1, n2, n3, n12, n23, n31);
1220 if ( mySetElemOnShape && myShapeID > 0 )
1221 meshDS->SetMeshElementOnShape( elem, myShapeID );
1226 //=======================================================================
1227 //function : AddFace
1228 //purpose : Creates quadratic or linear quadrangle
1229 //=======================================================================
1231 SMDS_MeshFace* SMESH_MesherHelper::AddFace(const SMDS_MeshNode* n1,
1232 const SMDS_MeshNode* n2,
1233 const SMDS_MeshNode* n3,
1234 const SMDS_MeshNode* n4,
1238 SMESHDS_Mesh * meshDS = GetMeshDS();
1239 SMDS_MeshFace* elem = 0;
1242 return AddFace(n1,n3,n4,id,force3d);
1245 return AddFace(n1,n2,n4,id,force3d);
1248 return AddFace(n1,n2,n3,id,force3d);
1251 return AddFace(n1,n2,n4,id,force3d);
1254 return AddFace(n1,n2,n3,id,force3d);
1257 return AddFace(n1,n2,n3,id,force3d);
1260 if(!myCreateQuadratic) {
1262 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, id);
1264 elem = meshDS->AddFace(n1, n2, n3, n4);
1267 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1268 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1269 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1270 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1273 elem = meshDS->AddFaceWithID(n1, n2, n3, n4, n12, n23, n34, n41, id);
1275 elem = meshDS->AddFace(n1, n2, n3, n4, n12, n23, n34, n41);
1277 if ( mySetElemOnShape && myShapeID > 0 )
1278 meshDS->SetMeshElementOnShape( elem, myShapeID );
1283 //=======================================================================
1284 //function : AddPolygonalFace
1285 //purpose : Creates polygon, with additional nodes in quadratic mesh
1286 //=======================================================================
1288 SMDS_MeshFace* SMESH_MesherHelper::AddPolygonalFace (const vector<const SMDS_MeshNode*>& nodes,
1292 SMESHDS_Mesh * meshDS = GetMeshDS();
1293 SMDS_MeshFace* elem = 0;
1295 if(!myCreateQuadratic) {
1297 elem = meshDS->AddPolygonalFaceWithID(nodes, id);
1299 elem = meshDS->AddPolygonalFace(nodes);
1302 vector<const SMDS_MeshNode*> newNodes;
1303 for ( int i = 0; i < nodes.size(); ++i )
1305 const SMDS_MeshNode* n1 = nodes[i];
1306 const SMDS_MeshNode* n2 = nodes[(i+1)/nodes.size()];
1307 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1308 newNodes.push_back( n1 );
1309 newNodes.push_back( n12 );
1312 elem = meshDS->AddPolygonalFaceWithID(newNodes, id);
1314 elem = meshDS->AddPolygonalFace(newNodes);
1316 if ( mySetElemOnShape && myShapeID > 0 )
1317 meshDS->SetMeshElementOnShape( elem, myShapeID );
1322 //=======================================================================
1323 //function : AddVolume
1324 //purpose : Creates quadratic or linear prism
1325 //=======================================================================
1327 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1328 const SMDS_MeshNode* n2,
1329 const SMDS_MeshNode* n3,
1330 const SMDS_MeshNode* n4,
1331 const SMDS_MeshNode* n5,
1332 const SMDS_MeshNode* n6,
1336 SMESHDS_Mesh * meshDS = GetMeshDS();
1337 SMDS_MeshVolume* elem = 0;
1338 if(!myCreateQuadratic) {
1340 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, id);
1342 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6);
1345 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1346 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1347 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1349 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1350 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1351 const SMDS_MeshNode* n64 = GetMediumNode(n6,n4,force3d);
1353 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1354 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1355 const SMDS_MeshNode* n36 = GetMediumNode(n3,n6,force3d);
1358 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6,
1359 n12, n23, n31, n45, n56, n64, n14, n25, n36, id);
1361 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6,
1362 n12, n23, n31, n45, n56, n64, n14, n25, n36);
1364 if ( mySetElemOnShape && myShapeID > 0 )
1365 meshDS->SetMeshElementOnShape( elem, myShapeID );
1370 //=======================================================================
1371 //function : AddVolume
1372 //purpose : Creates quadratic or linear tetrahedron
1373 //=======================================================================
1375 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1376 const SMDS_MeshNode* n2,
1377 const SMDS_MeshNode* n3,
1378 const SMDS_MeshNode* n4,
1382 SMESHDS_Mesh * meshDS = GetMeshDS();
1383 SMDS_MeshVolume* elem = 0;
1384 if(!myCreateQuadratic) {
1386 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, id);
1388 elem = meshDS->AddVolume(n1, n2, n3, n4);
1391 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1392 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1393 const SMDS_MeshNode* n31 = GetMediumNode(n3,n1,force3d);
1395 const SMDS_MeshNode* n14 = GetMediumNode(n1,n4,force3d);
1396 const SMDS_MeshNode* n24 = GetMediumNode(n2,n4,force3d);
1397 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1400 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34, id);
1402 elem = meshDS->AddVolume(n1, n2, n3, n4, n12, n23, n31, n14, n24, n34);
1404 if ( mySetElemOnShape && myShapeID > 0 )
1405 meshDS->SetMeshElementOnShape( elem, myShapeID );
1410 //=======================================================================
1411 //function : AddVolume
1412 //purpose : Creates quadratic or linear pyramid
1413 //=======================================================================
1415 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1416 const SMDS_MeshNode* n2,
1417 const SMDS_MeshNode* n3,
1418 const SMDS_MeshNode* n4,
1419 const SMDS_MeshNode* n5,
1423 SMDS_MeshVolume* elem = 0;
1424 if(!myCreateQuadratic) {
1426 elem = GetMeshDS()->AddVolumeWithID(n1, n2, n3, n4, n5, id);
1428 elem = GetMeshDS()->AddVolume(n1, n2, n3, n4, n5);
1431 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1432 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1433 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1434 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1436 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1437 const SMDS_MeshNode* n25 = GetMediumNode(n2,n5,force3d);
1438 const SMDS_MeshNode* n35 = GetMediumNode(n3,n5,force3d);
1439 const SMDS_MeshNode* n45 = GetMediumNode(n4,n5,force3d);
1442 elem = GetMeshDS()->AddVolumeWithID ( n1, n2, n3, n4, n5,
1447 elem = GetMeshDS()->AddVolume( n1, n2, n3, n4, n5,
1449 n15, n25, n35, n45);
1451 if ( mySetElemOnShape && myShapeID > 0 )
1452 GetMeshDS()->SetMeshElementOnShape( elem, myShapeID );
1457 //=======================================================================
1458 //function : AddVolume
1459 //purpose : Creates quadratic or linear hexahedron
1460 //=======================================================================
1462 SMDS_MeshVolume* SMESH_MesherHelper::AddVolume(const SMDS_MeshNode* n1,
1463 const SMDS_MeshNode* n2,
1464 const SMDS_MeshNode* n3,
1465 const SMDS_MeshNode* n4,
1466 const SMDS_MeshNode* n5,
1467 const SMDS_MeshNode* n6,
1468 const SMDS_MeshNode* n7,
1469 const SMDS_MeshNode* n8,
1473 SMESHDS_Mesh * meshDS = GetMeshDS();
1474 SMDS_MeshVolume* elem = 0;
1475 if(!myCreateQuadratic) {
1477 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8, id);
1479 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8);
1482 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1483 const SMDS_MeshNode* n23 = GetMediumNode(n2,n3,force3d);
1484 const SMDS_MeshNode* n34 = GetMediumNode(n3,n4,force3d);
1485 const SMDS_MeshNode* n41 = GetMediumNode(n4,n1,force3d);
1487 const SMDS_MeshNode* n56 = GetMediumNode(n5,n6,force3d);
1488 const SMDS_MeshNode* n67 = GetMediumNode(n6,n7,force3d);
1489 const SMDS_MeshNode* n78 = GetMediumNode(n7,n8,force3d);
1490 const SMDS_MeshNode* n85 = GetMediumNode(n8,n5,force3d);
1492 const SMDS_MeshNode* n15 = GetMediumNode(n1,n5,force3d);
1493 const SMDS_MeshNode* n26 = GetMediumNode(n2,n6,force3d);
1494 const SMDS_MeshNode* n37 = GetMediumNode(n3,n7,force3d);
1495 const SMDS_MeshNode* n48 = GetMediumNode(n4,n8,force3d);
1498 elem = meshDS->AddVolumeWithID(n1, n2, n3, n4, n5, n6, n7, n8,
1499 n12, n23, n34, n41, n56, n67,
1500 n78, n85, n15, n26, n37, n48, id);
1502 elem = meshDS->AddVolume(n1, n2, n3, n4, n5, n6, n7, n8,
1503 n12, n23, n34, n41, n56, n67,
1504 n78, n85, n15, n26, n37, n48);
1506 if ( mySetElemOnShape && myShapeID > 0 )
1507 meshDS->SetMeshElementOnShape( elem, myShapeID );
1512 //=======================================================================
1513 //function : AddPolyhedralVolume
1514 //purpose : Creates polyhedron. In quadratic mesh, adds medium nodes
1515 //=======================================================================
1518 SMESH_MesherHelper::AddPolyhedralVolume (const std::vector<const SMDS_MeshNode*>& nodes,
1519 const std::vector<int>& quantities,
1523 SMESHDS_Mesh * meshDS = GetMeshDS();
1524 SMDS_MeshVolume* elem = 0;
1525 if(!myCreateQuadratic)
1528 elem = meshDS->AddPolyhedralVolumeWithID(nodes, quantities, id);
1530 elem = meshDS->AddPolyhedralVolume(nodes, quantities);
1534 vector<const SMDS_MeshNode*> newNodes;
1535 vector<int> newQuantities;
1536 for ( int iFace=0, iN=0; iFace < quantities.size(); ++iFace)
1538 int nbNodesInFace = quantities[iFace];
1539 newQuantities.push_back(0);
1540 for ( int i = 0; i < nbNodesInFace; ++i )
1542 const SMDS_MeshNode* n1 = nodes[ iN + i ];
1543 newNodes.push_back( n1 );
1544 newQuantities.back()++;
1546 const SMDS_MeshNode* n2 = nodes[ iN + ( i+1==nbNodesInFace ? 0 : i+1 )];
1547 // if ( n1->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE &&
1548 // n2->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
1550 const SMDS_MeshNode* n12 = GetMediumNode(n1,n2,force3d);
1551 newNodes.push_back( n12 );
1552 newQuantities.back()++;
1555 iN += nbNodesInFace;
1558 elem = meshDS->AddPolyhedralVolumeWithID( newNodes, newQuantities, id );
1560 elem = meshDS->AddPolyhedralVolume( newNodes, newQuantities );
1562 if ( mySetElemOnShape && myShapeID > 0 )
1563 meshDS->SetMeshElementOnShape( elem, myShapeID );
1568 //=======================================================================
1569 //function : LoadNodeColumns
1570 //purpose : Load nodes bound to face into a map of node columns
1571 //=======================================================================
1573 bool SMESH_MesherHelper::LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
1574 const TopoDS_Face& theFace,
1575 const TopoDS_Edge& theBaseEdge,
1576 SMESHDS_Mesh* theMesh,
1577 SMESH_ProxyMesh* theProxyMesh)
1579 const SMESHDS_SubMesh* faceSubMesh = 0;
1582 faceSubMesh = theProxyMesh->GetSubMesh( theFace );
1583 if ( !faceSubMesh ||
1584 faceSubMesh->NbElements() == 0 ||
1585 theProxyMesh->IsTemporary( faceSubMesh->GetElements()->next() ))
1587 // can use a proxy sub-mesh with not temporary elements only
1593 faceSubMesh = theMesh->MeshElements( theFace );
1594 if ( !faceSubMesh || faceSubMesh->NbElements() == 0 )
1597 // get nodes on theBaseEdge sorted by param on edge and initialize theParam2ColumnMap with them
1599 map< double, const SMDS_MeshNode*> sortedBaseNodes;
1600 if ( !SMESH_Algo::GetSortedNodesOnEdge( theMesh, theBaseEdge,/*noMedium=*/true, sortedBaseNodes)
1601 || sortedBaseNodes.size() < 2 )
1604 int nbRows = faceSubMesh->NbElements() / ( sortedBaseNodes.size()-1 ) + 1;
1605 map< double, const SMDS_MeshNode*>::iterator u_n = sortedBaseNodes.begin();
1606 double f = u_n->first, range = sortedBaseNodes.rbegin()->first - f;
1607 for ( ; u_n != sortedBaseNodes.end(); u_n++ )
1609 double par = ( u_n->first - f ) / range;
1610 vector<const SMDS_MeshNode*>& nCol = theParam2ColumnMap[ par ];
1611 nCol.resize( nbRows );
1612 nCol[0] = u_n->second;
1614 TParam2ColumnMap::iterator par_nVec_2, par_nVec_1 = theParam2ColumnMap.begin();
1617 for ( ; par_nVec_1 != theParam2ColumnMap.end(); ++par_nVec_1 )
1619 const SMDS_MeshNode* & n = par_nVec_1->second[0];
1620 n = theProxyMesh->GetProxyNode( n );
1624 // fill theParam2ColumnMap column by column by passing from nodes on
1625 // theBaseEdge up via mesh faces on theFace
1627 par_nVec_2 = theParam2ColumnMap.begin();
1628 par_nVec_1 = par_nVec_2++;
1629 TIDSortedElemSet emptySet, avoidSet;
1630 for ( ; par_nVec_2 != theParam2ColumnMap.end(); ++par_nVec_1, ++par_nVec_2 )
1632 vector<const SMDS_MeshNode*>& nCol1 = par_nVec_1->second;
1633 vector<const SMDS_MeshNode*>& nCol2 = par_nVec_2->second;
1635 int i1, i2, iRow = 0;
1636 const SMDS_MeshNode *n1 = nCol1[0], *n2 = nCol2[0];
1637 // find face sharing node n1 and n2 and belonging to faceSubMesh
1638 while ( const SMDS_MeshElement* face =
1639 SMESH_MeshEditor::FindFaceInSet( n1, n2, emptySet, avoidSet, &i1, &i2))
1641 if ( faceSubMesh->Contains( face ))
1643 int nbNodes = face->IsQuadratic() ? face->NbNodes()/2 : face->NbNodes();
1646 n1 = face->GetNode( (i2+2) % 4 ); // opposite corner of quadrangle face
1647 n2 = face->GetNode( (i1+2) % 4 );
1648 if ( ++iRow >= nbRows )
1654 avoidSet.insert( face );
1656 if ( iRow + 1 < nbRows ) // compact if necessary
1657 nCol1.resize( iRow + 1 ), nCol2.resize( iRow + 1 );
1659 return theParam2ColumnMap.size() > 1 && theParam2ColumnMap.begin()->second.size() > 1;
1662 //=======================================================================
1663 //function : NbAncestors
1664 //purpose : Return number of unique ancestors of the shape
1665 //=======================================================================
1667 int SMESH_MesherHelper::NbAncestors(const TopoDS_Shape& shape,
1668 const SMESH_Mesh& mesh,
1669 TopAbs_ShapeEnum ancestorType/*=TopAbs_SHAPE*/)
1671 TopTools_MapOfShape ancestors;
1672 TopTools_ListIteratorOfListOfShape ansIt( mesh.GetAncestors(shape) );
1673 for ( ; ansIt.More(); ansIt.Next() ) {
1674 if ( ancestorType == TopAbs_SHAPE || ansIt.Value().ShapeType() == ancestorType )
1675 ancestors.Add( ansIt.Value() );
1677 return ancestors.Extent();
1680 //=======================================================================
1681 //function : GetSubShapeOri
1682 //purpose : Return orientation of sub-shape in the main shape
1683 //=======================================================================
1685 TopAbs_Orientation SMESH_MesherHelper::GetSubShapeOri(const TopoDS_Shape& shape,
1686 const TopoDS_Shape& subShape)
1688 TopAbs_Orientation ori = TopAbs_Orientation(-1);
1689 if ( !shape.IsNull() && !subShape.IsNull() )
1691 TopExp_Explorer e( shape, subShape.ShapeType() );
1692 if ( shape.Orientation() >= TopAbs_INTERNAL ) // TopAbs_INTERNAL or TopAbs_EXTERNAL
1693 e.Init( shape.Oriented(TopAbs_FORWARD), subShape.ShapeType() );
1694 for ( ; e.More(); e.Next())
1695 if ( subShape.IsSame( e.Current() ))
1698 ori = e.Current().Orientation();
1703 //=======================================================================
1704 //function : IsSubShape
1706 //=======================================================================
1708 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape,
1709 const TopoDS_Shape& mainShape )
1711 if ( !shape.IsNull() && !mainShape.IsNull() )
1713 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
1716 if ( shape.IsSame( exp.Current() ))
1719 SCRUTE((shape.IsNull()));
1720 SCRUTE((mainShape.IsNull()));
1724 //=======================================================================
1725 //function : IsSubShape
1727 //=======================================================================
1729 bool SMESH_MesherHelper::IsSubShape( const TopoDS_Shape& shape, SMESH_Mesh* aMesh )
1731 if ( shape.IsNull() || !aMesh )
1734 aMesh->GetMeshDS()->ShapeToIndex( shape ) ||
1736 (shape.ShapeType() == TopAbs_COMPOUND && aMesh->GetMeshDS()->IsGroupOfSubShapes( shape ));
1739 //================================================================================
1741 * \brief Return maximal tolerance of shape
1743 //================================================================================
1745 double SMESH_MesherHelper::MaxTolerance( const TopoDS_Shape& shape )
1747 double tol = Precision::Confusion();
1748 TopExp_Explorer exp;
1749 for ( exp.Init( shape, TopAbs_FACE ); exp.More(); exp.Next() )
1750 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Face( exp.Current())));
1751 for ( exp.Init( shape, TopAbs_EDGE ); exp.More(); exp.Next() )
1752 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Edge( exp.Current())));
1753 for ( exp.Init( shape, TopAbs_VERTEX ); exp.More(); exp.Next() )
1754 tol = Max( tol, BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current())));
1759 //================================================================================
1761 * \brief Check if the first and last vertices of an edge are the same
1762 * \param anEdge - the edge to check
1763 * \retval bool - true if same
1765 //================================================================================
1767 bool SMESH_MesherHelper::IsClosedEdge( const TopoDS_Edge& anEdge )
1769 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
1770 return IsClosedEdge( TopoDS::Edge( anEdge.Oriented( TopAbs_FORWARD )));
1771 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
1774 //================================================================================
1776 * \brief Wrapper over TopExp::FirstVertex() and TopExp::LastVertex() fixing them
1777 * in the case of INTERNAL edge
1779 //================================================================================
1781 TopoDS_Vertex SMESH_MesherHelper::IthVertex( const bool is2nd,
1785 if ( anEdge.Orientation() >= TopAbs_INTERNAL )
1786 anEdge.Orientation( TopAbs_FORWARD );
1788 const TopAbs_Orientation tgtOri = is2nd ? TopAbs_REVERSED : TopAbs_FORWARD;
1789 TopoDS_Iterator vIt( anEdge, CumOri );
1790 while ( vIt.More() && vIt.Value().Orientation() != tgtOri )
1793 return ( vIt.More() ? TopoDS::Vertex(vIt.Value()) : TopoDS_Vertex() );
1796 //=======================================================================
1797 //function : IsQuadraticMesh
1798 //purpose : Check mesh without geometry for: if all elements on this shape are quadratic,
1799 // quadratic elements will be created.
1800 // Used then generated 3D mesh without geometry.
1801 //=======================================================================
1803 SMESH_MesherHelper:: MType SMESH_MesherHelper::IsQuadraticMesh()
1805 int NbAllEdgsAndFaces=0;
1806 int NbQuadFacesAndEdgs=0;
1807 int NbFacesAndEdges=0;
1808 //All faces and edges
1809 NbAllEdgsAndFaces = myMesh->NbEdges() + myMesh->NbFaces();
1811 //Quadratic faces and edges
1812 NbQuadFacesAndEdgs = myMesh->NbEdges(ORDER_QUADRATIC) + myMesh->NbFaces(ORDER_QUADRATIC);
1814 //Linear faces and edges
1815 NbFacesAndEdges = myMesh->NbEdges(ORDER_LINEAR) + myMesh->NbFaces(ORDER_LINEAR);
1817 if (NbAllEdgsAndFaces == NbQuadFacesAndEdgs) {
1819 return SMESH_MesherHelper::QUADRATIC;
1821 else if (NbAllEdgsAndFaces == NbFacesAndEdges) {
1823 return SMESH_MesherHelper::LINEAR;
1826 //Mesh with both type of elements
1827 return SMESH_MesherHelper::COMP;
1830 //=======================================================================
1831 //function : GetOtherParam
1832 //purpose : Return an alternative parameter for a node on seam
1833 //=======================================================================
1835 double SMESH_MesherHelper::GetOtherParam(const double param) const
1837 int i = myParIndex & U_periodic ? 0 : 1;
1838 return fabs(param-myPar1[i]) < fabs(param-myPar2[i]) ? myPar2[i] : myPar1[i];
1843 //=======================================================================
1845 * \brief Iterator on ancestors of the given type
1847 //=======================================================================
1849 struct TAncestorsIterator : public SMDS_Iterator<const TopoDS_Shape*>
1851 TopTools_ListIteratorOfListOfShape _ancIter;
1852 TopAbs_ShapeEnum _type;
1853 TopTools_MapOfShape _encountered;
1854 TAncestorsIterator( const TopTools_ListOfShape& ancestors, TopAbs_ShapeEnum type)
1855 : _ancIter( ancestors ), _type( type )
1857 if ( _ancIter.More() ) {
1858 if ( _ancIter.Value().ShapeType() != _type ) next();
1859 else _encountered.Add( _ancIter.Value() );
1864 return _ancIter.More();
1866 virtual const TopoDS_Shape* next()
1868 const TopoDS_Shape* s = _ancIter.More() ? & _ancIter.Value() : 0;
1869 if ( _ancIter.More() )
1870 for ( _ancIter.Next(); _ancIter.More(); _ancIter.Next())
1871 if ( _ancIter.Value().ShapeType() == _type && _encountered.Add( _ancIter.Value() ))
1879 //=======================================================================
1881 * \brief Return iterator on ancestors of the given type
1883 //=======================================================================
1885 PShapeIteratorPtr SMESH_MesherHelper::GetAncestors(const TopoDS_Shape& shape,
1886 const SMESH_Mesh& mesh,
1887 TopAbs_ShapeEnum ancestorType)
1889 return PShapeIteratorPtr( new TAncestorsIterator( mesh.GetAncestors(shape), ancestorType));
1892 //#include <Perf_Meter.hxx>
1894 //=======================================================================
1895 namespace { // Structures used by FixQuadraticElements()
1896 //=======================================================================
1898 #define __DMP__(txt) \
1900 #define MSG(txt) __DMP__(txt<<endl)
1901 #define MSGBEG(txt) __DMP__(txt)
1903 //const double straightTol2 = 1e-33; // to detect straing links
1904 bool isStraightLink(double linkLen2, double middleNodeMove2)
1906 // straight if <node move> < 1/15 * <link length>
1907 return middleNodeMove2 < 1/15./15. * linkLen2;
1911 // ---------------------------------------
1913 * \brief Quadratic link knowing its faces
1915 struct QLink: public SMESH_TLink
1917 const SMDS_MeshNode* _mediumNode;
1918 mutable vector<const QFace* > _faces;
1919 mutable gp_Vec _nodeMove;
1920 mutable int _nbMoves;
1922 QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
1923 SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
1925 //if ( MediumPos() != SMDS_TOP_3DSPACE )
1926 _nodeMove = MediumPnt() - MiddlePnt();
1928 void SetContinuesFaces() const;
1929 const QFace* GetContinuesFace( const QFace* face ) const;
1930 bool OnBoundary() const;
1931 gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
1932 gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
1934 SMDS_TypeOfPosition MediumPos() const
1935 { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
1936 SMDS_TypeOfPosition EndPos(bool isSecond) const
1937 { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
1938 const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
1939 { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
1941 void Move(const gp_Vec& move, bool sum=false) const
1942 { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
1943 gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
1944 bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
1945 bool IsStraight() const
1946 { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
1947 _nodeMove.SquareMagnitude());
1949 bool operator<(const QLink& other) const {
1950 return (node1()->GetID() == other.node1()->GetID() ?
1951 node2()->GetID() < other.node2()->GetID() :
1952 node1()->GetID() < other.node1()->GetID());
1954 // struct PtrComparator {
1955 // bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
1958 // ---------------------------------------------------------
1960 * \brief Link in the chain of links; it connects two faces
1964 const QLink* _qlink;
1965 mutable const QFace* _qfaces[2];
1967 TChainLink(const QLink* qlink=0):_qlink(qlink) {
1968 _qfaces[0] = _qfaces[1] = 0;
1970 void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
1972 bool IsBoundary() const { return !_qfaces[1]; }
1974 void RemoveFace( const QFace* face ) const
1975 { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
1977 const QFace* NextFace( const QFace* f ) const
1978 { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
1980 const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
1981 { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
1983 bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
1985 operator bool() const { return (_qlink); }
1987 const QLink* operator->() const { return _qlink; }
1989 gp_Vec Normal() const;
1991 bool IsStraight() const;
1993 // --------------------------------------------------------------------
1994 typedef list< TChainLink > TChain;
1995 typedef set < TChainLink > TLinkSet;
1996 typedef TLinkSet::const_iterator TLinkInSet;
1998 const int theFirstStep = 5;
2000 enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
2001 // --------------------------------------------------------------------
2003 * \brief Face shared by two volumes and bound by QLinks
2005 struct QFace: public TIDSortedNodeSet
2007 mutable const SMDS_MeshElement* _volumes[2];
2008 mutable vector< const QLink* > _sides;
2009 mutable bool _sideIsAdded[4]; // added in chain of links
2012 mutable const SMDS_MeshElement* _face;
2015 QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
2017 void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
2019 int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
2021 void AddSelfToLinks() const {
2022 for ( int i = 0; i < _sides.size(); ++i )
2023 _sides[i]->_faces.push_back( this );
2025 int LinkIndex( const QLink* side ) const {
2026 for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
2029 bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
2031 bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
2033 int i = LinkIndex( link._qlink );
2034 if ( i < 0 ) return true;
2035 _sideIsAdded[i] = true;
2036 link.SetFace( this );
2037 // continue from opposite link
2038 return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
2040 bool IsBoundary() const { return !_volumes[1]; }
2042 bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
2044 bool IsSpoiled(const QLink* bentLink ) const;
2046 TLinkInSet GetBoundaryLink( const TLinkSet& links,
2047 const TChainLink& avoidLink,
2048 TLinkInSet * notBoundaryLink = 0,
2049 const SMDS_MeshNode* nodeToContain = 0,
2050 bool * isAdjacentUsed = 0,
2051 int nbRecursionsLeft = -1) const;
2053 TLinkInSet GetLinkByNode( const TLinkSet& links,
2054 const TChainLink& avoidLink,
2055 const SMDS_MeshNode* nodeToContain) const;
2057 const SMDS_MeshNode* GetNodeInFace() const {
2058 for ( int iL = 0; iL < _sides.size(); ++iL )
2059 if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
2063 gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
2065 double MoveByBoundary( const TChainLink& theLink,
2066 const gp_Vec& theRefVec,
2067 const TLinkSet& theLinks,
2068 SMESH_MesherHelper* theFaceHelper=0,
2069 const double thePrevLen=0,
2070 const int theStep=theFirstStep,
2071 gp_Vec* theLinkNorm=0,
2072 double theSign=1.0) const;
2075 //================================================================================
2077 * \brief Dump QLink and QFace
2079 ostream& operator << (ostream& out, const QLink& l)
2081 out <<"QLink nodes: "
2082 << l.node1()->GetID() << " - "
2083 << l._mediumNode->GetID() << " - "
2084 << l.node2()->GetID() << endl;
2087 ostream& operator << (ostream& out, const QFace& f)
2089 out <<"QFace nodes: "/*<< &f << " "*/;
2090 for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
2091 out << (*n)->GetID() << " ";
2092 out << " \tvolumes: "
2093 << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
2094 << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
2095 out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
2099 //================================================================================
2101 * \brief Construct QFace from QLinks
2103 //================================================================================
2105 QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
2107 _volumes[0] = _volumes[1] = 0;
2109 _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
2110 _normal.SetCoord(0,0,0);
2111 for ( int i = 1; i < _sides.size(); ++i ) {
2112 const QLink *l1 = _sides[i-1], *l2 = _sides[i];
2113 insert( l1->node1() ); insert( l1->node2() );
2115 gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
2116 gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
2117 if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
2121 double normSqSize = _normal.SquareMagnitude();
2122 if ( normSqSize > numeric_limits<double>::min() )
2123 _normal /= sqrt( normSqSize );
2125 _normal.SetCoord(1e-33,0,0);
2131 //================================================================================
2133 * \brief Make up a chain of links
2134 * \param iSide - link to add first
2135 * \param chain - chain to fill in
2136 * \param pos - postion of medium nodes the links should have
2137 * \param error - out, specifies what is wrong
2138 * \retval bool - false if valid chain can't be built; "valid" means that links
2139 * of the chain belongs to rectangles bounding hexahedrons
2141 //================================================================================
2143 bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
2145 if ( iSide >= _sides.size() ) // wrong argument iSide
2147 if ( _sideIsAdded[ iSide ]) // already in chain
2150 if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
2153 list< const QFace* > faces( 1, this );
2154 while ( !faces.empty() ) {
2155 const QFace* face = faces.front();
2156 for ( int i = 0; i < face->_sides.size(); ++i ) {
2157 if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
2158 face->_sideIsAdded[i] = true;
2159 // find a face side in the chain
2160 TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
2161 // TChain::iterator chLink = chain.begin();
2162 // for ( ; chLink != chain.end(); ++chLink )
2163 // if ( chLink->_qlink == face->_sides[i] )
2165 // if ( chLink == chain.end() )
2166 // chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
2167 // add a face to a chained link and put a continues face in the queue
2168 chLink->SetFace( face );
2169 if ( face->_sides[i]->MediumPos() == pos )
2170 if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
2171 if ( contFace->_sides.size() == 3 )
2172 faces.push_back( contFace );
2177 if ( error < ERR_TRI )
2179 chain.insert( chain.end(), links.begin(),links.end() );
2182 _sideIsAdded[iSide] = true; // not to add this link to chain again
2183 const QLink* link = _sides[iSide];
2187 // add link into chain
2188 TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
2189 chLink->SetFace( this );
2192 // propagate from quadrangle to neighbour faces
2193 if ( link->MediumPos() >= pos ) {
2194 int nbLinkFaces = link->_faces.size();
2195 if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
2196 // hexahedral mesh or boundary quadrangles - goto a continous face
2197 if ( const QFace* f = link->GetContinuesFace( this ))
2198 if ( f->_sides.size() == 4 )
2199 return f->GetLinkChain( *chLink, chain, pos, error );
2202 TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
2203 for ( int i = 0; i < nbLinkFaces; ++i )
2204 if ( link->_faces[i] )
2205 link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
2206 if ( error < ERR_PRISM )
2214 //================================================================================
2216 * \brief Return a boundary link of the triangle face
2217 * \param links - set of all links
2218 * \param avoidLink - link not to return
2219 * \param notBoundaryLink - out, neither the returned link nor avoidLink
2220 * \param nodeToContain - node the returned link must contain; if provided, search
2221 * also performed on adjacent faces
2222 * \param isAdjacentUsed - returns true if link is found in adjacent faces
2223 * \param nbRecursionsLeft - to limit recursion
2225 //================================================================================
2227 TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
2228 const TChainLink& avoidLink,
2229 TLinkInSet * notBoundaryLink,
2230 const SMDS_MeshNode* nodeToContain,
2231 bool * isAdjacentUsed,
2232 int nbRecursionsLeft) const
2234 TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
2236 typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
2237 TFaceLinkList adjacentFaces;
2239 for ( int iL = 0; iL < _sides.size(); ++iL )
2241 if ( avoidLink._qlink == _sides[iL] )
2243 TLinkInSet link = links.find( _sides[iL] );
2244 if ( link == linksEnd ) continue;
2245 if ( (*link)->MediumPos() > SMDS_TOP_FACE )
2246 continue; // We work on faces here, don't go inside a solid
2249 if ( link->IsBoundary() ) {
2250 if ( !nodeToContain ||
2251 (*link)->node1() == nodeToContain ||
2252 (*link)->node2() == nodeToContain )
2254 boundaryLink = link;
2255 if ( !notBoundaryLink ) break;
2258 else if ( notBoundaryLink ) {
2259 *notBoundaryLink = link;
2260 if ( boundaryLink != linksEnd ) break;
2263 if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
2264 if ( const QFace* adj = link->NextFace( this ))
2265 if ( adj->Contains( nodeToContain ))
2266 adjacentFaces.push_back( make_pair( adj, link ));
2269 if ( isAdjacentUsed ) *isAdjacentUsed = false;
2270 if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
2272 if ( nbRecursionsLeft < 0 )
2273 nbRecursionsLeft = nodeToContain->NbInverseElements();
2274 TFaceLinkList::iterator adj = adjacentFaces.begin();
2275 for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
2276 boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
2277 isAdjacentUsed, nbRecursionsLeft-1);
2278 if ( isAdjacentUsed ) *isAdjacentUsed = true;
2280 return boundaryLink;
2282 //================================================================================
2284 * \brief Return a link ending at the given node but not avoidLink
2286 //================================================================================
2288 TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
2289 const TChainLink& avoidLink,
2290 const SMDS_MeshNode* nodeToContain) const
2292 for ( int i = 0; i < _sides.size(); ++i )
2293 if ( avoidLink._qlink != _sides[i] &&
2294 (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
2295 return links.find( _sides[ i ]);
2299 //================================================================================
2301 * \brief Return normal to the i-th side pointing outside the face
2303 //================================================================================
2305 gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
2307 gp_Vec norm, vecOut;
2308 // if ( uvHelper ) {
2309 // TopoDS_Face face = TopoDS::Face( uvHelper->GetSubShape());
2310 // const SMDS_MeshNode* inFaceNode = uvHelper->GetNodeUVneedInFaceNode() ? GetNodeInFace() : 0;
2311 // gp_XY uv1 = uvHelper->GetNodeUV( face, _sides[i]->node1(), inFaceNode );
2312 // gp_XY uv2 = uvHelper->GetNodeUV( face, _sides[i]->node2(), inFaceNode );
2313 // norm.SetCoord( uv1.Y() - uv2.Y(), uv2.X() - uv1.X(), 0 );
2315 // const QLink* otherLink = _sides[(i + 1) % _sides.size()];
2316 // const SMDS_MeshNode* otherNode =
2317 // otherLink->node1() == _sides[i]->node1() ? otherLink->node2() : otherLink->node1();
2318 // gp_XY pIn = uvHelper->GetNodeUV( face, otherNode, inFaceNode );
2319 // vecOut.SetCoord( uv1.X() - pIn.X(), uv1.Y() - pIn.Y(), 0 );
2322 norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
2323 gp_XYZ pIn = ( XYZ( _sides[0]->node1() ) +
2324 XYZ( _sides[0]->node2() ) +
2325 XYZ( _sides[1]->node1() )) / 3.;
2326 vecOut.SetXYZ( _sides[i]->MiddlePnt() - pIn );
2328 if ( norm * vecOut < 0 )
2330 double mag2 = norm.SquareMagnitude();
2331 if ( mag2 > numeric_limits<double>::min() )
2332 norm /= sqrt( mag2 );
2335 //================================================================================
2337 * \brief Move medium node of theLink according to its distance from boundary
2338 * \param theLink - link to fix
2339 * \param theRefVec - movement of boundary
2340 * \param theLinks - all adjacent links of continous triangles
2341 * \param theFaceHelper - helper is not used so far
2342 * \param thePrevLen - distance from the boundary
2343 * \param theStep - number of steps till movement propagation limit
2344 * \param theLinkNorm - out normal to theLink
2345 * \param theSign - 1 or -1 depending on movement of boundary
2346 * \retval double - distance from boundary to propagation limit or other boundary
2348 //================================================================================
2350 double QFace::MoveByBoundary( const TChainLink& theLink,
2351 const gp_Vec& theRefVec,
2352 const TLinkSet& theLinks,
2353 SMESH_MesherHelper* theFaceHelper,
2354 const double thePrevLen,
2356 gp_Vec* theLinkNorm,
2357 double theSign) const
2360 return thePrevLen; // propagation limit reached
2362 int iL; // index of theLink
2363 for ( iL = 0; iL < _sides.size(); ++iL )
2364 if ( theLink._qlink == _sides[ iL ])
2367 MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
2368 <<" thePrevLen " << thePrevLen);
2369 MSG(string(theStep,'.')<<" "<<*theLink._qlink);
2371 gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
2372 double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
2373 if ( theStep == theFirstStep )
2374 theSign = refProj < 0. ? -1. : 1.;
2375 else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
2376 return thePrevLen; // to propagate movement forward only, not in side dir or backward
2378 int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
2379 TLinkInSet link1 = theLinks.find( _sides[iL1] );
2380 TLinkInSet link2 = theLinks.find( _sides[iL2] );
2381 if ( link1 == theLinks.end() || link2 == theLinks.end() )
2383 const QFace* f1 = link1->NextFace( this ); // adjacent faces
2384 const QFace* f2 = link2->NextFace( this );
2386 // propagate to adjacent faces till limit step or boundary
2387 double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
2388 double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
2389 gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
2390 gp_Vec linkDir2(0,0,0);
2393 if ( f1 && theLink->MediumPos() <= (*link1)->MediumPos() )
2394 len1 = f1->MoveByBoundary
2395 ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
2397 linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
2399 MSG( " --------------- EXCEPTION");
2404 if ( f2 && theLink->MediumPos() <= (*link2)->MediumPos() )
2405 len2 = f2->MoveByBoundary
2406 ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
2408 linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
2410 MSG( " --------------- EXCEPTION");
2415 if ( theStep != theFirstStep )
2417 // choose chain length by direction of propagation most codirected with theRefVec
2418 bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
2419 fullLen = choose1 ? len1 : len2;
2420 double r = thePrevLen / fullLen;
2422 gp_Vec move = linkNorm * refProj * ( 1 - r );
2423 theLink->Move( move, true );
2425 MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
2426 " by " << refProj * ( 1 - r ) << " following " <<
2427 (choose1 ? *link1->_qlink : *link2->_qlink));
2429 if ( theLinkNorm ) *theLinkNorm = linkNorm;
2434 //================================================================================
2436 * \brief Checks if the face is distorted due to bentLink
2438 //================================================================================
2440 bool QFace::IsSpoiled(const QLink* bentLink ) const
2442 // code is valid for convex faces only
2444 for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
2445 gc += XYZ( *n ) / size();
2446 for (unsigned i = 0; i < _sides.size(); ++i )
2448 if ( _sides[i] == bentLink ) continue;
2449 gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
2450 gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
2451 if ( linkNorm * vecOut < 0 )
2453 double mag2 = linkNorm.SquareMagnitude();
2454 if ( mag2 > numeric_limits<double>::min() )
2455 linkNorm /= sqrt( mag2 );
2456 gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
2457 gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
2458 if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
2465 //================================================================================
2467 * \brief Find pairs of continues faces
2469 //================================================================================
2471 void QLink::SetContinuesFaces() const
2473 // x0 x - QLink, [-|] - QFace, v - volume
2475 // | Between _faces of link x2 two vertical faces are continues
2476 // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
2477 // | to _faces[0] and _faces[1] and horizontal faces to
2478 // v2 | v3 _faces[2] and _faces[3] (or vise versa).
2481 if ( _faces.empty() )
2483 int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
2484 if ( _faces[0]->IsBoundary() )
2485 iBoundary[ nbBoundary++ ] = 0;
2486 for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
2488 // look for a face bounding none of volumes bound by _faces[0]
2489 bool sameVol = false;
2490 int nbVol = _faces[iF]->NbVolumes();
2491 for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
2492 sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
2493 _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
2496 if ( _faces[iF]->IsBoundary() )
2497 iBoundary[ nbBoundary++ ] = iF;
2499 // Set continues faces: arrange _faces to have
2500 // _faces[0] continues to _faces[1]
2501 // _faces[2] continues to _faces[3]
2502 if ( nbBoundary == 2 ) // bnd faces are continues
2504 if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
2506 int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
2507 std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
2510 else if ( iFaceCont > 0 ) // continues faces found
2512 if ( iFaceCont != 1 )
2513 std::swap( _faces[1], _faces[iFaceCont] );
2515 else if ( _faces.size() > 1 ) // not found, set NULL by the first face
2517 _faces.insert( ++_faces.begin(), 0 );
2520 //================================================================================
2522 * \brief Return a face continues to the given one
2524 //================================================================================
2526 const QFace* QLink::GetContinuesFace( const QFace* face ) const
2528 for ( int i = 0; i < _faces.size(); ++i ) {
2529 if ( _faces[i] == face ) {
2530 int iF = i < 2 ? 1-i : 5-i;
2531 return iF < _faces.size() ? _faces[iF] : 0;
2536 //================================================================================
2538 * \brief True if link is on mesh boundary
2540 //================================================================================
2542 bool QLink::OnBoundary() const
2544 for ( int i = 0; i < _faces.size(); ++i )
2545 if (_faces[i] && _faces[i]->IsBoundary()) return true;
2548 //================================================================================
2550 * \brief Return normal of link of the chain
2552 //================================================================================
2554 gp_Vec TChainLink::Normal() const {
2556 if (_qfaces[0]) norm = _qfaces[0]->_normal;
2557 if (_qfaces[1]) norm += _qfaces[1]->_normal;
2560 //================================================================================
2562 * \brief Test link curvature taking into account size of faces
2564 //================================================================================
2566 bool TChainLink::IsStraight() const
2568 bool isStraight = _qlink->IsStraight();
2569 if ( isStraight && _qfaces[0] && !_qfaces[1] )
2571 int i = _qfaces[0]->LinkIndex( _qlink );
2572 int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
2573 gp_XYZ mid1 = _qlink->MiddlePnt();
2574 gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
2575 double faceSize2 = (mid1-mid2).SquareModulus();
2576 isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/3./3. * faceSize2;
2581 //================================================================================
2583 * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
2585 //================================================================================
2587 void fixPrism( TChain& allLinks )
2589 // separate boundary links from internal ones
2590 typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
2591 QLinkSet interLinks, bndLinks1, bndLink2;
2593 bool isCurved = false;
2594 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
2595 if ( (*lnk)->OnBoundary() )
2596 bndLinks1.insert( lnk->_qlink );
2598 interLinks.insert( lnk->_qlink );
2599 isCurved = isCurved || !lnk->IsStraight();
2602 return; // no need to move
2604 QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
2606 while ( !interLinks.empty() && !curBndLinks->empty() )
2608 // propagate movement from boundary links to connected internal links
2609 QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
2610 for ( ; bnd != bndEnd; ++bnd )
2612 const QLink* bndLink = *bnd;
2613 for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
2615 const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
2616 if ( !face ) continue;
2617 // find and move internal link opposite to bndLink within the face
2618 int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
2619 const QLink* interLink = face->_sides[ interInd ];
2620 QLinkSet::iterator pInterLink = interLinks.find( interLink );
2621 if ( pInterLink == interLinks.end() ) continue; // not internal link
2622 interLink->Move( bndLink->_nodeMove );
2623 // treated internal links become new boundary ones
2624 interLinks. erase( pInterLink );
2625 newBndLinks->insert( interLink );
2628 curBndLinks->clear();
2629 std::swap( curBndLinks, newBndLinks );
2633 //================================================================================
2635 * \brief Fix links of continues triangles near curved boundary
2637 //================================================================================
2639 void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
2641 if ( allLinks.empty() ) return;
2643 TLinkSet linkSet( allLinks.begin(), allLinks.end());
2644 TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
2646 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
2648 if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
2650 // move iff a boundary link is bent towards inside of a face (issue 0021084)
2651 const QFace* face = linkIt->_qfaces[0];
2652 gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
2653 face->_sides[1]->MiddlePnt() +
2654 face->_sides[2]->MiddlePnt() ) / 3.;
2655 gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
2656 bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
2657 //if ( face->IsSpoiled( linkIt->_qlink ))
2658 if ( linkBentInside )
2659 face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
2664 //================================================================================
2666 * \brief Detect rectangular structure of links and build chains from them
2668 //================================================================================
2670 enum TSplitTriaResult {
2671 _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
2672 _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
2674 TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
2675 vector< TChain> & resultChains,
2676 SMDS_TypeOfPosition pos )
2678 // put links in the set and evalute number of result chains by number of boundary links
2681 for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
2682 linkSet.insert( *lnk );
2683 nbBndLinks += lnk->IsBoundary();
2685 resultChains.clear();
2686 resultChains.reserve( nbBndLinks / 2 );
2688 TLinkInSet linkIt, linksEnd = linkSet.end();
2690 // find a boundary link with corner node; corner node has position pos-2
2691 // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
2693 SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
2694 const SMDS_MeshNode* corner = 0;
2695 for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
2696 if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
2701 TLinkInSet startLink = linkIt;
2702 const SMDS_MeshNode* startCorner = corner;
2703 vector< TChain* > rowChains;
2706 while ( startLink != linksEnd) // loop on columns
2708 // We suppose we have a rectangular structure like shown here. We have found a
2709 // corner of the rectangle (startCorner) and a boundary link sharing
2710 // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
2711 // --o---o---o structure making several chains at once. One chain (columnChain)
2712 // |\ | /| starts at startLink and continues upward (we look at the structure
2713 // \ | \ | / | from such point that startLink is on the bottom of the structure).
2714 // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
2715 // --o---o---o encounter.
2717 // / | \ | \ | startCorner
2722 if ( resultChains.size() == nbBndLinks / 2 )
2724 resultChains.push_back( TChain() );
2725 TChain& columnChain = resultChains.back();
2727 TLinkInSet botLink = startLink; // current horizontal link to go up from
2728 corner = startCorner; // current corner the botLink ends at
2730 while ( botLink != linksEnd ) // loop on rows
2732 // add botLink to the columnChain
2733 columnChain.push_back( *botLink );
2735 const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
2737 { // the column ends
2738 if ( botLink == startLink )
2739 return _TWISTED_CHAIN; // issue 0020951
2740 linkSet.erase( botLink );
2741 if ( iRow != rowChains.size() )
2742 return _FEW_ROWS; // different nb of rows in columns
2745 // find the link dividing the quadrangle (midQuadLink) and vertical boundary
2746 // link ending at <corner> (sideLink); there are two cases:
2747 // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
2748 // since midQuadLink is not at boundary while sideLink is.
2749 // 2) midQuadLink ends at <corner>
2751 TLinkInSet midQuadLink = linksEnd;
2752 TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
2754 if ( isCase2 ) { // find midQuadLink among links of botTria
2755 midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
2756 if ( midQuadLink->IsBoundary() )
2757 return _BAD_MIDQUAD;
2759 if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
2760 return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
2763 columnChain.push_back( *midQuadLink );
2764 if ( iRow >= rowChains.size() ) {
2766 return _MANY_ROWS; // different nb of rows in columns
2767 if ( resultChains.size() == nbBndLinks / 2 )
2769 resultChains.push_back( TChain() );
2770 rowChains.push_back( & resultChains.back() );
2772 rowChains[iRow]->push_back( *sideLink );
2773 rowChains[iRow]->push_back( *midQuadLink );
2775 const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
2779 // prepare startCorner and startLink for the next column
2780 startCorner = startLink->NextNode( startCorner );
2782 startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
2784 startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
2785 // check if no more columns remains
2786 if ( startLink != linksEnd ) {
2787 const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
2788 if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
2789 startLink = linksEnd; // startLink bounds upTria or botTria
2790 else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
2794 // find bottom link and corner for the next row
2795 corner = sideLink->NextNode( corner );
2796 // next bottom link ends at the new corner
2797 linkSet.erase( botLink );
2798 botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
2799 if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
2801 if ( midQuadLink == startLink || sideLink == startLink )
2802 return _TWISTED_CHAIN; // issue 0020951
2803 linkSet.erase( midQuadLink );
2804 linkSet.erase( sideLink );
2806 // make faces neighboring the found ones be boundary
2807 if ( startLink != linksEnd ) {
2808 const QFace* tria = isCase2 ? botTria : upTria;
2809 for ( int iL = 0; iL < 3; ++iL ) {
2810 linkIt = linkSet.find( tria->_sides[iL] );
2811 if ( linkIt != linksEnd )
2812 linkIt->RemoveFace( tria );
2815 if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
2816 botLink->RemoveFace( upTria ); // make next botTria first in vector
2823 // In the linkSet, there must remain the last links of rowChains; add them
2824 if ( linkSet.size() != rowChains.size() )
2825 return _BAD_SET_SIZE;
2826 for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
2827 // find the link (startLink) ending at startCorner
2829 for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
2830 if ( (*startLink)->node1() == startCorner ) {
2831 corner = (*startLink)->node2(); break;
2833 else if ( (*startLink)->node2() == startCorner) {
2834 corner = (*startLink)->node1(); break;
2837 if ( startLink == linksEnd )
2839 rowChains[ iRow ]->push_back( *startLink );
2840 linkSet.erase( startLink );
2841 startCorner = corner;
2848 //=======================================================================
2850 * \brief Move medium nodes of faces and volumes to fix distorted elements
2851 * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
2853 * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
2855 //=======================================================================
2857 void SMESH_MesherHelper::FixQuadraticElements(bool volumeOnly)
2859 // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
2860 if ( getenv("NO_FixQuadraticElements") )
2863 // 0. Apply algorithm to solids or geom faces
2864 // ----------------------------------------------
2865 if ( myShape.IsNull() ) {
2866 if ( !myMesh->HasShapeToMesh() ) return;
2867 SetSubShape( myMesh->GetShapeToMesh() );
2871 TopTools_IndexedMapOfShape solids;
2872 TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
2873 nbSolids = solids.Extent();
2875 TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
2876 for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
2877 faces.Add( f.Current() ); // not in solid
2879 for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
2880 if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
2881 for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
2882 faces.Add( f.Current() ); // in not meshed solid
2884 else { // fix nodes in the solid and its faces
2886 MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
2888 SMESH_MesherHelper h(*myMesh);
2889 h.SetSubShape( s.Current() );
2890 h.FixQuadraticElements(false);
2893 // fix nodes on geom faces
2895 int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
2897 for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
2898 MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
2899 SMESH_MesherHelper h(*myMesh);
2900 h.SetSubShape( fIt.Key() );
2901 h.FixQuadraticElements(true);
2903 //perf_print_all_meters(1);
2907 // 1. Find out type of elements and get iterator on them
2908 // ---------------------------------------------------
2910 SMDS_ElemIteratorPtr elemIt;
2911 SMDSAbs_ElementType elemType = SMDSAbs_All;
2913 SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
2916 if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
2917 elemIt = smDS->GetElements();
2918 if ( elemIt->more() ) {
2919 elemType = elemIt->next()->GetType();
2920 elemIt = smDS->GetElements();
2923 if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
2926 // 2. Fill in auxiliary data structures
2927 // ----------------------------------
2931 set< QLink >::iterator pLink;
2932 set< QFace >::iterator pFace;
2934 bool isCurved = false;
2935 //bool hasRectFaces = false;
2936 //set<int> nbElemNodeSet;
2937 SMDS_VolumeTool volTool;
2939 TIDSortedNodeSet apexOfPyramid;
2940 const int apexIndex = 4;
2942 if ( elemType == SMDSAbs_Volume )
2944 while ( elemIt->more() ) // loop on volumes
2946 const SMDS_MeshElement* vol = elemIt->next();
2947 if ( !vol->IsQuadratic() || !volTool.Set( vol ))
2949 for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
2951 int nbN = volTool.NbFaceNodes( iF );
2952 //nbElemNodeSet.insert( nbN );
2953 const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
2954 vector< const QLink* > faceLinks( nbN/2 );
2955 for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
2958 QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
2959 pLink = links.insert( link ).first;
2960 faceLinks[ iN/2 ] = & *pLink;
2962 isCurved = !link.IsStraight();
2963 if ( link.MediumPos() == SMDS_TOP_3DSPACE && !link.IsStraight() )
2964 return; // already fixed
2967 pFace = faces.insert( QFace( faceLinks )).first;
2968 if ( pFace->NbVolumes() == 0 )
2969 pFace->AddSelfToLinks();
2970 pFace->SetVolume( vol );
2971 // hasRectFaces = hasRectFaces ||
2972 // ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
2973 // volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
2976 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
2978 pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
2979 faceNodes[4],faceNodes[6] );
2982 // collect pyramid apexes for further correction
2983 if ( vol->NbCornerNodes() == 5 )
2984 apexOfPyramid.insert( vol->GetNode( apexIndex ));
2986 set< QLink >::iterator pLink = links.begin();
2987 for ( ; pLink != links.end(); ++pLink )
2988 pLink->SetContinuesFaces();
2992 while ( elemIt->more() ) // loop on faces
2994 const SMDS_MeshElement* face = elemIt->next();
2995 if ( !face->IsQuadratic() )
2997 //nbElemNodeSet.insert( face->NbNodes() );
2998 int nbN = face->NbNodes()/2;
2999 vector< const QLink* > faceLinks( nbN );
3000 for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
3003 QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
3004 pLink = links.insert( link ).first;
3005 faceLinks[ iN ] = & *pLink;
3007 isCurved = !link.IsStraight();
3010 pFace = faces.insert( QFace( faceLinks )).first;
3011 pFace->AddSelfToLinks();
3012 //hasRectFaces = ( hasRectFaces || nbN == 4 );
3016 return; // no curved edges of faces
3018 // 3. Compute displacement of medium nodes
3019 // ---------------------------------------
3021 // two loops on QFaces: the first is to treat boundary links, the second is for internal ones
3022 TopLoc_Location loc;
3023 // not treat boundary of volumic submesh
3024 int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
3025 for ( ; isInside < 2; ++isInside ) {
3026 MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
3027 SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
3028 SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
3030 for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
3031 if ( bool(isInside) == pFace->IsBoundary() )
3033 for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
3036 // make chain of links connected via continues faces
3039 if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
3041 if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
3043 vector< TChain > chains;
3044 if ( error == ERR_OK ) { // chain contains continues rectangles
3046 chains[0].splice( chains[0].begin(), rawChain );
3048 else if ( error == ERR_TRI ) { // chain contains continues triangles
3049 TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
3050 if ( res != _OK ) { // not quadrangles split into triangles
3051 fixTriaNearBoundary( rawChain, *this );
3055 else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
3056 fixPrism( rawChain );
3062 for ( int iC = 0; iC < chains.size(); ++iC )
3064 TChain& chain = chains[iC];
3065 if ( chain.empty() ) continue;
3066 if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
3067 MSG("3D straight - ignore");
3070 if ( chain.front()->MediumPos() > bndPos ||
3071 chain.back() ->MediumPos() > bndPos ) {
3072 MSG("Internal chain - ignore");
3075 // mesure chain length and compute link position along the chain
3076 double chainLen = 0;
3077 vector< double > linkPos;
3078 MSGBEG( "Link medium nodes: ");
3079 TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
3080 for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
3081 MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
3082 double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
3083 while ( len < numeric_limits<double>::min() ) { // remove degenerated link
3084 link1 = chain.erase( link1 );
3085 if ( link1 == chain.end() )
3087 len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
3090 linkPos.push_back( chainLen );
3093 if ( linkPos.size() < 2 )
3096 gp_Vec move0 = chain.front()->_nodeMove;
3097 gp_Vec move1 = chain.back ()->_nodeMove;
3100 bool checkUV = true;
3103 // compute node displacement of end links of chain in parametric space of face
3104 TChainLink& linkOnFace = *(++chain.begin());
3105 const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
3106 TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
3107 if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
3109 face = TopoDS::Face( f );
3110 Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
3112 for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
3114 TChainLink& link = is1 ? chain.back() : chain.front();
3115 gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
3116 gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
3117 gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
3118 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
3119 // uvMove = uvm - uv12
3120 gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
3121 ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
3122 if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
3123 nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
3124 isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
3125 10 * uvMove.SquareModulus());
3127 if ( isStraight[0] && isStraight[1] ) {
3128 MSG("2D straight - ignore");
3129 continue; // straight - no need to move nodes of internal links
3132 // check if a chain is already fixed
3133 gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
3134 gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
3135 gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
3136 gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
3137 if (( uvm - uv12 ).SquareModulus() > 1e-10 )
3139 MSG("Already fixed - ignore");
3145 if ( isInside || face.IsNull() )
3147 // compute node displacement of end links in their local coord systems
3149 TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
3150 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
3151 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
3152 move0.Transform(trsf);
3155 TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
3156 trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
3157 gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
3158 move1.Transform(trsf);
3161 // compute displacement of medium nodes
3162 link2 = chain.begin();
3165 for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
3167 double r = linkPos[i] / chainLen;
3168 // displacement in local coord system
3169 gp_Vec move = (1. - r) * move0 + r * move1;
3170 if ( isInside || face.IsNull()) {
3171 // transform to global
3172 gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
3173 gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
3174 gp_Vec x = x01.Normalized() + x12.Normalized();
3175 trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
3176 move.Transform(trsf);
3179 // compute 3D displacement by 2D one
3180 Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
3181 gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
3182 gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
3183 gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
3184 move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
3186 if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
3187 move.SquareMagnitude())
3189 gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
3190 gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
3191 MSG( "TOO LONG MOVE \t" <<
3192 "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
3193 "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
3194 "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
3195 "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
3199 (*link1)->Move( move );
3200 MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
3201 << chain.front()->_mediumNode->GetID() <<"-"
3202 << chain.back ()->_mediumNode->GetID() <<
3203 " by " << move.Magnitude());
3205 } // loop on chains of links
3206 } // loop on 2 directions of propagation from quadrangle
3213 // vector<const SMDS_MeshElement*> vols( 100 );
3214 // vector<double> volSize( 100 );
3217 for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
3218 if ( pLink->IsMoved() ) {
3219 gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
3220 GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
3222 // gp_Pnt pNew = pLink->MiddlePnt() + pLink->Move();
3223 // if ( pLink->MediumPos() != SMDS_TOP_3DSPACE )
3225 // // avoid making distorted volumes near boundary
3226 // SMDS_ElemIteratorPtr volIt =
3227 // (*pLink)._mediumNode->GetInverseElementIterator( SMDSAbs_Volume );
3228 // for ( nbVols = 0; volIt->more() && volTool.Set( volIt->next() ); ++nbVols )
3230 // vols [ nbVols ] = volTool.Element();
3231 // volSize[ nbVols ] = volTool.GetSize();
3233 // gp_Pnt pOld = pLink->MediumPnt();
3234 // const_cast<SMDS_MeshNode*>( pLink->_mediumNode )->setXYZ( pNew.X(), pNew.Y(), pNew.Z() );
3236 // while ( nbVols-- && ok )
3238 // volTool.Set( vols[ nbVols ]);
3239 // ok = ( volSize[ nbVols ] * volTool.GetSize() > 1e-20 );
3243 // const_cast<SMDS_MeshNode*>( pLink->_mediumNode )->setXYZ( pOld.X(), pOld.Y(), pOld.Z() );
3244 // MSG( "Do NOT move \t" << pLink->_mediumNode->GetID()
3245 // << " because of distortion of volume " << vols[ nbVols+1 ]->GetID());
3249 // GetMeshDS()->MoveNode( pLink->_mediumNode, pNew.X(), pNew.Y(), pNew.Z() );
3256 // Move the apex of pyramid together with the most curved link
3258 TIDSortedNodeSet::iterator apexIt = apexOfPyramid.begin();
3259 for ( ; apexIt != apexOfPyramid.end(); ++apexIt )
3261 SMESH_TNodeXYZ apex = *apexIt;
3263 gp_Vec maxMove( 0,0,0 );
3264 double maxMoveSize2 = 0;
3266 // shift of node index to get medium nodes between the base nodes
3267 const int base2MediumShift = 5;
3269 // find maximal movement of medium node
3270 SMDS_ElemIteratorPtr volIt = apex._node->GetInverseElementIterator( SMDSAbs_Volume );
3271 vector< const SMDS_MeshElement* > pyramids;
3272 while ( volIt->more() )
3274 const SMDS_MeshElement* pyram = volIt->next();
3275 if ( pyram->GetEntityType() != SMDSEntity_Quad_Pyramid ) continue;
3276 pyramids.push_back( pyram );
3278 for ( int iBase = 0; iBase < apexIndex; ++iBase )
3280 SMESH_TNodeXYZ medium = pyram->GetNode( iBase + base2MediumShift );
3281 if ( medium._node->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
3283 SMESH_TNodeXYZ n1 = pyram->GetNode( iBase );
3284 SMESH_TNodeXYZ n2 = pyram->GetNode( ( iBase+1 ) % 4 );
3285 gp_Pnt middle = 0.5 * ( n1 + n2 );
3286 gp_Vec move( middle, medium );
3287 double moveSize2 = move.SquareMagnitude();
3288 if ( moveSize2 > maxMoveSize2 )
3289 maxMove = move, maxMoveSize2 = moveSize2;
3295 if ( maxMoveSize2 > 1e-20 )
3297 apex += maxMove.XYZ();
3298 GetMeshDS()->MoveNode( apex._node, apex.X(), apex.Y(), apex.Z());
3300 // move medium nodes neighboring the apex to the middle
3301 const int base2MediumShift_2 = 9;
3302 for ( unsigned i = 0; i < pyramids.size(); ++i )
3303 for ( int iBase = 0; iBase < apexIndex; ++iBase )
3305 SMESH_TNodeXYZ base = pyramids[i]->GetNode( iBase );
3306 const SMDS_MeshNode* medium = pyramids[i]->GetNode( iBase + base2MediumShift_2 );
3307 gp_XYZ middle = 0.5 * ( apex + base );
3308 GetMeshDS()->MoveNode( medium, middle.X(), middle.Y(), middle.Z());