1 // Copyright (C) 2007-2022 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 );
244 ElementBndBoxTree() {}
245 SMESH_Octree* newChild() const { return new ElementBndBoxTree; }
246 void buildChildrenData();
247 Bnd_B3d* buildRootBox();
249 //!< Bounding box of element
250 struct ElementBox : public Bnd_B3d
252 const SMDS_MeshElement* _element;
253 void init(const SMDS_MeshElement* elem, double tolerance);
255 std::vector< ElementBox* > _elements;
257 typedef ObjectPool< ElementBox > TElementBoxPool;
259 //!< allocator of ElementBox's and SMESH_TreeLimit
260 struct LimitAndPool : public SMESH_TreeLimit
262 TElementBoxPool _elBoPool;
263 LimitAndPool():SMESH_TreeLimit( MaxLevel, /*minSize=*/0. ) {}
265 LimitAndPool* getLimitAndPool() const
267 SMESH_TreeLimit* limitAndPool = const_cast< SMESH_TreeLimit* >( myLimit );
268 return static_cast< LimitAndPool* >( limitAndPool );
272 //================================================================================
274 * \brief ElementBndBoxTree creation
276 //================================================================================
278 ElementBndBoxTree::ElementBndBoxTree(const SMDS_Mesh& mesh,
279 SMDSAbs_ElementType elemType,
280 SMDS_ElemIteratorPtr theElemIt,
282 :SMESH_Octree( new LimitAndPool() )
284 smIdType nbElems = mesh.GetMeshInfo().NbElements( elemType );
285 _elements.reserve( nbElems );
287 TElementBoxPool& elBoPool = getLimitAndPool()->_elBoPool;
290 if ( theElemIt && !theElemIt->more() )
291 std::cout << "WARNING: ElementBndBoxTree constructed on empty iterator!" << std::endl;
294 SMDS_ElemIteratorPtr elemIt = theElemIt ? theElemIt : mesh.elementsIterator( elemType );
295 while ( elemIt->more() )
297 ElementBox* eb = elBoPool.getNew();
298 eb->init( elemIt->next(), tolerance );
299 _elements.push_back( eb );
304 //================================================================================
306 * \brief Return the maximal box
308 //================================================================================
310 Bnd_B3d* ElementBndBoxTree::buildRootBox()
312 Bnd_B3d* box = new Bnd_B3d;
313 for ( size_t i = 0; i < _elements.size(); ++i )
314 box->Add( *_elements[i] );
318 //================================================================================
320 * \brief Redistribute element boxes among children
322 //================================================================================
324 void ElementBndBoxTree::buildChildrenData()
326 for ( size_t i = 0; i < _elements.size(); ++i )
328 for (int j = 0; j < 8; j++)
330 if ( !_elements[i]->IsOut( *myChildren[j]->getBox() ))
331 ((ElementBndBoxTree*)myChildren[j])->_elements.push_back( _elements[i]);
334 //_size = _elements.size();
335 SMESHUtils::FreeVector( _elements ); // = _elements.clear() + free memory
337 for (int j = 0; j < 8; j++)
339 ElementBndBoxTree* child = static_cast<ElementBndBoxTree*>( myChildren[j]);
340 if ((int) child->_elements.size() <= MaxNbElemsInLeaf )
341 child->myIsLeaf = true;
343 if ( child->isLeaf() && child->_elements.capacity() > child->_elements.size() )
344 SMESHUtils::CompactVector( child->_elements );
348 //================================================================================
350 * \brief Return elements which can include the point
352 //================================================================================
354 void ElementBndBoxTree::getElementsNearPoint( const gp_Pnt& point, TElemSeq& foundElems)
356 if ( getBox()->IsOut( point.XYZ() ))
361 for ( size_t i = 0; i < _elements.size(); ++i )
362 if ( !_elements[i]->IsOut( point.XYZ() ))
363 foundElems.insert( _elements[i]->_element );
367 for (int i = 0; i < 8; i++)
368 ((ElementBndBoxTree*) myChildren[i])->getElementsNearPoint( point, foundElems );
372 //================================================================================
374 * \brief Return elements which can be intersected by the line
376 //================================================================================
378 void ElementBndBoxTree::getElementsNearLine( const gp_Ax1& line, TElemSeq& foundElems )
380 if ( getBox()->IsOut( line ))
385 for ( size_t i = 0; i < _elements.size(); ++i )
386 if ( !_elements[i]->IsOut( line ) )
387 foundElems.insert( _elements[i]->_element );
391 for (int i = 0; i < 8; i++)
392 ((ElementBndBoxTree*) myChildren[i])->getElementsNearLine( line, foundElems );
396 //================================================================================
398 * \brief Return elements from leaves intersecting the sphere
400 //================================================================================
402 void ElementBndBoxTree::getElementsInSphere ( const gp_XYZ& center,
404 TElemSeq& foundElems)
406 if ( getBox()->IsOut( center, radius ))
411 for ( size_t i = 0; i < _elements.size(); ++i )
412 if ( !_elements[i]->IsOut( center, radius ))
413 foundElems.insert( _elements[i]->_element );
417 for (int i = 0; i < 8; i++)
418 ((ElementBndBoxTree*) myChildren[i])->getElementsInSphere( center, radius, foundElems );
422 //================================================================================
424 * \brief Return elements from leaves intersecting the box
426 //================================================================================
428 void ElementBndBoxTree::getElementsInBox( const Bnd_B3d& box, TElemSeq& foundElems )
430 if ( getBox()->IsOut( box ))
435 for ( size_t i = 0; i < _elements.size(); ++i )
436 if ( !_elements[i]->IsOut( box ))
437 foundElems.insert( _elements[i]->_element );
441 for (int i = 0; i < 8; i++)
442 ((ElementBndBoxTree*) myChildren[i])->getElementsInBox( box, foundElems );
446 //================================================================================
448 * \brief Return a leaf including a point
450 //================================================================================
452 ElementBndBoxTree* ElementBndBoxTree::getLeafAtPoint( const gp_XYZ& point )
454 if ( getBox()->IsOut( point ))
463 for (int i = 0; i < 8; i++)
464 if ( ElementBndBoxTree* l = ((ElementBndBoxTree*) myChildren[i])->getLeafAtPoint( point ))
470 //================================================================================
472 * \brief Return number of elements
474 //================================================================================
476 int ElementBndBoxTree::getNbElements()
481 nb = _elements.size();
485 for (int i = 0; i < 8; i++)
486 nb += ((ElementBndBoxTree*) myChildren[i])->getNbElements();
491 //================================================================================
493 * \brief Construct the element box
495 //================================================================================
497 void ElementBndBoxTree::ElementBox::init(const SMDS_MeshElement* elem, double tolerance)
500 SMDS_ElemIteratorPtr nIt = elem->nodesIterator();
501 while ( nIt->more() )
502 Add( SMESH_NodeXYZ( nIt->next() ));
503 Enlarge( tolerance );
508 //=======================================================================
510 * \brief Implementation of search for the elements by point and
511 * of classification of point in 2D mesh
513 //=======================================================================
515 SMESH_ElementSearcher::~SMESH_ElementSearcher()
519 struct SMESH_ElementSearcherImpl: public SMESH_ElementSearcher
522 SMDS_ElemIteratorPtr _meshPartIt;
523 ElementBndBoxTree* _ebbTree [SMDSAbs_NbElementTypes];
524 int _ebbTreeHeight[SMDSAbs_NbElementTypes];
525 SMESH_NodeSearcherImpl* _nodeSearcher;
526 SMDSAbs_ElementType _elementType;
528 bool _outerFacesFound;
529 std::set<const SMDS_MeshElement*> _outerFaces; // empty means "no internal faces at all"
531 SMESH_ElementSearcherImpl( SMDS_Mesh& mesh,
533 SMDS_ElemIteratorPtr elemIt=SMDS_ElemIteratorPtr())
534 : _mesh(&mesh),_meshPartIt(elemIt),_nodeSearcher(0),_tolerance(tol),_outerFacesFound(false)
536 for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
539 _ebbTreeHeight[i] = -1;
541 _elementType = SMDSAbs_All;
543 virtual ~SMESH_ElementSearcherImpl()
545 for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
547 delete _ebbTree[i]; _ebbTree[i] = NULL;
549 if ( _nodeSearcher ) delete _nodeSearcher;
552 virtual int FindElementsByPoint(const gp_Pnt& point,
553 SMDSAbs_ElementType type,
554 std::vector< const SMDS_MeshElement* >& foundElements);
555 virtual TopAbs_State GetPointState(const gp_Pnt& point);
556 virtual const SMDS_MeshElement* FindClosestTo( const gp_Pnt& point,
557 SMDSAbs_ElementType type );
559 virtual void GetElementsNearLine( const gp_Ax1& line,
560 SMDSAbs_ElementType type,
561 std::vector< const SMDS_MeshElement* >& foundElems);
562 virtual void GetElementsInSphere( const gp_XYZ& center,
564 SMDSAbs_ElementType type,
565 std::vector< const SMDS_MeshElement* >& foundElems);
566 virtual void GetElementsInBox( const Bnd_B3d& box,
567 SMDSAbs_ElementType type,
568 std::vector< const SMDS_MeshElement* >& foundElems);
569 virtual gp_XYZ Project(const gp_Pnt& point,
570 SMDSAbs_ElementType type,
571 const SMDS_MeshElement** closestElem);
572 double getTolerance();
573 bool getIntersParamOnLine(const gp_Lin& line, const SMDS_MeshElement* face,
574 const double tolerance, double & param);
575 void findOuterBoundary(const SMDS_MeshElement* anyOuterFace);
576 bool isOuterBoundary(const SMDS_MeshElement* face) const
578 return _outerFaces.empty() || _outerFaces.count(face);
582 if ( _ebbTreeHeight[ _elementType ] < 0 )
583 _ebbTreeHeight[ _elementType ] = _ebbTree[ _elementType ]->getHeight();
584 return _ebbTreeHeight[ _elementType ];
587 struct TInters //!< data of intersection of the line and the mesh face (used in GetPointState())
589 const SMDS_MeshElement* _face;
591 bool _coincides; //!< the line lays in face plane
592 TInters(const SMDS_MeshElement* face, const gp_Vec& faceNorm, bool coinc=false)
593 : _face(face), _faceNorm( faceNorm ), _coincides( coinc ) {}
595 struct TFaceLink //!< link and faces sharing it (used in findOuterBoundary())
598 TIDSortedElemSet _faces;
599 TFaceLink( const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshElement* face)
600 : _link( n1, n2 ), _faces( &face, &face + 1) {}
604 ostream& operator<< (ostream& out, const SMESH_ElementSearcherImpl::TInters& i)
606 return out << "TInters(face=" << ( i._face ? i._face->GetID() : 0)
607 << ", _coincides="<<i._coincides << ")";
610 //=======================================================================
612 * \brief define tolerance for search
614 //=======================================================================
616 double SMESH_ElementSearcherImpl::getTolerance()
618 if ( _tolerance < 0 )
620 const SMDS_MeshInfo& meshInfo = _mesh->GetMeshInfo();
623 if ( _nodeSearcher && meshInfo.NbNodes() > 1 )
625 double boxSize = _nodeSearcher->getTree()->maxSize();
626 _tolerance = 1e-8 * boxSize/* / meshInfo.NbNodes()*/;
628 else if ( _ebbTree[_elementType] && meshInfo.NbElements() > 0 )
630 double boxSize = _ebbTree[_elementType]->maxSize();
631 _tolerance = 1e-8 * boxSize/* / meshInfo.NbElements()*/;
633 if ( _tolerance == 0 )
635 // define tolerance by size of a most complex element
636 int complexType = SMDSAbs_Volume;
637 while ( complexType > SMDSAbs_All &&
638 meshInfo.NbElements( SMDSAbs_ElementType( complexType )) < 1 )
640 if ( complexType == SMDSAbs_All ) return 0; // empty mesh
642 if ( complexType == int( SMDSAbs_Node ))
644 SMDS_NodeIteratorPtr nodeIt = _mesh->nodesIterator();
646 if ( meshInfo.NbNodes() > 2 )
647 elemSize = SMESH_TNodeXYZ( nodeIt->next() ).Distance( nodeIt->next() );
651 SMDS_ElemIteratorPtr elemIt = _mesh->elementsIterator( SMDSAbs_ElementType( complexType ));
652 const SMDS_MeshElement* elem = elemIt->next();
653 SMDS_ElemIteratorPtr nodeIt = elem->nodesIterator();
654 SMESH_TNodeXYZ n1( nodeIt->next() );
656 while ( nodeIt->more() )
658 double dist = n1.Distance( static_cast<const SMDS_MeshNode*>( nodeIt->next() ));
659 elemSize = std::max( dist, elemSize );
662 _tolerance = 1e-4 * elemSize;
668 //================================================================================
670 * \brief Find intersection of the line and an edge of face and return parameter on line
672 //================================================================================
674 bool SMESH_ElementSearcherImpl::getIntersParamOnLine(const gp_Lin& line,
675 const SMDS_MeshElement* face,
682 GeomAPI_ExtremaCurveCurve anExtCC;
683 Handle(Geom_Curve) lineCurve = new Geom_Line( line );
685 int nbNodes = face->IsQuadratic() ? face->NbNodes()/2 : face->NbNodes();
686 for ( int i = 0; i < nbNodes && nbInts < 2; ++i )
688 GC_MakeSegment edge( SMESH_TNodeXYZ( face->GetNode( i )),
689 SMESH_TNodeXYZ( face->GetNode( (i+1)%nbNodes) ));
690 anExtCC.Init( lineCurve, edge.Value() );
691 if ( !anExtCC.Extrema().IsDone() ||
692 anExtCC.Extrema().IsParallel() )
694 if ( anExtCC.NbExtrema() > 0 && anExtCC.LowerDistance() <= tol)
696 Standard_Real pl, pe;
697 anExtCC.LowerDistanceParameters( pl, pe );
703 if ( nbInts > 0 ) param /= nbInts;
706 //================================================================================
708 * \brief Find all faces belonging to the outer boundary of mesh
710 //================================================================================
712 void SMESH_ElementSearcherImpl::findOuterBoundary(const SMDS_MeshElement* outerFace)
714 if ( _outerFacesFound ) return;
716 // Collect all outer faces by passing from one outer face to another via their links
717 // and BTW find out if there are internal faces at all.
719 // checked links and links where outer boundary meets internal one
720 std::set< SMESH_TLink > visitedLinks, seamLinks;
722 // links to treat with already visited faces sharing them
723 std::list < TFaceLink > startLinks;
725 // load startLinks with the first outerFace
726 startLinks.push_back( TFaceLink( outerFace->GetNode(0), outerFace->GetNode(1), outerFace));
727 _outerFaces.insert( outerFace );
729 TIDSortedElemSet emptySet;
730 while ( !startLinks.empty() )
732 const SMESH_TLink& link = startLinks.front()._link;
733 TIDSortedElemSet& faces = startLinks.front()._faces;
735 outerFace = *faces.begin();
736 // find other faces sharing the link
737 const SMDS_MeshElement* f;
738 while (( f = SMESH_MeshAlgos::FindFaceInSet(link.node1(), link.node2(), emptySet, faces )))
741 // select another outer face among the found
742 const SMDS_MeshElement* outerFace2 = 0;
743 if ( faces.size() == 2 )
745 outerFace2 = (outerFace == *faces.begin() ? *faces.rbegin() : *faces.begin());
747 else if ( faces.size() > 2 )
749 seamLinks.insert( link );
751 // link direction within the outerFace
752 gp_Vec n1n2( SMESH_TNodeXYZ( link.node1()),
753 SMESH_TNodeXYZ( link.node2()));
754 int i1 = outerFace->GetNodeIndex( link.node1() );
755 int i2 = outerFace->GetNodeIndex( link.node2() );
756 bool rev = ( abs(i2-i1) == 1 ? i1 > i2 : i2 > i1 );
757 if ( rev ) n1n2.Reverse();
759 gp_XYZ ofNorm, fNorm;
760 if ( SMESH_MeshAlgos::FaceNormal( outerFace, ofNorm, /*normalized=*/false ))
762 // direction from the link inside outerFace
763 gp_Vec dirInOF = gp_Vec( ofNorm ) ^ n1n2;
764 // sort all other faces by angle with the dirInOF
765 std::map< double, const SMDS_MeshElement* > angle2Face;
766 std::set< const SMDS_MeshElement*, TIDCompare >::const_iterator face = faces.begin();
767 for ( ; face != faces.end(); ++face )
769 if ( *face == outerFace ) continue;
770 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false ))
772 gp_Vec dirInF = gp_Vec( fNorm ) ^ n1n2;
773 double angle = dirInOF.AngleWithRef( dirInF, n1n2 );
774 if ( angle < 0 ) angle += 2. * M_PI;
775 angle2Face.insert( std::make_pair( angle, *face ));
777 if ( !angle2Face.empty() )
778 outerFace2 = angle2Face.begin()->second;
781 // store the found outer face and add its links to continue searching from
784 _outerFaces.insert( outerFace2 );
785 int nbNodes = outerFace2->NbCornerNodes();
786 for ( int i = 0; i < nbNodes; ++i )
788 SMESH_TLink link2( outerFace2->GetNode(i), outerFace2->GetNode((i+1)%nbNodes));
789 if ( visitedLinks.insert( link2 ).second )
790 startLinks.push_back( TFaceLink( link2.node1(), link2.node2(), outerFace2 ));
793 startLinks.pop_front();
795 _outerFacesFound = true;
797 if ( !seamLinks.empty() )
799 // There are internal boundaries touching the outher one,
800 // find all faces of internal boundaries in order to find
801 // faces of boundaries of holes, if any.
810 //=======================================================================
812 * \brief Find elements of given type where the given point is IN or ON.
813 * Returns nb of found elements and elements them-selves.
815 * 'ALL' type means elements of any type excluding nodes, balls and 0D elements
817 //=======================================================================
819 int SMESH_ElementSearcherImpl::
820 FindElementsByPoint(const gp_Pnt& point,
821 SMDSAbs_ElementType type,
822 std::vector< const SMDS_MeshElement* >& foundElements)
824 foundElements.clear();
827 double tolerance = getTolerance();
829 // =================================================================================
830 if ( type == SMDSAbs_Node || type == SMDSAbs_0DElement || type == SMDSAbs_Ball)
832 if ( !_nodeSearcher )
835 _nodeSearcher = new SMESH_NodeSearcherImpl( 0, _meshPartIt );
837 _nodeSearcher = new SMESH_NodeSearcherImpl( _mesh );
839 std::vector< const SMDS_MeshNode* > foundNodes;
840 _nodeSearcher->FindNearPoint( point, tolerance, foundNodes );
842 if ( type == SMDSAbs_Node )
844 foundElements.assign( foundNodes.begin(), foundNodes.end() );
848 for ( size_t i = 0; i < foundNodes.size(); ++i )
850 SMDS_ElemIteratorPtr elemIt = foundNodes[i]->GetInverseElementIterator( type );
851 while ( elemIt->more() )
852 foundElements.push_back( elemIt->next() );
856 // =================================================================================
857 else // elements more complex than 0D
859 if ( !_ebbTree[type] )
861 _ebbTree[_elementType] = new ElementBndBoxTree( *_mesh, type, _meshPartIt, tolerance );
863 ElementBndBoxTree::TElemSeq suspectElems;
864 _ebbTree[ type ]->getElementsNearPoint( point, suspectElems );
865 ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
866 for ( ; elem != suspectElems.end(); ++elem )
867 if ( !SMESH_MeshAlgos::IsOut( *elem, point, tolerance ))
868 foundElements.push_back( *elem );
870 return foundElements.size();
873 //=======================================================================
875 * \brief Find an element of given type most close to the given point
877 * WARNING: Only edge, face and volume search is implemented so far
879 //=======================================================================
881 const SMDS_MeshElement*
882 SMESH_ElementSearcherImpl::FindClosestTo( const gp_Pnt& point,
883 SMDSAbs_ElementType type )
885 const SMDS_MeshElement* closestElem = 0;
888 if ( type == SMDSAbs_Face ||
889 type == SMDSAbs_Volume ||
890 type == SMDSAbs_Edge )
892 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
894 ebbTree = new ElementBndBoxTree( *_mesh, type, _meshPartIt );
896 ElementBndBoxTree::TElemSeq suspectElems;
897 ebbTree->getElementsNearPoint( point, suspectElems );
899 if ( suspectElems.empty() && ebbTree->maxSize() > 0 )
901 gp_Pnt boxCenter = 0.5 * ( ebbTree->getBox()->CornerMin() +
902 ebbTree->getBox()->CornerMax() );
904 if ( ebbTree->getBox()->IsOut( point.XYZ() ))
905 radius = point.Distance( boxCenter ) - 0.5 * ebbTree->maxSize();
907 radius = ebbTree->maxSize() / pow( 2., getTreeHeight()) / 2;
908 while ( suspectElems.empty() && radius < 1e100 )
910 ebbTree->getElementsInSphere( point.XYZ(), radius, suspectElems );
914 double minDist = std::numeric_limits<double>::max();
915 std::multimap< double, const SMDS_MeshElement* > dist2face;
916 ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
917 for ( ; elem != suspectElems.end(); ++elem )
919 double dist = SMESH_MeshAlgos::GetDistance( *elem, point );
920 if ( dist < minDist + 1e-10)
923 dist2face.insert( dist2face.begin(), std::make_pair( dist, *elem ));
926 if ( !dist2face.empty() )
928 std::multimap< double, const SMDS_MeshElement* >::iterator d2f = dist2face.begin();
929 closestElem = d2f->second;
930 // if there are several elements at the same distance, select one
931 // with GC closest to the point
932 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
933 double minDistToGC = 0;
934 for ( ++d2f; d2f != dist2face.end() && fabs( d2f->first - minDist ) < 1e-10; ++d2f )
936 if ( minDistToGC == 0 )
939 gc = accumulate( TXyzIterator(closestElem->nodesIterator()),
940 TXyzIterator(), gc ) / closestElem->NbNodes();
941 minDistToGC = point.SquareDistance( gc );
944 gc = accumulate( TXyzIterator( d2f->second->nodesIterator()),
945 TXyzIterator(), gc ) / d2f->second->NbNodes();
946 double d = point.SquareDistance( gc );
947 if ( d < minDistToGC )
950 closestElem = d2f->second;
953 // cout << "FindClosestTo( " <<point.X()<<", "<<point.Y()<<", "<<point.Z()<<" ) FACE "
954 // <<closestElem->GetID() << " DIST " << minDist << endl;
959 // NOT IMPLEMENTED SO FAR
965 //================================================================================
967 * \brief Classify the given point in the closed 2D mesh
969 //================================================================================
971 TopAbs_State SMESH_ElementSearcherImpl::GetPointState(const gp_Pnt& point)
973 _elementType = SMDSAbs_Face;
975 double tolerance = getTolerance();
977 ElementBndBoxTree*& ebbTree = _ebbTree[ SMDSAbs_Face ];
979 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
981 // Algo: analyse transition of a line starting at the point through mesh boundary;
982 // try three lines parallel to axis of the coordinate system and perform rough
983 // analysis. If solution is not clear perform thorough analysis.
985 const int nbAxes = 3;
986 gp_Dir axisDir[ nbAxes ] = { gp::DX(), gp::DY(), gp::DZ() };
987 std::map< double, TInters > paramOnLine2TInters[ nbAxes ];
988 std::list< TInters > tangentInters[ nbAxes ]; // of faces whose plane includes the line
989 std::multimap< int, int > nbInt2Axis; // to find the simplest case
990 for ( int axis = 0; axis < nbAxes; ++axis )
992 gp_Ax1 lineAxis( point, axisDir[axis]);
993 gp_Lin line ( lineAxis );
995 ElementBndBoxTree::TElemSeq suspectFaces; // faces possibly intersecting the line
996 ebbTree->getElementsNearLine( lineAxis, suspectFaces );
998 // Intersect faces with the line
1000 std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
1001 ElementBndBoxTree::TElemSeq::iterator face = suspectFaces.begin();
1002 for ( ; face != suspectFaces.end(); ++face )
1006 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false)) continue;
1007 gp_Pln facePlane( SMESH_TNodeXYZ( (*face)->GetNode(0)), fNorm );
1009 // perform intersection
1010 IntAna_IntConicQuad intersection( line, IntAna_Quadric( facePlane ));
1011 if ( !intersection.IsDone() )
1013 if ( intersection.IsInQuadric() )
1015 tangentInters[ axis ].push_back( TInters( *face, fNorm, true ));
1017 else if ( ! intersection.IsParallel() && intersection.NbPoints() > 0 )
1019 double tol = 1e-4 * Sqrt( fNorm.Modulus() );
1020 gp_Pnt intersectionPoint = intersection.Point(1);
1021 if ( !SMESH_MeshAlgos::IsOut( *face, intersectionPoint, tol ))
1022 u2inters.insert( std::make_pair( intersection.ParamOnConic(1), TInters( *face, fNorm )));
1025 // Analyse intersections roughly
1027 int nbInter = u2inters.size();
1031 double f = u2inters.begin()->first, l = u2inters.rbegin()->first;
1032 if ( nbInter == 1 ) // not closed mesh
1033 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
1035 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
1038 if ( (f<0) == (l<0) )
1041 int nbIntBeforePoint = std::distance( u2inters.begin(), u2inters.lower_bound(0));
1042 int nbIntAfterPoint = nbInter - nbIntBeforePoint;
1043 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
1046 nbInt2Axis.insert( std::make_pair( std::min( nbIntBeforePoint, nbIntAfterPoint ), axis ));
1048 if ( _outerFacesFound ) break; // pass to thorough analysis
1050 } // three attempts - loop on CS axes
1052 // Analyse intersections thoroughly.
1053 // We make two loops maximum, on the first one we only exclude touching intersections,
1054 // on the second, if situation is still unclear, we gather and use information on
1055 // position of faces (internal or outer). If faces position is already gathered,
1056 // we make the second loop right away.
1058 for ( int hasPositionInfo = _outerFacesFound; hasPositionInfo < 2; ++hasPositionInfo )
1060 std::multimap< int, int >::const_iterator nb_axis = nbInt2Axis.begin();
1061 for ( ; nb_axis != nbInt2Axis.end(); ++nb_axis )
1063 int axis = nb_axis->second;
1064 std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
1066 gp_Ax1 lineAxis( point, axisDir[axis]);
1067 gp_Lin line ( lineAxis );
1069 // add tangent intersections to u2inters
1071 std::list< TInters >::const_iterator tgtInt = tangentInters[ axis ].begin();
1072 for ( ; tgtInt != tangentInters[ axis ].end(); ++tgtInt )
1073 if ( getIntersParamOnLine( line, tgtInt->_face, tolerance, param ))
1074 u2inters.insert( std::make_pair( param, *tgtInt ));
1075 tangentInters[ axis ].clear();
1077 // Count intersections before and after the point excluding touching ones.
1078 // If hasPositionInfo we count intersections of outer boundary only
1080 int nbIntBeforePoint = 0, nbIntAfterPoint = 0;
1081 double f = std::numeric_limits<double>::max(), l = -std::numeric_limits<double>::max();
1082 std::map< double, TInters >::iterator u_int1 = u2inters.begin(), u_int2 = u_int1;
1083 bool ok = ! u_int1->second._coincides;
1084 while ( ok && u_int1 != u2inters.end() )
1086 double u = u_int1->first;
1087 bool touchingInt = false;
1088 if ( ++u_int2 != u2inters.end() )
1090 // skip intersections at the same point (if the line passes through edge or node)
1092 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u ) < tolerance )
1098 // skip tangent intersections
1100 if ( u_int2 != u2inters.end() )
1102 const SMDS_MeshElement* prevFace = u_int1->second._face;
1103 while ( ok && u_int2->second._coincides )
1105 if ( SMESH_MeshAlgos::NbCommonNodes(prevFace , u_int2->second._face) == 0 )
1111 ok = ( u_int2 != u2inters.end() );
1117 // skip intersections at the same point after tangent intersections
1120 double u2 = u_int2->first;
1122 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u2 ) < tolerance )
1128 // decide if we skipped a touching intersection
1129 if ( nbSamePnt + nbTgt > 0 )
1131 double minDot = std::numeric_limits<double>::max(), maxDot = -minDot;
1132 std::map< double, TInters >::iterator u_int = u_int1;
1133 for ( ; u_int != u_int2; ++u_int )
1135 if ( u_int->second._coincides ) continue;
1136 double dot = u_int->second._faceNorm * line.Direction();
1137 if ( dot > maxDot ) maxDot = dot;
1138 if ( dot < minDot ) minDot = dot;
1140 touchingInt = ( minDot*maxDot < 0 );
1145 if ( !hasPositionInfo || isOuterBoundary( u_int1->second._face ))
1156 u_int1 = u_int2; // to next intersection
1158 } // loop on intersections with one line
1162 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
1165 if ( nbIntBeforePoint == 0 || nbIntAfterPoint == 0)
1168 if ( nbIntBeforePoint + nbIntAfterPoint == 1 ) // not closed mesh
1169 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
1171 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
1174 if ( (f<0) == (l<0) )
1177 if ( hasPositionInfo )
1178 return nbIntBeforePoint % 2 ? TopAbs_IN : TopAbs_OUT;
1180 } // loop on intersections of the tree lines - thorough analysis
1182 if ( !hasPositionInfo )
1184 // gather info on faces position - is face in the outer boundary or not
1185 std::map< double, TInters > & u2inters = paramOnLine2TInters[ 0 ];
1186 findOuterBoundary( u2inters.begin()->second._face );
1189 } // two attempts - with and w/o faces position info in the mesh
1191 return TopAbs_UNKNOWN;
1194 //=======================================================================
1196 * \brief Return elements possibly intersecting the line
1198 //=======================================================================
1200 void SMESH_ElementSearcherImpl::
1201 GetElementsNearLine( const gp_Ax1& line,
1202 SMDSAbs_ElementType type,
1203 std::vector< const SMDS_MeshElement* >& foundElems)
1205 _elementType = type;
1206 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1208 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1210 ElementBndBoxTree::TElemSeq elems;
1211 ebbTree->getElementsNearLine( line, elems );
1213 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1216 //=======================================================================
1218 * Return elements whose bounding box intersects a sphere
1220 //=======================================================================
1222 void SMESH_ElementSearcherImpl::
1223 GetElementsInSphere( const gp_XYZ& center,
1224 const double radius,
1225 SMDSAbs_ElementType type,
1226 std::vector< const SMDS_MeshElement* >& foundElems)
1228 _elementType = type;
1229 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1231 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1233 ElementBndBoxTree::TElemSeq elems;
1234 ebbTree->getElementsInSphere( center, radius, elems );
1236 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1239 //=======================================================================
1241 * Return elements whose bounding box intersects a given bounding box
1243 //=======================================================================
1245 void SMESH_ElementSearcherImpl::
1246 GetElementsInBox( const Bnd_B3d& box,
1247 SMDSAbs_ElementType type,
1248 std::vector< const SMDS_MeshElement* >& foundElems)
1250 _elementType = type;
1251 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1253 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt, getTolerance() );
1255 ElementBndBoxTree::TElemSeq elems;
1256 ebbTree->getElementsInBox( box, elems );
1258 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1261 //=======================================================================
1263 * \brief Return a projection of a given point to a mesh.
1264 * Optionally return the closest element
1266 //=======================================================================
1268 gp_XYZ SMESH_ElementSearcherImpl::Project(const gp_Pnt& point,
1269 SMDSAbs_ElementType type,
1270 const SMDS_MeshElement** closestElem)
1272 _elementType = type;
1273 if ( _mesh->GetMeshInfo().NbElements( _elementType ) == 0 )
1274 throw SALOME_Exception( LOCALIZED( "No elements of given type in the mesh" ));
1276 ElementBndBoxTree*& ebbTree = _ebbTree[ _elementType ];
1278 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1280 gp_XYZ p = point.XYZ();
1281 ElementBndBoxTree* ebbLeaf = ebbTree->getLeafAtPoint( p );
1282 const Bnd_B3d* box = ebbLeaf ? ebbLeaf->getBox() : ebbTree->getBox();
1283 gp_XYZ pMin = box->CornerMin(), pMax = box->CornerMax();
1284 double radius = Precision::Infinite();
1285 if ( ebbLeaf || !box->IsOut( p ))
1287 for ( int i = 1; i <= 3; ++i )
1289 double d = 0.5 * ( pMax.Coord(i) - pMin.Coord(i) );
1290 if ( d > Precision::Confusion() )
1291 radius = Min( d, radius );
1294 radius /= ebbTree->getHeight( /*full=*/true );
1296 else // p outside of box
1298 for ( int i = 1; i <= 3; ++i )
1301 if ( point.Coord(i) < pMin.Coord(i) )
1302 d = pMin.Coord(i) - point.Coord(i);
1303 else if ( point.Coord(i) > pMax.Coord(i) )
1304 d = point.Coord(i) - pMax.Coord(i);
1305 if ( d > Precision::Confusion() )
1306 radius = Min( d, radius );
1310 ElementBndBoxTree::TElemSeq elems;
1311 ebbTree->getElementsInSphere( p, radius, elems );
1312 while ( elems.empty() && radius < 1e100 )
1315 ebbTree->getElementsInSphere( p, radius, elems );
1317 gp_XYZ proj, bestProj;
1318 const SMDS_MeshElement* elem = 0;
1319 double minDist = Precision::Infinite();
1320 ElementBndBoxTree::TElemSeq::iterator e = elems.begin();
1321 for ( ; e != elems.end(); ++e )
1323 double d = SMESH_MeshAlgos::GetDistance( *e, point, &proj );
1331 if ( minDist > radius )
1333 ElementBndBoxTree::TElemSeq elems2;
1334 ebbTree->getElementsInSphere( p, minDist, elems2 );
1335 for ( e = elems2.begin(); e != elems2.end(); ++e )
1337 if ( elems.count( *e ))
1339 double d = SMESH_MeshAlgos::GetDistance( *e, point, &proj );
1348 if ( closestElem ) *closestElem = elem;
1353 //=======================================================================
1355 * \brief Return true if the point is IN or ON of the element
1357 //=======================================================================
1359 bool SMESH_MeshAlgos::IsOut( const SMDS_MeshElement* element, const gp_Pnt& point, double tol )
1361 if ( element->GetType() == SMDSAbs_Volume)
1363 return SMDS_VolumeTool( element ).IsOut( point.X(), point.Y(), point.Z(), tol );
1366 // get ordered nodes
1368 std::vector< SMESH_TNodeXYZ > xyz; xyz.reserve( element->NbNodes()+1 );
1370 SMDS_NodeIteratorPtr nodeIt = element->interlacedNodesIterator();
1371 for ( int i = 0; nodeIt->more(); ++i )
1372 xyz.push_back( SMESH_TNodeXYZ( nodeIt->next() ));
1374 int i, nbNodes = (int) xyz.size(); // central node of biquadratic is missing
1376 if ( element->GetType() == SMDSAbs_Face ) // --------------------------------------------------
1378 // compute face normal
1379 gp_Vec faceNorm(0,0,0);
1380 xyz.push_back( xyz.front() );
1381 for ( i = 0; i < nbNodes; ++i )
1383 gp_Vec edge1( xyz[i+1], xyz[i]);
1384 gp_Vec edge2( xyz[i+1], xyz[(i+2)%nbNodes] );
1385 faceNorm += edge1 ^ edge2;
1387 double fNormSize = faceNorm.Magnitude();
1388 if ( fNormSize <= tol )
1390 // degenerated face: point is out if it is out of all face edges
1391 for ( i = 0; i < nbNodes; ++i )
1393 SMDS_LinearEdge edge( xyz[i]._node, xyz[i+1]._node );
1394 if ( !IsOut( &edge, point, tol ))
1399 faceNorm /= fNormSize;
1401 // check if the point lays on face plane
1402 gp_Vec n2p( xyz[0], point );
1403 double dot = n2p * faceNorm;
1404 if ( Abs( dot ) > tol ) // not on face plane
1407 if ( nbNodes > 3 ) // maybe the face is not planar
1409 double elemThick = 0;
1410 for ( i = 1; i < nbNodes; ++i )
1412 gp_Vec n2n( xyz[0], xyz[i] );
1413 elemThick = Max( elemThick, Abs( n2n * faceNorm ));
1415 isOut = Abs( dot ) > elemThick + tol;
1421 // check if point is out of face boundary:
1422 // define it by closest transition of a ray point->infinity through face boundary
1423 // on the face plane.
1424 // First, find normal of a plane perpendicular to face plane, to be used as a cutting tool
1425 // to find intersections of the ray with the boundary.
1427 gp_Vec plnNorm = ray ^ faceNorm;
1428 double n2pSize = plnNorm.Magnitude();
1429 if ( n2pSize <= tol ) return false; // point coincides with the first node
1430 if ( n2pSize * n2pSize > fNormSize * 100 ) return true; // point is very far
1432 // for each node of the face, compute its signed distance to the cutting plane
1433 std::vector<double> dist( nbNodes + 1);
1434 for ( i = 0; i < nbNodes; ++i )
1436 gp_Vec n2p( xyz[i], point );
1437 dist[i] = n2p * plnNorm;
1439 dist.back() = dist.front();
1440 // find the closest intersection
1442 double rClosest = 0, distClosest = 1e100;
1444 for ( i = 0; i < nbNodes; ++i )
1447 if ( fabs( dist[i] ) < tol )
1449 else if ( fabs( dist[i+1]) < tol )
1451 else if ( dist[i] * dist[i+1] < 0 )
1452 r = dist[i] / ( dist[i] - dist[i+1] );
1454 continue; // no intersection
1455 gp_Pnt pInt = xyz[i] * (1.-r) + xyz[i+1] * r;
1456 gp_Vec p2int( point, pInt);
1457 double intDist = p2int.SquareMagnitude();
1458 if ( intDist < distClosest )
1463 distClosest = intDist;
1467 return true; // no intesections - out
1469 // analyse transition
1470 gp_Vec edge( xyz[iClosest], xyz[iClosest+1] );
1471 gp_Vec edgeNorm = -( edge ^ faceNorm ); // normal to intersected edge pointing out of face
1472 gp_Vec p2int ( point, pClosest );
1473 bool out = (edgeNorm * p2int) < -tol;
1474 if ( rClosest > 0. && rClosest < 1. ) // not node intersection
1477 // the ray passes through a face node; analyze transition through an adjacent edge
1478 gp_Pnt p1 = xyz[ (rClosest == 0.) ? ((iClosest+nbNodes-1) % nbNodes) : (iClosest+1) ];
1479 gp_Pnt p2 = xyz[ (rClosest == 0.) ? iClosest : ((iClosest+2) % nbNodes) ];
1480 gp_Vec edgeAdjacent( p1, p2 );
1481 gp_Vec edgeNorm2 = -( edgeAdjacent ^ faceNorm );
1482 bool out2 = (edgeNorm2 * p2int) < -tol;
1484 bool covexCorner = ( edgeNorm * edgeAdjacent * (rClosest==1. ? 1. : -1.)) < 0;
1485 return covexCorner ? (out || out2) : (out && out2);
1488 if ( element->GetType() == SMDSAbs_Edge ) // --------------------------------------------------
1490 // point is out of edge if it is NOT ON any straight part of edge
1491 // (we consider quadratic edge as being composed of two straight parts)
1492 for ( i = 1; i < nbNodes; ++i )
1494 gp_Vec edge( xyz[i-1], xyz[i] );
1495 gp_Vec n1p ( xyz[i-1], point );
1496 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1498 if ( n1p.SquareMagnitude() < tol * tol )
1503 if ( point.SquareDistance( xyz[i] ) < tol * tol )
1507 gp_XYZ proj = ( 1. - u ) * xyz[i-1] + u * xyz[i]; // projection of the point on the edge
1508 double dist2 = point.SquareDistance( proj );
1509 if ( dist2 > tol * tol )
1511 return false; // point is ON this part
1516 // Node or 0D element -------------------------------------------------------------------------
1518 gp_Vec n2p ( xyz[0], point );
1519 return n2p.SquareMagnitude() > tol * tol;
1524 //=======================================================================
1527 // Position of a point relative to a segment
1531 // VERTEX 1 o----ON-----> VERTEX 2
1535 enum PositionName { POS_LEFT = 1, POS_VERTEX = 2, POS_RIGHT = 4, //POS_ON = 8,
1536 POS_ALL = POS_LEFT | POS_RIGHT | POS_VERTEX,
1537 POS_MAX = POS_RIGHT };
1541 int _index; // index of vertex or segment
1543 PointPos( PositionName n, int i=-1 ): _name(n), _index(i) {}
1544 bool operator < (const PointPos& other ) const
1546 if ( _name == other._name )
1547 return ( _index < 0 || other._index < 0 ) ? false : _index < other._index;
1548 return _name < other._name;
1552 //================================================================================
1554 * \brief Return position of a point relative to a segment
1555 * \param point2D - the point to analyze position of
1556 * \param segEnds - end points of segments
1557 * \param index0 - 0-based index of the first point of segment
1558 * \param posToFindOut - flags of positions to detect
1559 * \retval PointPos - point position
1561 //================================================================================
1563 PointPos getPointPosition( const gp_XY& point2D,
1564 const gp_XY* segEnds,
1565 const int index0 = 0,
1566 const int posToFindOut = POS_ALL)
1568 const gp_XY& p1 = segEnds[ index0 ];
1569 const gp_XY& p2 = segEnds[ index0+1 ];
1570 const gp_XY grad = p2 - p1;
1572 if ( posToFindOut & POS_VERTEX )
1574 // check if the point2D is at "vertex 1" zone
1575 gp_XY pp1[2] = { p1, gp_XY( p1.X() - grad.Y(),
1576 p1.Y() + grad.X() ) };
1577 if ( getPointPosition( point2D, pp1, 0, POS_LEFT|POS_RIGHT )._name == POS_LEFT )
1578 return PointPos( POS_VERTEX, index0 );
1580 // check if the point2D is at "vertex 2" zone
1581 gp_XY pp2[2] = { p2, gp_XY( p2.X() - grad.Y(),
1582 p2.Y() + grad.X() ) };
1583 if ( getPointPosition( point2D, pp2, 0, POS_LEFT|POS_RIGHT )._name == POS_RIGHT )
1584 return PointPos( POS_VERTEX, index0 + 1);
1586 double edgeEquation =
1587 ( point2D.X() - p1.X() ) * grad.Y() - ( point2D.Y() - p1.Y() ) * grad.X();
1588 return PointPos( edgeEquation < 0 ? POS_LEFT : POS_RIGHT, index0 );
1592 //=======================================================================
1594 * \brief Return minimal distance from a point to an element
1596 * Currently we ignore non-planarity and 2nd order of face
1598 //=======================================================================
1600 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshElement* elem,
1601 const gp_Pnt& point,
1602 gp_XYZ* closestPnt )
1604 switch ( elem->GetType() )
1606 case SMDSAbs_Volume:
1607 return GetDistance( static_cast<const SMDS_MeshVolume*>( elem ), point, closestPnt );
1609 return GetDistance( static_cast<const SMDS_MeshFace*>( elem ), point, closestPnt );
1611 return GetDistance( static_cast<const SMDS_MeshEdge*>( elem ), point, closestPnt );
1613 if ( closestPnt ) *closestPnt = SMESH_TNodeXYZ( elem );
1614 return point.Distance( SMESH_TNodeXYZ( elem ));
1620 //=======================================================================
1622 * \brief Return minimal distance from a point to a face
1624 * Currently we ignore non-planarity and 2nd order of face
1626 //=======================================================================
1628 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshFace* face,
1629 const gp_Pnt& point,
1630 gp_XYZ* closestPnt )
1632 const double badDistance = -1;
1633 if ( !face ) return badDistance;
1635 int nbCorners = face->NbCornerNodes();
1636 if ( nbCorners > 3 )
1638 std::vector< const SMDS_MeshNode* > nodes;
1639 int nbTria = SMESH_MeshAlgos::Triangulate().GetTriangles( face, nodes );
1641 double minDist = Precision::Infinite();
1643 for ( int i = 0; i < 3 * nbTria; i += 3 )
1645 SMDS_FaceOfNodes triangle( nodes[i], nodes[i+1], nodes[i+2] );
1646 double dist = GetDistance( &triangle, point, closestPnt );
1647 if ( dist < minDist )
1660 // coordinates of nodes (medium nodes, if any, ignored)
1661 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
1662 std::vector<gp_XYZ> xyz( TXyzIterator( face->nodesIterator()), TXyzIterator() );
1665 // transformation to get xyz[0] lies on the origin, xyz[1] lies on the Z axis,
1666 // and xyz[2] lies in the XZ plane. This is to pass to 2D space on XZ plane.
1668 gp_Vec OZ ( xyz[0], xyz[1] );
1669 gp_Vec OX ( xyz[0], xyz[2] );
1670 if ( OZ.Magnitude() < std::numeric_limits<double>::min() )
1672 if ( xyz.size() < 4 ) return badDistance;
1673 OZ = gp_Vec ( xyz[0], xyz[2] );
1674 OX = gp_Vec ( xyz[0], xyz[3] );
1678 tgtCS = gp_Ax3( xyz[0], OZ, OX );
1680 catch ( Standard_Failure& ) {
1683 trsf.SetTransformation( tgtCS );
1685 // move all the nodes to 2D
1686 std::vector<gp_XY> xy( xyz.size() );
1687 for ( size_t i = 0; i < 3; ++i )
1689 gp_XYZ p3d = xyz[i];
1690 trsf.Transforms( p3d );
1691 xy[i].SetCoord( p3d.X(), p3d.Z() );
1693 xyz.back() = xyz.front();
1694 xy.back() = xy.front();
1696 // // move the point in 2D
1697 gp_XYZ tmpPnt = point.XYZ();
1698 trsf.Transforms( tmpPnt );
1699 gp_XY point2D( tmpPnt.X(), tmpPnt.Z() );
1701 // loop on edges of the face to analyze point position ralative to the face
1702 std::vector< PointPos > pntPosByType[ POS_MAX + 1 ];
1703 for ( size_t i = 1; i < xy.size(); ++i )
1705 PointPos pos = getPointPosition( point2D, &xy[0], i-1 );
1706 pntPosByType[ pos._name ].push_back( pos );
1711 double dist = badDistance;
1713 if ( pntPosByType[ POS_LEFT ].size() > 0 ) // point is most close to an edge
1715 PointPos& pos = pntPosByType[ POS_LEFT ][0];
1717 gp_Vec edge( xyz[ pos._index ], xyz[ pos._index+1 ]);
1718 gp_Vec n1p ( xyz[ pos._index ], point );
1719 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1720 gp_XYZ proj = xyz[ pos._index ] + u * edge.XYZ(); // projection on the edge
1721 dist = point.Distance( proj );
1722 if ( closestPnt ) *closestPnt = proj;
1725 else if ( pntPosByType[ POS_RIGHT ].size() >= 2 ) // point is inside the face
1727 dist = Abs( tmpPnt.Y() );
1730 if ( dist < std::numeric_limits<double>::min() ) {
1731 *closestPnt = point.XYZ();
1735 trsf.Inverted().Transforms( tmpPnt );
1736 *closestPnt = tmpPnt;
1741 else if ( pntPosByType[ POS_VERTEX ].size() > 0 ) // point is most close to a node
1743 double minDist2 = Precision::Infinite();
1744 for ( size_t i = 0; i < pntPosByType[ POS_VERTEX ].size(); ++i )
1746 PointPos& pos = pntPosByType[ POS_VERTEX ][i];
1748 double d2 = point.SquareDistance( xyz[ pos._index ]);
1749 if ( minDist2 > d2 )
1751 if ( closestPnt ) *closestPnt = xyz[ pos._index ];
1755 dist = Sqrt( minDist2 );
1761 //=======================================================================
1763 * \brief Return minimal distance from a point to an edge
1765 //=======================================================================
1767 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshEdge* seg,
1768 const gp_Pnt& point,
1769 gp_XYZ* closestPnt )
1771 double dist = Precision::Infinite();
1772 if ( !seg ) return dist;
1774 int i = 0, nbNodes = seg->NbNodes();
1776 std::vector< SMESH_TNodeXYZ > xyz( nbNodes );
1777 for ( SMDS_NodeIteratorPtr nodeIt = seg->interlacedNodesIterator(); nodeIt->more(); i++ )
1778 xyz[ i ].Set( nodeIt->next() );
1780 for ( i = 1; i < nbNodes; ++i )
1782 gp_Vec edge( xyz[i-1], xyz[i] );
1783 gp_Vec n1p ( xyz[i-1], point );
1784 double d, u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1786 if (( d = n1p.SquareMagnitude() ) < dist ) {
1788 if ( closestPnt ) *closestPnt = xyz[i-1];
1791 else if ( u >= 1. ) {
1792 if (( d = point.SquareDistance( xyz[i] )) < dist ) {
1794 if ( closestPnt ) *closestPnt = xyz[i];
1798 gp_XYZ proj = xyz[i-1] + u * edge.XYZ(); // projection of the point on the edge
1799 if (( d = point.SquareDistance( proj )) < dist ) {
1801 if ( closestPnt ) *closestPnt = proj;
1805 return Sqrt( dist );
1808 //=======================================================================
1810 * \brief Return minimal distance from a point to a volume
1812 * Currently we ignore non-planarity and 2nd order
1814 //=======================================================================
1816 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshVolume* volume,
1817 const gp_Pnt& point,
1818 gp_XYZ* closestPnt )
1820 SMDS_VolumeTool vTool( volume );
1821 vTool.SetExternalNormal();
1822 const int iQ = volume->IsQuadratic() ? 2 : 1;
1825 double minDist = 1e100, dist;
1826 gp_XYZ closeP = point.XYZ();
1828 for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
1830 // skip a facet with normal not "looking at" the point
1831 if ( !vTool.GetFaceNormal( iF, n[0], n[1], n[2] ) ||
1832 !vTool.GetFaceBaryCenter( iF, bc[0], bc[1], bc[2] ))
1834 gp_XYZ bcp = point.XYZ() - gp_XYZ( bc[0], bc[1], bc[2] );
1835 if ( gp_XYZ( n[0], n[1], n[2] ) * bcp < -1e-12 )
1838 // find distance to a facet
1839 const SMDS_MeshNode** nodes = vTool.GetFaceNodes( iF );
1840 switch ( vTool.NbFaceNodes( iF ) / iQ ) {
1843 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ] );
1844 dist = GetDistance( &tmpFace, point, closestPnt );
1849 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ], nodes[ 3*iQ ]);
1850 dist = GetDistance( &tmpFace, point, closestPnt );
1854 std::vector<const SMDS_MeshNode *> nvec( nodes, nodes + vTool.NbFaceNodes( iF ));
1855 SMDS_PolygonalFaceOfNodes tmpFace( nvec );
1856 dist = GetDistance( &tmpFace, point, closestPnt );
1858 if ( dist < minDist )
1862 if ( closestPnt ) closeP = *closestPnt;
1867 if ( closestPnt ) *closestPnt = closeP;
1871 return 0; // point is inside the volume
1874 //================================================================================
1876 * \brief Returns barycentric coordinates of a point within a triangle.
1877 * A not returned bc2 = 1. - bc0 - bc1.
1878 * The point lies within the triangle if ( bc0 >= 0 && bc1 >= 0 && bc0+bc1 <= 1 )
1880 //================================================================================
1882 void SMESH_MeshAlgos::GetBarycentricCoords( const gp_XY& p,
1889 const double // matrix 2x2
1890 T11 = t0.X()-t2.X(), T12 = t1.X()-t2.X(),
1891 T21 = t0.Y()-t2.Y(), T22 = t1.Y()-t2.Y();
1892 const double Tdet = T11*T22 - T12*T21; // matrix determinant
1893 if ( Abs( Tdet ) < std::numeric_limits<double>::min() )
1899 const double t11 = T22, t12 = -T12, t21 = -T21, t22 = T11;
1901 const double r11 = p.X()-t2.X(), r12 = p.Y()-t2.Y();
1902 // barycentric coordinates: multiply matrix by vector
1903 bc0 = (t11 * r11 + t12 * r12)/Tdet;
1904 bc1 = (t21 * r11 + t22 * r12)/Tdet;
1907 //=======================================================================
1908 //function : FindFaceInSet
1909 //purpose : Return a face having linked nodes n1 and n2 and which is
1910 // - not in avoidSet,
1911 // - in elemSet provided that !elemSet.empty()
1912 // i1 and i2 optionally returns indices of n1 and n2
1913 //=======================================================================
1915 const SMDS_MeshElement*
1916 SMESH_MeshAlgos::FindFaceInSet(const SMDS_MeshNode* n1,
1917 const SMDS_MeshNode* n2,
1918 const TIDSortedElemSet& elemSet,
1919 const TIDSortedElemSet& avoidSet,
1925 const SMDS_MeshElement* face = 0;
1927 SMDS_ElemIteratorPtr invElemIt = n1->GetInverseElementIterator(SMDSAbs_Face);
1928 while ( invElemIt->more() && !face ) // loop on inverse faces of n1
1930 const SMDS_MeshElement* elem = invElemIt->next();
1931 if (avoidSet.count( elem ))
1933 if ( !elemSet.empty() && !elemSet.count( elem ))
1936 i1 = elem->GetNodeIndex( n1 );
1937 // find a n2 linked to n1
1938 int nbN = elem->IsQuadratic() ? elem->NbNodes()/2 : elem->NbNodes();
1939 for ( int di = -1; di < 2 && !face; di += 2 )
1941 i2 = (i1+di+nbN) % nbN;
1942 if ( elem->GetNode( i2 ) == n2 )
1945 if ( !face && elem->IsQuadratic())
1947 // analysis for quadratic elements using all nodes
1948 SMDS_NodeIteratorPtr anIter = elem->interlacedNodesIterator();
1949 const SMDS_MeshNode* prevN = static_cast<const SMDS_MeshNode*>( anIter->next() );
1950 for ( i1 = -1, i2 = 0; anIter->more() && !face; i1++, i2++ )
1952 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( anIter->next() );
1953 if ( n1 == prevN && n2 == n )
1957 else if ( n2 == prevN && n1 == n )
1959 face = elem; std::swap( i1, i2 );
1965 if ( n1ind ) *n1ind = i1;
1966 if ( n2ind ) *n2ind = i2;
1970 //================================================================================
1972 * Return sharp edges of faces and non-manifold ones. Optionally adds existing edges.
1974 //================================================================================
1976 std::vector< SMESH_MeshAlgos::Edge >
1977 SMESH_MeshAlgos::FindSharpEdges( SMDS_Mesh* theMesh,
1979 bool theAddExisting )
1981 std::vector< Edge > resultEdges;
1982 if ( !theMesh ) return resultEdges;
1984 typedef std::pair< bool, const SMDS_MeshNode* > TIsSharpAndMedium;
1985 typedef NCollection_DataMap< SMESH_TLink, TIsSharpAndMedium, SMESH_TLink > TLinkSharpMap;
1987 TLinkSharpMap linkIsSharp;
1988 Standard_Integer nbBuckets = FromSmIdType<Standard_Integer>( theMesh->NbFaces() );
1989 if ( nbBuckets > 0 )
1990 linkIsSharp.ReSize( nbBuckets );
1992 TIsSharpAndMedium sharpMedium( true, 0 );
1993 bool & isSharp = sharpMedium.first;
1994 const SMDS_MeshNode* & nMedium = sharpMedium.second;
1996 if ( theAddExisting )
1998 for ( SMDS_EdgeIteratorPtr edgeIt = theMesh->edgesIterator(); edgeIt->more(); )
2000 const SMDS_MeshElement* edge = edgeIt->next();
2001 nMedium = ( edge->IsQuadratic() ) ? edge->GetNode(2) : 0;
2002 linkIsSharp.Bind( SMESH_TLink( edge->GetNode(0), edge->GetNode(1)), sharpMedium );
2006 // check angles between face normals
2008 const double angleCos = Cos( theAngle * M_PI / 180. ), angleCos2 = angleCos * angleCos;
2009 gp_XYZ norm1, norm2;
2010 std::vector< const SMDS_MeshNode* > faceNodes, linkNodes(2);
2011 std::vector<const SMDS_MeshElement *> linkFaces;
2013 int nbSharp = linkIsSharp.Extent();
2014 for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
2016 const SMDS_MeshElement* face = faceIt->next();
2017 size_t nbCorners = face->NbCornerNodes();
2019 faceNodes.assign( face->begin_nodes(), face->end_nodes() );
2020 if ( faceNodes.size() == nbCorners )
2021 faceNodes.resize( nbCorners * 2, 0 );
2023 const SMDS_MeshNode* nPrev = faceNodes[ nbCorners-1 ];
2024 for ( size_t i = 0; i < nbCorners; ++i )
2026 SMESH_TLink link( nPrev, faceNodes[i] );
2027 if ( !linkIsSharp.IsBound( link ))
2029 linkNodes[0] = link.node1();
2030 linkNodes[1] = link.node2();
2032 theMesh->GetElementsByNodes( linkNodes, linkFaces, SMDSAbs_Face );
2035 if ( linkFaces.size() > 2 )
2039 else if ( linkFaces.size() == 2 &&
2040 FaceNormal( linkFaces[0], norm1, /*normalize=*/false ) &&
2041 FaceNormal( linkFaces[1], norm2, /*normalize=*/false ))
2043 double dot = norm1 * norm2; // == cos * |norm1| * |norm2|
2044 if (( dot < 0 ) == ( angleCos < 0 ))
2046 double cos2 = dot * dot / norm1.SquareModulus() / norm2.SquareModulus();
2047 isSharp = ( angleCos < 0 ) ? ( cos2 > angleCos2 ) : ( cos2 < angleCos2 );
2051 isSharp = ( angleCos > 0 );
2054 nMedium = faceNodes[( i-1+nbCorners ) % nbCorners + nbCorners ];
2056 linkIsSharp.Bind( link, sharpMedium );
2060 nPrev = faceNodes[i];
2064 resultEdges.resize( nbSharp );
2065 TLinkSharpMap::Iterator linkIsSharpIter( linkIsSharp );
2066 for ( int i = 0; linkIsSharpIter.More() && i < nbSharp; linkIsSharpIter.Next() )
2068 const SMESH_TLink& link = linkIsSharpIter.Key();
2069 const TIsSharpAndMedium& isSharpMedium = linkIsSharpIter.Value();
2070 if ( isSharpMedium.first )
2072 Edge & edge = resultEdges[ i++ ];
2073 edge._node1 = link.node1();
2074 edge._node2 = link.node2();
2075 edge._medium = isSharpMedium.second;
2082 //================================================================================
2084 * Distribute all faces of the mesh between groups using given edges as group boundaries
2086 //================================================================================
2088 std::vector< std::vector< const SMDS_MeshElement* > >
2089 SMESH_MeshAlgos::SeparateFacesByEdges( SMDS_Mesh* theMesh, const std::vector< Edge >& theEdges )
2091 std::vector< std::vector< const SMDS_MeshElement* > > groups;
2092 if ( !theMesh ) return groups;
2094 // build map of face edges (SMESH_TLink) and their faces
2096 typedef std::vector< const SMDS_MeshElement* > TFaceVec;
2097 typedef NCollection_DataMap< SMESH_TLink, TFaceVec, SMESH_TLink > TFacesByLinks;
2098 TFacesByLinks facesByLink;
2099 Standard_Integer nbBuckets = FromSmIdType<Standard_Integer>( theMesh->NbFaces() );
2100 if ( nbBuckets > 0 )
2101 facesByLink.ReSize( nbBuckets );
2103 std::vector< const SMDS_MeshNode* > faceNodes;
2104 for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
2106 const SMDS_MeshElement* face = faceIt->next();
2107 size_t nbCorners = face->NbCornerNodes();
2109 faceNodes.assign( face->begin_nodes(), face->end_nodes() );
2110 faceNodes.resize( nbCorners + 1 );
2111 faceNodes[ nbCorners ] = faceNodes[0];
2113 face->setIsMarked( false );
2115 for ( size_t i = 0; i < nbCorners; ++i )
2117 SMESH_TLink link( faceNodes[i], faceNodes[i+1] );
2118 TFaceVec* linkFaces = facesByLink.ChangeSeek( link );
2121 linkFaces = facesByLink.Bound( link, TFaceVec() );
2122 linkFaces->reserve(2);
2124 linkFaces->push_back( face );
2128 // remove the given edges from facesByLink map
2130 for ( size_t i = 0; i < theEdges.size(); ++i )
2132 SMESH_TLink link( theEdges[i]._node1, theEdges[i]._node2 );
2133 facesByLink.UnBind( link );
2136 // faces connected via links of facesByLink map form a group
2138 while ( !facesByLink.IsEmpty() )
2140 groups.push_back( TFaceVec() );
2141 TFaceVec & group = groups.back();
2143 group.push_back( TFacesByLinks::Iterator( facesByLink ).Value()[0] );
2144 group.back()->setIsMarked( true );
2146 for ( size_t iF = 0; iF < group.size(); ++iF )
2148 const SMDS_MeshElement* face = group[iF];
2149 size_t nbCorners = face->NbCornerNodes();
2150 faceNodes.assign( face->begin_nodes(), face->end_nodes() );
2151 faceNodes.resize( nbCorners + 1 );
2152 faceNodes[ nbCorners ] = faceNodes[0];
2154 for ( size_t iN = 0; iN < nbCorners; ++iN )
2156 SMESH_TLink link( faceNodes[iN], faceNodes[iN+1] );
2157 if ( const TFaceVec* faces = facesByLink.Seek( link ))
2159 const TFaceVec& faceNeighbors = *faces;
2160 for ( size_t i = 0; i < faceNeighbors.size(); ++i )
2161 if ( !faceNeighbors[i]->isMarked() )
2163 group.push_back( faceNeighbors[i] );
2164 faceNeighbors[i]->setIsMarked( true );
2166 facesByLink.UnBind( link );
2172 // find faces that are alone in its group; they were not in facesByLink
2175 for ( size_t i = 0; i < groups.size(); ++i )
2176 nbInGroups += groups[i].size();
2177 if ( nbInGroups < theMesh->NbFaces() )
2179 for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
2181 const SMDS_MeshElement* face = faceIt->next();
2182 if ( !face->isMarked() )
2184 groups.push_back( TFaceVec() );
2185 groups.back().push_back( face );
2193 //================================================================================
2195 * \brief Calculate normal of a mesh face
2197 //================================================================================
2199 bool SMESH_MeshAlgos::FaceNormal(const SMDS_MeshElement* F, gp_XYZ& normal, bool normalized)
2201 if ( !F || F->GetType() != SMDSAbs_Face )
2204 normal.SetCoord(0,0,0);
2205 int nbNodes = F->NbCornerNodes();
2206 for ( int i = 0; i < nbNodes-2; ++i )
2209 for ( int n = 0; n < 3; ++n )
2211 const SMDS_MeshNode* node = F->GetNode( i + n );
2212 p[n].SetCoord( node->X(), node->Y(), node->Z() );
2214 normal += ( p[2] - p[1] ) ^ ( p[0] - p[1] );
2216 double size2 = normal.SquareModulus();
2217 bool ok = ( size2 > std::numeric_limits<double>::min() * std::numeric_limits<double>::min());
2218 if ( normalized && ok )
2219 normal /= sqrt( size2 );
2224 //================================================================================
2226 * \brief Return nodes common to two elements
2228 //================================================================================
2230 int SMESH_MeshAlgos::NbCommonNodes(const SMDS_MeshElement* e1,
2231 const SMDS_MeshElement* e2)
2234 for ( int i = 0 ; i < e1->NbNodes(); ++i )
2235 nb += ( e2->GetNodeIndex( e1->GetNode( i )) >= 0 );
2239 //================================================================================
2241 * \brief Return nodes common to two elements
2243 //================================================================================
2245 std::vector< const SMDS_MeshNode*> SMESH_MeshAlgos::GetCommonNodes(const SMDS_MeshElement* e1,
2246 const SMDS_MeshElement* e2)
2248 std::vector< const SMDS_MeshNode*> common;
2249 for ( int i = 0 ; i < e1->NbNodes(); ++i )
2250 if ( e2->GetNodeIndex( e1->GetNode( i )) >= 0 )
2251 common.push_back( e1->GetNode( i ));
2255 //================================================================================
2257 * \brief Return true if a node is on a boundary of 2D mesh.
2258 * Optionally returns two neighboring boundary nodes (or more in non-manifold mesh)
2260 //================================================================================
2262 bool SMESH_MeshAlgos::IsOn2DBoundary( const SMDS_MeshNode* theNode,
2263 std::vector< const SMDS_MeshNode*> * theNeibors )
2265 typedef NCollection_DataMap< SMESH_TLink, int, SMESH_TLink > TLinkCountMap;
2266 TLinkCountMap linkCountMap( 10 );
2268 int nbFreeLinks = 0;
2269 for ( SMDS_ElemIteratorPtr fIt = theNode->GetInverseElementIterator(SMDSAbs_Face); fIt->more(); )
2271 const SMDS_MeshElement* face = fIt->next();
2272 const int nbCorners = face->NbCornerNodes();
2274 int iN = face->GetNodeIndex( theNode );
2275 int iPrev = ( iN - 1 + nbCorners ) % nbCorners;
2276 int iNext = ( iN + 1 ) % nbCorners;
2278 for ( int i : { iPrev, iNext } )
2280 SMESH_TLink link( theNode, face->GetNode( i ));
2281 int* count = linkCountMap.ChangeSeek( link );
2282 if ( count ) ++( *count );
2283 else linkCountMap.Bind( link, 1 );
2285 if ( !count ) ++nbFreeLinks;
2292 theNeibors->clear();
2293 theNeibors->reserve( nbFreeLinks );
2294 for ( TLinkCountMap::Iterator linkIt( linkCountMap ); linkIt.More(); linkIt.Next() )
2295 if ( linkIt.Value() == 1 )
2297 theNeibors->push_back( linkIt.Key().node1() );
2298 if ( theNeibors->back() == theNode )
2299 theNeibors->back() = linkIt.Key().node2();
2302 return nbFreeLinks > 0;
2305 //================================================================================
2307 * \brief Return true if node1 encounters first in the face and node2, after
2309 //================================================================================
2311 bool SMESH_MeshAlgos::IsRightOrder( const SMDS_MeshElement* face,
2312 const SMDS_MeshNode* node0,
2313 const SMDS_MeshNode* node1 )
2315 int i0 = face->GetNodeIndex( node0 );
2316 int i1 = face->GetNodeIndex( node1 );
2317 if ( face->IsQuadratic() )
2319 if ( face->IsMediumNode( node0 ))
2321 i0 -= ( face->NbNodes()/2 - 1 );
2326 i1 -= ( face->NbNodes()/2 - 1 );
2331 return ( diff == 1 ) || ( diff == -face->NbNodes()+1 );
2334 //=======================================================================
2336 * \brief Partition given 1D elements into groups of contiguous edges.
2337 * A node where number of meeting edges != 2 is a group end.
2338 * An optional startNode is used to orient groups it belongs to.
2339 * \return a list of edge groups and a list of corresponding node groups.
2340 * If a group is closed, the first and last nodes of the group are same.
2342 //=======================================================================
2344 void SMESH_MeshAlgos::Get1DBranches( SMDS_ElemIteratorPtr theEdgeIt,
2345 TElemGroupVector& theEdgeGroups,
2346 TNodeGroupVector& theNodeGroups,
2347 const SMDS_MeshNode* theStartNode )
2352 // build map of nodes and their adjacent edges
2354 typedef std::vector< const SMDS_MeshNode* > TNodeVec;
2355 typedef std::vector< const SMDS_MeshElement* > TEdgeVec;
2356 typedef NCollection_DataMap< const SMDS_MeshNode*, TEdgeVec, SMESH_Hasher > TEdgesByNodeMap;
2357 TEdgesByNodeMap edgesByNode;
2359 while ( theEdgeIt->more() )
2361 const SMDS_MeshElement* edge = theEdgeIt->next();
2362 if ( edge->GetType() != SMDSAbs_Edge )
2365 const SMDS_MeshNode* nodes[2] = { edge->GetNode(0), edge->GetNode(1) };
2366 for ( int i = 0; i < 2; ++i )
2368 TEdgeVec* nodeEdges = edgesByNode.ChangeSeek( nodes[i] );
2371 nodeEdges = edgesByNode.Bound( nodes[i], TEdgeVec() );
2372 nodeEdges->reserve(2);
2374 nodeEdges->push_back( edge );
2378 if ( edgesByNode.IsEmpty() )
2382 // build edge branches
2384 TElemGroupVector branches(2);
2385 TNodeGroupVector nodeBranches(2);
2387 while ( !edgesByNode.IsEmpty() )
2389 if ( !theStartNode || !edgesByNode.IsBound( theStartNode ))
2391 theStartNode = TEdgesByNodeMap::Iterator( edgesByNode ).Key();
2394 size_t nbBranches = 0;
2395 bool startIsBranchEnd = false;
2397 while ( edgesByNode.IsBound( theStartNode ))
2399 // initialize a new branch
2402 if ( branches.size() < nbBranches )
2404 branches.push_back ( TEdgeVec() );
2405 nodeBranches.push_back( TNodeVec() );
2407 TEdgeVec & branch = branches [ nbBranches - 1 ];
2408 TNodeVec & nodeBranch = nodeBranches[ nbBranches - 1 ];
2412 TEdgeVec& edges = edgesByNode( theStartNode );
2413 startIsBranchEnd = ( edges.size() != 2 );
2416 const SMDS_MeshElement* startEdge = 0;
2417 for ( size_t i = 0; i < edges.size(); ++i )
2419 if ( !startEdge && edges[i] )
2421 startEdge = edges[i];
2424 nbEdges += bool( edges[i] );
2427 edgesByNode.UnBind( theStartNode );
2431 branch.push_back( startEdge );
2433 nodeBranch.push_back( theStartNode );
2434 nodeBranch.push_back( branch.back()->GetNode(0) );
2435 if ( nodeBranch.back() == theStartNode )
2436 nodeBranch.back() = branch.back()->GetNode(1);
2441 bool isBranchEnd = false;
2444 while (( !isBranchEnd ) && ( edgesPtr = edgesByNode.ChangeSeek( nodeBranch.back() )))
2446 TEdgeVec& edges = *edgesPtr;
2448 isBranchEnd = ( edges.size() != 2 );
2450 const SMDS_MeshNode* lastNode = nodeBranch.back();
2452 switch ( edges.size() )
2455 edgesByNode.UnBind( lastNode );
2460 if ( const SMDS_MeshElement* nextEdge = edges[ edges[0] == branch.back() ])
2462 branch.push_back( nextEdge );
2464 const SMDS_MeshNode* nextNode = nextEdge->GetNode(0);
2465 if ( nodeBranch.back() == nextNode )
2466 nextNode = nextEdge->GetNode(1);
2467 nodeBranch.push_back( nextNode );
2469 edgesByNode.UnBind( lastNode );
2475 for ( size_t i = 0; i < edges.size(); ++i )
2477 if ( edges[i] == branch.back() )
2479 nbEdges += bool( edges[i] );
2482 edgesByNode.UnBind( lastNode );
2485 } // while ( edgesByNode.IsBound( theStartNode ))
2488 // put the found branches to the result
2490 if ( nbBranches == 2 && !startIsBranchEnd ) // join two branches starting at the same node
2492 std::reverse( nodeBranches[0].begin(), nodeBranches[0].end() );
2493 nodeBranches[0].pop_back();
2494 nodeBranches[0].reserve( nodeBranches[0].size() + nodeBranches[1].size() );
2495 nodeBranches[0].insert( nodeBranches[0].end(),
2496 nodeBranches[1].begin(), nodeBranches[1].end() );
2498 std::reverse( branches[0].begin(), branches[0].end() );
2499 branches[0].reserve( branches[0].size() + branches[1].size() );
2500 branches[0].insert( branches[0].end(), branches[1].begin(), branches[1].end() );
2502 nodeBranches[1].clear();
2503 branches[1].clear();
2506 for ( size_t i = 0; i < nbBranches; ++i )
2508 if ( branches[i].empty() )
2511 theEdgeGroups.push_back( TEdgeVec() );
2512 theEdgeGroups.back().swap( branches[i] );
2514 theNodeGroups.push_back( TNodeVec() );
2515 theNodeGroups.back().swap( nodeBranches[i] );
2518 } // while ( !edgesByNode.IsEmpty() )
2523 //=======================================================================
2525 * \brief Return SMESH_NodeSearcher
2527 //=======================================================================
2529 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_Mesh& mesh)
2531 return new SMESH_NodeSearcherImpl( &mesh );
2534 //=======================================================================
2536 * \brief Return SMESH_NodeSearcher
2538 //=======================================================================
2540 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_ElemIteratorPtr elemIt)
2542 return new SMESH_NodeSearcherImpl( 0, elemIt );
2545 //=======================================================================
2547 * \brief Return SMESH_ElementSearcher
2549 //=======================================================================
2551 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
2554 return new SMESH_ElementSearcherImpl( mesh, tolerance );
2557 //=======================================================================
2559 * \brief Return SMESH_ElementSearcher acting on a sub-set of elements
2561 //=======================================================================
2563 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
2564 SMDS_ElemIteratorPtr elemIt,
2567 return new SMESH_ElementSearcherImpl( mesh, tolerance, elemIt );