0022098: EDF 2036 SMESH: Create groups from none conected parts of a mesh

Move SMESH_ElementSearcher to from SMESH/SMESH_MeshEditor.hxx SMESHUtils/SMESH_MeshAlgos.hxx
in order to make SMESH_ElementSearcher accessible from Controls/SMESH_Controls.cxx

+	SMESH_MeshAlgos.cxx
This commit is contained in:
eap 2013-05-16 16:35:18 +00:00
parent f377659e82
commit b73a05d5ec
3 changed files with 1672 additions and 2 deletions

View File

@ -34,7 +34,8 @@ salomeinclude_HEADERS = \
SMESH_ComputeError.hxx \ SMESH_ComputeError.hxx \
SMESH_File.hxx \ SMESH_File.hxx \
SMESH_Utils.hxx \ SMESH_Utils.hxx \
SMESH_TryCatch.hxx SMESH_TryCatch.hxx \
SMESH_MeshAlgos.hxx
# Libraries targets # Libraries targets
@ -46,7 +47,8 @@ dist_libSMESHUtils_la_SOURCES = \
SMESH_Octree.cxx \ SMESH_Octree.cxx \
SMESH_OctreeNode.cxx \ SMESH_OctreeNode.cxx \
SMESH_TryCatch.cxx \ SMESH_TryCatch.cxx \
SMESH_File.cxx SMESH_File.cxx \
SMESH_MeshAlgos.cxx
# additionnal information to compile and link file # additionnal information to compile and link file
libSMESHUtils_la_CPPFLAGS = \ libSMESHUtils_la_CPPFLAGS = \

File diff suppressed because it is too large Load Diff

View File

@ -0,0 +1,137 @@
// Copyright (C) 2007-2013 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.
//
// 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
//
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
// File : SMESH_MeshAlgos.hxx
// Created : Tue Apr 30 18:00:36 2013
// Author : Edward AGAPOV (eap)
// This file holds some low level algorithms extracted from SMESH_MeshEditor
// to make them accessible from Controls package
#ifndef __SMESH_MeshAlgos_HXX__
#define __SMESH_MeshAlgos_HXX__
#include "SMDSAbs_ElementType.hxx"
#include "SMDS_ElemIterator.hxx"
#include "SMESH_TypeDefs.hxx"
#include <TopAbs_State.hxx>
#include <vector>
class gp_Pnt;
class gp_Ax1;
class SMDS_MeshNode;
class SMDS_MeshElement;
class SMDS_Mesh;
//=======================================================================
/*!
* \brief Searcher for the node closest to a 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;
};
namespace SMESH_MeshAlgos
{
/*!
* \brief Return true if the point is IN or ON of the element
*/
bool IsOut( const SMDS_MeshElement* element, const gp_Pnt& point, double tol );
double GetDistance( const SMDS_MeshFace* face, const gp_Pnt& point );
/*!
* 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
*/
const SMDS_MeshElement* FindFaceInSet(const SMDS_MeshNode* n1,
const SMDS_MeshNode* n2,
const TIDSortedElemSet& elemSet,
const TIDSortedElemSet& avoidSet,
int* i1=0,
int* i2=0);
/*!
* \brief Calculate normal of a mesh face
*/
bool FaceNormal(const SMDS_MeshElement* F, gp_XYZ& normal, bool normalized=true);
/*!
* \brief Return nodes common to two elements
*/
std::vector< const SMDS_MeshNode*> GetCommonNodes(const SMDS_MeshElement* e1,
const SMDS_MeshElement* e2);
/*!
* \brief Return SMESH_NodeSearcher. The caller is responsible for deleteing it
*/
SMESH_NodeSearcher* GetNodeSearcher( SMDS_Mesh& mesh );
/*!
* \brief Return SMESH_ElementSearcher. The caller is responsible for deleting it
*/
SMESH_ElementSearcher* GetElementSearcher( SMDS_Mesh& mesh );
SMESH_ElementSearcher* GetElementSearcher( SMDS_Mesh& mesh,
SMDS_ElemIteratorPtr elemIt );
}
#endif