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 #ifndef StdMeshers_FaceSide_HeaderFile
29 #define StdMeshers_FaceSide_HeaderFile
31 #include "SMESH_StdMeshers.hxx"
33 #include "SMESH_ProxyMesh.hxx"
35 #include <Geom2d_Curve.hxx>
36 #include <GeomAdaptor_Curve.hxx>
37 #include <TopoDS_Edge.hxx>
38 #include <TopoDS_Vertex.hxx>
39 #include <gp_Pnt2d.hxx>
43 #include <boost/shared_ptr.hpp>
47 class Adaptor2d_Curve2d;
48 class Adaptor3d_Curve;
49 class BRepAdaptor_CompCurve;
51 struct SMESH_ComputeError;
52 class StdMeshers_FaceSide;
54 typedef boost::shared_ptr< SMESH_ComputeError > TError;
55 typedef boost::shared_ptr< StdMeshers_FaceSide > StdMeshers_FaceSidePtr;
56 typedef std::vector< StdMeshers_FaceSidePtr > TSideVector;
58 //================================================================================
60 * \brief Represents a side of a quasi quadrilateral face.
61 * It can be composed of several edges. Gives access to geometry and 1D mesh of a side.
63 //================================================================================
65 class STDMESHERS_EXPORT StdMeshers_FaceSide
69 * \brief Wrap one edge
71 StdMeshers_FaceSide(const TopoDS_Face& theFace,
72 const TopoDS_Edge& theEdge,
74 const bool theIsForward,
75 const bool theIgnoreMediumNodes,
76 SMESH_ProxyMesh::Ptr theProxyMesh = SMESH_ProxyMesh::Ptr());
78 * \brief Wrap several edges. Edges must be properly ordered and oriented.
80 StdMeshers_FaceSide(const TopoDS_Face& theFace,
81 std::list<TopoDS_Edge>& theEdges,
83 const bool theIsForward,
84 const bool theIgnoreMediumNodes,
85 SMESH_ProxyMesh::Ptr theProxyMesh = SMESH_ProxyMesh::Ptr());
87 * \brief Simulate a side from a vertex using data from other FaceSide
89 StdMeshers_FaceSide(const StdMeshers_FaceSide* theSide,
90 const SMDS_MeshNode* theNode,
91 const gp_Pnt2d* thePnt2d1,
92 const gp_Pnt2d* thePnt2d2=NULL,
93 const Handle(Geom2d_Curve)& theC2d=NULL,
94 const double theUFirst=0.,
95 const double theULast=1.);
97 * \brief Create a side from an UVPtStructVec
99 StdMeshers_FaceSide(UVPtStructVec& theSideNodes);
102 * \brief Return wires of a face as StdMeshers_FaceSide's
104 static TSideVector GetFaceWires(const TopoDS_Face& theFace,
105 SMESH_Mesh & theMesh,
106 const bool theIgnoreMediumNodes,
108 SMESH_ProxyMesh::Ptr theProxyMesh = SMESH_ProxyMesh::Ptr());
110 * \brief Change orientation of side geometry
114 * \brief Make ignore medium nodes
116 void SetIgnoreMediumNodes(bool toIgnore);
119 * \brief Return nb nodes on edges and vertices (+1 to be == GetUVPtStruct().size() ).
120 * Call it with update == true if mesh of this side can be recomputed
121 * since creation of this side
123 int NbPoints(const bool update = false) const;
125 * \brief Return nb edges
126 * Call it with update == true if mesh of this side can be recomputed
127 * since creation of this side
129 int NbSegments(const bool update = false) const;
133 SMESH_Mesh* GetMesh() const { return myProxyMesh->GetMesh(); }
135 * \brief Return true if there are vertices without nodes
137 bool MissVertexNode() const { return myMissingVertexNodes; }
140 * \brief Return detailed data on nodes
141 * \param isXConst - true if normalized parameter X is constant
142 * \param constValue - constant parameter value
144 * Missing nodes are allowed only on internal vertices.
145 * For a closed side, the 1st point repeats at end
147 const UVPtStructVec& GetUVPtStruct(bool isXConst =0, double constValue =0) const;
149 * \brief Simulates detailed data on nodes
150 * \param isXConst - true if normalized parameter X is constant
151 * \param constValue - constant parameter value
153 const UVPtStructVec& SimulateUVPtStruct(int nbSeg,
155 double constValue = 0) const;
157 * \brief Return nodes in the order they encounter while walking along the side.
158 * For a closed side, the 1st point repeats at end
160 std::vector<const SMDS_MeshNode*> GetOrderedNodes() const;
163 * \brief Return edge and parameter on edge by normalized parameter
165 inline double Parameter(double U, TopoDS_Edge & edge) const;
167 * \brief Return UV by normalized parameter
169 gp_Pnt2d Value2d(double U) const;
171 * \brief Return XYZ by normalized parameter
173 gp_Pnt Value3d(double U) const;
175 * \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
177 Adaptor2d_Curve2d* GetCurve2d() const;
179 * \brief Creates a fully functional Adaptor_Curve
181 BRepAdaptor_CompCurve* GetCurve3d() const;
183 * \brief Return nb of wrapped edges
185 int NbEdges() const { return myEdge.size(); }
187 * \brief Return i-th wrapped edge (count starts from zero)
189 const TopoDS_Edge& Edge(int i) const { return myEdge[i]; }
191 * \brief Return all edges
193 const std::vector<TopoDS_Edge>& Edges() const { return myEdge; }
195 * \brief Return 1st vertex of the i-the edge (count starts from zero)
197 TopoDS_Vertex FirstVertex(int i=0) const;
199 * \brief Return last vertex of the i-the edge (count starts from zero)
201 TopoDS_Vertex LastVertex(int i=-1) const;
203 * \brief Return side length
205 double Length() const { return myLength; }
207 * \brief Return edge index corresponding to normalized parameter
209 inline int EdgeIndex( double U ) const;
211 //virtual gp_Pnt Value(double U) const;
213 void dump(const char* msg=0) const;
216 * \brief Return ID of i-th wrapped edge (count starts from zero)
218 inline int EdgeID(int i) const;
220 * \brief Return p-curve of i-th wrapped edge (count starts from zero)
222 inline Handle(Geom2d_Curve) Curve2d(int i) const;
224 * \brief Return first normalized parameter of the i-the edge (count starts from zero)
226 inline double FirstParameter(int i) const;
228 * \brief Return last normalized parameter of the i-the edge (count starts from zero)
230 inline double LastParameter(int i) const;
232 * \brief Return first parameter of the i-the edge (count starts from zero).
233 * EDGE orientation is taken into account
235 inline double FirstU(int i) const;
237 * \brief Return last parameter of the i-the edge (count starts from zero).
238 * EDGE orientation is taken into account
240 inline double LastU(int i) const;
242 * \brief Return length of i-th wrapped edge (count starts from zero)
244 inline double EdgeLength(int i) const;
246 * \brief Return orientation of i-th wrapped edge (count starts from zero)
248 inline bool IsReversed(int i) const;
252 void reverseProxySubmesh( const TopoDS_Edge& E );
254 // DON't FORGET to update Reverse() when adding one more vector!
255 std::vector<uvPtStruct> myPoints, myFalsePoints;
256 std::vector<TopoDS_Edge> myEdge;
257 std::vector<int> myEdgeID;
258 std::vector<Handle(Geom2d_Curve)> myC2d;
259 std::vector<GeomAdaptor_Curve> myC3dAdaptor;
260 std::vector<double> myFirst, myLast;
261 std::vector<double> myNormPar;
262 std::vector<double> myEdgeLength;
263 std::vector<int> myIsUniform;
265 int myNbPonits, myNbSegments;
266 SMESH_ProxyMesh::Ptr myProxyMesh;
267 bool myMissingVertexNodes, myIgnoreMediumNodes;
268 gp_Pnt2d myDefaultPnt2d;
272 //================================================================================
274 * \brief Return edge index corresponding to normalized parameter
275 * \param U - the parameter
276 * \retval int - index
278 //================================================================================
280 inline int StdMeshers_FaceSide::EdgeIndex( double U ) const
282 int i = myNormPar.size() - 1;
283 while ( i > 0 && U < myNormPar[ i-1 ] ) --i;
287 //================================================================================
289 * \brief Return edge and parameter on edge by normalized parameter
290 * \param U - the parameter
291 * \retval double - pameter on a curve
293 //================================================================================
295 inline double StdMeshers_FaceSide::Parameter(double U, TopoDS_Edge & edge) const
297 int i = EdgeIndex( U );
299 double prevU = i ? myNormPar[ i-1 ] : 0;
300 double r = ( U - prevU )/ ( myNormPar[ i ] - prevU );
301 return myFirst[i] * ( 1 - r ) + myLast[i] * r;
304 //================================================================================
306 * \brief Return first normalized parameter of the i-the edge
308 //================================================================================
310 inline double StdMeshers_FaceSide::FirstParameter(int i) const
312 return i==0 ? 0. : i<(int)myNormPar.size() ? myNormPar[i-1] : 1.;
315 //================================================================================
317 * \brief Return ast normalized parameter of the i-the edge
319 //================================================================================
321 inline double StdMeshers_FaceSide::LastParameter(int i) const
323 return i < (int)myNormPar.size() ? myNormPar[i] : 1;
326 //================================================================================
328 * \brief Return first parameter of the i-the edge
330 //================================================================================
332 inline double StdMeshers_FaceSide::FirstU(int i) const
334 return myFirst[ i % myFirst.size() ];
337 //================================================================================
339 * \brief Return last parameter of the i-the edge
341 //================================================================================
343 inline double StdMeshers_FaceSide::LastU(int i) const
345 return myLast[ i % myLast.size() ];
348 //================================================================================
350 * \brief Return ID of i-th wrapped edge (count starts from zero)
352 //================================================================================
354 inline int StdMeshers_FaceSide::EdgeID(int i) const
356 return myEdgeID[ i % myEdgeID.size() ];
359 //================================================================================
361 * \brief Return p-curve of i-th wrapped edge (count starts from zero)
363 //================================================================================
365 inline Handle(Geom2d_Curve) StdMeshers_FaceSide::Curve2d(int i) const
367 return myC2d[ i % myC2d.size() ];
370 //================================================================================
372 * \brief Return length of i-th wrapped edge (count starts from zero)
374 //================================================================================
376 inline double StdMeshers_FaceSide::EdgeLength(int i) const
378 return myEdgeLength[ i % myEdgeLength.size() ];
381 //================================================================================
383 * \brief Return orientation of i-th wrapped edge (count starts from zero)
385 //================================================================================
387 inline bool StdMeshers_FaceSide::IsReversed(int i) const
389 return myFirst[i] > myLast[i];