1 // Copyright (C) 2007-2013 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 class SMESH_Octree
25 // File : SMESH_OctreeNode.cxx
26 // Created : Tue Jan 16 16:00:00 2007
27 // Author : Nicolas Geimer & Aurelien Motteux (OCC)
30 #include "SMESH_OctreeNode.hxx"
32 #include "SMDS_SetIterator.hxx"
37 //===============================================================
39 * \brief Constructor : Build all the Octree using Compute()
40 * \param theNodes - Set of nodes, the Octree is built from this nodes
41 * \param maxLevel - Maximum level for the leaves
42 * \param maxNbNodes - Maximum number of nodes, a leaf can contain
43 * \param minBoxSize - Minimal size of the Octree Box
45 //================================================================
47 SMESH_OctreeNode::SMESH_OctreeNode (const TIDSortedNodeSet & theNodes, const int maxLevel,
48 const int maxNbNodes , const double minBoxSize )
49 :SMESH_Octree( new Limit( maxLevel,minBoxSize,maxNbNodes)),
55 //================================================================================
57 * \brief Constructor used to allocate a child
59 //================================================================================
61 SMESH_OctreeNode::SMESH_OctreeNode ():SMESH_Octree()
65 //================================================================================
67 * \brief Return max number of nodes in a tree leaf
69 //================================================================================
71 int SMESH_OctreeNode::getMaxNbNodes() const
73 return ((Limit*)myLimit)->myMaxNbNodes;
76 //==================================================================================
78 * \brief Construct an empty SMESH_OctreeNode used by SMESH_Octree::buildChildren()
80 //==================================================================================
82 SMESH_Octree* SMESH_OctreeNode::newChild() const
84 return new SMESH_OctreeNode();
87 //======================================
89 * \brief Compute the first bounding box
91 * We take the max/min coord of the nodes
93 //======================================
95 Bnd_B3d* SMESH_OctreeNode::buildRootBox()
97 Bnd_B3d* box = new Bnd_B3d;
98 TIDSortedNodeSet::iterator it = myNodes.begin();
99 for (; it != myNodes.end(); it++) {
100 const SMDS_MeshNode* n1 = *it;
101 gp_XYZ p1( n1->X(), n1->Y(), n1->Z() );
104 if ( myNodes.size() <= getMaxNbNodes() )
110 //====================================================================================
112 * \brief Tells us if Node is inside the current box with the precision "precision"
114 * \param precision - The box is enlarged with this precision
115 * \retval bool - True if Node is in the box within precision
117 //====================================================================================
119 const bool SMESH_OctreeNode::isInside (const gp_XYZ& p, const double precision)
122 return !(getBox()->IsOut(p));
123 Bnd_B3d BoxWithPrecision = *getBox();
124 BoxWithPrecision.Enlarge(precision);
125 return ! BoxWithPrecision.IsOut(p);
128 //================================================
130 * \brief Set the data of the children
131 * Shares the father's data with each of his child
133 //================================================
134 void SMESH_OctreeNode::buildChildrenData()
136 gp_XYZ min = getBox()->CornerMin();
137 gp_XYZ max = getBox()->CornerMax();
138 gp_XYZ mid = (min + max)/2.;
140 TIDSortedNodeSet::iterator it = myNodes.begin();
141 while (it != myNodes.end())
143 const SMDS_MeshNode* n1 = *it;
144 int ChildBoxNum = getChildIndex( n1->X(), n1->Y(), n1->Z(), mid );
145 SMESH_OctreeNode* myChild = dynamic_cast<SMESH_OctreeNode*> (myChildren[ChildBoxNum]);
146 myChild->myNodes.insert(myChild->myNodes.end(),n1);
148 it = myNodes.begin();
150 for (int i = 0; i < 8; i++)
152 SMESH_OctreeNode* myChild = dynamic_cast<SMESH_OctreeNode*> (myChildren[i]);
153 if ( myChild->myNodes.size() <= getMaxNbNodes() )
154 myChild->myIsLeaf = true;
158 //===================================================================
160 * \brief Return in Result a list of Nodes potentials to be near Node
162 * \param precision - precision used
163 * \param Result - list of Nodes potentials to be near Node
165 //====================================================================
166 void SMESH_OctreeNode::NodesAround (const SMDS_MeshNode * Node,
167 list<const SMDS_MeshNode*>* Result,
168 const double precision)
170 gp_XYZ p(Node->X(), Node->Y(), Node->Z());
171 if (isInside(p, precision))
175 Result->insert(Result->end(), myNodes.begin(), myNodes.end());
179 for (int i = 0; i < 8; i++)
181 SMESH_OctreeNode* myChild = dynamic_cast<SMESH_OctreeNode*> (myChildren[i]);
182 myChild->NodesAround(Node, Result, precision);
188 //================================================================================
190 * \brief Return in dist2Nodes nodes mapped to their square distance from Node
191 * \param node - node to find nodes closest to
192 * \param dist2Nodes - map of found nodes and their distances
193 * \param precision - radius of a sphere to check nodes inside
194 * \retval bool - true if an exact overlapping found
196 //================================================================================
198 bool SMESH_OctreeNode::NodesAround(const gp_XYZ &node,
199 map<double, const SMDS_MeshNode*>& dist2Nodes,
202 if ( !dist2Nodes.empty() )
203 precision = min ( precision, sqrt( dist2Nodes.begin()->first ));
204 else if ( precision == 0. )
205 precision = maxSize() / 2;
207 //gp_XYZ p(node->X(), node->Y(), node->Z());
208 if (isInside(node, precision))
212 // first check a child containing node
213 gp_XYZ mid = (getBox()->CornerMin() + getBox()->CornerMax()) / 2.;
214 int nodeChild = getChildIndex( node.X(), node.Y(), node.Z(), mid );
215 if ( ((SMESH_OctreeNode*) myChildren[nodeChild])->NodesAround(node, dist2Nodes, precision))
218 for (int i = 0; i < 8; i++)
219 if ( i != nodeChild )
220 if (((SMESH_OctreeNode*) myChildren[i])->NodesAround(node, dist2Nodes, precision))
223 else if ( NbNodes() > 0 )
225 double minDist = precision * precision;
226 gp_Pnt p1 ( node.X(), node.Y(), node.Z() );
227 TIDSortedNodeSet::iterator nIt = myNodes.begin();
228 for ( ; nIt != myNodes.end(); ++nIt )
230 gp_Pnt p2 ( (*nIt)->X(), (*nIt)->Y(), (*nIt)->Z() );
231 double dist2 = p1.SquareDistance( p2 );
232 if ( dist2 < minDist )
233 dist2Nodes.insert( make_pair( minDist = dist2, *nIt ));
235 // if ( dist2Nodes.size() > 1 ) // leave only closest node in dist2Nodes
236 // dist2Nodes.erase( ++dist2Nodes.begin(), dist2Nodes.end());
238 return ( sqrt( minDist) <= precision * 1e-12 );
244 //=============================
246 * \brief Return in theGroupsOfNodes a list of group of nodes close to each other within theTolerance
247 * Search for all the nodes in theSetOfNodes
248 * Static Method : no need to create an SMESH_OctreeNode
249 * \param theSetOfNodes - set of nodes we look at, modified during research
250 * \param theGroupsOfNodes - list of nodes closed to each other returned
251 * \param theTolerance - Precision used, default value is 0.00001
252 * \param maxLevel - Maximum level for SMESH_OctreeNode constructed, default value is -1 (Infinite)
253 * \param maxNbNodes - maximum Nodes in a Leaf of the SMESH_OctreeNode constructed, default value is 5
255 //=============================
256 void SMESH_OctreeNode::FindCoincidentNodes (TIDSortedNodeSet& theSetOfNodes,
257 list< list< const SMDS_MeshNode*> >* theGroupsOfNodes,
258 const double theTolerance,
260 const int maxNbNodes)
262 // VSR 14/10/2011: limit max number of the levels in order to avoid endless recursing
263 const int MAX_LEVEL = 10;
264 SMESH_OctreeNode theOctreeNode(theSetOfNodes, maxLevel < 0 ? MAX_LEVEL : maxLevel, maxNbNodes, theTolerance);
265 theOctreeNode.FindCoincidentNodes (&theSetOfNodes, theTolerance, theGroupsOfNodes);
268 //=============================
270 * \brief Return in theGroupsOfNodes a list of group of nodes close to each other within theTolerance
271 * Search for all the nodes in theSetOfNodes
272 * \note The Octree itself is also modified by this method
273 * \param theSetOfNodes - set of nodes we look at, modified during research
274 * \param theTolerance - Precision used
275 * \param theGroupsOfNodes - list of nodes closed to each other returned
277 //=============================
278 void SMESH_OctreeNode::FindCoincidentNodes ( TIDSortedNodeSet* theSetOfNodes,
279 const double theTolerance,
280 list< list< const SMDS_MeshNode*> >* theGroupsOfNodes)
282 TIDSortedNodeSet::iterator it1 = theSetOfNodes->begin();
283 list<const SMDS_MeshNode*>::iterator it2;
285 while (it1 != theSetOfNodes->end())
287 const SMDS_MeshNode * n1 = *it1;
289 list<const SMDS_MeshNode*> ListOfCoincidentNodes;// Initialize the lists via a declaration, it's enough
291 list<const SMDS_MeshNode*> * groupPtr = 0;
293 // Searching for Nodes around n1 and put them in ListofCoincidentNodes.
294 // Found nodes are also erased from theSetOfNodes
295 FindCoincidentNodes(n1, theSetOfNodes, &ListOfCoincidentNodes, theTolerance);
297 // We build a list {n1 + his neigbours} and add this list in theGroupsOfNodes
298 for (it2 = ListOfCoincidentNodes.begin(); it2 != ListOfCoincidentNodes.end(); it2++)
300 const SMDS_MeshNode* n2 = *it2;
303 theGroupsOfNodes->push_back( list<const SMDS_MeshNode*>() );
304 groupPtr = & theGroupsOfNodes->back();
305 groupPtr->push_back( n1 );
307 if (groupPtr->front() > n2)
308 groupPtr->push_front( n2 );
310 groupPtr->push_back( n2 );
315 theSetOfNodes->erase(it1);
316 it1 = theSetOfNodes->begin();
320 //======================================================================================
322 * \brief Return a list of nodes closed to Node and remove it from SetOfNodes
323 * \note The Octree itself is also modified by this method
324 * \param Node - We're searching the nodes next to him.
325 * \param SetOfNodes - set of nodes in which we erase the found nodes
326 * \param Result - list of nodes closed to Node
327 * \param precision - Precision used
329 //======================================================================================
330 void SMESH_OctreeNode::FindCoincidentNodes (const SMDS_MeshNode * Node,
331 TIDSortedNodeSet* SetOfNodes,
332 list<const SMDS_MeshNode*>* Result,
333 const double precision)
335 gp_Pnt p1 (Node->X(), Node->Y(), Node->Z());
336 bool isInsideBool = isInside( p1.XYZ(), precision );
340 // I'm only looking in the leaves, since all the nodes are stored there.
343 TIDSortedNodeSet::iterator it = myNodes.begin();
344 const double tol2 = precision * precision;
347 while (it != myNodes.end())
349 const SMDS_MeshNode* n2 = *it;
351 // We're only looking at nodes with a superior Id.
353 //if (Node->GetID() < n2->GetID())
354 if (Node->GetID() != n2->GetID()) // JFA: for bug 0020185
356 gp_Pnt p2 (n2->X(), n2->Y(), n2->Z());
357 // Distance optimized computation
358 squareBool = (p1.SquareDistance( p2 ) <= tol2);
360 // If n2 inside the SquareDistance, we add it in Result and remove it from SetOfNodes and myNodes
363 Result->insert(Result->begin(), n2);
364 SetOfNodes->erase( n2 );
365 myNodes.erase( *it++ ); // it++ goes forward and returns it's previous position
371 if ( !Result->empty() )
372 myNodes.erase(Node); // JFA: for bug 0020185
376 // If I'm not a leaf, I'm going to see my children !
377 for (int i = 0; i < 8; i++)
379 SMESH_OctreeNode* myChild = dynamic_cast<SMESH_OctreeNode*> (myChildren[i]);
380 myChild->FindCoincidentNodes(Node, SetOfNodes, Result, precision);
386 //================================================================================
388 * \brief Update data according to node movement
390 //================================================================================
392 void SMESH_OctreeNode::UpdateByMoveNode( const SMDS_MeshNode* node, const gp_Pnt& toPnt )
396 TIDSortedNodeSet::iterator pNode = myNodes.find( node );
397 bool nodeInMe = ( pNode != myNodes.end() );
399 bool pointInMe = isInside( toPnt.Coord(), 1e-10 );
401 if ( pointInMe != nodeInMe )
404 myNodes.insert( node );
406 myNodes.erase( node );
409 else if ( myChildren )
411 gp_XYZ mid = (getBox()->CornerMin() + getBox()->CornerMax()) / 2.;
412 int nodeChild = getChildIndex( node->X(), node->Y(), node->Z(), mid );
413 int pointChild = getChildIndex( toPnt.X(), toPnt.Y(), toPnt.Z(), mid );
414 if ( nodeChild != pointChild )
416 ((SMESH_OctreeNode*) myChildren[ nodeChild ])->UpdateByMoveNode( node, toPnt );
417 ((SMESH_OctreeNode*) myChildren[ pointChild ])->UpdateByMoveNode( node, toPnt );
422 //================================================================================
424 * \brief Return iterator over children
426 //================================================================================
427 SMESH_OctreeNodeIteratorPtr SMESH_OctreeNode::GetChildrenIterator()
429 return SMESH_OctreeNodeIteratorPtr
430 ( new SMDS_SetIterator< SMESH_OctreeNode*, TBaseTree** >
431 ( myChildren, (( isLeaf() || !myChildren ) ? myChildren : &myChildren[ 8 ] )));
434 //================================================================================
436 * \brief Return nodes iterator
438 //================================================================================
439 SMDS_NodeIteratorPtr SMESH_OctreeNode::GetNodeIterator()
441 return SMDS_NodeIteratorPtr
442 ( new SMDS_SetIterator< SMDS_pNode, TIDSortedNodeSet::const_iterator >
443 ( myNodes.begin(), myNodes.size() ? myNodes.end() : myNodes.begin()));