-// Copyright (C) 2007-2010 CEA/DEN, EDF R&D, OPEN CASCADE
+// Copyright (C) 2007-2012 CEA/DEN, EDF R&D, OPEN CASCADE
//
-// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
-// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
+// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
+// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
//
-// This library is free software; you can redistribute it and/or
-// modify it under the terms of the GNU Lesser General Public
-// License as published by the Free Software Foundation; either
-// version 2.1 of the License.
+// This library is free software; you can redistribute it and/or
+// modify it under the terms of the GNU Lesser General Public
+// License as published by the Free Software Foundation; either
+// version 2.1 of the License.
//
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-// Lesser General Public License for more details.
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+// Lesser General Public License for more details.
//
-// You should have received a copy of the GNU Lesser General Public
-// License along with this library; if not, write to the Free Software
-// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+// You should have received a copy of the GNU Lesser General Public
+// License along with this library; if not, write to the Free Software
+// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
-// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
+// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
-// SMESH SMESH : implementaion of SMESH idl descriptions
// File : StdMeshers_FaceSide.hxx
// Created : Wed Jan 31 18:41:25 2007
// Author : Edward AGAPOV (eap)
#ifndef StdMeshers_FaceSide_HeaderFile
#define StdMeshers_FaceSide_HeaderFile
+#include "SMESH_StdMeshers.hxx"
+
+#include "SMESH_ProxyMesh.hxx"
+
#include <Geom2d_Curve.hxx>
#include <GeomAdaptor_Curve.hxx>
#include <TopoDS_Edge.hxx>
#include <TopoDS_Vertex.hxx>
#include <gp_Pnt2d.hxx>
-#include "SMESH_StdMeshers.hxx"
-
#include <vector>
#include <list>
#include <boost/shared_ptr.hpp>
class BRepAdaptor_CompCurve;
class TopoDS_Face;
struct SMESH_ComputeError;
-
-typedef struct uvPtStruct
-{
- double param;
- //int curvIndex;
- double normParam;
- double u; // original 2d parameter
- double v;
- double x; // 2d parameter, normalized [0,1]
- double y;
- const SMDS_MeshNode * node;
-} UVPtStruct;
-
class StdMeshers_FaceSide;
+
+typedef boost::shared_ptr< SMESH_ComputeError > TError;
typedef boost::shared_ptr< StdMeshers_FaceSide > StdMeshers_FaceSidePtr;
-typedef boost::shared_ptr< uvPtStruct > UVPtStructPtr;
-typedef std::vector< StdMeshers_FaceSidePtr > TSideVector;
-typedef boost::shared_ptr< SMESH_ComputeError > TError;
+typedef std::vector< StdMeshers_FaceSidePtr > TSideVector;
//================================================================================
/*!
/*!
* \brief Wrap one edge
*/
- StdMeshers_FaceSide(const TopoDS_Face& theFace,
- const TopoDS_Edge& theEdge,
- SMESH_Mesh* theMesh,
- const bool theIsForward,
- const bool theIgnoreMediumNodes);
+ StdMeshers_FaceSide(const TopoDS_Face& theFace,
+ const TopoDS_Edge& theEdge,
+ SMESH_Mesh* theMesh,
+ const bool theIsForward,
+ const bool theIgnoreMediumNodes,
+ SMESH_ProxyMesh::Ptr theProxyMesh = SMESH_ProxyMesh::Ptr());
/*!
* \brief Wrap several edges. Edges must be properly ordered and oriented.
*/
- StdMeshers_FaceSide(const TopoDS_Face& theFace,
+ StdMeshers_FaceSide(const TopoDS_Face& theFace,
std::list<TopoDS_Edge>& theEdges,
- SMESH_Mesh* theMesh,
- const bool theIsForward,
- const bool theIgnoreMediumNodes);
+ SMESH_Mesh* theMesh,
+ const bool theIsForward,
+ const bool theIgnoreMediumNodes,
+ SMESH_ProxyMesh::Ptr theProxyMesh = SMESH_ProxyMesh::Ptr());
/*!
- * \brief Wrap for vertex using data from other FaceSide
+ * \brief Simulate a side from a vertex using data from other FaceSide
*/
- StdMeshers_FaceSide(const SMDS_MeshNode* theNode,
- const gp_Pnt2d thePnt2d,
+ StdMeshers_FaceSide(const SMDS_MeshNode* theNode,
+ const gp_Pnt2d thePnt2d,
const StdMeshers_FaceSide* theSide);
/*!
* \brief Return wires of a face as StdMeshers_FaceSide's
*/
- static TSideVector GetFaceWires(const TopoDS_Face& theFace,
- SMESH_Mesh & theMesh,
- const bool theIgnoreMediumNodes,
- TError & theError);
-
+ static TSideVector GetFaceWires(const TopoDS_Face& theFace,
+ SMESH_Mesh & theMesh,
+ const bool theIgnoreMediumNodes,
+ TError & theError,
+ SMESH_ProxyMesh::Ptr theProxyMesh = SMESH_ProxyMesh::Ptr());
/*!
* \brief Change orientation of side geometry
*/
void Reverse();
/*!
- * \brief Return nb nodes on edges and vertices (+1 to be == GetUVPtStruct().size() )
+ * \brief Make ignore medium nodes
+ */
+ void SetIgnoreMediumNodes(bool toIgnore);
+
+ /*!
+ * \brief Return nb nodes on edges and vertices (+1 to be == GetUVPtStruct().size() ).
+ * Call it with update == true if mesh of this side can be recomputed
+ * since creation of this side
*/
- int NbPoints() const { return myNbPonits; }
+ int NbPoints(const bool update = false) const;
/*!
* \brief Return nb edges
+ * Call it with update == true if mesh of this side can be recomputed
+ * since creation of this side
*/
- int NbSegments() const { return myNbSegments; }
+ int NbSegments(const bool update = false) const;
/*!
* \brief Return mesh
*/
- SMESH_Mesh* GetMesh() const { return myMesh; }
+ SMESH_Mesh* GetMesh() const { return myProxyMesh->GetMesh(); }
/*!
* \brief Return true if there are vertices without nodes
*/
bool MissVertexNode() const { return myMissingVertexNodes; }
+
/*!
* \brief Return detailed data on nodes
* \param isXConst - true if normalized parameter X is constant
* \param constValue - constant parameter value
*
- * Missing nodes are allowed only on internal vertices
+ * Missing nodes are allowed only on internal vertices.
+ * For a closed side, the 1st point repeats at end
*/
- const std::vector<UVPtStruct>& GetUVPtStruct(bool isXConst =0, double constValue =0) const;
+ const UVPtStructVec& GetUVPtStruct(bool isXConst =0, double constValue =0) const;
/*!
* \brief Simulates detailed data on nodes
* \param isXConst - true if normalized parameter X is constant
* \param constValue - constant parameter value
*/
- const std::vector<UVPtStruct>& SimulateUVPtStruct(int nbSeg,
- bool isXConst = 0,
- double constValue = 0) const;
+ const UVPtStructVec& SimulateUVPtStruct(int nbSeg,
+ bool isXConst = 0,
+ double constValue = 0) const;
+ /*!
+ * \brief Return nodes in the order they encounter while walking along the side.
+ * For a closed side, the 1st point repeats at end
+ */
+ std::vector<const SMDS_MeshNode*> GetOrderedNodes() const;
+
/*!
* \brief Return edge and parameter on edge by normalized parameter
*/
* \brief Return UV by normalized parameter
*/
gp_Pnt2d Value2d(double U) const;
+ /*!
+ * \brief Return XYZ by normalized parameter
+ */
+ gp_Pnt Value3d(double U) const;
/*!
* \brief Creates a Adaptor2d_Curve2d to be used in SMESH_Block
*/
* \brief Return i-th wrapped edge (count starts from zero)
*/
const TopoDS_Edge& Edge(int i) const { return myEdge[i]; }
+ /*!
+ * \brief Return all edges
+ */
+ const std::vector<TopoDS_Edge>& Edges() const { return myEdge; }
/*!
* \brief Return 1st vertex of the i-the edge (count starts from zero)
*/
* \brief Return last vertex of the i-the edge (count starts from zero)
*/
TopoDS_Vertex LastVertex(int i=-1) const;
- /*!
- * \brief Return first normalized parameter of the i-the edge (count starts from zero)
- */
- inline double FirstParameter(int i) const;
- /*!
- * \brief Return ast normalized parameter of the i-the edge (count starts from zero)
- */
- inline double LastParameter(int i) const;
/*!
* \brief Return side length
*/
void dump(const char* msg=0) const;
+ /*!
+ * \brief Return ID of i-th wrapped edge (count starts from zero)
+ */
+ inline int EdgeID(int i) const;
+ /*!
+ * \brief Return p-curve of i-th wrapped edge (count starts from zero)
+ */
+ inline Handle(Geom2d_Curve) Curve2d(int i) const;
+ /*!
+ * \brief Return first normalized parameter of the i-the edge (count starts from zero)
+ */
+ inline double FirstParameter(int i) const;
+ /*!
+ * \brief Return last normalized parameter of the i-the edge (count starts from zero)
+ */
+ inline double LastParameter(int i) const;
+ /*!
+ * \brief Return first parameter of the i-the edge (count starts from zero).
+ * EDGE orientation is taken into account
+ */
+ inline double FirstU(int i) const;
+ /*!
+ * \brief Return last parameter of the i-the edge (count starts from zero).
+ * EDGE orientation is taken into account
+ */
+ inline double LastU(int i) const;
+ /*!
+ * \brief Return length of i-th wrapped edge (count starts from zero)
+ */
+ inline double EdgeLength(int i) const;
+ /*!
+ * \brief Return orientation of i-th wrapped edge (count starts from zero)
+ */
+ inline bool IsReversed(int i) const;
protected:
- // DON't FORGET tO update Reverse() when adding one more vector!
+ void reverseProxySubmesh( const TopoDS_Edge& E );
+
+ // DON't FORGET to update Reverse() when adding one more vector!
std::vector<uvPtStruct> myPoints, myFalsePoints;
std::vector<TopoDS_Edge> myEdge;
+ std::vector<int> myEdgeID;
std::vector<Handle(Geom2d_Curve)> myC2d;
std::vector<GeomAdaptor_Curve> myC3dAdaptor;
std::vector<double> myFirst, myLast;
std::vector<double> myIsUniform;
double myLength;
int myNbPonits, myNbSegments;
- SMESH_Mesh* myMesh;
+ SMESH_ProxyMesh::Ptr myProxyMesh;
bool myMissingVertexNodes, myIgnoreMediumNodes;
gp_Pnt2d myDefaultPnt2d;
};
inline double StdMeshers_FaceSide::FirstParameter(int i) const
{
- return i==0 ? 0. : i<myNormPar.size() ? myNormPar[i-1] : 1.;
+ return i==0 ? 0. : i<(int)myNormPar.size() ? myNormPar[i-1] : 1.;
}
//================================================================================
inline double StdMeshers_FaceSide::LastParameter(int i) const
{
- return i<myNormPar.size() ? myNormPar[i] : 1;
+ return i < (int)myNormPar.size() ? myNormPar[i] : 1;
+}
+
+//================================================================================
+/*!
+ * \brief Return first parameter of the i-the edge
+ */
+//================================================================================
+
+inline double StdMeshers_FaceSide::FirstU(int i) const
+{
+ return myFirst[ i % myFirst.size() ];
+}
+
+//================================================================================
+/*!
+ * \brief Return last parameter of the i-the edge
+ */
+//================================================================================
+
+inline double StdMeshers_FaceSide::LastU(int i) const
+{
+ return myLast[ i % myLast.size() ];
+}
+
+//================================================================================
+ /*!
+ * \brief Return ID of i-th wrapped edge (count starts from zero)
+ */
+//================================================================================
+
+inline int StdMeshers_FaceSide::EdgeID(int i) const
+{
+ return myEdgeID[ i % myEdgeID.size() ];
+}
+
+//================================================================================
+/*!
+ * \brief Return p-curve of i-th wrapped edge (count starts from zero)
+ */
+//================================================================================
+
+inline Handle(Geom2d_Curve) StdMeshers_FaceSide::Curve2d(int i) const
+{
+ return myC2d[ i % myC2d.size() ];
+}
+
+//================================================================================
+/*!
+ * \brief Return length of i-th wrapped edge (count starts from zero)
+ */
+ //================================================================================
+
+inline double StdMeshers_FaceSide::EdgeLength(int i) const
+{
+ return myEdgeLength[ i % myEdgeLength.size() ];
+}
+
+//================================================================================
+/*!
+ * \brief Return orientation of i-th wrapped edge (count starts from zero)
+ */
+ //================================================================================
+
+inline bool StdMeshers_FaceSide::IsReversed(int i) const
+{
+ return myFirst[i] > myLast[i];
}
#endif
