1 // Copyright (C) 2007-2016 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
22 // File : SMESH_MeshAlgos.hxx
23 // Created : Tue Apr 30 18:00:36 2013
24 // Author : Edward AGAPOV (eap)
26 // Initially this file held some low level algorithms extracted from SMESH_MeshEditor
27 // to make them accessible from Controls package
29 #include "SMESH_MeshAlgos.hxx"
31 #include "ObjectPool.hxx"
32 #include "SMDS_FaceOfNodes.hxx"
33 #include "SMDS_LinearEdge.hxx"
34 #include "SMDS_Mesh.hxx"
35 #include "SMDS_PolygonalFaceOfNodes.hxx"
36 #include "SMDS_VolumeTool.hxx"
37 #include "SMESH_OctreeNode.hxx"
39 #include <Utils_SALOME_Exception.hxx>
41 #include <GC_MakeSegment.hxx>
42 #include <GeomAPI_ExtremaCurveCurve.hxx>
43 #include <Geom_Line.hxx>
44 #include <IntAna_IntConicQuad.hxx>
45 #include <IntAna_Quadric.hxx>
48 #include <NCollection_DataMap.hxx>
53 #include <boost/container/flat_set.hpp>
55 //=======================================================================
57 * \brief Implementation of search for the node closest to point
59 //=======================================================================
61 struct SMESH_NodeSearcherImpl: public SMESH_NodeSearcher
63 //---------------------------------------------------------------------
67 SMESH_NodeSearcherImpl( const SMDS_Mesh* theMesh = 0,
68 SMDS_ElemIteratorPtr theElemIt = SMDS_ElemIteratorPtr() )
70 myMesh = ( SMDS_Mesh* ) theMesh;
72 TIDSortedNodeSet nodes;
74 SMDS_NodeIteratorPtr nIt = theMesh->nodesIterator();
76 nodes.insert( nodes.end(), nIt->next() );
80 while ( theElemIt->more() )
82 const SMDS_MeshElement* e = theElemIt->next();
83 nodes.insert( e->begin_nodes(), e->end_nodes() );
86 myOctreeNode = new SMESH_OctreeNode(nodes) ;
88 // get max size of a leaf box
89 SMESH_OctreeNode* tree = myOctreeNode;
90 while ( !tree->isLeaf() )
92 SMESH_OctreeNodeIteratorPtr cIt = tree->GetChildrenIterator();
96 myHalfLeafSize = tree->maxSize() / 2.;
99 //---------------------------------------------------------------------
101 * \brief Move node and update myOctreeNode accordingly
103 void MoveNode( const SMDS_MeshNode* node, const gp_Pnt& toPnt )
105 myOctreeNode->UpdateByMoveNode( node, toPnt );
106 myMesh->MoveNode( node, toPnt.X(), toPnt.Y(), toPnt.Z() );
109 //---------------------------------------------------------------------
113 const SMDS_MeshNode* FindClosestTo( const gp_Pnt& thePnt )
115 std::map<double, const SMDS_MeshNode*> dist2Nodes;
116 myOctreeNode->NodesAround( thePnt.Coord(), dist2Nodes, myHalfLeafSize );
117 if ( !dist2Nodes.empty() )
118 return dist2Nodes.begin()->second;
120 std::vector<const SMDS_MeshNode*> nodes;
121 //myOctreeNode->NodesAround( &tgtNode, &nodes, myHalfLeafSize );
123 double minSqDist = DBL_MAX;
124 if ( nodes.empty() ) // get all nodes of OctreeNode's closest to thePnt
126 // sort leafs by their distance from thePnt
127 typedef std::multimap< double, SMESH_OctreeNode* > TDistTreeMap;
128 TDistTreeMap treeMap;
129 std::list< SMESH_OctreeNode* > treeList;
130 std::list< SMESH_OctreeNode* >::iterator trIt;
131 treeList.push_back( myOctreeNode );
133 gp_XYZ pointNode( thePnt.X(), thePnt.Y(), thePnt.Z() );
134 bool pointInside = myOctreeNode->isInside( pointNode, myHalfLeafSize );
135 for ( trIt = treeList.begin(); trIt != treeList.end(); ++trIt)
137 SMESH_OctreeNode* tree = *trIt;
138 if ( !tree->isLeaf() ) // put children to the queue
140 if ( pointInside && !tree->isInside( pointNode, myHalfLeafSize )) continue;
141 SMESH_OctreeNodeIteratorPtr cIt = tree->GetChildrenIterator();
142 while ( cIt->more() )
143 treeList.push_back( cIt->next() );
145 else if ( tree->NbNodes() ) // put a tree to the treeMap
147 const Bnd_B3d& box = *tree->getBox();
148 double sqDist = thePnt.SquareDistance( 0.5 * ( box.CornerMin() + box.CornerMax() ));
149 treeMap.insert( std::make_pair( sqDist, tree ));
152 // find distance after which there is no sense to check tree's
153 double sqLimit = DBL_MAX;
154 TDistTreeMap::iterator sqDist_tree = treeMap.begin();
155 if ( treeMap.size() > 5 ) {
156 SMESH_OctreeNode* closestTree = sqDist_tree->second;
157 const Bnd_B3d& box = *closestTree->getBox();
158 double limit = sqrt( sqDist_tree->first ) + sqrt ( box.SquareExtent() );
159 sqLimit = limit * limit;
161 // get all nodes from trees
162 for ( ; sqDist_tree != treeMap.end(); ++sqDist_tree) {
163 if ( sqDist_tree->first > sqLimit )
165 SMESH_OctreeNode* tree = sqDist_tree->second;
166 tree->AllNodesAround( tree->GetNodeIterator()->next(), &nodes );
169 // find closest among nodes
171 const SMDS_MeshNode* closestNode = 0;
172 for ( size_t i = 0; i < nodes.size(); ++i )
174 double sqDist = thePnt.SquareDistance( SMESH_NodeXYZ( nodes[ i ]));
175 if ( minSqDist > sqDist ) {
176 closestNode = nodes[ i ];
183 //---------------------------------------------------------------------
185 * \brief Finds nodes located within a tolerance near a point
187 int FindNearPoint(const gp_Pnt& point,
188 const double tolerance,
189 std::vector< const SMDS_MeshNode* >& foundNodes)
191 myOctreeNode->NodesAround( point.Coord(), foundNodes, tolerance );
192 return foundNodes.size();
195 //---------------------------------------------------------------------
199 ~SMESH_NodeSearcherImpl() { delete myOctreeNode; }
201 //---------------------------------------------------------------------
203 * \brief Return the node tree
205 const SMESH_OctreeNode* getTree() const { return myOctreeNode; }
208 SMESH_OctreeNode* myOctreeNode;
210 double myHalfLeafSize; // max size of a leaf box
213 // ========================================================================
214 namespace // Utils used in SMESH_ElementSearcherImpl::FindElementsByPoint()
216 const int MaxNbElemsInLeaf = 10; // maximal number of elements in a leaf of tree
217 const int MaxLevel = 7; // maximal tree height -> nb terminal boxes: 8^7 = 2097152
218 const double NodeRadius = 1e-9; // to enlarge bnd box of element
220 //=======================================================================
222 * \brief Octal tree of bounding boxes of elements
224 //=======================================================================
226 class ElementBndBoxTree : public SMESH_Octree
230 typedef boost::container::flat_set< const SMDS_MeshElement*, TIDCompare > TElemSeq;
232 ElementBndBoxTree(const SMDS_Mesh& mesh,
233 SMDSAbs_ElementType elemType,
234 SMDS_ElemIteratorPtr theElemIt = SMDS_ElemIteratorPtr(),
235 double tolerance = NodeRadius );
236 void getElementsNearPoint( const gp_Pnt& point, TElemSeq& foundElems );
237 void getElementsNearLine ( const gp_Ax1& line, TElemSeq& foundElems );
238 void getElementsInBox ( const Bnd_B3d& box, TElemSeq& foundElems );
239 void getElementsInSphere ( const gp_XYZ& center, const double radius, TElemSeq& foundElems );
240 ElementBndBoxTree* getLeafAtPoint( const gp_XYZ& point );
243 ElementBndBoxTree() {}
244 SMESH_Octree* newChild() const { return new ElementBndBoxTree; }
245 void buildChildrenData();
246 Bnd_B3d* buildRootBox();
248 //!< Bounding box of element
249 struct ElementBox : public Bnd_B3d
251 const SMDS_MeshElement* _element;
252 void init(const SMDS_MeshElement* elem, double tolerance);
254 std::vector< ElementBox* > _elements;
256 typedef ObjectPool< ElementBox > TElementBoxPool;
258 //!< allocator of ElementBox's and SMESH_TreeLimit
259 struct LimitAndPool : public SMESH_TreeLimit
261 TElementBoxPool _elBoPool;
262 LimitAndPool():SMESH_TreeLimit( MaxLevel, /*minSize=*/0. ) {}
264 LimitAndPool* getLimitAndPool() const
266 SMESH_TreeLimit* limitAndPool = const_cast< SMESH_TreeLimit* >( myLimit );
267 return static_cast< LimitAndPool* >( limitAndPool );
271 //================================================================================
273 * \brief ElementBndBoxTree creation
275 //================================================================================
277 ElementBndBoxTree::ElementBndBoxTree(const SMDS_Mesh& mesh,
278 SMDSAbs_ElementType elemType,
279 SMDS_ElemIteratorPtr theElemIt,
281 :SMESH_Octree( new LimitAndPool() )
283 int nbElems = mesh.GetMeshInfo().NbElements( elemType );
284 _elements.reserve( nbElems );
286 TElementBoxPool& elBoPool = getLimitAndPool()->_elBoPool;
289 if ( theElemIt && !theElemIt->more() )
290 std::cout << "WARNING: ElementBndBoxTree constructed on empty iterator!" << std::endl;
293 SMDS_ElemIteratorPtr elemIt = theElemIt ? theElemIt : mesh.elementsIterator( elemType );
294 while ( elemIt->more() )
296 ElementBox* eb = elBoPool.getNew();
297 eb->init( elemIt->next(), tolerance );
298 _elements.push_back( eb );
303 //================================================================================
305 * \brief Return the maximal box
307 //================================================================================
309 Bnd_B3d* ElementBndBoxTree::buildRootBox()
311 Bnd_B3d* box = new Bnd_B3d;
312 for ( size_t i = 0; i < _elements.size(); ++i )
313 box->Add( *_elements[i] );
317 //================================================================================
319 * \brief Redistrubute element boxes among children
321 //================================================================================
323 void ElementBndBoxTree::buildChildrenData()
325 for ( size_t i = 0; i < _elements.size(); ++i )
327 for (int j = 0; j < 8; j++)
329 if ( !_elements[i]->IsOut( *myChildren[j]->getBox() ))
330 ((ElementBndBoxTree*)myChildren[j])->_elements.push_back( _elements[i]);
333 //_size = _elements.size();
334 SMESHUtils::FreeVector( _elements ); // = _elements.clear() + free memory
336 for (int j = 0; j < 8; j++)
338 ElementBndBoxTree* child = static_cast<ElementBndBoxTree*>( myChildren[j]);
339 if ((int) child->_elements.size() <= MaxNbElemsInLeaf )
340 child->myIsLeaf = true;
342 if ( child->isLeaf() && child->_elements.capacity() > child->_elements.size() )
343 SMESHUtils::CompactVector( child->_elements );
347 //================================================================================
349 * \brief Return elements which can include the point
351 //================================================================================
353 void ElementBndBoxTree::getElementsNearPoint( const gp_Pnt& point, TElemSeq& foundElems)
355 if ( getBox()->IsOut( point.XYZ() ))
360 for ( size_t i = 0; i < _elements.size(); ++i )
361 if ( !_elements[i]->IsOut( point.XYZ() ))
362 foundElems.insert( _elements[i]->_element );
366 for (int i = 0; i < 8; i++)
367 ((ElementBndBoxTree*) myChildren[i])->getElementsNearPoint( point, foundElems );
371 //================================================================================
373 * \brief Return elements which can be intersected by the line
375 //================================================================================
377 void ElementBndBoxTree::getElementsNearLine( const gp_Ax1& line, TElemSeq& foundElems )
379 if ( getBox()->IsOut( line ))
384 for ( size_t i = 0; i < _elements.size(); ++i )
385 if ( !_elements[i]->IsOut( line ) )
386 foundElems.insert( _elements[i]->_element );
390 for (int i = 0; i < 8; i++)
391 ((ElementBndBoxTree*) myChildren[i])->getElementsNearLine( line, foundElems );
395 //================================================================================
397 * \brief Return elements from leaves intersecting the sphere
399 //================================================================================
401 void ElementBndBoxTree::getElementsInSphere ( const gp_XYZ& center,
403 TElemSeq& foundElems)
405 if ( getBox()->IsOut( center, radius ))
410 for ( size_t i = 0; i < _elements.size(); ++i )
411 if ( !_elements[i]->IsOut( center, radius ))
412 foundElems.insert( _elements[i]->_element );
416 for (int i = 0; i < 8; i++)
417 ((ElementBndBoxTree*) myChildren[i])->getElementsInSphere( center, radius, foundElems );
421 //================================================================================
423 * \brief Return elements from leaves intersecting the box
425 //================================================================================
427 void ElementBndBoxTree::getElementsInBox( const Bnd_B3d& box, TElemSeq& foundElems )
429 if ( getBox()->IsOut( box ))
434 for ( size_t i = 0; i < _elements.size(); ++i )
435 if ( !_elements[i]->IsOut( box ))
436 foundElems.insert( _elements[i]->_element );
440 for (int i = 0; i < 8; i++)
441 ((ElementBndBoxTree*) myChildren[i])->getElementsInBox( box, foundElems );
445 //================================================================================
447 * \brief Return a leaf including a point
449 //================================================================================
451 ElementBndBoxTree* ElementBndBoxTree::getLeafAtPoint( const gp_XYZ& point )
453 if ( getBox()->IsOut( point ))
462 for (int i = 0; i < 8; i++)
463 if ( ElementBndBoxTree* l = ((ElementBndBoxTree*) myChildren[i])->getLeafAtPoint( point ))
469 //================================================================================
471 * \brief Construct the element box
473 //================================================================================
475 void ElementBndBoxTree::ElementBox::init(const SMDS_MeshElement* elem, double tolerance)
478 SMDS_ElemIteratorPtr nIt = elem->nodesIterator();
479 while ( nIt->more() )
480 Add( SMESH_NodeXYZ( nIt->next() ));
481 Enlarge( tolerance );
486 //=======================================================================
488 * \brief Implementation of search for the elements by point and
489 * of classification of point in 2D mesh
491 //=======================================================================
493 SMESH_ElementSearcher::~SMESH_ElementSearcher()
497 struct SMESH_ElementSearcherImpl: public SMESH_ElementSearcher
500 SMDS_ElemIteratorPtr _meshPartIt;
501 ElementBndBoxTree* _ebbTree [SMDSAbs_NbElementTypes];
502 int _ebbTreeHeight[SMDSAbs_NbElementTypes];
503 SMESH_NodeSearcherImpl* _nodeSearcher;
504 SMDSAbs_ElementType _elementType;
506 bool _outerFacesFound;
507 std::set<const SMDS_MeshElement*> _outerFaces; // empty means "no internal faces at all"
509 SMESH_ElementSearcherImpl( SMDS_Mesh& mesh,
511 SMDS_ElemIteratorPtr elemIt=SMDS_ElemIteratorPtr())
512 : _mesh(&mesh),_meshPartIt(elemIt),_nodeSearcher(0),_tolerance(tol),_outerFacesFound(false)
514 for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
517 _ebbTreeHeight[i] = -1;
519 _elementType = SMDSAbs_All;
521 virtual ~SMESH_ElementSearcherImpl()
523 for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
525 delete _ebbTree[i]; _ebbTree[i] = NULL;
527 if ( _nodeSearcher ) delete _nodeSearcher; _nodeSearcher = 0;
529 virtual int FindElementsByPoint(const gp_Pnt& point,
530 SMDSAbs_ElementType type,
531 std::vector< const SMDS_MeshElement* >& foundElements);
532 virtual TopAbs_State GetPointState(const gp_Pnt& point);
533 virtual const SMDS_MeshElement* FindClosestTo( const gp_Pnt& point,
534 SMDSAbs_ElementType type );
536 virtual void GetElementsNearLine( const gp_Ax1& line,
537 SMDSAbs_ElementType type,
538 std::vector< const SMDS_MeshElement* >& foundElems);
539 virtual void GetElementsInSphere( const gp_XYZ& center,
541 SMDSAbs_ElementType type,
542 std::vector< const SMDS_MeshElement* >& foundElems);
543 virtual void GetElementsInBox( const Bnd_B3d& box,
544 SMDSAbs_ElementType type,
545 std::vector< const SMDS_MeshElement* >& foundElems);
546 virtual gp_XYZ Project(const gp_Pnt& point,
547 SMDSAbs_ElementType type,
548 const SMDS_MeshElement** closestElem);
549 double getTolerance();
550 bool getIntersParamOnLine(const gp_Lin& line, const SMDS_MeshElement* face,
551 const double tolerance, double & param);
552 void findOuterBoundary(const SMDS_MeshElement* anyOuterFace);
553 bool isOuterBoundary(const SMDS_MeshElement* face) const
555 return _outerFaces.empty() || _outerFaces.count(face);
559 if ( _ebbTreeHeight[ _elementType ] < 0 )
560 _ebbTreeHeight[ _elementType ] = _ebbTree[ _elementType ]->getHeight();
561 return _ebbTreeHeight[ _elementType ];
564 struct TInters //!< data of intersection of the line and the mesh face (used in GetPointState())
566 const SMDS_MeshElement* _face;
568 bool _coincides; //!< the line lays in face plane
569 TInters(const SMDS_MeshElement* face, const gp_Vec& faceNorm, bool coinc=false)
570 : _face(face), _faceNorm( faceNorm ), _coincides( coinc ) {}
572 struct TFaceLink //!< link and faces sharing it (used in findOuterBoundary())
575 TIDSortedElemSet _faces;
576 TFaceLink( const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshElement* face)
577 : _link( n1, n2 ), _faces( &face, &face + 1) {}
581 ostream& operator<< (ostream& out, const SMESH_ElementSearcherImpl::TInters& i)
583 return out << "TInters(face=" << ( i._face ? i._face->GetID() : 0)
584 << ", _coincides="<<i._coincides << ")";
587 //=======================================================================
589 * \brief define tolerance for search
591 //=======================================================================
593 double SMESH_ElementSearcherImpl::getTolerance()
595 if ( _tolerance < 0 )
597 const SMDS_MeshInfo& meshInfo = _mesh->GetMeshInfo();
600 if ( _nodeSearcher && meshInfo.NbNodes() > 1 )
602 double boxSize = _nodeSearcher->getTree()->maxSize();
603 _tolerance = 1e-8 * boxSize/* / meshInfo.NbNodes()*/;
605 else if ( _ebbTree[_elementType] && meshInfo.NbElements() > 0 )
607 double boxSize = _ebbTree[_elementType]->maxSize();
608 _tolerance = 1e-8 * boxSize/* / meshInfo.NbElements()*/;
610 if ( _tolerance == 0 )
612 // define tolerance by size of a most complex element
613 int complexType = SMDSAbs_Volume;
614 while ( complexType > SMDSAbs_All &&
615 meshInfo.NbElements( SMDSAbs_ElementType( complexType )) < 1 )
617 if ( complexType == SMDSAbs_All ) return 0; // empty mesh
619 if ( complexType == int( SMDSAbs_Node ))
621 SMDS_NodeIteratorPtr nodeIt = _mesh->nodesIterator();
623 if ( meshInfo.NbNodes() > 2 )
624 elemSize = SMESH_TNodeXYZ( nodeIt->next() ).Distance( nodeIt->next() );
628 SMDS_ElemIteratorPtr elemIt = _mesh->elementsIterator( SMDSAbs_ElementType( complexType ));
629 const SMDS_MeshElement* elem = elemIt->next();
630 SMDS_ElemIteratorPtr nodeIt = elem->nodesIterator();
631 SMESH_TNodeXYZ n1( nodeIt->next() );
633 while ( nodeIt->more() )
635 double dist = n1.Distance( static_cast<const SMDS_MeshNode*>( nodeIt->next() ));
636 elemSize = std::max( dist, elemSize );
639 _tolerance = 1e-4 * elemSize;
645 //================================================================================
647 * \brief Find intersection of the line and an edge of face and return parameter on line
649 //================================================================================
651 bool SMESH_ElementSearcherImpl::getIntersParamOnLine(const gp_Lin& line,
652 const SMDS_MeshElement* face,
659 GeomAPI_ExtremaCurveCurve anExtCC;
660 Handle(Geom_Curve) lineCurve = new Geom_Line( line );
662 int nbNodes = face->IsQuadratic() ? face->NbNodes()/2 : face->NbNodes();
663 for ( int i = 0; i < nbNodes && nbInts < 2; ++i )
665 GC_MakeSegment edge( SMESH_TNodeXYZ( face->GetNode( i )),
666 SMESH_TNodeXYZ( face->GetNode( (i+1)%nbNodes) ));
667 anExtCC.Init( lineCurve, edge.Value() );
668 if ( anExtCC.NbExtrema() > 0 && anExtCC.LowerDistance() <= tol)
670 Standard_Real pl, pe;
671 anExtCC.LowerDistanceParameters( pl, pe );
677 if ( nbInts > 0 ) param /= nbInts;
680 //================================================================================
682 * \brief Find all faces belonging to the outer boundary of mesh
684 //================================================================================
686 void SMESH_ElementSearcherImpl::findOuterBoundary(const SMDS_MeshElement* outerFace)
688 if ( _outerFacesFound ) return;
690 // Collect all outer faces by passing from one outer face to another via their links
691 // and BTW find out if there are internal faces at all.
693 // checked links and links where outer boundary meets internal one
694 std::set< SMESH_TLink > visitedLinks, seamLinks;
696 // links to treat with already visited faces sharing them
697 std::list < TFaceLink > startLinks;
699 // load startLinks with the first outerFace
700 startLinks.push_back( TFaceLink( outerFace->GetNode(0), outerFace->GetNode(1), outerFace));
701 _outerFaces.insert( outerFace );
703 TIDSortedElemSet emptySet;
704 while ( !startLinks.empty() )
706 const SMESH_TLink& link = startLinks.front()._link;
707 TIDSortedElemSet& faces = startLinks.front()._faces;
709 outerFace = *faces.begin();
710 // find other faces sharing the link
711 const SMDS_MeshElement* f;
712 while (( f = SMESH_MeshAlgos::FindFaceInSet(link.node1(), link.node2(), emptySet, faces )))
715 // select another outer face among the found
716 const SMDS_MeshElement* outerFace2 = 0;
717 if ( faces.size() == 2 )
719 outerFace2 = (outerFace == *faces.begin() ? *faces.rbegin() : *faces.begin());
721 else if ( faces.size() > 2 )
723 seamLinks.insert( link );
725 // link direction within the outerFace
726 gp_Vec n1n2( SMESH_TNodeXYZ( link.node1()),
727 SMESH_TNodeXYZ( link.node2()));
728 int i1 = outerFace->GetNodeIndex( link.node1() );
729 int i2 = outerFace->GetNodeIndex( link.node2() );
730 bool rev = ( abs(i2-i1) == 1 ? i1 > i2 : i2 > i1 );
731 if ( rev ) n1n2.Reverse();
733 gp_XYZ ofNorm, fNorm;
734 if ( SMESH_MeshAlgos::FaceNormal( outerFace, ofNorm, /*normalized=*/false ))
736 // direction from the link inside outerFace
737 gp_Vec dirInOF = gp_Vec( ofNorm ) ^ n1n2;
738 // sort all other faces by angle with the dirInOF
739 std::map< double, const SMDS_MeshElement* > angle2Face;
740 std::set< const SMDS_MeshElement*, TIDCompare >::const_iterator face = faces.begin();
741 for ( ; face != faces.end(); ++face )
743 if ( *face == outerFace ) continue;
744 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false ))
746 gp_Vec dirInF = gp_Vec( fNorm ) ^ n1n2;
747 double angle = dirInOF.AngleWithRef( dirInF, n1n2 );
748 if ( angle < 0 ) angle += 2. * M_PI;
749 angle2Face.insert( std::make_pair( angle, *face ));
751 if ( !angle2Face.empty() )
752 outerFace2 = angle2Face.begin()->second;
755 // store the found outer face and add its links to continue searching from
758 _outerFaces.insert( outerFace2 );
759 int nbNodes = outerFace2->NbCornerNodes();
760 for ( int i = 0; i < nbNodes; ++i )
762 SMESH_TLink link2( outerFace2->GetNode(i), outerFace2->GetNode((i+1)%nbNodes));
763 if ( visitedLinks.insert( link2 ).second )
764 startLinks.push_back( TFaceLink( link2.node1(), link2.node2(), outerFace2 ));
767 startLinks.pop_front();
769 _outerFacesFound = true;
771 if ( !seamLinks.empty() )
773 // There are internal boundaries touching the outher one,
774 // find all faces of internal boundaries in order to find
775 // faces of boundaries of holes, if any.
784 //=======================================================================
786 * \brief Find elements of given type where the given point is IN or ON.
787 * Returns nb of found elements and elements them-selves.
789 * 'ALL' type means elements of any type excluding nodes, balls and 0D elements
791 //=======================================================================
793 int SMESH_ElementSearcherImpl::
794 FindElementsByPoint(const gp_Pnt& point,
795 SMDSAbs_ElementType type,
796 std::vector< const SMDS_MeshElement* >& foundElements)
798 foundElements.clear();
801 double tolerance = getTolerance();
803 // =================================================================================
804 if ( type == SMDSAbs_Node || type == SMDSAbs_0DElement || type == SMDSAbs_Ball)
806 if ( !_nodeSearcher )
809 _nodeSearcher = new SMESH_NodeSearcherImpl( 0, _meshPartIt );
811 _nodeSearcher = new SMESH_NodeSearcherImpl( _mesh );
813 std::vector< const SMDS_MeshNode* > foundNodes;
814 _nodeSearcher->FindNearPoint( point, tolerance, foundNodes );
816 if ( type == SMDSAbs_Node )
818 foundElements.assign( foundNodes.begin(), foundNodes.end() );
822 for ( size_t i = 0; i < foundNodes.size(); ++i )
824 SMDS_ElemIteratorPtr elemIt = foundNodes[i]->GetInverseElementIterator( type );
825 while ( elemIt->more() )
826 foundElements.push_back( elemIt->next() );
830 // =================================================================================
831 else // elements more complex than 0D
833 if ( !_ebbTree[type] )
835 _ebbTree[_elementType] = new ElementBndBoxTree( *_mesh, type, _meshPartIt, tolerance );
837 ElementBndBoxTree::TElemSeq suspectElems;
838 _ebbTree[ type ]->getElementsNearPoint( point, suspectElems );
839 ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
840 for ( ; elem != suspectElems.end(); ++elem )
841 if ( !SMESH_MeshAlgos::IsOut( *elem, point, tolerance ))
842 foundElements.push_back( *elem );
844 return foundElements.size();
847 //=======================================================================
849 * \brief Find an element of given type most close to the given point
851 * WARNING: Only face search is implemeneted so far
853 //=======================================================================
855 const SMDS_MeshElement*
856 SMESH_ElementSearcherImpl::FindClosestTo( const gp_Pnt& point,
857 SMDSAbs_ElementType type )
859 const SMDS_MeshElement* closestElem = 0;
862 if ( type == SMDSAbs_Face ||
863 type == SMDSAbs_Volume ||
864 type == SMDSAbs_Edge )
866 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
868 ebbTree = new ElementBndBoxTree( *_mesh, type, _meshPartIt );
870 ElementBndBoxTree::TElemSeq suspectElems;
871 ebbTree->getElementsNearPoint( point, suspectElems );
873 if ( suspectElems.empty() && ebbTree->maxSize() > 0 )
875 gp_Pnt boxCenter = 0.5 * ( ebbTree->getBox()->CornerMin() +
876 ebbTree->getBox()->CornerMax() );
878 if ( ebbTree->getBox()->IsOut( point.XYZ() ))
879 radius = point.Distance( boxCenter ) - 0.5 * ebbTree->maxSize();
881 radius = ebbTree->maxSize() / pow( 2., getTreeHeight()) / 2;
882 while ( suspectElems.empty() && radius < 1e100 )
884 ebbTree->getElementsInSphere( point.XYZ(), radius, suspectElems );
888 double minDist = std::numeric_limits<double>::max();
889 std::multimap< double, const SMDS_MeshElement* > dist2face;
890 ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
891 for ( ; elem != suspectElems.end(); ++elem )
893 double dist = SMESH_MeshAlgos::GetDistance( *elem, point );
894 if ( dist < minDist + 1e-10)
897 dist2face.insert( dist2face.begin(), std::make_pair( dist, *elem ));
900 if ( !dist2face.empty() )
902 std::multimap< double, const SMDS_MeshElement* >::iterator d2f = dist2face.begin();
903 closestElem = d2f->second;
904 // if there are several elements at the same distance, select one
905 // with GC closest to the point
906 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
907 double minDistToGC = 0;
908 for ( ++d2f; d2f != dist2face.end() && fabs( d2f->first - minDist ) < 1e-10; ++d2f )
910 if ( minDistToGC == 0 )
913 gc = accumulate( TXyzIterator(closestElem->nodesIterator()),
914 TXyzIterator(), gc ) / closestElem->NbNodes();
915 minDistToGC = point.SquareDistance( gc );
918 gc = accumulate( TXyzIterator( d2f->second->nodesIterator()),
919 TXyzIterator(), gc ) / d2f->second->NbNodes();
920 double d = point.SquareDistance( gc );
921 if ( d < minDistToGC )
924 closestElem = d2f->second;
927 // cout << "FindClosestTo( " <<point.X()<<", "<<point.Y()<<", "<<point.Z()<<" ) FACE "
928 // <<closestElem->GetID() << " DIST " << minDist << endl;
933 // NOT IMPLEMENTED SO FAR
939 //================================================================================
941 * \brief Classify the given point in the closed 2D mesh
943 //================================================================================
945 TopAbs_State SMESH_ElementSearcherImpl::GetPointState(const gp_Pnt& point)
947 _elementType = SMDSAbs_Face;
949 double tolerance = getTolerance();
951 ElementBndBoxTree*& ebbTree = _ebbTree[ SMDSAbs_Face ];
953 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
955 // Algo: analyse transition of a line starting at the point through mesh boundary;
956 // try three lines parallel to axis of the coordinate system and perform rough
957 // analysis. If solution is not clear perform thorough analysis.
959 const int nbAxes = 3;
960 gp_Dir axisDir[ nbAxes ] = { gp::DX(), gp::DY(), gp::DZ() };
961 std::map< double, TInters > paramOnLine2TInters[ nbAxes ];
962 std::list< TInters > tangentInters[ nbAxes ]; // of faces whose plane includes the line
963 std::multimap< int, int > nbInt2Axis; // to find the simplest case
964 for ( int axis = 0; axis < nbAxes; ++axis )
966 gp_Ax1 lineAxis( point, axisDir[axis]);
967 gp_Lin line ( lineAxis );
969 ElementBndBoxTree::TElemSeq suspectFaces; // faces possibly intersecting the line
970 ebbTree->getElementsNearLine( lineAxis, suspectFaces );
972 // Intersect faces with the line
974 std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
975 ElementBndBoxTree::TElemSeq::iterator face = suspectFaces.begin();
976 for ( ; face != suspectFaces.end(); ++face )
980 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false)) continue;
981 gp_Pln facePlane( SMESH_TNodeXYZ( (*face)->GetNode(0)), fNorm );
983 // perform intersection
984 IntAna_IntConicQuad intersection( line, IntAna_Quadric( facePlane ));
985 if ( !intersection.IsDone() )
987 if ( intersection.IsInQuadric() )
989 tangentInters[ axis ].push_back( TInters( *face, fNorm, true ));
991 else if ( ! intersection.IsParallel() && intersection.NbPoints() > 0 )
993 double tol = 1e-4 * Sqrt( fNorm.Modulus() );
994 gp_Pnt intersectionPoint = intersection.Point(1);
995 if ( !SMESH_MeshAlgos::IsOut( *face, intersectionPoint, tol ))
996 u2inters.insert( std::make_pair( intersection.ParamOnConic(1), TInters( *face, fNorm )));
999 // Analyse intersections roughly
1001 int nbInter = u2inters.size();
1005 double f = u2inters.begin()->first, l = u2inters.rbegin()->first;
1006 if ( nbInter == 1 ) // not closed mesh
1007 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
1009 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
1012 if ( (f<0) == (l<0) )
1015 int nbIntBeforePoint = std::distance( u2inters.begin(), u2inters.lower_bound(0));
1016 int nbIntAfterPoint = nbInter - nbIntBeforePoint;
1017 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
1020 nbInt2Axis.insert( std::make_pair( std::min( nbIntBeforePoint, nbIntAfterPoint ), axis ));
1022 if ( _outerFacesFound ) break; // pass to thorough analysis
1024 } // three attempts - loop on CS axes
1026 // Analyse intersections thoroughly.
1027 // We make two loops maximum, on the first one we only exclude touching intersections,
1028 // on the second, if situation is still unclear, we gather and use information on
1029 // position of faces (internal or outer). If faces position is already gathered,
1030 // we make the second loop right away.
1032 for ( int hasPositionInfo = _outerFacesFound; hasPositionInfo < 2; ++hasPositionInfo )
1034 std::multimap< int, int >::const_iterator nb_axis = nbInt2Axis.begin();
1035 for ( ; nb_axis != nbInt2Axis.end(); ++nb_axis )
1037 int axis = nb_axis->second;
1038 std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
1040 gp_Ax1 lineAxis( point, axisDir[axis]);
1041 gp_Lin line ( lineAxis );
1043 // add tangent intersections to u2inters
1045 std::list< TInters >::const_iterator tgtInt = tangentInters[ axis ].begin();
1046 for ( ; tgtInt != tangentInters[ axis ].end(); ++tgtInt )
1047 if ( getIntersParamOnLine( line, tgtInt->_face, tolerance, param ))
1048 u2inters.insert( std::make_pair( param, *tgtInt ));
1049 tangentInters[ axis ].clear();
1051 // Count intersections before and after the point excluding touching ones.
1052 // If hasPositionInfo we count intersections of outer boundary only
1054 int nbIntBeforePoint = 0, nbIntAfterPoint = 0;
1055 double f = std::numeric_limits<double>::max(), l = -std::numeric_limits<double>::max();
1056 std::map< double, TInters >::iterator u_int1 = u2inters.begin(), u_int2 = u_int1;
1057 bool ok = ! u_int1->second._coincides;
1058 while ( ok && u_int1 != u2inters.end() )
1060 double u = u_int1->first;
1061 bool touchingInt = false;
1062 if ( ++u_int2 != u2inters.end() )
1064 // skip intersections at the same point (if the line passes through edge or node)
1066 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u ) < tolerance )
1072 // skip tangent intersections
1074 if ( u_int2 != u2inters.end() )
1076 const SMDS_MeshElement* prevFace = u_int1->second._face;
1077 while ( ok && u_int2->second._coincides )
1079 if ( SMESH_MeshAlgos::GetCommonNodes(prevFace , u_int2->second._face).empty() )
1085 ok = ( u_int2 != u2inters.end() );
1091 // skip intersections at the same point after tangent intersections
1094 double u2 = u_int2->first;
1096 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u2 ) < tolerance )
1102 // decide if we skipped a touching intersection
1103 if ( nbSamePnt + nbTgt > 0 )
1105 double minDot = std::numeric_limits<double>::max(), maxDot = -minDot;
1106 std::map< double, TInters >::iterator u_int = u_int1;
1107 for ( ; u_int != u_int2; ++u_int )
1109 if ( u_int->second._coincides ) continue;
1110 double dot = u_int->second._faceNorm * line.Direction();
1111 if ( dot > maxDot ) maxDot = dot;
1112 if ( dot < minDot ) minDot = dot;
1114 touchingInt = ( minDot*maxDot < 0 );
1119 if ( !hasPositionInfo || isOuterBoundary( u_int1->second._face ))
1130 u_int1 = u_int2; // to next intersection
1132 } // loop on intersections with one line
1136 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
1139 if ( nbIntBeforePoint == 0 || nbIntAfterPoint == 0)
1142 if ( nbIntBeforePoint + nbIntAfterPoint == 1 ) // not closed mesh
1143 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
1145 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
1148 if ( (f<0) == (l<0) )
1151 if ( hasPositionInfo )
1152 return nbIntBeforePoint % 2 ? TopAbs_IN : TopAbs_OUT;
1154 } // loop on intersections of the tree lines - thorough analysis
1156 if ( !hasPositionInfo )
1158 // gather info on faces position - is face in the outer boundary or not
1159 std::map< double, TInters > & u2inters = paramOnLine2TInters[ 0 ];
1160 findOuterBoundary( u2inters.begin()->second._face );
1163 } // two attempts - with and w/o faces position info in the mesh
1165 return TopAbs_UNKNOWN;
1168 //=======================================================================
1170 * \brief Return elements possibly intersecting the line
1172 //=======================================================================
1174 void SMESH_ElementSearcherImpl::
1175 GetElementsNearLine( const gp_Ax1& line,
1176 SMDSAbs_ElementType type,
1177 std::vector< const SMDS_MeshElement* >& foundElems)
1179 _elementType = type;
1180 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1182 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1184 ElementBndBoxTree::TElemSeq elems;
1185 ebbTree->getElementsNearLine( line, elems );
1187 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1190 //=======================================================================
1192 * Return elements whose bounding box intersects a sphere
1194 //=======================================================================
1196 void SMESH_ElementSearcherImpl::
1197 GetElementsInSphere( const gp_XYZ& center,
1198 const double radius,
1199 SMDSAbs_ElementType type,
1200 std::vector< const SMDS_MeshElement* >& foundElems)
1202 _elementType = type;
1203 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1205 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1207 ElementBndBoxTree::TElemSeq elems;
1208 ebbTree->getElementsInSphere( center, radius, elems );
1210 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1213 //=======================================================================
1215 * Return elements whose bounding box intersects a given bounding box
1217 //=======================================================================
1219 void SMESH_ElementSearcherImpl::
1220 GetElementsInBox( const Bnd_B3d& box,
1221 SMDSAbs_ElementType type,
1222 std::vector< const SMDS_MeshElement* >& foundElems)
1224 _elementType = type;
1225 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1227 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt, getTolerance() );
1229 ElementBndBoxTree::TElemSeq elems;
1230 ebbTree->getElementsInBox( box, elems );
1232 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1235 //=======================================================================
1237 * \brief Return a projection of a given point to a mesh.
1238 * Optionally return the closest element
1240 //=======================================================================
1242 gp_XYZ SMESH_ElementSearcherImpl::Project(const gp_Pnt& point,
1243 SMDSAbs_ElementType type,
1244 const SMDS_MeshElement** closestElem)
1246 _elementType = type;
1247 if ( _mesh->GetMeshInfo().NbElements( _elementType ) == 0 )
1248 throw SALOME_Exception( LOCALIZED( "No elements of given type in the mesh" ));
1250 ElementBndBoxTree*& ebbTree = _ebbTree[ _elementType ];
1252 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1254 gp_XYZ p = point.XYZ();
1255 ElementBndBoxTree* ebbLeaf = ebbTree->getLeafAtPoint( p );
1256 const Bnd_B3d* box = ebbLeaf ? ebbLeaf->getBox() : ebbTree->getBox();
1257 double radius = ( box->CornerMax() - box->CornerMin() ).Modulus();
1259 ElementBndBoxTree::TElemSeq elems;
1260 ebbTree->getElementsInSphere( p, radius, elems );
1261 while ( elems.empty() && radius < 1e100 )
1264 ebbTree->getElementsInSphere( p, radius, elems );
1266 gp_XYZ proj, bestProj;
1267 const SMDS_MeshElement* elem = 0;
1268 double minDist = 2 * radius;
1269 ElementBndBoxTree::TElemSeq::iterator e = elems.begin();
1270 for ( ; e != elems.end(); ++e )
1272 double d = SMESH_MeshAlgos::GetDistance( *e, point, &proj );
1280 if ( closestElem ) *closestElem = elem;
1285 //=======================================================================
1287 * \brief Return true if the point is IN or ON of the element
1289 //=======================================================================
1291 bool SMESH_MeshAlgos::IsOut( const SMDS_MeshElement* element, const gp_Pnt& point, double tol )
1293 if ( element->GetType() == SMDSAbs_Volume)
1295 return SMDS_VolumeTool( element ).IsOut( point.X(), point.Y(), point.Z(), tol );
1298 // get ordered nodes
1300 std::vector< SMESH_TNodeXYZ > xyz; xyz.reserve( element->NbNodes()+1 );
1302 SMDS_NodeIteratorPtr nodeIt = element->interlacedNodesIterator();
1303 for ( int i = 0; nodeIt->more(); ++i )
1304 xyz.push_back( SMESH_TNodeXYZ( nodeIt->next() ));
1306 int i, nbNodes = (int) xyz.size(); // central node of biquadratic is missing
1308 if ( element->GetType() == SMDSAbs_Face ) // --------------------------------------------------
1310 // compute face normal
1311 gp_Vec faceNorm(0,0,0);
1312 xyz.push_back( xyz.front() );
1313 for ( i = 0; i < nbNodes; ++i )
1315 gp_Vec edge1( xyz[i+1], xyz[i]);
1316 gp_Vec edge2( xyz[i+1], xyz[(i+2)%nbNodes] );
1317 faceNorm += edge1 ^ edge2;
1319 double fNormSize = faceNorm.Magnitude();
1320 if ( fNormSize <= tol )
1322 // degenerated face: point is out if it is out of all face edges
1323 for ( i = 0; i < nbNodes; ++i )
1325 SMDS_LinearEdge edge( xyz[i]._node, xyz[i+1]._node );
1326 if ( !IsOut( &edge, point, tol ))
1331 faceNorm /= fNormSize;
1333 // check if the point lays on face plane
1334 gp_Vec n2p( xyz[0], point );
1335 double dot = n2p * faceNorm;
1336 if ( Abs( dot ) > tol ) // not on face plane
1339 if ( nbNodes > 3 ) // maybe the face is not planar
1341 double elemThick = 0;
1342 for ( i = 1; i < nbNodes; ++i )
1344 gp_Vec n2n( xyz[0], xyz[i] );
1345 elemThick = Max( elemThick, Abs( n2n * faceNorm ));
1347 isOut = Abs( dot ) > elemThick + tol;
1353 // check if point is out of face boundary:
1354 // define it by closest transition of a ray point->infinity through face boundary
1355 // on the face plane.
1356 // First, find normal of a plane perpendicular to face plane, to be used as a cutting tool
1357 // to find intersections of the ray with the boundary.
1359 gp_Vec plnNorm = ray ^ faceNorm;
1360 double n2pSize = plnNorm.Magnitude();
1361 if ( n2pSize <= tol ) return false; // point coincides with the first node
1362 if ( n2pSize * n2pSize > fNormSize * 100 ) return true; // point is very far
1364 // for each node of the face, compute its signed distance to the cutting plane
1365 std::vector<double> dist( nbNodes + 1);
1366 for ( i = 0; i < nbNodes; ++i )
1368 gp_Vec n2p( xyz[i], point );
1369 dist[i] = n2p * plnNorm;
1371 dist.back() = dist.front();
1372 // find the closest intersection
1374 double rClosest = 0, distClosest = 1e100;
1376 for ( i = 0; i < nbNodes; ++i )
1379 if ( fabs( dist[i] ) < tol )
1381 else if ( fabs( dist[i+1]) < tol )
1383 else if ( dist[i] * dist[i+1] < 0 )
1384 r = dist[i] / ( dist[i] - dist[i+1] );
1386 continue; // no intersection
1387 gp_Pnt pInt = xyz[i] * (1.-r) + xyz[i+1] * r;
1388 gp_Vec p2int( point, pInt);
1389 double intDist = p2int.SquareMagnitude();
1390 if ( intDist < distClosest )
1395 distClosest = intDist;
1399 return true; // no intesections - out
1401 // analyse transition
1402 gp_Vec edge( xyz[iClosest], xyz[iClosest+1] );
1403 gp_Vec edgeNorm = -( edge ^ faceNorm ); // normal to intersected edge pointing out of face
1404 gp_Vec p2int ( point, pClosest );
1405 bool out = (edgeNorm * p2int) < -tol;
1406 if ( rClosest > 0. && rClosest < 1. ) // not node intersection
1409 // the ray passes through a face node; analyze transition through an adjacent edge
1410 gp_Pnt p1 = xyz[ (rClosest == 0.) ? ((iClosest+nbNodes-1) % nbNodes) : (iClosest+1) ];
1411 gp_Pnt p2 = xyz[ (rClosest == 0.) ? iClosest : ((iClosest+2) % nbNodes) ];
1412 gp_Vec edgeAdjacent( p1, p2 );
1413 gp_Vec edgeNorm2 = -( edgeAdjacent ^ faceNorm );
1414 bool out2 = (edgeNorm2 * p2int) < -tol;
1416 bool covexCorner = ( edgeNorm * edgeAdjacent * (rClosest==1. ? 1. : -1.)) < 0;
1417 return covexCorner ? (out || out2) : (out && out2);
1420 if ( element->GetType() == SMDSAbs_Edge ) // --------------------------------------------------
1422 // point is out of edge if it is NOT ON any straight part of edge
1423 // (we consider quadratic edge as being composed of two straight parts)
1424 for ( i = 1; i < nbNodes; ++i )
1426 gp_Vec edge( xyz[i-1], xyz[i] );
1427 gp_Vec n1p ( xyz[i-1], point );
1428 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1430 if ( n1p.SquareMagnitude() < tol * tol )
1435 if ( point.SquareDistance( xyz[i] ) < tol * tol )
1439 gp_XYZ proj = ( 1. - u ) * xyz[i-1] + u * xyz[i]; // projection of the point on the edge
1440 double dist2 = point.SquareDistance( proj );
1441 if ( dist2 > tol * tol )
1443 return false; // point is ON this part
1448 // Node or 0D element -------------------------------------------------------------------------
1450 gp_Vec n2p ( xyz[0], point );
1451 return n2p.SquareMagnitude() > tol * tol;
1456 //=======================================================================
1459 // Position of a point relative to a segment
1463 // VERTEX 1 o----ON-----> VERTEX 2
1467 enum PositionName { POS_LEFT = 1, POS_VERTEX = 2, POS_RIGHT = 4, //POS_ON = 8,
1468 POS_ALL = POS_LEFT | POS_RIGHT | POS_VERTEX,
1469 POS_MAX = POS_RIGHT };
1473 int _index; // index of vertex or segment
1475 PointPos( PositionName n, int i=-1 ): _name(n), _index(i) {}
1476 bool operator < (const PointPos& other ) const
1478 if ( _name == other._name )
1479 return ( _index < 0 || other._index < 0 ) ? false : _index < other._index;
1480 return _name < other._name;
1484 //================================================================================
1486 * \brief Return position of a point relative to a segment
1487 * \param point2D - the point to analyze position of
1488 * \param segEnds - end points of segments
1489 * \param index0 - 0-based index of the first point of segment
1490 * \param posToFindOut - flags of positions to detect
1491 * \retval PointPos - point position
1493 //================================================================================
1495 PointPos getPointPosition( const gp_XY& point2D,
1496 const gp_XY* segEnds,
1497 const int index0 = 0,
1498 const int posToFindOut = POS_ALL)
1500 const gp_XY& p1 = segEnds[ index0 ];
1501 const gp_XY& p2 = segEnds[ index0+1 ];
1502 const gp_XY grad = p2 - p1;
1504 if ( posToFindOut & POS_VERTEX )
1506 // check if the point2D is at "vertex 1" zone
1507 gp_XY pp1[2] = { p1, gp_XY( p1.X() - grad.Y(),
1508 p1.Y() + grad.X() ) };
1509 if ( getPointPosition( point2D, pp1, 0, POS_LEFT|POS_RIGHT )._name == POS_LEFT )
1510 return PointPos( POS_VERTEX, index0 );
1512 // check if the point2D is at "vertex 2" zone
1513 gp_XY pp2[2] = { p2, gp_XY( p2.X() - grad.Y(),
1514 p2.Y() + grad.X() ) };
1515 if ( getPointPosition( point2D, pp2, 0, POS_LEFT|POS_RIGHT )._name == POS_RIGHT )
1516 return PointPos( POS_VERTEX, index0 + 1);
1518 double edgeEquation =
1519 ( point2D.X() - p1.X() ) * grad.Y() - ( point2D.Y() - p1.Y() ) * grad.X();
1520 return PointPos( edgeEquation < 0 ? POS_LEFT : POS_RIGHT, index0 );
1524 //=======================================================================
1526 * \brief Return minimal distance from a point to an element
1528 * Currently we ignore non-planarity and 2nd order of face
1530 //=======================================================================
1532 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshElement* elem,
1533 const gp_Pnt& point,
1534 gp_XYZ* closestPnt )
1536 switch ( elem->GetType() )
1538 case SMDSAbs_Volume:
1539 return GetDistance( static_cast<const SMDS_MeshVolume*>( elem ), point, closestPnt );
1541 return GetDistance( static_cast<const SMDS_MeshFace*>( elem ), point, closestPnt );
1543 return GetDistance( static_cast<const SMDS_MeshEdge*>( elem ), point, closestPnt );
1545 if ( closestPnt ) *closestPnt = SMESH_TNodeXYZ( elem );
1546 return point.Distance( SMESH_TNodeXYZ( elem ));
1552 //=======================================================================
1554 * \brief Return minimal distance from a point to a face
1556 * Currently we ignore non-planarity and 2nd order of face
1558 //=======================================================================
1560 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshFace* face,
1561 const gp_Pnt& point,
1562 gp_XYZ* closestPnt )
1564 const double badDistance = -1;
1565 if ( !face ) return badDistance;
1567 int nbCorners = face->NbCornerNodes();
1568 if ( nbCorners > 3 )
1570 std::vector< const SMDS_MeshNode* > nodes;
1571 int nbTria = SMESH_MeshAlgos::Triangulate().GetTriangles( face, nodes );
1573 double minDist = Precision::Infinite();
1575 for ( int i = 0; i < 3 * nbTria; i += 3 )
1577 SMDS_FaceOfNodes triangle( nodes[i], nodes[i+1], nodes[i+2] );
1578 double dist = GetDistance( &triangle, point, closestPnt );
1579 if ( dist < minDist )
1592 // coordinates of nodes (medium nodes, if any, ignored)
1593 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
1594 std::vector<gp_XYZ> xyz( TXyzIterator( face->nodesIterator()), TXyzIterator() );
1597 // transformation to get xyz[0] lies on the origin, xyz[1] lies on the Z axis,
1598 // and xyz[2] lies in the XZ plane. This is to pass to 2D space on XZ plane.
1600 gp_Vec OZ ( xyz[0], xyz[1] );
1601 gp_Vec OX ( xyz[0], xyz[2] );
1602 if ( OZ.Magnitude() < std::numeric_limits<double>::min() )
1604 if ( xyz.size() < 4 ) return badDistance;
1605 OZ = gp_Vec ( xyz[0], xyz[2] );
1606 OX = gp_Vec ( xyz[0], xyz[3] );
1610 tgtCS = gp_Ax3( xyz[0], OZ, OX );
1612 catch ( Standard_Failure ) {
1615 trsf.SetTransformation( tgtCS );
1617 // move all the nodes to 2D
1618 std::vector<gp_XY> xy( xyz.size() );
1619 for ( size_t i = 0; i < 3; ++i )
1621 gp_XYZ p3d = xyz[i];
1622 trsf.Transforms( p3d );
1623 xy[i].SetCoord( p3d.X(), p3d.Z() );
1625 xyz.back() = xyz.front();
1626 xy.back() = xy.front();
1628 // // move the point in 2D
1629 gp_XYZ tmpPnt = point.XYZ();
1630 trsf.Transforms( tmpPnt );
1631 gp_XY point2D( tmpPnt.X(), tmpPnt.Z() );
1633 // loop on edges of the face to analyze point position ralative to the face
1634 std::vector< PointPos > pntPosByType[ POS_MAX + 1 ];
1635 for ( size_t i = 1; i < xy.size(); ++i )
1637 PointPos pos = getPointPosition( point2D, &xy[0], i-1 );
1638 pntPosByType[ pos._name ].push_back( pos );
1643 double dist = badDistance;
1645 if ( pntPosByType[ POS_LEFT ].size() > 0 ) // point is most close to an edge
1647 PointPos& pos = pntPosByType[ POS_LEFT ][0];
1649 gp_Vec edge( xyz[ pos._index ], xyz[ pos._index+1 ]);
1650 gp_Vec n1p ( xyz[ pos._index ], point );
1651 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1652 gp_XYZ proj = xyz[ pos._index ] + u * edge.XYZ(); // projection on the edge
1653 dist = point.Distance( proj );
1654 if ( closestPnt ) *closestPnt = proj;
1657 else if ( pntPosByType[ POS_RIGHT ].size() >= 2 ) // point is inside the face
1659 dist = Abs( tmpPnt.Y() );
1662 if ( dist < std::numeric_limits<double>::min() ) {
1663 *closestPnt = point.XYZ();
1667 trsf.Inverted().Transforms( tmpPnt );
1668 *closestPnt = tmpPnt;
1673 else if ( pntPosByType[ POS_VERTEX ].size() > 0 ) // point is most close to a node
1675 double minDist2 = Precision::Infinite();
1676 for ( size_t i = 0; i < pntPosByType[ POS_VERTEX ].size(); ++i )
1678 PointPos& pos = pntPosByType[ POS_VERTEX ][i];
1680 double d2 = point.SquareDistance( xyz[ pos._index ]);
1681 if ( minDist2 > d2 )
1683 if ( closestPnt ) *closestPnt = xyz[ pos._index ];
1687 dist = Sqrt( minDist2 );
1693 //=======================================================================
1695 * \brief Return minimal distance from a point to an edge
1697 //=======================================================================
1699 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshEdge* seg,
1700 const gp_Pnt& point,
1701 gp_XYZ* closestPnt )
1703 double dist = Precision::Infinite();
1704 if ( !seg ) return dist;
1706 int i = 0, nbNodes = seg->NbNodes();
1708 std::vector< SMESH_TNodeXYZ > xyz( nbNodes );
1709 for ( SMDS_NodeIteratorPtr nodeIt = seg->interlacedNodesIterator(); nodeIt->more(); i++ )
1710 xyz[ i ].Set( nodeIt->next() );
1712 for ( i = 1; i < nbNodes; ++i )
1714 gp_Vec edge( xyz[i-1], xyz[i] );
1715 gp_Vec n1p ( xyz[i-1], point );
1716 double d, u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1718 if (( d = n1p.SquareMagnitude() ) < dist ) {
1720 if ( closestPnt ) *closestPnt = xyz[i-1];
1723 else if ( u >= 1. ) {
1724 if (( d = point.SquareDistance( xyz[i] )) < dist ) {
1726 if ( closestPnt ) *closestPnt = xyz[i];
1730 gp_XYZ proj = xyz[i-1] + u * edge.XYZ(); // projection of the point on the edge
1731 if (( d = point.SquareDistance( proj )) < dist ) {
1733 if ( closestPnt ) *closestPnt = proj;
1737 return Sqrt( dist );
1740 //=======================================================================
1742 * \brief Return minimal distance from a point to a volume
1744 * Currently we ignore non-planarity and 2nd order
1746 //=======================================================================
1748 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshVolume* volume,
1749 const gp_Pnt& point,
1750 gp_XYZ* closestPnt )
1752 SMDS_VolumeTool vTool( volume );
1753 vTool.SetExternalNormal();
1754 const int iQ = volume->IsQuadratic() ? 2 : 1;
1757 double minDist = 1e100, dist;
1758 gp_XYZ closeP = point.XYZ();
1760 for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
1762 // skip a facet with normal not "looking at" the point
1763 if ( !vTool.GetFaceNormal( iF, n[0], n[1], n[2] ) ||
1764 !vTool.GetFaceBaryCenter( iF, bc[0], bc[1], bc[2] ))
1766 gp_XYZ bcp = point.XYZ() - gp_XYZ( bc[0], bc[1], bc[2] );
1767 if ( gp_XYZ( n[0], n[1], n[2] ) * bcp < 1e-6 )
1770 // find distance to a facet
1771 const SMDS_MeshNode** nodes = vTool.GetFaceNodes( iF );
1772 switch ( vTool.NbFaceNodes( iF ) / iQ ) {
1775 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ] );
1776 dist = GetDistance( &tmpFace, point, closestPnt );
1781 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ], nodes[ 3*iQ ]);
1782 dist = GetDistance( &tmpFace, point, closestPnt );
1786 std::vector<const SMDS_MeshNode *> nvec( nodes, nodes + vTool.NbFaceNodes( iF ));
1787 SMDS_PolygonalFaceOfNodes tmpFace( nvec );
1788 dist = GetDistance( &tmpFace, point, closestPnt );
1790 if ( dist < minDist )
1794 if ( closestPnt ) closeP = *closestPnt;
1799 if ( closestPnt ) *closestPnt = closeP;
1803 return 0; // point is inside the volume
1806 //================================================================================
1808 * \brief Returns barycentric coordinates of a point within a triangle.
1809 * A not returned bc2 = 1. - bc0 - bc1.
1810 * The point lies within the triangle if ( bc0 >= 0 && bc1 >= 0 && bc0+bc1 <= 1 )
1812 //================================================================================
1814 void SMESH_MeshAlgos::GetBarycentricCoords( const gp_XY& p,
1821 const double // matrix 2x2
1822 T11 = t0.X()-t2.X(), T12 = t1.X()-t2.X(),
1823 T21 = t0.Y()-t2.Y(), T22 = t1.Y()-t2.Y();
1824 const double Tdet = T11*T22 - T12*T21; // matrix determinant
1825 if ( Abs( Tdet ) < std::numeric_limits<double>::min() )
1831 const double t11 = T22, t12 = -T12, t21 = -T21, t22 = T11;
1833 const double r11 = p.X()-t2.X(), r12 = p.Y()-t2.Y();
1834 // barycentric coordinates: multiply matrix by vector
1835 bc0 = (t11 * r11 + t12 * r12)/Tdet;
1836 bc1 = (t21 * r11 + t22 * r12)/Tdet;
1839 //=======================================================================
1840 //function : FindFaceInSet
1841 //purpose : Return a face having linked nodes n1 and n2 and which is
1842 // - not in avoidSet,
1843 // - in elemSet provided that !elemSet.empty()
1844 // i1 and i2 optionally returns indices of n1 and n2
1845 //=======================================================================
1847 const SMDS_MeshElement*
1848 SMESH_MeshAlgos::FindFaceInSet(const SMDS_MeshNode* n1,
1849 const SMDS_MeshNode* n2,
1850 const TIDSortedElemSet& elemSet,
1851 const TIDSortedElemSet& avoidSet,
1857 const SMDS_MeshElement* face = 0;
1859 SMDS_ElemIteratorPtr invElemIt = n1->GetInverseElementIterator(SMDSAbs_Face);
1860 while ( invElemIt->more() && !face ) // loop on inverse faces of n1
1862 const SMDS_MeshElement* elem = invElemIt->next();
1863 if (avoidSet.count( elem ))
1865 if ( !elemSet.empty() && !elemSet.count( elem ))
1868 i1 = elem->GetNodeIndex( n1 );
1869 // find a n2 linked to n1
1870 int nbN = elem->IsQuadratic() ? elem->NbNodes()/2 : elem->NbNodes();
1871 for ( int di = -1; di < 2 && !face; di += 2 )
1873 i2 = (i1+di+nbN) % nbN;
1874 if ( elem->GetNode( i2 ) == n2 )
1877 if ( !face && elem->IsQuadratic())
1879 // analysis for quadratic elements using all nodes
1880 SMDS_NodeIteratorPtr anIter = elem->interlacedNodesIterator();
1881 const SMDS_MeshNode* prevN = static_cast<const SMDS_MeshNode*>( anIter->next() );
1882 for ( i1 = -1, i2 = 0; anIter->more() && !face; i1++, i2++ )
1884 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( anIter->next() );
1885 if ( n1 == prevN && n2 == n )
1889 else if ( n2 == prevN && n1 == n )
1891 face = elem; std::swap( i1, i2 );
1897 if ( n1ind ) *n1ind = i1;
1898 if ( n2ind ) *n2ind = i2;
1902 //================================================================================
1904 * Return sharp edges of faces and non-manifold ones. Optionally adds existing edges.
1906 //================================================================================
1908 std::vector< SMESH_MeshAlgos::Edge >
1909 SMESH_MeshAlgos::FindSharpEdges( SMDS_Mesh* theMesh,
1911 bool theAddExisting )
1913 std::vector< Edge > resultEdges;
1914 if ( !theMesh ) return resultEdges;
1916 typedef std::pair< bool, const SMDS_MeshNode* > TIsSharpAndMedium;
1917 typedef NCollection_DataMap< SMESH_TLink, TIsSharpAndMedium, SMESH_TLink > TLinkSharpMap;
1919 TLinkSharpMap linkIsSharp( theMesh->NbFaces() );
1920 TIsSharpAndMedium sharpMedium( true, 0 );
1921 bool & isSharp = sharpMedium.first;
1922 const SMDS_MeshNode* & nMedium = sharpMedium.second;
1924 if ( theAddExisting )
1926 for ( SMDS_EdgeIteratorPtr edgeIt = theMesh->edgesIterator(); edgeIt->more(); )
1928 const SMDS_MeshElement* edge = edgeIt->next();
1929 nMedium = ( edge->IsQuadratic() ) ? edge->GetNode(2) : 0;
1930 linkIsSharp.Bind( SMESH_TLink( edge->GetNode(0), edge->GetNode(1)), sharpMedium );
1934 // check angles between face normals
1936 const double angleCos = Cos( theAngle * M_PI / 180. ), angleCos2 = angleCos * angleCos;
1937 gp_XYZ norm1, norm2;
1938 std::vector< const SMDS_MeshNode* > faceNodes, linkNodes(2);
1939 std::vector<const SMDS_MeshElement *> linkFaces;
1941 int nbSharp = linkIsSharp.Extent();
1942 for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
1944 const SMDS_MeshElement* face = faceIt->next();
1945 size_t nbCorners = face->NbCornerNodes();
1947 faceNodes.assign( face->begin_nodes(), face->end_nodes() );
1948 if ( faceNodes.size() == nbCorners )
1949 faceNodes.resize( nbCorners * 2, 0 );
1951 const SMDS_MeshNode* nPrev = faceNodes[ nbCorners-1 ];
1952 for ( size_t i = 0; i < nbCorners; ++i )
1954 SMESH_TLink link( nPrev, faceNodes[i] );
1955 if ( !linkIsSharp.IsBound( link ))
1957 linkNodes[0] = link.node1();
1958 linkNodes[1] = link.node2();
1960 theMesh->GetElementsByNodes( linkNodes, linkFaces, SMDSAbs_Face );
1963 if ( linkFaces.size() > 2 )
1967 else if ( linkFaces.size() == 2 &&
1968 FaceNormal( linkFaces[0], norm1, /*normalize=*/false ) &&
1969 FaceNormal( linkFaces[1], norm2, /*normalize=*/false ))
1971 double dot = norm1 * norm2; // == cos * |norm1| * |norm2|
1972 if (( dot < 0 ) == ( angleCos < 0 ))
1974 double cos2 = dot * dot / norm1.SquareModulus() / norm2.SquareModulus();
1975 isSharp = ( angleCos < 0 ) ? ( cos2 > angleCos2 ) : ( cos2 < angleCos2 );
1979 isSharp = ( angleCos > 0 );
1982 nMedium = faceNodes[( i-1+nbCorners ) % nbCorners + nbCorners ];
1984 linkIsSharp.Bind( link, sharpMedium );
1988 nPrev = faceNodes[i];
1992 resultEdges.resize( nbSharp );
1993 TLinkSharpMap::Iterator linkIsSharpIter( linkIsSharp );
1994 for ( int i = 0; linkIsSharpIter.More() && i < nbSharp; linkIsSharpIter.Next() )
1996 const SMESH_TLink& link = linkIsSharpIter.Key();
1997 const TIsSharpAndMedium& isSharpMedium = linkIsSharpIter.Value();
1998 if ( isSharpMedium.first )
2000 Edge & edge = resultEdges[ i++ ];
2001 edge._node1 = link.node1();
2002 edge._node2 = link.node2();
2003 edge._medium = isSharpMedium.second;
2010 //================================================================================
2012 * Distribute all faces of the mesh between groups using given edges as group boundaries
2014 //================================================================================
2016 std::vector< std::vector< const SMDS_MeshElement* > >
2017 SMESH_MeshAlgos::SeparateFacesByEdges( SMDS_Mesh* theMesh, const std::vector< Edge >& theEdges )
2019 std::vector< std::vector< const SMDS_MeshElement* > > groups;
2020 if ( !theMesh ) return groups;
2022 // build map of face edges (SMESH_TLink) and their faces
2024 typedef std::vector< const SMDS_MeshElement* > TFaceVec;
2025 typedef NCollection_DataMap< SMESH_TLink, TFaceVec, SMESH_TLink > TFacesByLinks;
2026 TFacesByLinks facesByLink( theMesh->NbFaces() );
2028 std::vector< const SMDS_MeshNode* > faceNodes;
2029 for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
2031 const SMDS_MeshElement* face = faceIt->next();
2032 size_t nbCorners = face->NbCornerNodes();
2034 faceNodes.assign( face->begin_nodes(), face->end_nodes() );
2035 faceNodes.resize( nbCorners + 1 );
2036 faceNodes[ nbCorners ] = faceNodes[0];
2038 face->setIsMarked( false );
2040 for ( size_t i = 0; i < nbCorners; ++i )
2042 SMESH_TLink link( faceNodes[i], faceNodes[i+1] );
2043 TFaceVec* linkFaces = facesByLink.ChangeSeek( link );
2046 linkFaces = facesByLink.Bound( link, TFaceVec() );
2047 linkFaces->reserve(2);
2049 linkFaces->push_back( face );
2053 // remove the given edges from facesByLink map
2055 for ( size_t i = 0; i < theEdges.size(); ++i )
2057 SMESH_TLink link( theEdges[i]._node1, theEdges[i]._node2 );
2058 facesByLink.UnBind( link );
2061 // faces connected via links of facesByLink map form a group
2063 while ( !facesByLink.IsEmpty() )
2065 groups.push_back( TFaceVec() );
2066 TFaceVec & group = groups.back();
2068 group.push_back( TFacesByLinks::Iterator( facesByLink ).Value()[0] );
2069 group.back()->setIsMarked( true );
2071 for ( size_t iF = 0; iF < group.size(); ++iF )
2073 const SMDS_MeshElement* face = group[iF];
2074 size_t nbCorners = face->NbCornerNodes();
2075 faceNodes.assign( face->begin_nodes(), face->end_nodes() );
2076 faceNodes.resize( nbCorners + 1 );
2077 faceNodes[ nbCorners ] = faceNodes[0];
2079 for ( size_t iN = 0; iN < nbCorners; ++iN )
2081 SMESH_TLink link( faceNodes[iN], faceNodes[iN+1] );
2082 if ( const TFaceVec* faces = facesByLink.Seek( link ))
2084 const TFaceVec& faceNeighbors = *faces;
2085 for ( size_t i = 0; i < faceNeighbors.size(); ++i )
2086 if ( !faceNeighbors[i]->isMarked() )
2088 group.push_back( faceNeighbors[i] );
2089 faceNeighbors[i]->setIsMarked( true );
2091 facesByLink.UnBind( link );
2097 // find faces that are alone in its group; they were not in facesByLink
2100 for ( size_t i = 0; i < groups.size(); ++i )
2101 nbInGroups += groups[i].size();
2102 if ( nbInGroups < theMesh->NbFaces() )
2104 for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
2106 const SMDS_MeshElement* face = faceIt->next();
2107 if ( !face->isMarked() )
2109 groups.push_back( TFaceVec() );
2110 groups.back().push_back( face );
2118 //================================================================================
2120 * \brief Calculate normal of a mesh face
2122 //================================================================================
2124 bool SMESH_MeshAlgos::FaceNormal(const SMDS_MeshElement* F, gp_XYZ& normal, bool normalized)
2126 if ( !F || F->GetType() != SMDSAbs_Face )
2129 normal.SetCoord(0,0,0);
2130 int nbNodes = F->NbCornerNodes();
2131 for ( int i = 0; i < nbNodes-2; ++i )
2134 for ( int n = 0; n < 3; ++n )
2136 const SMDS_MeshNode* node = F->GetNode( i + n );
2137 p[n].SetCoord( node->X(), node->Y(), node->Z() );
2139 normal += ( p[2] - p[1] ) ^ ( p[0] - p[1] );
2141 double size2 = normal.SquareModulus();
2142 bool ok = ( size2 > std::numeric_limits<double>::min() * std::numeric_limits<double>::min());
2143 if ( normalized && ok )
2144 normal /= sqrt( size2 );
2149 //=======================================================================
2150 //function : GetCommonNodes
2151 //purpose : Return nodes common to two elements
2152 //=======================================================================
2154 std::vector< const SMDS_MeshNode*> SMESH_MeshAlgos::GetCommonNodes(const SMDS_MeshElement* e1,
2155 const SMDS_MeshElement* e2)
2157 std::vector< const SMDS_MeshNode*> common;
2158 for ( int i = 0 ; i < e1->NbNodes(); ++i )
2159 if ( e2->GetNodeIndex( e1->GetNode( i )) >= 0 )
2160 common.push_back( e1->GetNode( i ));
2163 //================================================================================
2165 * \brief Return true if node1 encounters first in the face and node2, after
2167 //================================================================================
2169 bool SMESH_MeshAlgos::IsRightOrder( const SMDS_MeshElement* face,
2170 const SMDS_MeshNode* node0,
2171 const SMDS_MeshNode* node1 )
2173 int i0 = face->GetNodeIndex( node0 );
2174 int i1 = face->GetNodeIndex( node1 );
2175 if ( face->IsQuadratic() )
2177 if ( face->IsMediumNode( node0 ))
2179 i0 -= ( face->NbNodes()/2 - 1 );
2184 i1 -= ( face->NbNodes()/2 - 1 );
2189 return ( diff == 1 ) || ( diff == -face->NbNodes()+1 );
2192 //=======================================================================
2194 * \brief Partition given 1D elements into groups of contiguous edges.
2195 * A node where number of meeting edges != 2 is a group end.
2196 * An optional startNode is used to orient groups it belongs to.
2197 * \return a list of edge groups and a list of corresponding node groups.
2198 * If a group is closed, the first and last nodes of the group are same.
2200 //=======================================================================
2202 void SMESH_MeshAlgos::Get1DBranches( SMDS_ElemIteratorPtr theEdgeIt,
2203 TElemGroupVector& theEdgeGroups,
2204 TNodeGroupVector& theNodeGroups,
2205 const SMDS_MeshNode* theStartNode )
2210 // build map of nodes and their adjacent edges
2212 typedef std::vector< const SMDS_MeshNode* > TNodeVec;
2213 typedef std::vector< const SMDS_MeshElement* > TEdgeVec;
2214 typedef NCollection_DataMap< const SMDS_MeshNode*, TEdgeVec, SMESH_Hasher > TEdgesByNodeMap;
2215 TEdgesByNodeMap edgesByNode;
2217 while ( theEdgeIt->more() )
2219 const SMDS_MeshElement* edge = theEdgeIt->next();
2220 if ( edge->GetType() != SMDSAbs_Edge )
2223 const SMDS_MeshNode* nodes[2] = { edge->GetNode(0), edge->GetNode(1) };
2224 for ( int i = 0; i < 2; ++i )
2226 TEdgeVec* nodeEdges = edgesByNode.ChangeSeek( nodes[i] );
2229 nodeEdges = edgesByNode.Bound( nodes[i], TEdgeVec() );
2230 nodeEdges->reserve(2);
2232 nodeEdges->push_back( edge );
2236 if ( edgesByNode.IsEmpty() )
2240 // build edge branches
2242 TElemGroupVector branches(2);
2243 TNodeGroupVector nodeBranches(2);
2245 while ( !edgesByNode.IsEmpty() )
2247 if ( !theStartNode || !edgesByNode.IsBound( theStartNode ))
2249 theStartNode = TEdgesByNodeMap::Iterator( edgesByNode ).Key();
2252 size_t nbBranches = 0;
2253 bool startIsBranchEnd = false;
2255 while ( edgesByNode.IsBound( theStartNode ))
2257 // initialize a new branch
2260 if ( branches.size() < nbBranches )
2262 branches.push_back ( TEdgeVec() );
2263 nodeBranches.push_back( TNodeVec() );
2265 TEdgeVec & branch = branches [ nbBranches - 1 ];
2266 TNodeVec & nodeBranch = nodeBranches[ nbBranches - 1 ];
2270 TEdgeVec& edges = edgesByNode( theStartNode );
2271 startIsBranchEnd = ( edges.size() != 2 );
2274 const SMDS_MeshElement* startEdge = 0;
2275 for ( size_t i = 0; i < edges.size(); ++i )
2277 if ( !startEdge && edges[i] )
2279 startEdge = edges[i];
2282 nbEdges += bool( edges[i] );
2285 edgesByNode.UnBind( theStartNode );
2289 branch.push_back( startEdge );
2291 nodeBranch.push_back( theStartNode );
2292 nodeBranch.push_back( branch.back()->GetNode(0) );
2293 if ( nodeBranch.back() == theStartNode )
2294 nodeBranch.back() = branch.back()->GetNode(1);
2299 bool isBranchEnd = false;
2302 while (( !isBranchEnd ) && ( edgesPtr = edgesByNode.ChangeSeek( nodeBranch.back() )))
2304 TEdgeVec& edges = *edgesPtr;
2306 isBranchEnd = ( edges.size() != 2 );
2308 const SMDS_MeshNode* lastNode = nodeBranch.back();
2310 switch ( edges.size() )
2313 edgesByNode.UnBind( lastNode );
2318 if ( const SMDS_MeshElement* nextEdge = edges[ edges[0] == branch.back() ])
2320 branch.push_back( nextEdge );
2322 const SMDS_MeshNode* nextNode = nextEdge->GetNode(0);
2323 if ( nodeBranch.back() == nextNode )
2324 nextNode = nextEdge->GetNode(1);
2325 nodeBranch.push_back( nextNode );
2327 edgesByNode.UnBind( lastNode );
2333 for ( size_t i = 0; i < edges.size(); ++i )
2335 if ( edges[i] == branch.back() )
2337 nbEdges += bool( edges[i] );
2340 edgesByNode.UnBind( lastNode );
2343 } // while ( edgesByNode.IsBound( theStartNode ))
2346 // put the found branches to the result
2348 if ( nbBranches == 2 && !startIsBranchEnd ) // join two branches starting at the same node
2350 if ( nodeBranches[0].back() == nodeBranches[1].back() )
2352 // it is a closed branch, keep theStartNode first
2353 nodeBranches[0].pop_back();
2354 nodeBranches[0].reserve( nodeBranches[0].size() + nodeBranches[1].size() );
2355 nodeBranches[0].insert( nodeBranches[0].end(),
2356 nodeBranches[1].rbegin(), nodeBranches[1].rend() );
2357 branches[0].reserve( branches[0].size() + branches[1].size() );
2358 branches[0].insert( branches[0].end(), branches[1].rbegin(), branches[1].rend() );
2362 std::reverse( nodeBranches[0].begin(), nodeBranches[0].end() );
2363 nodeBranches[0].pop_back();
2364 nodeBranches[0].reserve( nodeBranches[0].size() + nodeBranches[1].size() );
2365 nodeBranches[0].insert( nodeBranches[0].end(),
2366 nodeBranches[1].begin(), nodeBranches[1].end() );
2368 std::reverse( branches[0].begin(), branches[0].end() );
2369 branches[0].reserve( branches[0].size() + branches[1].size() );
2370 branches[0].insert( branches[0].end(), branches[1].begin(), branches[1].end() );
2372 nodeBranches[1].clear();
2373 branches[1].clear();
2376 for ( size_t i = 0; i < nbBranches; ++i )
2378 if ( branches[i].empty() )
2381 theEdgeGroups.push_back( TEdgeVec() );
2382 theEdgeGroups.back().swap( branches[i] );
2384 theNodeGroups.push_back( TNodeVec() );
2385 theNodeGroups.back().swap( nodeBranches[i] );
2388 } // while ( !edgesByNode.IsEmpty() )
2393 //=======================================================================
2395 * \brief Return SMESH_NodeSearcher
2397 //=======================================================================
2399 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_Mesh& mesh)
2401 return new SMESH_NodeSearcherImpl( &mesh );
2404 //=======================================================================
2406 * \brief Return SMESH_NodeSearcher
2408 //=======================================================================
2410 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_ElemIteratorPtr elemIt)
2412 return new SMESH_NodeSearcherImpl( 0, elemIt );
2415 //=======================================================================
2417 * \brief Return SMESH_ElementSearcher
2419 //=======================================================================
2421 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
2424 return new SMESH_ElementSearcherImpl( mesh, tolerance );
2427 //=======================================================================
2429 * \brief Return SMESH_ElementSearcher acting on a sub-set of elements
2431 //=======================================================================
2433 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
2434 SMDS_ElemIteratorPtr elemIt,
2437 return new SMESH_ElementSearcherImpl( mesh, tolerance, elemIt );