1 // Copyright (C) 2007-2010 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.
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 & Aurélien Motteux (OCC)
30 #ifndef _SMESH_OCTREENODE_HXX_
31 #define _SMESH_OCTREENODE_HXX_
33 #include "SMESH_Octree.hxx"
34 #include "SMDS_MeshNode.hxx"
40 #include "SMDS_ElemIterator.hxx"
44 class SMESH_OctreeNode;
46 typedef SMDS_Iterator<SMESH_OctreeNode*> SMESH_OctreeNodeIterator;
47 typedef boost::shared_ptr<SMESH_OctreeNodeIterator> SMESH_OctreeNodeIteratorPtr;
48 typedef std::set< const SMDS_MeshNode*, TIDCompare > TIDSortedNodeSet;
50 class SMESH_OctreeNode : public SMESH_Octree {
55 SMESH_OctreeNode (const TIDSortedNodeSet& theNodes, const int maxLevel = 8,
56 const int maxNbNodes = 5, const double minBoxSize = 0.);
58 //=============================
60 * \brief Empty destructor
62 //=============================
63 virtual ~SMESH_OctreeNode () {};
65 // Tells us if Node is inside the current box with the precision "precision"
66 virtual const bool isInside(const SMDS_MeshNode * Node, const double precision = 0.);
68 // Return in Result a list of Nodes potentials to be near Node
69 void NodesAround(const SMDS_MeshNode * Node,
70 std::list<const SMDS_MeshNode*>* Result,
71 const double precision = 0.);
73 // Return in dist2Nodes nodes mapped to their square distance from Node
74 bool NodesAround(const SMDS_MeshNode * Node,
75 std::map<double, const SMDS_MeshNode*>& dist2Nodes,
78 // Return in theGroupsOfNodes a list of group of nodes close to each other within theTolerance
79 // Search for all the nodes in nodes
80 void FindCoincidentNodes ( TIDSortedNodeSet* nodes,
81 const double theTolerance,
82 std::list< std::list< const SMDS_MeshNode*> >* theGroupsOfNodes);
84 // Static method that return in theGroupsOfNodes a list of group of nodes close to each other within
85 // theTolerance search for all the nodes in nodes
86 static void FindCoincidentNodes ( TIDSortedNodeSet& nodes,
87 std::list< std::list< const SMDS_MeshNode*> >* theGroupsOfNodes,
88 const double theTolerance = 0.00001,
89 const int maxLevel = -1,
90 const int maxNbNodes = 5);
92 * \brief Update data according to node movement
94 void UpdateByMoveNode( const SMDS_MeshNode* node, const gp_Pnt& toPnt );
96 * \brief Return iterator over children
98 SMESH_OctreeNodeIteratorPtr GetChildrenIterator();
100 * \brief Return nodes iterator
102 SMDS_NodeIteratorPtr GetNodeIterator();
104 * \brief Return nb nodes in a tree
106 int NbNodes() const { return myNodes.size(); }
110 SMESH_OctreeNode (int maxNbNodes );
112 // Compute the bounding box of the whole set of nodes myNodes
113 virtual Bnd_B3d* buildRootBox();
115 // Shares the father's data with each of his child
116 virtual void buildChildrenData();
118 // Construct an empty SMESH_OctreeNode used by SMESH_Octree::buildChildren()
119 virtual SMESH_Octree* allocateOctreeChild() const;
121 // Return in result a list of nodes closed to Node and remove it from SetOfNodes
122 void FindCoincidentNodes( const SMDS_MeshNode * Node,
123 TIDSortedNodeSet* SetOfNodes,
124 std::list<const SMDS_MeshNode*>* Result,
125 const double precision);
127 // The max number of nodes a leaf box can contain
130 // The set of nodes inside the box of the Octree (Empty if Octree is not a leaf)
131 TIDSortedNodeSet myNodes;