1 // Copyright (C) 2007-2008 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
22 // SMESH SMESH : implementaion of SMESH idl descriptions
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_MeshEditor.hxx"
37 #include "SMESH_ComputeError.hxx"
38 #include "SMESH_Block.hxx"
40 #include <Adaptor2d_Curve2d.hxx>
41 #include <BRepAdaptor_CompCurve.hxx>
42 #include <BRepAdaptor_Curve.hxx>
43 #include <BRep_Builder.hxx>
44 #include <BRep_Tool.hxx>
46 #include <TopExp_Explorer.hxx>
47 #include <TopoDS_Face.hxx>
48 #include <TopoDS_Vertex.hxx>
49 #include <TopoDS_Wire.hxx>
53 #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 myC2d.resize( nbEdges );
92 myFirst.resize( nbEdges );
93 myLast.resize( nbEdges );
94 myNormPar.resize( nbEdges );
96 myNbPonits = myNbSegments = 0;
98 myMissingVertexNodes = false;
99 myIgnoreMediumNodes = theIgnoreMediumNodes;
100 if ( nbEdges == 0 ) return;
102 SMESHDS_Mesh* meshDS = theMesh->GetMeshDS();
103 vector<double> len( nbEdges );
106 list<TopoDS_Edge>::iterator edge = theEdges.begin();
107 for ( int index = 0; edge != theEdges.end(); ++index, ++edge )
109 int i = theIsForward ? index : nbEdges - index - 1;
110 len[i] = SMESH_Algo::EdgeLength( *edge );
111 if ( len[i] < DBL_MIN ) nbDegen++;
114 if ( !theIsForward ) myEdge[i].Reverse();
116 if ( theFace.IsNull() )
117 BRep_Tool::Range( *edge, myFirst[i], myLast[i] );
119 myC2d[i] = BRep_Tool::CurveOnSurface( *edge, theFace, myFirst[i], myLast[i] );
120 if ( myEdge[i].Orientation() == TopAbs_REVERSED )
121 std::swap( myFirst[i], myLast[i] );
123 if ( SMESHDS_SubMesh* sm = meshDS->MeshElements( *edge )) {
124 int nbN = sm->NbNodes();
125 if ( theIgnoreMediumNodes ) {
126 SMDS_ElemIteratorPtr elemIt = sm->GetElements();
127 if ( elemIt->more() && elemIt->next()->IsQuadratic() )
128 nbN -= sm->NbElements();
131 myNbSegments += sm->NbElements();
133 if ( SMESH_Algo::VertexNode( TopExp::FirstVertex( *edge, 1), meshDS ))
134 myNbPonits += 1; // for the first end
136 myMissingVertexNodes = true;
138 if ( SMESH_Algo::VertexNode( TopExp::LastVertex( theEdges.back(), 1), meshDS ))
139 myNbPonits++; // for the last end
141 myMissingVertexNodes = true;
143 if ( nbEdges > 1 && myLength > DBL_MIN ) {
144 const double degenNormLen = 1.e-5;
145 double totLength = myLength;
147 totLength += myLength * degenNormLen * nbDegen;
148 double prevNormPar = 0;
149 for ( int i = 0; i < nbEdges; ++i ) {
150 if ( len[ i ] < DBL_MIN )
151 len[ i ] = myLength * degenNormLen;
152 myNormPar[ i ] = prevNormPar + len[i]/totLength;
153 prevNormPar = myNormPar[ i ];
156 myNormPar[nbEdges-1] = 1.;
160 //================================================================================
162 * \brief Return info on nodes on the side
163 * \retval UVPtStruct* - array of data structures
165 //================================================================================
167 const vector<UVPtStruct>& StdMeshers_FaceSide::GetUVPtStruct(bool isXConst,
168 double constValue) const
170 if ( myPoints.empty() ) {
172 if ( NbEdges() == 0 ) return myPoints;
174 SMESHDS_Mesh* meshDS = myMesh->GetMeshDS();
176 // sort nodes of all edges putting them into a map
178 map< double, const SMDS_MeshNode*> u2node;
180 for ( int i = 0; i < myEdge.size(); ++i )
182 // put 1st vertex node
183 TopoDS_Vertex VFirst, VLast;
184 TopExp::Vertices( myEdge[i], VFirst, VLast, true);
185 const SMDS_MeshNode* node = SMESH_Algo::VertexNode( VFirst, meshDS );
186 double prevNormPar = ( i == 0 ? 0 : myNormPar[ i-1 ]); // normalized param
187 if ( node ) { // internal nodes may be missing
188 u2node.insert( make_pair( prevNormPar, node ));
189 } else if ( i == 0 ) {
190 MESSAGE(" NO NODE on VERTEX" );
194 // put 2nd vertex node for a last edge
195 if ( i+1 == myEdge.size() ) {
196 node = SMESH_Algo::VertexNode( VLast, meshDS );
198 MESSAGE(" NO NODE on VERTEX" );
201 u2node.insert( make_pair( 1., node ));
204 // put internal nodes
205 SMESHDS_SubMesh* sm = meshDS->MeshElements( myEdge[i] );
207 SMDS_NodeIteratorPtr nItr = sm->GetNodes();
208 double paramSize = myLast[i] - myFirst[i], r = myNormPar[i] - prevNormPar;
209 while ( nItr->more() ) {
210 const SMDS_MeshNode* node = nItr->next();
211 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
213 const SMDS_EdgePosition* epos =
214 static_cast<const SMDS_EdgePosition*>(node->GetPosition().get());
215 double u = epos->GetUParameter();
216 // paramSize is signed so orientation is taken into account
217 double normPar = prevNormPar + r * ( u - myFirst[i] ) / paramSize;
219 if ( normPar > 1 || normPar < 0) {
221 MESSAGE ( "WRONG normPar: "<<normPar<< " prevNormPar="<<prevNormPar
222 << " u="<<u << " myFirst[i]="<<myFirst[i]<< " myLast[i]="<<myLast[i]
223 << " paramSize="<<paramSize );
226 u2node.insert( make_pair( normPar, node ));
229 if ( u2node.size() != myNbPonits ) {
230 MESSAGE("Wrong node parameters on edges, u2node.size():"
231 <<u2node.size()<<" != myNbPonits:"<<myNbPonits);
235 // fill array of UVPtStruct
237 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myPoints );
238 points->resize( myNbPonits );
241 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
242 map< double, const SMDS_MeshNode*>::iterator u_node = u2node.begin();
243 for (int i = 0 ; u_node != u2node.end(); ++u_node, ++i ) {
244 UVPtStruct & uvPt = (*points)[i];
245 uvPt.node = u_node->second;
246 uvPt.x = uvPt.y = uvPt.normParam = u_node->first;
247 if ( isXConst ) uvPt.x = constValue;
248 else uvPt.y = constValue;
249 if ( myNormPar[ EdgeIndex ] < uvPt.normParam ) {
250 prevNormPar = myNormPar[ EdgeIndex ];
253 if ( EdgeIndex >= myEdge.size() ) {
255 MESSAGE ( "WRONg EdgeIndex " << 1+EdgeIndex
256 << " myNormPar.size()="<<myNormPar.size()
257 << " myNormPar["<< EdgeIndex<<"]="<< myNormPar[ EdgeIndex ]
258 << " uvPt.normParam="<<uvPt.normParam );
261 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
263 const SMDS_EdgePosition* epos =
264 dynamic_cast<const SMDS_EdgePosition*>(uvPt.node->GetPosition().get());
266 uvPt.param = epos->GetUParameter();
269 double r = ( uvPt.normParam - prevNormPar )/ paramSize;
270 // uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
271 uvPt.param = ( r > 0.5 ? myLast[EdgeIndex] : myFirst[EdgeIndex] );
273 if ( !myC2d[ EdgeIndex ].IsNull() ) {
274 gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
279 uvPt.u = uvPt.v = 1e+100;
286 //================================================================================
288 * \brief Falsificate info on nodes
289 * \param nbSeg - nb of segments on the side
290 * \retval UVPtStruct* - array of data structures
292 //================================================================================
294 const vector<UVPtStruct>& StdMeshers_FaceSide::SimulateUVPtStruct(int nbSeg,
296 double constValue) const
298 if ( myFalsePoints.empty() ) {
300 if ( NbEdges() == 0 ) return myFalsePoints;
302 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myFalsePoints );
303 points->resize( nbSeg+1 );
306 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
307 for (int i = 0 ; i < myFalsePoints.size(); ++i ) {
308 double normPar = double(i) / double(nbSeg);
309 UVPtStruct & uvPt = (*points)[i];
311 uvPt.x = uvPt.y = uvPt.param = uvPt.normParam = normPar;
312 if ( isXConst ) uvPt.x = constValue;
313 else uvPt.y = constValue;
314 if ( myNormPar[ EdgeIndex ] < normPar ) {
315 prevNormPar = myNormPar[ EdgeIndex ];
317 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
319 double r = ( normPar - prevNormPar )/ paramSize;
320 uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
321 if ( !myC2d[ EdgeIndex ].IsNull() ) {
322 gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
327 uvPt.u = uvPt.v = 1e+100;
331 return myFalsePoints;
333 // gp_Pnt StdMeshers_FaceSide::Value(double U) const
337 //================================================================================
339 * \brief reverse order of vector elements
340 * \param vec - vector to reverse
342 //================================================================================
344 template <typename T > void reverse(vector<T> & vec)
346 for ( int f=0, r=vec.size()-1; f < r; ++f, --r )
347 std::swap( vec[f], vec[r] );
350 //================================================================================
352 * \brief Change orientation of side geometry
354 //================================================================================
356 void StdMeshers_FaceSide::Reverse()
358 int nbEdges = myEdge.size();
359 for ( int i = nbEdges-1; i >= 0; --i ) {
360 std::swap( myFirst[i], myLast[i] );
362 if ( i > 0 ) // at the first loop 1. is overwritten
363 myNormPar[i] = 1 - myNormPar[i-1];
370 reverse( myNormPar );
372 myNormPar[nbEdges-1]=1.;
374 myFalsePoints.clear();
377 //================================================================================
379 * \brief Show side features
381 //================================================================================
383 void StdMeshers_FaceSide::dump(const char* msg) const
386 if (msg) MESSAGE ( std::endl << msg );
387 MESSAGE_BEGIN ("NB EDGES: "<< myEdge.size() );
388 MESSAGE_ADD ( "nbPoints: "<<myNbPonits<<" vecSize: " << myPoints.size()<<" "<<myFalsePoints.size() );
389 for ( int i=0; i<myEdge.size(); ++i)
391 MESSAGE_ADD ( "\t"<<i+1 );
392 MESSAGE_ADD ( "\tEDGE: " );
393 if (myEdge[i].IsNull()) {
394 MESSAGE_ADD ( "NULL" );
397 TopAbs::Print(myEdge[i].Orientation(),cout)<<" "<<myEdge[i].TShape().operator->()<<endl;
398 MESSAGE_ADD ( "\tV1: " << TopExp::FirstVertex( myEdge[i], 1).TShape().operator->()
399 << " V2: " << TopExp::LastVertex( myEdge[i], 1).TShape().operator->() );
401 MESSAGE_ADD ( "\tC2d: ");
403 if (myC2d[i].IsNull()) {
404 MESSAGE_ADD ( "NULL" );
407 MESSAGE_ADD ( myC2d[i].operator->() );
410 MESSAGE_ADD ( "\tF: "<<myFirst[i]<< " L: "<< myLast[i] );
411 MESSAGE_END ( "\tnormPar: "<<myNormPar[i]<<endl );
416 //================================================================================
418 * \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
419 * \retval Adaptor2d_Curve2d* -
421 //================================================================================
423 struct Adaptor2dCurve2d : public Adaptor2d_Curve2d
425 const StdMeshers_FaceSide* mySide;
426 Adaptor2dCurve2d(const StdMeshers_FaceSide* faceSide):mySide(faceSide) {}
427 gp_Pnt2d Value(const Standard_Real U) const { return mySide->Value2d( U ); }
428 Standard_Real FirstParameter() const { return 0; }
429 Standard_Real LastParameter() const { return 1; }
432 Adaptor2d_Curve2d* StdMeshers_FaceSide::GetCurve2d() const
434 return new Adaptor2dCurve2d( this );
437 //================================================================================
439 * \brief Creates a fully functional Adaptor_Curve
441 //================================================================================
443 BRepAdaptor_CompCurve* StdMeshers_FaceSide::GetCurve3d() const
445 if ( myEdge.empty() )
448 // if ( myEdge.size() == 1 )
449 // return new BRepAdaptor_Curve( myEdge[0] );
452 BRep_Builder aBuilder;
453 aBuilder.MakeWire(aWire);
454 for ( int i=0; i<myEdge.size(); ++i )
455 aBuilder.Add( aWire, myEdge[i] );
456 return new BRepAdaptor_CompCurve( aWire );
459 //================================================================================
461 * \brief Return 2D point by normalized parameter
462 * \param U - normalized parameter value
463 * \retval gp_Pnt2d - point
465 //================================================================================
467 gp_Pnt2d StdMeshers_FaceSide::Value2d(double U) const
469 if ( !myC2d[0].IsNull() ) {
470 int i = EdgeIndex( U );
471 double prevU = i ? myNormPar[ i-1 ] : 0;
472 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
473 return myC2d[ i ]->Value( myFirst[i] * ( 1 - r ) + myLast[i] * r );
475 return gp_Pnt2d( 1e+100, 1e+100 );
478 //================================================================================
480 * \brief Return wires of a face as StdMeshers_FaceSide's
482 //================================================================================
484 TSideVector StdMeshers_FaceSide::GetFaceWires(const TopoDS_Face& theFace,
485 SMESH_Mesh & theMesh,
486 const bool theIgnoreMediumNodes,
490 list< TopoDS_Edge > edges;
491 list< int > nbEdgesInWires;
492 int nbWires = SMESH_Block::GetOrderedEdges (theFace, V1, edges, nbEdgesInWires);
494 // split list of all edges into separate wires
495 TSideVector wires( nbWires );
496 list< int >::iterator nbE = nbEdgesInWires.begin();
497 list< TopoDS_Edge >::iterator from, to;
498 from = to = edges.begin();
499 for ( int iW = 0; iW < nbWires; ++iW )
501 std::advance( to, *nbE++ );
502 list< TopoDS_Edge > wireEdges( from, to );
503 // assure that there is a node on the first vertex
504 // as StdMeshers_FaceSide::GetUVPtStruct() requires
505 while ( !SMESH_Algo::VertexNode( TopExp::FirstVertex( wireEdges.front(), true),
506 theMesh.GetMeshDS()))
508 wireEdges.splice(wireEdges.end(), wireEdges,
509 wireEdges.begin(), ++wireEdges.begin());
510 if ( from->IsSame( wireEdges.front() )) {
512 ( new SMESH_ComputeError(COMPERR_BAD_INPUT_MESH,"No nodes on vertices"));
513 return TSideVector(0);
516 // find out side orientation, which is important if there are several wires (PAL19080)
517 bool isForward = true;
519 TopExp_Explorer e( theFace, TopAbs_EDGE );
520 while ( ! e.Current().IsSame( wireEdges.back() ))
522 isForward = ( e.Current().Orientation() == wireEdges.back().Orientation() );
525 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, wireEdges, &theMesh,
526 isForward, theIgnoreMediumNodes);
527 wires[ iW ] = StdMeshers_FaceSidePtr( wire );