X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;f=src%2FSMESHUtils%2FSMESH_MeshAlgos.hxx;h=564ab11fe22cf5ee1fbeb05e9b7ec0a28fada2fc;hb=HEAD;hp=10af7a63673cc72e514780e47cc0e6ea72aab41a;hpb=10191484fe88a27e962b8e4b57e09d390d8705c7;p=modules%2Fsmesh.git diff --git a/src/SMESHUtils/SMESH_MeshAlgos.hxx b/src/SMESHUtils/SMESH_MeshAlgos.hxx index 10af7a636..564ab11fe 100644 --- a/src/SMESHUtils/SMESH_MeshAlgos.hxx +++ b/src/SMESHUtils/SMESH_MeshAlgos.hxx @@ -1,4 +1,4 @@ -// Copyright (C) 2007-2016 CEA/DEN, EDF R&D, OPEN CASCADE +// Copyright (C) 2007-2024 CEA, EDF, OPEN CASCADE // // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN, // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS @@ -23,8 +23,8 @@ // 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 +// Initially this file held some low level algorithms extracted from SMESH_MeshEditor +// to make them accessible from Controls package, and more #ifndef __SMESH_MeshAlgos_HXX__ @@ -37,13 +37,17 @@ #include "SMESH_TypeDefs.hxx" #include +#include +#include + #include -class gp_Pnt; +class Bnd_B3d; class gp_Ax1; -class SMDS_MeshNode; -class SMDS_MeshElement; class SMDS_Mesh; +class SMDS_MeshElement; +class SMDS_MeshGroup; +class SMDS_MeshNode; //======================================================================= /*! @@ -96,6 +100,12 @@ struct SMESHUtils_EXPORT SMESH_ElementSearcher const double radius, SMDSAbs_ElementType type, std::vector< const SMDS_MeshElement* >& foundElems) = 0; + /*! + * \brief Return elements whose bounding box intersects a given bounding box + */ + virtual void GetElementsInBox( const Bnd_B3d& box, + SMDSAbs_ElementType type, + std::vector< const SMDS_MeshElement* >& foundElems) = 0; /*! * \brief Find out if the given point is out of closed 2D mesh. */ @@ -114,6 +124,27 @@ struct SMESHUtils_EXPORT SMESH_ElementSearcher namespace SMESH_MeshAlgos { + /*! + * \brief Return SMESH_NodeSearcher. The caller is responsible for deleting it + */ + SMESHUtils_EXPORT + SMESH_NodeSearcher* GetNodeSearcher( SMDS_Mesh& mesh ); + + SMESHUtils_EXPORT + SMESH_NodeSearcher* GetNodeSearcher( SMDS_ElemIteratorPtr elemIt ); + + /*! + * \brief Return SMESH_ElementSearcher. The caller is responsible for deleting it + */ + SMESHUtils_EXPORT + SMESH_ElementSearcher* GetElementSearcher( SMDS_Mesh& mesh, + double tolerance=-1.); + SMESHUtils_EXPORT + SMESH_ElementSearcher* GetElementSearcher( SMDS_Mesh& mesh, + SMDS_ElemIteratorPtr elemIt, + double tolerance=-1. ); + + /*! * \brief Return true if the point is IN or ON of the element */ @@ -137,6 +168,13 @@ namespace SMESH_MeshAlgos const gp_XY& t0, const gp_XY& t1, const gp_XY& t2, double & bc0, double & bc1); + /*! + * \brief Intersect volume by a ray + */ + bool IntersectRayVolume( const gp_Ax1& ray, const double rayLen, + const SMDS_MeshElement* vol, + double & tMin, double & tMax, + int & iFacetMin, int & iFacetMax); /*! * Return a face having linked nodes n1 and n2 and which is * - not in avoidSet, @@ -156,12 +194,24 @@ namespace SMESH_MeshAlgos SMESHUtils_EXPORT bool FaceNormal(const SMDS_MeshElement* F, gp_XYZ& normal, bool normalized=true); + /*! + * \brief Return number of nodes common to two elements + */ + SMESHUtils_EXPORT + int NbCommonNodes(const SMDS_MeshElement* e1, + const SMDS_MeshElement* e2); /*! * \brief Return nodes common to two elements */ SMESHUtils_EXPORT std::vector< const SMDS_MeshNode*> GetCommonNodes(const SMDS_MeshElement* e1, const SMDS_MeshElement* e2); + /*! + * \brief Return true if a node is on a boundary of 2D mesh. + * Optionally returns two neighboring boundary nodes (or more in non-manifold mesh) + */ + SMESHUtils_EXPORT bool IsOn2DBoundary( const SMDS_MeshNode* node, + std::vector< const SMDS_MeshNode*> * neibors = nullptr ); /*! * \brief Return true if node1 encounters first in the face and node2, after. * The nodes are supposed to be neighbor nodes in the face. @@ -171,26 +221,93 @@ namespace SMESH_MeshAlgos const SMDS_MeshNode* node0, const SMDS_MeshNode* node1 ); + typedef std::vector< std::vector< const SMDS_MeshElement* > > TElemGroupVector; + typedef std::vector< std::vector< const SMDS_MeshNode* > > TNodeGroupVector; /*! - * \brief Return SMESH_NodeSearcher. The caller is responsible for deleteing it + * \brief Partition given 1D elements into groups of contiguous edges. + * A node where number of meeting edges != 2 is a group end. + * An optional startNode is used to orient groups it belongs to. + * \return a list of edge groups and a list of corresponding node groups. + * If a group is closed, the first and last nodes of the group are same. */ SMESHUtils_EXPORT - SMESH_NodeSearcher* GetNodeSearcher( SMDS_Mesh& mesh ); + void Get1DBranches( SMDS_ElemIteratorPtr edgeIt, + TElemGroupVector& edgeGroups, + TNodeGroupVector& nodeGroups, + const SMDS_MeshNode* startNode = 0 ); - SMESHUtils_EXPORT - SMESH_NodeSearcher* GetNodeSearcher( SMDS_ElemIteratorPtr elemIt ); + /*! + * \brief Mark elements given by SMDS_Iterator + * \sa SMDS_Mesh::SetAllNodesNotMarked() and SMDS_Mesh::SetAllCellsNotMarked() + */ + template< class ElemIter > + void MarkElems( ElemIter it, const bool isMarked ) + { + while ( it->more() ) it->next()->setIsMarked( isMarked ); + } + /*! + * \brief Mark elements given by std iterators + */ + template< class ElemIter > + void MarkElems( ElemIter it, ElemIter end, const bool isMarked ) + { + for ( ; it != end; ++it ) (*it)->setIsMarked( isMarked ); + } + /*! + * \brief Mark nodes of elements given by SMDS_Iterator + */ + template< class ElemIter > + void MarkElemNodes( ElemIter it, const bool isMarked, const bool markElem = false ) + { + if ( markElem ) + while ( it->more() ) { + const SMDS_MeshElement* e = it->next(); + e->setIsMarked( isMarked ); + MarkElems( e->nodesIterator(), isMarked ); + } + else + while ( it->more() ) + MarkElems( it->next()->nodesIterator(), isMarked ); + } + /*! + * \brief Mark elements given by std iterators + */ + template< class ElemIter > + void MarkElemNodes( ElemIter it, ElemIter end, const bool isMarked, const bool markElem = false ) + { + if ( markElem ) + for ( ; it != end; ++it ) { + (*it)->setIsMarked( isMarked ); + MarkElems( (*it)->nodesIterator(), isMarked ); + } + else + for ( ; it != end; ++it ) + MarkElems( (*it)->nodesIterator(), isMarked ); + } + + // 2 nodes + optional medium node + struct Edge + { + const SMDS_MeshNode* _node1; + const SMDS_MeshNode* _node2; + const SMDS_MeshNode* _medium; + }; /*! - * \brief Return SMESH_ElementSearcher. The caller is responsible for deleting it + * Return sharp edges of faces and non-manifold ones. + * Optionally adds existing edges to the result. Angle is in degrees. */ SMESHUtils_EXPORT - SMESH_ElementSearcher* GetElementSearcher( SMDS_Mesh& mesh, - double tolerance=-1.); - SMESHUtils_EXPORT - SMESH_ElementSearcher* GetElementSearcher( SMDS_Mesh& mesh, - SMDS_ElemIteratorPtr elemIt, - double tolerance=-1. ); + std::vector< Edge > FindSharpEdges( SMDS_Mesh* mesh, + double angle, + bool addExisting ); + /*! + * Distribute all faces of the mesh between groups using given edges. + */ + SMESHUtils_EXPORT + std::vector< std::vector< const SMDS_MeshElement* > > + SeparateFacesByEdges( SMDS_Mesh* mesh, const std::vector< Edge >& edges ); typedef std::vector TFreeBorder; @@ -214,18 +331,16 @@ namespace SMESH_MeshAlgos * Returns TFreeBorder's coincident within the given tolerance. * If the tolerance <= 0.0 then one tenth of an average size of elements adjacent * to free borders being compared is used. - * - * (Implemented in ./SMESH_FreeBorders.cxx) */ SMESHUtils_EXPORT void FindCoincidentFreeBorders(SMDS_Mesh& mesh, double tolerance, CoincidentFreeBorders & foundFreeBordes); + // Implemented in ./SMESH_FreeBorders.cxx + /*! * Returns all or only closed TFreeBorder's. * Optionally check if the mesh is manifold and if faces are correctly oriented. - * - * (Implemented in ./SMESH_FreeBorders.cxx) */ SMESHUtils_EXPORT void FindFreeBorders(SMDS_Mesh& mesh, @@ -233,26 +348,187 @@ namespace SMESH_MeshAlgos const bool closedOnly, bool* isManifold = 0, bool* isGoodOri = 0); + // Implemented in ./SMESH_FreeBorders.cxx + /*! * Fill a hole defined by a TFreeBorder with 2D elements. - * - * (Implemented in ./SMESH_FillHole.cxx) */ SMESHUtils_EXPORT void FillHole(const TFreeBorder & freeBorder, SMDS_Mesh& mesh, std::vector& newFaces); - + // Implemented in ./SMESH_FillHole.cxx /*! * \brief Find nodes whose merge makes the element invalid - * - * (Implemented in SMESH_DeMerge.cxx) */ SMESHUtils_EXPORT void DeMerge(const SMDS_MeshElement* elem, std::vector< const SMDS_MeshNode* >& newNodes, std::vector< const SMDS_MeshNode* >& noMergeNodes); + // Implemented in SMESH_DeMerge.cxx + + + typedef std::vector< std::pair< const SMDS_MeshElement*, int > > TElemIntPairVec; + typedef std::vector< std::pair< const SMDS_MeshNode*, int > > TNodeIntPairVec; + /*! + * \brief Create an offset mesh of given faces + * \param [in] faceIt - the input faces + * \param [in] theFixIntersections - to fix self intersections of the offset mesh or not + * \param [out] new2OldFaces - history of faces + * \param [out] new2OldNodes - history of nodes + * \return SMDS_Mesh* - the new offset mesh, a caller should delete + */ + SMESHUtils_EXPORT + SMDS_Mesh* MakeOffset( SMDS_ElemIteratorPtr faceIt, + SMDS_Mesh& mesh, + const double offset, + const bool theFixIntersections, + TElemIntPairVec& new2OldFaces, + TNodeIntPairVec& new2OldNodes ); + // Implemented in ./SMESH_Offset.cxx + + + //======================================================================= + /*! + * \brief Cut faces of a triangular mesh. + * Usage work-flow: 1) call Cut() methods as many times as needed + * 2) call MakeNewFaces() to really modify the mesh faces + */ + //======================================================================= + // implemented in SMESH_Offset.cxx + + class SMESHUtils_EXPORT Intersector + { + public: + Intersector( SMDS_Mesh* mesh, double tol, const std::vector< gp_XYZ >& normals ); + ~Intersector(); + + //! Compute cut of two faces of the mesh + void Cut( const SMDS_MeshElement* face1, + const SMDS_MeshElement* face2, + const int nbCommonNodes = -1 ); + + //! Store a face cut by a line given by its ends lying either on face edges or inside the face. + // Line ends are accompanied by indices of intersected face edges. + // Edge index is <0 if a line end is inside the face. + void Cut( const SMDS_MeshElement* face, + SMESH_NodeXYZ& lineEnd1, + int edgeIndex1, + SMESH_NodeXYZ& lineEnd2, + int edgeIndex2 ); + + //! Split all faces intersected by Cut() methods. + // theSign = (-1|1) is used to choose which part of a face cut by another one to remove. + // 1 means to remove a part opposite to face normal. + // Optionally optimize quality of split faces by edge swapping. + void MakeNewFaces( SMESH_MeshAlgos::TElemIntPairVec& theNew2OldFaces, + SMESH_MeshAlgos::TNodeIntPairVec& theNew2OldNodes, + const double theSign = 1., + const bool theOptimize = false ); + + typedef std::vector< SMESH_NodeXYZ > TFace; + + //! Cut a face by planes, whose normals point to parts to keep. + // Return true if the whole face is cut off + static bool CutByPlanes(const SMDS_MeshElement* face, + const std::vector< gp_Ax1 > & planes, + const double tol, + std::vector< TFace > & newFaceConnectivity ); + + private: + struct Algo; + Algo* myAlgo; + }; + + //======================================================================= + /*! + * \brief Divide a mesh face into triangles + */ + //======================================================================= + // Implemented in ./SMESH_Triangulate.cxx + + class SMESHUtils_EXPORT Triangulate + { + public: + + Triangulate(bool optimize=false); + ~Triangulate(); + + static int GetNbTriangles( const SMDS_MeshElement* face ); + + int GetTriangles( const SMDS_MeshElement* face, + std::vector< const SMDS_MeshNode*>& nodes); + private: + + bool triangulate( std::vector< const SMDS_MeshNode*>& nodes, const size_t nbNodes ); + + struct PolyVertex; + struct Optimizer; + struct Data; + + Data* _data; + Optimizer* _optimizer; + }; + + // structure used in MakePolyLine() to define a cutting plane + struct PolySegment + { + // 2 points, each defined as follows: + // ( myNode1 && myNode2 ) ==> point is in the middle of an edge defined by two nodes + // ( myNode1 && !myNode2 ) ==> point is at myNode1 of a some face + // else ==> point is at myXYZ + const SMDS_MeshNode* myNode1[2]; + const SMDS_MeshNode* myNode2[2]; + gp_XYZ myXYZ [2]; + + // face on which myXYZ projects (found by MakePolyLine()) + const SMDS_MeshElement* myFace [2]; + + // vector on the plane; to use a default plane set vector = (0,0,0) + gp_Vec myVector; + + // point returning coordinates of a middle of the two points, projected to mesh + gp_Pnt myMidProjPoint; + }; + typedef std::vector TListOfPolySegments; + + /*! + * \brief Create a polyline consisting of 1D mesh elements each lying on a 2D element of + * the initial mesh. Positions of new nodes are found by cutting the mesh by the + * plane passing through pairs of points specified by each PolySegment structure. + * If there are several paths connecting a pair of points, the shortest path is + * selected by the module. Position of the cutting plane is defined by the two + * points and an optional vector lying on the plane specified by a PolySegment. + * By default the vector is defined by Mesh module as following. A middle point + * of the two given points is computed. The middle point is projected to the mesh. + * The vector goes from the middle point to the projection point. In case of planar + * mesh, the vector is normal to the mesh. + * \param [inout] segments - PolySegment's defining positions of cutting planes. + * Return the used vector and position of the middle point. + * \param [in] group - an optional group where created mesh segments will + * be added. + */ + // Implemented in ./SMESH_PolyLine.cxx + SMESHUtils_EXPORT + void MakePolyLine( SMDS_Mesh* mesh, + TListOfPolySegments& segments, + std::vector& newEdges, + std::vector& newNodes, + SMDS_MeshGroup* group=0, + SMESH_ElementSearcher* searcher=0); + + /*! + * Create a slot of given width around given 1D elements lying on a triangle mesh. + * The slot is constructed by cutting faces by cylindrical surfaces made around each segment. + * \return Edges located at the slot boundary + */ + // Implemented in ./SMESH_Slot.cxx + SMESHUtils_EXPORT + std::vector< Edge > MakeSlot( SMDS_ElemIteratorPtr segmentIt, + double width, + SMDS_Mesh* mesh, + std::vector< SMDS_MeshGroup* > & groupsToUpdate); } // namespace SMESH_MeshAlgos