1 // Copyright (C) 2007-2016 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License, or (at your option) any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 // File : SMESH_MeshAlgos.hxx
23 // Created : Tue Apr 30 18:00:36 2013
24 // Author : Edward AGAPOV (eap)
26 // This file holds 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>
52 #include <boost/container/flat_set.hpp>
54 //=======================================================================
56 * \brief Implementation of search for the node closest to point
58 //=======================================================================
60 struct SMESH_NodeSearcherImpl: public SMESH_NodeSearcher
62 //---------------------------------------------------------------------
66 SMESH_NodeSearcherImpl( const SMDS_Mesh* theMesh = 0,
67 SMDS_ElemIteratorPtr theElemIt = SMDS_ElemIteratorPtr() )
69 myMesh = ( SMDS_Mesh* ) theMesh;
71 TIDSortedNodeSet nodes;
73 SMDS_NodeIteratorPtr nIt = theMesh->nodesIterator();
75 nodes.insert( nodes.end(), nIt->next() );
79 while ( theElemIt->more() )
81 const SMDS_MeshElement* e = theElemIt->next();
82 nodes.insert( e->begin_nodes(), e->end_nodes() );
85 myOctreeNode = new SMESH_OctreeNode(nodes) ;
87 // get max size of a leaf box
88 SMESH_OctreeNode* tree = myOctreeNode;
89 while ( !tree->isLeaf() )
91 SMESH_OctreeNodeIteratorPtr cIt = tree->GetChildrenIterator();
95 myHalfLeafSize = tree->maxSize() / 2.;
98 //---------------------------------------------------------------------
100 * \brief Move node and update myOctreeNode accordingly
102 void MoveNode( const SMDS_MeshNode* node, const gp_Pnt& toPnt )
104 myOctreeNode->UpdateByMoveNode( node, toPnt );
105 myMesh->MoveNode( node, toPnt.X(), toPnt.Y(), toPnt.Z() );
108 //---------------------------------------------------------------------
112 const SMDS_MeshNode* FindClosestTo( const gp_Pnt& thePnt )
114 std::map<double, const SMDS_MeshNode*> dist2Nodes;
115 myOctreeNode->NodesAround( thePnt.Coord(), dist2Nodes, myHalfLeafSize );
116 if ( !dist2Nodes.empty() )
117 return dist2Nodes.begin()->second;
119 std::vector<const SMDS_MeshNode*> nodes;
120 //myOctreeNode->NodesAround( &tgtNode, &nodes, myHalfLeafSize );
122 double minSqDist = DBL_MAX;
123 if ( nodes.empty() ) // get all nodes of OctreeNode's closest to thePnt
125 // sort leafs by their distance from thePnt
126 typedef std::multimap< double, SMESH_OctreeNode* > TDistTreeMap;
127 TDistTreeMap treeMap;
128 std::list< SMESH_OctreeNode* > treeList;
129 std::list< SMESH_OctreeNode* >::iterator trIt;
130 treeList.push_back( myOctreeNode );
132 gp_XYZ pointNode( thePnt.X(), thePnt.Y(), thePnt.Z() );
133 bool pointInside = myOctreeNode->isInside( pointNode, myHalfLeafSize );
134 for ( trIt = treeList.begin(); trIt != treeList.end(); ++trIt)
136 SMESH_OctreeNode* tree = *trIt;
137 if ( !tree->isLeaf() ) // put children to the queue
139 if ( pointInside && !tree->isInside( pointNode, myHalfLeafSize )) continue;
140 SMESH_OctreeNodeIteratorPtr cIt = tree->GetChildrenIterator();
141 while ( cIt->more() )
142 treeList.push_back( cIt->next() );
144 else if ( tree->NbNodes() ) // put a tree to the treeMap
146 const Bnd_B3d& box = *tree->getBox();
147 double sqDist = thePnt.SquareDistance( 0.5 * ( box.CornerMin() + box.CornerMax() ));
148 treeMap.insert( std::make_pair( sqDist, tree ));
151 // find distance after which there is no sense to check tree's
152 double sqLimit = DBL_MAX;
153 TDistTreeMap::iterator sqDist_tree = treeMap.begin();
154 if ( treeMap.size() > 5 ) {
155 SMESH_OctreeNode* closestTree = sqDist_tree->second;
156 const Bnd_B3d& box = *closestTree->getBox();
157 double limit = sqrt( sqDist_tree->first ) + sqrt ( box.SquareExtent() );
158 sqLimit = limit * limit;
160 // get all nodes from trees
161 for ( ; sqDist_tree != treeMap.end(); ++sqDist_tree) {
162 if ( sqDist_tree->first > sqLimit )
164 SMESH_OctreeNode* tree = sqDist_tree->second;
165 tree->AllNodesAround( tree->GetNodeIterator()->next(), &nodes );
168 // find closest among nodes
170 const SMDS_MeshNode* closestNode = 0;
171 for ( size_t i = 0; i < nodes.size(); ++i )
173 double sqDist = thePnt.SquareDistance( SMESH_NodeXYZ( nodes[ i ]));
174 if ( minSqDist > sqDist ) {
175 closestNode = nodes[ i ];
182 //---------------------------------------------------------------------
184 * \brief Finds nodes located within a tolerance near a point
186 int FindNearPoint(const gp_Pnt& point,
187 const double tolerance,
188 std::vector< const SMDS_MeshNode* >& foundNodes)
190 myOctreeNode->NodesAround( point.Coord(), foundNodes, tolerance );
191 return foundNodes.size();
194 //---------------------------------------------------------------------
198 ~SMESH_NodeSearcherImpl() { delete myOctreeNode; }
200 //---------------------------------------------------------------------
202 * \brief Return the node tree
204 const SMESH_OctreeNode* getTree() const { return myOctreeNode; }
207 SMESH_OctreeNode* myOctreeNode;
209 double myHalfLeafSize; // max size of a leaf box
212 // ========================================================================
213 namespace // Utils used in SMESH_ElementSearcherImpl::FindElementsByPoint()
215 const int MaxNbElemsInLeaf = 10; // maximal number of elements in a leaf of tree
216 const int MaxLevel = 7; // maximal tree height -> nb terminal boxes: 8^7 = 2097152
217 const double NodeRadius = 1e-9; // to enlarge bnd box of element
219 //=======================================================================
221 * \brief Octal tree of bounding boxes of elements
223 //=======================================================================
225 class ElementBndBoxTree : public SMESH_Octree
229 typedef boost::container::flat_set< const SMDS_MeshElement*, TIDCompare > TElemSeq;
231 ElementBndBoxTree(const SMDS_Mesh& mesh,
232 SMDSAbs_ElementType elemType,
233 SMDS_ElemIteratorPtr theElemIt = SMDS_ElemIteratorPtr(),
234 double tolerance = NodeRadius );
235 void getElementsNearPoint( const gp_Pnt& point, TElemSeq& foundElems );
236 void getElementsNearLine ( const gp_Ax1& line, TElemSeq& foundElems );
237 void getElementsInBox ( const Bnd_B3d& box, TElemSeq& foundElems );
238 void getElementsInSphere ( const gp_XYZ& center, const double radius, TElemSeq& foundElems );
239 ElementBndBoxTree* getLeafAtPoint( const gp_XYZ& point );
242 ElementBndBoxTree() {}
243 SMESH_Octree* newChild() const { return new ElementBndBoxTree; }
244 void buildChildrenData();
245 Bnd_B3d* buildRootBox();
247 //!< Bounding box of element
248 struct ElementBox : public Bnd_B3d
250 const SMDS_MeshElement* _element;
251 void init(const SMDS_MeshElement* elem, double tolerance);
253 std::vector< ElementBox* > _elements;
255 typedef ObjectPool< ElementBox > TElementBoxPool;
257 //!< allocator of ElementBox's and SMESH_TreeLimit
258 struct LimitAndPool : public SMESH_TreeLimit
260 TElementBoxPool _elBoPool;
261 LimitAndPool():SMESH_TreeLimit( MaxLevel, /*minSize=*/0. ) {}
263 LimitAndPool* getLimitAndPool() const
265 SMESH_TreeLimit* limitAndPool = const_cast< SMESH_TreeLimit* >( myLimit );
266 return static_cast< LimitAndPool* >( limitAndPool );
270 //================================================================================
272 * \brief ElementBndBoxTree creation
274 //================================================================================
276 ElementBndBoxTree::ElementBndBoxTree(const SMDS_Mesh& mesh,
277 SMDSAbs_ElementType elemType,
278 SMDS_ElemIteratorPtr theElemIt,
280 :SMESH_Octree( new LimitAndPool() )
282 int nbElems = mesh.GetMeshInfo().NbElements( elemType );
283 _elements.reserve( nbElems );
285 TElementBoxPool& elBoPool = getLimitAndPool()->_elBoPool;
287 SMDS_ElemIteratorPtr elemIt = theElemIt ? theElemIt : mesh.elementsIterator( elemType );
288 while ( elemIt->more() )
290 ElementBox* eb = elBoPool.getNew();
291 eb->init( elemIt->next(), tolerance );
292 _elements.push_back( eb );
297 //================================================================================
299 * \brief Return the maximal box
301 //================================================================================
303 Bnd_B3d* ElementBndBoxTree::buildRootBox()
305 Bnd_B3d* box = new Bnd_B3d;
306 for ( size_t i = 0; i < _elements.size(); ++i )
307 box->Add( *_elements[i] );
311 //================================================================================
313 * \brief Redistrubute element boxes among children
315 //================================================================================
317 void ElementBndBoxTree::buildChildrenData()
319 for ( size_t i = 0; i < _elements.size(); ++i )
321 for (int j = 0; j < 8; j++)
323 if ( !_elements[i]->IsOut( *myChildren[j]->getBox() ))
324 ((ElementBndBoxTree*)myChildren[j])->_elements.push_back( _elements[i]);
327 //_size = _elements.size();
328 SMESHUtils::FreeVector( _elements ); // = _elements.clear() + free memory
330 for (int j = 0; j < 8; j++)
332 ElementBndBoxTree* child = static_cast<ElementBndBoxTree*>( myChildren[j]);
333 if ((int) child->_elements.size() <= MaxNbElemsInLeaf )
334 child->myIsLeaf = true;
336 if ( child->isLeaf() && child->_elements.capacity() > child->_elements.size() )
337 SMESHUtils::CompactVector( child->_elements );
341 //================================================================================
343 * \brief Return elements which can include the point
345 //================================================================================
347 void ElementBndBoxTree::getElementsNearPoint( const gp_Pnt& point, TElemSeq& foundElems)
349 if ( getBox()->IsOut( point.XYZ() ))
354 for ( size_t i = 0; i < _elements.size(); ++i )
355 if ( !_elements[i]->IsOut( point.XYZ() ))
356 foundElems.insert( _elements[i]->_element );
360 for (int i = 0; i < 8; i++)
361 ((ElementBndBoxTree*) myChildren[i])->getElementsNearPoint( point, foundElems );
365 //================================================================================
367 * \brief Return elements which can be intersected by the line
369 //================================================================================
371 void ElementBndBoxTree::getElementsNearLine( const gp_Ax1& line, TElemSeq& foundElems )
373 if ( getBox()->IsOut( line ))
378 for ( size_t i = 0; i < _elements.size(); ++i )
379 if ( !_elements[i]->IsOut( line ) )
380 foundElems.insert( _elements[i]->_element );
384 for (int i = 0; i < 8; i++)
385 ((ElementBndBoxTree*) myChildren[i])->getElementsNearLine( line, foundElems );
389 //================================================================================
391 * \brief Return elements from leaves intersecting the sphere
393 //================================================================================
395 void ElementBndBoxTree::getElementsInSphere ( const gp_XYZ& center,
397 TElemSeq& foundElems)
399 if ( getBox()->IsOut( center, radius ))
404 for ( size_t i = 0; i < _elements.size(); ++i )
405 if ( !_elements[i]->IsOut( center, radius ))
406 foundElems.insert( _elements[i]->_element );
410 for (int i = 0; i < 8; i++)
411 ((ElementBndBoxTree*) myChildren[i])->getElementsInSphere( center, radius, foundElems );
415 //================================================================================
417 * \brief Return elements from leaves intersecting the box
419 //================================================================================
421 void ElementBndBoxTree::getElementsInBox( const Bnd_B3d& box, TElemSeq& foundElems )
423 if ( getBox()->IsOut( box ))
428 for ( size_t i = 0; i < _elements.size(); ++i )
429 if ( !_elements[i]->IsOut( box ))
430 foundElems.insert( _elements[i]->_element );
434 for (int i = 0; i < 8; i++)
435 ((ElementBndBoxTree*) myChildren[i])->getElementsInBox( box, foundElems );
439 //================================================================================
441 * \brief Return a leaf including a point
443 //================================================================================
445 ElementBndBoxTree* ElementBndBoxTree::getLeafAtPoint( const gp_XYZ& point )
447 if ( getBox()->IsOut( point ))
456 for (int i = 0; i < 8; i++)
457 if ( ElementBndBoxTree* l = ((ElementBndBoxTree*) myChildren[i])->getLeafAtPoint( point ))
463 //================================================================================
465 * \brief Construct the element box
467 //================================================================================
469 void ElementBndBoxTree::ElementBox::init(const SMDS_MeshElement* elem, double tolerance)
472 SMDS_ElemIteratorPtr nIt = elem->nodesIterator();
473 while ( nIt->more() )
474 Add( SMESH_NodeXYZ( nIt->next() ));
475 Enlarge( tolerance );
480 //=======================================================================
482 * \brief Implementation of search for the elements by point and
483 * of classification of point in 2D mesh
485 //=======================================================================
487 SMESH_ElementSearcher::~SMESH_ElementSearcher()
491 struct SMESH_ElementSearcherImpl: public SMESH_ElementSearcher
494 SMDS_ElemIteratorPtr _meshPartIt;
495 ElementBndBoxTree* _ebbTree [SMDSAbs_NbElementTypes];
496 int _ebbTreeHeight[SMDSAbs_NbElementTypes];
497 SMESH_NodeSearcherImpl* _nodeSearcher;
498 SMDSAbs_ElementType _elementType;
500 bool _outerFacesFound;
501 std::set<const SMDS_MeshElement*> _outerFaces; // empty means "no internal faces at all"
503 SMESH_ElementSearcherImpl( SMDS_Mesh& mesh,
505 SMDS_ElemIteratorPtr elemIt=SMDS_ElemIteratorPtr())
506 : _mesh(&mesh),_meshPartIt(elemIt),_nodeSearcher(0),_tolerance(tol),_outerFacesFound(false)
508 for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
511 _ebbTreeHeight[i] = -1;
513 _elementType = SMDSAbs_All;
515 virtual ~SMESH_ElementSearcherImpl()
517 for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
519 delete _ebbTree[i]; _ebbTree[i] = NULL;
521 if ( _nodeSearcher ) delete _nodeSearcher; _nodeSearcher = 0;
523 virtual int FindElementsByPoint(const gp_Pnt& point,
524 SMDSAbs_ElementType type,
525 std::vector< const SMDS_MeshElement* >& foundElements);
526 virtual TopAbs_State GetPointState(const gp_Pnt& point);
527 virtual const SMDS_MeshElement* FindClosestTo( const gp_Pnt& point,
528 SMDSAbs_ElementType type );
530 virtual void GetElementsNearLine( const gp_Ax1& line,
531 SMDSAbs_ElementType type,
532 std::vector< const SMDS_MeshElement* >& foundElems);
533 virtual void GetElementsInSphere( const gp_XYZ& center,
535 SMDSAbs_ElementType type,
536 std::vector< const SMDS_MeshElement* >& foundElems);
537 virtual void GetElementsInBox( const Bnd_B3d& box,
538 SMDSAbs_ElementType type,
539 std::vector< const SMDS_MeshElement* >& foundElems);
540 virtual gp_XYZ Project(const gp_Pnt& point,
541 SMDSAbs_ElementType type,
542 const SMDS_MeshElement** closestElem);
543 double getTolerance();
544 bool getIntersParamOnLine(const gp_Lin& line, const SMDS_MeshElement* face,
545 const double tolerance, double & param);
546 void findOuterBoundary(const SMDS_MeshElement* anyOuterFace);
547 bool isOuterBoundary(const SMDS_MeshElement* face) const
549 return _outerFaces.empty() || _outerFaces.count(face);
553 if ( _ebbTreeHeight[ _elementType ] < 0 )
554 _ebbTreeHeight[ _elementType ] = _ebbTree[ _elementType ]->getHeight();
555 return _ebbTreeHeight[ _elementType ];
558 struct TInters //!< data of intersection of the line and the mesh face (used in GetPointState())
560 const SMDS_MeshElement* _face;
562 bool _coincides; //!< the line lays in face plane
563 TInters(const SMDS_MeshElement* face, const gp_Vec& faceNorm, bool coinc=false)
564 : _face(face), _faceNorm( faceNorm ), _coincides( coinc ) {}
566 struct TFaceLink //!< link and faces sharing it (used in findOuterBoundary())
569 TIDSortedElemSet _faces;
570 TFaceLink( const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshElement* face)
571 : _link( n1, n2 ), _faces( &face, &face + 1) {}
575 ostream& operator<< (ostream& out, const SMESH_ElementSearcherImpl::TInters& i)
577 return out << "TInters(face=" << ( i._face ? i._face->GetID() : 0)
578 << ", _coincides="<<i._coincides << ")";
581 //=======================================================================
583 * \brief define tolerance for search
585 //=======================================================================
587 double SMESH_ElementSearcherImpl::getTolerance()
589 if ( _tolerance < 0 )
591 const SMDS_MeshInfo& meshInfo = _mesh->GetMeshInfo();
594 if ( _nodeSearcher && meshInfo.NbNodes() > 1 )
596 double boxSize = _nodeSearcher->getTree()->maxSize();
597 _tolerance = 1e-8 * boxSize/* / meshInfo.NbNodes()*/;
599 else if ( _ebbTree[_elementType] && meshInfo.NbElements() > 0 )
601 double boxSize = _ebbTree[_elementType]->maxSize();
602 _tolerance = 1e-8 * boxSize/* / meshInfo.NbElements()*/;
604 if ( _tolerance == 0 )
606 // define tolerance by size of a most complex element
607 int complexType = SMDSAbs_Volume;
608 while ( complexType > SMDSAbs_All &&
609 meshInfo.NbElements( SMDSAbs_ElementType( complexType )) < 1 )
611 if ( complexType == SMDSAbs_All ) return 0; // empty mesh
613 if ( complexType == int( SMDSAbs_Node ))
615 SMDS_NodeIteratorPtr nodeIt = _mesh->nodesIterator();
617 if ( meshInfo.NbNodes() > 2 )
618 elemSize = SMESH_TNodeXYZ( nodeIt->next() ).Distance( nodeIt->next() );
622 SMDS_ElemIteratorPtr elemIt = _mesh->elementsIterator( SMDSAbs_ElementType( complexType ));
623 const SMDS_MeshElement* elem = elemIt->next();
624 SMDS_ElemIteratorPtr nodeIt = elem->nodesIterator();
625 SMESH_TNodeXYZ n1( nodeIt->next() );
627 while ( nodeIt->more() )
629 double dist = n1.Distance( static_cast<const SMDS_MeshNode*>( nodeIt->next() ));
630 elemSize = std::max( dist, elemSize );
633 _tolerance = 1e-4 * elemSize;
639 //================================================================================
641 * \brief Find intersection of the line and an edge of face and return parameter on line
643 //================================================================================
645 bool SMESH_ElementSearcherImpl::getIntersParamOnLine(const gp_Lin& line,
646 const SMDS_MeshElement* face,
653 GeomAPI_ExtremaCurveCurve anExtCC;
654 Handle(Geom_Curve) lineCurve = new Geom_Line( line );
656 int nbNodes = face->IsQuadratic() ? face->NbNodes()/2 : face->NbNodes();
657 for ( int i = 0; i < nbNodes && nbInts < 2; ++i )
659 GC_MakeSegment edge( SMESH_TNodeXYZ( face->GetNode( i )),
660 SMESH_TNodeXYZ( face->GetNode( (i+1)%nbNodes) ));
661 anExtCC.Init( lineCurve, edge.Value() );
662 if ( anExtCC.NbExtrema() > 0 && anExtCC.LowerDistance() <= tol)
664 Standard_Real pl, pe;
665 anExtCC.LowerDistanceParameters( pl, pe );
671 if ( nbInts > 0 ) param /= nbInts;
674 //================================================================================
676 * \brief Find all faces belonging to the outer boundary of mesh
678 //================================================================================
680 void SMESH_ElementSearcherImpl::findOuterBoundary(const SMDS_MeshElement* outerFace)
682 if ( _outerFacesFound ) return;
684 // Collect all outer faces by passing from one outer face to another via their links
685 // and BTW find out if there are internal faces at all.
687 // checked links and links where outer boundary meets internal one
688 std::set< SMESH_TLink > visitedLinks, seamLinks;
690 // links to treat with already visited faces sharing them
691 std::list < TFaceLink > startLinks;
693 // load startLinks with the first outerFace
694 startLinks.push_back( TFaceLink( outerFace->GetNode(0), outerFace->GetNode(1), outerFace));
695 _outerFaces.insert( outerFace );
697 TIDSortedElemSet emptySet;
698 while ( !startLinks.empty() )
700 const SMESH_TLink& link = startLinks.front()._link;
701 TIDSortedElemSet& faces = startLinks.front()._faces;
703 outerFace = *faces.begin();
704 // find other faces sharing the link
705 const SMDS_MeshElement* f;
706 while (( f = SMESH_MeshAlgos::FindFaceInSet(link.node1(), link.node2(), emptySet, faces )))
709 // select another outer face among the found
710 const SMDS_MeshElement* outerFace2 = 0;
711 if ( faces.size() == 2 )
713 outerFace2 = (outerFace == *faces.begin() ? *faces.rbegin() : *faces.begin());
715 else if ( faces.size() > 2 )
717 seamLinks.insert( link );
719 // link direction within the outerFace
720 gp_Vec n1n2( SMESH_TNodeXYZ( link.node1()),
721 SMESH_TNodeXYZ( link.node2()));
722 int i1 = outerFace->GetNodeIndex( link.node1() );
723 int i2 = outerFace->GetNodeIndex( link.node2() );
724 bool rev = ( abs(i2-i1) == 1 ? i1 > i2 : i2 > i1 );
725 if ( rev ) n1n2.Reverse();
727 gp_XYZ ofNorm, fNorm;
728 if ( SMESH_MeshAlgos::FaceNormal( outerFace, ofNorm, /*normalized=*/false ))
730 // direction from the link inside outerFace
731 gp_Vec dirInOF = gp_Vec( ofNorm ) ^ n1n2;
732 // sort all other faces by angle with the dirInOF
733 std::map< double, const SMDS_MeshElement* > angle2Face;
734 std::set< const SMDS_MeshElement*, TIDCompare >::const_iterator face = faces.begin();
735 for ( ; face != faces.end(); ++face )
737 if ( *face == outerFace ) continue;
738 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false ))
740 gp_Vec dirInF = gp_Vec( fNorm ) ^ n1n2;
741 double angle = dirInOF.AngleWithRef( dirInF, n1n2 );
742 if ( angle < 0 ) angle += 2. * M_PI;
743 angle2Face.insert( std::make_pair( angle, *face ));
745 if ( !angle2Face.empty() )
746 outerFace2 = angle2Face.begin()->second;
749 // store the found outer face and add its links to continue searching from
752 _outerFaces.insert( outerFace2 );
753 int nbNodes = outerFace2->NbCornerNodes();
754 for ( int i = 0; i < nbNodes; ++i )
756 SMESH_TLink link2( outerFace2->GetNode(i), outerFace2->GetNode((i+1)%nbNodes));
757 if ( visitedLinks.insert( link2 ).second )
758 startLinks.push_back( TFaceLink( link2.node1(), link2.node2(), outerFace2 ));
761 startLinks.pop_front();
763 _outerFacesFound = true;
765 if ( !seamLinks.empty() )
767 // There are internal boundaries touching the outher one,
768 // find all faces of internal boundaries in order to find
769 // faces of boundaries of holes, if any.
778 //=======================================================================
780 * \brief Find elements of given type where the given point is IN or ON.
781 * Returns nb of found elements and elements them-selves.
783 * 'ALL' type means elements of any type excluding nodes, balls and 0D elements
785 //=======================================================================
787 int SMESH_ElementSearcherImpl::
788 FindElementsByPoint(const gp_Pnt& point,
789 SMDSAbs_ElementType type,
790 std::vector< const SMDS_MeshElement* >& foundElements)
792 foundElements.clear();
795 double tolerance = getTolerance();
797 // =================================================================================
798 if ( type == SMDSAbs_Node || type == SMDSAbs_0DElement || type == SMDSAbs_Ball)
800 if ( !_nodeSearcher )
803 _nodeSearcher = new SMESH_NodeSearcherImpl( 0, _meshPartIt );
805 _nodeSearcher = new SMESH_NodeSearcherImpl( _mesh );
807 std::vector< const SMDS_MeshNode* > foundNodes;
808 _nodeSearcher->FindNearPoint( point, tolerance, foundNodes );
810 if ( type == SMDSAbs_Node )
812 foundElements.assign( foundNodes.begin(), foundNodes.end() );
816 for ( size_t i = 0; i < foundNodes.size(); ++i )
818 SMDS_ElemIteratorPtr elemIt = foundNodes[i]->GetInverseElementIterator( type );
819 while ( elemIt->more() )
820 foundElements.push_back( elemIt->next() );
824 // =================================================================================
825 else // elements more complex than 0D
827 if ( !_ebbTree[type] )
829 _ebbTree[_elementType] = new ElementBndBoxTree( *_mesh, type, _meshPartIt, tolerance );
831 ElementBndBoxTree::TElemSeq suspectElems;
832 _ebbTree[ type ]->getElementsNearPoint( point, suspectElems );
833 ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
834 for ( ; elem != suspectElems.end(); ++elem )
835 if ( !SMESH_MeshAlgos::IsOut( *elem, point, tolerance ))
836 foundElements.push_back( *elem );
838 return foundElements.size();
841 //=======================================================================
843 * \brief Find an element of given type most close to the given point
845 * WARNING: Only face search is implemeneted so far
847 //=======================================================================
849 const SMDS_MeshElement*
850 SMESH_ElementSearcherImpl::FindClosestTo( const gp_Pnt& point,
851 SMDSAbs_ElementType type )
853 const SMDS_MeshElement* closestElem = 0;
856 if ( type == SMDSAbs_Face ||
857 type == SMDSAbs_Volume ||
858 type == SMDSAbs_Edge )
860 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
862 ebbTree = new ElementBndBoxTree( *_mesh, type, _meshPartIt );
864 ElementBndBoxTree::TElemSeq suspectElems;
865 ebbTree->getElementsNearPoint( point, suspectElems );
867 if ( suspectElems.empty() && ebbTree->maxSize() > 0 )
869 gp_Pnt boxCenter = 0.5 * ( ebbTree->getBox()->CornerMin() +
870 ebbTree->getBox()->CornerMax() );
872 if ( ebbTree->getBox()->IsOut( point.XYZ() ))
873 radius = point.Distance( boxCenter ) - 0.5 * ebbTree->maxSize();
875 radius = ebbTree->maxSize() / pow( 2., getTreeHeight()) / 2;
876 while ( suspectElems.empty() )
878 ebbTree->getElementsInSphere( point.XYZ(), radius, suspectElems );
882 double minDist = std::numeric_limits<double>::max();
883 std::multimap< double, const SMDS_MeshElement* > dist2face;
884 ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
885 for ( ; elem != suspectElems.end(); ++elem )
887 double dist = SMESH_MeshAlgos::GetDistance( *elem, point );
888 if ( dist < minDist + 1e-10)
891 dist2face.insert( dist2face.begin(), std::make_pair( dist, *elem ));
894 if ( !dist2face.empty() )
896 std::multimap< double, const SMDS_MeshElement* >::iterator d2f = dist2face.begin();
897 closestElem = d2f->second;
898 // if there are several elements at the same distance, select one
899 // with GC closest to the point
900 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
901 double minDistToGC = 0;
902 for ( ++d2f; d2f != dist2face.end() && fabs( d2f->first - minDist ) < 1e-10; ++d2f )
904 if ( minDistToGC == 0 )
907 gc = accumulate( TXyzIterator(closestElem->nodesIterator()),
908 TXyzIterator(), gc ) / closestElem->NbNodes();
909 minDistToGC = point.SquareDistance( gc );
912 gc = accumulate( TXyzIterator( d2f->second->nodesIterator()),
913 TXyzIterator(), gc ) / d2f->second->NbNodes();
914 double d = point.SquareDistance( gc );
915 if ( d < minDistToGC )
918 closestElem = d2f->second;
921 // cout << "FindClosestTo( " <<point.X()<<", "<<point.Y()<<", "<<point.Z()<<" ) FACE "
922 // <<closestElem->GetID() << " DIST " << minDist << endl;
927 // NOT IMPLEMENTED SO FAR
933 //================================================================================
935 * \brief Classify the given point in the closed 2D mesh
937 //================================================================================
939 TopAbs_State SMESH_ElementSearcherImpl::GetPointState(const gp_Pnt& point)
941 _elementType = SMDSAbs_Face;
943 double tolerance = getTolerance();
945 ElementBndBoxTree*& ebbTree = _ebbTree[ SMDSAbs_Face ];
947 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
949 // Algo: analyse transition of a line starting at the point through mesh boundary;
950 // try three lines parallel to axis of the coordinate system and perform rough
951 // analysis. If solution is not clear perform thorough analysis.
953 const int nbAxes = 3;
954 gp_Dir axisDir[ nbAxes ] = { gp::DX(), gp::DY(), gp::DZ() };
955 std::map< double, TInters > paramOnLine2TInters[ nbAxes ];
956 std::list< TInters > tangentInters[ nbAxes ]; // of faces whose plane includes the line
957 std::multimap< int, int > nbInt2Axis; // to find the simplest case
958 for ( int axis = 0; axis < nbAxes; ++axis )
960 gp_Ax1 lineAxis( point, axisDir[axis]);
961 gp_Lin line ( lineAxis );
963 ElementBndBoxTree::TElemSeq suspectFaces; // faces possibly intersecting the line
964 ebbTree->getElementsNearLine( lineAxis, suspectFaces );
966 // Intersect faces with the line
968 std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
969 ElementBndBoxTree::TElemSeq::iterator face = suspectFaces.begin();
970 for ( ; face != suspectFaces.end(); ++face )
974 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false)) continue;
975 gp_Pln facePlane( SMESH_TNodeXYZ( (*face)->GetNode(0)), fNorm );
977 // perform intersection
978 IntAna_IntConicQuad intersection( line, IntAna_Quadric( facePlane ));
979 if ( !intersection.IsDone() )
981 if ( intersection.IsInQuadric() )
983 tangentInters[ axis ].push_back( TInters( *face, fNorm, true ));
985 else if ( ! intersection.IsParallel() && intersection.NbPoints() > 0 )
987 double tol = 1e-4 * Sqrt( fNorm.Modulus() );
988 gp_Pnt intersectionPoint = intersection.Point(1);
989 if ( !SMESH_MeshAlgos::IsOut( *face, intersectionPoint, tol ))
990 u2inters.insert( std::make_pair( intersection.ParamOnConic(1), TInters( *face, fNorm )));
993 // Analyse intersections roughly
995 int nbInter = u2inters.size();
999 double f = u2inters.begin()->first, l = u2inters.rbegin()->first;
1000 if ( nbInter == 1 ) // not closed mesh
1001 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
1003 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
1006 if ( (f<0) == (l<0) )
1009 int nbIntBeforePoint = std::distance( u2inters.begin(), u2inters.lower_bound(0));
1010 int nbIntAfterPoint = nbInter - nbIntBeforePoint;
1011 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
1014 nbInt2Axis.insert( std::make_pair( std::min( nbIntBeforePoint, nbIntAfterPoint ), axis ));
1016 if ( _outerFacesFound ) break; // pass to thorough analysis
1018 } // three attempts - loop on CS axes
1020 // Analyse intersections thoroughly.
1021 // We make two loops maximum, on the first one we only exclude touching intersections,
1022 // on the second, if situation is still unclear, we gather and use information on
1023 // position of faces (internal or outer). If faces position is already gathered,
1024 // we make the second loop right away.
1026 for ( int hasPositionInfo = _outerFacesFound; hasPositionInfo < 2; ++hasPositionInfo )
1028 std::multimap< int, int >::const_iterator nb_axis = nbInt2Axis.begin();
1029 for ( ; nb_axis != nbInt2Axis.end(); ++nb_axis )
1031 int axis = nb_axis->second;
1032 std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
1034 gp_Ax1 lineAxis( point, axisDir[axis]);
1035 gp_Lin line ( lineAxis );
1037 // add tangent intersections to u2inters
1039 std::list< TInters >::const_iterator tgtInt = tangentInters[ axis ].begin();
1040 for ( ; tgtInt != tangentInters[ axis ].end(); ++tgtInt )
1041 if ( getIntersParamOnLine( line, tgtInt->_face, tolerance, param ))
1042 u2inters.insert( std::make_pair( param, *tgtInt ));
1043 tangentInters[ axis ].clear();
1045 // Count intersections before and after the point excluding touching ones.
1046 // If hasPositionInfo we count intersections of outer boundary only
1048 int nbIntBeforePoint = 0, nbIntAfterPoint = 0;
1049 double f = std::numeric_limits<double>::max(), l = -std::numeric_limits<double>::max();
1050 std::map< double, TInters >::iterator u_int1 = u2inters.begin(), u_int2 = u_int1;
1051 bool ok = ! u_int1->second._coincides;
1052 while ( ok && u_int1 != u2inters.end() )
1054 double u = u_int1->first;
1055 bool touchingInt = false;
1056 if ( ++u_int2 != u2inters.end() )
1058 // skip intersections at the same point (if the line passes through edge or node)
1060 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u ) < tolerance )
1066 // skip tangent intersections
1068 if ( u_int2 != u2inters.end() )
1070 const SMDS_MeshElement* prevFace = u_int1->second._face;
1071 while ( ok && u_int2->second._coincides )
1073 if ( SMESH_MeshAlgos::GetCommonNodes(prevFace , u_int2->second._face).empty() )
1079 ok = ( u_int2 != u2inters.end() );
1085 // skip intersections at the same point after tangent intersections
1088 double u2 = u_int2->first;
1090 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u2 ) < tolerance )
1096 // decide if we skipped a touching intersection
1097 if ( nbSamePnt + nbTgt > 0 )
1099 double minDot = std::numeric_limits<double>::max(), maxDot = -minDot;
1100 std::map< double, TInters >::iterator u_int = u_int1;
1101 for ( ; u_int != u_int2; ++u_int )
1103 if ( u_int->second._coincides ) continue;
1104 double dot = u_int->second._faceNorm * line.Direction();
1105 if ( dot > maxDot ) maxDot = dot;
1106 if ( dot < minDot ) minDot = dot;
1108 touchingInt = ( minDot*maxDot < 0 );
1113 if ( !hasPositionInfo || isOuterBoundary( u_int1->second._face ))
1124 u_int1 = u_int2; // to next intersection
1126 } // loop on intersections with one line
1130 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
1133 if ( nbIntBeforePoint == 0 || nbIntAfterPoint == 0)
1136 if ( nbIntBeforePoint + nbIntAfterPoint == 1 ) // not closed mesh
1137 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
1139 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
1142 if ( (f<0) == (l<0) )
1145 if ( hasPositionInfo )
1146 return nbIntBeforePoint % 2 ? TopAbs_IN : TopAbs_OUT;
1148 } // loop on intersections of the tree lines - thorough analysis
1150 if ( !hasPositionInfo )
1152 // gather info on faces position - is face in the outer boundary or not
1153 std::map< double, TInters > & u2inters = paramOnLine2TInters[ 0 ];
1154 findOuterBoundary( u2inters.begin()->second._face );
1157 } // two attempts - with and w/o faces position info in the mesh
1159 return TopAbs_UNKNOWN;
1162 //=======================================================================
1164 * \brief Return elements possibly intersecting the line
1166 //=======================================================================
1168 void SMESH_ElementSearcherImpl::
1169 GetElementsNearLine( const gp_Ax1& line,
1170 SMDSAbs_ElementType type,
1171 std::vector< const SMDS_MeshElement* >& foundElems)
1173 _elementType = type;
1174 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1176 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1178 ElementBndBoxTree::TElemSeq elems;
1179 ebbTree->getElementsNearLine( line, elems );
1181 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1184 //=======================================================================
1186 * Return elements whose bounding box intersects a sphere
1188 //=======================================================================
1190 void SMESH_ElementSearcherImpl::
1191 GetElementsInSphere( const gp_XYZ& center,
1192 const double radius,
1193 SMDSAbs_ElementType type,
1194 std::vector< const SMDS_MeshElement* >& foundElems)
1196 _elementType = type;
1197 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1199 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
1201 ElementBndBoxTree::TElemSeq elems;
1202 ebbTree->getElementsInSphere( center, radius, elems );
1204 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1207 //=======================================================================
1209 * Return elements whose bounding box intersects a given bounding box
1211 //=======================================================================
1213 void SMESH_ElementSearcherImpl::
1214 GetElementsInBox( const Bnd_B3d& box,
1215 SMDSAbs_ElementType type,
1216 std::vector< const SMDS_MeshElement* >& foundElems)
1218 _elementType = type;
1219 ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
1221 ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt, getTolerance() );
1223 ElementBndBoxTree::TElemSeq elems;
1224 ebbTree->getElementsInBox( box, elems );
1226 foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
1229 //=======================================================================
1231 * \brief Return a projection of a given point to a mesh.
1232 * Optionally return the closest element
1234 //=======================================================================
1236 gp_XYZ SMESH_ElementSearcherImpl::Project(const gp_Pnt& point,
1237 SMDSAbs_ElementType type,
1238 const SMDS_MeshElement** closestElem)
1240 _elementType = type;
1241 if ( _mesh->GetMeshInfo().NbElements( _elementType ) == 0 )
1242 throw SALOME_Exception( LOCALIZED( "No elements of given type in the mesh" ));
1244 ElementBndBoxTree*& ebbTree = _ebbTree[ _elementType ];
1246 ebbTree = new ElementBndBoxTree( *_mesh, _elementType );
1248 gp_XYZ p = point.XYZ();
1249 ElementBndBoxTree* ebbLeaf = ebbTree->getLeafAtPoint( p );
1250 const Bnd_B3d* box = ebbLeaf->getBox();
1251 double radius = ( box->CornerMax() - box->CornerMin() ).Modulus();
1253 ElementBndBoxTree::TElemSeq elems;
1254 ebbTree->getElementsInSphere( p, radius, elems );
1255 while ( elems.empty() )
1258 ebbTree->getElementsInSphere( p, radius, elems );
1260 gp_XYZ proj, bestProj;
1261 const SMDS_MeshElement* elem = 0;
1262 double minDist = 2 * radius;
1263 ElementBndBoxTree::TElemSeq::iterator e = elems.begin();
1264 for ( ; e != elems.end(); ++e )
1266 double d = SMESH_MeshAlgos::GetDistance( *e, p, &proj );
1274 if ( closestElem ) *closestElem = elem;
1279 //=======================================================================
1281 * \brief Return true if the point is IN or ON of the element
1283 //=======================================================================
1285 bool SMESH_MeshAlgos::IsOut( const SMDS_MeshElement* element, const gp_Pnt& point, double tol )
1287 if ( element->GetType() == SMDSAbs_Volume)
1289 return SMDS_VolumeTool( element ).IsOut( point.X(), point.Y(), point.Z(), tol );
1292 // get ordered nodes
1294 std::vector< SMESH_TNodeXYZ > xyz; xyz.reserve( element->NbNodes()+1 );
1296 SMDS_NodeIteratorPtr nodeIt = element->interlacedNodesIterator();
1297 for ( int i = 0; nodeIt->more(); ++i )
1298 xyz.push_back( SMESH_TNodeXYZ( nodeIt->next() ));
1300 int i, nbNodes = (int) xyz.size(); // central node of biquadratic is missing
1302 if ( element->GetType() == SMDSAbs_Face ) // --------------------------------------------------
1304 // compute face normal
1305 gp_Vec faceNorm(0,0,0);
1306 xyz.push_back( xyz.front() );
1307 for ( i = 0; i < nbNodes; ++i )
1309 gp_Vec edge1( xyz[i+1], xyz[i]);
1310 gp_Vec edge2( xyz[i+1], xyz[(i+2)%nbNodes] );
1311 faceNorm += edge1 ^ edge2;
1313 double fNormSize = faceNorm.Magnitude();
1314 if ( fNormSize <= tol )
1316 // degenerated face: point is out if it is out of all face edges
1317 for ( i = 0; i < nbNodes; ++i )
1319 SMDS_LinearEdge edge( xyz[i]._node, xyz[i+1]._node );
1320 if ( !IsOut( &edge, point, tol ))
1325 faceNorm /= fNormSize;
1327 // check if the point lays on face plane
1328 gp_Vec n2p( xyz[0], point );
1329 double dot = n2p * faceNorm;
1330 if ( Abs( dot ) > tol ) // not on face plane
1333 if ( nbNodes > 3 ) // maybe the face is not planar
1335 double elemThick = 0;
1336 for ( i = 1; i < nbNodes; ++i )
1338 gp_Vec n2n( xyz[0], xyz[i] );
1339 elemThick = Max( elemThick, Abs( n2n * faceNorm ));
1341 isOut = Abs( dot ) > elemThick + tol;
1347 // check if point is out of face boundary:
1348 // define it by closest transition of a ray point->infinity through face boundary
1349 // on the face plane.
1350 // First, find normal of a plane perpendicular to face plane, to be used as a cutting tool
1351 // to find intersections of the ray with the boundary.
1353 gp_Vec plnNorm = ray ^ faceNorm;
1354 double n2pSize = plnNorm.Magnitude();
1355 if ( n2pSize <= tol ) return false; // point coincides with the first node
1356 if ( n2pSize * n2pSize > fNormSize * 100 ) return true; // point is very far
1358 // for each node of the face, compute its signed distance to the cutting plane
1359 std::vector<double> dist( nbNodes + 1);
1360 for ( i = 0; i < nbNodes; ++i )
1362 gp_Vec n2p( xyz[i], point );
1363 dist[i] = n2p * plnNorm;
1365 dist.back() = dist.front();
1366 // find the closest intersection
1368 double rClosest = 0, distClosest = 1e100;
1370 for ( i = 0; i < nbNodes; ++i )
1373 if ( fabs( dist[i] ) < tol )
1375 else if ( fabs( dist[i+1]) < tol )
1377 else if ( dist[i] * dist[i+1] < 0 )
1378 r = dist[i] / ( dist[i] - dist[i+1] );
1380 continue; // no intersection
1381 gp_Pnt pInt = xyz[i] * (1.-r) + xyz[i+1] * r;
1382 gp_Vec p2int( point, pInt);
1383 double intDist = p2int.SquareMagnitude();
1384 if ( intDist < distClosest )
1389 distClosest = intDist;
1393 return true; // no intesections - out
1395 // analyse transition
1396 gp_Vec edge( xyz[iClosest], xyz[iClosest+1] );
1397 gp_Vec edgeNorm = -( edge ^ faceNorm ); // normal to intersected edge pointing out of face
1398 gp_Vec p2int ( point, pClosest );
1399 bool out = (edgeNorm * p2int) < -tol;
1400 if ( rClosest > 0. && rClosest < 1. ) // not node intersection
1403 // the ray passes through a face node; analyze transition through an adjacent edge
1404 gp_Pnt p1 = xyz[ (rClosest == 0.) ? ((iClosest+nbNodes-1) % nbNodes) : (iClosest+1) ];
1405 gp_Pnt p2 = xyz[ (rClosest == 0.) ? iClosest : ((iClosest+2) % nbNodes) ];
1406 gp_Vec edgeAdjacent( p1, p2 );
1407 gp_Vec edgeNorm2 = -( edgeAdjacent ^ faceNorm );
1408 bool out2 = (edgeNorm2 * p2int) < -tol;
1410 bool covexCorner = ( edgeNorm * edgeAdjacent * (rClosest==1. ? 1. : -1.)) < 0;
1411 return covexCorner ? (out || out2) : (out && out2);
1414 if ( element->GetType() == SMDSAbs_Edge ) // --------------------------------------------------
1416 // point is out of edge if it is NOT ON any straight part of edge
1417 // (we consider quadratic edge as being composed of two straight parts)
1418 for ( i = 1; i < nbNodes; ++i )
1420 gp_Vec edge( xyz[i-1], xyz[i] );
1421 gp_Vec n1p ( xyz[i-1], point );
1422 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1424 if ( n1p.SquareMagnitude() < tol * tol )
1429 if ( point.SquareDistance( xyz[i] ) < tol * tol )
1433 gp_XYZ proj = ( 1. - u ) * xyz[i-1] + u * xyz[i]; // projection of the point on the edge
1434 double dist2 = point.SquareDistance( proj );
1435 if ( dist2 > tol * tol )
1437 return false; // point is ON this part
1442 // Node or 0D element -------------------------------------------------------------------------
1444 gp_Vec n2p ( xyz[0], point );
1445 return n2p.SquareMagnitude() > tol * tol;
1450 //=======================================================================
1453 // Position of a point relative to a segment
1457 // VERTEX 1 o----ON-----> VERTEX 2
1461 enum PositionName { POS_LEFT = 1, POS_VERTEX = 2, POS_RIGHT = 4, //POS_ON = 8,
1462 POS_ALL = POS_LEFT | POS_RIGHT | POS_VERTEX };
1466 int _index; // index of vertex or segment
1468 PointPos( PositionName n, int i=-1 ): _name(n), _index(i) {}
1469 bool operator < (const PointPos& other ) const
1471 if ( _name == other._name )
1472 return ( _index < 0 || other._index < 0 ) ? false : _index < other._index;
1473 return _name < other._name;
1477 //================================================================================
1479 * \brief Return of a point relative to a segment
1480 * \param point2D - the point to analyze position of
1481 * \param xyVec - end points of segments
1482 * \param index0 - 0-based index of the first point of segment
1483 * \param posToFindOut - flags of positions to detect
1484 * \retval PointPos - point position
1486 //================================================================================
1488 PointPos getPointPosition( const gp_XY& point2D,
1489 const gp_XY* segEnds,
1490 const int index0 = 0,
1491 const int posToFindOut = POS_ALL)
1493 const gp_XY& p1 = segEnds[ index0 ];
1494 const gp_XY& p2 = segEnds[ index0+1 ];
1495 const gp_XY grad = p2 - p1;
1497 if ( posToFindOut & POS_VERTEX )
1499 // check if the point2D is at "vertex 1" zone
1500 gp_XY pp1[2] = { p1, gp_XY( p1.X() - grad.Y(),
1501 p1.Y() + grad.X() ) };
1502 if ( getPointPosition( point2D, pp1, 0, POS_LEFT|POS_RIGHT )._name == POS_LEFT )
1503 return PointPos( POS_VERTEX, index0 );
1505 // check if the point2D is at "vertex 2" zone
1506 gp_XY pp2[2] = { p2, gp_XY( p2.X() - grad.Y(),
1507 p2.Y() + grad.X() ) };
1508 if ( getPointPosition( point2D, pp2, 0, POS_LEFT|POS_RIGHT )._name == POS_RIGHT )
1509 return PointPos( POS_VERTEX, index0 + 1);
1511 double edgeEquation =
1512 ( point2D.X() - p1.X() ) * grad.Y() - ( point2D.Y() - p1.Y() ) * grad.X();
1513 return PointPos( edgeEquation < 0 ? POS_LEFT : POS_RIGHT, index0 );
1517 //=======================================================================
1519 * \brief Return minimal distance from a point to an element
1521 * Currently we ignore non-planarity and 2nd order of face
1523 //=======================================================================
1525 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshElement* elem,
1526 const gp_Pnt& point,
1527 gp_XYZ* closestPnt )
1529 switch ( elem->GetType() )
1531 case SMDSAbs_Volume:
1532 return GetDistance( static_cast<const SMDS_MeshVolume*>( elem ), point, closestPnt );
1534 return GetDistance( static_cast<const SMDS_MeshFace*>( elem ), point, closestPnt );
1536 return GetDistance( static_cast<const SMDS_MeshEdge*>( elem ), point, closestPnt );
1538 if ( closestPnt ) *closestPnt = SMESH_TNodeXYZ( elem );
1539 return point.Distance( SMESH_TNodeXYZ( elem ));
1545 //=======================================================================
1547 * \brief Return minimal distance from a point to a face
1549 * Currently we ignore non-planarity and 2nd order of face
1551 //=======================================================================
1553 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshFace* face,
1554 const gp_Pnt& point,
1555 gp_XYZ* closestPnt )
1557 const double badDistance = -1;
1558 if ( !face ) return badDistance;
1560 // coordinates of nodes (medium nodes, if any, ignored)
1561 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
1562 std::vector<gp_XYZ> xyz( TXyzIterator( face->nodesIterator()), TXyzIterator() );
1563 xyz.resize( face->NbCornerNodes()+1 );
1565 // transformation to get xyz[0] lies on the origin, xyz[1] lies on the Z axis,
1566 // and xyz[2] lies in the XZ plane. This is to pass to 2D space on XZ plane.
1568 gp_Vec OZ ( xyz[0], xyz[1] );
1569 gp_Vec OX ( xyz[0], xyz[2] );
1570 if ( OZ.Magnitude() < std::numeric_limits<double>::min() )
1572 if ( xyz.size() < 4 ) return badDistance;
1573 OZ = gp_Vec ( xyz[0], xyz[2] );
1574 OX = gp_Vec ( xyz[0], xyz[3] );
1578 tgtCS = gp_Ax3( xyz[0], OZ, OX );
1580 catch ( Standard_Failure ) {
1583 trsf.SetTransformation( tgtCS );
1585 // move all the nodes to 2D
1586 std::vector<gp_XY> xy( xyz.size() );
1587 for ( size_t i = 0;i < xyz.size()-1; ++i )
1589 gp_XYZ p3d = xyz[i];
1590 trsf.Transforms( p3d );
1591 xy[i].SetCoord( p3d.X(), p3d.Z() );
1593 xyz.back() = xyz.front();
1594 xy.back() = xy.front();
1596 // // move the point in 2D
1597 gp_XYZ tmpPnt = point.XYZ();
1598 trsf.Transforms( tmpPnt );
1599 gp_XY point2D( tmpPnt.X(), tmpPnt.Z() );
1601 // loop on edges of the face to analyze point position ralative to the face
1602 std::set< PointPos > pntPosSet;
1603 for ( size_t i = 1; i < xy.size(); ++i )
1605 PointPos pos = getPointPosition( point2D, &xy[0], i-1 );
1606 pntPosSet.insert( pos );
1610 PointPos pos = *pntPosSet.begin();
1611 switch ( pos._name )
1615 // point is most close to an edge
1616 gp_Vec edge( xyz[ pos._index ], xyz[ pos._index+1 ]);
1617 gp_Vec n1p ( xyz[ pos._index ], point );
1618 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1619 // projection of the point on the edge
1620 gp_XYZ proj = xyz[ pos._index ] + u * edge.XYZ();
1621 if ( closestPnt ) *closestPnt = proj;
1622 return point.Distance( proj );
1626 // point is inside the face
1627 double distToFacePlane = Abs( tmpPnt.Y() );
1630 if ( distToFacePlane < std::numeric_limits<double>::min() ) {
1631 *closestPnt = point.XYZ();
1635 trsf.Inverted().Transforms( tmpPnt );
1636 *closestPnt = tmpPnt;
1639 return distToFacePlane;
1643 // point is most close to a node
1644 gp_Vec distVec( point, xyz[ pos._index ]);
1645 return distVec.Magnitude();
1652 //=======================================================================
1654 * \brief Return minimal distance from a point to an edge
1656 //=======================================================================
1658 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshEdge* seg,
1659 const gp_Pnt& point,
1660 gp_XYZ* closestPnt )
1662 double dist = Precision::Infinite();
1663 if ( !seg ) return dist;
1665 int i = 0, nbNodes = seg->NbNodes();
1667 std::vector< SMESH_TNodeXYZ > xyz( nbNodes );
1668 for ( SMDS_NodeIteratorPtr nodeIt = seg->interlacedNodesIterator(); nodeIt->more(); i++ )
1669 xyz[ i ].Set( nodeIt->next() );
1671 for ( i = 1; i < nbNodes; ++i )
1673 gp_Vec edge( xyz[i-1], xyz[i] );
1674 gp_Vec n1p ( xyz[i-1], point );
1675 double d, u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1677 if (( d = n1p.SquareMagnitude() ) < dist ) {
1679 if ( closestPnt ) *closestPnt = xyz[i-1];
1682 else if ( u >= 1. ) {
1683 if (( d = point.SquareDistance( xyz[i] )) < dist ) {
1685 if ( closestPnt ) *closestPnt = xyz[i];
1689 gp_XYZ proj = xyz[i-1] + u * edge.XYZ(); // projection of the point on the edge
1690 if (( d = point.SquareDistance( proj )) < dist ) {
1692 if ( closestPnt ) *closestPnt = proj;
1696 return Sqrt( dist );
1699 //=======================================================================
1701 * \brief Return minimal distance from a point to a volume
1703 * Currently we ignore non-planarity and 2nd order
1705 //=======================================================================
1707 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshVolume* volume,
1708 const gp_Pnt& point,
1709 gp_XYZ* closestPnt )
1711 SMDS_VolumeTool vTool( volume );
1712 vTool.SetExternalNormal();
1713 const int iQ = volume->IsQuadratic() ? 2 : 1;
1716 double minDist = 1e100, dist;
1717 gp_XYZ closeP = point.XYZ();
1719 for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
1721 // skip a facet with normal not "looking at" the point
1722 if ( !vTool.GetFaceNormal( iF, n[0], n[1], n[2] ) ||
1723 !vTool.GetFaceBaryCenter( iF, bc[0], bc[1], bc[2] ))
1725 gp_XYZ bcp = point.XYZ() - gp_XYZ( bc[0], bc[1], bc[2] );
1726 if ( gp_XYZ( n[0], n[1], n[2] ) * bcp < 1e-6 )
1729 // find distance to a facet
1730 const SMDS_MeshNode** nodes = vTool.GetFaceNodes( iF );
1731 switch ( vTool.NbFaceNodes( iF ) / iQ ) {
1734 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ] );
1735 dist = GetDistance( &tmpFace, point, closestPnt );
1740 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ], nodes[ 3*iQ ]);
1741 dist = GetDistance( &tmpFace, point, closestPnt );
1745 std::vector<const SMDS_MeshNode *> nvec( nodes, nodes + vTool.NbFaceNodes( iF ));
1746 SMDS_PolygonalFaceOfNodes tmpFace( nvec );
1747 dist = GetDistance( &tmpFace, point, closestPnt );
1749 if ( dist < minDist )
1753 if ( closestPnt ) closeP = *closestPnt;
1758 if ( closestPnt ) *closestPnt = closeP;
1762 return 0; // point is inside the volume
1765 //================================================================================
1767 * \brief Returns barycentric coordinates of a point within a triangle.
1768 * A not returned bc2 = 1. - bc0 - bc1.
1769 * The point lies within the triangle if ( bc0 >= 0 && bc1 >= 0 && bc0+bc1 <= 1 )
1771 //================================================================================
1773 void SMESH_MeshAlgos::GetBarycentricCoords( const gp_XY& p,
1780 const double // matrix 2x2
1781 T11 = t0.X()-t2.X(), T12 = t1.X()-t2.X(),
1782 T21 = t0.Y()-t2.Y(), T22 = t1.Y()-t2.Y();
1783 const double Tdet = T11*T22 - T12*T21; // matrix determinant
1784 if ( Abs( Tdet ) < std::numeric_limits<double>::min() )
1790 const double t11 = T22, t12 = -T12, t21 = -T21, t22 = T11;
1792 const double r11 = p.X()-t2.X(), r12 = p.Y()-t2.Y();
1793 // barycentric coordinates: multiply matrix by vector
1794 bc0 = (t11 * r11 + t12 * r12)/Tdet;
1795 bc1 = (t21 * r11 + t22 * r12)/Tdet;
1798 //=======================================================================
1799 //function : FindFaceInSet
1800 //purpose : Return a face having linked nodes n1 and n2 and which is
1801 // - not in avoidSet,
1802 // - in elemSet provided that !elemSet.empty()
1803 // i1 and i2 optionally returns indices of n1 and n2
1804 //=======================================================================
1806 const SMDS_MeshElement*
1807 SMESH_MeshAlgos::FindFaceInSet(const SMDS_MeshNode* n1,
1808 const SMDS_MeshNode* n2,
1809 const TIDSortedElemSet& elemSet,
1810 const TIDSortedElemSet& avoidSet,
1816 const SMDS_MeshElement* face = 0;
1818 SMDS_ElemIteratorPtr invElemIt = n1->GetInverseElementIterator(SMDSAbs_Face);
1819 while ( invElemIt->more() && !face ) // loop on inverse faces of n1
1821 const SMDS_MeshElement* elem = invElemIt->next();
1822 if (avoidSet.count( elem ))
1824 if ( !elemSet.empty() && !elemSet.count( elem ))
1827 i1 = elem->GetNodeIndex( n1 );
1828 // find a n2 linked to n1
1829 int nbN = elem->IsQuadratic() ? elem->NbNodes()/2 : elem->NbNodes();
1830 for ( int di = -1; di < 2 && !face; di += 2 )
1832 i2 = (i1+di+nbN) % nbN;
1833 if ( elem->GetNode( i2 ) == n2 )
1836 if ( !face && elem->IsQuadratic())
1838 // analysis for quadratic elements using all nodes
1839 SMDS_NodeIteratorPtr anIter = elem->interlacedNodesIterator();
1840 const SMDS_MeshNode* prevN = static_cast<const SMDS_MeshNode*>( anIter->next() );
1841 for ( i1 = -1, i2 = 0; anIter->more() && !face; i1++, i2++ )
1843 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( anIter->next() );
1844 if ( n1 == prevN && n2 == n )
1848 else if ( n2 == prevN && n1 == n )
1850 face = elem; std::swap( i1, i2 );
1856 if ( n1ind ) *n1ind = i1;
1857 if ( n2ind ) *n2ind = i2;
1861 //================================================================================
1863 * \brief Calculate normal of a mesh face
1865 //================================================================================
1867 bool SMESH_MeshAlgos::FaceNormal(const SMDS_MeshElement* F, gp_XYZ& normal, bool normalized)
1869 if ( !F || F->GetType() != SMDSAbs_Face )
1872 normal.SetCoord(0,0,0);
1873 int nbNodes = F->NbCornerNodes();
1874 for ( int i = 0; i < nbNodes-2; ++i )
1877 for ( int n = 0; n < 3; ++n )
1879 const SMDS_MeshNode* node = F->GetNode( i + n );
1880 p[n].SetCoord( node->X(), node->Y(), node->Z() );
1882 normal += ( p[2] - p[1] ) ^ ( p[0] - p[1] );
1884 double size2 = normal.SquareModulus();
1885 bool ok = ( size2 > std::numeric_limits<double>::min() * std::numeric_limits<double>::min());
1886 if ( normalized && ok )
1887 normal /= sqrt( size2 );
1892 //=======================================================================
1893 //function : GetCommonNodes
1894 //purpose : Return nodes common to two elements
1895 //=======================================================================
1897 std::vector< const SMDS_MeshNode*> SMESH_MeshAlgos::GetCommonNodes(const SMDS_MeshElement* e1,
1898 const SMDS_MeshElement* e2)
1900 std::vector< const SMDS_MeshNode*> common;
1901 for ( int i = 0 ; i < e1->NbNodes(); ++i )
1902 if ( e2->GetNodeIndex( e1->GetNode( i )) >= 0 )
1903 common.push_back( e1->GetNode( i ));
1906 //================================================================================
1908 * \brief Return true if node1 encounters first in the face and node2, after
1910 //================================================================================
1912 bool SMESH_MeshAlgos::IsRightOrder( const SMDS_MeshElement* face,
1913 const SMDS_MeshNode* node0,
1914 const SMDS_MeshNode* node1 )
1916 int i0 = face->GetNodeIndex( node0 );
1917 int i1 = face->GetNodeIndex( node1 );
1918 if ( face->IsQuadratic() )
1920 if ( face->IsMediumNode( node0 ))
1922 i0 -= ( face->NbNodes()/2 - 1 );
1927 i1 -= ( face->NbNodes()/2 - 1 );
1932 return ( diff == 1 ) || ( diff == -face->NbNodes()+1 );
1935 //=======================================================================
1937 * \brief Return SMESH_NodeSearcher
1939 //=======================================================================
1941 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_Mesh& mesh)
1943 return new SMESH_NodeSearcherImpl( &mesh );
1946 //=======================================================================
1948 * \brief Return SMESH_NodeSearcher
1950 //=======================================================================
1952 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_ElemIteratorPtr elemIt)
1954 return new SMESH_NodeSearcherImpl( 0, elemIt );
1957 //=======================================================================
1959 * \brief Return SMESH_ElementSearcher
1961 //=======================================================================
1963 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
1966 return new SMESH_ElementSearcherImpl( mesh, tolerance );
1969 //=======================================================================
1971 * \brief Return SMESH_ElementSearcher acting on a sub-set of elements
1973 //=======================================================================
1975 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
1976 SMDS_ElemIteratorPtr elemIt,
1979 return new SMESH_ElementSearcherImpl( mesh, tolerance, elemIt );