1 // SMESH SMESH : implementaion of SMESH idl descriptions
3 // Copyright (C) 2003 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
24 // File : StdMeshers_FaceSide.hxx
25 // Created : Wed Jan 31 18:41:25 2007
26 // Author : Edward AGAPOV (eap)
29 #include "StdMeshers_FaceSide.hxx"
31 #include "SMDS_EdgePosition.hxx"
32 #include "SMDS_MeshNode.hxx"
33 #include "SMESHDS_Mesh.hxx"
34 #include "SMESHDS_SubMesh.hxx"
35 //#include "SMESH_Algo.hxx"
36 #include "SMESH_Mesh.hxx"
37 #include "SMESH_MeshEditor.hxx"
38 #include "SMESH_ComputeError.hxx"
39 #include "SMESH_Block.hxx"
41 #include <Adaptor2d_Curve2d.hxx>
42 #include <BRepAdaptor_CompCurve.hxx>
43 #include <BRepAdaptor_Curve.hxx>
44 #include <BRep_Builder.hxx>
45 #include <BRep_Tool.hxx>
47 #include <TopExp_Explorer.hxx>
48 #include <TopoDS_Face.hxx>
49 #include <TopoDS_Vertex.hxx>
50 #include <TopoDS_Wire.hxx>
54 #include "utilities.h"
56 //================================================================================
58 * \brief Constructor of a side of one edge
59 * \param theFace - the face
60 * \param theEdge - the edge
62 //================================================================================
64 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
65 const TopoDS_Edge& theEdge,
67 const bool theIsForward,
68 const bool theIgnoreMediumNodes)
70 list<TopoDS_Edge> edges(1,theEdge);
71 *this = StdMeshers_FaceSide( theFace, edges, theMesh, theIsForward, theIgnoreMediumNodes );
74 //================================================================================
76 * \brief Constructor of a side of several edges
77 * \param theFace - the face
78 * \param theEdge - the edge
80 //================================================================================
82 StdMeshers_FaceSide::StdMeshers_FaceSide(const TopoDS_Face& theFace,
83 list<TopoDS_Edge>& theEdges,
85 const bool theIsForward,
86 const bool theIgnoreMediumNodes)
88 int nbEdges = theEdges.size();
89 myEdge.resize( nbEdges );
90 myC2d.resize( nbEdges );
91 myFirst.resize( nbEdges );
92 myLast.resize( nbEdges );
93 myNormPar.resize( nbEdges );
95 myNbPonits = myNbSegments = 0;
97 myMissingVertexNodes = false;
98 myIgnoreMediumNodes = theIgnoreMediumNodes;
99 if ( nbEdges == 0 ) return;
101 SMESHDS_Mesh* meshDS = theMesh->GetMeshDS();
102 vector<double> len( nbEdges );
105 list<TopoDS_Edge>::iterator edge = theEdges.begin();
106 for ( int index = 0; edge != theEdges.end(); ++index, ++edge )
108 int i = theIsForward ? index : nbEdges - index - 1;
109 len[i] = SMESH_Algo::EdgeLength( *edge );
110 if ( len[i] < DBL_MIN ) nbDegen++;
113 if ( !theIsForward ) myEdge[i].Reverse();
115 if ( theFace.IsNull() )
116 BRep_Tool::Range( *edge, myFirst[i], myLast[i] );
118 myC2d[i] = BRep_Tool::CurveOnSurface( *edge, theFace, myFirst[i], myLast[i] );
119 if ( myEdge[i].Orientation() == TopAbs_REVERSED )
120 std::swap( myFirst[i], myLast[i] );
122 if ( SMESHDS_SubMesh* sm = meshDS->MeshElements( *edge )) {
123 int nbN = sm->NbNodes();
124 if ( theIgnoreMediumNodes ) {
125 SMDS_ElemIteratorPtr elemIt = sm->GetElements();
126 if ( elemIt->more() && elemIt->next()->IsQuadratic() )
127 nbN -= sm->NbElements();
130 myNbSegments += sm->NbElements();
132 if ( SMESH_Algo::VertexNode( TopExp::FirstVertex( *edge, 1), meshDS ))
133 myNbPonits += 1; // for the first end
135 myMissingVertexNodes = true;
137 if ( SMESH_Algo::VertexNode( TopExp::LastVertex( theEdges.back(), 1), meshDS ))
138 myNbPonits++; // for the last end
140 myMissingVertexNodes = true;
142 if ( nbEdges > 1 && myLength > DBL_MIN ) {
143 const double degenNormLen = 1.e-5;
144 double totLength = myLength;
146 totLength += myLength * degenNormLen * nbDegen;
147 double prevNormPar = 0;
148 for ( int i = 0; i < nbEdges; ++i ) {
149 if ( len[ i ] < DBL_MIN )
150 len[ i ] = myLength * degenNormLen;
151 myNormPar[ i ] = prevNormPar + len[i]/totLength;
152 prevNormPar = myNormPar[ i ];
155 myNormPar[nbEdges-1] = 1.;
159 //================================================================================
161 * \brief Return info on nodes on the side
162 * \retval UVPtStruct* - array of data structures
164 //================================================================================
166 const vector<UVPtStruct>& StdMeshers_FaceSide::GetUVPtStruct(bool isXConst,
167 double constValue) const
169 if ( myPoints.empty() ) {
171 if ( NbEdges() == 0 ) return myPoints;
173 SMESHDS_Mesh* meshDS = myMesh->GetMeshDS();
175 // sort nodes of all edges putting them into a map
177 map< double, const SMDS_MeshNode*> u2node;
179 for ( int i = 0; i < myEdge.size(); ++i )
181 // put 1st vertex node
182 TopoDS_Vertex VFirst, VLast;
183 TopExp::Vertices( myEdge[i], VFirst, VLast, true);
184 const SMDS_MeshNode* node = SMESH_Algo::VertexNode( VFirst, meshDS );
185 double prevNormPar = ( i == 0 ? 0 : myNormPar[ i-1 ]); // normalized param
186 if ( node ) { // internal nodes may be missing
187 u2node.insert( make_pair( prevNormPar, node ));
188 } else if ( i == 0 ) {
189 MESSAGE(" NO NODE on VERTEX" );
193 // put 2nd vertex node for a last edge
194 if ( i+1 == myEdge.size() ) {
195 node = SMESH_Algo::VertexNode( VLast, meshDS );
197 MESSAGE(" NO NODE on VERTEX" );
200 u2node.insert( make_pair( 1., node ));
203 // put internal nodes
204 SMESHDS_SubMesh* sm = meshDS->MeshElements( myEdge[i] );
206 SMDS_NodeIteratorPtr nItr = sm->GetNodes();
207 double paramSize = myLast[i] - myFirst[i], r = myNormPar[i] - prevNormPar;
208 while ( nItr->more() ) {
209 const SMDS_MeshNode* node = nItr->next();
210 if ( myIgnoreMediumNodes && SMESH_MeshEditor::IsMedium( node, SMDSAbs_Edge ))
212 const SMDS_EdgePosition* epos =
213 static_cast<const SMDS_EdgePosition*>(node->GetPosition().get());
214 double u = epos->GetUParameter();
215 // paramSize is signed so orientation is taken into account
216 double normPar = prevNormPar + r * ( u - myFirst[i] ) / paramSize;
218 if ( normPar > 1 || normPar < 0) {
220 cout << "WRONG normPar: "<<normPar<< " prevNormPar="<<prevNormPar
221 << " u="<<u << " myFirst[i]="<<myFirst[i]<< " myLast[i]="<<myLast[i]
222 << " paramSize="<<paramSize<<endl;
225 u2node.insert( make_pair( normPar, node ));
228 if ( u2node.size() != myNbPonits ) {
229 MESSAGE("Wrong node parameters on edges, u2node.size():"
230 <<u2node.size()<<" != myNbPonits:"<<myNbPonits);
234 // fill array of UVPtStruct
236 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myPoints );
237 points->resize( myNbPonits );
240 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
241 map< double, const SMDS_MeshNode*>::iterator u_node = u2node.begin();
242 for (int i = 0 ; u_node != u2node.end(); ++u_node, ++i ) {
243 UVPtStruct & uvPt = (*points)[i];
244 uvPt.node = u_node->second;
245 uvPt.x = uvPt.y = uvPt.normParam = u_node->first;
246 if ( isXConst ) uvPt.x = constValue;
247 else uvPt.y = constValue;
248 if ( myNormPar[ EdgeIndex ] < uvPt.normParam ) {
249 prevNormPar = myNormPar[ EdgeIndex ];
252 if ( EdgeIndex >= myEdge.size() ) {
254 cout << "WRONg EdgeIndex " << 1+EdgeIndex
255 << " myNormPar.size()="<<myNormPar.size()
256 << " myNormPar["<< EdgeIndex<<"]="<< myNormPar[ EdgeIndex ]
257 << " uvPt.normParam="<<uvPt.normParam <<endl;
260 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
262 const SMDS_EdgePosition* epos =
263 dynamic_cast<const SMDS_EdgePosition*>(uvPt.node->GetPosition().get());
265 uvPt.param = epos->GetUParameter();
268 double r = ( uvPt.normParam - prevNormPar )/ paramSize;
269 // uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
270 uvPt.param = ( r > 0.5 ? myLast[EdgeIndex] : myFirst[EdgeIndex] );
272 if ( !myC2d[ EdgeIndex ].IsNull() ) {
273 gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
278 uvPt.u = uvPt.v = 1e+100;
285 //================================================================================
287 * \brief Falsificate info on nodes
288 * \param nbSeg - nb of segments on the side
289 * \retval UVPtStruct* - array of data structures
291 //================================================================================
293 const vector<UVPtStruct>& StdMeshers_FaceSide::SimulateUVPtStruct(int nbSeg,
295 double constValue) const
297 if ( myFalsePoints.empty() ) {
299 if ( NbEdges() == 0 ) return myFalsePoints;
301 vector<uvPtStruct>* points = const_cast<vector<uvPtStruct>*>( &myFalsePoints );
302 points->resize( nbSeg+1 );
305 double prevNormPar = 0, paramSize = myNormPar[ EdgeIndex ];
306 for (int i = 0 ; i < myFalsePoints.size(); ++i ) {
307 double normPar = double(i) / double(nbSeg);
308 UVPtStruct & uvPt = (*points)[i];
310 uvPt.x = uvPt.y = uvPt.param = uvPt.normParam = normPar;
311 if ( isXConst ) uvPt.x = constValue;
312 else uvPt.y = constValue;
313 if ( myNormPar[ EdgeIndex ] < normPar ) {
314 prevNormPar = myNormPar[ EdgeIndex ];
316 paramSize = myNormPar[ EdgeIndex ] - prevNormPar;
318 double r = ( normPar - prevNormPar )/ paramSize;
319 uvPt.param = myFirst[EdgeIndex] * ( 1 - r ) + myLast[EdgeIndex] * r;
320 if ( !myC2d[ EdgeIndex ].IsNull() ) {
321 gp_Pnt2d p = myC2d[ EdgeIndex ]->Value( uvPt.param );
326 uvPt.u = uvPt.v = 1e+100;
330 return myFalsePoints;
332 // gp_Pnt StdMeshers_FaceSide::Value(double U) const
336 //================================================================================
338 * \brief reverse order of vector elements
339 * \param vec - vector to reverse
341 //================================================================================
343 template <typename T > void reverse(vector<T> & vec)
345 for ( int f=0, r=vec.size()-1; f < r; ++f, --r )
346 std::swap( vec[f], vec[r] );
349 //================================================================================
351 * \brief Change orientation of side geometry
353 //================================================================================
355 void StdMeshers_FaceSide::Reverse()
357 int nbEdges = myEdge.size();
358 for ( int i = nbEdges-1; i >= 0; --i ) {
359 std::swap( myFirst[i], myLast[i] );
361 if ( i > 0 ) // at the first loop 1. is overwritten
362 myNormPar[i] = 1 - myNormPar[i-1];
369 reverse( myNormPar );
371 myNormPar[nbEdges-1]=1.;
373 myFalsePoints.clear();
376 //================================================================================
378 * \brief Show side features
380 //================================================================================
382 void StdMeshers_FaceSide::dump(const char* msg) const
386 if (msg) cout << msg <<endl;
387 cout<<"NB EDGES: "<< myEdge.size() <<endl;
388 cout << "nbPoints: "<<myNbPonits<<" vecSize: " << myPoints.size()<<" "<<myFalsePoints.size() <<endl;
389 for ( int i=0; i<myEdge.size(); ++i)
391 cout << "\t"<<i+1<<endl;
393 if (myEdge[i].IsNull())
396 TopAbs::Print(myEdge[i].Orientation(),cout)<<" "<<myEdge[i].TShape().operator->()<<endl;
397 cout << "\tV1: " << TopExp::FirstVertex( myEdge[i], 1).TShape().operator->()
398 << " V2: " << TopExp::LastVertex( myEdge[i], 1).TShape().operator->() << endl;
401 if (myC2d[i].IsNull()) cout<<"NULL"<<endl;
402 else cout << myC2d[i].operator->()<<endl;
403 cout << "\tF: "<<myFirst[i]<< " L: "<< myLast[i]<<endl;
404 cout << "\tnormPar: "<<myNormPar[i]<<endl;
409 //================================================================================
411 * \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
412 * \retval Adaptor2d_Curve2d* -
414 //================================================================================
416 struct Adaptor2dCurve2d : public Adaptor2d_Curve2d
418 const StdMeshers_FaceSide* mySide;
419 Adaptor2dCurve2d(const StdMeshers_FaceSide* faceSide):mySide(faceSide) {}
420 gp_Pnt2d Value(const Standard_Real U) const { return mySide->Value2d( U ); }
421 Standard_Real FirstParameter() const { return 0; }
422 Standard_Real LastParameter() const { return 1; }
425 Adaptor2d_Curve2d* StdMeshers_FaceSide::GetCurve2d() const
427 return new Adaptor2dCurve2d( this );
430 //================================================================================
432 * \brief Creates a fully functional Adaptor_Curve
434 //================================================================================
436 BRepAdaptor_CompCurve* StdMeshers_FaceSide::GetCurve3d() const
438 if ( myEdge.empty() )
441 // if ( myEdge.size() == 1 )
442 // return new BRepAdaptor_Curve( myEdge[0] );
445 BRep_Builder aBuilder;
446 aBuilder.MakeWire(aWire);
447 for ( int i=0; i<myEdge.size(); ++i )
448 aBuilder.Add( aWire, myEdge[i] );
449 return new BRepAdaptor_CompCurve( aWire );
452 //================================================================================
454 * \brief Return 2D point by normalized parameter
455 * \param U - normalized parameter value
456 * \retval gp_Pnt2d - point
458 //================================================================================
460 gp_Pnt2d StdMeshers_FaceSide::Value2d(double U) const
462 if ( !myC2d[0].IsNull() ) {
463 int i = EdgeIndex( U );
464 double prevU = i ? myNormPar[ i-1 ] : 0;
465 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
466 return myC2d[ i ]->Value( myFirst[i] * ( 1 - r ) + myLast[i] * r );
468 return gp_Pnt2d( 1e+100, 1e+100 );
471 //================================================================================
473 * \brief Return wires of a face as StdMeshers_FaceSide's
475 //================================================================================
477 TSideVector StdMeshers_FaceSide::GetFaceWires(const TopoDS_Face& theFace,
478 SMESH_Mesh & theMesh,
479 const bool theIgnoreMediumNodes,
483 list< TopoDS_Edge > edges;
484 list< int > nbEdgesInWires;
485 int nbWires = SMESH_Block::GetOrderedEdges (theFace, V1, edges, nbEdgesInWires);
487 // split list of all edges into separate wires
488 TSideVector wires( nbWires );
489 list< int >::iterator nbE = nbEdgesInWires.begin();
490 list< TopoDS_Edge >::iterator from, to;
491 from = to = edges.begin();
492 for ( int iW = 0; iW < nbWires; ++iW )
494 std::advance( to, *nbE++ );
495 list< TopoDS_Edge > wireEdges( from, to );
496 // assure that there is a node on the first vertex
497 // as StdMeshers_FaceSide::GetUVPtStruct() requires
498 while ( !SMESH_Algo::VertexNode( TopExp::FirstVertex( wireEdges.front(), true),
499 theMesh.GetMeshDS()))
501 wireEdges.splice(wireEdges.end(), wireEdges,
502 wireEdges.begin(), ++wireEdges.begin());
503 if ( from->IsSame( wireEdges.front() )) {
505 ( new SMESH_ComputeError(COMPERR_BAD_INPUT_MESH,"No nodes on vertices"));
506 return TSideVector(0);
509 // find out side orientation, which is important if there are several wires (PAL19080)
510 bool isForward = true;
512 TopExp_Explorer e( theFace, TopAbs_EDGE );
513 while ( ! e.Current().IsSame( wireEdges.back() ))
515 isForward = ( e.Current().Orientation() == wireEdges.back().Orientation() );
518 StdMeshers_FaceSide* wire = new StdMeshers_FaceSide( theFace, wireEdges, &theMesh,
519 isForward, theIgnoreMediumNodes);
520 wires[ iW ] = StdMeshers_FaceSidePtr( wire );