1 // Copyright (C) 2007-2013 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>
56 #include "utilities.h"
58 //================================================================================
60 * \brief Constructor of a side of one edge
61 * \param theFace - the face
62 * \param theEdge - the edge
64 //================================================================================
66 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
67 const TopoDS_Edge& theEdge,
69 const bool theIsForward,
70 const bool theIgnoreMediumNodes,
71 SMESH_ProxyMesh::Ptr theProxyMesh)
73 list<TopoDS_Edge> edges(1,theEdge);
74 *this = StdMeshers_FaceSide( theFace, edges, theMesh, theIsForward,
75 theIgnoreMediumNodes, theProxyMesh );
78 //================================================================================
80 * \brief Constructor of a side of several edges
81 * \param theFace - the face
82 * \param theEdge - the edge
84 //================================================================================
86 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
87 list<TopoDS_Edge>& theEdges,
89 const bool theIsForward,
90 const bool theIgnoreMediumNodes,
91 SMESH_ProxyMesh::Ptr theProxyMesh)
93 int nbEdges = theEdges.size();
94 myEdge.resize ( nbEdges );
95 myEdgeID.resize ( nbEdges );
96 myC2d.resize ( nbEdges );
97 myC3dAdaptor.resize( nbEdges );
98 myFirst.resize ( nbEdges );
99 myLast.resize ( nbEdges );
100 myNormPar.resize ( nbEdges );
101 myEdgeLength.resize( nbEdges );
102 myIsUniform.resize ( nbEdges, true );
104 myNbPonits = myNbSegments = 0;
105 myProxyMesh = theProxyMesh;
106 myMissingVertexNodes = false;
107 myIgnoreMediumNodes = theIgnoreMediumNodes;
108 myDefaultPnt2d = gp_Pnt2d( 1e+100, 1e+100 );
109 if ( !myProxyMesh ) myProxyMesh.reset( new SMESH_ProxyMesh( *theMesh ));
110 if ( nbEdges == 0 ) return;
112 SMESHDS_Mesh* meshDS = myProxyMesh->GetMeshDS();
115 list<TopoDS_Edge>::iterator edge = theEdges.begin();
116 TopoDS_Iterator vExp;
117 for ( int index = 0; edge != theEdges.end(); ++index, ++edge )
119 int i = theIsForward ? index : nbEdges-index-1;
120 myEdgeLength[i] = SMESH_Algo::EdgeLength( *edge );
121 if ( myEdgeLength[i] < DBL_MIN ) nbDegen++;
122 myLength += myEdgeLength[i];
124 myEdgeID[i] = meshDS->ShapeToIndex( *edge );
125 if ( !theIsForward ) myEdge[i].Reverse();
127 if ( theFace.IsNull() )
128 BRep_Tool::Range( *edge, myFirst[i], myLast[i] );
130 myC2d[i] = BRep_Tool::CurveOnSurface( *edge, theFace, myFirst[i], myLast[i] );
131 if ( myEdge[i].Orientation() == TopAbs_REVERSED )
132 std::swap( myFirst[i], myLast[i] );
134 if ( const SMESHDS_SubMesh* sm = myProxyMesh->GetSubMesh( *edge )) {
135 int nbN = sm->NbNodes();
136 if ( theIgnoreMediumNodes ) {
137 SMDS_ElemIteratorPtr elemIt = sm->GetElements();
138 if ( elemIt->more() && elemIt->next()->IsQuadratic() )
139 nbN -= sm->NbElements();
142 myNbSegments += sm->NbElements();
145 // TopExp::FirstVertex() and TopExp::LastVertex() return NULL from INTERNAL edge
146 vExp.Initialize( *edge );
147 if ( vExp.Value().Orientation() == TopAbs_REVERSED ) vExp.Next();
148 if ( SMESH_Algo::VertexNode( TopoDS::Vertex( vExp.Value()), meshDS ))
149 myNbPonits += 1; // for the first end
151 myMissingVertexNodes = true;
153 // check if the edge has a non-uniform parametrization (issue 0020705)
154 if ( !myC2d[i].IsNull() && myEdgeLength[i] > DBL_MIN)
156 Geom2dAdaptor_Curve A2dC( myC2d[i],
157 std::min( myFirst[i], myLast[i] ),
158 std::max( myFirst[i], myLast[i] ));
159 double p2 = myFirst[i]+(myLast[i]-myFirst[i])/2., p4 = myFirst[i]+(myLast[i]-myFirst[i])/4.;
160 double d2 = GCPnts_AbscissaPoint::Length( A2dC, myFirst[i], p2 );
161 double d4 = GCPnts_AbscissaPoint::Length( A2dC, myFirst[i], p4 );
162 //cout<<"len = "<<len<<" d2 = "<<d2<<" fabs(2*d2/len-1.0) = "<<fabs(2*d2/len-1.0)<<endl;
163 myIsUniform[i] = !( fabs(2*d2/myEdgeLength[i]-1.0) > 0.01 || fabs(2*d4/d2-1.0) > 0.01 );
164 //if ( !myIsUniform[i] ) to implement Value3d(u)
167 Handle(Geom_Curve) C3d = BRep_Tool::Curve(myEdge[i],fp,lp);
168 myC3dAdaptor[i].Load( C3d, fp,lp );
171 // reverse a proxy submesh
173 reverseProxySubmesh( myEdge[i] );
177 vExp.Initialize( theEdges.back() );
178 if ( vExp.Value().Orientation() != TopAbs_REVERSED ) vExp.Next();
181 if ( SMESH_Algo::VertexNode( TopoDS::Vertex( vExp.Value()), meshDS ))
182 myNbPonits++; // for the last end
184 myMissingVertexNodes = true;
186 if ( nbEdges > 1 && myLength > DBL_MIN ) {
187 const double degenNormLen = 1.e-5;
188 double totLength = myLength;
190 totLength += myLength * degenNormLen * nbDegen;
191 double prevNormPar = 0;
192 for ( int i = 0; i < nbEdges; ++i ) {
193 if ( myEdgeLength[ i ] < DBL_MIN )
194 myEdgeLength[ i ] = myLength * degenNormLen;
195 myNormPar[ i ] = prevNormPar + myEdgeLength[i]/totLength;
196 prevNormPar = myNormPar[ i ];
199 myNormPar[nbEdges-1] = 1.;
203 //================================================================================
205 * \brief Constructor of a side for vertex using data from other FaceSide
206 * \param theVertex - the vertex
207 * \param theSide - the side
209 //================================================================================
211 StdMeshers_FaceSide::StdMeshers_FaceSide(const StdMeshers_FaceSide* theSide,
212 const SMDS_MeshNode* theNode,
213 const gp_Pnt2d* thePnt2d1,
214 const gp_Pnt2d* thePnt2d2,
215 const Handle(Geom2d_Curve)& theC2d,
216 const double theUFirst,
217 const double theULast)
219 myC2d.push_back ( theC2d );
220 myFirst.push_back ( theUFirst );
221 myLast.push_back ( theULast );
222 myNormPar.push_back ( 1. );
223 myIsUniform.push_back( true );
224 myEdgeID.push_back ( 0 );
226 myProxyMesh = theSide->myProxyMesh;
227 myDefaultPnt2d = *thePnt2d1;
228 myPoints = theSide->GetUVPtStruct();
229 myNbPonits = myPoints.size();
230 myNbSegments = theSide->myNbSegments;
232 for ( size_t i = 0; i < myPoints.size(); ++i )
234 double r = i / ( myPoints.size() - 1. );
235 myPoints[i].u = (1-r) * thePnt2d1->X() + r * thePnt2d2->X();
236 myPoints[i].v = (1-r) * thePnt2d1->Y() + r * thePnt2d2->Y();
237 myPoints[i].node = theNode;
240 for ( size_t i = 0; i < myPoints.size(); ++i )
242 myPoints[i].u = thePnt2d1->X();
243 myPoints[i].v = thePnt2d1->Y();
244 myPoints[i].node = theNode;
248 //================================================================================
250 * Create a side from an UVPtStructVec
252 //================================================================================
254 StdMeshers_FaceSide::StdMeshers_FaceSide(UVPtStructVec& theSideNodes)
257 myEdgeID.resize( 1, -1 );
259 myC3dAdaptor.resize( 1 );
260 myFirst.resize( 1, 0. );
261 myLast.resize( 1, 1. );
262 myNormPar.resize( 1, 1. );
263 myIsUniform.resize( 1, 1 );
264 myMissingVertexNodes = myIgnoreMediumNodes = false;
265 myDefaultPnt2d.SetCoord( 1e100, 1e100 );
267 myPoints = theSideNodes;
268 myNbPonits = myPoints.size();
269 myNbSegments = myNbPonits + 1;
272 if ( !myPoints.empty() )
274 myPoints[0].normParam = 0;
275 gp_Pnt pPrev = SMESH_TNodeXYZ( myPoints[0].node );
276 for ( size_t i = 1; i < myPoints.size(); ++i )
278 gp_Pnt p = SMESH_TNodeXYZ( myPoints[i].node );
279 myLength += ( myPoints[i].normParam = p.Distance( pPrev ));
282 if ( myLength > std::numeric_limits<double>::min() )
283 for ( size_t i = 1; i < myPoints.size(); ++i )
284 myPoints[i].normParam /= myLength;
286 myEdgeLength.resize( 1, myLength );
289 //================================================================================
291 * Return info on nodes on the side
293 //================================================================================
295 const vector<UVPtStruct>& StdMeshers_FaceSide::GetUVPtStruct(bool isXConst,
296 double constValue) const
298 if ( myPoints.empty() ) {
300 if ( NbEdges() == 0 ) return myPoints;
302 SMESHDS_Mesh* meshDS = myProxyMesh->GetMeshDS();
303 SMESH_MesherHelper helper(*myProxyMesh->GetMesh());
307 // sort nodes of all edges putting them into a map
309 map< double, const SMDS_MeshNode*> u2node;
310 vector< const SMESH_ProxyMesh::SubMesh* > proxySubMesh( myEdge.size());
311 int nbProxyNodes = 0;
312 for ( size_t iE = 0; iE < myEdge.size(); ++iE )
314 proxySubMesh[iE] = myProxyMesh->GetProxySubMesh( myEdge[iE] );
315 if ( proxySubMesh[iE] )
317 if ( proxySubMesh[iE]->GetUVPtStructVec().empty() ) {
318 proxySubMesh[iE] = 0;
321 nbProxyNodes += proxySubMesh[iE]->GetUVPtStructVec().size() - 1;
322 if ( iE+1 == myEdge.size() )
327 // Put 1st vertex node of a current edge
328 TopoDS_Vertex VV[2]; // TopExp::FirstVertex() returns NULL for INTERNAL edge
329 VV[0] = SMESH_MesherHelper::IthVertex( 0, myEdge[iE]);
330 VV[1] = SMESH_MesherHelper::IthVertex( 1, myEdge[iE]);
331 const SMDS_MeshNode* node = SMESH_Algo::VertexNode( VV[0], meshDS );
332 double prevNormPar = ( iE == 0 ? 0 : myNormPar[ iE-1 ]); // normalized param
333 if ( node ) { // nodes on internal vertices may be missing
334 u2node.insert( u2node.end(), make_pair( prevNormPar, node ));
336 else if ( iE == 0 ) {
337 MESSAGE(" NO NODE on VERTEX" );
341 // Put internal nodes
342 if ( const SMESHDS_SubMesh* sm = myProxyMesh->GetSubMesh( myEdge[iE] ))
344 vector< pair< double, const SMDS_MeshNode*> > u2nodeVec;
345 u2nodeVec.reserve( sm->NbNodes() );
346 SMDS_NodeIteratorPtr nItr = sm->GetNodes();
347 double paramSize = myLast[iE] - myFirst[iE];
348 double r = myNormPar[iE] - prevNormPar;
349 helper.SetSubShape( myEdge[iE] );
350 helper.ToFixNodeParameters( true );
351 if ( !myIsUniform[iE] )
352 while ( nItr->more() )
354 const SMDS_MeshNode* node = nItr->next();
355 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
357 double u = helper.GetNodeU( myEdge[iE], node, 0, ¶mOK );
358 double aLenU = GCPnts_AbscissaPoint::Length
359 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[iE]), myFirst[iE], u );
360 if ( myEdgeLength[iE] < aLenU ) // nonregression test "3D_mesh_NETGEN/G6"
365 double normPar = prevNormPar + r*aLenU/myEdgeLength[iE];
366 u2nodeVec.push_back( make_pair( normPar, node ));
368 nItr = sm->GetNodes();
369 if ( u2nodeVec.empty() )
370 while ( nItr->more() )
372 const SMDS_MeshNode* node = nItr->next();
373 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
375 double u = helper.GetNodeU( myEdge[iE], node, 0, ¶mOK );
377 // paramSize is signed so orientation is taken into account
378 double normPar = prevNormPar + r * ( u - myFirst[iE] ) / paramSize;
379 u2nodeVec.push_back( make_pair( normPar, node ));
381 for ( size_t j = 0; j < u2nodeVec.size(); ++j )
382 u2node.insert( u2node.end(), u2nodeVec[j] );
385 // Put 2nd vertex node for a last edge
386 if ( iE+1 == myEdge.size() ) {
387 node = SMESH_Algo::VertexNode( VV[1], meshDS );
389 MESSAGE(" NO NODE on VERTEX" );
392 u2node.insert( u2node.end(), make_pair( 1., node ));
394 } // loop on myEdge's
396 if ( u2node.size() + nbProxyNodes != myNbPonits &&
397 u2node.size() + nbProxyNodes != NbPoints( /*update=*/true ))
399 MESSAGE("Wrong node parameters on edges, u2node.size():"
400 <<u2node.size()<<" != myNbPonits:"<<myNbPonits);
404 // fill array of UVPtStruct
406 UVPtStructVec& points = const_cast< UVPtStructVec& >( myPoints );
407 points.resize( myNbPonits );
410 double prevNormPar = 0, paramSize = myNormPar[ 0 ];
411 map< double, const SMDS_MeshNode*>::iterator u_node = u2node.begin();
412 for ( size_t iE = 0; iE < myEdge.size(); ++iE )
414 if ( proxySubMesh[ iE ] ) // copy data from a proxy sub-mesh
416 const UVPtStructVec& edgeUVPtStruct = proxySubMesh[iE]->GetUVPtStructVec();
417 std::copy( edgeUVPtStruct.begin(), edgeUVPtStruct.end(), & points[iPt] );
419 double du1 = edgeUVPtStruct.back().param - edgeUVPtStruct[0].param;
420 double du2 = myLast[iE] - myFirst[iE];
423 std::reverse( & points[iPt], & points[iPt + edgeUVPtStruct.size()]);
424 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i )
425 points[iPt+i].normParam = 1. - points[iPt+i].normParam;
427 // update normalized params
428 if ( myEdge.size() > 1 ) {
429 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i, ++iPt )
431 UVPtStruct & uvPt = points[iPt];
432 uvPt.normParam = prevNormPar + uvPt.normParam * paramSize;
433 uvPt.x = uvPt.y = uvPt.normParam;
435 --iPt; // to point to the 1st VERTEX of the next EDGE
440 for ( ; u_node != u2node.end(); ++u_node, ++iPt )
442 if ( myNormPar[ iE ]-eps < u_node->first )
443 break; // u_node is at VERTEX of the next EDGE
445 UVPtStruct & uvPt = points[iPt];
446 uvPt.node = u_node->second;
447 // -- normParam, x, y --------------------------------
448 uvPt.normParam = u_node->first;
449 uvPt.x = uvPt.y = uvPt.normParam;
450 // -- U ----------------------------------------------
451 const SMDS_EdgePosition* epos =
452 dynamic_cast<const SMDS_EdgePosition*>(uvPt.node->GetPosition());
454 uvPt.param = epos->GetUParameter();
457 double r = ( uvPt.normParam - prevNormPar )/ paramSize;
458 uvPt.param = ( r > 0.5 ? myLast[iE] : myFirst[iE] );
460 // -- UV ---------------------------------------------
461 if ( !myC2d[ iE ].IsNull() ) {
462 gp_Pnt2d p = myC2d[ iE ]->Value( uvPt.param );
467 uvPt.u = uvPt.v = 1e+100;
471 // prepare for the next EDGE
472 if ( iE+1 < myEdge.size() )
474 prevNormPar = myNormPar[ iE ];
475 paramSize = myNormPar[ iE+1 ] - prevNormPar;
477 } // loop on myEdge's
481 for ( iPt = 0; iPt < points.size(); ++iPt ) points[ iPt ].x = constValue;
483 for ( iPt = 0; iPt < points.size(); ++iPt ) points[ iPt ].y = constValue;
485 } // if ( myPoints.empty())
490 //================================================================================
492 * \brief Falsificate info on nodes
493 * \param nbSeg - nb of segments on the side
494 * \retval UVPtStruct* - array of data structures
496 //================================================================================
498 const vector<UVPtStruct>& StdMeshers_FaceSide::SimulateUVPtStruct(int nbSeg,
500 double constValue) const
502 if ( myFalsePoints.empty() ) {
504 if ( NbEdges() == 0 ) return myFalsePoints;
506 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myFalsePoints );
507 points->resize( nbSeg+1 );
510 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
511 for (int i = 0 ; i < myFalsePoints.size(); ++i ) {
512 double normPar = double(i) / double(nbSeg);
513 UVPtStruct & uvPt = (*points)[i];
515 uvPt.x = uvPt.y = uvPt.param = uvPt.normParam = normPar;
516 if ( isXConst ) uvPt.x = constValue;
517 else uvPt.y = constValue;
518 if ( myNormPar[ EdgeIndex ] < normPar ) {
519 prevNormPar = myNormPar[ EdgeIndex ];
521 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
523 double r = ( normPar - prevNormPar )/ paramSize;
524 uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
525 if ( !myC2d[ EdgeIndex ].IsNull() ) {
526 gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
531 uvPt.u = uvPt.v = 1e+100;
535 return myFalsePoints;
538 //=======================================================================
539 //function : GetOrderedNodes
540 //purpose : Return nodes in the order they encounter while walking along the side
541 //=======================================================================
543 std::vector<const SMDS_MeshNode*> StdMeshers_FaceSide::GetOrderedNodes() const
545 vector<const SMDS_MeshNode*> resultNodes;
546 if ( myPoints.empty() )
548 if ( NbEdges() == 0 ) return resultNodes;
550 SMESHDS_Mesh* meshDS = myProxyMesh->GetMeshDS();
551 SMESH_MesherHelper helper(*myProxyMesh->GetMesh());
554 // Sort nodes of all edges putting them into a map
556 map< double, const SMDS_MeshNode*> u2node;
557 for ( int i = 0; i < myEdge.size(); ++i )
559 // Put 1st vertex node of a current edge
560 TopoDS_Vertex VV[2]; // TopExp::FirstVertex() returns NULL for INTERNAL edge
561 VV[0] = SMESH_MesherHelper::IthVertex( 0, myEdge[i]);
562 VV[1] = SMESH_MesherHelper::IthVertex( 1, myEdge[i]);
563 const SMDS_MeshNode* node = SMESH_Algo::VertexNode( VV[0], meshDS );
564 double prevNormPar = ( i == 0 ? 0 : myNormPar[ i-1 ]); // normalized param
565 if ( node ) { // nodes on internal vertices may be missing
566 u2node.insert( make_pair( prevNormPar, node ));
569 MESSAGE(" NO NODE on VERTEX" );
573 // Put internal nodes
574 if ( SMESHDS_SubMesh* sm = meshDS->MeshElements( myEdge[i] ))
576 SMDS_NodeIteratorPtr nItr = sm->GetNodes();
577 double paramSize = myLast[i] - myFirst[i];
578 double r = myNormPar[i] - prevNormPar;
579 helper.SetSubShape( myEdge[i] );
580 helper.ToFixNodeParameters( true );
581 while ( nItr->more() )
583 const SMDS_MeshNode* node = nItr->next();
584 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
586 double u = helper.GetNodeU( myEdge[i], node, 0, ¶mOK );
588 // paramSize is signed so orientation is taken into account
589 double normPar = prevNormPar + r * ( u - myFirst[i] ) / paramSize;
590 u2node.insert( u2node.end(), make_pair( normPar, node ));
594 // Put 2nd vertex node for a last edge
595 if ( i+1 == myEdge.size() ) {
596 node = SMESH_Algo::VertexNode( VV[1], meshDS );
600 u2node.insert( u2node.end(), make_pair( 1., node ));
604 // Fill the result vector
606 if ( u2node.size() == myNbPonits )
608 resultNodes.reserve( u2node.size() );
609 map< double, const SMDS_MeshNode*>::iterator u2n = u2node.begin();
610 for ( ; u2n != u2node.end(); ++u2n )
611 resultNodes.push_back( u2n->second );
616 resultNodes.resize( myPoints.size() );
617 for ( size_t i = 0; i < myPoints.size(); ++i )
618 resultNodes[i] = myPoints[i].node;
624 //================================================================================
626 * \brief reverse order of vector elements
627 * \param vec - vector to reverse
629 //================================================================================
631 template <typename T > void reverse(vector<T> & vec)
633 for ( int f=0, r=vec.size()-1; f < r; ++f, --r )
634 std::swap( vec[f], vec[r] );
637 //================================================================================
639 * \brief Change orientation of side geometry
641 //================================================================================
643 void StdMeshers_FaceSide::Reverse()
645 int nbEdges = myEdge.size();
646 for ( int i = nbEdges-1; i >= 0; --i ) {
647 std::swap( myFirst[i], myLast[i] );
648 if ( !myEdge[i].IsNull() )
650 if ( i > 0 ) // at the first loop 1. is overwritten
651 myNormPar[i] = 1 - myNormPar[i-1];
657 //reverse( myC3dAdaptor );
660 reverse( myNormPar );
661 reverse( myEdgeLength );
662 reverse( myIsUniform );
666 myNormPar[nbEdges-1]=1.;
667 if ( !myEdge[0].IsNull() )
669 for ( size_t i = 0; i < myEdge.size(); ++i )
670 reverseProxySubmesh( myEdge[i] );
672 myFalsePoints.clear();
676 for ( size_t i = 0; i < myPoints.size(); ++i )
678 UVPtStruct & uvPt = myPoints[i];
679 uvPt.normParam = 1 - uvPt.normParam;
685 for ( size_t i = 0; i < myFalsePoints.size(); ++i )
687 UVPtStruct & uvPt = myFalsePoints[i];
688 uvPt.normParam = 1 - uvPt.normParam;
692 reverse( myFalsePoints );
695 for ( size_t i = 0; i < myEdge.size(); ++i )
698 Handle(Geom_Curve) C3d = BRep_Tool::Curve(myEdge[i],fp,lp);
700 myC3dAdaptor[i].Load( C3d, fp,lp );
704 //=======================================================================
705 //function : SetIgnoreMediumNodes
706 //purpose : Make ignore medium nodes
707 //=======================================================================
709 void StdMeshers_FaceSide::SetIgnoreMediumNodes(bool toIgnore)
711 if ( myIgnoreMediumNodes != toIgnore )
713 myIgnoreMediumNodes = toIgnore;
715 if ( !myPoints.empty() )
717 UVPtStructVec newPoints;
718 newPoints.reserve( myPoints.size()/2 + 1 );
719 for ( size_t i = 0; i < myPoints.size(); i += 2 )
720 newPoints.push_back( myPoints[i] );
722 myPoints.swap( newPoints );
726 NbPoints( /*update=*/true );
731 //=======================================================================
732 //function : NbPoints
733 //purpose : Return nb nodes on edges and vertices (+1 to be == GetUVPtStruct().size() )
734 // Call it with update == true if mesh of this side can be recomputed
735 // since creation of this side
736 //=======================================================================
738 int StdMeshers_FaceSide::NbPoints(const bool update) const
740 if ( !myPoints.empty() )
741 return myPoints.size();
743 // if ( !myFalsePoints.empty() )
744 // return myFalsePoints.size();
746 if ( update && myEdge.size() > 0 )
748 StdMeshers_FaceSide* me = (StdMeshers_FaceSide*) this;
750 me->myNbSegments = 0;
751 me->myMissingVertexNodes = false;
753 for ( int i = 0; i < NbEdges(); ++i )
755 TopoDS_Vertex v1 = SMESH_MesherHelper::IthVertex( 0, myEdge[i] );
756 if ( SMESH_Algo::VertexNode( v1, myProxyMesh->GetMeshDS() ))
757 me->myNbPonits += 1; // for the first end
759 me->myMissingVertexNodes = true;
761 if ( const SMESHDS_SubMesh* sm = myProxyMesh->GetSubMesh( Edge(i) )) {
762 int nbN = sm->NbNodes();
763 if ( myIgnoreMediumNodes ) {
764 SMDS_ElemIteratorPtr elemIt = sm->GetElements();
765 if ( elemIt->more() && elemIt->next()->IsQuadratic() )
766 nbN -= sm->NbElements();
768 me->myNbPonits += nbN;
769 me->myNbSegments += sm->NbElements();
772 TopoDS_Vertex v1 = SMESH_MesherHelper::IthVertex( 1, Edge( NbEdges()-1 ));
773 if ( SMESH_Algo::VertexNode( v1, myProxyMesh->GetMeshDS() ))
774 me->myNbPonits++; // for the last end
776 me->myMissingVertexNodes = true;
781 //=======================================================================
782 //function : NbSegments
783 //purpose : Return nb edges
784 // Call it with update == true if mesh of this side can be recomputed
785 // since creation of this side
786 //=======================================================================
788 int StdMeshers_FaceSide::NbSegments(const bool update) const
790 return NbPoints( update ), myNbSegments;
793 //================================================================================
795 * \brief Reverse UVPtStructVec if a proxy sub-mesh of E
797 //================================================================================
799 void StdMeshers_FaceSide::reverseProxySubmesh( const TopoDS_Edge& E )
801 if ( !myProxyMesh ) return;
802 if ( const SMESH_ProxyMesh::SubMesh* sm = myProxyMesh->GetProxySubMesh( E ))
804 UVPtStructVec& edgeUVPtStruct = (UVPtStructVec& ) sm->GetUVPtStructVec();
805 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i )
807 UVPtStruct & uvPt = edgeUVPtStruct[i];
808 uvPt.normParam = 1 - uvPt.normParam;
812 reverse( edgeUVPtStruct );
816 //================================================================================
818 * \brief Show side features
820 //================================================================================
822 void StdMeshers_FaceSide::dump(const char* msg) const
825 if (msg) MESSAGE ( std::endl << msg );
826 MESSAGE_BEGIN ("NB EDGES: "<< myEdge.size() );
827 MESSAGE_ADD ( "nbPoints: "<<myNbPonits<<" vecSize: " << myPoints.size()<<" "<<myFalsePoints.size() );
828 for ( int i=0; i<myEdge.size(); ++i)
830 MESSAGE_ADD ( "\t"<<i+1 );
831 MESSAGE_ADD ( "\tEDGE: " );
832 if (myEdge[i].IsNull()) {
833 MESSAGE_ADD ( "NULL" );
836 TopAbs::Print(myEdge[i].Orientation(),cout)<<" "<<myEdge[i].TShape().operator->()<<endl;
837 MESSAGE_ADD ( "\tV1: " << TopExp::FirstVertex( myEdge[i], 1).TShape().operator->()
838 << " V2: " << TopExp::LastVertex( myEdge[i], 1).TShape().operator->() );
840 MESSAGE_ADD ( "\tC2d: ");
842 if (myC2d[i].IsNull()) {
843 MESSAGE_ADD ( "NULL" );
846 MESSAGE_ADD ( myC2d[i].operator->() );
849 MESSAGE_ADD ( "\tF: "<<myFirst[i]<< " L: "<< myLast[i] );
850 MESSAGE_END ( "\tnormPar: "<<myNormPar[i]<<endl );
855 //================================================================================
857 * \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
858 * \retval Adaptor2d_Curve2d* -
860 //================================================================================
862 struct Adaptor2dCurve2d : public Adaptor2d_Curve2d
864 const StdMeshers_FaceSide* mySide;
865 Adaptor2dCurve2d(const StdMeshers_FaceSide* faceSide):mySide(faceSide) {}
866 gp_Pnt2d Value(const Standard_Real U) const { return mySide->Value2d( U ); }
867 Standard_Real FirstParameter() const { return 0; }
868 Standard_Real LastParameter() const { return 1; }
871 Adaptor2d_Curve2d* StdMeshers_FaceSide::GetCurve2d() const
873 return new Adaptor2dCurve2d( this );
876 //================================================================================
878 * \brief Creates a fully functional Adaptor_Curve
880 //================================================================================
882 BRepAdaptor_CompCurve* StdMeshers_FaceSide::GetCurve3d() const
884 if ( myEdge.empty() )
888 BRep_Builder aBuilder;
889 aBuilder.MakeWire(aWire);
890 for ( int i=0; i<myEdge.size(); ++i )
891 aBuilder.Add( aWire, myEdge[i] );
893 if ( myEdge.size() == 2 && FirstVertex().IsSame( LastVertex() ))
894 aWire.Closed(true); // issue 0021141
896 return new BRepAdaptor_CompCurve( aWire );
899 //================================================================================
901 * \brief Return 2D point by normalized parameter
902 * \param U - normalized parameter value
903 * \retval gp_Pnt2d - point
905 //================================================================================
907 gp_Pnt2d StdMeshers_FaceSide::Value2d(double U) const
909 if ( !myC2d[0].IsNull() ) {
910 int i = EdgeIndex( U );
911 double prevU = i ? myNormPar[ i-1 ] : 0;
912 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
914 double par = myFirst[i] * ( 1 - r ) + myLast[i] * r;
916 // check parametrization of curve
917 if( !myIsUniform[i] )
919 double aLen3dU = r * myEdgeLength[i] * ( myFirst[i]>myLast[i] ? -1. : 1.);
920 GCPnts_AbscissaPoint AbPnt
921 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), aLen3dU, myFirst[i] );
922 if( AbPnt.IsDone() ) {
923 par = AbPnt.Parameter();
926 return myC2d[ i ]->Value(par);
929 return myDefaultPnt2d;
932 //================================================================================
934 * \brief Return XYZ by normalized parameter
935 * \param U - normalized parameter value
936 * \retval gp_Pnt - point
938 //================================================================================
940 gp_Pnt StdMeshers_FaceSide::Value3d(double U) const
942 int i = EdgeIndex( U );
943 double prevU = i ? myNormPar[ i-1 ] : 0;
944 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
946 double par = myFirst[i] * ( 1 - r ) + myLast[i] * r;
948 // check parametrization of curve
949 if( !myIsUniform[i] )
951 double aLen3dU = r * myEdgeLength[i] * ( myFirst[i]>myLast[i] ? -1. : 1.);
952 GCPnts_AbscissaPoint AbPnt
953 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), aLen3dU, myFirst[i] );
954 if( AbPnt.IsDone() ) {
955 par = AbPnt.Parameter();
958 return myC3dAdaptor[ i ].Value(par);
961 //================================================================================
963 * \brief Return wires of a face as StdMeshers_FaceSide's
965 //================================================================================
967 TSideVector StdMeshers_FaceSide::GetFaceWires(const TopoDS_Face& theFace,
968 SMESH_Mesh & theMesh,
969 const bool theIgnoreMediumNodes,
971 SMESH_ProxyMesh::Ptr theProxyMesh)
973 list< TopoDS_Edge > edges, internalEdges;
974 list< int > nbEdgesInWires;
975 int nbWires = SMESH_Block::GetOrderedEdges (theFace, edges, nbEdgesInWires);
977 // split list of all edges into separate wires
978 TSideVector wires( nbWires );
979 list< int >::iterator nbE = nbEdgesInWires.begin();
980 list< TopoDS_Edge >::iterator from = edges.begin(), to = from;
981 for ( int iW = 0; iW < nbWires; ++iW, ++nbE )
983 std::advance( to, *nbE );
984 if ( *nbE == 0 ) // Issue 0020676
988 wires.resize( nbWires );
991 list< TopoDS_Edge > wireEdges( from, to );
992 // assure that there is a node on the first vertex
993 // as StdMeshers_FaceSide::GetUVPtStruct() requires
994 if ( wireEdges.front().Orientation() != TopAbs_INTERNAL ) // Issue 0020676
996 while ( !SMESH_Algo::VertexNode( TopExp::FirstVertex( wireEdges.front(), true),
997 theMesh.GetMeshDS()))
999 wireEdges.splice(wireEdges.end(), wireEdges,
1000 wireEdges.begin(), ++wireEdges.begin());
1001 if ( from->IsSame( wireEdges.front() )) {
1003 ( new SMESH_ComputeError(COMPERR_BAD_INPUT_MESH,"No nodes on vertices"));
1004 return TSideVector(0);
1008 else if ( *nbE > 1 ) // Issue 0020676 (Face_pb_netgen.brep) - several internal edges in a wire
1010 internalEdges.splice( internalEdges.end(), wireEdges, ++wireEdges.begin(), wireEdges.end());
1013 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, wireEdges, &theMesh,
1014 /*isForward=*/true, theIgnoreMediumNodes,
1016 wires[ iW ] = StdMeshers_FaceSidePtr( wire );
1019 while ( !internalEdges.empty() )
1021 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, internalEdges.back(), &theMesh,
1022 /*isForward=*/true, theIgnoreMediumNodes,
1024 wires.push_back( StdMeshers_FaceSidePtr( wire ));
1025 internalEdges.pop_back();
1030 //================================================================================
1032 * \brief Return 1st vertex of the i-the edge
1034 //================================================================================
1036 TopoDS_Vertex StdMeshers_FaceSide::FirstVertex(int i) const
1039 if ( i < NbEdges() )
1041 v = myEdge[i].Orientation() <= TopAbs_REVERSED ? // FORWARD || REVERSED
1042 TopExp::FirstVertex( myEdge[i], 1 ) :
1043 TopoDS::Vertex( TopoDS_Iterator( myEdge[i] ).Value() );
1048 //================================================================================
1050 * \brief Return last vertex of the i-the edge
1052 //================================================================================
1054 TopoDS_Vertex StdMeshers_FaceSide::LastVertex(int i) const
1057 if ( i < NbEdges() )
1059 const TopoDS_Edge& edge = i<0 ? myEdge[ NbEdges() + i ] : myEdge[i];
1060 if ( edge.Orientation() <= TopAbs_REVERSED ) // FORWARD || REVERSED
1061 v = TopExp::LastVertex( edge, 1 );
1063 for ( TopoDS_Iterator vIt( edge ); vIt.More(); vIt.Next() )
1064 v = TopoDS::Vertex( vIt.Value() );