1 // Copyright (C) 2007-2024 CEA, EDF, 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;
258 typedef ObjectPool< ElementBox > TElementBoxPool;
260 //!< allocator of ElementBox's and SMESH_TreeLimit
261 struct LimitAndPool : public SMESH_TreeLimit
263 TElementBoxPool _elBoPool;
264 LimitAndPool():SMESH_TreeLimit( MaxLevel, /*minSize=*/0. ) {}
266 LimitAndPool* getLimitAndPool() const
268 SMESH_TreeLimit* limitAndPool = const_cast< SMESH_TreeLimit* >( myLimit );
269 return static_cast< LimitAndPool* >( limitAndPool );
273 //================================================================================
275 * \brief ElementBndBoxTree creation
277 //================================================================================
279 ElementBndBoxTree::ElementBndBoxTree(const SMDS_Mesh& mesh,
280 SMDSAbs_ElementType elemType,
281 SMDS_ElemIteratorPtr theElemIt,
283 :SMESH_Octree( new LimitAndPool() )
285 smIdType nbElems = mesh.GetMeshInfo().NbElements( elemType );
286 _elements.reserve( nbElems );
288 TElementBoxPool& elBoPool = getLimitAndPool()->_elBoPool;
290 if (SALOME::VerbosityActivated() && theElemIt && !theElemIt->more() )
291 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 Redistribute 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 );
345 // child->_name = _name + char('0' + j);
346 // if ( child->isLeaf() && child->_elements.size() )
348 // cout << child->_name << " ";
349 // for ( size_t i = 0; i < child->_elements.size(); ++i )
350 // cout << child->_elements[i]->_element->GetID() << " ";
356 //================================================================================
358 * \brief Return elements which can include the point
360 //================================================================================
362 void ElementBndBoxTree::getElementsNearPoint( const gp_Pnt& point, TElemSeq& foundElems)
364 if ( getBox()->IsOut( point.XYZ() ))
369 for ( size_t i = 0; i < _elements.size(); ++i )
370 if ( !_elements[i]->IsOut( point.XYZ() ))
371 foundElems.insert( _elements[i]->_element );
375 for (int i = 0; i < 8; i++)
376 ((ElementBndBoxTree*) myChildren[i])->getElementsNearPoint( point, foundElems );
380 //================================================================================
382 * \brief Return elements which can be intersected by the line
384 //================================================================================
386 void ElementBndBoxTree::getElementsNearLine( const gp_Ax1& line, TElemSeq& foundElems )
388 if ( getBox()->IsOut( line ))
393 for ( size_t i = 0; i < _elements.size(); ++i )
394 if ( !_elements[i]->IsOut( line ) )
395 foundElems.insert( _elements[i]->_element );
399 for (int i = 0; i < 8; i++)
400 ((ElementBndBoxTree*) myChildren[i])->getElementsNearLine( line, foundElems );
404 //================================================================================
406 * \brief Return elements from leaves intersecting the sphere
408 //================================================================================
410 void ElementBndBoxTree::getElementsInSphere ( const gp_XYZ& center,
412 TElemSeq& foundElems)
414 if ( getBox()->IsOut( center, radius ))
419 for ( size_t i = 0; i < _elements.size(); ++i )
420 if ( !_elements[i]->IsOut( center, radius ))
421 foundElems.insert( _elements[i]->_element );
425 for (int i = 0; i < 8; i++)
426 ((ElementBndBoxTree*) myChildren[i])->getElementsInSphere( center, radius, foundElems );
430 //================================================================================
432 * \brief Return elements from leaves intersecting the box
434 //================================================================================
436 void ElementBndBoxTree::getElementsInBox( const Bnd_B3d& box, TElemSeq& foundElems )
438 if ( getBox()->IsOut( box ))
443 for ( size_t i = 0; i < _elements.size(); ++i )
444 if ( !_elements[i]->IsOut( box ))
445 foundElems.insert( _elements[i]->_element );
449 for (int i = 0; i < 8; i++)
450 ((ElementBndBoxTree*) myChildren[i])->getElementsInBox( box, foundElems );
454 //================================================================================
456 * \brief Return a leaf including a point
458 //================================================================================
460 ElementBndBoxTree* ElementBndBoxTree::getLeafAtPoint( const gp_XYZ& point )
462 if ( getBox()->IsOut( point ))
471 for (int i = 0; i < 8; i++)
472 if ( ElementBndBoxTree* l = ((ElementBndBoxTree*) myChildren[i])->getLeafAtPoint( point ))
478 //================================================================================
480 * \brief Return number of elements
482 //================================================================================
484 int ElementBndBoxTree::getNbElements()
489 nb = _elements.size();
493 for (int i = 0; i < 8; i++)
494 nb += ((ElementBndBoxTree*) myChildren[i])->getNbElements();
499 //================================================================================
501 * \brief Construct the element box
503 //================================================================================
505 void ElementBndBoxTree::ElementBox::init(const SMDS_MeshElement* elem, double tolerance)
508 SMDS_ElemIteratorPtr nIt = elem->nodesIterator();
509 while ( nIt->more() )
510 Add( SMESH_NodeXYZ( nIt->next() ));
511 Enlarge( tolerance );
516 //=======================================================================
518 * \brief Implementation of search for the elements by point and
519 * of classification of point in 2D mesh
521 //=======================================================================
523 SMESH_ElementSearcher::~SMESH_ElementSearcher()
527 struct SMESH_ElementSearcherImpl: public SMESH_ElementSearcher
530 SMDS_ElemIteratorPtr _meshPartIt;
531 ElementBndBoxTree* _ebbTree [SMDSAbs_NbElementTypes];
532 int _ebbTreeHeight[SMDSAbs_NbElementTypes];
533 SMESH_NodeSearcherImpl* _nodeSearcher;
534 SMDSAbs_ElementType _elementType;
536 bool _outerFacesFound;
537 std::set<const SMDS_MeshElement*> _outerFaces; // empty means "no internal faces at all"
539 SMESH_ElementSearcherImpl( SMDS_Mesh& mesh,
541 SMDS_ElemIteratorPtr elemIt=SMDS_ElemIteratorPtr())
542 : _mesh(&mesh),_meshPartIt(elemIt),_nodeSearcher(0),_tolerance(tol),_outerFacesFound(false)
544 for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
547 _ebbTreeHeight[i] = -1;
549 _elementType = SMDSAbs_All;
551 virtual ~SMESH_ElementSearcherImpl()
553 for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
555 delete _ebbTree[i]; _ebbTree[i] = NULL;
557 if ( _nodeSearcher ) delete _nodeSearcher;
560 virtual int FindElementsByPoint(const gp_Pnt& point,
561 SMDSAbs_ElementType type,
562 std::vector< const SMDS_MeshElement* >& foundElements);
563 virtual TopAbs_State GetPointState(const gp_Pnt& point);
564 virtual const SMDS_MeshElement* FindClosestTo( const gp_Pnt& point,
565 SMDSAbs_ElementType type );
567 virtual void GetElementsNearLine( const gp_Ax1& line,
568 SMDSAbs_ElementType type,
569 std::vector< const SMDS_MeshElement* >& foundElems);
570 virtual void GetElementsInSphere( const gp_XYZ& center,
572 SMDSAbs_ElementType type,
573 std::vector< const SMDS_MeshElement* >& foundElems);
574 virtual void GetElementsInBox( const Bnd_B3d& box,
575 SMDSAbs_ElementType type,
576 std::vector< const SMDS_MeshElement* >& foundElems);
577 virtual gp_XYZ Project(const gp_Pnt& point,
578 SMDSAbs_ElementType type,
579 const SMDS_MeshElement** closestElem);
580 double getTolerance();
581 bool getIntersParamOnLine(const gp_Lin& line, const SMDS_MeshElement* face,
582 const double tolerance, double & param);
583 void findOuterBoundary(const SMDS_MeshElement* anyOuterFace);
584 bool isOuterBoundary(const SMDS_MeshElement* face) const
586 return _outerFaces.empty() || _outerFaces.count(face);
590 if ( _ebbTreeHeight[ _elementType ] < 0 )
591 _ebbTreeHeight[ _elementType ] = _ebbTree[ _elementType ]->getHeight();
592 return _ebbTreeHeight[ _elementType ];
595 struct TInters //!< data of intersection of the line and the mesh face (used in GetPointState())
597 const SMDS_MeshElement* _face;
599 bool _coincides; //!< the line lays in face plane
600 TInters(const SMDS_MeshElement* face, const gp_Vec& faceNorm, bool coinc=false)
601 : _face(face), _faceNorm( faceNorm ), _coincides( coinc ) {}
603 struct TFaceLink //!< link and faces sharing it (used in findOuterBoundary())
606 TIDSortedElemSet _faces;
607 TFaceLink( const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshElement* face)
608 : _link( n1, n2 ), _faces( &face, &face + 1) {}
612 ostream& operator<< (ostream& out, const SMESH_ElementSearcherImpl::TInters& i)
614 return out << "TInters(face=" << ( i._face ? i._face->GetID() : 0)
615 << ", _coincides="<<i._coincides << ")";
618 //=======================================================================
620 * \brief define tolerance for search
622 //=======================================================================
624 double SMESH_ElementSearcherImpl::getTolerance()
626 if ( _tolerance < 0 )
628 const SMDS_MeshInfo& meshInfo = _mesh->GetMeshInfo();
631 if ( _nodeSearcher && meshInfo.NbNodes() > 1 )
633 double boxSize = _nodeSearcher->getTree()->maxSize();
634 _tolerance = 1e-8 * boxSize/* / meshInfo.NbNodes()*/;
636 else if ( _ebbTree[_elementType] && meshInfo.NbElements() > 0 )
638 double boxSize = _ebbTree[_elementType]->maxSize();
639 _tolerance = 1e-8 * boxSize/* / meshInfo.NbElements()*/;
641 if ( _tolerance == 0 )
643 // define tolerance by size of a most complex element
644 int complexType = SMDSAbs_Volume;
645 while ( complexType > SMDSAbs_All &&
646 meshInfo.NbElements( SMDSAbs_ElementType( complexType )) < 1 )
648 if ( complexType == SMDSAbs_All ) return 0; // empty mesh
650 if ( complexType == int( SMDSAbs_Node ))
652 SMDS_NodeIteratorPtr nodeIt = _mesh->nodesIterator();
654 if ( meshInfo.NbNodes() > 2 )
655 elemSize = SMESH_TNodeXYZ( nodeIt->next() ).Distance( nodeIt->next() );
659 SMDS_ElemIteratorPtr elemIt = _mesh->elementsIterator( SMDSAbs_ElementType( complexType ));
660 const SMDS_MeshElement* elem = elemIt->next();
661 SMDS_ElemIteratorPtr nodeIt = elem->nodesIterator();
662 SMESH_TNodeXYZ n1( nodeIt->next() );
664 while ( nodeIt->more() )
666 double dist = n1.Distance( static_cast<const SMDS_MeshNode*>( nodeIt->next() ));
667 elemSize = std::max( dist, elemSize );
670 _tolerance = 1e-4 * elemSize;
676 //================================================================================
678 * \brief Find intersection of the line and an edge of face and return parameter on line
680 //================================================================================
682 bool SMESH_ElementSearcherImpl::getIntersParamOnLine(const gp_Lin& line,
683 const SMDS_MeshElement* face,
690 GeomAPI_ExtremaCurveCurve anExtCC;
691 Handle(Geom_Curve) lineCurve = new Geom_Line( line );
693 int nbNodes = face->IsQuadratic() ? face->NbNodes()/2 : face->NbNodes();
694 for ( int i = 0; i < nbNodes && nbInts < 2; ++i )
696 GC_MakeSegment edge( SMESH_TNodeXYZ( face->GetNode( i )),
697 SMESH_TNodeXYZ( face->GetNode( (i+1)%nbNodes) ));
698 anExtCC.Init( lineCurve, edge.Value() );
699 if ( !anExtCC.Extrema().IsDone() ||
700 anExtCC.Extrema().IsParallel() )
702 if ( anExtCC.NbExtrema() > 0 && anExtCC.LowerDistance() <= tol)
704 Standard_Real pl, pe;
705 anExtCC.LowerDistanceParameters( pl, pe );
711 if ( nbInts > 0 ) param /= nbInts;
714 //================================================================================
716 * \brief Find all faces belonging to the outer boundary of mesh
718 //================================================================================
720 void SMESH_ElementSearcherImpl::findOuterBoundary(const SMDS_MeshElement* outerFace)
722 if ( _outerFacesFound ) return;
724 // Collect all outer faces by passing from one outer face to another via their links
725 // and BTW find out if there are internal faces at all.
727 // checked links and links where outer boundary meets internal one
728 std::set< SMESH_TLink > visitedLinks, seamLinks;
730 // links to treat with already visited faces sharing them
731 std::list < TFaceLink > startLinks;
733 // load startLinks with the first outerFace
734 startLinks.push_back( TFaceLink( outerFace->GetNode(0), outerFace->GetNode(1), outerFace));
735 _outerFaces.insert( outerFace );
737 TIDSortedElemSet emptySet;
738 while ( !startLinks.empty() )
740 const SMESH_TLink& link = startLinks.front()._link;
741 TIDSortedElemSet& faces = startLinks.front()._faces;
743 outerFace = *faces.begin();
744 // find other faces sharing the link
745 const SMDS_MeshElement* f;
746 while (( f = SMESH_MeshAlgos::FindFaceInSet(link.node1(), link.node2(), emptySet, faces )))
749 // select another outer face among the found
750 const SMDS_MeshElement* outerFace2 = 0;
751 if ( faces.size() == 2 )
753 outerFace2 = (outerFace == *faces.begin() ? *faces.rbegin() : *faces.begin());
755 else if ( faces.size() > 2 )
757 seamLinks.insert( link );
759 // link direction within the outerFace
760 gp_Vec n1n2( SMESH_TNodeXYZ( link.node1()),
761 SMESH_TNodeXYZ( link.node2()));
762 int i1 = outerFace->GetNodeIndex( link.node1() );
763 int i2 = outerFace->GetNodeIndex( link.node2() );
764 bool rev = ( abs(i2-i1) == 1 ? i1 > i2 : i2 > i1 );
765 if ( rev ) n1n2.Reverse();
767 gp_XYZ ofNorm, fNorm;
768 if ( SMESH_MeshAlgos::FaceNormal( outerFace, ofNorm, /*normalized=*/false ))
770 // direction from the link inside outerFace
771 gp_Vec dirInOF = gp_Vec( ofNorm ) ^ n1n2;
772 // sort all other faces by angle with the dirInOF
773 std::map< double, const SMDS_MeshElement* > angle2Face;
774 std::set< const SMDS_MeshElement*, TIDCompare >::const_iterator face = faces.begin();
775 for ( ; face != faces.end(); ++face )
777 if ( *face == outerFace ) continue;
778 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false ))
780 gp_Vec dirInF = gp_Vec( fNorm ) ^ n1n2;
781 double angle = dirInOF.AngleWithRef( dirInF, n1n2 );
782 if ( angle < 0 ) angle += 2. * M_PI;
783 angle2Face.insert( std::make_pair( angle, *face ));
785 if ( !angle2Face.empty() )
786 outerFace2 = angle2Face.begin()->second;
789 // store the found outer face and add its links to continue searching from
792 _outerFaces.insert( outerFace2 );
793 int nbNodes = outerFace2->NbCornerNodes();
794 for ( int i = 0; i < nbNodes; ++i )
796 SMESH_TLink link2( outerFace2->GetNode(i), outerFace2->GetNode((i+1)%nbNodes));
797 if ( visitedLinks.insert( link2 ).second )
798 startLinks.push_back( TFaceLink( link2.node1(), link2.node2(), outerFace2 ));
801 startLinks.pop_front();
803 _outerFacesFound = true;
805 if ( !seamLinks.empty() )
807 // There are internal boundaries touching the outher one,
808 // find all faces of internal boundaries in order to find
809 // faces of boundaries of holes, if any.
818 //=======================================================================
820 * \brief Find elements of given type where the given point is IN or ON.
821 * Returns nb of found elements and elements them-selves.
823 * 'ALL' type means elements of any type excluding nodes, balls and 0D elements
825 //=======================================================================
827 int SMESH_ElementSearcherImpl::
828 FindElementsByPoint(const gp_Pnt& point,
829 SMDSAbs_ElementType type,
830 std::vector< const SMDS_MeshElement* >& foundElements)
832 foundElements.clear();
835 double tolerance = getTolerance();
837 // =================================================================================
838 if ( type == SMDSAbs_Node || type == SMDSAbs_0DElement || type == SMDSAbs_Ball)
840 if ( !_nodeSearcher )
843 _nodeSearcher = new SMESH_NodeSearcherImpl( 0, _meshPartIt );
845 _nodeSearcher = new SMESH_NodeSearcherImpl( _mesh );
847 std::vector< const SMDS_MeshNode* > foundNodes;
848 _nodeSearcher->FindNearPoint( point, tolerance, foundNodes );
850 if ( type == SMDSAbs_Node )
852 foundElements.assign( foundNodes.begin(), foundNodes.end() );
856 for ( size_t i = 0; i < foundNodes.size(); ++i )
858 SMDS_ElemIteratorPtr elemIt = foundNodes[i]->GetInverseElementIterator( type );
859 while ( elemIt->more() )
860 foundElements.push_back( elemIt->next() );
864 // =================================================================================
865 else // elements more complex than 0D
867 if ( !_ebbTree[type] )
869 _ebbTree[_elementType] = new ElementBndBoxTree( *_mesh, type, _meshPartIt, tolerance );
871 ElementBndBoxTree::TElemSeq suspectElems;
872 _ebbTree[ type ]->getElementsNearPoint( point, suspectElems );
873 ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
874 for ( ; elem != suspectElems.end(); ++elem )
875 if ( !SMESH_MeshAlgos::IsOut( *elem, point, tolerance ))
876 foundElements.push_back( *elem );
878 return foundElements.size();
881 //=======================================================================
883 * \brief Find an element of given type most close to the given point
885 * WARNING: Only edge, face and volume search is implemented so far
887 //=======================================================================
889 const SMDS_MeshElement*
890 SMESH_ElementSearcherImpl::FindClosestTo( const gp_Pnt& point,
891 SMDSAbs_ElementType type )
893 const SMDS_MeshElement* closestElem = 0;
896 if ( type == SMDSAbs_Face ||
897 type == SMDSAbs_Volume ||
898 type == SMDSAbs_Edge )
900 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
902 ebbTree = new ElementBndBoxTree( *_mesh, type, _meshPartIt );
904 ElementBndBoxTree::TElemSeq suspectElems;
905 ebbTree->getElementsNearPoint( point, suspectElems );
907 if ( suspectElems.empty() && ebbTree->maxSize() > 0 )
909 gp_Pnt boxCenter = 0.5 * ( ebbTree->getBox()->CornerMin() +
910 ebbTree->getBox()->CornerMax() );
912 if ( ebbTree->getBox()->IsOut( point.XYZ() ))
913 radius = point.Distance( boxCenter ) - 0.5 * ebbTree->maxSize();
915 radius = ebbTree->maxSize() / pow( 2., getTreeHeight()) / 2;
916 while ( suspectElems.empty() && radius < 1e100 )
918 ebbTree->getElementsInSphere( point.XYZ(), radius, suspectElems );
922 double minDist = std::numeric_limits<double>::max();
923 std::multimap< double, const SMDS_MeshElement* > dist2face;
924 ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
925 for ( ; elem != suspectElems.end(); ++elem )
927 double dist = SMESH_MeshAlgos::GetDistance( *elem, point );
928 if ( dist < minDist + 1e-10)
931 dist2face.insert( dist2face.begin(), std::make_pair( dist, *elem ));
934 if ( !dist2face.empty() )
936 std::multimap< double, const SMDS_MeshElement* >::iterator d2f = dist2face.begin();
937 closestElem = d2f->second;
938 // if there are several elements at the same distance, select one
939 // with GC closest to the point
940 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
941 double minDistToGC = 0;
942 for ( ++d2f; d2f != dist2face.end() && fabs( d2f->first - minDist ) < 1e-10; ++d2f )
944 if ( minDistToGC == 0 )
947 gc = accumulate( TXyzIterator(closestElem->nodesIterator()),
948 TXyzIterator(), gc ) / closestElem->NbNodes();
949 minDistToGC = point.SquareDistance( gc );
952 gc = accumulate( TXyzIterator( d2f->second->nodesIterator()),
953 TXyzIterator(), gc ) / d2f->second->NbNodes();
954 double d = point.SquareDistance( gc );
955 if ( d < minDistToGC )
958 closestElem = d2f->second;
961 // cout << "FindClosestTo( " <<point.X()<<", "<<point.Y()<<", "<<point.Z()<<" ) FACE "
962 // <<closestElem->GetID() << " DIST " << minDist << endl;
967 // NOT IMPLEMENTED SO FAR
973 //================================================================================
975 * \brief Classify the given point in the closed 2D mesh
977 //================================================================================
979 TopAbs_State SMESH_ElementSearcherImpl::GetPointState(const gp_Pnt& point)
981 _elementType = SMDSAbs_Face;
983 double tolerance = getTolerance();
985 ElementBndBoxTree*& ebbTree = _ebbTree[ SMDSAbs_Face ];
987 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
989 // Algo: analyse transition of a line starting at the point through mesh boundary;
990 // try three lines parallel to axis of the coordinate system and perform rough
991 // analysis. If solution is not clear perform thorough analysis.
993 const int nbAxes = 3;
994 gp_Dir axisDir[ nbAxes ] = { gp::DX(), gp::DY(), gp::DZ() };
995 std::map< double, TInters > paramOnLine2TInters[ nbAxes ];
996 std::list< TInters > tangentInters[ nbAxes ]; // of faces whose plane includes the line
997 std::multimap< int, int > nbInt2Axis; // to find the simplest case
998 for ( int axis = 0; axis < nbAxes; ++axis )
1000 gp_Ax1 lineAxis( point, axisDir[axis]);
1001 gp_Lin line ( lineAxis );
1003 ElementBndBoxTree::TElemSeq suspectFaces; // faces possibly intersecting the line
1004 ebbTree->getElementsNearLine( lineAxis, suspectFaces );
1006 // Intersect faces with the line
1008 std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
1009 ElementBndBoxTree::TElemSeq::iterator face = suspectFaces.begin();
1010 for ( ; face != suspectFaces.end(); ++face )
1014 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false)) continue;
1015 gp_Pln facePlane( SMESH_TNodeXYZ( (*face)->GetNode(0)), fNorm );
1017 // perform intersection
1018 IntAna_IntConicQuad intersection( line, IntAna_Quadric( facePlane ));
1019 if ( !intersection.IsDone() )
1021 if ( intersection.IsInQuadric() )
1023 tangentInters[ axis ].push_back( TInters( *face, fNorm, true ));
1025 else if ( ! intersection.IsParallel() && intersection.NbPoints() > 0 )
1027 double tol = 1e-4 * Sqrt( fNorm.Modulus() );
1028 gp_Pnt intersectionPoint = intersection.Point(1);
1029 if ( !SMESH_MeshAlgos::IsOut( *face, intersectionPoint, tol ))
1030 u2inters.insert( std::make_pair( intersection.ParamOnConic(1), TInters( *face, fNorm )));
1033 // Analyse intersections roughly
1035 int nbInter = u2inters.size();
1039 double f = u2inters.begin()->first, l = u2inters.rbegin()->first;
1040 if ( nbInter == 1 ) // not closed mesh
1041 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
1043 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
1046 if ( (f<0) == (l<0) )
1049 int nbIntBeforePoint = std::distance( u2inters.begin(), u2inters.lower_bound(0));
1050 int nbIntAfterPoint = nbInter - nbIntBeforePoint;
1051 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
1054 nbInt2Axis.insert( std::make_pair( std::min( nbIntBeforePoint, nbIntAfterPoint ), axis ));
1056 if ( _outerFacesFound ) break; // pass to thorough analysis
1058 } // three attempts - loop on CS axes
1060 // Analyse intersections thoroughly.
1061 // We make two loops maximum, on the first one we only exclude touching intersections,
1062 // on the second, if situation is still unclear, we gather and use information on
1063 // position of faces (internal or outer). If faces position is already gathered,
1064 // we make the second loop right away.
1066 for ( int hasPositionInfo = _outerFacesFound; hasPositionInfo < 2; ++hasPositionInfo )
1068 std::multimap< int, int >::const_iterator nb_axis = nbInt2Axis.begin();
1069 for ( ; nb_axis != nbInt2Axis.end(); ++nb_axis )
1071 int axis = nb_axis->second;
1072 std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
1074 gp_Ax1 lineAxis( point, axisDir[axis]);
1075 gp_Lin line ( lineAxis );
1077 // add tangent intersections to u2inters
1079 std::list< TInters >::const_iterator tgtInt = tangentInters[ axis ].begin();
1080 for ( ; tgtInt != tangentInters[ axis ].end(); ++tgtInt )
1081 if ( getIntersParamOnLine( line, tgtInt->_face, tolerance, param ))
1082 u2inters.insert( std::make_pair( param, *tgtInt ));
1083 tangentInters[ axis ].clear();
1085 // Count intersections before and after the point excluding touching ones.
1086 // If hasPositionInfo we count intersections of outer boundary only
1088 int nbIntBeforePoint = 0, nbIntAfterPoint = 0;
1089 double f = std::numeric_limits<double>::max(), l = -std::numeric_limits<double>::max();
1090 std::map< double, TInters >::iterator u_int1 = u2inters.begin(), u_int2 = u_int1;
1091 bool ok = ! u_int1->second._coincides;
1092 while ( ok && u_int1 != u2inters.end() )
1094 double u = u_int1->first;
1095 bool touchingInt = false;
1096 if ( ++u_int2 != u2inters.end() )
1098 // skip intersections at the same point (if the line passes through edge or node)
1100 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u ) < tolerance )
1106 // skip tangent intersections
1108 if ( u_int2 != u2inters.end() )
1110 const SMDS_MeshElement* prevFace = u_int1->second._face;
1111 while ( ok && u_int2->second._coincides )
1113 if ( SMESH_MeshAlgos::NbCommonNodes(prevFace , u_int2->second._face) == 0 )
1119 ok = ( u_int2 != u2inters.end() );
1125 // skip intersections at the same point after tangent intersections
1128 double u2 = u_int2->first;
1130 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u2 ) < tolerance )
1136 // decide if we skipped a touching intersection
1137 if ( nbSamePnt + nbTgt > 0 )
1139 double minDot = std::numeric_limits<double>::max(), maxDot = -minDot;
1140 std::map< double, TInters >::iterator u_int = u_int1;
1141 for ( ; u_int != u_int2; ++u_int )
1143 if ( u_int->second._coincides ) continue;
1144 double dot = u_int->second._faceNorm * line.Direction();
1145 if ( dot > maxDot ) maxDot = dot;
1146 if ( dot < minDot ) minDot = dot;
1148 touchingInt = ( minDot*maxDot < 0 );
1153 if ( !hasPositionInfo || isOuterBoundary( u_int1->second._face ))
1164 u_int1 = u_int2; // to next intersection
1166 } // loop on intersections with one line
1170 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
1173 if ( nbIntBeforePoint == 0 || nbIntAfterPoint == 0)
1176 if ( nbIntBeforePoint + nbIntAfterPoint == 1 ) // not closed mesh
1177 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
1179 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
1182 if ( (f<0) == (l<0) )
1185 if ( hasPositionInfo )
1186 return nbIntBeforePoint % 2 ? TopAbs_IN : TopAbs_OUT;
1188 } // loop on intersections of the tree lines - thorough analysis
1190 if ( !hasPositionInfo )
1192 // gather info on faces position - is face in the outer boundary or not
1193 std::map< double, TInters > & u2inters = paramOnLine2TInters[ 0 ];
1194 findOuterBoundary( u2inters.begin()->second._face );
1197 } // two attempts - with and w/o faces position info in the mesh
1199 return TopAbs_UNKNOWN;
1202 //=======================================================================
1204 * \brief Return elements possibly intersecting the line
1206 //=======================================================================
1208 void SMESH_ElementSearcherImpl::
1209 GetElementsNearLine( const gp_Ax1& line,
1210 SMDSAbs_ElementType type,
1211 std::vector< const SMDS_MeshElement* >& foundElems)
1213 _elementType = type;
1214 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1216 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1218 ElementBndBoxTree::TElemSeq elems;
1219 ebbTree->getElementsNearLine( line, elems );
1221 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1224 //=======================================================================
1226 * Return elements whose bounding box intersects a sphere
1228 //=======================================================================
1230 void SMESH_ElementSearcherImpl::
1231 GetElementsInSphere( const gp_XYZ& center,
1232 const double radius,
1233 SMDSAbs_ElementType type,
1234 std::vector< const SMDS_MeshElement* >& foundElems)
1236 _elementType = type;
1237 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1239 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1241 ElementBndBoxTree::TElemSeq elems;
1242 ebbTree->getElementsInSphere( center, radius, elems );
1244 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1247 //=======================================================================
1249 * Return elements whose bounding box intersects a given bounding box
1251 //=======================================================================
1253 void SMESH_ElementSearcherImpl::
1254 GetElementsInBox( const Bnd_B3d& box,
1255 SMDSAbs_ElementType type,
1256 std::vector< const SMDS_MeshElement* >& foundElems)
1258 _elementType = type;
1259 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1261 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt, getTolerance() );
1263 ElementBndBoxTree::TElemSeq elems;
1264 ebbTree->getElementsInBox( box, elems );
1266 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1269 //=======================================================================
1271 * \brief Return a projection of a given point to a mesh.
1272 * Optionally return the closest element
1274 //=======================================================================
1276 gp_XYZ SMESH_ElementSearcherImpl::Project(const gp_Pnt& point,
1277 SMDSAbs_ElementType type,
1278 const SMDS_MeshElement** closestElem)
1280 _elementType = type;
1281 if ( _mesh->GetMeshInfo().NbElements( _elementType ) == 0 )
1282 throw SALOME_Exception( LOCALIZED( "No elements of given type in the mesh" ));
1284 ElementBndBoxTree*& ebbTree = _ebbTree[ _elementType ];
1286 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1288 gp_XYZ p = point.XYZ();
1289 ElementBndBoxTree* ebbLeaf = ebbTree->getLeafAtPoint( p );
1290 const Bnd_B3d* box = ebbLeaf ? ebbLeaf->getBox() : ebbTree->getBox();
1291 gp_XYZ pMin = box->CornerMin(), pMax = box->CornerMax();
1292 double radius = Precision::Infinite();
1293 if ( ebbLeaf || !box->IsOut( p ))
1295 for ( int i = 1; i <= 3; ++i )
1297 double d = 0.5 * ( pMax.Coord(i) - pMin.Coord(i) );
1298 if ( d > Precision::Confusion() )
1299 radius = Min( d, radius );
1302 radius /= ebbTree->getHeight( /*full=*/true );
1304 else // p outside of box
1306 for ( int i = 1; i <= 3; ++i )
1309 if ( point.Coord(i) < pMin.Coord(i) )
1310 d = pMin.Coord(i) - point.Coord(i);
1311 else if ( point.Coord(i) > pMax.Coord(i) )
1312 d = point.Coord(i) - pMax.Coord(i);
1313 if ( d > Precision::Confusion() )
1314 radius = Min( d, radius );
1318 ElementBndBoxTree::TElemSeq elems;
1319 ebbTree->getElementsInSphere( p, radius, elems );
1320 while ( elems.empty() && radius < 1e100 )
1323 ebbTree->getElementsInSphere( p, radius, elems );
1325 gp_XYZ proj, bestProj;
1326 const SMDS_MeshElement* elem = 0;
1327 double minDist = Precision::Infinite();
1328 ElementBndBoxTree::TElemSeq::iterator e = elems.begin();
1329 for ( ; e != elems.end(); ++e )
1331 double d = SMESH_MeshAlgos::GetDistance( *e, point, &proj );
1339 if ( minDist > radius )
1341 ElementBndBoxTree::TElemSeq elems2;
1342 ebbTree->getElementsInSphere( p, minDist, elems2 );
1343 for ( e = elems2.begin(); e != elems2.end(); ++e )
1345 if ( elems.count( *e ))
1347 double d = SMESH_MeshAlgos::GetDistance( *e, point, &proj );
1356 if ( closestElem ) *closestElem = elem;
1361 //=======================================================================
1363 * \brief Return true if the point is IN or ON of the element
1365 //=======================================================================
1367 bool SMESH_MeshAlgos::IsOut( const SMDS_MeshElement* element, const gp_Pnt& point, double tol )
1369 if ( element->GetType() == SMDSAbs_Volume)
1371 return SMDS_VolumeTool( element ).IsOut( point.X(), point.Y(), point.Z(), tol );
1374 // get ordered nodes
1376 std::vector< SMESH_TNodeXYZ > xyz; xyz.reserve( element->NbNodes()+1 );
1378 SMDS_NodeIteratorPtr nodeIt = element->interlacedNodesIterator();
1379 for ( int i = 0; nodeIt->more(); ++i )
1380 xyz.push_back( SMESH_TNodeXYZ( nodeIt->next() ));
1382 int i, nbNodes = (int) xyz.size(); // central node of biquadratic is missing
1384 if ( element->GetType() == SMDSAbs_Face ) // --------------------------------------------------
1386 // compute face normal
1387 gp_Vec faceNorm(0,0,0);
1388 xyz.push_back( xyz.front() );
1389 for ( i = 0; i < nbNodes; ++i )
1391 gp_Vec edge1( xyz[i+1], xyz[i]);
1392 gp_Vec edge2( xyz[i+1], xyz[(i+2)%nbNodes] );
1393 faceNorm += edge1 ^ edge2;
1395 double fNormSize = faceNorm.Magnitude();
1396 if ( fNormSize <= tol )
1398 // degenerated face: point is out if it is out of all face edges
1399 for ( i = 0; i < nbNodes; ++i )
1401 SMDS_LinearEdge edge( xyz[i]._node, xyz[i+1]._node );
1402 if ( !IsOut( &edge, point, tol ))
1407 faceNorm /= fNormSize;
1409 // check if the point lays on face plane
1410 gp_Vec n2p( xyz[0], point );
1411 double dot = n2p * faceNorm;
1412 if ( Abs( dot ) > tol ) // not on face plane
1415 if ( nbNodes > 3 ) // maybe the face is not planar
1417 double elemThick = 0;
1418 for ( i = 1; i < nbNodes; ++i )
1420 gp_Vec n2n( xyz[0], xyz[i] );
1421 elemThick = Max( elemThick, Abs( n2n * faceNorm ));
1423 isOut = Abs( dot ) > elemThick + tol;
1429 // check if point is out of face boundary:
1430 // define it by closest transition of a ray point->infinity through face boundary
1431 // on the face plane.
1432 // First, find normal of a plane perpendicular to face plane, to be used as a cutting tool
1433 // to find intersections of the ray with the boundary.
1435 gp_Vec plnNorm = ray ^ faceNorm;
1436 double n2pSize = plnNorm.Magnitude();
1437 if ( n2pSize <= tol ) return false; // point coincides with the first node
1438 if ( n2pSize * n2pSize > fNormSize * 100 ) return true; // point is very far
1440 // for each node of the face, compute its signed distance to the cutting plane
1441 std::vector<double> dist( nbNodes + 1);
1442 for ( i = 0; i < nbNodes; ++i )
1444 gp_Vec n2p( xyz[i], point );
1445 dist[i] = n2p * plnNorm;
1447 dist.back() = dist.front();
1448 // find the closest intersection
1450 double rClosest = 0, distClosest = 1e100;
1452 for ( i = 0; i < nbNodes; ++i )
1455 if ( fabs( dist[i] ) < tol )
1457 else if ( fabs( dist[i+1]) < tol )
1459 else if ( dist[i] * dist[i+1] < 0 )
1460 r = dist[i] / ( dist[i] - dist[i+1] );
1462 continue; // no intersection
1463 gp_Pnt pInt = xyz[i] * (1.-r) + xyz[i+1] * r;
1464 gp_Vec p2int( point, pInt);
1465 double intDist = p2int.SquareMagnitude();
1466 if ( intDist < distClosest )
1471 distClosest = intDist;
1475 return true; // no intesections - out
1477 // analyse transition
1478 gp_Vec edge( xyz[iClosest], xyz[iClosest+1] );
1479 gp_Vec edgeNorm = -( edge ^ faceNorm ); // normal to intersected edge pointing out of face
1480 gp_Vec p2int ( point, pClosest );
1481 bool out = (edgeNorm * p2int) < -tol;
1482 if ( rClosest > 0. && rClosest < 1. ) // not node intersection
1485 // the ray passes through a face node; analyze transition through an adjacent edge
1486 gp_Pnt p1 = xyz[ (rClosest == 0.) ? ((iClosest+nbNodes-1) % nbNodes) : (iClosest+1) ];
1487 gp_Pnt p2 = xyz[ (rClosest == 0.) ? iClosest : ((iClosest+2) % nbNodes) ];
1488 gp_Vec edgeAdjacent( p1, p2 );
1489 gp_Vec edgeNorm2 = -( edgeAdjacent ^ faceNorm );
1490 bool out2 = (edgeNorm2 * p2int) < -tol;
1492 bool covexCorner = ( edgeNorm * edgeAdjacent * (rClosest==1. ? 1. : -1.)) < 0;
1493 return covexCorner ? (out || out2) : (out && out2);
1496 if ( element->GetType() == SMDSAbs_Edge ) // --------------------------------------------------
1498 // point is out of edge if it is NOT ON any straight part of edge
1499 // (we consider quadratic edge as being composed of two straight parts)
1500 for ( i = 1; i < nbNodes; ++i )
1502 gp_Vec edge( xyz[i-1], xyz[i] );
1503 gp_Vec n1p ( xyz[i-1], point );
1504 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1506 if ( n1p.SquareMagnitude() < tol * tol )
1511 if ( point.SquareDistance( xyz[i] ) < tol * tol )
1515 gp_XYZ proj = ( 1. - u ) * xyz[i-1] + u * xyz[i]; // projection of the point on the edge
1516 double dist2 = point.SquareDistance( proj );
1517 if ( dist2 > tol * tol )
1519 return false; // point is ON this part
1524 // Node or 0D element -------------------------------------------------------------------------
1526 gp_Vec n2p ( xyz[0], point );
1527 return n2p.SquareMagnitude() > tol * tol;
1532 //=======================================================================
1535 // Position of a point relative to a segment
1539 // VERTEX 1 o----ON-----> VERTEX 2
1543 enum PositionName { POS_LEFT = 1, POS_VERTEX = 2, POS_RIGHT = 4, //POS_ON = 8,
1544 POS_ALL = POS_LEFT | POS_RIGHT | POS_VERTEX,
1545 POS_MAX = POS_RIGHT };
1549 int _index; // index of vertex or segment
1551 PointPos( PositionName n, int i=-1 ): _name(n), _index(i) {}
1552 bool operator < (const PointPos& other ) const
1554 if ( _name == other._name )
1555 return ( _index < 0 || other._index < 0 ) ? false : _index < other._index;
1556 return _name < other._name;
1560 //================================================================================
1562 * \brief Return position of a point relative to a segment
1563 * \param point2D - the point to analyze position of
1564 * \param segEnds - end points of segments
1565 * \param index0 - 0-based index of the first point of segment
1566 * \param posToFindOut - flags of positions to detect
1567 * \retval PointPos - point position
1569 //================================================================================
1571 PointPos getPointPosition( const gp_XY& point2D,
1572 const gp_XY* segEnds,
1573 const int index0 = 0,
1574 const int posToFindOut = POS_ALL)
1576 const gp_XY& p1 = segEnds[ index0 ];
1577 const gp_XY& p2 = segEnds[ index0+1 ];
1578 const gp_XY grad = p2 - p1;
1580 if ( posToFindOut & POS_VERTEX )
1582 // check if the point2D is at "vertex 1" zone
1583 gp_XY pp1[2] = { p1, gp_XY( p1.X() - grad.Y(),
1584 p1.Y() + grad.X() ) };
1585 if ( getPointPosition( point2D, pp1, 0, POS_LEFT|POS_RIGHT )._name == POS_LEFT )
1586 return PointPos( POS_VERTEX, index0 );
1588 // check if the point2D is at "vertex 2" zone
1589 gp_XY pp2[2] = { p2, gp_XY( p2.X() - grad.Y(),
1590 p2.Y() + grad.X() ) };
1591 if ( getPointPosition( point2D, pp2, 0, POS_LEFT|POS_RIGHT )._name == POS_RIGHT )
1592 return PointPos( POS_VERTEX, index0 + 1);
1594 double edgeEquation =
1595 ( point2D.X() - p1.X() ) * grad.Y() - ( point2D.Y() - p1.Y() ) * grad.X();
1596 return PointPos( edgeEquation < 0 ? POS_LEFT : POS_RIGHT, index0 );
1600 //=======================================================================
1602 * \brief Return minimal distance from a point to an element
1604 * Currently we ignore non-planarity and 2nd order of face
1606 //=======================================================================
1608 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshElement* elem,
1609 const gp_Pnt& point,
1610 gp_XYZ* closestPnt )
1612 switch ( elem->GetType() )
1614 case SMDSAbs_Volume:
1615 return GetDistance( static_cast<const SMDS_MeshVolume*>( elem ), point, closestPnt );
1617 return GetDistance( static_cast<const SMDS_MeshFace*>( elem ), point, closestPnt );
1619 return GetDistance( static_cast<const SMDS_MeshEdge*>( elem ), point, closestPnt );
1621 if ( closestPnt ) *closestPnt = SMESH_TNodeXYZ( elem );
1622 return point.Distance( SMESH_TNodeXYZ( elem ));
1628 //=======================================================================
1630 * \brief Return minimal distance from a point to a face
1632 * Currently we ignore non-planarity and 2nd order of face
1634 //=======================================================================
1636 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshFace* face,
1637 const gp_Pnt& point,
1638 gp_XYZ* closestPnt )
1640 const double badDistance = -1;
1641 if ( !face ) return badDistance;
1643 int nbCorners = face->NbCornerNodes();
1644 if ( nbCorners > 3 )
1646 std::vector< const SMDS_MeshNode* > nodes;
1647 int nbTria = SMESH_MeshAlgos::Triangulate().GetTriangles( face, nodes );
1649 double minDist = Precision::Infinite();
1651 for ( int i = 0; i < 3 * nbTria; i += 3 )
1653 SMDS_FaceOfNodes triangle( nodes[i], nodes[i+1], nodes[i+2] );
1654 double dist = GetDistance( &triangle, point, closestPnt );
1655 if ( dist < minDist )
1668 // coordinates of nodes (medium nodes, if any, ignored)
1669 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
1670 std::vector<gp_XYZ> xyz( TXyzIterator( face->nodesIterator()), TXyzIterator() );
1673 // transformation to get xyz[0] lies on the origin, xyz[1] lies on the Z axis,
1674 // and xyz[2] lies in the XZ plane. This is to pass to 2D space on XZ plane.
1676 gp_Vec OZ ( xyz[0], xyz[1] );
1677 gp_Vec OX ( xyz[0], xyz[2] );
1678 if ( OZ.Magnitude() < std::numeric_limits<double>::min() )
1680 if ( xyz.size() < 4 ) return badDistance;
1681 OZ = gp_Vec ( xyz[0], xyz[2] );
1682 OX = gp_Vec ( xyz[0], xyz[3] );
1686 tgtCS = gp_Ax3( xyz[0], OZ, OX );
1688 catch ( Standard_Failure& ) {
1691 trsf.SetTransformation( tgtCS );
1693 // move all the nodes to 2D
1694 std::vector<gp_XY> xy( xyz.size() );
1695 for ( size_t i = 0; i < 3; ++i )
1697 gp_XYZ p3d = xyz[i];
1698 trsf.Transforms( p3d );
1699 xy[i].SetCoord( p3d.X(), p3d.Z() );
1701 xyz.back() = xyz.front();
1702 xy.back() = xy.front();
1704 // // move the point in 2D
1705 gp_XYZ tmpPnt = point.XYZ();
1706 trsf.Transforms( tmpPnt );
1707 gp_XY point2D( tmpPnt.X(), tmpPnt.Z() );
1709 // loop on edges of the face to analyze point position ralative to the face
1710 std::vector< PointPos > pntPosByType[ POS_MAX + 1 ];
1711 for ( size_t i = 1; i < xy.size(); ++i )
1713 PointPos pos = getPointPosition( point2D, &xy[0], i-1 );
1714 pntPosByType[ pos._name ].push_back( pos );
1719 double dist = badDistance;
1721 if ( pntPosByType[ POS_LEFT ].size() > 0 ) // point is most close to an edge
1723 PointPos& pos = pntPosByType[ POS_LEFT ][0];
1725 gp_Vec edge( xyz[ pos._index ], xyz[ pos._index+1 ]);
1726 gp_Vec n1p ( xyz[ pos._index ], point );
1727 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1728 gp_XYZ proj = xyz[ pos._index ] + u * edge.XYZ(); // projection on the edge
1729 dist = point.Distance( proj );
1730 if ( closestPnt ) *closestPnt = proj;
1733 else if ( pntPosByType[ POS_RIGHT ].size() >= 2 ) // point is inside the face
1735 dist = Abs( tmpPnt.Y() );
1738 if ( dist < std::numeric_limits<double>::min() ) {
1739 *closestPnt = point.XYZ();
1743 trsf.Inverted().Transforms( tmpPnt );
1744 *closestPnt = tmpPnt;
1749 else if ( pntPosByType[ POS_VERTEX ].size() > 0 ) // point is most close to a node
1751 double minDist2 = Precision::Infinite();
1752 for ( size_t i = 0; i < pntPosByType[ POS_VERTEX ].size(); ++i )
1754 PointPos& pos = pntPosByType[ POS_VERTEX ][i];
1756 double d2 = point.SquareDistance( xyz[ pos._index ]);
1757 if ( minDist2 > d2 )
1759 if ( closestPnt ) *closestPnt = xyz[ pos._index ];
1763 dist = Sqrt( minDist2 );
1769 //=======================================================================
1771 * \brief Return minimal distance from a point to an edge
1773 //=======================================================================
1775 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshEdge* seg,
1776 const gp_Pnt& point,
1777 gp_XYZ* closestPnt )
1779 double dist = Precision::Infinite();
1780 if ( !seg ) return dist;
1782 int i = 0, nbNodes = seg->NbNodes();
1784 std::vector< SMESH_TNodeXYZ > xyz( nbNodes );
1785 for ( SMDS_NodeIteratorPtr nodeIt = seg->interlacedNodesIterator(); nodeIt->more(); i++ )
1786 xyz[ i ].Set( nodeIt->next() );
1788 for ( i = 1; i < nbNodes; ++i )
1790 gp_Vec edge( xyz[i-1], xyz[i] );
1791 gp_Vec n1p ( xyz[i-1], point );
1792 double d, u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1794 if (( d = n1p.SquareMagnitude() ) < dist ) {
1796 if ( closestPnt ) *closestPnt = xyz[i-1];
1799 else if ( u >= 1. ) {
1800 if (( d = point.SquareDistance( xyz[i] )) < dist ) {
1802 if ( closestPnt ) *closestPnt = xyz[i];
1806 gp_XYZ proj = xyz[i-1] + u * edge.XYZ(); // projection of the point on the edge
1807 if (( d = point.SquareDistance( proj )) < dist ) {
1809 if ( closestPnt ) *closestPnt = proj;
1813 return Sqrt( dist );
1816 //=======================================================================
1818 * \brief Return minimal distance from a point to a volume
1820 * Currently we ignore non-planarity and 2nd order
1822 //=======================================================================
1824 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshVolume* volume,
1825 const gp_Pnt& point,
1826 gp_XYZ* closestPnt )
1828 SMDS_VolumeTool vTool( volume );
1829 vTool.SetExternalNormal();
1830 const int iQ = volume->IsQuadratic() ? 2 : 1;
1833 double minDist = 1e100, dist;
1834 gp_XYZ closeP = point.XYZ();
1836 for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
1838 // skip a facet with normal not "looking at" the point
1839 if ( !vTool.GetFaceNormal( iF, n[0], n[1], n[2] ) ||
1840 !vTool.GetFaceBaryCenter( iF, bc[0], bc[1], bc[2] ))
1842 gp_XYZ bcp = point.XYZ() - gp_XYZ( bc[0], bc[1], bc[2] );
1843 if ( gp_XYZ( n[0], n[1], n[2] ) * bcp < -1e-12 )
1846 // find distance to a facet
1847 const SMDS_MeshNode** nodes = vTool.GetFaceNodes( iF );
1848 switch ( vTool.NbFaceNodes( iF ) / iQ ) {
1851 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ] );
1852 dist = GetDistance( &tmpFace, point, closestPnt );
1857 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ], nodes[ 3*iQ ]);
1858 dist = GetDistance( &tmpFace, point, closestPnt );
1862 std::vector<const SMDS_MeshNode *> nvec( nodes, nodes + vTool.NbFaceNodes( iF ));
1863 SMDS_PolygonalFaceOfNodes tmpFace( nvec );
1864 dist = GetDistance( &tmpFace, point, closestPnt );
1866 if ( dist < minDist )
1870 if ( closestPnt ) closeP = *closestPnt;
1875 if ( closestPnt ) *closestPnt = closeP;
1879 return 0; // point is inside the volume
1882 //================================================================================
1884 * \brief Returns barycentric coordinates of a point within a triangle.
1885 * A not returned bc2 = 1. - bc0 - bc1.
1886 * The point lies within the triangle if ( bc0 >= 0 && bc1 >= 0 && bc0+bc1 <= 1 )
1888 //================================================================================
1890 void SMESH_MeshAlgos::GetBarycentricCoords( const gp_XY& p,
1897 const double // matrix 2x2
1898 T11 = t0.X()-t2.X(), T12 = t1.X()-t2.X(),
1899 T21 = t0.Y()-t2.Y(), T22 = t1.Y()-t2.Y();
1900 const double Tdet = T11*T22 - T12*T21; // matrix determinant
1901 if ( Abs( Tdet ) < std::numeric_limits<double>::min() )
1907 const double t11 = T22, t12 = -T12, t21 = -T21, t22 = T11;
1909 const double r11 = p.X()-t2.X(), r12 = p.Y()-t2.Y();
1910 // barycentric coordinates: multiply matrix by vector
1911 bc0 = (t11 * r11 + t12 * r12)/Tdet;
1912 bc1 = (t21 * r11 + t22 * r12)/Tdet;
1915 //=======================================================================
1916 //function : FindFaceInSet
1917 //purpose : Return a face having linked nodes n1 and n2 and which is
1918 // - not in avoidSet,
1919 // - in elemSet provided that !elemSet.empty()
1920 // i1 and i2 optionally returns indices of n1 and n2
1921 //=======================================================================
1923 const SMDS_MeshElement*
1924 SMESH_MeshAlgos::FindFaceInSet(const SMDS_MeshNode* n1,
1925 const SMDS_MeshNode* n2,
1926 const TIDSortedElemSet& elemSet,
1927 const TIDSortedElemSet& avoidSet,
1933 const SMDS_MeshElement* face = 0;
1935 SMDS_ElemIteratorPtr invElemIt = n1->GetInverseElementIterator(SMDSAbs_Face);
1936 while ( invElemIt->more() && !face ) // loop on inverse faces of n1
1938 const SMDS_MeshElement* elem = invElemIt->next();
1939 if (avoidSet.count( elem ))
1941 if ( !elemSet.empty() && !elemSet.count( elem ))
1944 i1 = elem->GetNodeIndex( n1 );
1945 // find a n2 linked to n1
1946 int nbN = elem->IsQuadratic() ? elem->NbNodes()/2 : elem->NbNodes();
1947 for ( int di = -1; di < 2 && !face; di += 2 )
1949 i2 = (i1+di+nbN) % nbN;
1950 if ( elem->GetNode( i2 ) == n2 )
1953 if ( !face && elem->IsQuadratic())
1955 // analysis for quadratic elements using all nodes
1956 SMDS_NodeIteratorPtr anIter = elem->interlacedNodesIterator();
1957 const SMDS_MeshNode* prevN = static_cast<const SMDS_MeshNode*>( anIter->next() );
1958 for ( i1 = -1, i2 = 0; anIter->more() && !face; i1++, i2++ )
1960 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( anIter->next() );
1961 if ( n1 == prevN && n2 == n )
1965 else if ( n2 == prevN && n1 == n )
1967 face = elem; std::swap( i1, i2 );
1973 if ( n1ind ) *n1ind = i1;
1974 if ( n2ind ) *n2ind = i2;
1978 //================================================================================
1980 * Return sharp edges of faces and non-manifold ones. Optionally adds existing edges.
1982 //================================================================================
1984 std::vector< SMESH_MeshAlgos::Edge >
1985 SMESH_MeshAlgos::FindSharpEdges( SMDS_Mesh* theMesh,
1987 bool theAddExisting )
1989 std::vector< Edge > resultEdges;
1990 if ( !theMesh ) return resultEdges;
1992 typedef std::pair< bool, const SMDS_MeshNode* > TIsSharpAndMedium;
1993 typedef NCollection_DataMap< SMESH_TLink, TIsSharpAndMedium, SMESH_TLinkHasher > TLinkSharpMap;
1995 TLinkSharpMap linkIsSharp;
1996 Standard_Integer nbBuckets = FromSmIdType<Standard_Integer>( theMesh->NbFaces() );
1997 if ( nbBuckets > 0 )
1998 linkIsSharp.ReSize( nbBuckets );
2000 TIsSharpAndMedium sharpMedium( true, 0 );
2001 bool & isSharp = sharpMedium.first;
2002 const SMDS_MeshNode* & nMedium = sharpMedium.second;
2004 if ( theAddExisting )
2006 for ( SMDS_EdgeIteratorPtr edgeIt = theMesh->edgesIterator(); edgeIt->more(); )
2008 const SMDS_MeshElement* edge = edgeIt->next();
2009 nMedium = ( edge->IsQuadratic() ) ? edge->GetNode(2) : 0;
2010 linkIsSharp.Bind( SMESH_TLink( edge->GetNode(0), edge->GetNode(1)), sharpMedium );
2014 // check angles between face normals
2016 const double angleCos = Cos( theAngle * M_PI / 180. ), angleCos2 = angleCos * angleCos;
2017 gp_XYZ norm1, norm2;
2018 std::vector< const SMDS_MeshNode* > faceNodes, linkNodes(2);
2019 std::vector<const SMDS_MeshElement *> linkFaces;
2021 int nbSharp = linkIsSharp.Extent();
2022 for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
2024 const SMDS_MeshElement* face = faceIt->next();
2025 size_t nbCorners = face->NbCornerNodes();
2027 faceNodes.assign( face->begin_nodes(), face->end_nodes() );
2028 if ( faceNodes.size() == nbCorners )
2029 faceNodes.resize( nbCorners * 2, 0 );
2031 const SMDS_MeshNode* nPrev = faceNodes[ nbCorners-1 ];
2032 for ( size_t i = 0; i < nbCorners; ++i )
2034 SMESH_TLink link( nPrev, faceNodes[i] );
2035 if ( !linkIsSharp.IsBound( link ))
2037 linkNodes[0] = link.node1();
2038 linkNodes[1] = link.node2();
2040 theMesh->GetElementsByNodes( linkNodes, linkFaces, SMDSAbs_Face );
2043 if ( linkFaces.size() > 2 )
2047 else if ( linkFaces.size() == 2 &&
2048 FaceNormal( linkFaces[0], norm1, /*normalize=*/false ) &&
2049 FaceNormal( linkFaces[1], norm2, /*normalize=*/false ))
2051 double dot = norm1 * norm2; // == cos * |norm1| * |norm2|
2052 if (( dot < 0 ) == ( angleCos < 0 ))
2054 double cos2 = dot * dot / norm1.SquareModulus() / norm2.SquareModulus();
2055 isSharp = ( angleCos < 0 ) ? ( cos2 > angleCos2 ) : ( cos2 < angleCos2 );
2059 isSharp = ( angleCos > 0 );
2062 nMedium = faceNodes[( i-1+nbCorners ) % nbCorners + nbCorners ];
2064 linkIsSharp.Bind( link, sharpMedium );
2068 nPrev = faceNodes[i];
2072 resultEdges.resize( nbSharp );
2073 TLinkSharpMap::Iterator linkIsSharpIter( linkIsSharp );
2074 for ( int i = 0; linkIsSharpIter.More() && i < nbSharp; linkIsSharpIter.Next() )
2076 const SMESH_TLink& link = linkIsSharpIter.Key();
2077 const TIsSharpAndMedium& isSharpMedium = linkIsSharpIter.Value();
2078 if ( isSharpMedium.first )
2080 Edge & edge = resultEdges[ i++ ];
2081 edge._node1 = link.node1();
2082 edge._node2 = link.node2();
2083 edge._medium = isSharpMedium.second;
2090 //================================================================================
2092 * Distribute all faces of the mesh between groups using given edges as group boundaries
2094 //================================================================================
2096 std::vector< std::vector< const SMDS_MeshElement* > >
2097 SMESH_MeshAlgos::SeparateFacesByEdges( SMDS_Mesh* theMesh, const std::vector< Edge >& theEdges )
2099 std::vector< std::vector< const SMDS_MeshElement* > > groups;
2100 if ( !theMesh ) return groups;
2102 // build map of face edges (SMESH_TLink) and their faces
2104 typedef std::vector< const SMDS_MeshElement* > TFaceVec;
2105 typedef NCollection_DataMap< SMESH_TLink, TFaceVec, SMESH_TLinkHasher > TFacesByLinks;
2106 TFacesByLinks facesByLink;
2107 Standard_Integer nbBuckets = FromSmIdType<Standard_Integer>( theMesh->NbFaces() );
2108 if ( nbBuckets > 0 )
2109 facesByLink.ReSize( nbBuckets );
2111 std::vector< const SMDS_MeshNode* > faceNodes;
2112 for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
2114 const SMDS_MeshElement* face = faceIt->next();
2115 size_t nbCorners = face->NbCornerNodes();
2117 faceNodes.assign( face->begin_nodes(), face->end_nodes() );
2118 faceNodes.resize( nbCorners + 1 );
2119 faceNodes[ nbCorners ] = faceNodes[0];
2121 face->setIsMarked( false );
2123 for ( size_t i = 0; i < nbCorners; ++i )
2125 SMESH_TLink link( faceNodes[i], faceNodes[i+1] );
2126 TFaceVec* linkFaces = facesByLink.ChangeSeek( link );
2129 linkFaces = facesByLink.Bound( link, TFaceVec() );
2130 linkFaces->reserve(2);
2132 linkFaces->push_back( face );
2136 // remove the given edges from facesByLink map
2138 for ( size_t i = 0; i < theEdges.size(); ++i )
2140 SMESH_TLink link( theEdges[i]._node1, theEdges[i]._node2 );
2141 facesByLink.UnBind( link );
2144 // faces connected via links of facesByLink map form a group
2146 while ( !facesByLink.IsEmpty() )
2148 groups.push_back( TFaceVec() );
2149 TFaceVec & group = groups.back();
2151 group.push_back( TFacesByLinks::Iterator( facesByLink ).Value()[0] );
2152 group.back()->setIsMarked( true );
2154 for ( size_t iF = 0; iF < group.size(); ++iF )
2156 const SMDS_MeshElement* face = group[iF];
2157 size_t nbCorners = face->NbCornerNodes();
2158 faceNodes.assign( face->begin_nodes(), face->end_nodes() );
2159 faceNodes.resize( nbCorners + 1 );
2160 faceNodes[ nbCorners ] = faceNodes[0];
2162 for ( size_t iN = 0; iN < nbCorners; ++iN )
2164 SMESH_TLink link( faceNodes[iN], faceNodes[iN+1] );
2165 if ( const TFaceVec* faces = facesByLink.Seek( link ))
2167 const TFaceVec& faceNeighbors = *faces;
2168 for ( size_t i = 0; i < faceNeighbors.size(); ++i )
2169 if ( !faceNeighbors[i]->isMarked() )
2171 group.push_back( faceNeighbors[i] );
2172 faceNeighbors[i]->setIsMarked( true );
2174 facesByLink.UnBind( link );
2180 // find faces that are alone in its group; they were not in facesByLink
2183 for ( size_t i = 0; i < groups.size(); ++i )
2184 nbInGroups += groups[i].size();
2185 if ( nbInGroups < theMesh->NbFaces() )
2187 for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
2189 const SMDS_MeshElement* face = faceIt->next();
2190 if ( !face->isMarked() )
2192 groups.push_back( TFaceVec() );
2193 groups.back().push_back( face );
2201 //================================================================================
2203 * \brief Calculate normal of a mesh face
2205 //================================================================================
2207 bool SMESH_MeshAlgos::FaceNormal(const SMDS_MeshElement* F, gp_XYZ& normal, bool normalized)
2209 if ( !F || F->GetType() != SMDSAbs_Face )
2212 normal.SetCoord(0,0,0);
2213 int nbNodes = F->NbCornerNodes();
2214 for ( int i = 0; i < nbNodes-2; ++i )
2217 for ( int n = 0; n < 3; ++n )
2219 const SMDS_MeshNode* node = F->GetNode( i + n );
2220 p[n].SetCoord( node->X(), node->Y(), node->Z() );
2222 normal += ( p[2] - p[1] ) ^ ( p[0] - p[1] );
2224 double size2 = normal.SquareModulus();
2225 bool ok = ( size2 > std::numeric_limits<double>::min() * std::numeric_limits<double>::min());
2226 if ( normalized && ok )
2227 normal /= sqrt( size2 );
2232 //================================================================================
2234 * \brief Return nodes common to two elements
2236 //================================================================================
2238 int SMESH_MeshAlgos::NbCommonNodes(const SMDS_MeshElement* e1,
2239 const SMDS_MeshElement* e2)
2242 for ( int i = 0 ; i < e1->NbNodes(); ++i )
2243 nb += ( e2->GetNodeIndex( e1->GetNode( i )) >= 0 );
2247 //================================================================================
2249 * \brief Return nodes common to two elements
2251 //================================================================================
2253 std::vector< const SMDS_MeshNode*> SMESH_MeshAlgos::GetCommonNodes(const SMDS_MeshElement* e1,
2254 const SMDS_MeshElement* e2)
2256 std::vector< const SMDS_MeshNode*> common;
2257 for ( int i = 0 ; i < e1->NbNodes(); ++i )
2258 if ( e2->GetNodeIndex( e1->GetNode( i )) >= 0 )
2259 common.push_back( e1->GetNode( i ));
2263 //================================================================================
2265 * \brief Return true if a node is on a boundary of 2D mesh.
2266 * Optionally returns two neighboring boundary nodes (or more in non-manifold mesh)
2268 //================================================================================
2270 bool SMESH_MeshAlgos::IsOn2DBoundary( const SMDS_MeshNode* theNode,
2271 std::vector< const SMDS_MeshNode*> * theNeibors )
2273 typedef NCollection_DataMap< SMESH_TLink, int, SMESH_TLinkHasher > TLinkCountMap;
2274 TLinkCountMap linkCountMap( 10 );
2276 int nbFreeLinks = 0;
2277 for ( SMDS_ElemIteratorPtr fIt = theNode->GetInverseElementIterator(SMDSAbs_Face); fIt->more(); )
2279 const SMDS_MeshElement* face = fIt->next();
2280 const int nbCorners = face->NbCornerNodes();
2282 int iN = face->GetNodeIndex( theNode );
2283 int iPrev = ( iN - 1 + nbCorners ) % nbCorners;
2284 int iNext = ( iN + 1 ) % nbCorners;
2286 for ( int i : { iPrev, iNext } )
2288 SMESH_TLink link( theNode, face->GetNode( i ));
2289 int* count = linkCountMap.ChangeSeek( link );
2290 if ( count ) ++( *count );
2291 else linkCountMap.Bind( link, 1 );
2293 if ( !count ) ++nbFreeLinks;
2300 theNeibors->clear();
2301 theNeibors->reserve( nbFreeLinks );
2302 for ( TLinkCountMap::Iterator linkIt( linkCountMap ); linkIt.More(); linkIt.Next() )
2303 if ( linkIt.Value() == 1 )
2305 theNeibors->push_back( linkIt.Key().node1() );
2306 if ( theNeibors->back() == theNode )
2307 theNeibors->back() = linkIt.Key().node2();
2310 return nbFreeLinks > 0;
2313 //================================================================================
2315 * \brief Return true if node1 encounters first in the face and node2, after
2317 //================================================================================
2319 bool SMESH_MeshAlgos::IsRightOrder( const SMDS_MeshElement* face,
2320 const SMDS_MeshNode* node0,
2321 const SMDS_MeshNode* node1 )
2323 int i0 = face->GetNodeIndex( node0 );
2324 int i1 = face->GetNodeIndex( node1 );
2325 if ( face->IsQuadratic() )
2327 if ( face->IsMediumNode( node0 ))
2329 i0 -= ( face->NbNodes()/2 - 1 );
2334 i1 -= ( face->NbNodes()/2 - 1 );
2339 return ( diff == 1 ) || ( diff == -face->NbNodes()+1 );
2342 //=======================================================================
2344 * \brief Partition given 1D elements into groups of contiguous edges.
2345 * A node where number of meeting edges != 2 is a group end.
2346 * An optional startNode is used to orient groups it belongs to.
2347 * \return a list of edge groups and a list of corresponding node groups.
2348 * If a group is closed, the first and last nodes of the group are same.
2350 //=======================================================================
2352 void SMESH_MeshAlgos::Get1DBranches( SMDS_ElemIteratorPtr theEdgeIt,
2353 TElemGroupVector& theEdgeGroups,
2354 TNodeGroupVector& theNodeGroups,
2355 const SMDS_MeshNode* theStartNode )
2360 // build map of nodes and their adjacent edges
2362 typedef std::vector< const SMDS_MeshNode* > TNodeVec;
2363 typedef std::vector< const SMDS_MeshElement* > TEdgeVec;
2364 typedef NCollection_DataMap< const SMDS_MeshNode*, TEdgeVec, SMESH_Hasher > TEdgesByNodeMap;
2365 TEdgesByNodeMap edgesByNode;
2367 while ( theEdgeIt->more() )
2369 const SMDS_MeshElement* edge = theEdgeIt->next();
2370 if ( edge->GetType() != SMDSAbs_Edge )
2373 const SMDS_MeshNode* nodes[2] = { edge->GetNode(0), edge->GetNode(1) };
2374 for ( int i = 0; i < 2; ++i )
2376 TEdgeVec* nodeEdges = edgesByNode.ChangeSeek( nodes[i] );
2379 nodeEdges = edgesByNode.Bound( nodes[i], TEdgeVec() );
2380 nodeEdges->reserve(2);
2382 nodeEdges->push_back( edge );
2386 if ( edgesByNode.IsEmpty() )
2390 // build edge branches
2392 TElemGroupVector branches(2);
2393 TNodeGroupVector nodeBranches(2);
2395 while ( !edgesByNode.IsEmpty() )
2397 if ( !theStartNode || !edgesByNode.IsBound( theStartNode ))
2399 theStartNode = TEdgesByNodeMap::Iterator( edgesByNode ).Key();
2402 size_t nbBranches = 0;
2403 bool startIsBranchEnd = false;
2405 while ( edgesByNode.IsBound( theStartNode ))
2407 // initialize a new branch
2410 if ( branches.size() < nbBranches )
2412 branches.push_back ( TEdgeVec() );
2413 nodeBranches.push_back( TNodeVec() );
2415 TEdgeVec & branch = branches [ nbBranches - 1 ];
2416 TNodeVec & nodeBranch = nodeBranches[ nbBranches - 1 ];
2420 TEdgeVec& edges = edgesByNode( theStartNode );
2421 startIsBranchEnd = ( edges.size() != 2 );
2424 const SMDS_MeshElement* startEdge = 0;
2425 for ( size_t i = 0; i < edges.size(); ++i )
2427 if ( !startEdge && edges[i] )
2429 startEdge = edges[i];
2432 nbEdges += bool( edges[i] );
2435 edgesByNode.UnBind( theStartNode );
2439 branch.push_back( startEdge );
2441 nodeBranch.push_back( theStartNode );
2442 nodeBranch.push_back( branch.back()->GetNode(0) );
2443 if ( nodeBranch.back() == theStartNode )
2444 nodeBranch.back() = branch.back()->GetNode(1);
2449 bool isBranchEnd = false;
2452 while (( !isBranchEnd ) && ( edgesPtr = edgesByNode.ChangeSeek( nodeBranch.back() )))
2454 TEdgeVec& edges = *edgesPtr;
2456 isBranchEnd = ( edges.size() != 2 );
2458 const SMDS_MeshNode* lastNode = nodeBranch.back();
2460 switch ( edges.size() )
2463 edgesByNode.UnBind( lastNode );
2468 if ( const SMDS_MeshElement* nextEdge = edges[ edges[0] == branch.back() ])
2470 branch.push_back( nextEdge );
2472 const SMDS_MeshNode* nextNode = nextEdge->GetNode(0);
2473 if ( nodeBranch.back() == nextNode )
2474 nextNode = nextEdge->GetNode(1);
2475 nodeBranch.push_back( nextNode );
2477 edgesByNode.UnBind( lastNode );
2483 for ( size_t i = 0; i < edges.size(); ++i )
2485 if ( edges[i] == branch.back() )
2487 nbEdges += bool( edges[i] );
2490 edgesByNode.UnBind( lastNode );
2493 } // while ( edgesByNode.IsBound( theStartNode ))
2496 // put the found branches to the result
2498 if ( nbBranches == 2 && !startIsBranchEnd ) // join two branches starting at the same node
2500 std::reverse( nodeBranches[0].begin(), nodeBranches[0].end() );
2501 nodeBranches[0].pop_back();
2502 nodeBranches[0].reserve( nodeBranches[0].size() + nodeBranches[1].size() );
2503 nodeBranches[0].insert( nodeBranches[0].end(),
2504 nodeBranches[1].begin(), nodeBranches[1].end() );
2506 std::reverse( branches[0].begin(), branches[0].end() );
2507 branches[0].reserve( branches[0].size() + branches[1].size() );
2508 branches[0].insert( branches[0].end(), branches[1].begin(), branches[1].end() );
2510 nodeBranches[1].clear();
2511 branches[1].clear();
2514 for ( size_t i = 0; i < nbBranches; ++i )
2516 if ( branches[i].empty() )
2519 theEdgeGroups.push_back( TEdgeVec() );
2520 theEdgeGroups.back().swap( branches[i] );
2522 theNodeGroups.push_back( TNodeVec() );
2523 theNodeGroups.back().swap( nodeBranches[i] );
2526 } // while ( !edgesByNode.IsEmpty() )
2531 //=======================================================================
2533 * \brief Return SMESH_NodeSearcher
2535 //=======================================================================
2537 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_Mesh& mesh)
2539 return new SMESH_NodeSearcherImpl( &mesh );
2542 //=======================================================================
2544 * \brief Return SMESH_NodeSearcher
2546 //=======================================================================
2548 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_ElemIteratorPtr elemIt)
2550 return new SMESH_NodeSearcherImpl( 0, elemIt );
2553 //=======================================================================
2555 * \brief Return SMESH_ElementSearcher
2557 //=======================================================================
2559 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
2562 return new SMESH_ElementSearcherImpl( mesh, tolerance );
2565 //=======================================================================
2567 * \brief Return SMESH_ElementSearcher acting on a sub-set of elements
2569 //=======================================================================
2571 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
2572 SMDS_ElemIteratorPtr elemIt,
2575 return new SMESH_ElementSearcherImpl( mesh, tolerance, elemIt );
2579 //================================================================================
2581 * \brief Intersect a ray with a convex volume
2582 * \param [in] ray - the ray
2583 * \param [in] rayLen - ray length
2584 * \param [in] vol - the volume
2585 * \param [out] tMin - return a ray parameter where the ray enters the volume
2586 * \param [out] tMax - return a ray parameter where the ray exit the volume
2587 * \param [out] iFacetMin - facet index where the ray enters the volume
2588 * \param [out] iFacetMax - facet index where the ray exit the volume
2589 * \return bool - true if the ray intersects the volume
2591 //================================================================================
2593 bool SMESH_MeshAlgos::IntersectRayVolume( const gp_Ax1& ray,
2594 const double rayLen,
2595 const SMDS_MeshElement* vol,
2601 /* Ray-Convex Polyhedron Intersection Test by Eric Haines, erich@eye.com
2603 * This test checks the ray against each face of a polyhedron, checking whether
2604 * the set of intersection points found for each ray-plane intersection
2605 * overlaps the previous intersection results. If there is no overlap (i.e.
2606 * no line segment along the ray that is inside the polyhedron), then the
2607 * ray misses and returns false; else true.
2609 SMDS_VolumeTool vTool;
2610 if ( !vTool.Set( vol ))
2613 tMin = -Precision::Infinite() ;
2616 /* Test each plane in polyhedron */
2617 for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
2619 const SMDS_MeshNode** fNodes = vTool.GetFaceNodes( iF );
2621 vTool.GetFaceNormal( iF,
2622 normal.ChangeCoord(1),
2623 normal.ChangeCoord(2),
2624 normal.ChangeCoord(3) );
2625 double D = - ( normal * SMESH_NodeXYZ( fNodes[0] ));
2627 /* Compute intersection point T and sidedness */
2628 double vd = ray.Direction().XYZ() * normal;
2629 double vn = ray.Location().XYZ() * normal + D;
2631 /* ray is parallel to plane - check if ray origin is inside plane's
2634 /* ray origin is outside half-space */
2639 /* ray not parallel - get distance to plane */
2640 double t = -vn / vd ;
2643 /* front face - T is a near point */
2644 if ( t > tMax ) return false;
2653 /* back face - T is a far point */
2654 if ( t < tMin ) return false;
2664 /* survived all tests */
2665 /* Note: if ray originates on polyhedron, may want to change 0.0 to some
2666 * epsilon to avoid intersecting the originating face.
2668 if ( tMin >= 0.0 ) {
2669 /* outside, hitting front face */
2674 if ( tMax < rayLen ) {
2675 /* inside, hitting back face */
2680 /* inside, but back face beyond tmax */