-// 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_I : idl implementation based on 'SMESH' unit's classes
// File : SMESH_MeshEditor.hxx
// Created : Mon Apr 12 14:56:19 2004
// Author : Edward AGAPOV (eap)
#include "SMESH_Controls.hxx"
#include "SMESH_Mesh.hxx"
#include "SMESH_TypeDefs.hxx"
+#include "SMESH_ComputeError.hxx"
#include <utilities.h>
//=======================================================================
/*!
- * \brief Find elements of given type where the given point is IN or ON.
- * Returns nb of found elements and elements them-selves.
- * Another task is to find out if the given point is out of closed 2D mesh.
- *
- * 'ALL' type means elements of any type excluding nodes and 0D elements
+ * \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;
-
- virtual TopAbs_State GetPointState(const gp_Pnt& point) = 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;
+
};
// ============================================================
SMESH_MeshEditor( SMESH_Mesh* theMesh );
+ SMESH_Mesh * GetMesh() { return myMesh; }
+ SMESHDS_Mesh * GetMeshDS() { return myMesh->GetMeshDS(); }
+
+ const SMESH_SequenceOfElemPtr& GetLastCreatedNodes() const { return myLastCreatedNodes; }
+ const SMESH_SequenceOfElemPtr& GetLastCreatedElems() const { return myLastCreatedElems; }
+ void CrearLastCreated();
+
+ SMESH_ComputeErrorPtr & GetError() { return myError; }
+
/*!
* \brief Add element
*/
SMDS_MeshElement* AddElement(const std::vector<const SMDS_MeshNode*> & nodes,
const SMDSAbs_ElementType type,
const bool isPoly,
- const int ID = -1);
+ const int ID = -1,
+ const double ballDiameter=0.);
/*!
* \brief Add element
*/
// Remove a node or an element.
// Modify a compute state of sub-meshes which become empty
+ void Create0DElementsOnAllNodes( const TIDSortedElemSet& elements,
+ TIDSortedElemSet& all0DElems);
+ // Create 0D elements on all nodes of the given object except those
+ // nodes on which a 0D element already exists. \a all0DElems returns
+ // all 0D elements found or created on nodes of \a elements
+
bool InverseDiag (const SMDS_MeshElement * theTria1,
const SMDS_MeshElement * theTria2 );
// Replace two neighbour triangles with ones built on the same 4 nodes
bool Reorient (const SMDS_MeshElement * theElement);
// Reverse theElement orientation
+ int Reorient2D (TIDSortedElemSet & theFaces,
+ const gp_Dir& theDirection,
+ const SMDS_MeshElement * theFace);
+ // Reverse theFaces whose orientation to be same as that of theFace
+ // oriented according to theDirection. Return nb of reoriented faces
/*!
* \brief Fuse neighbour triangles into quadrangles.
SMESH_Mesh* theTargetMesh=0);
// Move or copy theElements applying theTrsf to their nodes
-
- typedef std::list< std::list< const SMDS_MeshNode* > > TListOfListOfNodes;
-
- void FindCoincidentNodes (TIDSortedNodeSet & theNodes,
- const double theTolerance,
- TListOfListOfNodes & theGroupsOfNodes);
- // Return list of group of nodes close to each other within theTolerance.
- // Search among theNodes or in the whole mesh if theNodes is empty.
-
/*!
* \brief Return SMESH_NodeSearcher. The caller is responsible for deleteing it
*/
*/
SMESH_ElementSearcher* GetElementSearcher();
SMESH_ElementSearcher* GetElementSearcher( SMDS_ElemIteratorPtr elemIt );
- /*!
- * \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 );
+ typedef std::list< std::list< const SMDS_MeshNode* > > TListOfListOfNodes;
- 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()
+ void FindCoincidentNodes (TIDSortedNodeSet & theNodes,
+ const double theTolerance,
+ TListOfListOfNodes & theGroupsOfNodes);
+ // Return list of group of nodes close to each other within theTolerance.
+ // Search among theNodes or in the whole mesh if theNodes is empty.
void MergeNodes (TListOfListOfNodes & theNodeGroups);
// In each group, the cdr of nodes are substituted by the first one
typedef std::list< std::list< int > > TListOfListOfElementsID;
- void FindEqualElements(std::set<const SMDS_MeshElement*> & theElements,
- TListOfListOfElementsID & theGroupsOfElementsID);
+ void FindEqualElements(TIDSortedElemSet & theElements,
+ TListOfListOfElementsID & theGroupsOfElementsID);
// Return list of group of elements build on the same nodes.
// Search among theElements or in the whole mesh if theElements is empty.
// 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;
+ // Split face, defined by <faceNodes>, into several faces by repeating nodes.
+ // Is used by MergeNodes()
+
static bool CheckFreeBorderNodes(const SMDS_MeshNode* theNode1,
const SMDS_MeshNode* theNode2,
const SMDS_MeshNode* theNode3 = 0);
// Return an index of the shape theElem is on
// or zero if a shape not found
- SMESH_Mesh * GetMesh() { return myMesh; }
-
- SMESHDS_Mesh * GetMeshDS() { return myMesh->GetMeshDS(); }
-
- const SMESH_SequenceOfElemPtr& GetLastCreatedNodes() const { return myLastCreatedNodes; }
-
- const SMESH_SequenceOfElemPtr& GetLastCreatedElems() const { return myLastCreatedElems; }
-
bool DoubleNodes( const std::list< int >& theListOfNodes,
const std::list< int >& theListOfModifiedElems );
const TIDSortedElemSet& theNodesNot,
const TIDSortedElemSet& theAffectedElems );
+ bool AffectedElemGroupsInRegion( const TIDSortedElemSet& theElems,
+ const TIDSortedElemSet& theNodesNot,
+ const TopoDS_Shape& theShape,
+ TIDSortedElemSet& theAffectedElems);
+
bool DoubleNodesInRegion( const TIDSortedElemSet& theElems,
const TIDSortedElemSet& theNodesNot,
const TopoDS_Shape& theShape );
bool DoubleNodesOnGroupBoundaries( const std::vector<TIDSortedElemSet>& theElems,
bool createJointElems);
+ bool CreateFlatElementsOnFacesGroups( const std::vector<TIDSortedElemSet>& theElems );
+
+ void CreateHoleSkin(double radius,
+ const TopoDS_Shape& theShape,
+ SMESH_NodeSearcher* theNodeSearcher,
+ const char* groupName,
+ std::vector<double>& nodesCoords,
+ std::vector<std::vector<int> >& listOfListOfNodes);
+
/*!
* \brief Generated skin mesh (containing 2D cells) from 3D mesh
* The created 2D mesh elements based on nodes of free faces of boundary volumes
private:
- SMESH_Mesh * myMesh;
-
- /*!
- * Sequence for keeping nodes created during last operation
- */
- SMESH_SequenceOfElemPtr myLastCreatedNodes;
+ SMESH_Mesh * myMesh;
- /*!
- * Sequence for keeping elements created during last operation
- */
- SMESH_SequenceOfElemPtr myLastCreatedElems;
+ // Nodes and elements created during last operation
+ SMESH_SequenceOfElemPtr myLastCreatedNodes, myLastCreatedElems;
+ // Description of error/warning occured during last operation
+ SMESH_ComputeErrorPtr myError;
};
#endif
