+
+//#include <Perf_Meter.hxx>
+
+//=======================================================================
+namespace { // Structures used by FixQuadraticElements()
+//=======================================================================
+
+#define __DMP__(txt) \
+ //cout << txt
+#define MSG(txt) __DMP__(txt<<endl)
+#define MSGBEG(txt) __DMP__(txt)
+
+ //const double straightTol2 = 1e-33; // to detect straing links
+ bool isStraightLink(double linkLen2, double middleNodeMove2)
+ {
+ // straight if <node move> < 1/15 * <link length>
+ return middleNodeMove2 < 1/15./15. * linkLen2;
+ }
+
+ struct QFace;
+ // ---------------------------------------
+ /*!
+ * \brief Quadratic link knowing its faces
+ */
+ struct QLink: public SMESH_TLink
+ {
+ const SMDS_MeshNode* _mediumNode;
+ mutable vector<const QFace* > _faces;
+ mutable gp_Vec _nodeMove;
+ mutable int _nbMoves;
+
+ QLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshNode* nm):
+ SMESH_TLink( n1,n2 ), _mediumNode(nm), _nodeMove(0,0,0), _nbMoves(0) {
+ _faces.reserve(4);
+ //if ( MediumPos() != SMDS_TOP_3DSPACE )
+ _nodeMove = MediumPnt() - MiddlePnt();
+ }
+ void SetContinuesFaces() const;
+ const QFace* GetContinuesFace( const QFace* face ) const;
+ bool OnBoundary() const;
+ gp_XYZ MiddlePnt() const { return ( XYZ( node1() ) + XYZ( node2() )) / 2.; }
+ gp_XYZ MediumPnt() const { return XYZ( _mediumNode ); }
+
+ SMDS_TypeOfPosition MediumPos() const
+ { return _mediumNode->GetPosition()->GetTypeOfPosition(); }
+ SMDS_TypeOfPosition EndPos(bool isSecond) const
+ { return (isSecond ? node2() : node1())->GetPosition()->GetTypeOfPosition(); }
+ const SMDS_MeshNode* EndPosNode(SMDS_TypeOfPosition pos) const
+ { return EndPos(0) == pos ? node1() : EndPos(1) == pos ? node2() : 0; }
+
+ void Move(const gp_Vec& move, bool sum=false) const
+ { _nodeMove += move; _nbMoves += sum ? (_nbMoves==0) : 1; }
+ gp_XYZ Move() const { return _nodeMove.XYZ() / _nbMoves; }
+ bool IsMoved() const { return (_nbMoves > 0 /*&& !IsStraight()*/); }
+ bool IsStraight() const
+ { return isStraightLink( (XYZ(node1())-XYZ(node2())).SquareModulus(),
+ _nodeMove.SquareMagnitude());
+ }
+ bool operator<(const QLink& other) const {
+ return (node1()->GetID() == other.node1()->GetID() ?
+ node2()->GetID() < other.node2()->GetID() :
+ node1()->GetID() < other.node1()->GetID());
+ }
+// struct PtrComparator {
+// bool operator() (const QLink* l1, const QLink* l2 ) const { return *l1 < *l2; }
+// };
+ };
+ // ---------------------------------------------------------
+ /*!
+ * \brief Link in the chain of links; it connects two faces
+ */
+ struct TChainLink
+ {
+ const QLink* _qlink;
+ mutable const QFace* _qfaces[2];
+
+ TChainLink(const QLink* qlink=0):_qlink(qlink) {
+ _qfaces[0] = _qfaces[1] = 0;
+ }
+ void SetFace(const QFace* face) const { int iF = _qfaces[0] ? 1 : 0; _qfaces[iF]=face; }
+
+ bool IsBoundary() const { return !_qfaces[1]; }
+
+ void RemoveFace( const QFace* face ) const
+ { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
+
+ const QFace* NextFace( const QFace* f ) const
+ { return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
+
+ const SMDS_MeshNode* NextNode( const SMDS_MeshNode* n ) const
+ { return n == _qlink->node1() ? _qlink->node2() : _qlink->node1(); }
+
+ bool operator<(const TChainLink& other) const { return *_qlink < *other._qlink; }
+
+ operator bool() const { return (_qlink); }
+
+ const QLink* operator->() const { return _qlink; }
+
+ gp_Vec Normal() const;
+
+ bool IsStraight() const;
+ };
+ // --------------------------------------------------------------------
+ typedef list< TChainLink > TChain;
+ typedef set < TChainLink > TLinkSet;
+ typedef TLinkSet::const_iterator TLinkInSet;
+
+ const int theFirstStep = 5;
+
+ enum { ERR_OK, ERR_TRI, ERR_PRISM, ERR_UNKNOWN }; // errors of QFace::GetLinkChain()
+ // --------------------------------------------------------------------
+ /*!
+ * \brief Face shared by two volumes and bound by QLinks
+ */
+ struct QFace: public TIDSortedNodeSet
+ {
+ mutable const SMDS_MeshElement* _volumes[2];
+ mutable vector< const QLink* > _sides;
+ mutable bool _sideIsAdded[4]; // added in chain of links
+ gp_Vec _normal;
+#ifdef _DEBUG_
+ mutable const SMDS_MeshElement* _face;
+#endif
+
+ QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face=0 );
+
+ void SetVolume(const SMDS_MeshElement* v) const { _volumes[ _volumes[0] ? 1 : 0 ] = v; }
+
+ int NbVolumes() const { return !_volumes[0] ? 0 : !_volumes[1] ? 1 : 2; }
+
+ void AddSelfToLinks() const {
+ for ( int i = 0; i < _sides.size(); ++i )
+ _sides[i]->_faces.push_back( this );
+ }
+ int LinkIndex( const QLink* side ) const {
+ for (int i=0; i<_sides.size(); ++i ) if ( _sides[i] == side ) return i;
+ return -1;
+ }
+ bool GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& err) const;
+
+ bool GetLinkChain( TChainLink& link, TChain& chain, SMDS_TypeOfPosition pos, int& err) const
+ {
+ int i = LinkIndex( link._qlink );
+ if ( i < 0 ) return true;
+ _sideIsAdded[i] = true;
+ link.SetFace( this );
+ // continue from opposite link
+ return GetLinkChain( (i+2)%_sides.size(), chain, pos, err );
+ }
+ bool IsBoundary() const { return !_volumes[1]; }
+
+ bool Contains( const SMDS_MeshNode* node ) const { return count(node); }
+
+ bool IsSpoiled(const QLink* bentLink ) const;
+
+ TLinkInSet GetBoundaryLink( const TLinkSet& links,
+ const TChainLink& avoidLink,
+ TLinkInSet * notBoundaryLink = 0,
+ const SMDS_MeshNode* nodeToContain = 0,
+ bool * isAdjacentUsed = 0,
+ int nbRecursionsLeft = -1) const;
+
+ TLinkInSet GetLinkByNode( const TLinkSet& links,
+ const TChainLink& avoidLink,
+ const SMDS_MeshNode* nodeToContain) const;
+
+ const SMDS_MeshNode* GetNodeInFace() const {
+ for ( int iL = 0; iL < _sides.size(); ++iL )
+ if ( _sides[iL]->MediumPos() == SMDS_TOP_FACE ) return _sides[iL]->_mediumNode;
+ return 0;
+ }
+
+ gp_Vec LinkNorm(const int i, SMESH_MesherHelper* theFaceHelper=0) const;
+
+ double MoveByBoundary( const TChainLink& theLink,
+ const gp_Vec& theRefVec,
+ const TLinkSet& theLinks,
+ SMESH_MesherHelper* theFaceHelper=0,
+ const double thePrevLen=0,
+ const int theStep=theFirstStep,
+ gp_Vec* theLinkNorm=0,
+ double theSign=1.0) const;
+ };
+
+ //================================================================================
+ /*!
+ * \brief Dump QLink and QFace
+ */
+ ostream& operator << (ostream& out, const QLink& l)
+ {
+ out <<"QLink nodes: "
+ << l.node1()->GetID() << " - "
+ << l._mediumNode->GetID() << " - "
+ << l.node2()->GetID() << endl;
+ return out;
+ }
+ ostream& operator << (ostream& out, const QFace& f)
+ {
+ out <<"QFace nodes: "/*<< &f << " "*/;
+ for ( TIDSortedNodeSet::const_iterator n = f.begin(); n != f.end(); ++n )
+ out << (*n)->GetID() << " ";
+ out << " \tvolumes: "
+ << (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
+ << (f._volumes[1] ? f._volumes[1]->GetID() : 0);
+ out << " \tNormal: "<< f._normal.X() <<", "<<f._normal.Y() <<", "<<f._normal.Z() << endl;
+ return out;
+ }
+
+ //================================================================================
+ /*!
+ * \brief Construct QFace from QLinks
+ */
+ //================================================================================
+
+ QFace::QFace( const vector< const QLink*>& links, const SMDS_MeshElement* face )
+ {
+ _volumes[0] = _volumes[1] = 0;
+ _sides = links;
+ _sideIsAdded[0]=_sideIsAdded[1]=_sideIsAdded[2]=_sideIsAdded[3]=false;
+ _normal.SetCoord(0,0,0);
+ for ( int i = 1; i < _sides.size(); ++i ) {
+ const QLink *l1 = _sides[i-1], *l2 = _sides[i];
+ insert( l1->node1() ); insert( l1->node2() );
+ // compute normal
+ gp_Vec v1( XYZ( l1->node2()), XYZ( l1->node1()));
+ gp_Vec v2( XYZ( l2->node1()), XYZ( l2->node2()));
+ if ( l1->node1() != l2->node1() && l1->node2() != l2->node2() )
+ v1.Reverse();
+ _normal += v1 ^ v2;
+ }
+ double normSqSize = _normal.SquareMagnitude();
+ if ( normSqSize > numeric_limits<double>::min() )
+ _normal /= sqrt( normSqSize );
+ else
+ _normal.SetCoord(1e-33,0,0);
+
+#ifdef _DEBUG_
+ _face = face;
+#endif
+ }
+ //================================================================================
+ /*!
+ * \brief Make up a chain of links
+ * \param iSide - link to add first
+ * \param chain - chain to fill in
+ * \param pos - postion of medium nodes the links should have
+ * \param error - out, specifies what is wrong
+ * \retval bool - false if valid chain can't be built; "valid" means that links
+ * of the chain belongs to rectangles bounding hexahedrons
+ */
+ //================================================================================
+
+ bool QFace::GetLinkChain( int iSide, TChain& chain, SMDS_TypeOfPosition pos, int& error) const
+ {
+ if ( iSide >= _sides.size() ) // wrong argument iSide
+ return false;
+ if ( _sideIsAdded[ iSide ]) // already in chain
+ return true;
+
+ if ( _sides.size() != 4 ) { // triangle - visit all my continous faces
+ MSGBEG( *this );
+ TLinkSet links;
+ list< const QFace* > faces( 1, this );
+ while ( !faces.empty() ) {
+ const QFace* face = faces.front();
+ for ( int i = 0; i < face->_sides.size(); ++i ) {
+ if ( !face->_sideIsAdded[i] && face->_sides[i] ) {
+ face->_sideIsAdded[i] = true;
+ // find a face side in the chain
+ TLinkInSet chLink = links.insert( TChainLink(face->_sides[i])).first;
+// TChain::iterator chLink = chain.begin();
+// for ( ; chLink != chain.end(); ++chLink )
+// if ( chLink->_qlink == face->_sides[i] )
+// break;
+// if ( chLink == chain.end() )
+// chLink = chain.insert( chain.begin(), TChainLink(face->_sides[i]));
+ // add a face to a chained link and put a continues face in the queue
+ chLink->SetFace( face );
+ if ( face->_sides[i]->MediumPos() == pos )
+ if ( const QFace* contFace = face->_sides[i]->GetContinuesFace( face ))
+ if ( contFace->_sides.size() == 3 )
+ faces.push_back( contFace );
+ }
+ }
+ faces.pop_front();
+ }
+ if ( error < ERR_TRI )
+ error = ERR_TRI;
+ chain.insert( chain.end(), links.begin(),links.end() );
+ return false;
+ }
+ _sideIsAdded[iSide] = true; // not to add this link to chain again
+ const QLink* link = _sides[iSide];
+ if ( !link)
+ return true;
+
+ // add link into chain
+ TChain::iterator chLink = chain.insert( chain.begin(), TChainLink(link));
+ chLink->SetFace( this );
+ MSGBEG( *this );
+
+ // propagate from quadrangle to neighbour faces
+ if ( link->MediumPos() >= pos ) {
+ int nbLinkFaces = link->_faces.size();
+ if ( nbLinkFaces == 4 || (/*nbLinkFaces < 4 && */link->OnBoundary())) {
+ // hexahedral mesh or boundary quadrangles - goto a continous face
+ if ( const QFace* f = link->GetContinuesFace( this ))
+ if ( f->_sides.size() == 4 )
+ return f->GetLinkChain( *chLink, chain, pos, error );
+ }
+ else {
+ TChainLink chLink(link); // side face of prismatic mesh - visit all faces of iSide
+ for ( int i = 0; i < nbLinkFaces; ++i )
+ if ( link->_faces[i] )
+ link->_faces[i]->GetLinkChain( chLink, chain, pos, error );
+ if ( error < ERR_PRISM )
+ error = ERR_PRISM;
+ return false;
+ }
+ }
+ return true;
+ }
+
+ //================================================================================
+ /*!
+ * \brief Return a boundary link of the triangle face
+ * \param links - set of all links
+ * \param avoidLink - link not to return
+ * \param notBoundaryLink - out, neither the returned link nor avoidLink
+ * \param nodeToContain - node the returned link must contain; if provided, search
+ * also performed on adjacent faces
+ * \param isAdjacentUsed - returns true if link is found in adjacent faces
+ * \param nbRecursionsLeft - to limit recursion
+ */
+ //================================================================================
+
+ TLinkInSet QFace::GetBoundaryLink( const TLinkSet& links,
+ const TChainLink& avoidLink,
+ TLinkInSet * notBoundaryLink,
+ const SMDS_MeshNode* nodeToContain,
+ bool * isAdjacentUsed,
+ int nbRecursionsLeft) const
+ {
+ TLinkInSet linksEnd = links.end(), boundaryLink = linksEnd;
+
+ typedef list< pair< const QFace*, TLinkInSet > > TFaceLinkList;
+ TFaceLinkList adjacentFaces;
+
+ for ( int iL = 0; iL < _sides.size(); ++iL )
+ {
+ if ( avoidLink._qlink == _sides[iL] )
+ continue;
+ TLinkInSet link = links.find( _sides[iL] );
+ if ( link == linksEnd ) continue;
+ if ( (*link)->MediumPos() > SMDS_TOP_FACE )
+ continue; // We work on faces here, don't go inside a solid
+
+ // check link
+ if ( link->IsBoundary() ) {
+ if ( !nodeToContain ||
+ (*link)->node1() == nodeToContain ||
+ (*link)->node2() == nodeToContain )
+ {
+ boundaryLink = link;
+ if ( !notBoundaryLink ) break;
+ }
+ }
+ else if ( notBoundaryLink ) {
+ *notBoundaryLink = link;
+ if ( boundaryLink != linksEnd ) break;
+ }
+
+ if ( boundaryLink == linksEnd && nodeToContain ) // collect adjacent faces
+ if ( const QFace* adj = link->NextFace( this ))
+ if ( adj->Contains( nodeToContain ))
+ adjacentFaces.push_back( make_pair( adj, link ));
+ }
+
+ if ( isAdjacentUsed ) *isAdjacentUsed = false;
+ if ( boundaryLink == linksEnd && nodeToContain && nbRecursionsLeft) // check adjacent faces
+ {
+ if ( nbRecursionsLeft < 0 )
+ nbRecursionsLeft = nodeToContain->NbInverseElements();
+ TFaceLinkList::iterator adj = adjacentFaces.begin();
+ for ( ; boundaryLink == linksEnd && adj != adjacentFaces.end(); ++adj )
+ boundaryLink = adj->first->GetBoundaryLink( links, *(adj->second), 0, nodeToContain,
+ isAdjacentUsed, nbRecursionsLeft-1);
+ if ( isAdjacentUsed ) *isAdjacentUsed = true;
+ }
+ return boundaryLink;
+ }
+ //================================================================================
+ /*!
+ * \brief Return a link ending at the given node but not avoidLink
+ */
+ //================================================================================
+
+ TLinkInSet QFace::GetLinkByNode( const TLinkSet& links,
+ const TChainLink& avoidLink,
+ const SMDS_MeshNode* nodeToContain) const
+ {
+ for ( int i = 0; i < _sides.size(); ++i )
+ if ( avoidLink._qlink != _sides[i] &&
+ (_sides[i]->node1() == nodeToContain || _sides[i]->node2() == nodeToContain ))
+ return links.find( _sides[ i ]);
+ return links.end();
+ }
+
+ //================================================================================
+ /*!
+ * \brief Return normal to the i-th side pointing outside the face
+ */
+ //================================================================================
+
+ gp_Vec QFace::LinkNorm(const int i, SMESH_MesherHelper* /*uvHelper*/) const
+ {
+ gp_Vec norm, vecOut;
+// if ( uvHelper ) {
+// TopoDS_Face face = TopoDS::Face( uvHelper->GetSubShape());
+// const SMDS_MeshNode* inFaceNode = uvHelper->GetNodeUVneedInFaceNode() ? GetNodeInFace() : 0;
+// gp_XY uv1 = uvHelper->GetNodeUV( face, _sides[i]->node1(), inFaceNode );
+// gp_XY uv2 = uvHelper->GetNodeUV( face, _sides[i]->node2(), inFaceNode );
+// norm.SetCoord( uv1.Y() - uv2.Y(), uv2.X() - uv1.X(), 0 );
+
+// const QLink* otherLink = _sides[(i + 1) % _sides.size()];
+// const SMDS_MeshNode* otherNode =
+// otherLink->node1() == _sides[i]->node1() ? otherLink->node2() : otherLink->node1();
+// gp_XY pIn = uvHelper->GetNodeUV( face, otherNode, inFaceNode );
+// vecOut.SetCoord( uv1.X() - pIn.X(), uv1.Y() - pIn.Y(), 0 );
+// }
+// else {
+ norm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
+ gp_XYZ pIn = ( XYZ( _sides[0]->node1() ) +
+ XYZ( _sides[0]->node2() ) +
+ XYZ( _sides[1]->node1() )) / 3.;
+ vecOut.SetXYZ( _sides[i]->MiddlePnt() - pIn );
+ //}
+ if ( norm * vecOut < 0 )
+ norm.Reverse();
+ double mag2 = norm.SquareMagnitude();
+ if ( mag2 > numeric_limits<double>::min() )
+ norm /= sqrt( mag2 );
+ return norm;
+ }
+ //================================================================================
+ /*!
+ * \brief Move medium node of theLink according to its distance from boundary
+ * \param theLink - link to fix
+ * \param theRefVec - movement of boundary
+ * \param theLinks - all adjacent links of continous triangles
+ * \param theFaceHelper - helper is not used so far
+ * \param thePrevLen - distance from the boundary
+ * \param theStep - number of steps till movement propagation limit
+ * \param theLinkNorm - out normal to theLink
+ * \param theSign - 1 or -1 depending on movement of boundary
+ * \retval double - distance from boundary to propagation limit or other boundary
+ */
+ //================================================================================
+
+ double QFace::MoveByBoundary( const TChainLink& theLink,
+ const gp_Vec& theRefVec,
+ const TLinkSet& theLinks,
+ SMESH_MesherHelper* theFaceHelper,
+ const double thePrevLen,
+ const int theStep,
+ gp_Vec* theLinkNorm,
+ double theSign) const
+ {
+ if ( !theStep )
+ return thePrevLen; // propagation limit reached
+
+ int iL; // index of theLink
+ for ( iL = 0; iL < _sides.size(); ++iL )
+ if ( theLink._qlink == _sides[ iL ])
+ break;
+
+ MSG(string(theStep,'.')<<" Ref( "<<theRefVec.X()<<","<<theRefVec.Y()<<","<<theRefVec.Z()<<" )"
+ <<" thePrevLen " << thePrevLen);
+ MSG(string(theStep,'.')<<" "<<*theLink._qlink);
+
+ gp_Vec linkNorm = -LinkNorm( iL/*, theFaceHelper*/ ); // normal to theLink
+ double refProj = theRefVec * linkNorm; // project movement vector to normal of theLink
+ if ( theStep == theFirstStep )
+ theSign = refProj < 0. ? -1. : 1.;
+ else if ( theSign * refProj < 0.4 * theRefVec.Magnitude())
+ return thePrevLen; // to propagate movement forward only, not in side dir or backward
+
+ int iL1 = (iL + 1) % 3, iL2 = (iL + 2) % 3; // indices of the two other links of triangle
+ TLinkInSet link1 = theLinks.find( _sides[iL1] );
+ TLinkInSet link2 = theLinks.find( _sides[iL2] );
+ if ( link1 == theLinks.end() || link2 == theLinks.end() )
+ return thePrevLen;
+ const QFace* f1 = link1->NextFace( this ); // adjacent faces
+ const QFace* f2 = link2->NextFace( this );
+
+ // propagate to adjacent faces till limit step or boundary
+ double len1 = thePrevLen + (theLink->MiddlePnt() - _sides[iL1]->MiddlePnt()).Modulus();
+ double len2 = thePrevLen + (theLink->MiddlePnt() - _sides[iL2]->MiddlePnt()).Modulus();
+ gp_Vec linkDir1(0,0,0); // initialize to avoid valgrind error ("Conditional jump...")
+ gp_Vec linkDir2(0,0,0);
+ try {
+ OCC_CATCH_SIGNALS;
+ if ( f1 && theLink->MediumPos() <= (*link1)->MediumPos() )
+ len1 = f1->MoveByBoundary
+ ( *link1, theRefVec, theLinks, theFaceHelper, len1, theStep-1, &linkDir1, theSign);
+ else
+ linkDir1 = LinkNorm( iL1/*, theFaceHelper*/ );
+ } catch (...) {
+ MSG( " --------------- EXCEPTION");
+ return thePrevLen;
+ }
+ try {
+ OCC_CATCH_SIGNALS;
+ if ( f2 && theLink->MediumPos() <= (*link2)->MediumPos() )
+ len2 = f2->MoveByBoundary
+ ( *link2, theRefVec, theLinks, theFaceHelper, len2, theStep-1, &linkDir2, theSign);
+ else
+ linkDir2 = LinkNorm( iL2/*, theFaceHelper*/ );
+ } catch (...) {
+ MSG( " --------------- EXCEPTION");
+ return thePrevLen;
+ }
+
+ double fullLen = 0;
+ if ( theStep != theFirstStep )
+ {
+ // choose chain length by direction of propagation most codirected with theRefVec
+ bool choose1 = ( theRefVec * linkDir1 * theSign > theRefVec * linkDir2 * theSign );
+ fullLen = choose1 ? len1 : len2;
+ double r = thePrevLen / fullLen;
+
+ gp_Vec move = linkNorm * refProj * ( 1 - r );
+ theLink->Move( move, true );
+
+ MSG(string(theStep,'.')<<" Move "<< theLink->_mediumNode->GetID()<<
+ " by " << refProj * ( 1 - r ) << " following " <<
+ (choose1 ? *link1->_qlink : *link2->_qlink));
+
+ if ( theLinkNorm ) *theLinkNorm = linkNorm;
+ }
+ return fullLen;
+ }
+
+ //================================================================================
+ /*!
+ * \brief Checks if the face is distorted due to bentLink
+ */
+ //================================================================================
+
+ bool QFace::IsSpoiled(const QLink* bentLink ) const
+ {
+ // code is valid for convex faces only
+ gp_XYZ gc(0,0,0);
+ for ( TIDSortedNodeSet::const_iterator n = begin(); n!=end(); ++n)
+ gc += XYZ( *n ) / size();
+ for (unsigned i = 0; i < _sides.size(); ++i )
+ {
+ if ( _sides[i] == bentLink ) continue;
+ gp_Vec linkNorm = _normal ^ gp_Vec( XYZ(_sides[i]->node1()), XYZ(_sides[i]->node2()));
+ gp_Vec vecOut( gc, _sides[i]->MiddlePnt() );
+ if ( linkNorm * vecOut < 0 )
+ linkNorm.Reverse();
+ double mag2 = linkNorm.SquareMagnitude();
+ if ( mag2 > numeric_limits<double>::min() )
+ linkNorm /= sqrt( mag2 );
+ gp_Vec vecBent ( _sides[i]->MiddlePnt(), bentLink->MediumPnt());
+ gp_Vec vecStraight( _sides[i]->MiddlePnt(), bentLink->MiddlePnt());
+ if ( vecBent * linkNorm > -0.1*vecStraight.Magnitude() )
+ return true;
+ }
+ return false;
+
+ }
+
+ //================================================================================
+ /*!
+ * \brief Find pairs of continues faces
+ */
+ //================================================================================
+
+ void QLink::SetContinuesFaces() const
+ {
+ // x0 x - QLink, [-|] - QFace, v - volume
+ // v0 | v1
+ // | Between _faces of link x2 two vertical faces are continues
+ // x1----x2-----x3 and two horizontal faces are continues. We set vertical faces
+ // | to _faces[0] and _faces[1] and horizontal faces to
+ // v2 | v3 _faces[2] and _faces[3] (or vise versa).
+ // x4
+
+ if ( _faces.empty() )
+ return;
+ int iFaceCont = -1, nbBoundary = 0, iBoundary[2]={-1,-1};
+ if ( _faces[0]->IsBoundary() )
+ iBoundary[ nbBoundary++ ] = 0;
+ for ( int iF = 1; iFaceCont < 0 && iF < _faces.size(); ++iF )
+ {
+ // look for a face bounding none of volumes bound by _faces[0]
+ bool sameVol = false;
+ int nbVol = _faces[iF]->NbVolumes();
+ for ( int iV = 0; !sameVol && iV < nbVol; ++iV )
+ sameVol = ( _faces[iF]->_volumes[iV] == _faces[0]->_volumes[0] ||
+ _faces[iF]->_volumes[iV] == _faces[0]->_volumes[1]);
+ if ( !sameVol )
+ iFaceCont = iF;
+ if ( _faces[iF]->IsBoundary() )
+ iBoundary[ nbBoundary++ ] = iF;
+ }
+ // Set continues faces: arrange _faces to have
+ // _faces[0] continues to _faces[1]
+ // _faces[2] continues to _faces[3]
+ if ( nbBoundary == 2 ) // bnd faces are continues
+ {
+ if (( iBoundary[0] < 2 ) != ( iBoundary[1] < 2 ))
+ {
+ int iNear0 = iBoundary[0] < 2 ? 1-iBoundary[0] : 5-iBoundary[0];
+ std::swap( _faces[ iBoundary[1] ], _faces[iNear0] );
+ }
+ }
+ else if ( iFaceCont > 0 ) // continues faces found
+ {
+ if ( iFaceCont != 1 )
+ std::swap( _faces[1], _faces[iFaceCont] );
+ }
+ else if ( _faces.size() > 1 ) // not found, set NULL by the first face
+ {
+ _faces.insert( ++_faces.begin(), 0 );
+ }
+ }
+ //================================================================================
+ /*!
+ * \brief Return a face continues to the given one
+ */
+ //================================================================================
+
+ const QFace* QLink::GetContinuesFace( const QFace* face ) const
+ {
+ for ( int i = 0; i < _faces.size(); ++i ) {
+ if ( _faces[i] == face ) {
+ int iF = i < 2 ? 1-i : 5-i;
+ return iF < _faces.size() ? _faces[iF] : 0;
+ }
+ }
+ return 0;
+ }
+ //================================================================================
+ /*!
+ * \brief True if link is on mesh boundary
+ */
+ //================================================================================
+
+ bool QLink::OnBoundary() const
+ {
+ for ( int i = 0; i < _faces.size(); ++i )
+ if (_faces[i] && _faces[i]->IsBoundary()) return true;
+ return false;
+ }
+ //================================================================================
+ /*!
+ * \brief Return normal of link of the chain
+ */
+ //================================================================================
+
+ gp_Vec TChainLink::Normal() const {
+ gp_Vec norm;
+ if (_qfaces[0]) norm = _qfaces[0]->_normal;
+ if (_qfaces[1]) norm += _qfaces[1]->_normal;
+ return norm;
+ }
+ //================================================================================
+ /*!
+ * \brief Test link curvature taking into account size of faces
+ */
+ //================================================================================
+
+ bool TChainLink::IsStraight() const
+ {
+ bool isStraight = _qlink->IsStraight();
+ if ( isStraight && _qfaces[0] && !_qfaces[1] )
+ {
+ int i = _qfaces[0]->LinkIndex( _qlink );
+ int iOpp = ( i + 2 ) % _qfaces[0]->_sides.size();
+ gp_XYZ mid1 = _qlink->MiddlePnt();
+ gp_XYZ mid2 = _qfaces[0]->_sides[ iOpp ]->MiddlePnt();
+ double faceSize2 = (mid1-mid2).SquareModulus();
+ isStraight = _qlink->_nodeMove.SquareMagnitude() < 1/10./10. * faceSize2;
+ }
+ return isStraight;
+ }
+
+ //================================================================================
+ /*!
+ * \brief Move medium nodes of vertical links of pentahedrons adjacent by side faces
+ */
+ //================================================================================
+
+ void fixPrism( TChain& allLinks )
+ {
+ // separate boundary links from internal ones
+ typedef set<const QLink*/*, QLink::PtrComparator*/> QLinkSet;
+ QLinkSet interLinks, bndLinks1, bndLink2;
+
+ bool isCurved = false;
+ for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
+ if ( (*lnk)->OnBoundary() )
+ bndLinks1.insert( lnk->_qlink );
+ else
+ interLinks.insert( lnk->_qlink );
+ isCurved = isCurved || !lnk->IsStraight();
+ }
+ if ( !isCurved )
+ return; // no need to move
+
+ QLinkSet *curBndLinks = &bndLinks1, *newBndLinks = &bndLink2;
+
+ while ( !interLinks.empty() && !curBndLinks->empty() )
+ {
+ // propagate movement from boundary links to connected internal links
+ QLinkSet::iterator bnd = curBndLinks->begin(), bndEnd = curBndLinks->end();
+ for ( ; bnd != bndEnd; ++bnd )
+ {
+ const QLink* bndLink = *bnd;
+ for ( int i = 0; i < bndLink->_faces.size(); ++i ) // loop on faces of bndLink
+ {
+ const QFace* face = bndLink->_faces[i]; // quadrange lateral face of a prism
+ if ( !face ) continue;
+ // find and move internal link opposite to bndLink within the face
+ int interInd = ( face->LinkIndex( bndLink ) + 2 ) % face->_sides.size();
+ const QLink* interLink = face->_sides[ interInd ];
+ QLinkSet::iterator pInterLink = interLinks.find( interLink );
+ if ( pInterLink == interLinks.end() ) continue; // not internal link
+ interLink->Move( bndLink->_nodeMove );
+ // treated internal links become new boundary ones
+ interLinks. erase( pInterLink );
+ newBndLinks->insert( interLink );
+ }
+ }
+ curBndLinks->clear();
+ std::swap( curBndLinks, newBndLinks );
+ }
+ }
+
+ //================================================================================
+ /*!
+ * \brief Fix links of continues triangles near curved boundary
+ */
+ //================================================================================
+
+ void fixTriaNearBoundary( TChain & allLinks, SMESH_MesherHelper& /*helper*/)
+ {
+ if ( allLinks.empty() ) return;
+
+ TLinkSet linkSet( allLinks.begin(), allLinks.end());
+ TLinkInSet linkIt = linkSet.begin(), linksEnd = linkSet.end();
+
+ for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt)
+ {
+ if ( linkIt->IsBoundary() && !linkIt->IsStraight() && linkIt->_qfaces[0])
+ {
+ // move iff a boundary link is bent towards inside of a face (issue 0021084)
+ const QFace* face = linkIt->_qfaces[0];
+ gp_XYZ pIn = ( face->_sides[0]->MiddlePnt() +
+ face->_sides[1]->MiddlePnt() +
+ face->_sides[2]->MiddlePnt() ) / 3.;
+ gp_XYZ insideDir( pIn - (*linkIt)->MiddlePnt());
+ bool linkBentInside = ((*linkIt)->_nodeMove.Dot( insideDir ) > 0 );
+ //if ( face->IsSpoiled( linkIt->_qlink ))
+ if ( linkBentInside )
+ face->MoveByBoundary( *linkIt, (*linkIt)->_nodeMove, linkSet );
+ }
+ }
+ }
+
+ //================================================================================
+ /*!
+ * \brief Detect rectangular structure of links and build chains from them
+ */
+ //================================================================================
+
+ enum TSplitTriaResult {
+ _OK, _NO_CORNERS, _FEW_ROWS, _MANY_ROWS, _NO_SIDELINK, _BAD_MIDQUAD, _NOT_RECT,
+ _NO_MIDQUAD, _NO_UPTRIA, _BAD_SET_SIZE, _BAD_CORNER, _BAD_START, _NO_BOTLINK, _TWISTED_CHAIN };
+
+ TSplitTriaResult splitTrianglesIntoChains( TChain & allLinks,
+ vector< TChain> & resultChains,
+ SMDS_TypeOfPosition pos )
+ {
+ // put links in the set and evalute number of result chains by number of boundary links
+ TLinkSet linkSet;
+ int nbBndLinks = 0;
+ for ( TChain::iterator lnk = allLinks.begin(); lnk != allLinks.end(); ++lnk ) {
+ linkSet.insert( *lnk );
+ nbBndLinks += lnk->IsBoundary();
+ }
+ resultChains.clear();
+ resultChains.reserve( nbBndLinks / 2 );
+
+ TLinkInSet linkIt, linksEnd = linkSet.end();
+
+ // find a boundary link with corner node; corner node has position pos-2
+ // i.e. SMDS_TOP_VERTEX for links on faces and SMDS_TOP_EDGE for
+ // links in volume
+ SMDS_TypeOfPosition cornerPos = SMDS_TypeOfPosition(pos-2);
+ const SMDS_MeshNode* corner = 0;
+ for ( linkIt = linkSet.begin(); linkIt != linksEnd; ++linkIt )
+ if ( linkIt->IsBoundary() && (corner = (*linkIt)->EndPosNode(cornerPos)))
+ break;
+ if ( !corner)
+ return _NO_CORNERS;
+
+ TLinkInSet startLink = linkIt;
+ const SMDS_MeshNode* startCorner = corner;
+ vector< TChain* > rowChains;
+ int iCol = 0;
+
+ while ( startLink != linksEnd) // loop on columns
+ {
+ // We suppose we have a rectangular structure like shown here. We have found a
+ // corner of the rectangle (startCorner) and a boundary link sharing
+ // |/ |/ | the startCorner (startLink). We are going to loop on rows of the
+ // --o---o---o structure making several chains at once. One chain (columnChain)
+ // |\ | /| starts at startLink and continues upward (we look at the structure
+ // \ | \ | / | from such point that startLink is on the bottom of the structure).
+ // \| \|/ | While going upward we also fill horizontal chains (rowChains) we
+ // --o---o---o encounter.
+ // /|\ |\ |
+ // / | \ | \ | startCorner
+ // | \| \|,'
+ // --o---o---o
+ // `.startLink
+
+ if ( resultChains.size() == nbBndLinks / 2 )
+ return _NOT_RECT;
+ resultChains.push_back( TChain() );
+ TChain& columnChain = resultChains.back();
+
+ TLinkInSet botLink = startLink; // current horizontal link to go up from
+ corner = startCorner; // current corner the botLink ends at
+ int iRow = 0;
+ while ( botLink != linksEnd ) // loop on rows
+ {
+ // add botLink to the columnChain
+ columnChain.push_back( *botLink );
+
+ const QFace* botTria = botLink->_qfaces[0]; // bottom triangle bound by botLink
+ if ( !botTria )
+ { // the column ends
+ if ( botLink == startLink )
+ return _TWISTED_CHAIN; // issue 0020951
+ linkSet.erase( botLink );
+ if ( iRow != rowChains.size() )
+ return _FEW_ROWS; // different nb of rows in columns
+ break;
+ }
+ // find the link dividing the quadrangle (midQuadLink) and vertical boundary
+ // link ending at <corner> (sideLink); there are two cases:
+ // 1) midQuadLink does not end at <corner>, then we easily find it by botTria,
+ // since midQuadLink is not at boundary while sideLink is.
+ // 2) midQuadLink ends at <corner>
+ bool isCase2;
+ TLinkInSet midQuadLink = linksEnd;
+ TLinkInSet sideLink = botTria->GetBoundaryLink( linkSet, *botLink, &midQuadLink,
+ corner, &isCase2 );
+ if ( isCase2 ) { // find midQuadLink among links of botTria
+ midQuadLink = botTria->GetLinkByNode( linkSet, *botLink, corner );
+ if ( midQuadLink->IsBoundary() )
+ return _BAD_MIDQUAD;
+ }
+ if ( sideLink == linksEnd || midQuadLink == linksEnd || sideLink == midQuadLink )
+ return sideLink == linksEnd ? _NO_SIDELINK : _NO_MIDQUAD;
+
+ // fill chains
+ columnChain.push_back( *midQuadLink );
+ if ( iRow >= rowChains.size() ) {
+ if ( iCol > 0 )
+ return _MANY_ROWS; // different nb of rows in columns
+ if ( resultChains.size() == nbBndLinks / 2 )
+ return _NOT_RECT;
+ resultChains.push_back( TChain() );
+ rowChains.push_back( & resultChains.back() );
+ }
+ rowChains[iRow]->push_back( *sideLink );
+ rowChains[iRow]->push_back( *midQuadLink );
+
+ const QFace* upTria = midQuadLink->NextFace( botTria ); // upper tria of the rectangle
+ if ( !upTria)
+ return _NO_UPTRIA;
+ if ( iRow == 0 ) {
+ // prepare startCorner and startLink for the next column
+ startCorner = startLink->NextNode( startCorner );
+ if (isCase2)
+ startLink = botTria->GetBoundaryLink( linkSet, *botLink, 0, startCorner );
+ else
+ startLink = upTria->GetBoundaryLink( linkSet, *midQuadLink, 0, startCorner );
+ // check if no more columns remains
+ if ( startLink != linksEnd ) {
+ const SMDS_MeshNode* botNode = startLink->NextNode( startCorner );
+ if ( (isCase2 ? botTria : upTria)->Contains( botNode ))
+ startLink = linksEnd; // startLink bounds upTria or botTria
+ else if ( startLink == botLink || startLink == midQuadLink || startLink == sideLink )
+ return _BAD_START;
+ }
+ }
+ // find bottom link and corner for the next row
+ corner = sideLink->NextNode( corner );
+ // next bottom link ends at the new corner
+ linkSet.erase( botLink );
+ botLink = upTria->GetLinkByNode( linkSet, (isCase2 ? *sideLink : *midQuadLink), corner );
+ if ( botLink == linksEnd || botLink == midQuadLink || botLink == sideLink)
+ return _NO_BOTLINK;
+ if ( midQuadLink == startLink || sideLink == startLink )
+ return _TWISTED_CHAIN; // issue 0020951
+ linkSet.erase( midQuadLink );
+ linkSet.erase( sideLink );
+
+ // make faces neighboring the found ones be boundary
+ if ( startLink != linksEnd ) {
+ const QFace* tria = isCase2 ? botTria : upTria;
+ for ( int iL = 0; iL < 3; ++iL ) {
+ linkIt = linkSet.find( tria->_sides[iL] );
+ if ( linkIt != linksEnd )
+ linkIt->RemoveFace( tria );
+ }
+ }
+ if ( botLink->_qfaces[0] == upTria || botLink->_qfaces[1] == upTria )
+ botLink->RemoveFace( upTria ); // make next botTria first in vector
+
+ iRow++;
+ } // loop on rows
+
+ iCol++;
+ }
+ // In the linkSet, there must remain the last links of rowChains; add them
+ if ( linkSet.size() != rowChains.size() )
+ return _BAD_SET_SIZE;
+ for ( int iRow = 0; iRow < rowChains.size(); ++iRow ) {
+ // find the link (startLink) ending at startCorner
+ corner = 0;
+ for ( startLink = linkSet.begin(); startLink != linksEnd; ++startLink ) {
+ if ( (*startLink)->node1() == startCorner ) {
+ corner = (*startLink)->node2(); break;
+ }
+ else if ( (*startLink)->node2() == startCorner) {
+ corner = (*startLink)->node1(); break;
+ }
+ }
+ if ( startLink == linksEnd )
+ return _BAD_CORNER;
+ rowChains[ iRow ]->push_back( *startLink );
+ linkSet.erase( startLink );
+ startCorner = corner;
+ }
+
+ return _OK;
+ }
+
+ //================================================================================
+ /*!
+ * \brief Place medium nodes at the link middle for elements whose corner nodes
+ * are out of geometrical boundary to prevent distorting elements.
+ * Issue 0020982, note 0013990
+ */
+ //================================================================================
+
+ void force3DOutOfBoundary( SMESH_MesherHelper& theHelper,
+ SMESH_ComputeErrorPtr& theError)
+ {
+ SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
+ TopoDS_Shape shape = theHelper.GetSubShape().Oriented( TopAbs_FORWARD );
+ if ( shape.IsNull() ) return;
+
+ if ( !theError ) theError = SMESH_ComputeError::New();
+
+ gp_XYZ faceNorm;
+
+ if ( shape.ShapeType() == TopAbs_FACE ) // 2D
+ {
+ if ( theHelper.GetMesh()->NbTriangles( ORDER_QUADRATIC ) < 1 ) return;
+
+ SMESHDS_SubMesh* faceSM = meshDS->MeshElements( shape );
+ if ( !faceSM ) return;
+
+ const TopoDS_Face& face = TopoDS::Face( shape );
+ Handle(Geom_Surface) surface = BRep_Tool::Surface( face );
+
+ TopExp_Explorer edgeIt( face, TopAbs_EDGE );
+ for ( ; edgeIt.More(); edgeIt.Next() ) // loop on EDGEs of a FACE
+ {
+ // check if the EDGE needs checking
+ const TopoDS_Edge& edge = TopoDS::Edge( edgeIt.Current() );
+ if ( BRep_Tool::Degenerated( edge ) )
+ continue;
+ if ( theHelper.IsRealSeam( edge ) &&
+ edge.Orientation() == TopAbs_REVERSED )
+ continue;
+
+ SMESHDS_SubMesh* edgeSM = meshDS->MeshElements( edge );
+ if ( !edgeSM ) continue;
+
+ double f,l;
+ Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
+ BRepAdaptor_Curve curve3D( edge );
+ switch ( curve3D.GetType() ) {
+ case GeomAbs_Line: continue;
+ case GeomAbs_Circle:
+ case GeomAbs_Ellipse:
+ case GeomAbs_Hyperbola:
+ case GeomAbs_Parabola:
+ try
+ {
+ gp_Vec D1, D2, Du1, Dv1; gp_Pnt p;
+ curve3D.D2( 0.5 * ( f + l ), p, D1, D2 );
+ gp_Pnt2d uv = pcurve->Value( 0.5 * ( f + l ) );
+ surface->D1( uv.X(), uv.Y(), p, Du1, Dv1 );
+ gp_Vec fNorm = Du1 ^ Dv1;
+ if ( fNorm.IsParallel( D2, M_PI * 25./180. ))
+ continue; // face is normal to the curve3D
+
+ gp_Vec curvNorm = fNorm ^ D1;
+ if ( edge.Orientation() == TopAbs_REVERSED ) curvNorm.Reverse();
+ if ( curvNorm * D2 > 0 )
+ continue; // convex edge
+ }
+ catch ( Standard_Failure )
+ {
+ continue;
+ }
+ }
+ // get nodes shared by faces that may be distorted
+ SMDS_NodeIteratorPtr nodeIt;
+ if ( edgeSM->NbNodes() > 0 ) {
+ nodeIt = edgeSM->GetNodes();
+ }
+ else {
+ SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( theHelper.IthVertex( 0, edge ));
+ if ( !vertexSM )
+ vertexSM = meshDS->MeshElements( theHelper.IthVertex( 1, edge ));
+ if ( !vertexSM ) continue;
+ nodeIt = vertexSM->GetNodes();
+ }
+
+ // find suspicious faces
+ TIDSortedElemSet checkedFaces;
+ vector< const SMDS_MeshNode* > nOnEdge( 2 );
+ const SMDS_MeshNode* nOnFace;
+ while ( nodeIt->more() )
+ {
+ const SMDS_MeshNode* n = nodeIt->next();
+ SMDS_ElemIteratorPtr faceIt = n->GetInverseElementIterator( SMDSAbs_Face );
+ while ( faceIt->more() )
+ {
+ const SMDS_MeshElement* f = faceIt->next();
+ if ( !faceSM->Contains( f ) ||
+ f->NbNodes() != 6 || // check quadratic triangles only
+ !checkedFaces.insert( f ).second )
+ continue;
+
+ // get nodes on EDGE and on FACE of a suspicious face
+ nOnEdge.clear(); nOnFace = 0;
+ SMDS_MeshElement::iterator triNode = f->begin_nodes();
+ for ( int nbN = 0; nbN < 3; ++triNode, ++nbN )
+ {
+ n = *triNode;
+ if ( n->GetPosition()->GetDim() == 2 )
+ nOnFace = n;
+ else
+ nOnEdge.push_back( n );
+ }
+
+ // check if nOnFace is inside the FACE
+ if ( nOnFace && nOnEdge.size() == 2 )
+ {
+ theHelper.AddTLinks( static_cast< const SMDS_MeshFace* > ( f ));
+ if ( !SMESH_Algo::FaceNormal( f, faceNorm, /*normalized=*/false ))
+ continue;
+ gp_XYZ edgeDir = SMESH_TNodeXYZ( nOnEdge[0] ) - SMESH_TNodeXYZ( nOnEdge[1] );
+ gp_XYZ edgeNorm = faceNorm ^ edgeDir;
+ n = theHelper.GetMediumNode( nOnEdge[0], nOnEdge[1], true );
+ gp_XYZ pN0 = SMESH_TNodeXYZ( nOnEdge[0] );
+ gp_XYZ pMedium = SMESH_TNodeXYZ( n ); // on-edge node location
+ gp_XYZ pFaceN = SMESH_TNodeXYZ( nOnFace ); // on-face node location
+ double hMedium = edgeNorm * gp_Vec( pN0, pMedium ).XYZ();
+ double hFace = edgeNorm * gp_Vec( pN0, pFaceN ).XYZ();
+ if ( Abs( hMedium ) > Abs( hFace * 0.6 ))
+ {
+ // nOnFace is out of FACE, move a medium on-edge node to the middle
+ gp_XYZ pMid3D = 0.5 * ( pN0 + SMESH_TNodeXYZ( nOnEdge[1] ));
+ meshDS->MoveNode( n, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
+ MSG( "move OUT of face " << n );
+ theError->myBadElements.push_back( f );
+ }
+ }
+ }
+ }
+ }
+ if ( !theError->myBadElements.empty() )
+ theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
+ return;
+
+ } // 2D ==============================================================================
+
+ if ( shape.ShapeType() == TopAbs_SOLID ) // 3D
+ {
+ if ( theHelper.GetMesh()->NbTetras ( ORDER_QUADRATIC ) < 1 &&
+ theHelper.GetMesh()->NbPyramids( ORDER_QUADRATIC ) < 1 ) return;
+
+ SMESHDS_SubMesh* solidSM = meshDS->MeshElements( shape );
+ if ( !solidSM ) return;
+
+ // check if the SOLID is bound by concave FACEs
+ vector< TopoDS_Face > concaveFaces;
+ TopExp_Explorer faceIt( shape, TopAbs_FACE );
+ for ( ; faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
+ {
+ const TopoDS_Face& face = TopoDS::Face( faceIt.Current() );
+ if ( !meshDS->MeshElements( face )) continue;
+
+ BRepAdaptor_Surface surface( face );
+ switch ( surface.GetType() ) {
+ case GeomAbs_Plane: continue;
+ case GeomAbs_Cylinder:
+ case GeomAbs_Cone:
+ case GeomAbs_Sphere:
+ try
+ {
+ double u = 0.5 * ( surface.FirstUParameter() + surface.LastUParameter() );
+ double v = 0.5 * ( surface.FirstVParameter() + surface.LastVParameter() );
+ gp_Vec Du1, Dv1, Du2, Dv2, Duv2; gp_Pnt p;
+ surface.D2( u,v, p, Du1, Dv1, Du2, Dv2, Duv2 );
+ gp_Vec fNorm = Du1 ^ Dv1;
+ if ( face.Orientation() == TopAbs_REVERSED ) fNorm.Reverse();
+ bool concaveU = ( fNorm * Du2 > 1e-100 );
+ bool concaveV = ( fNorm * Dv2 > 1e-100 );
+ if ( concaveU || concaveV )
+ concaveFaces.push_back( face );
+ }
+ catch ( Standard_Failure )
+ {
+ concaveFaces.push_back( face );
+ }
+ }
+ }
+ if ( concaveFaces.empty() )
+ return;
+
+ // fix 2D mesh on the SOLID
+ for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
+ {
+ SMESH_MesherHelper faceHelper( *theHelper.GetMesh() );
+ faceHelper.SetSubShape( faceIt.Current() );
+ force3DOutOfBoundary( faceHelper, theError );
+ }
+
+ // get an iterator over faces on concaveFaces
+ vector< SMDS_ElemIteratorPtr > faceIterVec( concaveFaces.size() );
+ for ( size_t i = 0; i < concaveFaces.size(); ++i )
+ faceIterVec[i] = meshDS->MeshElements( concaveFaces[i] )->GetElements();
+ typedef SMDS_IteratorOnIterators
+ < const SMDS_MeshElement*, vector< SMDS_ElemIteratorPtr > > TIterOnIter;
+ SMDS_ElemIteratorPtr faceIter( new TIterOnIter( faceIterVec ));
+
+ // a seacher to check if a volume is close to a concave face
+ std::auto_ptr< SMESH_ElementSearcher > faceSearcher
+ ( SMESH_MeshEditor( theHelper.GetMesh() ).GetElementSearcher( faceIter ));
+
+ // classifier
+ //BRepClass3d_SolidClassifier solidClassifier( shape );
+
+ TIDSortedElemSet checkedVols, movedNodes;
+ for ( faceIt.ReInit(); faceIt.More(); faceIt.Next() ) // loop on FACEs of a SOLID
+ {
+ const TopoDS_Shape& face = faceIt.Current();
+ SMESHDS_SubMesh* faceSM = meshDS->MeshElements( face );
+ if ( !faceSM ) continue;
+
+ // get nodes shared by volumes (tet and pyra) on the FACE that may be distorted
+ SMDS_NodeIteratorPtr nodeIt;
+ if ( faceSM->NbNodes() > 0 ) {
+ nodeIt = faceSM->GetNodes();
+ }
+ else {
+ TopExp_Explorer vertex( face, TopAbs_VERTEX );
+ SMESHDS_SubMesh* vertexSM = meshDS->MeshElements( vertex.Current() );
+ if ( !vertexSM ) continue;
+ nodeIt = vertexSM->GetNodes();
+ }
+
+ // find suspicious volumes adjacent to the FACE
+ vector< const SMDS_MeshNode* > nOnFace( 4 );
+ const SMDS_MeshNode* nInSolid;
+ //vector< const SMDS_MeshElement* > intersectedFaces;
+ while ( nodeIt->more() )
+ {
+ const SMDS_MeshNode* n = nodeIt->next();
+ SMDS_ElemIteratorPtr volIt = n->GetInverseElementIterator( SMDSAbs_Volume );
+ while ( volIt->more() )
+ {
+ const SMDS_MeshElement* vol = volIt->next();
+ int nbN = vol->NbCornerNodes();
+ if ( ( nbN != 4 && nbN != 5 ) ||
+ !solidSM->Contains( vol ) ||
+ !checkedVols.insert( vol ).second )
+ continue;
+
+ // get nodes on FACE and in SOLID of a suspicious volume
+ nOnFace.clear(); nInSolid = 0;
+ SMDS_MeshElement::iterator volNode = vol->begin_nodes();
+ for ( int nb = nbN; nb > 0; ++volNode, --nb )
+ {
+ n = *volNode;
+ if ( n->GetPosition()->GetDim() == 3 )
+ nInSolid = n;
+ else
+ nOnFace.push_back( n );
+ }
+ if ( !nInSolid || nOnFace.size() != nbN - 1 )
+ continue;
+
+ // get size of the vol
+ SMESH_TNodeXYZ pInSolid( nInSolid ), pOnFace0( nOnFace[0] );
+ double volLength = pInSolid.SquareDistance( nOnFace[0] );
+ for ( size_t i = 1; i < nOnFace.size(); ++i )
+ {
+ volLength = Max( volLength, pOnFace0.SquareDistance( nOnFace[i] ));
+ }
+
+ // check if vol is close to concaveFaces
+ const SMDS_MeshElement* closeFace =
+ faceSearcher->FindClosestTo( pInSolid, SMDSAbs_Face );
+ if ( !closeFace ||
+ pInSolid.SquareDistance( closeFace->GetNode(0) ) > 4 * volLength )
+ continue;
+
+ // check if vol is distorted, i.e. a medium node is much closer
+ // to nInSolid than the link middle
+ bool isDistorted = false;
+ SMDS_FaceOfNodes onFaceTria( nOnFace[0], nOnFace[1], nOnFace[2] );
+ if ( !SMESH_Algo::FaceNormal( &onFaceTria, faceNorm, /*normalized=*/false ))
+ continue;
+ theHelper.AddTLinks( static_cast< const SMDS_MeshVolume* > ( vol ));
+ vector< pair< SMESH_TLink, const SMDS_MeshNode* > > links;
+ for ( size_t i = 0; i < nOnFace.size(); ++i ) // loop on links between nOnFace
+ for ( size_t j = i+1; j < nOnFace.size(); ++j )
+ {
+ SMESH_TLink link( nOnFace[i], nOnFace[j] );
+ TLinkNodeMap::const_iterator linkIt =
+ theHelper.GetTLinkNodeMap().find( link );
+ if ( linkIt != theHelper.GetTLinkNodeMap().end() )
+ {
+ links.push_back( make_pair( linkIt->first, linkIt->second ));
+ if ( !isDistorted ) {
+ // compare projections of nInSolid and nMedium to face normal
+ gp_Pnt pMedium = SMESH_TNodeXYZ( linkIt->second );
+ double hMedium = faceNorm * gp_Vec( pOnFace0, pMedium ).XYZ();
+ double hVol = faceNorm * gp_Vec( pOnFace0, pInSolid ).XYZ();
+ isDistorted = ( Abs( hMedium ) > Abs( hVol * 0.5 ));
+ }
+ }
+ }
+ // move medium nodes to link middle
+ if ( isDistorted )
+ {
+ for ( size_t i = 0; i < links.size(); ++i )
+ {
+ const SMDS_MeshNode* nMedium = links[i].second;
+ if ( movedNodes.insert( nMedium ).second )
+ {
+ gp_Pnt pMid3D = 0.5 * ( SMESH_TNodeXYZ( links[i].first.node1() ) +
+ SMESH_TNodeXYZ( links[i].first.node2() ));
+ meshDS->MoveNode( nMedium, pMid3D.X(), pMid3D.Y(), pMid3D.Z() );
+ MSG( "move OUT of solid " << nMedium );
+ }
+ }
+ theError->myBadElements.push_back( vol );
+ }
+ } // loop on volumes sharing a node on FACE
+ } // loop on nodes on FACE
+ } // loop on FACEs of a SOLID
+
+ if ( !theError->myBadElements.empty() )
+ theError->myName = EDITERR_NO_MEDIUM_ON_GEOM;
+ } // 3D case
+ }
+
+} //namespace
+
+//=======================================================================
+/*!
+ * \brief Move medium nodes of faces and volumes to fix distorted elements
+ * \param error - container of fixed distorted elements
+ * \param volumeOnly - to fix nodes on faces or not, if the shape is solid
+ *
+ * Issue 0020307: EDF 992 SMESH : Linea/Quadratic with Medium Node on Geometry
+ */
+//=======================================================================
+
+void SMESH_MesherHelper::FixQuadraticElements(SMESH_ComputeErrorPtr& error,
+ bool volumeOnly)
+{
+ // setenv NO_FixQuadraticElements to know if FixQuadraticElements() is guilty of bad conversion
+ if ( getenv("NO_FixQuadraticElements") )
+ return;
+
+ // 0. Apply algorithm to SOLIDs or FACEs
+ // ----------------------------------------------
+ if ( myShape.IsNull() ) {
+ if ( !myMesh->HasShapeToMesh() ) return;
+ SetSubShape( myMesh->GetShapeToMesh() );
+
+#ifdef _DEBUG_
+ int nbSolids = 0;
+ TopTools_IndexedMapOfShape solids;
+ TopExp::MapShapes(myShape,TopAbs_SOLID,solids);
+ nbSolids = solids.Extent();
+#endif
+ TopTools_MapOfShape faces; // faces not in solid or in not meshed solid
+ for ( TopExp_Explorer f(myShape,TopAbs_FACE,TopAbs_SOLID); f.More(); f.Next() ) {
+ faces.Add( f.Current() ); // not in solid
+ }
+ for ( TopExp_Explorer s(myShape,TopAbs_SOLID); s.More(); s.Next() ) {
+ if ( myMesh->GetSubMesh( s.Current() )->IsEmpty() ) { // get faces of solid
+ for ( TopExp_Explorer f( s.Current(), TopAbs_FACE); f.More(); f.Next() )
+ faces.Add( f.Current() ); // in not meshed solid
+ }
+ else { // fix nodes in the solid and its faces
+#ifdef _DEBUG_
+ MSG("FIX SOLID " << nbSolids-- << " #" << GetMeshDS()->ShapeToIndex(s.Current()));
+#endif
+ SMESH_MesherHelper h(*myMesh);
+ h.SetSubShape( s.Current() );
+ h.FixQuadraticElements( error, false );
+ }
+ }
+ // fix nodes on geom faces
+#ifdef _DEBUG_
+ int nbfaces = faces.Extent(); /*avoid "unused varianbles": */ nbfaces++, nbfaces--;
+#endif
+ for ( TopTools_MapIteratorOfMapOfShape fIt( faces ); fIt.More(); fIt.Next() ) {
+ MSG("FIX FACE " << nbfaces-- << " #" << GetMeshDS()->ShapeToIndex(fIt.Key()));
+ SMESH_MesherHelper h(*myMesh);
+ h.SetSubShape( fIt.Key() );
+ h.FixQuadraticElements( error, true);
+ h.ToFixNodeParameters(true);
+ }
+ //perf_print_all_meters(1);
+ if ( error && error->myName == EDITERR_NO_MEDIUM_ON_GEOM )
+ error->myComment = "during conversion to quadratic, "
+ "some medium nodes were not placed on geometry to avoid distorting elements";
+ return;
+ }
+
+ // 1. Find out type of elements and get iterator on them
+ // ---------------------------------------------------
+
+ SMDS_ElemIteratorPtr elemIt;
+ SMDSAbs_ElementType elemType = SMDSAbs_All;
+
+ SMESH_subMesh* submesh = myMesh->GetSubMeshContaining( myShapeID );
+ if ( !submesh )
+ return;
+ if ( SMESHDS_SubMesh* smDS = submesh->GetSubMeshDS() ) {
+ elemIt = smDS->GetElements();
+ if ( elemIt->more() ) {
+ elemType = elemIt->next()->GetType();
+ elemIt = smDS->GetElements();
+ }
+ }
+ if ( !elemIt || !elemIt->more() || elemType < SMDSAbs_Face )
+ return;
+
+ // 2. Fill in auxiliary data structures
+ // ----------------------------------
+
+ set< QLink > links;
+ set< QFace > faces;
+ set< QLink >::iterator pLink;
+ set< QFace >::iterator pFace;
+
+ bool isCurved = false;
+ //bool hasRectFaces = false;
+ //set<int> nbElemNodeSet;
+ SMDS_VolumeTool volTool;
+
+ TIDSortedNodeSet apexOfPyramid;
+ const int apexIndex = 4;
+
+ // Issue 0020982
+ // Move medium nodes to the link middle for elements whose corner nodes
+ // are out of geometrical boundary to fix distorted elements.
+ force3DOutOfBoundary( *this, error );
+
+ if ( elemType == SMDSAbs_Volume )
+ {
+ while ( elemIt->more() ) // loop on volumes
+ {
+ const SMDS_MeshElement* vol = elemIt->next();
+ if ( !vol->IsQuadratic() || !volTool.Set( vol ))
+ return;
+ double volMinSize2 = -1.;
+ for ( int iF = 0; iF < volTool.NbFaces(); ++iF ) // loop on faces of volume
+ {
+ int nbN = volTool.NbFaceNodes( iF );
+ //nbElemNodeSet.insert( nbN );
+ const SMDS_MeshNode** faceNodes = volTool.GetFaceNodes( iF );
+ vector< const QLink* > faceLinks( nbN/2 );
+ for ( int iN = 0; iN < nbN; iN += 2 ) // loop on links of a face
+ {
+ // store QLink
+ QLink link( faceNodes[iN], faceNodes[iN+2], faceNodes[iN+1] );
+ pLink = links.insert( link ).first;
+ faceLinks[ iN/2 ] = & *pLink;
+
+ if ( link.MediumPos() == SMDS_TOP_3DSPACE )
+ {
+ if ( !link.IsStraight() )
+ return; // already fixed
+ }
+ else if ( !isCurved )
+ {
+ if ( volMinSize2 < 0 ) volMinSize2 = volTool.MinLinearSize2();
+ isCurved = !isStraightLink( volMinSize2, link._nodeMove.SquareMagnitude() );
+ }
+ }
+ // store QFace
+ pFace = faces.insert( QFace( faceLinks )).first;
+ if ( pFace->NbVolumes() == 0 )
+ pFace->AddSelfToLinks();
+ pFace->SetVolume( vol );
+// hasRectFaces = hasRectFaces ||
+// ( volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_HEXA ||
+// volTool.GetVolumeType() == SMDS_VolumeTool::QUAD_PENTA );
+#ifdef _DEBUG_
+ if ( nbN == 6 )
+ pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],faceNodes[4]);
+ else
+ pFace->_face = GetMeshDS()->FindFace(faceNodes[0],faceNodes[2],
+ faceNodes[4],faceNodes[6] );
+#endif
+ }
+ // collect pyramid apexes for further correction
+ if ( vol->NbCornerNodes() == 5 )
+ apexOfPyramid.insert( vol->GetNode( apexIndex ));
+ }
+ set< QLink >::iterator pLink = links.begin();
+ for ( ; pLink != links.end(); ++pLink )
+ pLink->SetContinuesFaces();
+ }
+ else
+ {
+ while ( elemIt->more() ) // loop on faces
+ {
+ const SMDS_MeshElement* face = elemIt->next();
+ if ( !face->IsQuadratic() )
+ continue;
+ //nbElemNodeSet.insert( face->NbNodes() );
+ int nbN = face->NbNodes()/2;
+ vector< const QLink* > faceLinks( nbN );
+ for ( int iN = 0; iN < nbN; ++iN ) // loop on links of a face
+ {
+ // store QLink
+ QLink link( face->GetNode(iN), face->GetNode((iN+1)%nbN), face->GetNode(iN+nbN) );
+ pLink = links.insert( link ).first;
+ faceLinks[ iN ] = & *pLink;
+ if ( !isCurved )
+ isCurved = !link.IsStraight();
+ }
+ // store QFace
+ pFace = faces.insert( QFace( faceLinks )).first;
+ pFace->AddSelfToLinks();
+ //hasRectFaces = ( hasRectFaces || nbN == 4 );
+ }
+ }
+ if ( !isCurved )
+ return; // no curved edges of faces
+
+ // 3. Compute displacement of medium nodes
+ // ---------------------------------------
+
+ // two loops on QFaces: the first is to treat boundary links, the second is for internal ones
+ TopLoc_Location loc;
+ // not treat boundary of volumic submesh
+ int isInside = ( elemType == SMDSAbs_Volume && volumeOnly ) ? 1 : 0;
+ for ( ; isInside < 2; ++isInside ) {
+ MSG( "--------------- LOOP (inside=" << isInside << ") ------------------");
+ SMDS_TypeOfPosition pos = isInside ? SMDS_TOP_3DSPACE : SMDS_TOP_FACE;
+ SMDS_TypeOfPosition bndPos = isInside ? SMDS_TOP_FACE : SMDS_TOP_EDGE;
+
+ for ( pFace = faces.begin(); pFace != faces.end(); ++pFace ) {
+ if ( bool(isInside) == pFace->IsBoundary() )
+ continue;
+ for ( int dir = 0; dir < 2; ++dir ) // 2 directions of propagation from the quadrangle
+ {
+ MSG( "CHAIN");
+ // make chain of links connected via continues faces
+ int error = ERR_OK;
+ TChain rawChain;
+ if ( !pFace->GetLinkChain( dir, rawChain, pos, error) && error ==ERR_UNKNOWN ) continue;
+ rawChain.reverse();
+ if ( !pFace->GetLinkChain( dir+2, rawChain, pos, error ) && error ==ERR_UNKNOWN ) continue;
+
+ vector< TChain > chains;
+ if ( error == ERR_OK ) { // chain contains continues rectangles
+ chains.resize(1);
+ chains[0].splice( chains[0].begin(), rawChain );
+ }
+ else if ( error == ERR_TRI ) { // chain contains continues triangles
+ TSplitTriaResult res = splitTrianglesIntoChains( rawChain, chains, pos );
+ if ( res != _OK ) { // not quadrangles split into triangles
+ fixTriaNearBoundary( rawChain, *this );
+ break;
+ }
+ }
+ else if ( error == ERR_PRISM ) { // quadrangle side faces of prisms
+ fixPrism( rawChain );
+ break;
+ }
+ else {
+ continue;
+ }
+ for ( int iC = 0; iC < chains.size(); ++iC )
+ {
+ TChain& chain = chains[iC];
+ if ( chain.empty() ) continue;
+ if ( chain.front().IsStraight() && chain.back().IsStraight() ) {
+ MSG("3D straight - ignore");
+ continue;
+ }
+ if ( chain.front()->MediumPos() > bndPos ||
+ chain.back() ->MediumPos() > bndPos ) {
+ MSG("Internal chain - ignore");
+ continue;
+ }
+ // mesure chain length and compute link position along the chain
+ double chainLen = 0;
+ vector< double > linkPos;
+ MSGBEG( "Link medium nodes: ");
+ TChain::iterator link0 = chain.begin(), link1 = chain.begin(), link2;
+ for ( ++link1; link1 != chain.end(); ++link1, ++link0 ) {
+ MSGBEG( (*link0)->_mediumNode->GetID() << "-" <<(*link1)->_mediumNode->GetID()<<" ");
+ double len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
+ while ( len < numeric_limits<double>::min() ) { // remove degenerated link
+ link1 = chain.erase( link1 );
+ if ( link1 == chain.end() )
+ break;
+ len = ((*link0)->MiddlePnt() - (*link1)->MiddlePnt()).Modulus();
+ }
+ chainLen += len;
+ linkPos.push_back( chainLen );
+ }
+ MSG("");
+ if ( linkPos.size() < 2 )
+ continue;
+
+ gp_Vec move0 = chain.front()->_nodeMove;
+ gp_Vec move1 = chain.back ()->_nodeMove;
+
+ TopoDS_Face face;
+ bool checkUV = true;
+ if ( !isInside )
+ {
+ // compute node displacement of end links of chain in parametric space of face
+ TChainLink& linkOnFace = *(++chain.begin());
+ const SMDS_MeshNode* nodeOnFace = linkOnFace->_mediumNode;
+ TopoDS_Shape f = GetSubShapeByNode( nodeOnFace, GetMeshDS() );
+ if ( !f.IsNull() && f.ShapeType() == TopAbs_FACE )
+ {
+ face = TopoDS::Face( f );
+ Handle(Geom_Surface) surf = BRep_Tool::Surface(face,loc);
+ bool isStraight[2];
+ for ( int is1 = 0; is1 < 2; ++is1 ) // move0 or move1
+ {
+ TChainLink& link = is1 ? chain.back() : chain.front();
+ gp_XY uvm = GetNodeUV( face, link->_mediumNode, nodeOnFace, &checkUV);
+ gp_XY uv1 = GetNodeUV( face, link->node1(), nodeOnFace, &checkUV);
+ gp_XY uv2 = GetNodeUV( face, link->node2(), nodeOnFace, &checkUV);
+ gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
+ // uvMove = uvm - uv12
+ gp_XY uvMove = applyIn2D(surf, uvm, uv12, gp_XY_Subtracted, /*inPeriod=*/false);
+ ( is1 ? move1 : move0 ).SetCoord( uvMove.X(), uvMove.Y(), 0 );
+ if ( !is1 ) // correct nodeOnFace for move1 (issue 0020919)
+ nodeOnFace = (*(++chain.rbegin()))->_mediumNode;
+ isStraight[is1] = isStraightLink( (uv2-uv1).SquareModulus(),
+ 10 * uvMove.SquareModulus());
+ }
+ if ( isStraight[0] && isStraight[1] ) {
+ MSG("2D straight - ignore");
+ continue; // straight - no need to move nodes of internal links
+ }
+
+ // check if a chain is already fixed
+ gp_XY uvm = GetNodeUV( face, linkOnFace->_mediumNode, 0, &checkUV);
+ gp_XY uv1 = GetNodeUV( face, linkOnFace->node1(), nodeOnFace, &checkUV);
+ gp_XY uv2 = GetNodeUV( face, linkOnFace->node2(), nodeOnFace, &checkUV);
+ gp_XY uv12 = GetMiddleUV( surf, uv1, uv2);
+ if (( uvm - uv12 ).SquareModulus() > 1e-10 )
+ {
+ MSG("Already fixed - ignore");
+ continue;
+ }
+ }
+ }
+ gp_Trsf trsf;
+ if ( isInside || face.IsNull() )
+ {
+ // compute node displacement of end links in their local coord systems
+ {
+ TChainLink& ln0 = chain.front(), ln1 = *(++chain.begin());
+ trsf.SetTransformation( gp_Ax3( gp::Origin(), ln0.Normal(),
+ gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
+ move0.Transform(trsf);
+ }
+ {
+ TChainLink& ln0 = *(++chain.rbegin()), ln1 = chain.back();
+ trsf.SetTransformation( gp_Ax3( gp::Origin(), ln1.Normal(),
+ gp_Vec( ln0->MiddlePnt(), ln1->MiddlePnt() )));
+ move1.Transform(trsf);
+ }
+ }
+ // compute displacement of medium nodes
+ link2 = chain.begin();
+ link0 = link2++;
+ link1 = link2++;
+ for ( int i = 0; link2 != chain.end(); ++link0, ++link1, ++link2, ++i )
+ {
+ double r = linkPos[i] / chainLen;
+ // displacement in local coord system
+ gp_Vec move = (1. - r) * move0 + r * move1;
+ if ( isInside || face.IsNull()) {
+ // transform to global
+ gp_Vec x01( (*link0)->MiddlePnt(), (*link1)->MiddlePnt() );
+ gp_Vec x12( (*link1)->MiddlePnt(), (*link2)->MiddlePnt() );
+ gp_Vec x = x01.Normalized() + x12.Normalized();
+ trsf.SetTransformation( gp_Ax3( gp::Origin(), link1->Normal(), x), gp_Ax3() );
+ move.Transform(trsf);
+ }
+ else {
+ // compute 3D displacement by 2D one
+ Handle(Geom_Surface) s = BRep_Tool::Surface(face,loc);
+ gp_XY oldUV = GetNodeUV( face, (*link1)->_mediumNode, 0, &checkUV);
+ gp_XY newUV = applyIn2D( s, oldUV, gp_XY( move.X(),move.Y()), gp_XY_Added);
+ gp_Pnt newPnt = s->Value( newUV.X(), newUV.Y());
+ move = gp_Vec( XYZ((*link1)->_mediumNode), newPnt.Transformed(loc) );
+#ifdef _DEBUG_
+ if ( (XYZ((*link1)->node1()) - XYZ((*link1)->node2())).SquareModulus() <
+ move.SquareMagnitude())
+ {
+ gp_XY uv0 = GetNodeUV( face, (*link0)->_mediumNode, 0, &checkUV);
+ gp_XY uv2 = GetNodeUV( face, (*link2)->_mediumNode, 0, &checkUV);
+ MSG( "TOO LONG MOVE \t" <<
+ "uv0: "<<uv0.X()<<", "<<uv0.Y()<<" \t" <<
+ "uv2: "<<uv2.X()<<", "<<uv2.Y()<<" \t" <<
+ "uvOld: "<<oldUV.X()<<", "<<oldUV.Y()<<" \t" <<
+ "newUV: "<<newUV.X()<<", "<<newUV.Y()<<" \t");
+ }
+#endif
+ }
+ (*link1)->Move( move );
+ MSG( "Move " << (*link1)->_mediumNode->GetID() << " following "
+ << chain.front()->_mediumNode->GetID() <<"-"
+ << chain.back ()->_mediumNode->GetID() <<
+ " by " << move.Magnitude());
+ }
+ } // loop on chains of links
+ } // loop on 2 directions of propagation from quadrangle
+ } // loop on faces
+ } // fix faces and/or volumes
+
+ // 4. Move nodes
+ // -------------
+
+ for ( pLink = links.begin(); pLink != links.end(); ++pLink ) {
+ if ( pLink->IsMoved() ) {
+ gp_Pnt p = pLink->MiddlePnt() + pLink->Move();
+ GetMeshDS()->MoveNode( pLink->_mediumNode, p.X(), p.Y(), p.Z());
+ }
+ }
+
+ // Issue 0020982
+ // Move the apex of pyramid together with the most curved link.
+ // TIDSortedNodeSet::iterator apexIt = apexOfPyramid.begin();
+ // for ( ; apexIt != apexOfPyramid.end(); ++apexIt )
+ // {
+ // SMESH_TNodeXYZ apex = *apexIt;
+
+ // gp_Vec maxMove( 0,0,0 );
+ // double maxMoveSize2 = 0;
+
+ // // shift of node index to get medium nodes between the base nodes
+ // const int base2MediumShift = 5;
+
+ // // find maximal movement of medium node
+ // SMDS_ElemIteratorPtr volIt = apex._node->GetInverseElementIterator( SMDSAbs_Volume );
+ // vector< const SMDS_MeshElement* > pyramids;
+ // while ( volIt->more() )
+ // {
+ // const SMDS_MeshElement* pyram = volIt->next();
+ // if ( pyram->GetEntityType() != SMDSEntity_Quad_Pyramid ) continue;
+ // pyramids.push_back( pyram );
+
+ // for ( int iBase = 0; iBase < apexIndex; ++iBase )
+ // {
+ // SMESH_TNodeXYZ medium = pyram->GetNode( iBase + base2MediumShift );
+ // if ( medium._node->GetPosition()->GetTypeOfPosition() != SMDS_TOP_3DSPACE )
+ // {
+ // SMESH_TNodeXYZ n1 = pyram->GetNode( iBase );
+ // SMESH_TNodeXYZ n2 = pyram->GetNode( ( iBase+1 ) % 4 );
+ // gp_Pnt middle = 0.5 * ( n1 + n2 );
+ // gp_Vec move( middle, medium );
+ // double moveSize2 = move.SquareMagnitude();
+ // if ( moveSize2 > maxMoveSize2 )
+ // maxMove = move, maxMoveSize2 = moveSize2;
+ // }
+ // }
+ // }
+
+ // // move the apex
+ // if ( maxMoveSize2 > 1e-20 )
+ // {
+ // apex += maxMove.XYZ();
+ // GetMeshDS()->MoveNode( apex._node, apex.X(), apex.Y(), apex.Z());
+
+ // // move medium nodes neighboring the apex to the middle
+ // const int base2MediumShift_2 = 9;
+ // for ( unsigned i = 0; i < pyramids.size(); ++i )
+ // for ( int iBase = 0; iBase < apexIndex; ++iBase )
+ // {
+ // SMESH_TNodeXYZ base = pyramids[i]->GetNode( iBase );
+ // const SMDS_MeshNode* medium = pyramids[i]->GetNode( iBase + base2MediumShift_2 );
+ // gp_XYZ middle = 0.5 * ( apex + base );
+ // GetMeshDS()->MoveNode( medium, middle.X(), middle.Y(), middle.Z());
+ // }
+ // }
+ // }
+}
+