1 // Copyright (C) 2007-2015 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License, or (at your option) any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 // SMESH SMESH_OctreeNode : Octree with Nodes set
24 // inherites global class SMESH_Octree
25 // File : SMESH_OctreeNode.hxx
26 // Created : Tue Jan 16 16:00:00 2007
27 // Author : Nicolas Geimer & Aurelien Motteux (OCC)
30 #ifndef _SMESH_OCTREENODE_HXX_
31 #define _SMESH_OCTREENODE_HXX_
33 #include "SMDS_ElemIterator.hxx"
34 #include "SMDS_MeshNode.hxx"
35 #include "SMESH_Octree.hxx"
36 #include "SMESH_Utils.hxx"
47 class SMESH_OctreeNode;
49 typedef SMDS_Iterator<SMESH_OctreeNode*> SMESH_OctreeNodeIterator;
50 typedef boost::shared_ptr<SMESH_OctreeNodeIterator> SMESH_OctreeNodeIteratorPtr;
51 typedef std::set< const SMDS_MeshNode*, TIDCompare > TIDSortedNodeSet;
53 class SMESHUtils_EXPORT SMESH_OctreeNode : public SMESH_Octree
58 SMESH_OctreeNode (const TIDSortedNodeSet& theNodes, const int maxLevel = 8,
59 const int maxNbNodes = 5, const double minBoxSize = 0.);
62 virtual ~SMESH_OctreeNode () {};
64 // Tells us if Node is inside the current box with the precision "precision"
65 virtual const bool isInside(const gp_XYZ& p, const double precision = 0.);
67 // Return in Result a list of Nodes potentials to be near Node
68 void NodesAround(const SMDS_MeshNode * node,
69 std::list<const SMDS_MeshNode*>* result,
70 const double precision = 0.);
72 // Return in dist2Nodes nodes mapped to their square distance from Node
73 bool NodesAround(const gp_XYZ& point,
74 std::map<double, const SMDS_MeshNode*>& dist2Nodes,
77 // Return a list of Nodes close to a point
78 void NodesAround(const gp_XYZ& point,
79 std::vector<const SMDS_MeshNode*>& nodes,
82 // Return in theGroupsOfNodes a list of group of nodes close to each other within theTolerance
83 // Search for all the nodes in nodes
84 void FindCoincidentNodes ( TIDSortedNodeSet* nodes,
85 const double theTolerance,
86 std::list< std::list< const SMDS_MeshNode*> >* theGroupsOfNodes);
88 // Static method that return in theGroupsOfNodes a list of group of nodes close to each other within
89 // theTolerance search for all the nodes in nodes
90 static void FindCoincidentNodes ( TIDSortedNodeSet& nodes,
91 std::list< std::list< const SMDS_MeshNode*> >* theGroupsOfNodes,
92 const double theTolerance = 0.00001,
93 const int maxLevel = -1,
94 const int maxNbNodes = 5);
96 * \brief Update data according to node movement
98 void UpdateByMoveNode( const SMDS_MeshNode* node, const gp_Pnt& toPnt );
100 * \brief Return iterator over children
102 SMESH_OctreeNodeIteratorPtr GetChildrenIterator();
104 * \brief Return nodes iterator
106 SMDS_NodeIteratorPtr GetNodeIterator();
108 * \brief Return nb nodes in a tree
110 int NbNodes() const { return myNodes.size(); }
114 struct Limit : public SMESH_TreeLimit
117 Limit(int maxLevel, double minSize, int maxNbNodes)
118 :SMESH_TreeLimit(maxLevel, minSize), myMaxNbNodes(maxNbNodes) {}
121 int getMaxNbNodes() const;
125 // Compute the bounding box of the whole set of nodes myNodes
126 virtual Bnd_B3d* buildRootBox();
128 // Shares the father's data with each of his child
129 virtual void buildChildrenData();
131 // Construct an empty SMESH_OctreeNode used by SMESH_Octree::buildChildren()
132 virtual SMESH_Octree* newChild() const;
134 // Return in result a list of nodes closed to Node and remove it from SetOfNodes
135 void FindCoincidentNodes( const SMDS_MeshNode * Node,
136 TIDSortedNodeSet* SetOfNodes,
137 std::list<const SMDS_MeshNode*>* Result,
138 const double precision);
140 // The set of nodes inside the box of the Octree (Empty if Octree is not a leaf)
141 TIDSortedNodeSet myNodes;