class gp_Vec;
class gp_Pnt;
class SMESH_MesherHelper;
-
-
-//=======================================================================
-/*!
- * \brief Searcher for the node closest to point
- */
-//=======================================================================
-struct SMESH_NodeSearcher
-{
- virtual const SMDS_MeshNode* FindClosestTo( const gp_Pnt& pnt ) = 0;
- virtual void MoveNode( const SMDS_MeshNode* node, const gp_Pnt& toPnt ) = 0;
-};
-
-//=======================================================================
-/*!
- * \brief Searcher for elements
- */
-//=======================================================================
-
-struct SMESH_ElementSearcher
-{
- /*!
- * \brief Find elements of given type where the given point is IN or ON.
- * Returns nb of found elements and elements them-selves.
- *
- * 'ALL' type means elements of any type excluding nodes and 0D elements
- */
- virtual int FindElementsByPoint(const gp_Pnt& point,
- SMDSAbs_ElementType type,
- std::vector< const SMDS_MeshElement* >& foundElems)=0;
- /*!
- * \brief Return an element most close to the given point
- */
- virtual const SMDS_MeshElement* FindClosestTo( const gp_Pnt& point,
- SMDSAbs_ElementType type) = 0;
- /*!
- * \brief Return elements possibly intersecting the line
- */
- virtual void GetElementsNearLine( const gp_Ax1& line,
- SMDSAbs_ElementType type,
- std::vector< const SMDS_MeshElement* >& foundElems)=0;
- /*!
- * \brief Find out if the given point is out of closed 2D mesh.
- */
- virtual TopAbs_State GetPointState(const gp_Pnt& point) = 0;
-
-};
+class SMESH_NodeSearcher;
// ============================================================
/*!
bool TriToQuad (TIDSortedElemSet & theElems,
SMESH::Controls::NumericalFunctorPtr theCriterion,
const double theMaxAngle);
-
/*!
* \brief Split quadrangles into triangles.
* \param theElems - The faces to be splitted.
*/
bool QuadToTri (TIDSortedElemSet & theElems,
SMESH::Controls::NumericalFunctorPtr theCriterion);
-
/*!
* \brief Split quadrangles into triangles.
* \param theElems - The faces to be splitted.
*/
bool QuadToTri (TIDSortedElemSet & theElems,
const bool the13Diag);
+ /*!
+ * \brief Split each of given quadrangles into 4 triangles.
+ * \param theElems - The faces to be splitted. If empty all faces are split.
+ */
+ void QuadTo4Tri (TIDSortedElemSet & theElems);
/*!
* \brief Find better diagonal for splitting.
SMESH_Mesh* theTargetMesh=0);
// Move or copy theElements applying theTrsf to their nodes
- /*!
- * \brief Return SMESH_NodeSearcher. The caller is responsible for deleteing it
- */
- SMESH_NodeSearcher* GetNodeSearcher();
-
- /*!
- * \brief Return SMESH_ElementSearcher. The caller is responsible for deleting it
- */
- SMESH_ElementSearcher* GetElementSearcher();
- SMESH_ElementSearcher* GetElementSearcher( SMDS_ElemIteratorPtr elemIt );
-
typedef std::list< std::list< const SMDS_MeshNode* > > TListOfListOfNodes;
void FindCoincidentNodes (TIDSortedNodeSet & theNodes,
// Remove all but one of elements built on the same nodes.
// Return nb of successfully merged groups.
- /*!
- * \brief Return true if the point is IN or ON of the element
- */
- static bool IsOut( const SMDS_MeshElement* element, const gp_Pnt& point, double tol );
-
- static double GetDistance( const SMDS_MeshFace* face, const gp_Pnt& point );
-
- int SimplifyFace (const std::vector<const SMDS_MeshNode *> faceNodes,
- std::vector<const SMDS_MeshNode *>& poly_nodes,
- std::vector<int>& quantities) const;
+ int SimplifyFace (const std::vector<const SMDS_MeshNode *>& faceNodes,
+ std::vector<const SMDS_MeshNode *>& poly_nodes,
+ std::vector<int>& quantities) const;
// Split face, defined by <faceNodes>, into several faces by repeating nodes.
// Is used by MergeNodes()
TIDSortedElemSet & linkedNodes,
SMDSAbs_ElementType type = SMDSAbs_All );
- static const SMDS_MeshElement* FindFaceInSet(const SMDS_MeshNode* n1,
- const SMDS_MeshNode* n2,
- const TIDSortedElemSet& elemSet,
- const TIDSortedElemSet& avoidSet,
- int* i1=0,
- int* i2=0);
- // Return a face having linked nodes n1 and n2 and which is
- // - not in avoidSet,
- // - in elemSet provided that !elemSet.empty()
- // i1 and i2 optionally returns indices of n1 and n2
-
/*!
* \brief Find corresponding nodes in two sets of faces
* \param theSide1 - first face set
// Return an index of the shape theElem is on
// or zero if a shape not found
+ void DoubleElements( const TIDSortedElemSet& theElements );
+
bool DoubleNodes( const std::list< int >& theListOfNodes,
const std::list< int >& theListOfModifiedElems );
typedef std::map<const SMDS_MeshNode*, std::list<const SMDS_MeshNode*> > TNodeOfNodeListMap;
typedef TNodeOfNodeListMap::iterator TNodeOfNodeListMapItr;
typedef std::vector<TNodeOfNodeListMapItr> TVecOfNnlmiMap;
- typedef std::map<const SMDS_MeshElement*, TVecOfNnlmiMap > TElemOfVecOfNnlmiMap;
+ typedef std::map<const SMDS_MeshElement*, TVecOfNnlmiMap, TIDCompare > TElemOfVecOfNnlmiMap;
/*!
* \brief Create elements by sweeping an element