-// Copyright (C) 2007-2012 CEA/DEN, EDF R&D, OPEN CASCADE
+// Copyright (C) 2007-2014 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
// 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.
+// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
* The key of the map is a normalized parameter of each
* base node on theBaseSide. Edges in theBaseSide must be sequenced.
* This method works in supposition that nodes on the face
- * forms a rectangular grid and elements can be quardrangles or triangles
+ * forms a structured grid and elements can be quardrangles or triangles
*/
static bool LoadNodeColumns(TParam2ColumnMap & theParam2ColumnMap,
const TopoDS_Face& theFace,
* \param nbNodes - total nb of nodes
* \retval int - valid node index
*/
- static int WrapIndex(const int ind, const int nbNodes) {
- if ( ind < 0 ) return nbNodes + ind % nbNodes;
- if ( ind >= nbNodes ) return ind % nbNodes;
- return ind;
+ static inline int WrapIndex(int ind, const int nbNodes) {
+ return (( ind %= nbNodes ) < 0 ) ? ind + nbNodes : ind;
}
/*!
* \param p0,p1,p2,p3 - UV of the point projections on EDGEs of the FACE
* \return gp_XY - UV of the point on the FACE
*
- * Order of those UV in the FACE is as follows.
- * a4 p3 a3
+ * Y ^ Order of those UV in the FACE is as follows.
+ * |
+ * a3 p2 a2
* o---x-----o
* | : |
* | :UV |
- * p4 x...O.....x p2
+ * p3 x...O.....x p1
* | : |
- * o---x-----o
- * a1 p1 a2
+ * o---x-----o ----> X
+ * a0 p0 a1
*/
inline static gp_XY calcTFI(double x, double y,
const gp_XY a0,const gp_XY a1,const gp_XY a2,const gp_XY a3,
static double MaxTolerance( const TopoDS_Shape& shape );
+ static double GetAngle( const TopoDS_Edge & E1, const TopoDS_Edge & E2, const TopoDS_Face & F);
+
static bool IsClosedEdge( const TopoDS_Edge& anEdge );
static TopoDS_Vertex IthVertex( const bool is2nd, TopoDS_Edge anEdge, const bool CumOri=true );
const TopoDS_Shape& GetSubShape() const { return myShape; }
/*!
- * Creates a node
+ * Creates a node (!Note ID before u=0.,v0.)
*/
SMDS_MeshNode* AddNode(double x, double y, double z, int ID = 0, double u=0., double v=0.);
/*!
double GetNodeU(const TopoDS_Edge& theEdge,
const SMDS_MeshNode* theNode,
const SMDS_MeshNode* inEdgeNode=0,
- bool* check=0);
+ bool* check=0) const;
/*!
* \brief Return node UV on face
* \param inFaceNode - a node of element being created located inside a face
static gp_XY GetMiddleUV(const Handle(Geom_Surface)& surface,
const gp_XY& uv1,
const gp_XY& uv2);
+ /*!
+ * \brief Return UV for the central node of a biquadratic triangle
+ */
+ static gp_XY GetCenterUV(const gp_XY& uv1,
+ const gp_XY& uv2,
+ const gp_XY& uv3,
+ const gp_XY& uv12,
+ const gp_XY& uv23,
+ const gp_XY& uv31,
+ bool * isBadTria=0);
/*!
* \brief Define a pointer to wrapper over a function of gp_XY class,
* suitable to pass as xyFunPtr to applyIn2D().
const SMDS_MeshNode* n34,
const SMDS_MeshNode* n41,
bool force3d);
+ /*!
+ * \brief Return existing or create a new central node for a
+ * quadratic triangle given its 6 nodes.
+ * \param force3d - true means node creation in between the given nodes,
+ * else node position is found on a geometrical face if any.
+ */
+ const SMDS_MeshNode* GetCentralNode(const SMDS_MeshNode* n1,
+ const SMDS_MeshNode* n2,
+ const SMDS_MeshNode* n3,
+ const SMDS_MeshNode* n12,
+ const SMDS_MeshNode* n23,
+ const SMDS_MeshNode* n31,
+ bool force3d);
/*!
* \brief Return index and type of the shape (EDGE or FACE only) to set a medium node on
*/
TBiQuad(const SMDS_MeshNode* n1,
const SMDS_MeshNode* n2,
const SMDS_MeshNode* n3,
- const SMDS_MeshNode* n4)
+ const SMDS_MeshNode* n4=0)
{
TIDSortedNodeSet s;
s.insert(n1);
s.insert(n2);
s.insert(n3);
- s.insert(n4);
+ if ( n4 ) s.insert(n4);
TIDSortedNodeSet::iterator n = s.begin();
first = (*n++)->GetID();
second.first = (*n++)->GetID();
};
// maps used during creation of quadratic elements
- TLinkNodeMap myTLinkNodeMap; // medium nodes on links
- std::map< TBiQuad, SMDS_MeshNode* > myMapWithCentralNode; // central nodes of faces
+ TLinkNodeMap myTLinkNodeMap; // medium nodes on links
+ std::map< TBiQuad, const SMDS_MeshNode* > myMapWithCentralNode; // central nodes of faces
std::set< int > myDegenShapeIds;
std::set< int > mySeamShapeIds;