1 // Copyright (C) 2007-2020 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License, or (at your option) any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 // File : StdMeshers_FaceSide.hxx
24 // Created : Wed Jan 31 18:41:25 2007
25 // Author : Edward AGAPOV (eap)
28 #include "StdMeshers_FaceSide.hxx"
30 #include "SMDS_EdgePosition.hxx"
31 #include "SMDS_MeshNode.hxx"
32 #include "SMESHDS_Mesh.hxx"
33 #include "SMESHDS_SubMesh.hxx"
34 #include "SMESH_Algo.hxx"
35 #include "SMESH_Block.hxx"
36 #include "SMESH_ComputeError.hxx"
37 #include "SMESH_Mesh.hxx"
38 #include "SMESH_MeshEditor.hxx"
39 #include "SMESH_MesherHelper.hxx"
41 #include <Adaptor2d_Curve2d.hxx>
42 #include <BRepAdaptor_CompCurve.hxx>
43 #include <BRep_Builder.hxx>
44 #include <BRep_Tool.hxx>
45 #include <GCPnts_AbscissaPoint.hxx>
46 #include <Geom2dAdaptor_Curve.hxx>
47 #include <Geom_Line.hxx>
49 #include <TopExp_Explorer.hxx>
51 #include <TopoDS_Face.hxx>
52 #include <TopoDS_Vertex.hxx>
53 #include <TopoDS_Wire.hxx>
58 #include "utilities.h"
62 //================================================================================
64 * \brief Constructor of a side of one edge
65 * \param theFace - the face
66 * \param theEdge - the edge
68 //================================================================================
70 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
71 const TopoDS_Edge& theEdge,
73 const bool theIsForward,
74 const bool theIgnoreMediumNodes,
75 SMESH_MesherHelper* theFaceHelper,
76 SMESH_ProxyMesh::Ptr theProxyMesh)
78 std::list<TopoDS_Edge> edges(1,theEdge);
79 StdMeshers_FaceSide tmp( theFace, edges, theMesh, theIsForward,
80 theIgnoreMediumNodes, theFaceHelper, theProxyMesh );
86 //================================================================================
88 * \brief Constructor of a side of several edges
90 //================================================================================
92 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
93 const std::list<TopoDS_Edge>& theEdges,
95 const bool theIsForward,
96 const bool theIgnoreMediumNodes,
97 SMESH_MesherHelper* theFaceHelper,
98 SMESH_ProxyMesh::Ptr theProxyMesh)
100 int nbEdges = theEdges.size();
101 myEdge.resize ( nbEdges );
102 myEdgeID.resize ( nbEdges );
103 myC2d.resize ( nbEdges );
104 myC3dAdaptor.resize( nbEdges );
105 myFirst.resize ( nbEdges );
106 myLast.resize ( nbEdges );
107 myNormPar.resize ( nbEdges );
108 myEdgeLength.resize( nbEdges );
109 myIsUniform.resize ( nbEdges, true );
112 myNbPonits = myNbSegments = 0;
113 myProxyMesh = theProxyMesh;
114 myMissingVertexNodes = false;
115 myIgnoreMediumNodes = theIgnoreMediumNodes;
116 myDefaultPnt2d = gp_Pnt2d( 1e+100, 1e+100 );
118 if ( !myProxyMesh ) myProxyMesh.reset( new SMESH_ProxyMesh( *theMesh ));
119 if ( theFaceHelper && theFaceHelper->GetSubShape() == myFace )
121 myHelper = new SMESH_MesherHelper( * myProxyMesh->GetMesh() );
122 myHelper->CopySubShapeInfo( *theFaceHelper );
124 if ( nbEdges == 0 ) return;
126 SMESHDS_Mesh* meshDS = myProxyMesh->GetMeshDS();
129 std::list<TopoDS_Edge>::const_iterator edge = theEdges.begin();
130 for ( int index = 0; edge != theEdges.end(); ++index, ++edge )
132 int i = theIsForward ? index : nbEdges-index-1;
133 myEdgeLength[i] = SMESH_Algo::EdgeLength( *edge );
134 if ( myEdgeLength[i] < DBL_MIN ) nbDegen++;
135 myLength += myEdgeLength[i];
137 myEdgeID[i] = meshDS->ShapeToIndex( *edge );
138 if ( !theIsForward ) myEdge[i].Reverse();
140 if ( theFace.IsNull() )
141 BRep_Tool::Range( *edge, myFirst[i], myLast[i] );
143 myC2d[i] = BRep_Tool::CurveOnSurface( *edge, theFace, myFirst[i], myLast[i] );
144 if ( myEdge[i].Orientation() == TopAbs_REVERSED )
145 std::swap( myFirst[i], myLast[i] );
147 // check if the edge has a non-uniform parametrization (issue 0020705)
148 if ( !myC2d[i].IsNull() )
150 if ( myEdgeLength[i] > DBL_MIN )
152 Geom2dAdaptor_Curve A2dC( myC2d[i],
153 std::min( myFirst[i], myLast[i] ),
154 std::max( myFirst[i], myLast[i] ));
155 double p2 = myFirst[i]+(myLast[i]-myFirst[i])/2.;
156 double p4 = myFirst[i]+(myLast[i]-myFirst[i])/4.;
157 double d2 = GCPnts_AbscissaPoint::Length( A2dC, myFirst[i], p2 );
158 double d4 = GCPnts_AbscissaPoint::Length( A2dC, myFirst[i], p4 );
159 myIsUniform[i] = !( fabs(2*d2/myEdgeLength[i]-1.0) > 0.01 || fabs(2*d4/d2-1.0) > 0.01 );
160 Handle(Geom_Curve) C3d = BRep_Tool::Curve(myEdge[i],d2,d4);
161 myC3dAdaptor[i].Load( C3d, d2,d4 );
165 const TopoDS_Vertex& V = SMESH_MesherHelper::IthVertex( 0, *edge );
166 Handle(Geom_Curve) C3d = new Geom_Line( BRep_Tool::Pnt( V ), gp::DX() );
167 myC3dAdaptor[i].Load( C3d, 0, 0.5 * BRep_Tool::Tolerance( V ));
170 else if ( myEdgeLength[i] > DBL_MIN )
172 Handle(Geom_Curve) C3d = BRep_Tool::Curve(myEdge[i],myFirst[i], myLast[i] );
173 myC3dAdaptor[i].Load( C3d, myFirst[i], myLast[i] );
174 if ( myEdge[i].Orientation() == TopAbs_REVERSED )
175 std::swap( myFirst[i], myLast[i] );
178 // reverse a proxy sub-mesh
180 reverseProxySubmesh( myEdge[i] );
184 // orient seam edges (#19982)
185 const double tol = Precision::Confusion();
186 if ( NbEdges() > 1 && !myC2d[0].IsNull() )
187 for ( int i = 0; i < NbEdges(); ++i )
189 int iPrev = SMESH_MesherHelper::WrapIndex( i - 1, NbEdges() );
190 if ( !BRep_Tool::IsClosed( myEdge[i], myFace ) || !myC2d[iPrev] )
192 gp_Pnt2d pLastPrev = myC2d[iPrev]->Value( myLast[iPrev] );
193 gp_Pnt2d pFirst = myC2d[i]->Value( myFirst[i] );
194 if ( pLastPrev.IsEqual( pFirst, tol ))
196 pFirst = myC2d[i]->Value( myLast[i] );
197 if ( pLastPrev.IsEqual( pFirst, tol ))
199 std::swap( myFirst[i], myLast[i] );
202 TopoDS_Edge E = myEdge[i];
204 Handle(Geom2d_Curve) c2dRev = BRep_Tool::CurveOnSurface( E, myFace, myFirst[i], myLast[i] );
205 pFirst = c2dRev->Value( myFirst[i] );
206 if ( pLastPrev.IsEqual( pFirst, tol ))
211 pFirst = c2dRev->Value( myLast[i] );
212 if ( pLastPrev.IsEqual( pFirst, tol ))
215 std::swap( myFirst[i], myLast[i] );
219 // count nodes and segments
220 NbPoints( /*update=*/true );
222 if ( nbEdges > 1 && myLength > DBL_MIN ) {
223 const double degenNormLen = 1.e-5;
224 double totLength = myLength;
226 totLength += myLength * degenNormLen * nbDegen;
227 double prevNormPar = 0;
228 for ( int i = 0; i < nbEdges; ++i ) {
229 if ( myEdgeLength[ i ] < DBL_MIN )
230 myEdgeLength[ i ] = myLength * degenNormLen;
231 myNormPar[ i ] = prevNormPar + myEdgeLength[i]/totLength;
232 prevNormPar = myNormPar[ i ];
235 myNormPar[nbEdges-1] = 1.;
239 //================================================================================
241 * \brief Constructor of a side for vertex using data from other FaceSide
243 //================================================================================
245 StdMeshers_FaceSide::StdMeshers_FaceSide(const StdMeshers_FaceSide* theSide,
246 const SMDS_MeshNode* theNode,
247 const gp_Pnt2d* thePnt2d1,
248 const gp_Pnt2d* thePnt2d2,
249 const Handle(Geom2d_Curve)& theC2d,
250 const double theUFirst,
251 const double theULast)
254 myEdgeID.resize ( 1, 0 );
255 myC2d.push_back ( theC2d );
256 myC3dAdaptor.resize ( 1 );
257 myFirst.push_back ( theUFirst );
258 myLast.push_back ( theULast );
259 myNormPar.push_back ( 1. );
260 myIsUniform.push_back( true );
263 myProxyMesh = theSide->myProxyMesh;
264 myDefaultPnt2d = *thePnt2d1;
265 myPoints = theSide->GetUVPtStruct();
266 myNbPonits = myPoints.size();
267 myNbSegments = theSide->myNbSegments;
269 for ( size_t i = 0; i < myPoints.size(); ++i )
271 double r = i / ( myPoints.size() - 1. );
272 myPoints[i].u = (1-r) * thePnt2d1->X() + r * thePnt2d2->X();
273 myPoints[i].v = (1-r) * thePnt2d1->Y() + r * thePnt2d2->Y();
274 myPoints[i].node = theNode;
277 for ( size_t i = 0; i < myPoints.size(); ++i )
279 myPoints[i].u = thePnt2d1->X();
280 myPoints[i].v = thePnt2d1->Y();
281 myPoints[i].node = theNode;
285 //================================================================================
287 * Create a side from an UVPtStructVec
289 //================================================================================
291 StdMeshers_FaceSide::StdMeshers_FaceSide(UVPtStructVec& theSideNodes,
292 const TopoDS_Face& theFace,
293 const TopoDS_Edge& theEdge,
296 myEdge.resize( 1, theEdge );
297 myEdgeID.resize( 1, -1 );
299 myC3dAdaptor.resize( 1 );
300 myFirst.resize( 1, 0. );
301 myLast.resize( 1, 1. );
302 myNormPar.resize( 1, 1. );
303 myIsUniform.resize( 1, 1 );
304 myMissingVertexNodes = myIgnoreMediumNodes = false;
305 myDefaultPnt2d.SetCoord( 1e100, 1e100 );
306 if ( theMesh ) myProxyMesh.reset( new SMESH_ProxyMesh( *theMesh ));
307 if ( !theEdge.IsNull() )
309 if ( theMesh ) myEdgeID[0] = theMesh->GetMeshDS()->ShapeToIndex( theEdge );
310 if ( theFace.IsNull() )
311 BRep_Tool::Range( theEdge, myFirst[0], myLast[0] );
313 myC2d[0] = BRep_Tool::CurveOnSurface( theEdge, theFace, myFirst[0], myLast[0] );
314 if ( theEdge.Orientation() == TopAbs_REVERSED )
315 std::swap( myFirst[0], myLast[0] );
320 myPoints = theSideNodes;
321 myNbPonits = myPoints.size();
322 myNbSegments = myNbPonits + 1;
325 if ( !myPoints.empty() )
327 myPoints[0].normParam = 0;
328 if ( myPoints[0].node &&
329 myPoints.back().node &&
330 myPoints[ myNbPonits/2 ].node )
332 gp_Pnt pPrev = SMESH_TNodeXYZ( myPoints[0].node );
333 for ( size_t i = 1; i < myPoints.size(); ++i )
335 gp_Pnt p = SMESH_TNodeXYZ( myPoints[i].node );
336 myLength += p.Distance( pPrev );
337 myPoints[i].normParam = myLength;
341 else if ( !theFace.IsNull() )
344 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
345 gp_Pnt pPrev = surf->Value( myPoints[0].u, myPoints[0].v );
346 for ( size_t i = 1; i < myPoints.size(); ++i )
348 gp_Pnt p = surf->Value( myPoints[i].u, myPoints[i].v );
349 myLength += p.Distance( pPrev );
350 myPoints[i].normParam = myLength;
356 gp_Pnt2d pPrev = myPoints[0].UV();
357 for ( size_t i = 1; i < myPoints.size(); ++i )
359 gp_Pnt2d p = myPoints[i].UV();
360 myLength += p.Distance( pPrev );
361 myPoints[i].normParam = myLength;
365 if ( myLength > std::numeric_limits<double>::min() )
366 for ( size_t i = 1; i < myPoints.size(); ++i )
367 myPoints[i].normParam /= myLength;
369 myEdgeLength.resize( 1, myLength );
372 //================================================================================
376 //================================================================================
378 StdMeshers_FaceSide::~StdMeshers_FaceSide()
380 delete myHelper; myHelper = NULL;
383 //================================================================================
385 * Return info on nodes on the side
387 //================================================================================
389 const std::vector<UVPtStruct>& StdMeshers_FaceSide::GetUVPtStruct(bool isXConst,
390 double constValue) const
392 if ( myPoints.empty() )
394 if ( NbEdges() == 0 ) return myPoints;
396 StdMeshers_FaceSide* me = const_cast< StdMeshers_FaceSide* >( this );
400 SMESH_MesherHelper eHelper( *myProxyMesh->GetMesh() );
401 SMESH_MesherHelper& fHelper = *FaceHelper();
403 // sort nodes of all edges by putting them into a map
405 map< double, const SMDS_MeshNode*> u2node;
406 vector< pair< double, const SMDS_MeshNode*> > u2nodeVec;
407 vector<const SMDS_MeshNode*> nodes;
408 set<const SMDS_MeshNode*> vertexNodes;
409 vector< const SMESH_ProxyMesh::SubMesh* > proxySubMesh( myEdge.size() );
410 int nbProxyNodes = 0;
413 for ( iE = 0; iE < myEdge.size(); ++iE )
415 proxySubMesh[iE] = myProxyMesh->GetProxySubMesh( myEdge[iE] );
416 if ( proxySubMesh[iE] )
418 if ( proxySubMesh[iE]->GetUVPtStructVec().empty() ) {
419 proxySubMesh[iE] = 0;
422 nbProxyNodes += proxySubMesh[iE]->GetUVPtStructVec().size() - 1;
423 if ( iE+1 == myEdge.size() )
429 // Add 1st vertex node of a current edge
430 const SMDS_MeshNode* node = VertexNode( iE );
431 const double prevNormPar = ( iE == 0 ? 0 : myNormPar[ iE-1 ]); // normalized param
432 if ( node ) // nodes on internal vertices may be missing
434 if ( vertexNodes.insert( node ).second ||
435 fHelper.IsRealSeam ( node->getshapeId() ) ||
436 fHelper.IsDegenShape( node->getshapeId() ))
437 u2node.insert( u2node.end(), make_pair( prevNormPar, node ));
441 for ( ++iE; iE < myEdge.size(); ++iE )
442 if (( node = VertexNode( iE ))) {
443 u2node.insert( make_pair( prevNormPar, node ));
450 vertexNodes.insert( node );
453 // Add internal nodes
455 if ( !GetEdgeNodes( iE, nodes, /*v0=*/false, /*v1=*/false ))
457 if ( !nodes.empty() )
460 double paramSize = myLast[iE] - myFirst[iE];
461 double r = myNormPar[iE] - prevNormPar;
462 eHelper.SetSubShape( myEdge[iE] );
463 eHelper.ToFixNodeParameters( true );
464 if ( !myIsUniform[iE] )
465 for ( size_t i = 0; i < nodes.size(); ++i )
467 double u = eHelper.GetNodeU( myEdge[iE], nodes[i], 0, ¶mOK );
468 double aLenU = GCPnts_AbscissaPoint::Length( me->myC3dAdaptor[iE], myFirst[iE], u );
469 if ( myEdgeLength[iE] < aLenU ) // nonregression test "3D_mesh_NETGEN/G6"
474 double normPar = prevNormPar + r * aLenU / myEdgeLength[iE];
475 u2nodeVec.push_back( make_pair( normPar, nodes[i] ));
477 if ( u2nodeVec.empty() )
478 for ( size_t i = 0; i < nodes.size(); ++i )
480 double u = eHelper.GetNodeU( myEdge[iE], nodes[i], 0, ¶mOK );
481 // paramSize is signed so orientation is taken into account
482 double normPar = prevNormPar + r * ( u - myFirst[iE] ) / paramSize;
483 u2nodeVec.push_back( make_pair( normPar, nodes[i] ));
485 for ( size_t j = 0; j < u2nodeVec.size(); ++j )
486 u2node.insert( u2node.end(), u2nodeVec[j] );
489 } // loop on myEdge's
491 // Add 2nd VERTEX node for a last EDGE
492 if ( !proxySubMesh.back() )
494 if ( u2node.empty() ) return myPoints;
496 const SMDS_MeshNode* node;
497 if ( IsClosed() && !proxySubMesh[0] )
498 node = u2node.begin()->second;
501 node = VertexNode( iE );
502 if ( myProxyMesh->GetMesh()->HasModificationsToDiscard() )
503 while ( !node && iE > 1 ) // check intermediate VERTEXes
504 node = VertexNode( --iE );
508 if ( u2node.rbegin()->second == node &&
509 !fHelper.IsRealSeam ( node->getshapeId() ) &&
510 !fHelper.IsDegenShape( node->getshapeId() ))
511 u2node.erase( --u2node.end() );
513 u2node.insert( u2node.end(), make_pair( 1., node ));
517 if ((int) u2node.size() + nbProxyNodes != myNbPonits &&
518 (int) u2node.size() + nbProxyNodes != NbPoints( /*update=*/true ))
522 if (( u2node.size() > 0 ) &&
523 ( u2node.begin()->first < 0 || u2node.rbegin()->first > 1 ))
528 // fill array of UVPtStruct
530 UVPtStructVec& points = me->myPoints;
531 points.resize( myNbPonits );
534 double prevNormPar = 0, paramSize = myNormPar[ 0 ];
535 map< double, const SMDS_MeshNode*>::iterator u_node = u2node.begin();
536 for ( size_t iE = 0; iE < myEdge.size(); ++iE )
538 if ( proxySubMesh[ iE ] ) // copy data from a proxy sub-mesh
540 const UVPtStructVec& edgeUVPtStruct = proxySubMesh[iE]->GetUVPtStructVec();
541 UVPtStruct* pointsPtr = & points[iPt];
542 std::copy( edgeUVPtStruct.begin(), edgeUVPtStruct.end(), pointsPtr );
544 double du1 = edgeUVPtStruct.back().param - edgeUVPtStruct[0].param;
545 double du2 = myLast[iE] - myFirst[iE];
548 std::reverse( pointsPtr, pointsPtr + edgeUVPtStruct.size());
549 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i )
550 pointsPtr[i].normParam = 1. - pointsPtr[i].normParam;
552 // update normalized params
553 if ( myEdge.size() > 1 ) {
554 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i )
556 UVPtStruct & uvPt = pointsPtr[i];
557 uvPt.normParam = prevNormPar + uvPt.normParam * paramSize;
558 uvPt.x = uvPt.y = uvPt.normParam;
560 iPt += edgeUVPtStruct.size() - 1; // to point to the 1st VERTEX of the next EDGE
562 // update UV on a seam EDGE
563 if ( fHelper.IsRealSeam( myEdgeID[ iE ]))
565 // check if points lye on the EDGE
566 const UVPtStruct& pm = edgeUVPtStruct[ edgeUVPtStruct.size()/2 ];
567 gp_Pnt pNode = SMESH_TNodeXYZ( pm.node );
568 gp_Pnt pCurv = myC3dAdaptor[ iE ].Value( pm.param );
569 double tol = BRep_Tool::Tolerance( myEdge[ iE ]) * 10;
570 bool isPointOnEdge = ( pNode.SquareDistance( pCurv ) < tol * tol );
572 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i )
573 pointsPtr[i].SetUV( myC2d[ iE ]->Value( pointsPtr[i].param ).XY() );
578 for ( ; u_node != u2node.end(); ++u_node, ++iPt )
580 if ( myNormPar[ iE ]-eps < u_node->first )
581 break; // u_node is at VERTEX of the next EDGE
583 UVPtStruct & uvPt = points[iPt];
584 uvPt.node = u_node->second;
585 // -- normParam, x, y --------------------------------
586 uvPt.normParam = u_node->first;
587 uvPt.x = uvPt.y = uvPt.normParam;
588 // -- U ----------------------------------------------
589 SMDS_EdgePositionPtr epos = uvPt.node->GetPosition();
590 if ( epos && uvPt.node->getshapeId() == myEdgeID[iE] ) {
591 uvPt.param = epos->GetUParameter();
594 double r = ( uvPt.normParam - prevNormPar )/ paramSize;
595 uvPt.param = ( r > 0.5 ? myLast[iE] : myFirst[iE] );
597 // -- UV ---------------------------------------------
598 if ( !myC2d[ iE ].IsNull() ) {
599 gp_Pnt2d p = myC2d[ iE ]->Value( uvPt.param );
604 uvPt.u = uvPt.v = 1e+100;
608 // prepare for the next EDGE
609 if ( iE+1 < myEdge.size() )
611 prevNormPar = myNormPar[ iE ];
612 paramSize = myNormPar[ iE+1 ] - prevNormPar;
614 } // loop on myEdge's
618 for ( iPt = 0; iPt < (int)points.size(); ++iPt ) points[ iPt ].x = constValue;
620 for ( iPt = 0; iPt < (int)points.size(); ++iPt ) points[ iPt ].y = constValue;
622 } // if ( myPoints.empty())
627 //================================================================================
629 * \brief Falsificate info on nodes
630 * \param nbSeg - nb of segments on the side
631 * \retval UVPtStruct* - array of data structures
633 //================================================================================
635 const vector<UVPtStruct>& StdMeshers_FaceSide::SimulateUVPtStruct(int nbSeg,
637 double constValue) const
639 if ( myFalsePoints.empty() )
641 if ( NbEdges() == 0 ) return myFalsePoints;
643 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myFalsePoints );
644 points->resize( nbSeg+1 );
647 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
649 for ( size_t i = 0 ; i < myFalsePoints.size(); ++i )
651 double normPar = double(i) / double(nbSeg);
652 UVPtStruct & uvPt = (*points)[i];
654 uvPt.x = uvPt.y = uvPt.param = uvPt.normParam = normPar;
655 if ( isXConst ) uvPt.x = constValue;
656 else uvPt.y = constValue;
657 if ( myNormPar[ EdgeIndex ] < normPar )
659 prevNormPar = myNormPar[ EdgeIndex ];
661 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
663 double r = ( normPar - prevNormPar )/ paramSize;
664 uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
665 if ( !myC2d[ EdgeIndex ].IsNull() )
666 p = myC2d[ EdgeIndex ]->Value( uvPt.param );
668 p = Value2d( normPar );
673 return myFalsePoints;
676 //=======================================================================
677 //function : GetOrderedNodes
678 //purpose : Return nodes in the order they encounter while walking along the side
679 //=======================================================================
681 std::vector<const SMDS_MeshNode*> StdMeshers_FaceSide::GetOrderedNodes(int theEdgeInd) const
683 vector<const SMDS_MeshNode*> resultNodes;
684 if ( myPoints.empty() || ( theEdgeInd >= 0 && NbEdges() > 0 ))
686 if ( NbEdges() == 0 ) return resultNodes;
688 //SMESHDS_Mesh* meshDS = myProxyMesh->GetMeshDS();
689 SMESH_MesherHelper eHelper( *myProxyMesh->GetMesh() );
690 SMESH_MesherHelper& fHelper = * FaceHelper();
693 // Sort nodes of all edges putting them into a map
695 map< double, const SMDS_MeshNode*> u2node;
696 vector<const SMDS_MeshNode*> nodes;
697 set<const SMDS_MeshNode*> vertexNodes;
698 int iE = 0, iEnd = myEdge.size();
699 if ( theEdgeInd >= 0 )
701 iE = theEdgeInd % NbEdges();
704 for ( ; iE < iEnd; ++iE )
706 double prevNormPar = ( iE == 0 ? 0 : myNormPar[ iE-1 ]); // normalized param
708 const SMESH_ProxyMesh::SubMesh* proxySM = myProxyMesh->GetProxySubMesh( myEdge[iE] );
711 const UVPtStructVec& points = proxySM->GetUVPtStructVec();
712 for ( size_t i = 0; i < points.size(); ++i )
713 u2node.insert( make_pair( prevNormPar + points[i].normParam, points[i].node ));
717 // Add 1st vertex node of a current EDGE
718 const SMDS_MeshNode* node = VertexNode( iE );
719 if ( node ) { // nodes on internal vertices may be missing
720 if ( vertexNodes.insert( node ).second ||
721 fHelper.IsRealSeam ( node->getshapeId() ) ||
722 fHelper.IsDegenShape( node->getshapeId() ))
723 u2node.insert( make_pair( prevNormPar, node ));
727 if ( nodes.empty() ) {
728 for ( ++iE; iE < iEnd; ++iE )
729 if (( node = VertexNode( iE ))) {
730 u2node.insert( make_pair( prevNormPar, node ));
737 vertexNodes.insert( node );
740 // Add internal nodes
742 if ( !GetEdgeNodes( iE, nodes, /*v0=*/false, /*v1=*/false ))
744 if ( !nodes.empty() )
746 double paramSize = myLast[iE] - myFirst[iE];
747 double r = myNormPar[iE] - prevNormPar;
748 eHelper.SetSubShape( myEdge[iE] );
749 eHelper.ToFixNodeParameters( true );
750 for ( size_t i = 0; i < nodes.size(); ++i )
752 double u = eHelper.GetNodeU( myEdge[iE], nodes[i], 0, ¶mOK );
753 // paramSize is signed so orientation is taken into account
754 double normPar = prevNormPar + r * ( u - myFirst[iE] ) / paramSize;
755 u2node.insert( u2node.end(), make_pair( normPar, nodes[i] ));
761 if ( u2node.empty() ) return resultNodes;
763 // Add 2nd vertex node for a last EDGE
765 const SMDS_MeshNode* node;
766 if ( IsClosed() && theEdgeInd < 0 )
767 node = u2node.begin()->second;
770 node = VertexNode( iE );
771 while ( !node && iE > 0 )
772 node = VertexNode( --iE );
776 if ( u2node.rbegin()->second == node &&
777 !fHelper.IsRealSeam ( node->getshapeId() ) &&
778 !fHelper.IsDegenShape( node->getshapeId() ))
779 u2node.erase( --u2node.end() );
781 u2node.insert( u2node.end(), make_pair( 1., node ));
784 // Fill the result vector
786 if ( theEdgeInd < 0 &&
787 (int) u2node.size() != myNbPonits &&
788 (int) u2node.size() != NbPoints( /*update=*/true ))
792 resultNodes.reserve( u2node.size() );
793 map< double, const SMDS_MeshNode*>::iterator u2n = u2node.begin();
794 for ( ; u2n != u2node.end(); ++u2n )
795 resultNodes.push_back( u2n->second );
799 resultNodes.resize( myPoints.size() );
800 for ( size_t i = 0; i < myPoints.size(); ++i )
801 resultNodes[i] = myPoints[i].node;
807 //================================================================================
809 * \brief Return (unsorted) nodes of the i-th EDGE.
810 * Nodes moved to other geometry by MergeNodes() are also returned.
811 * \retval bool - is OK
813 //================================================================================
815 bool StdMeshers_FaceSide::GetEdgeNodes(size_t i,
816 vector<const SMDS_MeshNode*>& nodes,
817 bool inlude1stVertex,
818 bool inludeLastVertex) const
820 if ( i >= myEdge.size() )
823 SMESH_Mesh* mesh = myProxyMesh->GetMesh();
824 SMESHDS_Mesh* meshDS = mesh->GetMeshDS();
825 SMESHDS_SubMesh* sm = meshDS->MeshElements( myEdge[i] );
827 if ( inlude1stVertex )
829 if ( const SMDS_MeshNode* n0 = VertexNode( i ))
830 nodes.push_back( n0 );
833 if ( sm && ( sm->NbElements() > 0 || sm->NbNodes() > 0 ))
835 if ( mesh->HasModificationsToDiscard() ) // check nb of nodes on the EDGE sub-mesh
837 int iQuad = sm->NbElements() ? sm->GetElements()->next()->IsQuadratic() : 0;
838 int nbExpect = sm->NbElements() - 1 + iQuad * sm->NbElements();
839 if ( nbExpect != sm->NbNodes() ) // some nodes are moved from the EDGE by MergeNodes()
841 // add nodes of all segments
842 typedef set< const SMDS_MeshNode* > TNodeSet;
843 TNodeSet sharedNodes;
844 SMDS_ElemIteratorPtr segIt = sm->GetElements();
845 while ( segIt->more() )
847 const SMDS_MeshElement* seg = segIt->next();
848 if ( seg->GetType() != SMDSAbs_Edge )
850 for ( int i = 0; i < 3-myIgnoreMediumNodes; ++i )
852 const SMDS_MeshNode* n = seg->GetNode( i );
853 if ( i == 2 ) // medium node
855 nodes.push_back( n );
859 pair<TNodeSet::iterator, bool> it2new = sharedNodes.insert( n );
860 if ( !it2new.second ) // n encounters twice == it's on EDGE, not on VERTEX
862 nodes.push_back( n );
863 sharedNodes.erase( it2new.first );
870 if ( nodes.size() < 2 ) // add nodes assigned to the EDGE
872 SMDS_NodeIteratorPtr nItr = sm->GetNodes();
873 while ( nItr->more() )
875 const SMDS_MeshNode* n = nItr->next();
876 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( n, SMDSAbs_Edge ))
878 nodes.push_back( n );
881 } // if ( sm && sm->NbElements() > 0 )
883 if ( inludeLastVertex )
885 if ( const SMDS_MeshNode* n1 = VertexNode( i+1 ))
886 nodes.push_back( n1 );
891 //================================================================================
893 * \brief Return a node from the i-th VERTEX (count starts from zero)
894 * Nodes moved to other geometry by MergeNodes() are also returned.
895 * \param [in] i - the VERTEX index
896 * \param [out] isMoved - returns \c true if the found node is moved by MergeNodes()
897 * \return const SMDS_MeshNode* - the found node
899 //================================================================================
901 const SMDS_MeshNode* StdMeshers_FaceSide::VertexNode(std::size_t i, bool* isMoved) const
903 TopoDS_Vertex V = ( i >= myEdge.size() ) ? LastVertex() : FirstVertex(i);
905 const SMDS_MeshNode* n = SMESH_Algo::VertexNode( V, myProxyMesh->GetMeshDS() );
907 if ( !n && !myEdge.empty() && myProxyMesh->GetMesh()->HasModificationsToDiscard() )
909 size_t iE = ( i < myEdge.size() ) ? i : myEdge.size()-1;
910 SMESHDS_SubMesh* sm = myProxyMesh->GetMeshDS()->MeshElements( myEdgeID[ iE ]);
912 n = SMESH_Algo::VertexNode( V, sm, myProxyMesh->GetMesh(), /*checkV=*/false );
915 (( i > 0 && (int) i < NbEdges() ) || IsClosed() ))
917 iE = SMESH_MesherHelper::WrapIndex( int(i)-1, NbEdges() );
918 sm = myProxyMesh->GetMeshDS()->MeshElements( myEdgeID[ iE ]);
919 n = SMESH_Algo::VertexNode( V, sm, myProxyMesh->GetMesh(), /*checkV=*/false );
922 if ( n && n->GetPosition()->GetDim() == 1 ) // check that n does not lie on an EDGE of myFace
924 TopoDS_Shape S = SMESH_MesherHelper::GetSubShapeByNode( n, myProxyMesh->GetMeshDS() );
925 if ( SMESH_MesherHelper::IsSubShape( S, myFace ))
926 n = 0; // VERTEX ignored by e.g. Composite Wire Discretization algo
934 //================================================================================
936 * \brief reverse order of vector elements
937 * \param vec - vector to reverse
939 //================================================================================
941 template <typename T > void reverse(vector<T> & vec)
943 std::reverse( vec.begin(), vec.end() );
946 //================================================================================
948 * \brief Change orientation of side geometry
950 //================================================================================
952 void StdMeshers_FaceSide::Reverse()
954 int nbEdges = myEdge.size();
955 for ( int i = nbEdges-1; i >= 0; --i ) {
956 std::swap( myFirst[i], myLast[i] );
957 if ( !myEdge[i].IsNull() )
959 if ( i > 0 ) // at the first loop 1. is overwritten
960 myNormPar[i] = 1 - myNormPar[i-1];
966 //reverse( myC3dAdaptor );
969 reverse( myNormPar );
970 reverse( myEdgeLength );
971 reverse( myIsUniform );
975 myNormPar[nbEdges-1]=1.;
976 if ( !myEdge[0].IsNull() )
978 for ( size_t i = 0; i < myEdge.size(); ++i )
979 reverseProxySubmesh( myEdge[i] );
981 myFalsePoints.clear();
985 for ( size_t i = 0; i < myPoints.size(); ++i )
987 UVPtStruct & uvPt = myPoints[i];
988 uvPt.normParam = 1 - uvPt.normParam;
994 for ( size_t i = 0; i < myFalsePoints.size(); ++i )
996 UVPtStruct & uvPt = myFalsePoints[i];
997 uvPt.normParam = 1 - uvPt.normParam;
1001 reverse( myFalsePoints );
1004 for ( size_t i = 0; i < myEdge.size(); ++i )
1006 if ( myEdge[i].IsNull() ) continue; // for a side on points only
1008 Handle(Geom_Curve) C3d = BRep_Tool::Curve(myEdge[i],fp,lp);
1009 if ( !C3d.IsNull() )
1010 myC3dAdaptor[i].Load( C3d, fp,lp );
1014 //=======================================================================
1015 //function : SetIgnoreMediumNodes
1016 //purpose : Make ignore medium nodes
1017 //=======================================================================
1019 void StdMeshers_FaceSide::SetIgnoreMediumNodes(bool toIgnore)
1021 if ( myIgnoreMediumNodes != toIgnore )
1023 myIgnoreMediumNodes = toIgnore;
1025 if ( !myPoints.empty() )
1027 UVPtStructVec newPoints;
1028 newPoints.reserve( myPoints.size()/2 + 1 );
1029 for ( size_t i = 0; i < myPoints.size(); i += 2 )
1030 newPoints.push_back( myPoints[i] );
1032 myPoints.swap( newPoints );
1036 NbPoints( /*update=*/true );
1041 //=======================================================================
1042 //function : NbPoints
1043 //purpose : Return nb nodes on edges and vertices (+1 to be == GetUVPtStruct().size() )
1044 // Call it with update == true if mesh of this side can be recomputed
1045 // since creation of this side
1046 //=======================================================================
1048 int StdMeshers_FaceSide::NbPoints(const bool update) const
1050 if ( !myPoints.empty() )
1051 return myPoints.size();
1053 // if ( !myFalsePoints.empty() )
1054 // return myFalsePoints.size();
1056 if ( update && myEdge.size() > 0 )
1058 StdMeshers_FaceSide* me = (StdMeshers_FaceSide*) this;
1060 me->myNbSegments = 0;
1061 me->myMissingVertexNodes = false;
1063 vector<const SMDS_MeshNode*> nodes;
1064 for ( int i = 0; i < NbEdges(); ++i )
1066 if ( const SMESHDS_SubMesh* sm = myProxyMesh->GetSubMesh( Edge(i) ))
1068 if ( sm->NbNodes() == sm->NbElements()-1 || sm->NbElements() == 0 )
1070 me->myNbPonits += sm->NbNodes();
1071 if ( myIgnoreMediumNodes && sm->IsQuadratic() )
1072 me->myNbPonits -= sm->NbElements();
1074 else // nodes can be moved to other shapes by MergeNodes()
1077 GetEdgeNodes( i, nodes, /*v1=*/false, /*v2=*/false );
1078 me->myNbPonits += nodes.size();
1080 me->myNbSegments += sm->NbElements();
1084 SMESH_MesherHelper* helper = FaceHelper();
1086 std::set< const SMDS_MeshNode* > vNodes;
1087 const int nbV = NbEdges() + !IsClosed();
1088 for ( int i = 0; i < nbV; ++i )
1089 if ( const SMDS_MeshNode* n = VertexNode( i ))
1091 if ( !vNodes.insert( n ).second &&
1092 ( helper->IsRealSeam ( n->getshapeId() ) ||
1093 helper->IsDegenShape( n->getshapeId() )))
1098 me->myMissingVertexNodes = true;
1100 me->myNbPonits += vNodes.size();
1103 me->myNbPonits++; // closing node is repeated
1108 //=======================================================================
1109 //function : NbSegments
1110 //purpose : Return nb edges
1111 // Call it with update == true if mesh of this side can be recomputed
1112 // since creation of this side
1113 //=======================================================================
1115 int StdMeshers_FaceSide::NbSegments(const bool update) const
1117 return NbPoints( update ), myNbSegments;
1120 //================================================================================
1122 * \brief Reverse UVPtStructVec if a proxy sub-mesh of E
1124 //================================================================================
1126 void StdMeshers_FaceSide::reverseProxySubmesh( const TopoDS_Edge& E )
1128 if ( !myProxyMesh ) return;
1129 if ( const SMESH_ProxyMesh::SubMesh* sm = myProxyMesh->GetProxySubMesh( E ))
1131 UVPtStructVec& edgeUVPtStruct = (UVPtStructVec& ) sm->GetUVPtStructVec();
1132 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i )
1134 UVPtStruct & uvPt = edgeUVPtStruct[i];
1135 uvPt.normParam = 1 - uvPt.normParam;
1136 uvPt.x = 1 - uvPt.x;
1137 uvPt.y = 1 - uvPt.y;
1139 reverse( edgeUVPtStruct );
1143 //================================================================================
1145 * \brief Show side features
1147 //================================================================================
1149 void StdMeshers_FaceSide::dump(const char* msg) const
1152 if (msg) MESSAGE ( std::endl << msg );
1153 MESSAGE_BEGIN ("NB EDGES: "<< myEdge.size() );
1154 MESSAGE_ADD ( "nbPoints: "<<myNbPonits<<" vecSize: " << myPoints.size()<<" "<<myFalsePoints.size() );
1155 for ( size_t i = 0; i < myEdge.size(); ++i )
1157 MESSAGE_ADD ( "\t"<<i+1 );
1158 MESSAGE_ADD ( "\tEDGE: " );
1159 if (myEdge[i].IsNull()) {
1160 MESSAGE_ADD ( "NULL" );
1163 TopAbs::Print(myEdge[i].Orientation(),cout)<<" "<<myEdge[i].TShape().operator->()<<endl;
1164 MESSAGE_ADD ( "\tV1: " << TopExp::FirstVertex( myEdge[i], 1).TShape().operator->()
1165 << " V2: " << TopExp::LastVertex( myEdge[i], 1).TShape().operator->() );
1167 MESSAGE_ADD ( "\tC2d: ");
1169 if (myC2d[i].IsNull()) {
1170 MESSAGE_ADD ( "NULL" );
1173 MESSAGE_ADD ( myC2d[i].operator->() );
1176 MESSAGE_ADD ( "\tF: "<<myFirst[i]<< " L: "<< myLast[i] );
1177 MESSAGE_END ( "\tnormPar: "<<myNormPar[i]<<endl );
1180 (void)msg; // unused in release mode
1184 //================================================================================
1186 * \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
1187 * \retval Adaptor2d_Curve2d* -
1189 //================================================================================
1191 struct Adaptor2dCurve2d : public Adaptor2d_Curve2d
1193 const StdMeshers_FaceSide* mySide;
1194 Adaptor2dCurve2d(const StdMeshers_FaceSide* faceSide):mySide(faceSide) {}
1195 gp_Pnt2d Value(const Standard_Real U) const { return mySide->Value2d( U ); }
1196 Standard_Real FirstParameter() const { return 0; }
1197 Standard_Real LastParameter() const { return 1; }
1200 Adaptor2d_Curve2d* StdMeshers_FaceSide::GetCurve2d() const
1202 return new Adaptor2dCurve2d( this );
1205 //================================================================================
1207 * \brief Creates a fully functional Adaptor_Curve
1209 //================================================================================
1211 BRepAdaptor_CompCurve* StdMeshers_FaceSide::GetCurve3d() const
1213 if ( myEdge.empty() )
1217 BRep_Builder aBuilder;
1218 aBuilder.MakeWire(aWire);
1219 for ( size_t i = 0; i < myEdge.size(); ++i )
1220 aBuilder.Add( aWire, myEdge[i] );
1222 if ( myEdge.size() == 2 && IsClosed() )
1223 aWire.Closed(true); // issue 0021141
1225 return new BRepAdaptor_CompCurve( aWire );
1228 //================================================================================
1230 * \brief Return 2D point by normalized parameter
1231 * \param U - normalized parameter value
1232 * \retval gp_Pnt2d - point
1234 //================================================================================
1236 gp_Pnt2d StdMeshers_FaceSide::Value2d(double U) const
1238 if ( !myC2d[0].IsNull() ) {
1239 int i = EdgeIndex( U );
1240 double prevU = i ? myNormPar[ i-1 ] : 0;
1241 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
1243 double par = myFirst[i] * ( 1 - r ) + myLast[i] * r;
1245 // check parametrization of curve
1246 if( !myIsUniform[i] )
1248 double aLen3dU = r * myEdgeLength[i] * ( myFirst[i]>myLast[i] ? -1. : 1.);
1249 GCPnts_AbscissaPoint AbPnt
1250 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), aLen3dU, myFirst[i] );
1251 if( AbPnt.IsDone() ) {
1252 par = AbPnt.Parameter();
1255 return myC2d[ i ]->Value(par);
1258 else if ( !myPoints.empty() )
1260 int i = U * double( myPoints.size()-1 );
1261 while ( i > 0 && myPoints[ i ].normParam > U )
1263 while ( i+1 < (int)myPoints.size() && myPoints[ i+1 ].normParam < U )
1265 double r = (( U - myPoints[ i ].normParam ) /
1266 ( myPoints[ i+1 ].normParam - myPoints[ i ].normParam ));
1267 return ( myPoints[ i ].UV() * ( 1 - r ) +
1268 myPoints[ i+1 ].UV() * r );
1270 return myDefaultPnt2d;
1273 //================================================================================
1275 * \brief Return XYZ by normalized parameter
1276 * \param U - normalized parameter value
1277 * \retval gp_Pnt - point
1279 //================================================================================
1281 gp_Pnt StdMeshers_FaceSide::Value3d(double U) const
1283 int i = EdgeIndex( U );
1284 double prevU = i ? myNormPar[ i-1 ] : 0;
1285 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
1287 double par = myFirst[i] * ( 1 - r ) + myLast[i] * r;
1289 // check parametrization of curve
1290 if( !myIsUniform[i] )
1292 double aLen3dU = r * myEdgeLength[i] * ( myFirst[i] > myLast[i] ? -1. : 1. );
1293 GCPnts_AbscissaPoint AbPnt
1294 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), aLen3dU, myFirst[i] );
1295 if( AbPnt.IsDone() ) {
1296 par = AbPnt.Parameter();
1299 return myC3dAdaptor[ i ].Value(par);
1302 //================================================================================
1304 * \brief Return wires of a face as StdMeshers_FaceSide's
1306 //================================================================================
1308 TSideVector StdMeshers_FaceSide::GetFaceWires(const TopoDS_Face& theFace,
1309 SMESH_Mesh & theMesh,
1310 const bool theIgnoreMediumNodes,
1312 SMESH_MesherHelper* theFaceHelper,
1313 SMESH_ProxyMesh::Ptr theProxyMesh,
1314 const bool theCheckVertexNodes)
1316 SMESH_MesherHelper helper( theMesh );
1317 if ( theFaceHelper && theFaceHelper->GetSubShape() == theFace )
1318 helper.CopySubShapeInfo( *theFaceHelper );
1320 list< TopoDS_Edge > edges, internalEdges;
1321 list< int > nbEdgesInWires;
1322 int nbWires = SMESH_Block::GetOrderedEdges (theFace, edges, nbEdgesInWires);
1324 // split list of all edges into separate wires
1325 TSideVector wires( nbWires );
1326 list< int >::iterator nbE = nbEdgesInWires.begin();
1327 list< TopoDS_Edge >::iterator from = edges.begin(), to = from;
1328 for ( int iW = 0; iW < nbWires; ++iW, ++nbE )
1330 std::advance( to, *nbE );
1331 if ( *nbE == 0 ) // Issue 0020676
1335 wires.resize( nbWires );
1338 list< TopoDS_Edge > wireEdges( from, to );
1339 // assure that there is a node on the first vertex
1340 // as StdMeshers_FaceSide::GetUVPtStruct() requires
1341 if ( wireEdges.front().Orientation() != TopAbs_INTERNAL ) // Issue 0020676
1343 if ( theCheckVertexNodes )
1344 while ( !SMESH_Algo::VertexNode( TopExp::FirstVertex( wireEdges.front(), true),
1345 theMesh.GetMeshDS()))
1347 wireEdges.splice(wireEdges.end(), wireEdges,
1348 wireEdges.begin(), ++wireEdges.begin());
1349 if ( from->IsSame( wireEdges.front() )) {
1351 ( new SMESH_ComputeError(COMPERR_BAD_INPUT_MESH,"No nodes on vertices"));
1352 return TSideVector(0);
1356 else if ( *nbE > 1 ) // Issue 0020676 (Face_pb_netgen.brep) - several internal edges in a wire
1358 internalEdges.splice( internalEdges.end(), wireEdges, ++wireEdges.begin(), wireEdges.end());
1361 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, wireEdges, &theMesh,
1362 /*isForward=*/true, theIgnoreMediumNodes,
1363 &helper, theProxyMesh );
1364 wires[ iW ] = StdMeshers_FaceSidePtr( wire );
1367 while ( !internalEdges.empty() )
1369 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, internalEdges.back(), &theMesh,
1370 /*isForward=*/true, theIgnoreMediumNodes,
1371 &helper, theProxyMesh );
1372 wires.push_back( StdMeshers_FaceSidePtr( wire ));
1373 internalEdges.pop_back();
1378 //================================================================================
1380 * \brief Return 1st vertex of the i-the edge
1382 //================================================================================
1384 TopoDS_Vertex StdMeshers_FaceSide::FirstVertex(int i) const
1387 if ( i < NbEdges() )
1389 v = myEdge[i].Orientation() <= TopAbs_REVERSED ? // FORWARD || REVERSED
1390 TopExp::FirstVertex( myEdge[i], 1 ) :
1391 TopoDS::Vertex( TopoDS_Iterator( myEdge[i] ).Value() );
1396 //================================================================================
1398 * \brief Return last vertex of the i-the edge
1400 //================================================================================
1402 TopoDS_Vertex StdMeshers_FaceSide::LastVertex(int i) const
1405 if ( i < NbEdges() )
1407 const TopoDS_Edge& edge = i<0 ? myEdge[ NbEdges() + i ] : myEdge[i];
1408 if ( edge.Orientation() <= TopAbs_REVERSED ) // FORWARD || REVERSED
1409 v = TopExp::LastVertex( edge, 1 );
1411 for ( TopoDS_Iterator vIt( edge ); vIt.More(); vIt.Next() )
1412 v = TopoDS::Vertex( vIt.Value() );
1417 //================================================================================
1419 * \brief Return \c true if the chain of EDGEs is closed
1421 //================================================================================
1423 bool StdMeshers_FaceSide::IsClosed() const
1425 return myEdge.empty() ? false : FirstVertex().IsSame( LastVertex() );
1428 //================================================================================
1430 * \brief Return a helper initialized with the FACE
1432 //================================================================================
1434 SMESH_MesherHelper* StdMeshers_FaceSide::FaceHelper() const
1436 StdMeshers_FaceSide* me = const_cast< StdMeshers_FaceSide* >( this );
1437 if ( !myHelper && myProxyMesh )
1439 me->myHelper = new SMESH_MesherHelper( *myProxyMesh->GetMesh() );
1440 me->myHelper->SetSubShape( myFace );
1442 return me->myHelper;