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 "SMDS_FaceOfNodes.hxx"
32 #include "SMDS_LinearEdge.hxx"
33 #include "SMDS_Mesh.hxx"
34 #include "SMDS_PolygonalFaceOfNodes.hxx"
35 #include "SMDS_VolumeTool.hxx"
36 #include "SMESH_OctreeNode.hxx"
38 #include <GC_MakeSegment.hxx>
39 #include <GeomAPI_ExtremaCurveCurve.hxx>
40 #include <Geom_Line.hxx>
41 #include <IntAna_IntConicQuad.hxx>
42 #include <IntAna_Quadric.hxx>
51 //=======================================================================
53 * \brief Implementation of search for the node closest to point
55 //=======================================================================
57 struct SMESH_NodeSearcherImpl: public SMESH_NodeSearcher
59 //---------------------------------------------------------------------
63 SMESH_NodeSearcherImpl( const SMDS_Mesh* theMesh = 0,
64 SMDS_ElemIteratorPtr theElemIt = SMDS_ElemIteratorPtr() )
66 myMesh = ( SMDS_Mesh* ) theMesh;
68 TIDSortedNodeSet nodes;
70 SMDS_NodeIteratorPtr nIt = theMesh->nodesIterator(/*idInceasingOrder=*/true);
72 nodes.insert( nodes.end(), nIt->next() );
76 while ( theElemIt->more() )
78 const SMDS_MeshElement* e = theElemIt->next();
79 nodes.insert( e->begin_nodes(), e->end_nodes() );
82 myOctreeNode = new SMESH_OctreeNode(nodes) ;
84 // get max size of a leaf box
85 SMESH_OctreeNode* tree = myOctreeNode;
86 while ( !tree->isLeaf() )
88 SMESH_OctreeNodeIteratorPtr cIt = tree->GetChildrenIterator();
92 myHalfLeafSize = tree->maxSize() / 2.;
95 //---------------------------------------------------------------------
97 * \brief Move node and update myOctreeNode accordingly
99 void MoveNode( const SMDS_MeshNode* node, const gp_Pnt& toPnt )
101 myOctreeNode->UpdateByMoveNode( node, toPnt );
102 myMesh->MoveNode( node, toPnt.X(), toPnt.Y(), toPnt.Z() );
105 //---------------------------------------------------------------------
109 const SMDS_MeshNode* FindClosestTo( const gp_Pnt& thePnt )
111 map<double, const SMDS_MeshNode*> dist2Nodes;
112 myOctreeNode->NodesAround( thePnt.Coord(), dist2Nodes, myHalfLeafSize );
113 if ( !dist2Nodes.empty() )
114 return dist2Nodes.begin()->second;
115 list<const SMDS_MeshNode*> nodes;
116 //myOctreeNode->NodesAround( &tgtNode, &nodes, myHalfLeafSize );
118 double minSqDist = DBL_MAX;
119 if ( nodes.empty() ) // get all nodes of OctreeNode's closest to thePnt
121 // sort leafs by their distance from thePnt
122 typedef map< double, SMESH_OctreeNode* > TDistTreeMap;
123 TDistTreeMap treeMap;
124 list< SMESH_OctreeNode* > treeList;
125 list< SMESH_OctreeNode* >::iterator trIt;
126 treeList.push_back( myOctreeNode );
128 gp_XYZ pointNode( thePnt.X(), thePnt.Y(), thePnt.Z() );
129 bool pointInside = myOctreeNode->isInside( pointNode, myHalfLeafSize );
130 for ( trIt = treeList.begin(); trIt != treeList.end(); ++trIt)
132 SMESH_OctreeNode* tree = *trIt;
133 if ( !tree->isLeaf() ) // put children to the queue
135 if ( pointInside && !tree->isInside( pointNode, myHalfLeafSize )) continue;
136 SMESH_OctreeNodeIteratorPtr cIt = tree->GetChildrenIterator();
137 while ( cIt->more() )
138 treeList.push_back( cIt->next() );
140 else if ( tree->NbNodes() ) // put a tree to the treeMap
142 const Bnd_B3d& box = *tree->getBox();
143 double sqDist = thePnt.SquareDistance( 0.5 * ( box.CornerMin() + box.CornerMax() ));
144 pair<TDistTreeMap::iterator,bool> it_in = treeMap.insert( make_pair( sqDist, tree ));
145 if ( !it_in.second ) // not unique distance to box center
146 treeMap.insert( it_in.first, make_pair( sqDist + 1e-13*treeMap.size(), tree ));
149 // find distance after which there is no sense to check tree's
150 double sqLimit = DBL_MAX;
151 TDistTreeMap::iterator sqDist_tree = treeMap.begin();
152 if ( treeMap.size() > 5 ) {
153 SMESH_OctreeNode* closestTree = sqDist_tree->second;
154 const Bnd_B3d& box = *closestTree->getBox();
155 double limit = sqrt( sqDist_tree->first ) + sqrt ( box.SquareExtent() );
156 sqLimit = limit * limit;
158 // get all nodes from trees
159 for ( ; sqDist_tree != treeMap.end(); ++sqDist_tree) {
160 if ( sqDist_tree->first > sqLimit )
162 SMESH_OctreeNode* tree = sqDist_tree->second;
163 tree->NodesAround( tree->GetNodeIterator()->next(), &nodes );
166 // find closest among nodes
168 const SMDS_MeshNode* closestNode = 0;
169 list<const SMDS_MeshNode*>::iterator nIt = nodes.begin();
170 for ( ; nIt != nodes.end(); ++nIt ) {
171 double sqDist = thePnt.SquareDistance( SMESH_TNodeXYZ( *nIt ) );
172 if ( minSqDist > sqDist ) {
180 //---------------------------------------------------------------------
182 * \brief Finds nodes located within a tolerance near a point
184 int FindNearPoint(const gp_Pnt& point,
185 const double tolerance,
186 std::vector< const SMDS_MeshNode* >& foundNodes)
188 myOctreeNode->NodesAround( point.Coord(), foundNodes, tolerance );
189 return foundNodes.size();
192 //---------------------------------------------------------------------
196 ~SMESH_NodeSearcherImpl() { delete myOctreeNode; }
198 //---------------------------------------------------------------------
200 * \brief Return the node tree
202 const SMESH_OctreeNode* getTree() const { return myOctreeNode; }
205 SMESH_OctreeNode* myOctreeNode;
207 double myHalfLeafSize; // max size of a leaf box
210 // ========================================================================
211 namespace // Utils used in SMESH_ElementSearcherImpl::FindElementsByPoint()
213 const int MaxNbElemsInLeaf = 10; // maximal number of elements in a leaf of tree
214 const int MaxLevel = 7; // maximal tree height -> nb terminal boxes: 8^7 = 2097152
215 const double NodeRadius = 1e-9; // to enlarge bnd box of element
217 //=======================================================================
219 * \brief Octal tree of bounding boxes of elements
221 //=======================================================================
223 class ElementBndBoxTree : public SMESH_Octree
227 ElementBndBoxTree(const SMDS_Mesh& mesh,
228 SMDSAbs_ElementType elemType,
229 SMDS_ElemIteratorPtr theElemIt = SMDS_ElemIteratorPtr(),
230 double tolerance = NodeRadius );
231 void getElementsNearPoint( const gp_Pnt& point, TIDSortedElemSet& foundElems );
232 void getElementsNearLine ( const gp_Ax1& line, TIDSortedElemSet& foundElems);
233 void getElementsInSphere ( const gp_XYZ& center,
234 const double radius, TIDSortedElemSet& foundElems);
235 size_t getSize() { return std::max( _size, _elements.size() ); }
236 virtual ~ElementBndBoxTree();
239 ElementBndBoxTree():_size(0) {}
240 SMESH_Octree* newChild() const { return new ElementBndBoxTree; }
241 void buildChildrenData();
242 Bnd_B3d* buildRootBox();
244 //!< Bounding box of element
245 struct ElementBox : public Bnd_B3d
247 const SMDS_MeshElement* _element;
248 int _refCount; // an ElementBox can be included in several tree branches
249 ElementBox(const SMDS_MeshElement* elem, double tolerance);
251 vector< ElementBox* > _elements;
255 //================================================================================
257 * \brief ElementBndBoxTree creation
259 //================================================================================
261 ElementBndBoxTree::ElementBndBoxTree(const SMDS_Mesh& mesh, SMDSAbs_ElementType elemType, SMDS_ElemIteratorPtr theElemIt, double tolerance)
262 :SMESH_Octree( new SMESH_TreeLimit( MaxLevel, /*minSize=*/0. ))
264 int nbElems = mesh.GetMeshInfo().NbElements( elemType );
265 _elements.reserve( nbElems );
267 SMDS_ElemIteratorPtr elemIt = theElemIt ? theElemIt : mesh.elementsIterator( elemType );
268 while ( elemIt->more() )
269 _elements.push_back( new ElementBox( elemIt->next(),tolerance ));
274 //================================================================================
278 //================================================================================
280 ElementBndBoxTree::~ElementBndBoxTree()
282 for ( size_t i = 0; i < _elements.size(); ++i )
283 if ( --_elements[i]->_refCount <= 0 )
287 //================================================================================
289 * \brief Return the maximal box
291 //================================================================================
293 Bnd_B3d* ElementBndBoxTree::buildRootBox()
295 Bnd_B3d* box = new Bnd_B3d;
296 for ( size_t i = 0; i < _elements.size(); ++i )
297 box->Add( *_elements[i] );
301 //================================================================================
303 * \brief Redistrubute element boxes among children
305 //================================================================================
307 void ElementBndBoxTree::buildChildrenData()
309 for ( size_t i = 0; i < _elements.size(); ++i )
311 for (int j = 0; j < 8; j++)
313 if ( !_elements[i]->IsOut( *myChildren[j]->getBox() ))
315 _elements[i]->_refCount++;
316 ((ElementBndBoxTree*)myChildren[j])->_elements.push_back( _elements[i]);
319 _elements[i]->_refCount--;
321 _size = _elements.size();
322 SMESHUtils::FreeVector( _elements ); // = _elements.clear() + free memory
324 for (int j = 0; j < 8; j++)
326 ElementBndBoxTree* child = static_cast<ElementBndBoxTree*>( myChildren[j]);
327 if ((int) child->_elements.size() <= MaxNbElemsInLeaf )
328 child->myIsLeaf = true;
330 if ( child->_elements.capacity() - child->_elements.size() > 1000 )
331 SMESHUtils::CompactVector( child->_elements );
335 //================================================================================
337 * \brief Return elements which can include the point
339 //================================================================================
341 void ElementBndBoxTree::getElementsNearPoint( const gp_Pnt& point,
342 TIDSortedElemSet& foundElems)
344 if ( getBox()->IsOut( point.XYZ() ))
349 for ( size_t i = 0; i < _elements.size(); ++i )
350 if ( !_elements[i]->IsOut( point.XYZ() ))
351 foundElems.insert( _elements[i]->_element );
355 for (int i = 0; i < 8; i++)
356 ((ElementBndBoxTree*) myChildren[i])->getElementsNearPoint( point, foundElems );
360 //================================================================================
362 * \brief Return elements which can be intersected by the line
364 //================================================================================
366 void ElementBndBoxTree::getElementsNearLine( const gp_Ax1& line,
367 TIDSortedElemSet& foundElems)
369 if ( getBox()->IsOut( line ))
374 for ( size_t i = 0; i < _elements.size(); ++i )
375 if ( !_elements[i]->IsOut( line ))
376 foundElems.insert( _elements[i]->_element );
380 for (int i = 0; i < 8; i++)
381 ((ElementBndBoxTree*) myChildren[i])->getElementsNearLine( line, foundElems );
385 //================================================================================
387 * \brief Return elements from leaves intersecting the sphere
389 //================================================================================
391 void ElementBndBoxTree::getElementsInSphere ( const gp_XYZ& center,
393 TIDSortedElemSet& foundElems)
395 if ( getBox()->IsOut( center, radius ))
400 for ( size_t i = 0; i < _elements.size(); ++i )
401 if ( !_elements[i]->IsOut( center, radius ))
402 foundElems.insert( _elements[i]->_element );
406 for (int i = 0; i < 8; i++)
407 ((ElementBndBoxTree*) myChildren[i])->getElementsInSphere( center, radius, foundElems );
411 //================================================================================
413 * \brief Construct the element box
415 //================================================================================
417 ElementBndBoxTree::ElementBox::ElementBox(const SMDS_MeshElement* elem, double tolerance)
421 SMDS_ElemIteratorPtr nIt = elem->nodesIterator();
422 while ( nIt->more() )
423 Add( SMESH_TNodeXYZ( nIt->next() ));
424 Enlarge( tolerance );
429 //=======================================================================
431 * \brief Implementation of search for the elements by point and
432 * of classification of point in 2D mesh
434 //=======================================================================
436 SMESH_ElementSearcher::~SMESH_ElementSearcher()
440 struct SMESH_ElementSearcherImpl: public SMESH_ElementSearcher
443 SMDS_ElemIteratorPtr _meshPartIt;
444 ElementBndBoxTree* _ebbTree;
446 SMESH_NodeSearcherImpl* _nodeSearcher;
447 SMDSAbs_ElementType _elementType;
449 bool _outerFacesFound;
450 set<const SMDS_MeshElement*> _outerFaces; // empty means "no internal faces at all"
452 SMESH_ElementSearcherImpl( SMDS_Mesh& mesh,
454 SMDS_ElemIteratorPtr elemIt=SMDS_ElemIteratorPtr())
455 : _mesh(&mesh),_meshPartIt(elemIt),_ebbTree(0),_ebbTreeHeight(-1),_nodeSearcher(0),_tolerance(tol),_outerFacesFound(false) {}
456 virtual ~SMESH_ElementSearcherImpl()
458 if ( _ebbTree ) delete _ebbTree; _ebbTree = 0;
459 if ( _nodeSearcher ) delete _nodeSearcher; _nodeSearcher = 0;
461 virtual int FindElementsByPoint(const gp_Pnt& point,
462 SMDSAbs_ElementType type,
463 vector< const SMDS_MeshElement* >& foundElements);
464 virtual TopAbs_State GetPointState(const gp_Pnt& point);
465 virtual const SMDS_MeshElement* FindClosestTo( const gp_Pnt& point,
466 SMDSAbs_ElementType type );
468 void GetElementsNearLine( const gp_Ax1& line,
469 SMDSAbs_ElementType type,
470 vector< const SMDS_MeshElement* >& foundElems);
471 void GetElementsInSphere( const gp_XYZ& center,
473 SMDSAbs_ElementType type,
474 vector< const SMDS_MeshElement* >& foundElems);
475 double getTolerance();
476 bool getIntersParamOnLine(const gp_Lin& line, const SMDS_MeshElement* face,
477 const double tolerance, double & param);
478 void findOuterBoundary(const SMDS_MeshElement* anyOuterFace);
479 bool isOuterBoundary(const SMDS_MeshElement* face) const
481 return _outerFaces.empty() || _outerFaces.count(face);
485 if ( _ebbTreeHeight < 0 )
486 _ebbTreeHeight = _ebbTree->getHeight();
487 return _ebbTreeHeight;
490 struct TInters //!< data of intersection of the line and the mesh face (used in GetPointState())
492 const SMDS_MeshElement* _face;
494 bool _coincides; //!< the line lays in face plane
495 TInters(const SMDS_MeshElement* face, const gp_Vec& faceNorm, bool coinc=false)
496 : _face(face), _faceNorm( faceNorm ), _coincides( coinc ) {}
498 struct TFaceLink //!< link and faces sharing it (used in findOuterBoundary())
501 TIDSortedElemSet _faces;
502 TFaceLink( const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshElement* face)
503 : _link( n1, n2 ), _faces( &face, &face + 1) {}
507 ostream& operator<< (ostream& out, const SMESH_ElementSearcherImpl::TInters& i)
509 return out << "TInters(face=" << ( i._face ? i._face->GetID() : 0)
510 << ", _coincides="<<i._coincides << ")";
513 //=======================================================================
515 * \brief define tolerance for search
517 //=======================================================================
519 double SMESH_ElementSearcherImpl::getTolerance()
521 if ( _tolerance < 0 )
523 const SMDS_MeshInfo& meshInfo = _mesh->GetMeshInfo();
526 if ( _nodeSearcher && meshInfo.NbNodes() > 1 )
528 double boxSize = _nodeSearcher->getTree()->maxSize();
529 _tolerance = 1e-8 * boxSize/* / meshInfo.NbNodes()*/;
531 else if ( _ebbTree && meshInfo.NbElements() > 0 )
533 double boxSize = _ebbTree->maxSize();
534 _tolerance = 1e-8 * boxSize/* / meshInfo.NbElements()*/;
536 if ( _tolerance == 0 )
538 // define tolerance by size of a most complex element
539 int complexType = SMDSAbs_Volume;
540 while ( complexType > SMDSAbs_All &&
541 meshInfo.NbElements( SMDSAbs_ElementType( complexType )) < 1 )
543 if ( complexType == SMDSAbs_All ) return 0; // empty mesh
545 if ( complexType == int( SMDSAbs_Node ))
547 SMDS_NodeIteratorPtr nodeIt = _mesh->nodesIterator();
549 if ( meshInfo.NbNodes() > 2 )
550 elemSize = SMESH_TNodeXYZ( nodeIt->next() ).Distance( nodeIt->next() );
554 SMDS_ElemIteratorPtr elemIt =
555 _mesh->elementsIterator( SMDSAbs_ElementType( complexType ));
556 const SMDS_MeshElement* elem = elemIt->next();
557 SMDS_ElemIteratorPtr nodeIt = elem->nodesIterator();
558 SMESH_TNodeXYZ n1( nodeIt->next() );
560 while ( nodeIt->more() )
562 double dist = n1.Distance( static_cast<const SMDS_MeshNode*>( nodeIt->next() ));
563 elemSize = max( dist, elemSize );
566 _tolerance = 1e-4 * elemSize;
572 //================================================================================
574 * \brief Find intersection of the line and an edge of face and return parameter on line
576 //================================================================================
578 bool SMESH_ElementSearcherImpl::getIntersParamOnLine(const gp_Lin& line,
579 const SMDS_MeshElement* face,
586 GeomAPI_ExtremaCurveCurve anExtCC;
587 Handle(Geom_Curve) lineCurve = new Geom_Line( line );
589 int nbNodes = face->IsQuadratic() ? face->NbNodes()/2 : face->NbNodes();
590 for ( int i = 0; i < nbNodes && nbInts < 2; ++i )
592 GC_MakeSegment edge( SMESH_TNodeXYZ( face->GetNode( i )),
593 SMESH_TNodeXYZ( face->GetNode( (i+1)%nbNodes) ));
594 anExtCC.Init( lineCurve, edge.Value() );
595 if ( anExtCC.NbExtrema() > 0 && anExtCC.LowerDistance() <= tol)
597 Quantity_Parameter pl, pe;
598 anExtCC.LowerDistanceParameters( pl, pe );
604 if ( nbInts > 0 ) param /= nbInts;
607 //================================================================================
609 * \brief Find all faces belonging to the outer boundary of mesh
611 //================================================================================
613 void SMESH_ElementSearcherImpl::findOuterBoundary(const SMDS_MeshElement* outerFace)
615 if ( _outerFacesFound ) return;
617 // Collect all outer faces by passing from one outer face to another via their links
618 // and BTW find out if there are internal faces at all.
620 // checked links and links where outer boundary meets internal one
621 set< SMESH_TLink > visitedLinks, seamLinks;
623 // links to treat with already visited faces sharing them
624 list < TFaceLink > startLinks;
626 // load startLinks with the first outerFace
627 startLinks.push_back( TFaceLink( outerFace->GetNode(0), outerFace->GetNode(1), outerFace));
628 _outerFaces.insert( outerFace );
630 TIDSortedElemSet emptySet;
631 while ( !startLinks.empty() )
633 const SMESH_TLink& link = startLinks.front()._link;
634 TIDSortedElemSet& faces = startLinks.front()._faces;
636 outerFace = *faces.begin();
637 // find other faces sharing the link
638 const SMDS_MeshElement* f;
639 while (( f = SMESH_MeshAlgos::FindFaceInSet(link.node1(), link.node2(), emptySet, faces )))
642 // select another outer face among the found
643 const SMDS_MeshElement* outerFace2 = 0;
644 if ( faces.size() == 2 )
646 outerFace2 = (outerFace == *faces.begin() ? *faces.rbegin() : *faces.begin());
648 else if ( faces.size() > 2 )
650 seamLinks.insert( link );
652 // link direction within the outerFace
653 gp_Vec n1n2( SMESH_TNodeXYZ( link.node1()),
654 SMESH_TNodeXYZ( link.node2()));
655 int i1 = outerFace->GetNodeIndex( link.node1() );
656 int i2 = outerFace->GetNodeIndex( link.node2() );
657 bool rev = ( abs(i2-i1) == 1 ? i1 > i2 : i2 > i1 );
658 if ( rev ) n1n2.Reverse();
660 gp_XYZ ofNorm, fNorm;
661 if ( SMESH_MeshAlgos::FaceNormal( outerFace, ofNorm, /*normalized=*/false ))
663 // direction from the link inside outerFace
664 gp_Vec dirInOF = gp_Vec( ofNorm ) ^ n1n2;
665 // sort all other faces by angle with the dirInOF
666 map< double, const SMDS_MeshElement* > angle2Face;
667 set< const SMDS_MeshElement*, TIDCompare >::const_iterator face = faces.begin();
668 for ( ; face != faces.end(); ++face )
670 if ( *face == outerFace ) continue;
671 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false ))
673 gp_Vec dirInF = gp_Vec( fNorm ) ^ n1n2;
674 double angle = dirInOF.AngleWithRef( dirInF, n1n2 );
675 if ( angle < 0 ) angle += 2. * M_PI;
676 angle2Face.insert( make_pair( angle, *face ));
678 if ( !angle2Face.empty() )
679 outerFace2 = angle2Face.begin()->second;
682 // store the found outer face and add its links to continue seaching from
685 _outerFaces.insert( outerFace2 );
686 int nbNodes = outerFace2->NbCornerNodes();
687 for ( int i = 0; i < nbNodes; ++i )
689 SMESH_TLink link2( outerFace2->GetNode(i), outerFace2->GetNode((i+1)%nbNodes));
690 if ( visitedLinks.insert( link2 ).second )
691 startLinks.push_back( TFaceLink( link2.node1(), link2.node2(), outerFace2 ));
694 startLinks.pop_front();
696 _outerFacesFound = true;
698 if ( !seamLinks.empty() )
700 // There are internal boundaries touching the outher one,
701 // find all faces of internal boundaries in order to find
702 // faces of boundaries of holes, if any.
711 //=======================================================================
713 * \brief Find elements of given type where the given point is IN or ON.
714 * Returns nb of found elements and elements them-selves.
716 * 'ALL' type means elements of any type excluding nodes, balls and 0D elements
718 //=======================================================================
720 int SMESH_ElementSearcherImpl::
721 FindElementsByPoint(const gp_Pnt& point,
722 SMDSAbs_ElementType type,
723 vector< const SMDS_MeshElement* >& foundElements)
725 foundElements.clear();
727 double tolerance = getTolerance();
729 // =================================================================================
730 if ( type == SMDSAbs_Node || type == SMDSAbs_0DElement || type == SMDSAbs_Ball)
732 if ( !_nodeSearcher )
735 _nodeSearcher = new SMESH_NodeSearcherImpl( 0, _meshPartIt );
737 _nodeSearcher = new SMESH_NodeSearcherImpl( _mesh );
739 std::vector< const SMDS_MeshNode* > foundNodes;
740 _nodeSearcher->FindNearPoint( point, tolerance, foundNodes );
742 if ( type == SMDSAbs_Node )
744 foundElements.assign( foundNodes.begin(), foundNodes.end() );
748 for ( size_t i = 0; i < foundNodes.size(); ++i )
750 SMDS_ElemIteratorPtr elemIt = foundNodes[i]->GetInverseElementIterator( type );
751 while ( elemIt->more() )
752 foundElements.push_back( elemIt->next() );
756 // =================================================================================
757 else // elements more complex than 0D
759 if ( !_ebbTree || _elementType != type )
761 if ( _ebbTree ) delete _ebbTree;
762 _ebbTree = new ElementBndBoxTree( *_mesh, _elementType = type, _meshPartIt, tolerance );
764 TIDSortedElemSet suspectElems;
765 _ebbTree->getElementsNearPoint( point, suspectElems );
766 TIDSortedElemSet::iterator elem = suspectElems.begin();
767 for ( ; elem != suspectElems.end(); ++elem )
768 if ( !SMESH_MeshAlgos::IsOut( *elem, point, tolerance ))
769 foundElements.push_back( *elem );
771 return foundElements.size();
774 //=======================================================================
776 * \brief Find an element of given type most close to the given point
778 * WARNING: Only face search is implemeneted so far
780 //=======================================================================
782 const SMDS_MeshElement*
783 SMESH_ElementSearcherImpl::FindClosestTo( const gp_Pnt& point,
784 SMDSAbs_ElementType type )
786 const SMDS_MeshElement* closestElem = 0;
788 if ( type == SMDSAbs_Face || type == SMDSAbs_Volume )
790 if ( !_ebbTree || _elementType != type )
792 if ( _ebbTree ) delete _ebbTree;
793 _ebbTree = new ElementBndBoxTree( *_mesh, _elementType = type, _meshPartIt );
795 TIDSortedElemSet suspectElems;
796 _ebbTree->getElementsNearPoint( point, suspectElems );
798 if ( suspectElems.empty() && _ebbTree->maxSize() > 0 )
800 gp_Pnt boxCenter = 0.5 * ( _ebbTree->getBox()->CornerMin() +
801 _ebbTree->getBox()->CornerMax() );
803 if ( _ebbTree->getBox()->IsOut( point.XYZ() ))
804 radius = point.Distance( boxCenter ) - 0.5 * _ebbTree->maxSize();
806 radius = _ebbTree->maxSize() / pow( 2., getTreeHeight()) / 2;
807 while ( suspectElems.empty() )
809 _ebbTree->getElementsInSphere( point.XYZ(), radius, suspectElems );
813 double minDist = std::numeric_limits<double>::max();
814 multimap< double, const SMDS_MeshElement* > dist2face;
815 TIDSortedElemSet::iterator elem = suspectElems.begin();
816 for ( ; elem != suspectElems.end(); ++elem )
818 double dist = SMESH_MeshAlgos::GetDistance( *elem, point );
819 if ( dist < minDist + 1e-10)
822 dist2face.insert( dist2face.begin(), make_pair( dist, *elem ));
825 if ( !dist2face.empty() )
827 multimap< double, const SMDS_MeshElement* >::iterator d2f = dist2face.begin();
828 closestElem = d2f->second;
829 // if there are several elements at the same distance, select one
830 // with GC closest to the point
831 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
832 double minDistToGC = 0;
833 for ( ++d2f; d2f != dist2face.end() && fabs( d2f->first - minDist ) < 1e-10; ++d2f )
835 if ( minDistToGC == 0 )
838 gc = accumulate( TXyzIterator(closestElem->nodesIterator()),
839 TXyzIterator(), gc ) / closestElem->NbNodes();
840 minDistToGC = point.SquareDistance( gc );
843 gc = accumulate( TXyzIterator( d2f->second->nodesIterator()),
844 TXyzIterator(), gc ) / d2f->second->NbNodes();
845 double d = point.SquareDistance( gc );
846 if ( d < minDistToGC )
849 closestElem = d2f->second;
852 // cout << "FindClosestTo( " <<point.X()<<", "<<point.Y()<<", "<<point.Z()<<" ) FACE "
853 // <<closestElem->GetID() << " DIST " << minDist << endl;
858 // NOT IMPLEMENTED SO FAR
864 //================================================================================
866 * \brief Classify the given point in the closed 2D mesh
868 //================================================================================
870 TopAbs_State SMESH_ElementSearcherImpl::GetPointState(const gp_Pnt& point)
872 double tolerance = getTolerance();
873 if ( !_ebbTree || _elementType != SMDSAbs_Face )
875 if ( _ebbTree ) delete _ebbTree;
876 _ebbTree = new ElementBndBoxTree( *_mesh, _elementType = SMDSAbs_Face, _meshPartIt );
878 // Algo: analyse transition of a line starting at the point through mesh boundary;
879 // try three lines parallel to axis of the coordinate system and perform rough
880 // analysis. If solution is not clear perform thorough analysis.
882 const int nbAxes = 3;
883 gp_Dir axisDir[ nbAxes ] = { gp::DX(), gp::DY(), gp::DZ() };
884 map< double, TInters > paramOnLine2TInters[ nbAxes ];
885 list< TInters > tangentInters[ nbAxes ]; // of faces whose plane includes the line
886 multimap< int, int > nbInt2Axis; // to find the simplest case
887 for ( int axis = 0; axis < nbAxes; ++axis )
889 gp_Ax1 lineAxis( point, axisDir[axis]);
890 gp_Lin line ( lineAxis );
892 TIDSortedElemSet suspectFaces; // faces possibly intersecting the line
893 _ebbTree->getElementsNearLine( lineAxis, suspectFaces );
895 // Intersect faces with the line
897 map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
898 TIDSortedElemSet::iterator face = suspectFaces.begin();
899 for ( ; face != suspectFaces.end(); ++face )
903 if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false)) continue;
904 gp_Pln facePlane( SMESH_TNodeXYZ( (*face)->GetNode(0)), fNorm );
906 // perform intersection
907 IntAna_IntConicQuad intersection( line, IntAna_Quadric( facePlane ));
908 if ( !intersection.IsDone() )
910 if ( intersection.IsInQuadric() )
912 tangentInters[ axis ].push_back( TInters( *face, fNorm, true ));
914 else if ( ! intersection.IsParallel() && intersection.NbPoints() > 0 )
916 double tol = 1e-4 * Sqrt( fNorm.Modulus() );
917 gp_Pnt intersectionPoint = intersection.Point(1);
918 if ( !SMESH_MeshAlgos::IsOut( *face, intersectionPoint, tol ))
919 u2inters.insert(make_pair( intersection.ParamOnConic(1), TInters( *face, fNorm )));
922 // Analyse intersections roughly
924 int nbInter = u2inters.size();
928 double f = u2inters.begin()->first, l = u2inters.rbegin()->first;
929 if ( nbInter == 1 ) // not closed mesh
930 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
932 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
935 if ( (f<0) == (l<0) )
938 int nbIntBeforePoint = std::distance( u2inters.begin(), u2inters.lower_bound(0));
939 int nbIntAfterPoint = nbInter - nbIntBeforePoint;
940 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
943 nbInt2Axis.insert( make_pair( min( nbIntBeforePoint, nbIntAfterPoint ), axis ));
945 if ( _outerFacesFound ) break; // pass to thorough analysis
947 } // three attempts - loop on CS axes
949 // Analyse intersections thoroughly.
950 // We make two loops maximum, on the first one we only exclude touching intersections,
951 // on the second, if situation is still unclear, we gather and use information on
952 // position of faces (internal or outer). If faces position is already gathered,
953 // we make the second loop right away.
955 for ( int hasPositionInfo = _outerFacesFound; hasPositionInfo < 2; ++hasPositionInfo )
957 multimap< int, int >::const_iterator nb_axis = nbInt2Axis.begin();
958 for ( ; nb_axis != nbInt2Axis.end(); ++nb_axis )
960 int axis = nb_axis->second;
961 map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
963 gp_Ax1 lineAxis( point, axisDir[axis]);
964 gp_Lin line ( lineAxis );
966 // add tangent intersections to u2inters
968 list< TInters >::const_iterator tgtInt = tangentInters[ axis ].begin();
969 for ( ; tgtInt != tangentInters[ axis ].end(); ++tgtInt )
970 if ( getIntersParamOnLine( line, tgtInt->_face, tolerance, param ))
971 u2inters.insert(make_pair( param, *tgtInt ));
972 tangentInters[ axis ].clear();
974 // Count intersections before and after the point excluding touching ones.
975 // If hasPositionInfo we count intersections of outer boundary only
977 int nbIntBeforePoint = 0, nbIntAfterPoint = 0;
978 double f = numeric_limits<double>::max(), l = -numeric_limits<double>::max();
979 map< double, TInters >::iterator u_int1 = u2inters.begin(), u_int2 = u_int1;
980 bool ok = ! u_int1->second._coincides;
981 while ( ok && u_int1 != u2inters.end() )
983 double u = u_int1->first;
984 bool touchingInt = false;
985 if ( ++u_int2 != u2inters.end() )
987 // skip intersections at the same point (if the line passes through edge or node)
989 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u ) < tolerance )
995 // skip tangent intersections
997 if ( u_int2 != u2inters.end() )
999 const SMDS_MeshElement* prevFace = u_int1->second._face;
1000 while ( ok && u_int2->second._coincides )
1002 if ( SMESH_MeshAlgos::GetCommonNodes(prevFace , u_int2->second._face).empty() )
1008 ok = ( u_int2 != u2inters.end() );
1014 // skip intersections at the same point after tangent intersections
1017 double u2 = u_int2->first;
1019 while ( u_int2 != u2inters.end() && fabs( u_int2->first - u2 ) < tolerance )
1025 // decide if we skipped a touching intersection
1026 if ( nbSamePnt + nbTgt > 0 )
1028 double minDot = numeric_limits<double>::max(), maxDot = -numeric_limits<double>::max();
1029 map< double, TInters >::iterator u_int = u_int1;
1030 for ( ; u_int != u_int2; ++u_int )
1032 if ( u_int->second._coincides ) continue;
1033 double dot = u_int->second._faceNorm * line.Direction();
1034 if ( dot > maxDot ) maxDot = dot;
1035 if ( dot < minDot ) minDot = dot;
1037 touchingInt = ( minDot*maxDot < 0 );
1042 if ( !hasPositionInfo || isOuterBoundary( u_int1->second._face ))
1053 u_int1 = u_int2; // to next intersection
1055 } // loop on intersections with one line
1059 if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
1062 if ( nbIntBeforePoint == 0 || nbIntAfterPoint == 0)
1065 if ( nbIntBeforePoint + nbIntAfterPoint == 1 ) // not closed mesh
1066 return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
1068 if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
1071 if ( (f<0) == (l<0) )
1074 if ( hasPositionInfo )
1075 return nbIntBeforePoint % 2 ? TopAbs_IN : TopAbs_OUT;
1077 } // loop on intersections of the tree lines - thorough analysis
1079 if ( !hasPositionInfo )
1081 // gather info on faces position - is face in the outer boundary or not
1082 map< double, TInters > & u2inters = paramOnLine2TInters[ 0 ];
1083 findOuterBoundary( u2inters.begin()->second._face );
1086 } // two attempts - with and w/o faces position info in the mesh
1088 return TopAbs_UNKNOWN;
1091 //=======================================================================
1093 * \brief Return elements possibly intersecting the line
1095 //=======================================================================
1097 void SMESH_ElementSearcherImpl::GetElementsNearLine( const gp_Ax1& line,
1098 SMDSAbs_ElementType type,
1099 vector< const SMDS_MeshElement* >& foundElems)
1101 if ( !_ebbTree || _elementType != type )
1103 if ( _ebbTree ) delete _ebbTree;
1104 _ebbTree = new ElementBndBoxTree( *_mesh, _elementType = type, _meshPartIt );
1106 TIDSortedElemSet suspectFaces; // elements possibly intersecting the line
1107 _ebbTree->getElementsNearLine( line, suspectFaces );
1108 foundElems.assign( suspectFaces.begin(), suspectFaces.end());
1111 //=======================================================================
1113 * Return elements whose bounding box intersects a sphere
1115 //=======================================================================
1117 void SMESH_ElementSearcherImpl::GetElementsInSphere( const gp_XYZ& center,
1118 const double radius,
1119 SMDSAbs_ElementType type,
1120 vector< const SMDS_MeshElement* >& foundElems)
1122 if ( !_ebbTree || _elementType != type )
1124 if ( _ebbTree ) delete _ebbTree;
1125 _ebbTree = new ElementBndBoxTree( *_mesh, _elementType = type, _meshPartIt );
1127 TIDSortedElemSet suspectFaces; // elements possibly intersecting the line
1128 _ebbTree->getElementsInSphere( center, radius, suspectFaces );
1129 foundElems.assign( suspectFaces.begin(), suspectFaces.end() );
1132 //=======================================================================
1134 * \brief Return true if the point is IN or ON of the element
1136 //=======================================================================
1138 bool SMESH_MeshAlgos::IsOut( const SMDS_MeshElement* element, const gp_Pnt& point, double tol )
1140 if ( element->GetType() == SMDSAbs_Volume)
1142 return SMDS_VolumeTool( element ).IsOut( point.X(), point.Y(), point.Z(), tol );
1145 // get ordered nodes
1147 vector< SMESH_TNodeXYZ > xyz; xyz.reserve( element->NbNodes()+1 );
1149 SMDS_ElemIteratorPtr nodeIt = element->interlacedNodesElemIterator();
1150 for ( int i = 0; nodeIt->more(); ++i )
1151 xyz.push_back( SMESH_TNodeXYZ( nodeIt->next() ));
1153 int i, nbNodes = (int) xyz.size(); // central node of biquadratic is missing
1155 if ( element->GetType() == SMDSAbs_Face ) // --------------------------------------------------
1157 // compute face normal
1158 gp_Vec faceNorm(0,0,0);
1159 xyz.push_back( xyz.front() );
1160 for ( i = 0; i < nbNodes; ++i )
1162 gp_Vec edge1( xyz[i+1], xyz[i]);
1163 gp_Vec edge2( xyz[i+1], xyz[(i+2)%nbNodes] );
1164 faceNorm += edge1 ^ edge2;
1166 double fNormSize = faceNorm.Magnitude();
1167 if ( fNormSize <= tol )
1169 // degenerated face: point is out if it is out of all face edges
1170 for ( i = 0; i < nbNodes; ++i )
1172 SMDS_LinearEdge edge( xyz[i]._node, xyz[i+1]._node );
1173 if ( !IsOut( &edge, point, tol ))
1178 faceNorm /= fNormSize;
1180 // check if the point lays on face plane
1181 gp_Vec n2p( xyz[0], point );
1182 double dot = n2p * faceNorm;
1183 if ( Abs( dot ) > tol ) // not on face plane
1186 if ( nbNodes > 3 ) // maybe the face is not planar
1188 double elemThick = 0;
1189 for ( i = 1; i < nbNodes; ++i )
1191 gp_Vec n2n( xyz[0], xyz[i] );
1192 elemThick = Max( elemThick, Abs( n2n * faceNorm ));
1194 isOut = Abs( dot ) > elemThick + tol;
1200 // check if point is out of face boundary:
1201 // define it by closest transition of a ray point->infinity through face boundary
1202 // on the face plane.
1203 // First, find normal of a plane perpendicular to face plane, to be used as a cutting tool
1204 // to find intersections of the ray with the boundary.
1206 gp_Vec plnNorm = ray ^ faceNorm;
1207 double n2pSize = plnNorm.Magnitude();
1208 if ( n2pSize <= tol ) return false; // point coincides with the first node
1209 if ( n2pSize * n2pSize > fNormSize * 100 ) return true; // point is very far
1211 // for each node of the face, compute its signed distance to the cutting plane
1212 vector<double> dist( nbNodes + 1);
1213 for ( i = 0; i < nbNodes; ++i )
1215 gp_Vec n2p( xyz[i], point );
1216 dist[i] = n2p * plnNorm;
1218 dist.back() = dist.front();
1219 // find the closest intersection
1221 double rClosest = 0, distClosest = 1e100;
1223 for ( i = 0; i < nbNodes; ++i )
1226 if ( fabs( dist[i] ) < tol )
1228 else if ( fabs( dist[i+1]) < tol )
1230 else if ( dist[i] * dist[i+1] < 0 )
1231 r = dist[i] / ( dist[i] - dist[i+1] );
1233 continue; // no intersection
1234 gp_Pnt pInt = xyz[i] * (1.-r) + xyz[i+1] * r;
1235 gp_Vec p2int( point, pInt);
1236 double intDist = p2int.SquareMagnitude();
1237 if ( intDist < distClosest )
1242 distClosest = intDist;
1246 return true; // no intesections - out
1248 // analyse transition
1249 gp_Vec edge( xyz[iClosest], xyz[iClosest+1] );
1250 gp_Vec edgeNorm = -( edge ^ faceNorm ); // normal to intersected edge pointing out of face
1251 gp_Vec p2int ( point, pClosest );
1252 bool out = (edgeNorm * p2int) < -tol;
1253 if ( rClosest > 0. && rClosest < 1. ) // not node intersection
1256 // the ray passes through a face node; analyze transition through an adjacent edge
1257 gp_Pnt p1 = xyz[ (rClosest == 0.) ? ((iClosest+nbNodes-1) % nbNodes) : (iClosest+1) ];
1258 gp_Pnt p2 = xyz[ (rClosest == 0.) ? iClosest : ((iClosest+2) % nbNodes) ];
1259 gp_Vec edgeAdjacent( p1, p2 );
1260 gp_Vec edgeNorm2 = -( edgeAdjacent ^ faceNorm );
1261 bool out2 = (edgeNorm2 * p2int) < -tol;
1263 bool covexCorner = ( edgeNorm * edgeAdjacent * (rClosest==1. ? 1. : -1.)) < 0;
1264 return covexCorner ? (out || out2) : (out && out2);
1267 if ( element->GetType() == SMDSAbs_Edge ) // --------------------------------------------------
1269 // point is out of edge if it is NOT ON any straight part of edge
1270 // (we consider quadratic edge as being composed of two straight parts)
1271 for ( i = 1; i < nbNodes; ++i )
1273 gp_Vec edge( xyz[i-1], xyz[i] );
1274 gp_Vec n1p ( xyz[i-1], point );
1275 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1277 if ( n1p.SquareMagnitude() < tol * tol )
1282 if ( point.SquareDistance( xyz[i] ) < tol * tol )
1286 gp_XYZ proj = ( 1. - u ) * xyz[i-1] + u * xyz[i]; // projection of the point on the edge
1287 double dist2 = point.SquareDistance( proj );
1288 if ( dist2 > tol * tol )
1290 return false; // point is ON this part
1295 // Node or 0D element -------------------------------------------------------------------------
1297 gp_Vec n2p ( xyz[0], point );
1298 return n2p.SquareMagnitude() > tol * tol;
1303 //=======================================================================
1306 // Position of a point relative to a segment
1310 // VERTEX 1 o----ON-----> VERTEX 2
1314 enum PositionName { POS_LEFT = 1, POS_VERTEX = 2, POS_RIGHT = 4, //POS_ON = 8,
1315 POS_ALL = POS_LEFT | POS_RIGHT | POS_VERTEX };
1319 int _index; // index of vertex or segment
1321 PointPos( PositionName n, int i=-1 ): _name(n), _index(i) {}
1322 bool operator < (const PointPos& other ) const
1324 if ( _name == other._name )
1325 return ( _index < 0 || other._index < 0 ) ? false : _index < other._index;
1326 return _name < other._name;
1330 //================================================================================
1332 * \brief Return of a point relative to a segment
1333 * \param point2D - the point to analyze position of
1334 * \param xyVec - end points of segments
1335 * \param index0 - 0-based index of the first point of segment
1336 * \param posToFindOut - flags of positions to detect
1337 * \retval PointPos - point position
1339 //================================================================================
1341 PointPos getPointPosition( const gp_XY& point2D,
1342 const gp_XY* segEnds,
1343 const int index0 = 0,
1344 const int posToFindOut = POS_ALL)
1346 const gp_XY& p1 = segEnds[ index0 ];
1347 const gp_XY& p2 = segEnds[ index0+1 ];
1348 const gp_XY grad = p2 - p1;
1350 if ( posToFindOut & POS_VERTEX )
1352 // check if the point2D is at "vertex 1" zone
1353 gp_XY pp1[2] = { p1, gp_XY( p1.X() - grad.Y(),
1354 p1.Y() + grad.X() ) };
1355 if ( getPointPosition( point2D, pp1, 0, POS_LEFT|POS_RIGHT )._name == POS_LEFT )
1356 return PointPos( POS_VERTEX, index0 );
1358 // check if the point2D is at "vertex 2" zone
1359 gp_XY pp2[2] = { p2, gp_XY( p2.X() - grad.Y(),
1360 p2.Y() + grad.X() ) };
1361 if ( getPointPosition( point2D, pp2, 0, POS_LEFT|POS_RIGHT )._name == POS_RIGHT )
1362 return PointPos( POS_VERTEX, index0 + 1);
1364 double edgeEquation =
1365 ( point2D.X() - p1.X() ) * grad.Y() - ( point2D.Y() - p1.Y() ) * grad.X();
1366 return PointPos( edgeEquation < 0 ? POS_LEFT : POS_RIGHT, index0 );
1370 //=======================================================================
1372 * \brief Return minimal distance from a point to an element
1374 * Currently we ignore non-planarity and 2nd order of face
1376 //=======================================================================
1378 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshElement* elem,
1379 const gp_Pnt& point )
1381 switch ( elem->GetType() )
1383 case SMDSAbs_Volume:
1384 return GetDistance( dynamic_cast<const SMDS_MeshVolume*>( elem ), point);
1386 return GetDistance( dynamic_cast<const SMDS_MeshFace*>( elem ), point);
1388 return GetDistance( dynamic_cast<const SMDS_MeshEdge*>( elem ), point);
1390 return point.Distance( SMESH_TNodeXYZ( elem ));
1396 //=======================================================================
1398 * \brief Return minimal distance from a point to a face
1400 * Currently we ignore non-planarity and 2nd order of face
1402 //=======================================================================
1404 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshFace* face,
1405 const gp_Pnt& point )
1407 double badDistance = -1;
1408 if ( !face ) return badDistance;
1410 // coordinates of nodes (medium nodes, if any, ignored)
1411 typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
1412 vector<gp_XYZ> xyz( TXyzIterator( face->nodesIterator()), TXyzIterator() );
1413 xyz.resize( face->NbCornerNodes()+1 );
1415 // transformation to get xyz[0] lies on the origin, xyz[1] lies on the Z axis,
1416 // and xyz[2] lies in the XZ plane. This is to pass to 2D space on XZ plane.
1418 gp_Vec OZ ( xyz[0], xyz[1] );
1419 gp_Vec OX ( xyz[0], xyz[2] );
1420 if ( OZ.Magnitude() < std::numeric_limits<double>::min() )
1422 if ( xyz.size() < 4 ) return badDistance;
1423 OZ = gp_Vec ( xyz[0], xyz[2] );
1424 OX = gp_Vec ( xyz[0], xyz[3] );
1428 tgtCS = gp_Ax3( xyz[0], OZ, OX );
1430 catch ( Standard_Failure ) {
1433 trsf.SetTransformation( tgtCS );
1435 // move all the nodes to 2D
1436 vector<gp_XY> xy( xyz.size() );
1437 for ( size_t i = 0;i < xyz.size()-1; ++i )
1439 gp_XYZ p3d = xyz[i];
1440 trsf.Transforms( p3d );
1441 xy[i].SetCoord( p3d.X(), p3d.Z() );
1443 xyz.back() = xyz.front();
1444 xy.back() = xy.front();
1446 // // move the point in 2D
1447 gp_XYZ tmpPnt = point.XYZ();
1448 trsf.Transforms( tmpPnt );
1449 gp_XY point2D( tmpPnt.X(), tmpPnt.Z() );
1451 // loop on segments of the face to analyze point position ralative to the face
1452 set< PointPos > pntPosSet;
1453 for ( size_t i = 1; i < xy.size(); ++i )
1455 PointPos pos = getPointPosition( point2D, &xy[0], i-1 );
1456 pntPosSet.insert( pos );
1460 PointPos pos = *pntPosSet.begin();
1461 // cout << "Face " << face->GetID() << " DIST: ";
1462 switch ( pos._name )
1465 // point is most close to a segment
1466 gp_Vec p0p1( point, xyz[ pos._index ] );
1467 gp_Vec p1p2( xyz[ pos._index ], xyz[ pos._index+1 ]); // segment vector
1469 double projDist = p0p1 * p1p2; // distance projected to the segment
1470 gp_Vec projVec = p1p2 * projDist;
1471 gp_Vec distVec = p0p1 - projVec;
1472 // cout << distVec.Magnitude() << ", SEG " << face->GetNode(pos._index)->GetID()
1473 // << " - " << face->GetNodeWrap(pos._index+1)->GetID() << endl;
1474 return distVec.Magnitude();
1477 // point is inside the face
1478 double distToFacePlane = tmpPnt.Y();
1479 // cout << distToFacePlane << ", INSIDE " << endl;
1480 return Abs( distToFacePlane );
1483 // point is most close to a node
1484 gp_Vec distVec( point, xyz[ pos._index ]);
1485 // cout << distVec.Magnitude() << " VERTEX " << face->GetNode(pos._index)->GetID() << endl;
1486 return distVec.Magnitude();
1493 //=======================================================================
1495 * \brief Return minimal distance from a point to an edge
1497 //=======================================================================
1499 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshEdge* seg, const gp_Pnt& point )
1501 double dist = Precision::Infinite();
1502 if ( !seg ) return dist;
1504 int i = 0, nbNodes = seg->NbNodes();
1506 vector< SMESH_TNodeXYZ > xyz( nbNodes );
1507 SMDS_ElemIteratorPtr nodeIt = seg->interlacedNodesElemIterator();
1508 while ( nodeIt->more() )
1509 xyz[ i++ ].Set( nodeIt->next() );
1511 for ( i = 1; i < nbNodes; ++i )
1513 gp_Vec edge( xyz[i-1], xyz[i] );
1514 gp_Vec n1p ( xyz[i-1], point );
1515 double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
1517 dist = Min( dist, n1p.SquareMagnitude() );
1519 else if ( u >= 1. ) {
1520 dist = Min( dist, point.SquareDistance( xyz[i] ));
1523 gp_XYZ proj = ( 1. - u ) * xyz[i-1] + u * xyz[i]; // projection of the point on the edge
1524 dist = Min( dist, point.SquareDistance( proj ));
1527 return Sqrt( dist );
1530 //=======================================================================
1532 * \brief Return minimal distance from a point to a volume
1534 * Currently we ignore non-planarity and 2nd order
1536 //=======================================================================
1538 double SMESH_MeshAlgos::GetDistance( const SMDS_MeshVolume* volume, const gp_Pnt& point )
1540 SMDS_VolumeTool vTool( volume );
1541 vTool.SetExternalNormal();
1542 const int iQ = volume->IsQuadratic() ? 2 : 1;
1545 double minDist = 1e100, dist;
1546 for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
1548 // skip a facet with normal not "looking at" the point
1549 if ( !vTool.GetFaceNormal( iF, n[0], n[1], n[2] ) ||
1550 !vTool.GetFaceBaryCenter( iF, bc[0], bc[1], bc[2] ))
1552 gp_XYZ bcp = point.XYZ() - gp_XYZ( bc[0], bc[1], bc[2] );
1553 if ( gp_XYZ( n[0], n[1], n[2] ) * bcp < 1e-6 )
1556 // find distance to a facet
1557 const SMDS_MeshNode** nodes = vTool.GetFaceNodes( iF );
1558 switch ( vTool.NbFaceNodes( iF ) / iQ ) {
1561 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ] );
1562 dist = GetDistance( &tmpFace, point );
1567 SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ], nodes[ 3*iQ ]);
1568 dist = GetDistance( &tmpFace, point );
1572 vector<const SMDS_MeshNode *> nvec( nodes, nodes + vTool.NbFaceNodes( iF ));
1573 SMDS_PolygonalFaceOfNodes tmpFace( nvec );
1574 dist = GetDistance( &tmpFace, point );
1576 minDist = Min( minDist, dist );
1581 //================================================================================
1583 * \brief Returns barycentric coordinates of a point within a triangle.
1584 * A not returned bc2 = 1. - bc0 - bc1.
1585 * The point lies within the triangle if ( bc0 >= 0 && bc1 >= 0 && bc0+bc1 <= 1 )
1587 //================================================================================
1589 void SMESH_MeshAlgos::GetBarycentricCoords( const gp_XY& p,
1596 const double // matrix 2x2
1597 T11 = t0.X()-t2.X(), T12 = t1.X()-t2.X(),
1598 T21 = t0.Y()-t2.Y(), T22 = t1.Y()-t2.Y();
1599 const double Tdet = T11*T22 - T12*T21; // matrix determinant
1600 if ( Abs( Tdet ) < std::numeric_limits<double>::min() )
1606 const double t11 = T22, t12 = -T12, t21 = -T21, t22 = T11;
1608 const double r11 = p.X()-t2.X(), r12 = p.Y()-t2.Y();
1609 // barycentric coordinates: mutiply matrix by vector
1610 bc0 = (t11 * r11 + t12 * r12)/Tdet;
1611 bc1 = (t21 * r11 + t22 * r12)/Tdet;
1614 //=======================================================================
1615 //function : FindFaceInSet
1616 //purpose : Return a face having linked nodes n1 and n2 and which is
1617 // - not in avoidSet,
1618 // - in elemSet provided that !elemSet.empty()
1619 // i1 and i2 optionally returns indices of n1 and n2
1620 //=======================================================================
1622 const SMDS_MeshElement*
1623 SMESH_MeshAlgos::FindFaceInSet(const SMDS_MeshNode* n1,
1624 const SMDS_MeshNode* n2,
1625 const TIDSortedElemSet& elemSet,
1626 const TIDSortedElemSet& avoidSet,
1632 const SMDS_MeshElement* face = 0;
1634 SMDS_ElemIteratorPtr invElemIt = n1->GetInverseElementIterator(SMDSAbs_Face);
1635 while ( invElemIt->more() && !face ) // loop on inverse faces of n1
1637 const SMDS_MeshElement* elem = invElemIt->next();
1638 if (avoidSet.count( elem ))
1640 if ( !elemSet.empty() && !elemSet.count( elem ))
1643 i1 = elem->GetNodeIndex( n1 );
1644 // find a n2 linked to n1
1645 int nbN = elem->IsQuadratic() ? elem->NbNodes()/2 : elem->NbNodes();
1646 for ( int di = -1; di < 2 && !face; di += 2 )
1648 i2 = (i1+di+nbN) % nbN;
1649 if ( elem->GetNode( i2 ) == n2 )
1652 if ( !face && elem->IsQuadratic())
1654 // analysis for quadratic elements using all nodes
1655 SMDS_ElemIteratorPtr anIter = elem->interlacedNodesElemIterator();
1656 const SMDS_MeshNode* prevN = static_cast<const SMDS_MeshNode*>( anIter->next() );
1657 for ( i1 = -1, i2 = 0; anIter->more() && !face; i1++, i2++ )
1659 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( anIter->next() );
1660 if ( n1 == prevN && n2 == n )
1664 else if ( n2 == prevN && n1 == n )
1666 face = elem; swap( i1, i2 );
1672 if ( n1ind ) *n1ind = i1;
1673 if ( n2ind ) *n2ind = i2;
1677 //================================================================================
1679 * \brief Calculate normal of a mesh face
1681 //================================================================================
1683 bool SMESH_MeshAlgos::FaceNormal(const SMDS_MeshElement* F, gp_XYZ& normal, bool normalized)
1685 if ( !F || F->GetType() != SMDSAbs_Face )
1688 normal.SetCoord(0,0,0);
1689 int nbNodes = F->NbCornerNodes();
1690 for ( int i = 0; i < nbNodes-2; ++i )
1693 for ( int n = 0; n < 3; ++n )
1695 const SMDS_MeshNode* node = F->GetNode( i + n );
1696 p[n].SetCoord( node->X(), node->Y(), node->Z() );
1698 normal += ( p[2] - p[1] ) ^ ( p[0] - p[1] );
1700 double size2 = normal.SquareModulus();
1701 bool ok = ( size2 > numeric_limits<double>::min() * numeric_limits<double>::min());
1702 if ( normalized && ok )
1703 normal /= sqrt( size2 );
1708 //=======================================================================
1709 //function : GetCommonNodes
1710 //purpose : Return nodes common to two elements
1711 //=======================================================================
1713 vector< const SMDS_MeshNode*> SMESH_MeshAlgos::GetCommonNodes(const SMDS_MeshElement* e1,
1714 const SMDS_MeshElement* e2)
1716 vector< const SMDS_MeshNode*> common;
1717 for ( int i = 0 ; i < e1->NbNodes(); ++i )
1718 if ( e2->GetNodeIndex( e1->GetNode( i )) >= 0 )
1719 common.push_back( e1->GetNode( i ));
1723 //=======================================================================
1725 * \brief Return SMESH_NodeSearcher
1727 //=======================================================================
1729 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_Mesh& mesh)
1731 return new SMESH_NodeSearcherImpl( &mesh );
1734 //=======================================================================
1736 * \brief Return SMESH_NodeSearcher
1738 //=======================================================================
1740 SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_ElemIteratorPtr elemIt)
1742 return new SMESH_NodeSearcherImpl( 0, elemIt );
1745 //=======================================================================
1747 * \brief Return SMESH_ElementSearcher
1749 //=======================================================================
1751 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
1754 return new SMESH_ElementSearcherImpl( mesh, tolerance );
1757 //=======================================================================
1759 * \brief Return SMESH_ElementSearcher acting on a sub-set of elements
1761 //=======================================================================
1763 SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
1764 SMDS_ElemIteratorPtr elemIt,
1767 return new SMESH_ElementSearcherImpl( mesh, tolerance, elemIt );