1 // Copyright (C) 2007-2016 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_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>
46 #include <Geom_Line.hxx>
48 #include <TopExp_Explorer.hxx>
50 #include <TopoDS_Face.hxx>
51 #include <TopoDS_Vertex.hxx>
52 #include <TopoDS_Wire.hxx>
57 #include "utilities.h"
61 //================================================================================
63 * \brief Constructor of a side of one edge
64 * \param theFace - the face
65 * \param theEdge - the edge
67 //================================================================================
69 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
70 const TopoDS_Edge& theEdge,
72 const bool theIsForward,
73 const bool theIgnoreMediumNodes,
74 SMESH_ProxyMesh::Ptr theProxyMesh)
76 std::list<TopoDS_Edge> edges(1,theEdge);
77 *this = StdMeshers_FaceSide( theFace, edges, theMesh, theIsForward,
78 theIgnoreMediumNodes, theProxyMesh );
81 //================================================================================
83 * \brief Constructor of a side of several edges
85 //================================================================================
87 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
88 std::list<TopoDS_Edge>& theEdges,
90 const bool theIsForward,
91 const bool theIgnoreMediumNodes,
92 SMESH_ProxyMesh::Ptr theProxyMesh)
94 int nbEdges = theEdges.size();
95 myEdge.resize ( nbEdges );
96 myEdgeID.resize ( nbEdges );
97 myC2d.resize ( nbEdges );
98 myC3dAdaptor.resize( nbEdges );
99 myFirst.resize ( nbEdges );
100 myLast.resize ( nbEdges );
101 myNormPar.resize ( nbEdges );
102 myEdgeLength.resize( nbEdges );
103 myIsUniform.resize ( nbEdges, true );
106 myNbPonits = myNbSegments = 0;
107 myProxyMesh = theProxyMesh;
108 myMissingVertexNodes = false;
109 myIgnoreMediumNodes = theIgnoreMediumNodes;
110 myDefaultPnt2d = gp_Pnt2d( 1e+100, 1e+100 );
111 if ( !myProxyMesh ) myProxyMesh.reset( new SMESH_ProxyMesh( *theMesh ));
112 if ( nbEdges == 0 ) return;
114 SMESHDS_Mesh* meshDS = myProxyMesh->GetMeshDS();
117 std::list<TopoDS_Edge>::iterator edge = theEdges.begin();
118 for ( int index = 0; edge != theEdges.end(); ++index, ++edge )
120 int i = theIsForward ? index : nbEdges-index-1;
121 myEdgeLength[i] = SMESH_Algo::EdgeLength( *edge );
122 if ( myEdgeLength[i] < DBL_MIN ) nbDegen++;
123 myLength += myEdgeLength[i];
125 myEdgeID[i] = meshDS->ShapeToIndex( *edge );
126 if ( !theIsForward ) myEdge[i].Reverse();
128 if ( theFace.IsNull() )
129 BRep_Tool::Range( *edge, myFirst[i], myLast[i] );
131 myC2d[i] = BRep_Tool::CurveOnSurface( *edge, theFace, myFirst[i], myLast[i] );
132 if ( myEdge[i].Orientation() == TopAbs_REVERSED )
133 std::swap( myFirst[i], myLast[i] );
135 // check if the edge has a non-uniform parametrization (issue 0020705)
136 if ( !myC2d[i].IsNull() )
138 if ( myEdgeLength[i] > DBL_MIN )
140 Geom2dAdaptor_Curve A2dC( myC2d[i],
141 std::min( myFirst[i], myLast[i] ),
142 std::max( myFirst[i], myLast[i] ));
143 double p2 = myFirst[i]+(myLast[i]-myFirst[i])/2.;
144 double p4 = myFirst[i]+(myLast[i]-myFirst[i])/4.;
145 double d2 = GCPnts_AbscissaPoint::Length( A2dC, myFirst[i], p2 );
146 double d4 = GCPnts_AbscissaPoint::Length( A2dC, myFirst[i], p4 );
147 myIsUniform[i] = !( fabs(2*d2/myEdgeLength[i]-1.0) > 0.01 || fabs(2*d4/d2-1.0) > 0.01 );
148 Handle(Geom_Curve) C3d = BRep_Tool::Curve(myEdge[i],d2,d4);
149 myC3dAdaptor[i].Load( C3d, d2,d4 );
153 const TopoDS_Vertex& V = SMESH_MesherHelper::IthVertex( 0, *edge );
154 Handle(Geom_Curve) C3d = new Geom_Line( BRep_Tool::Pnt( V ), gp::DX() );
155 myC3dAdaptor[i].Load( C3d, 0, 0.5 * BRep_Tool::Tolerance( V ));
158 // reverse a proxy sub-mesh
160 reverseProxySubmesh( myEdge[i] );
164 // count nodes and segments
165 NbPoints( /*update=*/true );
167 if ( nbEdges > 1 && myLength > DBL_MIN ) {
168 const double degenNormLen = 1.e-5;
169 double totLength = myLength;
171 totLength += myLength * degenNormLen * nbDegen;
172 double prevNormPar = 0;
173 for ( int i = 0; i < nbEdges; ++i ) {
174 if ( myEdgeLength[ i ] < DBL_MIN )
175 myEdgeLength[ i ] = myLength * degenNormLen;
176 myNormPar[ i ] = prevNormPar + myEdgeLength[i]/totLength;
177 prevNormPar = myNormPar[ i ];
180 myNormPar[nbEdges-1] = 1.;
184 //================================================================================
186 * \brief Constructor of a side for vertex using data from other FaceSide
188 //================================================================================
190 StdMeshers_FaceSide::StdMeshers_FaceSide(const StdMeshers_FaceSide* theSide,
191 const SMDS_MeshNode* theNode,
192 const gp_Pnt2d* thePnt2d1,
193 const gp_Pnt2d* thePnt2d2,
194 const Handle(Geom2d_Curve)& theC2d,
195 const double theUFirst,
196 const double theULast)
198 myC2d.push_back ( theC2d );
199 myFirst.push_back ( theUFirst );
200 myLast.push_back ( theULast );
201 myNormPar.push_back ( 1. );
202 myIsUniform.push_back( true );
203 myEdgeID.push_back ( 0 );
205 myProxyMesh = theSide->myProxyMesh;
206 myDefaultPnt2d = *thePnt2d1;
207 myPoints = theSide->GetUVPtStruct();
208 myNbPonits = myPoints.size();
209 myNbSegments = theSide->myNbSegments;
211 for ( size_t i = 0; i < myPoints.size(); ++i )
213 double r = i / ( myPoints.size() - 1. );
214 myPoints[i].u = (1-r) * thePnt2d1->X() + r * thePnt2d2->X();
215 myPoints[i].v = (1-r) * thePnt2d1->Y() + r * thePnt2d2->Y();
216 myPoints[i].node = theNode;
219 for ( size_t i = 0; i < myPoints.size(); ++i )
221 myPoints[i].u = thePnt2d1->X();
222 myPoints[i].v = thePnt2d1->Y();
223 myPoints[i].node = theNode;
227 //================================================================================
229 * Create a side from an UVPtStructVec
231 //================================================================================
233 StdMeshers_FaceSide::StdMeshers_FaceSide(UVPtStructVec& theSideNodes,
234 const TopoDS_Face& theFace,
235 const TopoDS_Edge& theEdge,
238 myEdge.resize( 1, theEdge );
239 myEdgeID.resize( 1, -1 );
241 myC3dAdaptor.resize( 1 );
242 myFirst.resize( 1, 0. );
243 myLast.resize( 1, 1. );
244 myNormPar.resize( 1, 1. );
245 myIsUniform.resize( 1, 1 );
246 myMissingVertexNodes = myIgnoreMediumNodes = false;
247 myDefaultPnt2d.SetCoord( 1e100, 1e100 );
248 if ( theMesh ) myProxyMesh.reset( new SMESH_ProxyMesh( *theMesh ));
249 if ( !theEdge.IsNull() )
251 if ( theMesh ) myEdgeID[0] = theMesh->GetMeshDS()->ShapeToIndex( theEdge );
252 if ( theFace.IsNull() )
253 BRep_Tool::Range( theEdge, myFirst[0], myLast[0] );
255 myC2d[0] = BRep_Tool::CurveOnSurface( theEdge, theFace, myFirst[0], myLast[0] );
256 if ( theEdge.Orientation() == TopAbs_REVERSED )
257 std::swap( myFirst[0], myLast[0] );
261 myPoints = theSideNodes;
262 myNbPonits = myPoints.size();
263 myNbSegments = myNbPonits + 1;
266 if ( !myPoints.empty() )
268 myPoints[0].normParam = 0;
269 if ( myPoints[0].node &&
270 myPoints.back().node &&
271 myPoints[ myNbPonits/2 ].node )
273 gp_Pnt pPrev = SMESH_TNodeXYZ( myPoints[0].node );
274 for ( size_t i = 1; i < myPoints.size(); ++i )
276 gp_Pnt p = SMESH_TNodeXYZ( myPoints[i].node );
277 myLength += p.Distance( pPrev );
278 myPoints[i].normParam = myLength;
282 else if ( !theFace.IsNull() )
285 Handle(Geom_Surface) surf = BRep_Tool::Surface( theFace, loc );
286 gp_Pnt pPrev = surf->Value( myPoints[0].u, myPoints[0].v );
287 for ( size_t i = 1; i < myPoints.size(); ++i )
289 gp_Pnt p = surf->Value( myPoints[i].u, myPoints[i].v );
290 myLength += p.Distance( pPrev );
291 myPoints[i].normParam = myLength;
297 gp_Pnt2d pPrev = myPoints[0].UV();
298 for ( size_t i = 1; i < myPoints.size(); ++i )
300 gp_Pnt2d p = myPoints[i].UV();
301 myLength += p.Distance( pPrev );
302 myPoints[i].normParam = myLength;
306 if ( myLength > std::numeric_limits<double>::min() )
307 for ( size_t i = 1; i < myPoints.size(); ++i )
308 myPoints[i].normParam /= myLength;
310 myEdgeLength.resize( 1, myLength );
313 //================================================================================
315 * Return info on nodes on the side
317 //================================================================================
319 const std::vector<UVPtStruct>& StdMeshers_FaceSide::GetUVPtStruct(bool isXConst,
320 double constValue) const
322 if ( myPoints.empty() )
324 if ( NbEdges() == 0 ) return myPoints;
326 StdMeshers_FaceSide* me = const_cast< StdMeshers_FaceSide* >( this );
327 //SMESHDS_Mesh* meshDS = myProxyMesh->GetMeshDS();
328 SMESH_MesherHelper eHelper( *myProxyMesh->GetMesh() );
329 SMESH_MesherHelper fHelper( *myProxyMesh->GetMesh() );
330 fHelper.SetSubShape( myFace );
334 // sort nodes of all edges by putting them into a map
336 map< double, const SMDS_MeshNode*> u2node;
337 vector< pair< double, const SMDS_MeshNode*> > u2nodeVec;
338 vector<const SMDS_MeshNode*> nodes;
339 set<const SMDS_MeshNode*> vertexNodes;
340 vector< const SMESH_ProxyMesh::SubMesh* > proxySubMesh( myEdge.size() );
341 int nbProxyNodes = 0;
344 for ( iE = 0; iE < myEdge.size(); ++iE )
346 proxySubMesh[iE] = myProxyMesh->GetProxySubMesh( myEdge[iE] );
347 if ( proxySubMesh[iE] )
349 if ( proxySubMesh[iE]->GetUVPtStructVec().empty() ) {
350 proxySubMesh[iE] = 0;
353 nbProxyNodes += proxySubMesh[iE]->GetUVPtStructVec().size() - 1;
354 if ( iE+1 == myEdge.size() )
360 // Add 1st vertex node of a current edge
361 const SMDS_MeshNode* node = VertexNode( iE );
362 const double prevNormPar = ( iE == 0 ? 0 : myNormPar[ iE-1 ]); // normalized param
363 if ( node ) // nodes on internal vertices may be missing
365 if ( vertexNodes.insert( node ).second ||
366 fHelper.IsRealSeam ( node->getshapeId() ) ||
367 fHelper.IsDegenShape( node->getshapeId() ))
368 u2node.insert( u2node.end(), make_pair( prevNormPar, node ));
372 for ( ++iE; iE < myEdge.size(); ++iE )
373 if (( node = VertexNode( iE ))) {
374 u2node.insert( make_pair( prevNormPar, node ));
381 vertexNodes.insert( node );
384 // Add internal nodes
386 if ( !GetEdgeNodes( iE, nodes, /*v0=*/false, /*v1=*/false ))
388 if ( !nodes.empty() )
391 double paramSize = myLast[iE] - myFirst[iE];
392 double r = myNormPar[iE] - prevNormPar;
393 eHelper.SetSubShape( myEdge[iE] );
394 eHelper.ToFixNodeParameters( true );
395 if ( !myIsUniform[iE] )
396 for ( size_t i = 0; i < nodes.size(); ++i )
398 double u = eHelper.GetNodeU( myEdge[iE], nodes[i], 0, ¶mOK );
399 double aLenU = GCPnts_AbscissaPoint::Length( me->myC3dAdaptor[iE], myFirst[iE], u );
400 if ( myEdgeLength[iE] < aLenU ) // nonregression test "3D_mesh_NETGEN/G6"
405 double normPar = prevNormPar + r * aLenU / myEdgeLength[iE];
406 u2nodeVec.push_back( make_pair( normPar, nodes[i] ));
408 if ( u2nodeVec.empty() )
409 for ( size_t i = 0; i < nodes.size(); ++i )
411 double u = eHelper.GetNodeU( myEdge[iE], nodes[i], 0, ¶mOK );
412 // paramSize is signed so orientation is taken into account
413 double normPar = prevNormPar + r * ( u - myFirst[iE] ) / paramSize;
414 u2nodeVec.push_back( make_pair( normPar, nodes[i] ));
416 for ( size_t j = 0; j < u2nodeVec.size(); ++j )
417 u2node.insert( u2node.end(), u2nodeVec[j] );
419 } // loop on myEdge's
421 // Add 2nd VERTEX node for a last EDGE
422 if ( !proxySubMesh.back() )
424 if ( u2node.empty() ) return myPoints;
426 const SMDS_MeshNode* node;
427 if ( IsClosed() && !proxySubMesh[0] )
428 node = u2node.begin()->second;
431 node = VertexNode( iE );
432 while ( !node && iE > 0 )
433 node = VertexNode( --iE );
437 if ( u2node.rbegin()->second == node &&
438 !fHelper.IsRealSeam ( node->getshapeId() ) &&
439 !fHelper.IsDegenShape( node->getshapeId() ))
440 u2node.erase( --u2node.end() );
442 u2node.insert( u2node.end(), make_pair( 1., node ));
445 if ((int) u2node.size() + nbProxyNodes != myNbPonits &&
446 (int) u2node.size() + nbProxyNodes != NbPoints( /*update=*/true ))
448 MESSAGE("Wrong node parameters on edges, u2node.size():"
449 <<u2node.size()<<" != myNbPonits:"<<myNbPonits);
453 // fill array of UVPtStruct
455 UVPtStructVec& points = me->myPoints;
456 points.resize( myNbPonits );
459 double prevNormPar = 0, paramSize = myNormPar[ 0 ];
460 map< double, const SMDS_MeshNode*>::iterator u_node = u2node.begin();
461 for ( size_t iE = 0; iE < myEdge.size(); ++iE )
463 if ( proxySubMesh[ iE ] ) // copy data from a proxy sub-mesh
465 const UVPtStructVec& edgeUVPtStruct = proxySubMesh[iE]->GetUVPtStructVec();
466 std::copy( edgeUVPtStruct.begin(), edgeUVPtStruct.end(), & points[iPt] );
468 double du1 = edgeUVPtStruct.back().param - edgeUVPtStruct[0].param;
469 double du2 = myLast[iE] - myFirst[iE];
472 std::reverse( & points[iPt], & points[iPt + edgeUVPtStruct.size()]);
473 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i )
474 points[iPt+i].normParam = 1. - points[iPt+i].normParam;
476 // update normalized params
477 if ( myEdge.size() > 1 ) {
478 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i, ++iPt )
480 UVPtStruct & uvPt = points[iPt];
481 uvPt.normParam = prevNormPar + uvPt.normParam * paramSize;
482 uvPt.x = uvPt.y = uvPt.normParam;
484 --iPt; // to point to the 1st VERTEX of the next EDGE
489 for ( ; u_node != u2node.end(); ++u_node, ++iPt )
491 if ( myNormPar[ iE ]-eps < u_node->first )
492 break; // u_node is at VERTEX of the next EDGE
494 UVPtStruct & uvPt = points[iPt];
495 uvPt.node = u_node->second;
496 // -- normParam, x, y --------------------------------
497 uvPt.normParam = u_node->first;
498 uvPt.x = uvPt.y = uvPt.normParam;
499 // -- U ----------------------------------------------
500 const SMDS_EdgePosition* epos =
501 dynamic_cast<const SMDS_EdgePosition*>(uvPt.node->GetPosition());
502 if ( epos && uvPt.node->getshapeId() == myEdgeID[iE] ) {
503 uvPt.param = epos->GetUParameter();
506 double r = ( uvPt.normParam - prevNormPar )/ paramSize;
507 uvPt.param = ( r > 0.5 ? myLast[iE] : myFirst[iE] );
509 // -- UV ---------------------------------------------
510 if ( !myC2d[ iE ].IsNull() ) {
511 gp_Pnt2d p = myC2d[ iE ]->Value( uvPt.param );
516 uvPt.u = uvPt.v = 1e+100;
520 // prepare for the next EDGE
521 if ( iE+1 < myEdge.size() )
523 prevNormPar = myNormPar[ iE ];
524 paramSize = myNormPar[ iE+1 ] - prevNormPar;
526 } // loop on myEdge's
530 for ( iPt = 0; iPt < (int)points.size(); ++iPt ) points[ iPt ].x = constValue;
532 for ( iPt = 0; iPt < (int)points.size(); ++iPt ) points[ iPt ].y = constValue;
534 } // if ( myPoints.empty())
539 //================================================================================
541 * \brief Falsificate info on nodes
542 * \param nbSeg - nb of segments on the side
543 * \retval UVPtStruct* - array of data structures
545 //================================================================================
547 const vector<UVPtStruct>& StdMeshers_FaceSide::SimulateUVPtStruct(int nbSeg,
549 double constValue) const
551 if ( myFalsePoints.empty() )
553 if ( NbEdges() == 0 ) return myFalsePoints;
555 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myFalsePoints );
556 points->resize( nbSeg+1 );
559 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
561 for ( size_t i = 0 ; i < myFalsePoints.size(); ++i )
563 double normPar = double(i) / double(nbSeg);
564 UVPtStruct & uvPt = (*points)[i];
566 uvPt.x = uvPt.y = uvPt.param = uvPt.normParam = normPar;
567 if ( isXConst ) uvPt.x = constValue;
568 else uvPt.y = constValue;
569 if ( myNormPar[ EdgeIndex ] < normPar )
571 prevNormPar = myNormPar[ EdgeIndex ];
573 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
575 double r = ( normPar - prevNormPar )/ paramSize;
576 uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
577 if ( !myC2d[ EdgeIndex ].IsNull() )
578 p = myC2d[ EdgeIndex ]->Value( uvPt.param );
580 p = Value2d( normPar );
585 return myFalsePoints;
588 //=======================================================================
589 //function : GetOrderedNodes
590 //purpose : Return nodes in the order they encounter while walking along the side
591 //=======================================================================
593 std::vector<const SMDS_MeshNode*> StdMeshers_FaceSide::GetOrderedNodes(int theEdgeInd) const
595 vector<const SMDS_MeshNode*> resultNodes;
596 if ( myPoints.empty() || ( theEdgeInd >= 0 && NbEdges() > 0 ))
598 if ( NbEdges() == 0 ) return resultNodes;
600 //SMESHDS_Mesh* meshDS = myProxyMesh->GetMeshDS();
601 SMESH_MesherHelper eHelper( *myProxyMesh->GetMesh() );
602 SMESH_MesherHelper fHelper( *myProxyMesh->GetMesh() );
603 fHelper.SetSubShape( myFace );
606 // Sort nodes of all edges putting them into a map
608 map< double, const SMDS_MeshNode*> u2node;
609 vector<const SMDS_MeshNode*> nodes;
610 set<const SMDS_MeshNode*> vertexNodes;
611 int iE = 0, iEnd = myEdge.size();
612 if ( theEdgeInd >= 0 )
614 iE = theEdgeInd % NbEdges();
617 for ( iE = 0; iE < iEnd; ++iE )
619 double prevNormPar = ( iE == 0 ? 0 : myNormPar[ iE-1 ]); // normalized param
621 const SMESH_ProxyMesh::SubMesh* proxySM = myProxyMesh->GetProxySubMesh( myEdge[iE] );
624 const UVPtStructVec& points = proxySM->GetUVPtStructVec();
625 for ( size_t i = 0; i < points.size(); ++i )
626 u2node.insert( make_pair( prevNormPar + points[i].normParam, points[i].node ));
630 // Add 1st vertex node of a current EDGE
631 const SMDS_MeshNode* node = VertexNode( iE );
632 if ( node ) { // nodes on internal vertices may be missing
633 if ( vertexNodes.insert( node ).second ||
634 fHelper.IsRealSeam ( node->getshapeId() ) ||
635 fHelper.IsDegenShape( node->getshapeId() ))
636 u2node.insert( make_pair( prevNormPar, node ));
640 if ( nodes.empty() ) {
641 for ( ++iE; iE < iEnd; ++iE )
642 if (( node = VertexNode( iE ))) {
643 u2node.insert( make_pair( prevNormPar, node ));
650 vertexNodes.insert( node );
653 // Add internal nodes
655 if ( !GetEdgeNodes( iE, nodes, /*v0=*/false, /*v1=*/false ))
657 if ( !nodes.empty() )
659 double paramSize = myLast[iE] - myFirst[iE];
660 double r = myNormPar[iE] - prevNormPar;
661 eHelper.SetSubShape( myEdge[iE] );
662 eHelper.ToFixNodeParameters( true );
663 for ( size_t i = 0; i < nodes.size(); ++i )
665 double u = eHelper.GetNodeU( myEdge[iE], nodes[i], 0, ¶mOK );
666 // paramSize is signed so orientation is taken into account
667 double normPar = prevNormPar + r * ( u - myFirst[iE] ) / paramSize;
668 u2node.insert( u2node.end(), make_pair( normPar, nodes[i] ));
674 if ( u2node.empty() ) return resultNodes;
676 // Add 2nd vertex node for a last EDGE
678 const SMDS_MeshNode* node;
679 if ( IsClosed() && theEdgeInd < 0 )
680 node = u2node.begin()->second;
683 node = VertexNode( iE );
684 while ( !node && iE > 0 )
685 node = VertexNode( --iE );
689 if ( u2node.rbegin()->second == node &&
690 !fHelper.IsRealSeam ( node->getshapeId() ) &&
691 !fHelper.IsDegenShape( node->getshapeId() ))
692 u2node.erase( --u2node.end() );
694 u2node.insert( u2node.end(), make_pair( 1., node ));
697 // Fill the result vector
699 if ( theEdgeInd < 0 &&
700 (int) u2node.size() != myNbPonits &&
701 (int) u2node.size() != NbPoints( /*update=*/true ))
705 resultNodes.reserve( u2node.size() );
706 map< double, const SMDS_MeshNode*>::iterator u2n = u2node.begin();
707 for ( ; u2n != u2node.end(); ++u2n )
708 resultNodes.push_back( u2n->second );
712 resultNodes.resize( myPoints.size() );
713 for ( size_t i = 0; i < myPoints.size(); ++i )
714 resultNodes[i] = myPoints[i].node;
720 //================================================================================
722 * \brief Return (unsorted) nodes of the i-th EDGE.
723 * Nodes moved to other geometry by MergeNodes() are also returned.
724 * \retval bool - is OK
726 //================================================================================
728 bool StdMeshers_FaceSide::GetEdgeNodes(size_t i,
729 vector<const SMDS_MeshNode*>& nodes,
730 bool inlude1stVertex,
731 bool inludeLastVertex) const
733 if ( i >= myEdge.size() )
736 SMESH_Mesh* mesh = myProxyMesh->GetMesh();
737 SMESHDS_Mesh* meshDS = mesh->GetMeshDS();
738 SMESHDS_SubMesh* sm = meshDS->MeshElements( myEdge[i] );
740 if ( inlude1stVertex )
742 if ( const SMDS_MeshNode* n0 = VertexNode( i ))
743 nodes.push_back( n0 );
746 if ( sm && ( sm->NbElements() > 0 || sm->NbNodes() > 0 ))
748 if ( mesh->HasModificationsToDiscard() ) // check nb of nodes on the EDGE sub-mesh
750 int iQuad = sm->NbElements() ? sm->GetElements()->next()->IsQuadratic() : 0;
751 int nbExpect = sm->NbElements() - 1 + iQuad * sm->NbElements();
752 if ( nbExpect != sm->NbNodes() ) // some nodes are moved from the EDGE by MergeNodes()
754 // add nodes of all segments
755 typedef set< const SMDS_MeshNode* > TNodeSet;
756 TNodeSet sharedNodes;
757 SMDS_ElemIteratorPtr segIt = sm->GetElements();
758 while ( segIt->more() )
760 const SMDS_MeshElement* seg = segIt->next();
761 if ( seg->GetType() != SMDSAbs_Edge )
763 for ( int i = 0; i < 3-myIgnoreMediumNodes; ++i )
765 const SMDS_MeshNode* n = seg->GetNode( i );
766 if ( i == 2 ) // medium node
768 nodes.push_back( n );
772 pair<TNodeSet::iterator, bool> it2new = sharedNodes.insert( n );
773 if ( !it2new.second ) // n encounters twice == it's on EDGE, not on VERTEX
775 nodes.push_back( n );
776 sharedNodes.erase( it2new.first );
783 if ( nodes.size() < 2 ) // add nodes assigned to the EDGE
785 SMDS_NodeIteratorPtr nItr = sm->GetNodes();
786 while ( nItr->more() )
788 const SMDS_MeshNode* n = nItr->next();
789 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( n, SMDSAbs_Edge ))
791 nodes.push_back( n );
794 } // if ( sm && sm->NbElements() > 0 )
796 if ( inludeLastVertex )
798 if ( const SMDS_MeshNode* n1 = VertexNode( i+1 ))
799 nodes.push_back( n1 );
804 //================================================================================
806 * \brief Return a node from the i-th VERTEX (count starts from zero)
807 * Nodes moved to other geometry by MergeNodes() are also returned.
808 * \param [in] i - the VERTEX index
809 * \param [out] isMoved - returns \c true if the found node is moved by MergeNodes()
810 * \return const SMDS_MeshNode* - the found node
812 //================================================================================
814 const SMDS_MeshNode* StdMeshers_FaceSide::VertexNode(std::size_t i, bool* isMoved) const
816 TopoDS_Vertex V = ( i >= myEdge.size() ) ? LastVertex() : FirstVertex(i);
818 const SMDS_MeshNode* n = SMESH_Algo::VertexNode( V, myProxyMesh->GetMeshDS() );
820 if ( !n && !myEdge.empty() && myProxyMesh->GetMesh()->HasModificationsToDiscard() )
822 size_t iE = ( i < myEdge.size() ) ? i : myEdge.size()-1;
823 SMESHDS_SubMesh* sm = myProxyMesh->GetMeshDS()->MeshElements( myEdgeID[ iE ]);
825 n = SMESH_Algo::VertexNode( V, sm, myProxyMesh->GetMesh(), /*checkV=*/false );
828 (( i > 0 && (int) i < NbEdges() ) || IsClosed() ))
830 iE = SMESH_MesherHelper::WrapIndex( int(i)-1, NbEdges() );
831 sm = myProxyMesh->GetMeshDS()->MeshElements( myEdgeID[ iE ]);
832 n = SMESH_Algo::VertexNode( V, sm, myProxyMesh->GetMesh(), /*checkV=*/false );
835 if ( n && n->GetPosition()->GetDim() == 1 ) // check that n does not lie on an EDGE of myFace
837 TopoDS_Shape S = SMESH_MesherHelper::GetSubShapeByNode( n, myProxyMesh->GetMeshDS() );
838 if ( SMESH_MesherHelper::IsSubShape( S, myFace ))
839 n = 0; // VERTEX ignored by e.g. Composite Wire Discretization algo
847 //================================================================================
849 * \brief reverse order of vector elements
850 * \param vec - vector to reverse
852 //================================================================================
854 template <typename T > void reverse(vector<T> & vec)
856 std::reverse( vec.begin(), vec.end() );
859 //================================================================================
861 * \brief Change orientation of side geometry
863 //================================================================================
865 void StdMeshers_FaceSide::Reverse()
867 int nbEdges = myEdge.size();
868 for ( int i = nbEdges-1; i >= 0; --i ) {
869 std::swap( myFirst[i], myLast[i] );
870 if ( !myEdge[i].IsNull() )
872 if ( i > 0 ) // at the first loop 1. is overwritten
873 myNormPar[i] = 1 - myNormPar[i-1];
879 //reverse( myC3dAdaptor );
882 reverse( myNormPar );
883 reverse( myEdgeLength );
884 reverse( myIsUniform );
888 myNormPar[nbEdges-1]=1.;
889 if ( !myEdge[0].IsNull() )
891 for ( size_t i = 0; i < myEdge.size(); ++i )
892 reverseProxySubmesh( myEdge[i] );
894 myFalsePoints.clear();
898 for ( size_t i = 0; i < myPoints.size(); ++i )
900 UVPtStruct & uvPt = myPoints[i];
901 uvPt.normParam = 1 - uvPt.normParam;
907 for ( size_t i = 0; i < myFalsePoints.size(); ++i )
909 UVPtStruct & uvPt = myFalsePoints[i];
910 uvPt.normParam = 1 - uvPt.normParam;
914 reverse( myFalsePoints );
917 for ( size_t i = 0; i < myEdge.size(); ++i )
919 if ( myEdge[i].IsNull() ) continue; // for a side on points only
921 Handle(Geom_Curve) C3d = BRep_Tool::Curve(myEdge[i],fp,lp);
923 myC3dAdaptor[i].Load( C3d, fp,lp );
927 //=======================================================================
928 //function : SetIgnoreMediumNodes
929 //purpose : Make ignore medium nodes
930 //=======================================================================
932 void StdMeshers_FaceSide::SetIgnoreMediumNodes(bool toIgnore)
934 if ( myIgnoreMediumNodes != toIgnore )
936 myIgnoreMediumNodes = toIgnore;
938 if ( !myPoints.empty() )
940 UVPtStructVec newPoints;
941 newPoints.reserve( myPoints.size()/2 + 1 );
942 for ( size_t i = 0; i < myPoints.size(); i += 2 )
943 newPoints.push_back( myPoints[i] );
945 myPoints.swap( newPoints );
949 NbPoints( /*update=*/true );
954 //=======================================================================
955 //function : NbPoints
956 //purpose : Return nb nodes on edges and vertices (+1 to be == GetUVPtStruct().size() )
957 // Call it with update == true if mesh of this side can be recomputed
958 // since creation of this side
959 //=======================================================================
961 int StdMeshers_FaceSide::NbPoints(const bool update) const
963 if ( !myPoints.empty() )
964 return myPoints.size();
966 // if ( !myFalsePoints.empty() )
967 // return myFalsePoints.size();
969 if ( update && myEdge.size() > 0 )
971 StdMeshers_FaceSide* me = (StdMeshers_FaceSide*) this;
973 me->myNbSegments = 0;
974 me->myMissingVertexNodes = false;
976 vector<const SMDS_MeshNode*> nodes;
977 for ( int i = 0; i < NbEdges(); ++i )
979 if ( const SMESHDS_SubMesh* sm = myProxyMesh->GetSubMesh( Edge(i) ))
981 if ( sm->NbNodes() == sm->NbElements()-1 || sm->NbElements() == 0 )
983 me->myNbPonits += sm->NbNodes();
984 if ( myIgnoreMediumNodes && sm->IsQuadratic() )
985 me->myNbPonits -= sm->NbElements();
987 else // nodes can be moved to other shapes by MergeNodes()
990 GetEdgeNodes( i, nodes, /*v1=*/false, /*v2=*/false );
991 me->myNbPonits += nodes.size();
993 me->myNbSegments += sm->NbElements();
997 SMESH_MesherHelper helper( *myProxyMesh->GetMesh() );
998 helper.SetSubShape( myFace );
1000 std::set< const SMDS_MeshNode* > vNodes;
1001 const int nbV = NbEdges() + !IsClosed();
1002 for ( int i = 0; i < nbV; ++i )
1003 if ( const SMDS_MeshNode* n = VertexNode( i ))
1005 if ( !vNodes.insert( n ).second &&
1006 ( helper.IsRealSeam ( n->getshapeId() ) ||
1007 helper.IsDegenShape( n->getshapeId() )))
1012 me->myMissingVertexNodes = true;
1014 me->myNbPonits += vNodes.size();
1017 me->myNbPonits++; // closing node is repeated
1022 //=======================================================================
1023 //function : NbSegments
1024 //purpose : Return nb edges
1025 // Call it with update == true if mesh of this side can be recomputed
1026 // since creation of this side
1027 //=======================================================================
1029 int StdMeshers_FaceSide::NbSegments(const bool update) const
1031 return NbPoints( update ), myNbSegments;
1034 //================================================================================
1036 * \brief Reverse UVPtStructVec if a proxy sub-mesh of E
1038 //================================================================================
1040 void StdMeshers_FaceSide::reverseProxySubmesh( const TopoDS_Edge& E )
1042 if ( !myProxyMesh ) return;
1043 if ( const SMESH_ProxyMesh::SubMesh* sm = myProxyMesh->GetProxySubMesh( E ))
1045 UVPtStructVec& edgeUVPtStruct = (UVPtStructVec& ) sm->GetUVPtStructVec();
1046 for ( size_t i = 0; i < edgeUVPtStruct.size(); ++i )
1048 UVPtStruct & uvPt = edgeUVPtStruct[i];
1049 uvPt.normParam = 1 - uvPt.normParam;
1050 uvPt.x = 1 - uvPt.x;
1051 uvPt.y = 1 - uvPt.y;
1053 reverse( edgeUVPtStruct );
1057 //================================================================================
1059 * \brief Show side features
1061 //================================================================================
1063 void StdMeshers_FaceSide::dump(const char* msg) const
1066 if (msg) MESSAGE ( std::endl << msg );
1067 MESSAGE_BEGIN ("NB EDGES: "<< myEdge.size() );
1068 MESSAGE_ADD ( "nbPoints: "<<myNbPonits<<" vecSize: " << myPoints.size()<<" "<<myFalsePoints.size() );
1069 for ( size_t i = 0; i < myEdge.size(); ++i )
1071 MESSAGE_ADD ( "\t"<<i+1 );
1072 MESSAGE_ADD ( "\tEDGE: " );
1073 if (myEdge[i].IsNull()) {
1074 MESSAGE_ADD ( "NULL" );
1077 TopAbs::Print(myEdge[i].Orientation(),cout)<<" "<<myEdge[i].TShape().operator->()<<endl;
1078 MESSAGE_ADD ( "\tV1: " << TopExp::FirstVertex( myEdge[i], 1).TShape().operator->()
1079 << " V2: " << TopExp::LastVertex( myEdge[i], 1).TShape().operator->() );
1081 MESSAGE_ADD ( "\tC2d: ");
1083 if (myC2d[i].IsNull()) {
1084 MESSAGE_ADD ( "NULL" );
1087 MESSAGE_ADD ( myC2d[i].operator->() );
1090 MESSAGE_ADD ( "\tF: "<<myFirst[i]<< " L: "<< myLast[i] );
1091 MESSAGE_END ( "\tnormPar: "<<myNormPar[i]<<endl );
1096 //================================================================================
1098 * \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
1099 * \retval Adaptor2d_Curve2d* -
1101 //================================================================================
1103 struct Adaptor2dCurve2d : public Adaptor2d_Curve2d
1105 const StdMeshers_FaceSide* mySide;
1106 Adaptor2dCurve2d(const StdMeshers_FaceSide* faceSide):mySide(faceSide) {}
1107 gp_Pnt2d Value(const Standard_Real U) const { return mySide->Value2d( U ); }
1108 Standard_Real FirstParameter() const { return 0; }
1109 Standard_Real LastParameter() const { return 1; }
1112 Adaptor2d_Curve2d* StdMeshers_FaceSide::GetCurve2d() const
1114 return new Adaptor2dCurve2d( this );
1117 //================================================================================
1119 * \brief Creates a fully functional Adaptor_Curve
1121 //================================================================================
1123 BRepAdaptor_CompCurve* StdMeshers_FaceSide::GetCurve3d() const
1125 if ( myEdge.empty() )
1129 BRep_Builder aBuilder;
1130 aBuilder.MakeWire(aWire);
1131 for ( size_t i = 0; i < myEdge.size(); ++i )
1132 aBuilder.Add( aWire, myEdge[i] );
1134 if ( myEdge.size() == 2 && IsClosed() )
1135 aWire.Closed(true); // issue 0021141
1137 return new BRepAdaptor_CompCurve( aWire );
1140 //================================================================================
1142 * \brief Return 2D point by normalized parameter
1143 * \param U - normalized parameter value
1144 * \retval gp_Pnt2d - point
1146 //================================================================================
1148 gp_Pnt2d StdMeshers_FaceSide::Value2d(double U) const
1150 if ( !myC2d[0].IsNull() ) {
1151 int i = EdgeIndex( U );
1152 double prevU = i ? myNormPar[ i-1 ] : 0;
1153 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
1155 double par = myFirst[i] * ( 1 - r ) + myLast[i] * r;
1157 // check parametrization of curve
1158 if( !myIsUniform[i] )
1160 double aLen3dU = r * myEdgeLength[i] * ( myFirst[i]>myLast[i] ? -1. : 1.);
1161 GCPnts_AbscissaPoint AbPnt
1162 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), aLen3dU, myFirst[i] );
1163 if( AbPnt.IsDone() ) {
1164 par = AbPnt.Parameter();
1167 return myC2d[ i ]->Value(par);
1170 else if ( !myPoints.empty() )
1172 int i = U * double( myPoints.size()-1 );
1173 while ( i > 0 && myPoints[ i ].normParam > U )
1175 while ( i+1 < (int)myPoints.size() && myPoints[ i+1 ].normParam < U )
1177 double r = (( U - myPoints[ i ].normParam ) /
1178 ( myPoints[ i+1 ].normParam - myPoints[ i ].normParam ));
1179 return ( myPoints[ i ].UV() * ( 1 - r ) +
1180 myPoints[ i+1 ].UV() * r );
1182 return myDefaultPnt2d;
1185 //================================================================================
1187 * \brief Return XYZ by normalized parameter
1188 * \param U - normalized parameter value
1189 * \retval gp_Pnt - point
1191 //================================================================================
1193 gp_Pnt StdMeshers_FaceSide::Value3d(double U) const
1195 int i = EdgeIndex( U );
1196 double prevU = i ? myNormPar[ i-1 ] : 0;
1197 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
1199 double par = myFirst[i] * ( 1 - r ) + myLast[i] * r;
1201 // check parametrization of curve
1202 if( !myIsUniform[i] )
1204 double aLen3dU = r * myEdgeLength[i] * ( myFirst[i]>myLast[i] ? -1. : 1.);
1205 GCPnts_AbscissaPoint AbPnt
1206 ( const_cast<GeomAdaptor_Curve&>( myC3dAdaptor[i]), aLen3dU, myFirst[i] );
1207 if( AbPnt.IsDone() ) {
1208 par = AbPnt.Parameter();
1211 return myC3dAdaptor[ i ].Value(par);
1214 //================================================================================
1216 * \brief Return wires of a face as StdMeshers_FaceSide's
1218 //================================================================================
1220 TSideVector StdMeshers_FaceSide::GetFaceWires(const TopoDS_Face& theFace,
1221 SMESH_Mesh & theMesh,
1222 const bool theIgnoreMediumNodes,
1224 SMESH_ProxyMesh::Ptr theProxyMesh,
1225 const bool theCheckVertexNodes)
1227 list< TopoDS_Edge > edges, internalEdges;
1228 list< int > nbEdgesInWires;
1229 int nbWires = SMESH_Block::GetOrderedEdges (theFace, edges, nbEdgesInWires);
1231 // split list of all edges into separate wires
1232 TSideVector wires( nbWires );
1233 list< int >::iterator nbE = nbEdgesInWires.begin();
1234 list< TopoDS_Edge >::iterator from = edges.begin(), to = from;
1235 for ( int iW = 0; iW < nbWires; ++iW, ++nbE )
1237 std::advance( to, *nbE );
1238 if ( *nbE == 0 ) // Issue 0020676
1242 wires.resize( nbWires );
1245 list< TopoDS_Edge > wireEdges( from, to );
1246 // assure that there is a node on the first vertex
1247 // as StdMeshers_FaceSide::GetUVPtStruct() requires
1248 if ( wireEdges.front().Orientation() != TopAbs_INTERNAL ) // Issue 0020676
1250 if ( theCheckVertexNodes )
1251 while ( !SMESH_Algo::VertexNode( TopExp::FirstVertex( wireEdges.front(), true),
1252 theMesh.GetMeshDS()))
1254 wireEdges.splice(wireEdges.end(), wireEdges,
1255 wireEdges.begin(), ++wireEdges.begin());
1256 if ( from->IsSame( wireEdges.front() )) {
1258 ( new SMESH_ComputeError(COMPERR_BAD_INPUT_MESH,"No nodes on vertices"));
1259 return TSideVector(0);
1263 else if ( *nbE > 1 ) // Issue 0020676 (Face_pb_netgen.brep) - several internal edges in a wire
1265 internalEdges.splice( internalEdges.end(), wireEdges, ++wireEdges.begin(), wireEdges.end());
1268 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, wireEdges, &theMesh,
1269 /*isForward=*/true, theIgnoreMediumNodes,
1271 wires[ iW ] = StdMeshers_FaceSidePtr( wire );
1274 while ( !internalEdges.empty() )
1276 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, internalEdges.back(), &theMesh,
1277 /*isForward=*/true, theIgnoreMediumNodes,
1279 wires.push_back( StdMeshers_FaceSidePtr( wire ));
1280 internalEdges.pop_back();
1285 //================================================================================
1287 * \brief Return 1st vertex of the i-the edge
1289 //================================================================================
1291 TopoDS_Vertex StdMeshers_FaceSide::FirstVertex(int i) const
1294 if ( i < NbEdges() )
1296 v = myEdge[i].Orientation() <= TopAbs_REVERSED ? // FORWARD || REVERSED
1297 TopExp::FirstVertex( myEdge[i], 1 ) :
1298 TopoDS::Vertex( TopoDS_Iterator( myEdge[i] ).Value() );
1303 //================================================================================
1305 * \brief Return last vertex of the i-the edge
1307 //================================================================================
1309 TopoDS_Vertex StdMeshers_FaceSide::LastVertex(int i) const
1312 if ( i < NbEdges() )
1314 const TopoDS_Edge& edge = i<0 ? myEdge[ NbEdges() + i ] : myEdge[i];
1315 if ( edge.Orientation() <= TopAbs_REVERSED ) // FORWARD || REVERSED
1316 v = TopExp::LastVertex( edge, 1 );
1318 for ( TopoDS_Iterator vIt( edge ); vIt.More(); vIt.Next() )
1319 v = TopoDS::Vertex( vIt.Value() );
1324 //================================================================================
1326 * \brief Return \c true if the chain of EDGEs is closed
1328 //================================================================================
1330 bool StdMeshers_FaceSide::IsClosed() const
1332 return myEdge.empty() ? false : FirstVertex().IsSame( LastVertex() );