1 // Copyright (C) 2007-2011 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 // File : 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_Mesh.hxx"
36 #include "SMESH_MesherHelper.hxx"
37 #include "SMESH_ComputeError.hxx"
38 #include "SMESH_Block.hxx"
40 #include <Adaptor2d_Curve2d.hxx>
41 #include <BRepAdaptor_CompCurve.hxx>
42 #include <BRep_Builder.hxx>
43 #include <BRep_Tool.hxx>
44 #include <GCPnts_AbscissaPoint.hxx>
45 #include <Geom2dAdaptor_Curve.hxx>
47 #include <TopExp_Explorer.hxx>
49 #include <TopoDS_Face.hxx>
50 #include <TopoDS_Vertex.hxx>
51 #include <TopoDS_Wire.hxx>
55 #include "utilities.h"
57 //================================================================================
59 * \brief Constructor of a side of one edge
60 * \param theFace - the face
61 * \param theEdge - the edge
63 //================================================================================
65 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
66 const TopoDS_Edge& theEdge,
68 const bool theIsForward,
69 const bool theIgnoreMediumNodes)
71 list<TopoDS_Edge> edges(1,theEdge);
72 *this = StdMeshers_FaceSide( theFace, edges, theMesh, theIsForward, theIgnoreMediumNodes );
75 //================================================================================
77 * \brief Constructor of a side of several edges
78 * \param theFace - the face
79 * \param theEdge - the edge
81 //================================================================================
83 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
84 list<TopoDS_Edge>& theEdges,
86 const bool theIsForward,
87 const bool theIgnoreMediumNodes)
89 int nbEdges = theEdges.size();
90 myEdge.resize( nbEdges );
91 myEdgeID.resize( nbEdges );
92 myC2d.resize( nbEdges );
93 myC3dAdaptor.resize( nbEdges );
94 myFirst.resize( nbEdges );
95 myLast.resize( nbEdges );
96 myNormPar.resize( nbEdges );
97 myEdgeLength.resize( nbEdges );
98 myIsUniform.resize( nbEdges, true );
100 myNbPonits = myNbSegments = 0;
102 myMissingVertexNodes = false;
103 myIgnoreMediumNodes = theIgnoreMediumNodes;
104 myDefaultPnt2d = gp_Pnt2d( 1e+100, 1e+100 );
105 if ( nbEdges == 0 ) return;
107 SMESHDS_Mesh* meshDS = theMesh->GetMeshDS();
110 list<TopoDS_Edge>::iterator edge = theEdges.begin();
111 TopoDS_Iterator vExp;
112 for ( int index = 0; edge != theEdges.end(); ++index, ++edge )
114 int i = theIsForward ? index : nbEdges - index - 1;
115 myEdgeLength[i] = SMESH_Algo::EdgeLength( *edge );
116 if ( myEdgeLength[i] < DBL_MIN ) nbDegen++;
117 myLength += myEdgeLength[i];
119 myEdgeID[i] = meshDS->ShapeToIndex( *edge );
120 if ( !theIsForward ) myEdge[i].Reverse();
122 if ( theFace.IsNull() )
123 BRep_Tool::Range( *edge, myFirst[i], myLast[i] );
125 myC2d[i] = BRep_Tool::CurveOnSurface( *edge, theFace, myFirst[i], myLast[i] );
126 if ( myEdge[i].Orientation() == TopAbs_REVERSED )
127 std::swap( myFirst[i], myLast[i] );
129 if ( SMESHDS_SubMesh* sm = meshDS->MeshElements( *edge )) {
130 int nbN = sm->NbNodes();
131 if ( theIgnoreMediumNodes ) {
132 SMDS_ElemIteratorPtr elemIt = sm->GetElements();
133 if ( elemIt->more() && elemIt->next()->IsQuadratic() )
134 nbN -= sm->NbElements();
137 myNbSegments += sm->NbElements();
139 // TopExp::FirstVertex() and TopExp::LastVertex() return NULL from INTERNAL edge
140 vExp.Initialize( *edge );
141 if ( vExp.Value().Orientation() == TopAbs_REVERSED ) vExp.Next();
142 if ( SMESH_Algo::VertexNode( TopoDS::Vertex( vExp.Value()), meshDS ))
143 myNbPonits += 1; // for the first end
145 myMissingVertexNodes = true;
147 // check if edge has non-uniform parametrization (issue 0020705)
148 if ( !myC2d[i].IsNull() && myEdgeLength[i] > DBL_MIN)
150 Geom2dAdaptor_Curve A2dC( myC2d[i],
151 std::min( myFirst[i], myLast[i] ),
152 std::max( myFirst[i], myLast[i] ));
153 double p2 = myFirst[i]+(myLast[i]-myFirst[i])/2., p4 = myFirst[i]+(myLast[i]-myFirst[i])/4.;
154 double d2 = GCPnts_AbscissaPoint::Length( A2dC, myFirst[i], p2 );
155 double d4 = GCPnts_AbscissaPoint::Length( A2dC, myFirst[i], p4 );
156 //cout<<"len = "<<len<<" d2 = "<<d2<<" fabs(2*d2/len-1.0) = "<<fabs(2*d2/len-1.0)<<endl;
157 myIsUniform[i] = !( fabs(2*d2/myEdgeLength[i]-1.0) > 0.01 || fabs(2*d4/d2-1.0) > 0.01 );
158 if ( !myIsUniform[i] )
162 Handle(Geom_Curve) C3d = BRep_Tool::Curve(myEdge[i],L,fp,lp);
163 myC3dAdaptor[i].Load( C3d, fp,lp );
167 vExp.Initialize( theEdges.back() );
168 if ( vExp.Value().Orientation() != TopAbs_REVERSED ) vExp.Next();
171 if ( SMESH_Algo::VertexNode( TopoDS::Vertex( vExp.Value()), meshDS ))
172 myNbPonits++; // for the last end
174 myMissingVertexNodes = true;
176 if ( nbEdges > 1 && myLength > DBL_MIN ) {
177 const double degenNormLen = 1.e-5;
178 double totLength = myLength;
180 totLength += myLength * degenNormLen * nbDegen;
181 double prevNormPar = 0;
182 for ( int i = 0; i < nbEdges; ++i ) {
183 if ( myEdgeLength[ i ] < DBL_MIN )
184 myEdgeLength[ i ] = myLength * degenNormLen;
185 myNormPar[ i ] = prevNormPar + myEdgeLength[i]/totLength;
186 prevNormPar = myNormPar[ i ];
189 myNormPar[nbEdges-1] = 1.;
193 //================================================================================
195 * \brief Constructor of a side for vertex using data from other FaceSide
196 * \param theVertex - the vertex
197 * \param theSide - the side
199 //================================================================================
201 StdMeshers_FaceSide::StdMeshers_FaceSide(const SMDS_MeshNode* theNode,
202 const gp_Pnt2d thePnt2d,
203 const StdMeshers_FaceSide* theSide)
207 myMesh = theSide->GetMesh();
208 myDefaultPnt2d = thePnt2d;
210 myPoints = theSide->GetUVPtStruct();
211 myNbPonits = myNbSegments = myPoints.size();
212 std::vector<uvPtStruct>::iterator it = myPoints.begin();
213 for(; it!=myPoints.end(); it++) {
214 (*it).u = thePnt2d.X();
215 (*it).v = thePnt2d.Y();
217 (*it).node = theNode;
221 //================================================================================
223 * \brief Return info on nodes on the side
224 * \retval UVPtStruct* - array of data structures
226 //================================================================================
228 const vector<UVPtStruct>& StdMeshers_FaceSide::GetUVPtStruct(bool isXConst,
229 double constValue) const
231 if ( myPoints.empty() ) {
233 if ( NbEdges() == 0 ) return myPoints;
235 SMESHDS_Mesh* meshDS = myMesh->GetMeshDS();
236 SMESH_MesherHelper helper(*myMesh);
239 // sort nodes of all edges putting them into a map
241 map< double, const SMDS_MeshNode*> u2node;
243 for ( int i = 0; i < myEdge.size(); ++i )
245 // Put 1st vertex node of a current edge
246 TopoDS_Vertex VV[2]; // TopExp::FirstVertex() returns NULL for INTERNAL edge
247 VV[0] = SMESH_MesherHelper::IthVertex( 0, myEdge[i]);
248 VV[1] = SMESH_MesherHelper::IthVertex( 1, myEdge[i]);
249 const SMDS_MeshNode* node = SMESH_Algo::VertexNode( VV[0], meshDS );
250 double prevNormPar = ( i == 0 ? 0 : myNormPar[ i-1 ]); // normalized param
251 if ( node ) { // nodes on internal vertices may be missing
252 u2node.insert( u2node.end(), make_pair( prevNormPar, node ));
255 MESSAGE(" NO NODE on VERTEX" );
259 // Put internal nodes
260 SMESHDS_SubMesh* sm = meshDS->MeshElements( myEdge[i] );
262 vector< pair< double, const SMDS_MeshNode*> > u2nodeVec;
263 u2nodeVec.reserve( sm->NbNodes() );
264 SMDS_NodeIteratorPtr nItr = sm->GetNodes();
265 double paramSize = myLast[i] - myFirst[i];
266 double r = myNormPar[i] - prevNormPar;
267 if ( !myIsUniform[i] )
268 while ( nItr->more() )
270 const SMDS_MeshNode* node = nItr->next();
271 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
273 double u = helper.GetNodeU( myEdge[i], node, 0, ¶mOK );
274 double aLenU = GCPnts_AbscissaPoint::Length
275 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), myFirst[i], u );
276 if ( myEdgeLength[i] < aLenU ) // nonregression test "3D_mesh_NETGEN/G6"
281 double normPar = prevNormPar + r*aLenU/myEdgeLength[i];
282 u2nodeVec.push_back( make_pair( normPar, node ));
284 nItr = sm->GetNodes();
285 if ( u2nodeVec.empty() )
286 while ( nItr->more() )
288 const SMDS_MeshNode* node = nItr->next();
289 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
291 double u = helper.GetNodeU( myEdge[i], node, 0, ¶mOK );
293 // paramSize is signed so orientation is taken into account
294 double normPar = prevNormPar + r * ( u - myFirst[i] ) / paramSize;
295 u2nodeVec.push_back( make_pair( normPar, node ));
297 for ( size_t j = 0; j < u2nodeVec.size(); ++j )
298 u2node.insert( u2node.end(), u2nodeVec[j] );
300 // Put 2nd vertex node for a last edge
301 if ( i+1 == myEdge.size() ) {
302 node = SMESH_Algo::VertexNode( VV[1], meshDS );
304 MESSAGE(" NO NODE on VERTEX" );
307 u2node.insert( u2node.end(), make_pair( 1., node ));
310 if ( u2node.size() != myNbPonits ) {
311 MESSAGE("Wrong node parameters on edges, u2node.size():"
312 <<u2node.size()<<" != myNbPonits:"<<myNbPonits);
316 // fill array of UVPtStruct
318 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myPoints );
319 points->resize( myNbPonits );
322 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
323 map< double, const SMDS_MeshNode*>::iterator u_node = u2node.begin();
324 for (int i = 0 ; u_node != u2node.end(); ++u_node, ++i ) {
325 UVPtStruct & uvPt = (*points)[i];
326 uvPt.node = u_node->second;
327 uvPt.x = uvPt.y = uvPt.normParam = u_node->first;
328 if ( isXConst ) uvPt.x = constValue;
329 else uvPt.y = constValue;
330 const SMDS_EdgePosition* epos =
331 dynamic_cast<const SMDS_EdgePosition*>(uvPt.node->GetPosition());
332 if (( myNormPar[ EdgeIndex ] < uvPt.normParam ) ||
333 ( epos && uvPt.node->getshapeId() != myEdgeID[ EdgeIndex ])) // for myMissingVertexNodes
335 prevNormPar = myNormPar[ EdgeIndex ];
338 if ( EdgeIndex >= myEdge.size() ) {
340 MESSAGE ( "WRONg EdgeIndex " << 1+EdgeIndex
341 << " myNormPar.size()="<<myNormPar.size()
342 << " myNormPar["<< EdgeIndex<<"]="<< myNormPar[ EdgeIndex ]
343 << " uvPt.normParam="<<uvPt.normParam );
346 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
349 uvPt.param = epos->GetUParameter();
352 double r = ( uvPt.normParam - prevNormPar )/ paramSize;
353 // uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
354 uvPt.param = ( r > 0.5 ? myLast[EdgeIndex] : myFirst[EdgeIndex] );
356 if ( !myC2d[ EdgeIndex ].IsNull() ) {
357 gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
362 uvPt.u = uvPt.v = 1e+100;
369 //================================================================================
371 * \brief Falsificate info on nodes
372 * \param nbSeg - nb of segments on the side
373 * \retval UVPtStruct* - array of data structures
375 //================================================================================
377 const vector<UVPtStruct>& StdMeshers_FaceSide::SimulateUVPtStruct(int nbSeg,
379 double constValue) const
381 if ( myFalsePoints.empty() ) {
383 if ( NbEdges() == 0 ) return myFalsePoints;
385 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myFalsePoints );
386 points->resize( nbSeg+1 );
389 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
390 for (int i = 0 ; i < myFalsePoints.size(); ++i ) {
391 double normPar = double(i) / double(nbSeg);
392 UVPtStruct & uvPt = (*points)[i];
394 uvPt.x = uvPt.y = uvPt.param = uvPt.normParam = normPar;
395 if ( isXConst ) uvPt.x = constValue;
396 else uvPt.y = constValue;
397 if ( myNormPar[ EdgeIndex ] < normPar ) {
398 prevNormPar = myNormPar[ EdgeIndex ];
400 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
402 double r = ( normPar - prevNormPar )/ paramSize;
403 uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
404 if ( !myC2d[ EdgeIndex ].IsNull() ) {
405 gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
410 uvPt.u = uvPt.v = 1e+100;
414 return myFalsePoints;
417 //=======================================================================
418 //function : GetOrderedNodes
419 //purpose : Return nodes in the order they encounter while walking along the side
420 //=======================================================================
422 std::vector<const SMDS_MeshNode*> StdMeshers_FaceSide::GetOrderedNodes() const
424 vector<const SMDS_MeshNode*> resultNodes;
425 if ( myPoints.empty() )
427 if ( NbEdges() == 0 ) return resultNodes;
429 SMESHDS_Mesh* meshDS = myMesh->GetMeshDS();
430 SMESH_MesherHelper helper(*myMesh);
433 // Sort nodes of all edges putting them into a map
435 map< double, const SMDS_MeshNode*> u2node;
436 for ( int i = 0; i < myEdge.size(); ++i )
438 // Put 1st vertex node of a current edge
439 TopoDS_Vertex VV[2]; // TopExp::FirstVertex() returns NULL for INTERNAL edge
440 VV[0] = SMESH_MesherHelper::IthVertex( 0, myEdge[i]);
441 VV[1] = SMESH_MesherHelper::IthVertex( 1, myEdge[i]);
442 const SMDS_MeshNode* node = SMESH_Algo::VertexNode( VV[0], meshDS );
443 double prevNormPar = ( i == 0 ? 0 : myNormPar[ i-1 ]); // normalized param
444 if ( node ) { // nodes on internal vertices may be missing
445 u2node.insert( make_pair( prevNormPar, node ));
448 MESSAGE(" NO NODE on VERTEX" );
452 // Put internal nodes
453 SMESHDS_SubMesh* sm = meshDS->MeshElements( myEdge[i] );
455 SMDS_NodeIteratorPtr nItr = sm->GetNodes();
456 double paramSize = myLast[i] - myFirst[i];
457 double r = myNormPar[i] - prevNormPar;
458 while ( nItr->more() )
460 const SMDS_MeshNode* node = nItr->next();
461 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
463 double u = helper.GetNodeU( myEdge[i], node, 0, ¶mOK );
465 // paramSize is signed so orientation is taken into account
466 double normPar = prevNormPar + r * ( u - myFirst[i] ) / paramSize;
467 u2node.insert( u2node.end(), make_pair( normPar, node ));
470 // Put 2nd vertex node for a last edge
471 if ( i+1 == myEdge.size() ) {
472 node = SMESH_Algo::VertexNode( VV[1], meshDS );
476 u2node.insert( u2node.end(), make_pair( 1., node ));
480 // Fill the result vector
482 if ( u2node.size() == myNbPonits )
484 resultNodes.reserve( u2node.size() );
485 map< double, const SMDS_MeshNode*>::iterator u2n = u2node.begin();
486 for ( ; u2n != u2node.end(); ++u2n )
487 resultNodes.push_back( u2n->second );
492 resultNodes.resize( myPoints.size() );
493 for ( size_t i = 0; i < myPoints.size(); ++i )
494 resultNodes[i] = myPoints[i].node;
500 //================================================================================
502 * \brief reverse order of vector elements
503 * \param vec - vector to reverse
505 //================================================================================
507 template <typename T > void reverse(vector<T> & vec)
509 for ( int f=0, r=vec.size()-1; f < r; ++f, --r )
510 std::swap( vec[f], vec[r] );
513 //================================================================================
515 * \brief Change orientation of side geometry
517 //================================================================================
519 void StdMeshers_FaceSide::Reverse()
521 int nbEdges = myEdge.size();
522 for ( int i = nbEdges-1; i >= 0; --i ) {
523 std::swap( myFirst[i], myLast[i] );
525 if ( i > 0 ) // at the first loop 1. is overwritten
526 myNormPar[i] = 1 - myNormPar[i-1];
532 reverse( myC3dAdaptor );
535 reverse( myNormPar );
536 reverse( myEdgeLength );
537 reverse( myIsUniform );
541 myNormPar[nbEdges-1]=1.;
543 myFalsePoints.clear();
547 //================================================================================
549 * \brief Show side features
551 //================================================================================
553 void StdMeshers_FaceSide::dump(const char* msg) const
556 if (msg) MESSAGE ( std::endl << msg );
557 MESSAGE_BEGIN ("NB EDGES: "<< myEdge.size() );
558 MESSAGE_ADD ( "nbPoints: "<<myNbPonits<<" vecSize: " << myPoints.size()<<" "<<myFalsePoints.size() );
559 for ( int i=0; i<myEdge.size(); ++i)
561 MESSAGE_ADD ( "\t"<<i+1 );
562 MESSAGE_ADD ( "\tEDGE: " );
563 if (myEdge[i].IsNull()) {
564 MESSAGE_ADD ( "NULL" );
567 TopAbs::Print(myEdge[i].Orientation(),cout)<<" "<<myEdge[i].TShape().operator->()<<endl;
568 MESSAGE_ADD ( "\tV1: " << TopExp::FirstVertex( myEdge[i], 1).TShape().operator->()
569 << " V2: " << TopExp::LastVertex( myEdge[i], 1).TShape().operator->() );
571 MESSAGE_ADD ( "\tC2d: ");
573 if (myC2d[i].IsNull()) {
574 MESSAGE_ADD ( "NULL" );
577 MESSAGE_ADD ( myC2d[i].operator->() );
580 MESSAGE_ADD ( "\tF: "<<myFirst[i]<< " L: "<< myLast[i] );
581 MESSAGE_END ( "\tnormPar: "<<myNormPar[i]<<endl );
586 //================================================================================
588 * \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
589 * \retval Adaptor2d_Curve2d* -
591 //================================================================================
593 struct Adaptor2dCurve2d : public Adaptor2d_Curve2d
595 const StdMeshers_FaceSide* mySide;
596 Adaptor2dCurve2d(const StdMeshers_FaceSide* faceSide):mySide(faceSide) {}
597 gp_Pnt2d Value(const Standard_Real U) const { return mySide->Value2d( U ); }
598 Standard_Real FirstParameter() const { return 0; }
599 Standard_Real LastParameter() const { return 1; }
602 Adaptor2d_Curve2d* StdMeshers_FaceSide::GetCurve2d() const
604 return new Adaptor2dCurve2d( this );
607 //================================================================================
609 * \brief Creates a fully functional Adaptor_Curve
611 //================================================================================
613 BRepAdaptor_CompCurve* StdMeshers_FaceSide::GetCurve3d() const
615 if ( myEdge.empty() )
619 BRep_Builder aBuilder;
620 aBuilder.MakeWire(aWire);
621 for ( int i=0; i<myEdge.size(); ++i )
622 aBuilder.Add( aWire, myEdge[i] );
624 if ( myEdge.size() == 2 && FirstVertex().IsSame( LastVertex() ))
625 aWire.Closed(true); // issue 0021141
627 return new BRepAdaptor_CompCurve( aWire );
631 //================================================================================
633 * \brief Return 2D point by normalized parameter
634 * \param U - normalized parameter value
635 * \retval gp_Pnt2d - point
637 //================================================================================
639 gp_Pnt2d StdMeshers_FaceSide::Value2d(double U) const
641 if ( !myC2d[0].IsNull() ) {
642 int i = EdgeIndex( U );
643 double prevU = i ? myNormPar[ i-1 ] : 0;
644 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
646 double par = myFirst[i] * ( 1 - r ) + myLast[i] * r;
648 // check parametrization of curve
649 if( !myIsUniform[i] )
651 double aLen3dU = r * myEdgeLength[i] * ( myFirst[i]>myLast[i] ? -1. : 1.);
652 GCPnts_AbscissaPoint AbPnt
653 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), aLen3dU, myFirst[i] );
654 if( AbPnt.IsDone() ) {
655 par = AbPnt.Parameter();
658 return myC2d[ i ]->Value(par);
661 return myDefaultPnt2d;
664 //================================================================================
666 * \brief Return wires of a face as StdMeshers_FaceSide's
668 //================================================================================
670 TSideVector StdMeshers_FaceSide::GetFaceWires(const TopoDS_Face& theFace,
671 SMESH_Mesh & theMesh,
672 const bool theIgnoreMediumNodes,
676 list< TopoDS_Edge > edges, internalEdges;
677 list< int > nbEdgesInWires;
678 int nbWires = SMESH_Block::GetOrderedEdges (theFace, V1, edges, nbEdgesInWires);
680 // split list of all edges into separate wires
681 TSideVector wires( nbWires );
682 list< int >::iterator nbE = nbEdgesInWires.begin();
683 list< TopoDS_Edge >::iterator from = edges.begin(), to = from;
684 for ( int iW = 0; iW < nbWires; ++iW, ++nbE )
686 std::advance( to, *nbE );
687 if ( *nbE == 0 ) // Issue 0020676
691 wires.resize( nbWires );
694 list< TopoDS_Edge > wireEdges( from, to );
695 // assure that there is a node on the first vertex
696 // as StdMeshers_FaceSide::GetUVPtStruct() requires
697 if ( wireEdges.front().Orientation() != TopAbs_INTERNAL ) // Issue 0020676
699 while ( !SMESH_Algo::VertexNode( TopExp::FirstVertex( wireEdges.front(), true),
700 theMesh.GetMeshDS()))
702 wireEdges.splice(wireEdges.end(), wireEdges,
703 wireEdges.begin(), ++wireEdges.begin());
704 if ( from->IsSame( wireEdges.front() )) {
706 ( new SMESH_ComputeError(COMPERR_BAD_INPUT_MESH,"No nodes on vertices"));
707 return TSideVector(0);
711 else if ( *nbE > 1 ) // Issue 0020676 (Face_pb_netgen.brep) - several internal edges in a wire
713 internalEdges.splice( internalEdges.end(), wireEdges, ++wireEdges.begin(), wireEdges.end());
716 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, wireEdges, &theMesh,
717 /*isForward=*/true, theIgnoreMediumNodes);
718 wires[ iW ] = StdMeshers_FaceSidePtr( wire );
721 while ( !internalEdges.empty() )
723 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, internalEdges.back(), &theMesh,
724 /*isForward=*/true, theIgnoreMediumNodes);
725 wires.push_back( StdMeshers_FaceSidePtr( wire ));
726 internalEdges.pop_back();
731 //================================================================================
733 * \brief Return 1st vertex of the i-the edge
735 //================================================================================
737 TopoDS_Vertex StdMeshers_FaceSide::FirstVertex(int i) const
742 v = myEdge[i].Orientation() <= TopAbs_REVERSED ? // FORWARD || REVERSED
743 TopExp::FirstVertex( myEdge[i], 1 ) :
744 TopoDS::Vertex( TopoDS_Iterator( myEdge[i] ).Value() );
749 //================================================================================
751 * \brief Return last vertex of the i-the edge
753 //================================================================================
755 TopoDS_Vertex StdMeshers_FaceSide::LastVertex(int i) const
760 const TopoDS_Edge& edge = i<0 ? myEdge[ NbEdges() + i ] : myEdge[i];
761 if ( edge.Orientation() <= TopAbs_REVERSED ) // FORWARD || REVERSED
762 v = TopExp::LastVertex( edge, 1 );
764 for ( TopoDS_Iterator vIt( edge ); vIt.More(); vIt.Next() )
765 v = TopoDS::Vertex( vIt.Value() );