1 // Copyright (C) 2007-2012 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 // File : 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 if ( 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 helper.SetSubShape( myEdge[i] );
268 helper.ToFixNodeParameters( true );
269 if ( !myIsUniform[i] )
270 while ( nItr->more() )
272 const SMDS_MeshNode* node = nItr->next();
273 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
275 double u = helper.GetNodeU( myEdge[i], node, 0, ¶mOK );
276 double aLenU = GCPnts_AbscissaPoint::Length
277 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), myFirst[i], u );
278 if ( myEdgeLength[i] < aLenU ) // nonregression test "3D_mesh_NETGEN/G6"
283 double normPar = prevNormPar + r*aLenU/myEdgeLength[i];
284 u2nodeVec.push_back( make_pair( normPar, node ));
286 nItr = sm->GetNodes();
287 if ( u2nodeVec.empty() )
288 while ( nItr->more() )
290 const SMDS_MeshNode* node = nItr->next();
291 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
293 double u = helper.GetNodeU( myEdge[i], node, 0, ¶mOK );
295 // paramSize is signed so orientation is taken into account
296 double normPar = prevNormPar + r * ( u - myFirst[i] ) / paramSize;
297 u2nodeVec.push_back( make_pair( normPar, node ));
299 for ( size_t j = 0; j < u2nodeVec.size(); ++j )
300 u2node.insert( u2node.end(), u2nodeVec[j] );
303 // Put 2nd vertex node for a last edge
304 if ( i+1 == myEdge.size() ) {
305 node = SMESH_Algo::VertexNode( VV[1], meshDS );
307 MESSAGE(" NO NODE on VERTEX" );
310 u2node.insert( u2node.end(), make_pair( 1., node ));
313 if ( u2node.size() != myNbPonits ) {
314 MESSAGE("Wrong node parameters on edges, u2node.size():"
315 <<u2node.size()<<" != myNbPonits:"<<myNbPonits);
319 // fill array of UVPtStruct
321 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myPoints );
322 points->resize( myNbPonits );
325 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
326 map< double, const SMDS_MeshNode*>::iterator u_node = u2node.begin();
327 for (int i = 0 ; u_node != u2node.end(); ++u_node, ++i ) {
328 UVPtStruct & uvPt = (*points)[i];
329 uvPt.node = u_node->second;
330 uvPt.x = uvPt.y = uvPt.normParam = u_node->first;
331 if ( isXConst ) uvPt.x = constValue;
332 else uvPt.y = constValue;
333 const SMDS_EdgePosition* epos =
334 dynamic_cast<const SMDS_EdgePosition*>(uvPt.node->GetPosition());
335 if (( myNormPar[ EdgeIndex ] < uvPt.normParam ) ||
336 ( epos && uvPt.node->getshapeId() != myEdgeID[ EdgeIndex ])) // for myMissingVertexNodes
338 prevNormPar = myNormPar[ EdgeIndex ];
341 if ( EdgeIndex >= myEdge.size() ) {
343 MESSAGE ( "WRONg EdgeIndex " << 1+EdgeIndex
344 << " myNormPar.size()="<<myNormPar.size()
345 << " myNormPar["<< EdgeIndex<<"]="<< myNormPar[ EdgeIndex ]
346 << " uvPt.normParam="<<uvPt.normParam );
349 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
352 uvPt.param = epos->GetUParameter();
355 double r = ( uvPt.normParam - prevNormPar )/ paramSize;
356 // uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
357 uvPt.param = ( r > 0.5 ? myLast[EdgeIndex] : myFirst[EdgeIndex] );
359 if ( !myC2d[ EdgeIndex ].IsNull() ) {
360 gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
365 uvPt.u = uvPt.v = 1e+100;
372 //================================================================================
374 * \brief Falsificate info on nodes
375 * \param nbSeg - nb of segments on the side
376 * \retval UVPtStruct* - array of data structures
378 //================================================================================
380 const vector<UVPtStruct>& StdMeshers_FaceSide::SimulateUVPtStruct(int nbSeg,
382 double constValue) const
384 if ( myFalsePoints.empty() ) {
386 if ( NbEdges() == 0 ) return myFalsePoints;
388 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myFalsePoints );
389 points->resize( nbSeg+1 );
392 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
393 for (int i = 0 ; i < myFalsePoints.size(); ++i ) {
394 double normPar = double(i) / double(nbSeg);
395 UVPtStruct & uvPt = (*points)[i];
397 uvPt.x = uvPt.y = uvPt.param = uvPt.normParam = normPar;
398 if ( isXConst ) uvPt.x = constValue;
399 else uvPt.y = constValue;
400 if ( myNormPar[ EdgeIndex ] < normPar ) {
401 prevNormPar = myNormPar[ EdgeIndex ];
403 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
405 double r = ( normPar - prevNormPar )/ paramSize;
406 uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
407 if ( !myC2d[ EdgeIndex ].IsNull() ) {
408 gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
413 uvPt.u = uvPt.v = 1e+100;
417 return myFalsePoints;
420 //=======================================================================
421 //function : GetOrderedNodes
422 //purpose : Return nodes in the order they encounter while walking along the side
423 //=======================================================================
425 std::vector<const SMDS_MeshNode*> StdMeshers_FaceSide::GetOrderedNodes() const
427 vector<const SMDS_MeshNode*> resultNodes;
428 if ( myPoints.empty() )
430 if ( NbEdges() == 0 ) return resultNodes;
432 SMESHDS_Mesh* meshDS = myMesh->GetMeshDS();
433 SMESH_MesherHelper helper(*myMesh);
436 // Sort nodes of all edges putting them into a map
438 map< double, const SMDS_MeshNode*> u2node;
439 for ( int i = 0; i < myEdge.size(); ++i )
441 // Put 1st vertex node of a current edge
442 TopoDS_Vertex VV[2]; // TopExp::FirstVertex() returns NULL for INTERNAL edge
443 VV[0] = SMESH_MesherHelper::IthVertex( 0, myEdge[i]);
444 VV[1] = SMESH_MesherHelper::IthVertex( 1, myEdge[i]);
445 const SMDS_MeshNode* node = SMESH_Algo::VertexNode( VV[0], meshDS );
446 double prevNormPar = ( i == 0 ? 0 : myNormPar[ i-1 ]); // normalized param
447 if ( node ) { // nodes on internal vertices may be missing
448 u2node.insert( make_pair( prevNormPar, node ));
451 MESSAGE(" NO NODE on VERTEX" );
455 // Put internal nodes
456 if ( SMESHDS_SubMesh* sm = meshDS->MeshElements( myEdge[i] ))
458 SMDS_NodeIteratorPtr nItr = sm->GetNodes();
459 double paramSize = myLast[i] - myFirst[i];
460 double r = myNormPar[i] - prevNormPar;
461 helper.SetSubShape( myEdge[i] );
462 helper.ToFixNodeParameters( true );
463 while ( nItr->more() )
465 const SMDS_MeshNode* node = nItr->next();
466 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
468 double u = helper.GetNodeU( myEdge[i], node, 0, ¶mOK );
470 // paramSize is signed so orientation is taken into account
471 double normPar = prevNormPar + r * ( u - myFirst[i] ) / paramSize;
472 u2node.insert( u2node.end(), make_pair( normPar, node ));
476 // Put 2nd vertex node for a last edge
477 if ( i+1 == myEdge.size() ) {
478 node = SMESH_Algo::VertexNode( VV[1], meshDS );
482 u2node.insert( u2node.end(), make_pair( 1., node ));
486 // Fill the result vector
488 if ( u2node.size() == myNbPonits )
490 resultNodes.reserve( u2node.size() );
491 map< double, const SMDS_MeshNode*>::iterator u2n = u2node.begin();
492 for ( ; u2n != u2node.end(); ++u2n )
493 resultNodes.push_back( u2n->second );
498 resultNodes.resize( myPoints.size() );
499 for ( size_t i = 0; i < myPoints.size(); ++i )
500 resultNodes[i] = myPoints[i].node;
506 //================================================================================
508 * \brief reverse order of vector elements
509 * \param vec - vector to reverse
511 //================================================================================
513 template <typename T > void reverse(vector<T> & vec)
515 for ( int f=0, r=vec.size()-1; f < r; ++f, --r )
516 std::swap( vec[f], vec[r] );
519 //================================================================================
521 * \brief Change orientation of side geometry
523 //================================================================================
525 void StdMeshers_FaceSide::Reverse()
527 int nbEdges = myEdge.size();
528 for ( int i = nbEdges-1; i >= 0; --i ) {
529 std::swap( myFirst[i], myLast[i] );
531 if ( i > 0 ) // at the first loop 1. is overwritten
532 myNormPar[i] = 1 - myNormPar[i-1];
538 reverse( myC3dAdaptor );
541 reverse( myNormPar );
542 reverse( myEdgeLength );
543 reverse( myIsUniform );
547 myNormPar[nbEdges-1]=1.;
549 myFalsePoints.clear();
553 //================================================================================
555 * \brief Show side features
557 //================================================================================
559 void StdMeshers_FaceSide::dump(const char* msg) const
562 if (msg) MESSAGE ( std::endl << msg );
563 MESSAGE_BEGIN ("NB EDGES: "<< myEdge.size() );
564 MESSAGE_ADD ( "nbPoints: "<<myNbPonits<<" vecSize: " << myPoints.size()<<" "<<myFalsePoints.size() );
565 for ( int i=0; i<myEdge.size(); ++i)
567 MESSAGE_ADD ( "\t"<<i+1 );
568 MESSAGE_ADD ( "\tEDGE: " );
569 if (myEdge[i].IsNull()) {
570 MESSAGE_ADD ( "NULL" );
573 TopAbs::Print(myEdge[i].Orientation(),cout)<<" "<<myEdge[i].TShape().operator->()<<endl;
574 MESSAGE_ADD ( "\tV1: " << TopExp::FirstVertex( myEdge[i], 1).TShape().operator->()
575 << " V2: " << TopExp::LastVertex( myEdge[i], 1).TShape().operator->() );
577 MESSAGE_ADD ( "\tC2d: ");
579 if (myC2d[i].IsNull()) {
580 MESSAGE_ADD ( "NULL" );
583 MESSAGE_ADD ( myC2d[i].operator->() );
586 MESSAGE_ADD ( "\tF: "<<myFirst[i]<< " L: "<< myLast[i] );
587 MESSAGE_END ( "\tnormPar: "<<myNormPar[i]<<endl );
592 //================================================================================
594 * \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
595 * \retval Adaptor2d_Curve2d* -
597 //================================================================================
599 struct Adaptor2dCurve2d : public Adaptor2d_Curve2d
601 const StdMeshers_FaceSide* mySide;
602 Adaptor2dCurve2d(const StdMeshers_FaceSide* faceSide):mySide(faceSide) {}
603 gp_Pnt2d Value(const Standard_Real U) const { return mySide->Value2d( U ); }
604 Standard_Real FirstParameter() const { return 0; }
605 Standard_Real LastParameter() const { return 1; }
608 Adaptor2d_Curve2d* StdMeshers_FaceSide::GetCurve2d() const
610 return new Adaptor2dCurve2d( this );
613 //================================================================================
615 * \brief Creates a fully functional Adaptor_Curve
617 //================================================================================
619 BRepAdaptor_CompCurve* StdMeshers_FaceSide::GetCurve3d() const
621 if ( myEdge.empty() )
625 BRep_Builder aBuilder;
626 aBuilder.MakeWire(aWire);
627 for ( int i=0; i<myEdge.size(); ++i )
628 aBuilder.Add( aWire, myEdge[i] );
630 if ( myEdge.size() == 2 && FirstVertex().IsSame( LastVertex() ))
631 aWire.Closed(true); // issue 0021141
633 return new BRepAdaptor_CompCurve( aWire );
637 //================================================================================
639 * \brief Return 2D point by normalized parameter
640 * \param U - normalized parameter value
641 * \retval gp_Pnt2d - point
643 //================================================================================
645 gp_Pnt2d StdMeshers_FaceSide::Value2d(double U) const
647 if ( !myC2d[0].IsNull() ) {
648 int i = EdgeIndex( U );
649 double prevU = i ? myNormPar[ i-1 ] : 0;
650 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
652 double par = myFirst[i] * ( 1 - r ) + myLast[i] * r;
654 // check parametrization of curve
655 if( !myIsUniform[i] )
657 double aLen3dU = r * myEdgeLength[i] * ( myFirst[i]>myLast[i] ? -1. : 1.);
658 GCPnts_AbscissaPoint AbPnt
659 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), aLen3dU, myFirst[i] );
660 if( AbPnt.IsDone() ) {
661 par = AbPnt.Parameter();
664 return myC2d[ i ]->Value(par);
667 return myDefaultPnt2d;
670 //================================================================================
672 * \brief Return wires of a face as StdMeshers_FaceSide's
674 //================================================================================
676 TSideVector StdMeshers_FaceSide::GetFaceWires(const TopoDS_Face& theFace,
677 SMESH_Mesh & theMesh,
678 const bool theIgnoreMediumNodes,
682 list< TopoDS_Edge > edges, internalEdges;
683 list< int > nbEdgesInWires;
684 int nbWires = SMESH_Block::GetOrderedEdges (theFace, V1, edges, nbEdgesInWires);
686 // split list of all edges into separate wires
687 TSideVector wires( nbWires );
688 list< int >::iterator nbE = nbEdgesInWires.begin();
689 list< TopoDS_Edge >::iterator from = edges.begin(), to = from;
690 for ( int iW = 0; iW < nbWires; ++iW, ++nbE )
692 std::advance( to, *nbE );
693 if ( *nbE == 0 ) // Issue 0020676
697 wires.resize( nbWires );
700 list< TopoDS_Edge > wireEdges( from, to );
701 // assure that there is a node on the first vertex
702 // as StdMeshers_FaceSide::GetUVPtStruct() requires
703 if ( wireEdges.front().Orientation() != TopAbs_INTERNAL ) // Issue 0020676
705 while ( !SMESH_Algo::VertexNode( TopExp::FirstVertex( wireEdges.front(), true),
706 theMesh.GetMeshDS()))
708 wireEdges.splice(wireEdges.end(), wireEdges,
709 wireEdges.begin(), ++wireEdges.begin());
710 if ( from->IsSame( wireEdges.front() )) {
712 ( new SMESH_ComputeError(COMPERR_BAD_INPUT_MESH,"No nodes on vertices"));
713 return TSideVector(0);
717 else if ( *nbE > 1 ) // Issue 0020676 (Face_pb_netgen.brep) - several internal edges in a wire
719 internalEdges.splice( internalEdges.end(), wireEdges, ++wireEdges.begin(), wireEdges.end());
722 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, wireEdges, &theMesh,
723 /*isForward=*/true, theIgnoreMediumNodes);
724 wires[ iW ] = StdMeshers_FaceSidePtr( wire );
727 while ( !internalEdges.empty() )
729 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, internalEdges.back(), &theMesh,
730 /*isForward=*/true, theIgnoreMediumNodes);
731 wires.push_back( StdMeshers_FaceSidePtr( wire ));
732 internalEdges.pop_back();
737 //================================================================================
739 * \brief Return 1st vertex of the i-the edge
741 //================================================================================
743 TopoDS_Vertex StdMeshers_FaceSide::FirstVertex(int i) const
748 v = myEdge[i].Orientation() <= TopAbs_REVERSED ? // FORWARD || REVERSED
749 TopExp::FirstVertex( myEdge[i], 1 ) :
750 TopoDS::Vertex( TopoDS_Iterator( myEdge[i] ).Value() );
755 //================================================================================
757 * \brief Return last vertex of the i-the edge
759 //================================================================================
761 TopoDS_Vertex StdMeshers_FaceSide::LastVertex(int i) const
766 const TopoDS_Edge& edge = i<0 ? myEdge[ NbEdges() + i ] : myEdge[i];
767 if ( edge.Orientation() <= TopAbs_REVERSED ) // FORWARD || REVERSED
768 v = TopExp::LastVertex( edge, 1 );
770 for ( TopoDS_Iterator vIt( edge ); vIt.More(); vIt.Next() )
771 v = TopoDS::Vertex( vIt.Value() );