// Copyright (C) 2007-2019 CEA/DEN, EDF R&D, OPEN CASCADE
//
// Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
// File : SMESH_MeshAlgos.hxx
// Created : Tue Apr 30 18:00:36 2013
// Author : Edward AGAPOV (eap)
// Initially this file held some low level algorithms extracted from SMESH_MeshEditor
// to make them accessible from Controls package
#include "SMESH_MeshAlgos.hxx"
#include "ObjectPool.hxx"
#include "SMDS_FaceOfNodes.hxx"
#include "SMDS_LinearEdge.hxx"
#include "SMDS_Mesh.hxx"
#include "SMDS_PolygonalFaceOfNodes.hxx"
#include "SMDS_VolumeTool.hxx"
#include "SMESH_OctreeNode.hxx"
#include <Utils_SALOME_Exception.hxx>
#include <GC_MakeSegment.hxx>
#include <GeomAPI_ExtremaCurveCurve.hxx>
#include <Geom_Line.hxx>
#include <IntAna_IntConicQuad.hxx>
#include <IntAna_Quadric.hxx>
#include <gp_Lin.hxx>
#include <gp_Pln.hxx>
#include <NCollection_DataMap.hxx>
#include <limits>
#include <numeric>
#include <boost/container/flat_set.hpp>
//=======================================================================
/*!
* \brief Implementation of search for the node closest to point
*/
//=======================================================================
struct SMESH_NodeSearcherImpl: public SMESH_NodeSearcher
{
//---------------------------------------------------------------------
/*!
* \brief Constructor
*/
SMESH_NodeSearcherImpl( const SMDS_Mesh* theMesh = 0,
SMDS_ElemIteratorPtr theElemIt = SMDS_ElemIteratorPtr() )
{
myMesh = ( SMDS_Mesh* ) theMesh;
TIDSortedNodeSet nodes;
if ( theMesh ) {
SMDS_NodeIteratorPtr nIt = theMesh->nodesIterator();
while ( nIt->more() )
nodes.insert( nodes.end(), nIt->next() );
}
else if ( theElemIt )
{
while ( theElemIt->more() )
{
const SMDS_MeshElement* e = theElemIt->next();
nodes.insert( e->begin_nodes(), e->end_nodes() );
}
}
myOctreeNode = new SMESH_OctreeNode(nodes) ;
// get max size of a leaf box
SMESH_OctreeNode* tree = myOctreeNode;
while ( !tree->isLeaf() )
{
SMESH_OctreeNodeIteratorPtr cIt = tree->GetChildrenIterator();
if ( cIt->more() )
tree = cIt->next();
}
myHalfLeafSize = tree->maxSize() / 2.;
}
//---------------------------------------------------------------------
/*!
* \brief Move node and update myOctreeNode accordingly
*/
void MoveNode( const SMDS_MeshNode* node, const gp_Pnt& toPnt )
{
myOctreeNode->UpdateByMoveNode( node, toPnt );
myMesh->MoveNode( node, toPnt.X(), toPnt.Y(), toPnt.Z() );
}
//---------------------------------------------------------------------
/*!
* \brief Do it's job
*/
const SMDS_MeshNode* FindClosestTo( const gp_Pnt& thePnt )
{
std::map<double, const SMDS_MeshNode*> dist2Nodes;
myOctreeNode->NodesAround( thePnt.Coord(), dist2Nodes, myHalfLeafSize );
if ( !dist2Nodes.empty() )
return dist2Nodes.begin()->second;
std::vector<const SMDS_MeshNode*> nodes;
//myOctreeNode->NodesAround( &tgtNode, &nodes, myHalfLeafSize );
double minSqDist = DBL_MAX;
if ( nodes.empty() ) // get all nodes of OctreeNode's closest to thePnt
{
// sort leafs by their distance from thePnt
typedef std::multimap< double, SMESH_OctreeNode* > TDistTreeMap;
TDistTreeMap treeMap;
std::list< SMESH_OctreeNode* > treeList;
std::list< SMESH_OctreeNode* >::iterator trIt;
treeList.push_back( myOctreeNode );
gp_XYZ pointNode( thePnt.X(), thePnt.Y(), thePnt.Z() );
bool pointInside = myOctreeNode->isInside( pointNode, myHalfLeafSize );
for ( trIt = treeList.begin(); trIt != treeList.end(); ++trIt)
{
SMESH_OctreeNode* tree = *trIt;
if ( !tree->isLeaf() ) // put children to the queue
{
if ( pointInside && !tree->isInside( pointNode, myHalfLeafSize )) continue;
SMESH_OctreeNodeIteratorPtr cIt = tree->GetChildrenIterator();
while ( cIt->more() )
treeList.push_back( cIt->next() );
}
else if ( tree->NbNodes() ) // put a tree to the treeMap
{
const Bnd_B3d& box = *tree->getBox();
double sqDist = thePnt.SquareDistance( 0.5 * ( box.CornerMin() + box.CornerMax() ));
treeMap.insert( std::make_pair( sqDist, tree ));
}
}
// find distance after which there is no sense to check tree's
double sqLimit = DBL_MAX;
TDistTreeMap::iterator sqDist_tree = treeMap.begin();
if ( treeMap.size() > 5 ) {
SMESH_OctreeNode* closestTree = sqDist_tree->second;
const Bnd_B3d& box = *closestTree->getBox();
double limit = sqrt( sqDist_tree->first ) + sqrt ( box.SquareExtent() );
sqLimit = limit * limit;
}
// get all nodes from trees
for ( ; sqDist_tree != treeMap.end(); ++sqDist_tree) {
if ( sqDist_tree->first > sqLimit )
break;
SMESH_OctreeNode* tree = sqDist_tree->second;
tree->AllNodesAround( tree->GetNodeIterator()->next(), &nodes );
}
}
// find closest among nodes
minSqDist = DBL_MAX;
const SMDS_MeshNode* closestNode = 0;
for ( size_t i = 0; i < nodes.size(); ++i )
{
double sqDist = thePnt.SquareDistance( SMESH_NodeXYZ( nodes[ i ]));
if ( minSqDist > sqDist ) {
closestNode = nodes[ i ];
minSqDist = sqDist;
}
}
return closestNode;
}
//---------------------------------------------------------------------
/*!
* \brief Finds nodes located within a tolerance near a point
*/
int FindNearPoint(const gp_Pnt& point,
const double tolerance,
std::vector< const SMDS_MeshNode* >& foundNodes)
{
myOctreeNode->NodesAround( point.Coord(), foundNodes, tolerance );
return foundNodes.size();
}
//---------------------------------------------------------------------
/*!
* \brief Destructor
*/
~SMESH_NodeSearcherImpl() { delete myOctreeNode; }
//---------------------------------------------------------------------
/*!
* \brief Return the node tree
*/
const SMESH_OctreeNode* getTree() const { return myOctreeNode; }
private:
SMESH_OctreeNode* myOctreeNode;
SMDS_Mesh* myMesh;
double myHalfLeafSize; // max size of a leaf box
};
// ========================================================================
namespace // Utils used in SMESH_ElementSearcherImpl::FindElementsByPoint()
{
const int MaxNbElemsInLeaf = 10; // maximal number of elements in a leaf of tree
const int MaxLevel = 7; // maximal tree height -> nb terminal boxes: 8^7 = 2097152
const double NodeRadius = 1e-9; // to enlarge bnd box of element
//=======================================================================
/*!
* \brief Octal tree of bounding boxes of elements
*/
//=======================================================================
class ElementBndBoxTree : public SMESH_Octree
{
public:
typedef boost::container::flat_set< const SMDS_MeshElement*, TIDCompare > TElemSeq;
ElementBndBoxTree(const SMDS_Mesh& mesh,
SMDSAbs_ElementType elemType,
SMDS_ElemIteratorPtr theElemIt = SMDS_ElemIteratorPtr(),
double tolerance = NodeRadius );
void getElementsNearPoint( const gp_Pnt& point, TElemSeq& foundElems );
void getElementsNearLine ( const gp_Ax1& line, TElemSeq& foundElems );
void getElementsInBox ( const Bnd_B3d& box, TElemSeq& foundElems );
void getElementsInSphere ( const gp_XYZ& center, const double radius, TElemSeq& foundElems );
ElementBndBoxTree* getLeafAtPoint( const gp_XYZ& point );
protected:
ElementBndBoxTree() {}
SMESH_Octree* newChild() const { return new ElementBndBoxTree; }
void buildChildrenData();
Bnd_B3d* buildRootBox();
private:
//!< Bounding box of element
struct ElementBox : public Bnd_B3d
{
const SMDS_MeshElement* _element;
void init(const SMDS_MeshElement* elem, double tolerance);
};
std::vector< ElementBox* > _elements;
typedef ObjectPool< ElementBox > TElementBoxPool;
//!< allocator of ElementBox's and SMESH_TreeLimit
struct LimitAndPool : public SMESH_TreeLimit
{
TElementBoxPool _elBoPool;
LimitAndPool():SMESH_TreeLimit( MaxLevel, /*minSize=*/0. ) {}
};
LimitAndPool* getLimitAndPool() const
{
SMESH_TreeLimit* limitAndPool = const_cast< SMESH_TreeLimit* >( myLimit );
return static_cast< LimitAndPool* >( limitAndPool );
}
};
//================================================================================
/*!
* \brief ElementBndBoxTree creation
*/
//================================================================================
ElementBndBoxTree::ElementBndBoxTree(const SMDS_Mesh& mesh,
SMDSAbs_ElementType elemType,
SMDS_ElemIteratorPtr theElemIt,
double tolerance)
:SMESH_Octree( new LimitAndPool() )
{
int nbElems = mesh.GetMeshInfo().NbElements( elemType );
_elements.reserve( nbElems );
TElementBoxPool& elBoPool = getLimitAndPool()->_elBoPool;
#ifdef _DEBUG_
if ( theElemIt && !theElemIt->more() )
std::cout << "WARNING: ElementBndBoxTree constructed on empty iterator!" << std::endl;
#endif
SMDS_ElemIteratorPtr elemIt = theElemIt ? theElemIt : mesh.elementsIterator( elemType );
while ( elemIt->more() )
{
ElementBox* eb = elBoPool.getNew();
eb->init( elemIt->next(), tolerance );
_elements.push_back( eb );
}
compute();
}
//================================================================================
/*!
* \brief Return the maximal box
*/
//================================================================================
Bnd_B3d* ElementBndBoxTree::buildRootBox()
{
Bnd_B3d* box = new Bnd_B3d;
for ( size_t i = 0; i < _elements.size(); ++i )
box->Add( *_elements[i] );
return box;
}
//================================================================================
/*!
* \brief Redistrubute element boxes among children
*/
//================================================================================
void ElementBndBoxTree::buildChildrenData()
{
for ( size_t i = 0; i < _elements.size(); ++i )
{
for (int j = 0; j < 8; j++)
{
if ( !_elements[i]->IsOut( *myChildren[j]->getBox() ))
((ElementBndBoxTree*)myChildren[j])->_elements.push_back( _elements[i]);
}
}
//_size = _elements.size();
SMESHUtils::FreeVector( _elements ); // = _elements.clear() + free memory
for (int j = 0; j < 8; j++)
{
ElementBndBoxTree* child = static_cast<ElementBndBoxTree*>( myChildren[j]);
if ((int) child->_elements.size() <= MaxNbElemsInLeaf )
child->myIsLeaf = true;
if ( child->isLeaf() && child->_elements.capacity() > child->_elements.size() )
SMESHUtils::CompactVector( child->_elements );
}
}
//================================================================================
/*!
* \brief Return elements which can include the point
*/
//================================================================================
void ElementBndBoxTree::getElementsNearPoint( const gp_Pnt& point, TElemSeq& foundElems)
{
if ( getBox()->IsOut( point.XYZ() ))
return;
if ( isLeaf() )
{
for ( size_t i = 0; i < _elements.size(); ++i )
if ( !_elements[i]->IsOut( point.XYZ() ))
foundElems.insert( _elements[i]->_element );
}
else
{
for (int i = 0; i < 8; i++)
((ElementBndBoxTree*) myChildren[i])->getElementsNearPoint( point, foundElems );
}
}
//================================================================================
/*!
* \brief Return elements which can be intersected by the line
*/
//================================================================================
void ElementBndBoxTree::getElementsNearLine( const gp_Ax1& line, TElemSeq& foundElems )
{
if ( getBox()->IsOut( line ))
return;
if ( isLeaf() )
{
for ( size_t i = 0; i < _elements.size(); ++i )
if ( !_elements[i]->IsOut( line ) )
foundElems.insert( _elements[i]->_element );
}
else
{
for (int i = 0; i < 8; i++)
((ElementBndBoxTree*) myChildren[i])->getElementsNearLine( line, foundElems );
}
}
//================================================================================
/*!
* \brief Return elements from leaves intersecting the sphere
*/
//================================================================================
void ElementBndBoxTree::getElementsInSphere ( const gp_XYZ& center,
const double radius,
TElemSeq& foundElems)
{
if ( getBox()->IsOut( center, radius ))
return;
if ( isLeaf() )
{
for ( size_t i = 0; i < _elements.size(); ++i )
if ( !_elements[i]->IsOut( center, radius ))
foundElems.insert( _elements[i]->_element );
}
else
{
for (int i = 0; i < 8; i++)
((ElementBndBoxTree*) myChildren[i])->getElementsInSphere( center, radius, foundElems );
}
}
//================================================================================
/*!
* \brief Return elements from leaves intersecting the box
*/
//================================================================================
void ElementBndBoxTree::getElementsInBox( const Bnd_B3d& box, TElemSeq& foundElems )
{
if ( getBox()->IsOut( box ))
return;
if ( isLeaf() )
{
for ( size_t i = 0; i < _elements.size(); ++i )
if ( !_elements[i]->IsOut( box ))
foundElems.insert( _elements[i]->_element );
}
else
{
for (int i = 0; i < 8; i++)
((ElementBndBoxTree*) myChildren[i])->getElementsInBox( box, foundElems );
}
}
//================================================================================
/*!
* \brief Return a leaf including a point
*/
//================================================================================
ElementBndBoxTree* ElementBndBoxTree::getLeafAtPoint( const gp_XYZ& point )
{
if ( getBox()->IsOut( point ))
return 0;
if ( isLeaf() )
{
return this;
}
else
{
for (int i = 0; i < 8; i++)
if ( ElementBndBoxTree* l = ((ElementBndBoxTree*) myChildren[i])->getLeafAtPoint( point ))
return l;
}
return 0;
}
//================================================================================
/*!
* \brief Construct the element box
*/
//================================================================================
void ElementBndBoxTree::ElementBox::init(const SMDS_MeshElement* elem, double tolerance)
{
_element = elem;
SMDS_ElemIteratorPtr nIt = elem->nodesIterator();
while ( nIt->more() )
Add( SMESH_NodeXYZ( nIt->next() ));
Enlarge( tolerance );
}
} // namespace
//=======================================================================
/*!
* \brief Implementation of search for the elements by point and
* of classification of point in 2D mesh
*/
//=======================================================================
SMESH_ElementSearcher::~SMESH_ElementSearcher()
{
}
struct SMESH_ElementSearcherImpl: public SMESH_ElementSearcher
{
SMDS_Mesh* _mesh;
SMDS_ElemIteratorPtr _meshPartIt;
ElementBndBoxTree* _ebbTree [SMDSAbs_NbElementTypes];
int _ebbTreeHeight[SMDSAbs_NbElementTypes];
SMESH_NodeSearcherImpl* _nodeSearcher;
SMDSAbs_ElementType _elementType;
double _tolerance;
bool _outerFacesFound;
std::set<const SMDS_MeshElement*> _outerFaces; // empty means "no internal faces at all"
SMESH_ElementSearcherImpl( SMDS_Mesh& mesh,
double tol=-1,
SMDS_ElemIteratorPtr elemIt=SMDS_ElemIteratorPtr())
: _mesh(&mesh),_meshPartIt(elemIt),_nodeSearcher(0),_tolerance(tol),_outerFacesFound(false)
{
for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
{
_ebbTree[i] = NULL;
_ebbTreeHeight[i] = -1;
}
_elementType = SMDSAbs_All;
}
virtual ~SMESH_ElementSearcherImpl()
{
for ( int i = 0; i < SMDSAbs_NbElementTypes; ++i )
{
delete _ebbTree[i]; _ebbTree[i] = NULL;
}
if ( _nodeSearcher ) delete _nodeSearcher; _nodeSearcher = 0;
}
virtual int FindElementsByPoint(const gp_Pnt& point,
SMDSAbs_ElementType type,
std::vector< const SMDS_MeshElement* >& foundElements);
virtual TopAbs_State GetPointState(const gp_Pnt& point);
virtual const SMDS_MeshElement* FindClosestTo( const gp_Pnt& point,
SMDSAbs_ElementType type );
virtual void GetElementsNearLine( const gp_Ax1& line,
SMDSAbs_ElementType type,
std::vector< const SMDS_MeshElement* >& foundElems);
virtual void GetElementsInSphere( const gp_XYZ& center,
const double radius,
SMDSAbs_ElementType type,
std::vector< const SMDS_MeshElement* >& foundElems);
virtual void GetElementsInBox( const Bnd_B3d& box,
SMDSAbs_ElementType type,
std::vector< const SMDS_MeshElement* >& foundElems);
virtual gp_XYZ Project(const gp_Pnt& point,
SMDSAbs_ElementType type,
const SMDS_MeshElement** closestElem);
double getTolerance();
bool getIntersParamOnLine(const gp_Lin& line, const SMDS_MeshElement* face,
const double tolerance, double & param);
void findOuterBoundary(const SMDS_MeshElement* anyOuterFace);
bool isOuterBoundary(const SMDS_MeshElement* face) const
{
return _outerFaces.empty() || _outerFaces.count(face);
}
int getTreeHeight()
{
if ( _ebbTreeHeight[ _elementType ] < 0 )
_ebbTreeHeight[ _elementType ] = _ebbTree[ _elementType ]->getHeight();
return _ebbTreeHeight[ _elementType ];
}
struct TInters //!< data of intersection of the line and the mesh face (used in GetPointState())
{
const SMDS_MeshElement* _face;
gp_Vec _faceNorm;
bool _coincides; //!< the line lays in face plane
TInters(const SMDS_MeshElement* face, const gp_Vec& faceNorm, bool coinc=false)
: _face(face), _faceNorm( faceNorm ), _coincides( coinc ) {}
};
struct TFaceLink //!< link and faces sharing it (used in findOuterBoundary())
{
SMESH_TLink _link;
TIDSortedElemSet _faces;
TFaceLink( const SMDS_MeshNode* n1, const SMDS_MeshNode* n2, const SMDS_MeshElement* face)
: _link( n1, n2 ), _faces( &face, &face + 1) {}
};
};
ostream& operator<< (ostream& out, const SMESH_ElementSearcherImpl::TInters& i)
{
return out << "TInters(face=" << ( i._face ? i._face->GetID() : 0)
<< ", _coincides="<<i._coincides << ")";
}
//=======================================================================
/*!
* \brief define tolerance for search
*/
//=======================================================================
double SMESH_ElementSearcherImpl::getTolerance()
{
if ( _tolerance < 0 )
{
const SMDS_MeshInfo& meshInfo = _mesh->GetMeshInfo();
_tolerance = 0;
if ( _nodeSearcher && meshInfo.NbNodes() > 1 )
{
double boxSize = _nodeSearcher->getTree()->maxSize();
_tolerance = 1e-8 * boxSize/* / meshInfo.NbNodes()*/;
}
else if ( _ebbTree[_elementType] && meshInfo.NbElements() > 0 )
{
double boxSize = _ebbTree[_elementType]->maxSize();
_tolerance = 1e-8 * boxSize/* / meshInfo.NbElements()*/;
}
if ( _tolerance == 0 )
{
// define tolerance by size of a most complex element
int complexType = SMDSAbs_Volume;
while ( complexType > SMDSAbs_All &&
meshInfo.NbElements( SMDSAbs_ElementType( complexType )) < 1 )
--complexType;
if ( complexType == SMDSAbs_All ) return 0; // empty mesh
double elemSize;
if ( complexType == int( SMDSAbs_Node ))
{
SMDS_NodeIteratorPtr nodeIt = _mesh->nodesIterator();
elemSize = 1;
if ( meshInfo.NbNodes() > 2 )
elemSize = SMESH_TNodeXYZ( nodeIt->next() ).Distance( nodeIt->next() );
}
else
{
SMDS_ElemIteratorPtr elemIt = _mesh->elementsIterator( SMDSAbs_ElementType( complexType ));
const SMDS_MeshElement* elem = elemIt->next();
SMDS_ElemIteratorPtr nodeIt = elem->nodesIterator();
SMESH_TNodeXYZ n1( nodeIt->next() );
elemSize = 0;
while ( nodeIt->more() )
{
double dist = n1.Distance( static_cast<const SMDS_MeshNode*>( nodeIt->next() ));
elemSize = std::max( dist, elemSize );
}
}
_tolerance = 1e-4 * elemSize;
}
}
return _tolerance;
}
//================================================================================
/*!
* \brief Find intersection of the line and an edge of face and return parameter on line
*/
//================================================================================
bool SMESH_ElementSearcherImpl::getIntersParamOnLine(const gp_Lin& line,
const SMDS_MeshElement* face,
const double tol,
double & param)
{
int nbInts = 0;
param = 0;
GeomAPI_ExtremaCurveCurve anExtCC;
Handle(Geom_Curve) lineCurve = new Geom_Line( line );
int nbNodes = face->IsQuadratic() ? face->NbNodes()/2 : face->NbNodes();
for ( int i = 0; i < nbNodes && nbInts < 2; ++i )
{
GC_MakeSegment edge( SMESH_TNodeXYZ( face->GetNode( i )),
SMESH_TNodeXYZ( face->GetNode( (i+1)%nbNodes) ));
anExtCC.Init( lineCurve, edge.Value() );
if ( anExtCC.NbExtrema() > 0 && anExtCC.LowerDistance() <= tol)
{
Standard_Real pl, pe;
anExtCC.LowerDistanceParameters( pl, pe );
param += pl;
if ( ++nbInts == 2 )
break;
}
}
if ( nbInts > 0 ) param /= nbInts;
return nbInts > 0;
}
//================================================================================
/*!
* \brief Find all faces belonging to the outer boundary of mesh
*/
//================================================================================
void SMESH_ElementSearcherImpl::findOuterBoundary(const SMDS_MeshElement* outerFace)
{
if ( _outerFacesFound ) return;
// Collect all outer faces by passing from one outer face to another via their links
// and BTW find out if there are internal faces at all.
// checked links and links where outer boundary meets internal one
std::set< SMESH_TLink > visitedLinks, seamLinks;
// links to treat with already visited faces sharing them
std::list < TFaceLink > startLinks;
// load startLinks with the first outerFace
startLinks.push_back( TFaceLink( outerFace->GetNode(0), outerFace->GetNode(1), outerFace));
_outerFaces.insert( outerFace );
TIDSortedElemSet emptySet;
while ( !startLinks.empty() )
{
const SMESH_TLink& link = startLinks.front()._link;
TIDSortedElemSet& faces = startLinks.front()._faces;
outerFace = *faces.begin();
// find other faces sharing the link
const SMDS_MeshElement* f;
while (( f = SMESH_MeshAlgos::FindFaceInSet(link.node1(), link.node2(), emptySet, faces )))
faces.insert( f );
// select another outer face among the found
const SMDS_MeshElement* outerFace2 = 0;
if ( faces.size() == 2 )
{
outerFace2 = (outerFace == *faces.begin() ? *faces.rbegin() : *faces.begin());
}
else if ( faces.size() > 2 )
{
seamLinks.insert( link );
// link direction within the outerFace
gp_Vec n1n2( SMESH_TNodeXYZ( link.node1()),
SMESH_TNodeXYZ( link.node2()));
int i1 = outerFace->GetNodeIndex( link.node1() );
int i2 = outerFace->GetNodeIndex( link.node2() );
bool rev = ( abs(i2-i1) == 1 ? i1 > i2 : i2 > i1 );
if ( rev ) n1n2.Reverse();
// outerFace normal
gp_XYZ ofNorm, fNorm;
if ( SMESH_MeshAlgos::FaceNormal( outerFace, ofNorm, /*normalized=*/false ))
{
// direction from the link inside outerFace
gp_Vec dirInOF = gp_Vec( ofNorm ) ^ n1n2;
// sort all other faces by angle with the dirInOF
std::map< double, const SMDS_MeshElement* > angle2Face;
std::set< const SMDS_MeshElement*, TIDCompare >::const_iterator face = faces.begin();
for ( ; face != faces.end(); ++face )
{
if ( *face == outerFace ) continue;
if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false ))
continue;
gp_Vec dirInF = gp_Vec( fNorm ) ^ n1n2;
double angle = dirInOF.AngleWithRef( dirInF, n1n2 );
if ( angle < 0 ) angle += 2. * M_PI;
angle2Face.insert( std::make_pair( angle, *face ));
}
if ( !angle2Face.empty() )
outerFace2 = angle2Face.begin()->second;
}
}
// store the found outer face and add its links to continue searching from
if ( outerFace2 )
{
_outerFaces.insert( outerFace2 );
int nbNodes = outerFace2->NbCornerNodes();
for ( int i = 0; i < nbNodes; ++i )
{
SMESH_TLink link2( outerFace2->GetNode(i), outerFace2->GetNode((i+1)%nbNodes));
if ( visitedLinks.insert( link2 ).second )
startLinks.push_back( TFaceLink( link2.node1(), link2.node2(), outerFace2 ));
}
}
startLinks.pop_front();
}
_outerFacesFound = true;
if ( !seamLinks.empty() )
{
// There are internal boundaries touching the outher one,
// find all faces of internal boundaries in order to find
// faces of boundaries of holes, if any.
}
else
{
_outerFaces.clear();
}
}
//=======================================================================
/*!
* \brief Find elements of given type where the given point is IN or ON.
* Returns nb of found elements and elements them-selves.
*
* 'ALL' type means elements of any type excluding nodes, balls and 0D elements
*/
//=======================================================================
int SMESH_ElementSearcherImpl::
FindElementsByPoint(const gp_Pnt& point,
SMDSAbs_ElementType type,
std::vector< const SMDS_MeshElement* >& foundElements)
{
foundElements.clear();
_elementType = type;
double tolerance = getTolerance();
// =================================================================================
if ( type == SMDSAbs_Node || type == SMDSAbs_0DElement || type == SMDSAbs_Ball)
{
if ( !_nodeSearcher )
{
if ( _meshPartIt )
_nodeSearcher = new SMESH_NodeSearcherImpl( 0, _meshPartIt );
else
_nodeSearcher = new SMESH_NodeSearcherImpl( _mesh );
}
std::vector< const SMDS_MeshNode* > foundNodes;
_nodeSearcher->FindNearPoint( point, tolerance, foundNodes );
if ( type == SMDSAbs_Node )
{
foundElements.assign( foundNodes.begin(), foundNodes.end() );
}
else
{
for ( size_t i = 0; i < foundNodes.size(); ++i )
{
SMDS_ElemIteratorPtr elemIt = foundNodes[i]->GetInverseElementIterator( type );
while ( elemIt->more() )
foundElements.push_back( elemIt->next() );
}
}
}
// =================================================================================
else // elements more complex than 0D
{
if ( !_ebbTree[type] )
{
_ebbTree[_elementType] = new ElementBndBoxTree( *_mesh, type, _meshPartIt, tolerance );
}
ElementBndBoxTree::TElemSeq suspectElems;
_ebbTree[ type ]->getElementsNearPoint( point, suspectElems );
ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
for ( ; elem != suspectElems.end(); ++elem )
if ( !SMESH_MeshAlgos::IsOut( *elem, point, tolerance ))
foundElements.push_back( *elem );
}
return foundElements.size();
}
//=======================================================================
/*!
* \brief Find an element of given type most close to the given point
*
* WARNING: Only face search is implemeneted so far
*/
//=======================================================================
const SMDS_MeshElement*
SMESH_ElementSearcherImpl::FindClosestTo( const gp_Pnt& point,
SMDSAbs_ElementType type )
{
const SMDS_MeshElement* closestElem = 0;
_elementType = type;
if ( type == SMDSAbs_Face ||
type == SMDSAbs_Volume ||
type == SMDSAbs_Edge )
{
ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
if ( !ebbTree )
ebbTree = new ElementBndBoxTree( *_mesh, type, _meshPartIt );
ElementBndBoxTree::TElemSeq suspectElems;
ebbTree->getElementsNearPoint( point, suspectElems );
if ( suspectElems.empty() && ebbTree->maxSize() > 0 )
{
gp_Pnt boxCenter = 0.5 * ( ebbTree->getBox()->CornerMin() +
ebbTree->getBox()->CornerMax() );
double radius = -1;
if ( ebbTree->getBox()->IsOut( point.XYZ() ))
radius = point.Distance( boxCenter ) - 0.5 * ebbTree->maxSize();
if ( radius < 0 )
radius = ebbTree->maxSize() / pow( 2., getTreeHeight()) / 2;
while ( suspectElems.empty() && radius < 1e100 )
{
ebbTree->getElementsInSphere( point.XYZ(), radius, suspectElems );
radius *= 1.1;
}
}
double minDist = std::numeric_limits<double>::max();
std::multimap< double, const SMDS_MeshElement* > dist2face;
ElementBndBoxTree::TElemSeq::iterator elem = suspectElems.begin();
for ( ; elem != suspectElems.end(); ++elem )
{
double dist = SMESH_MeshAlgos::GetDistance( *elem, point );
if ( dist < minDist + 1e-10)
{
minDist = dist;
dist2face.insert( dist2face.begin(), std::make_pair( dist, *elem ));
}
}
if ( !dist2face.empty() )
{
std::multimap< double, const SMDS_MeshElement* >::iterator d2f = dist2face.begin();
closestElem = d2f->second;
// if there are several elements at the same distance, select one
// with GC closest to the point
typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
double minDistToGC = 0;
for ( ++d2f; d2f != dist2face.end() && fabs( d2f->first - minDist ) < 1e-10; ++d2f )
{
if ( minDistToGC == 0 )
{
gp_XYZ gc(0,0,0);
gc = accumulate( TXyzIterator(closestElem->nodesIterator()),
TXyzIterator(), gc ) / closestElem->NbNodes();
minDistToGC = point.SquareDistance( gc );
}
gp_XYZ gc(0,0,0);
gc = accumulate( TXyzIterator( d2f->second->nodesIterator()),
TXyzIterator(), gc ) / d2f->second->NbNodes();
double d = point.SquareDistance( gc );
if ( d < minDistToGC )
{
minDistToGC = d;
closestElem = d2f->second;
}
}
// cout << "FindClosestTo( " <<point.X()<<", "<<point.Y()<<", "<<point.Z()<<" ) FACE "
// <<closestElem->GetID() << " DIST " << minDist << endl;
}
}
else
{
// NOT IMPLEMENTED SO FAR
}
return closestElem;
}
//================================================================================
/*!
* \brief Classify the given point in the closed 2D mesh
*/
//================================================================================
TopAbs_State SMESH_ElementSearcherImpl::GetPointState(const gp_Pnt& point)
{
_elementType = SMDSAbs_Face;
double tolerance = getTolerance();
ElementBndBoxTree*& ebbTree = _ebbTree[ SMDSAbs_Face ];
if ( !ebbTree )
ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
// Algo: analyse transition of a line starting at the point through mesh boundary;
// try three lines parallel to axis of the coordinate system and perform rough
// analysis. If solution is not clear perform thorough analysis.
const int nbAxes = 3;
gp_Dir axisDir[ nbAxes ] = { gp::DX(), gp::DY(), gp::DZ() };
std::map< double, TInters > paramOnLine2TInters[ nbAxes ];
std::list< TInters > tangentInters[ nbAxes ]; // of faces whose plane includes the line
std::multimap< int, int > nbInt2Axis; // to find the simplest case
for ( int axis = 0; axis < nbAxes; ++axis )
{
gp_Ax1 lineAxis( point, axisDir[axis]);
gp_Lin line ( lineAxis );
ElementBndBoxTree::TElemSeq suspectFaces; // faces possibly intersecting the line
ebbTree->getElementsNearLine( lineAxis, suspectFaces );
// Intersect faces with the line
std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
ElementBndBoxTree::TElemSeq::iterator face = suspectFaces.begin();
for ( ; face != suspectFaces.end(); ++face )
{
// get face plane
gp_XYZ fNorm;
if ( !SMESH_MeshAlgos::FaceNormal( *face, fNorm, /*normalized=*/false)) continue;
gp_Pln facePlane( SMESH_TNodeXYZ( (*face)->GetNode(0)), fNorm );
// perform intersection
IntAna_IntConicQuad intersection( line, IntAna_Quadric( facePlane ));
if ( !intersection.IsDone() )
continue;
if ( intersection.IsInQuadric() )
{
tangentInters[ axis ].push_back( TInters( *face, fNorm, true ));
}
else if ( ! intersection.IsParallel() && intersection.NbPoints() > 0 )
{
double tol = 1e-4 * Sqrt( fNorm.Modulus() );
gp_Pnt intersectionPoint = intersection.Point(1);
if ( !SMESH_MeshAlgos::IsOut( *face, intersectionPoint, tol ))
u2inters.insert( std::make_pair( intersection.ParamOnConic(1), TInters( *face, fNorm )));
}
}
// Analyse intersections roughly
int nbInter = u2inters.size();
if ( nbInter == 0 )
return TopAbs_OUT;
double f = u2inters.begin()->first, l = u2inters.rbegin()->first;
if ( nbInter == 1 ) // not closed mesh
return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
return TopAbs_ON;
if ( (f<0) == (l<0) )
return TopAbs_OUT;
int nbIntBeforePoint = std::distance( u2inters.begin(), u2inters.lower_bound(0));
int nbIntAfterPoint = nbInter - nbIntBeforePoint;
if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
return TopAbs_IN;
nbInt2Axis.insert( std::make_pair( std::min( nbIntBeforePoint, nbIntAfterPoint ), axis ));
if ( _outerFacesFound ) break; // pass to thorough analysis
} // three attempts - loop on CS axes
// Analyse intersections thoroughly.
// We make two loops maximum, on the first one we only exclude touching intersections,
// on the second, if situation is still unclear, we gather and use information on
// position of faces (internal or outer). If faces position is already gathered,
// we make the second loop right away.
for ( int hasPositionInfo = _outerFacesFound; hasPositionInfo < 2; ++hasPositionInfo )
{
std::multimap< int, int >::const_iterator nb_axis = nbInt2Axis.begin();
for ( ; nb_axis != nbInt2Axis.end(); ++nb_axis )
{
int axis = nb_axis->second;
std::map< double, TInters > & u2inters = paramOnLine2TInters[ axis ];
gp_Ax1 lineAxis( point, axisDir[axis]);
gp_Lin line ( lineAxis );
// add tangent intersections to u2inters
double param;
std::list< TInters >::const_iterator tgtInt = tangentInters[ axis ].begin();
for ( ; tgtInt != tangentInters[ axis ].end(); ++tgtInt )
if ( getIntersParamOnLine( line, tgtInt->_face, tolerance, param ))
u2inters.insert( std::make_pair( param, *tgtInt ));
tangentInters[ axis ].clear();
// Count intersections before and after the point excluding touching ones.
// If hasPositionInfo we count intersections of outer boundary only
int nbIntBeforePoint = 0, nbIntAfterPoint = 0;
double f = std::numeric_limits<double>::max(), l = -std::numeric_limits<double>::max();
std::map< double, TInters >::iterator u_int1 = u2inters.begin(), u_int2 = u_int1;
bool ok = ! u_int1->second._coincides;
while ( ok && u_int1 != u2inters.end() )
{
double u = u_int1->first;
bool touchingInt = false;
if ( ++u_int2 != u2inters.end() )
{
// skip intersections at the same point (if the line passes through edge or node)
int nbSamePnt = 0;
while ( u_int2 != u2inters.end() && fabs( u_int2->first - u ) < tolerance )
{
++nbSamePnt;
++u_int2;
}
// skip tangent intersections
int nbTgt = 0;
if ( u_int2 != u2inters.end() )
{
const SMDS_MeshElement* prevFace = u_int1->second._face;
while ( ok && u_int2->second._coincides )
{
if ( SMESH_MeshAlgos::GetCommonNodes(prevFace , u_int2->second._face).empty() )
ok = false;
else
{
nbTgt++;
u_int2++;
ok = ( u_int2 != u2inters.end() );
}
}
}
if ( !ok ) break;
// skip intersections at the same point after tangent intersections
if ( nbTgt > 0 )
{
double u2 = u_int2->first;
++u_int2;
while ( u_int2 != u2inters.end() && fabs( u_int2->first - u2 ) < tolerance )
{
++nbSamePnt;
++u_int2;
}
}
// decide if we skipped a touching intersection
if ( nbSamePnt + nbTgt > 0 )
{
double minDot = std::numeric_limits<double>::max(), maxDot = -minDot;
std::map< double, TInters >::iterator u_int = u_int1;
for ( ; u_int != u_int2; ++u_int )
{
if ( u_int->second._coincides ) continue;
double dot = u_int->second._faceNorm * line.Direction();
if ( dot > maxDot ) maxDot = dot;
if ( dot < minDot ) minDot = dot;
}
touchingInt = ( minDot*maxDot < 0 );
}
}
if ( !touchingInt )
{
if ( !hasPositionInfo || isOuterBoundary( u_int1->second._face ))
{
if ( u < 0 )
++nbIntBeforePoint;
else
++nbIntAfterPoint;
}
if ( u < f ) f = u;
if ( u > l ) l = u;
}
u_int1 = u_int2; // to next intersection
} // loop on intersections with one line
if ( ok )
{
if ( fabs( f ) < tolerance || fabs( l ) < tolerance )
return TopAbs_ON;
if ( nbIntBeforePoint == 0 || nbIntAfterPoint == 0)
return TopAbs_OUT;
if ( nbIntBeforePoint + nbIntAfterPoint == 1 ) // not closed mesh
return fabs( f ) < tolerance ? TopAbs_ON : TopAbs_UNKNOWN;
if ( nbIntBeforePoint == 1 || nbIntAfterPoint == 1 )
return TopAbs_IN;
if ( (f<0) == (l<0) )
return TopAbs_OUT;
if ( hasPositionInfo )
return nbIntBeforePoint % 2 ? TopAbs_IN : TopAbs_OUT;
}
} // loop on intersections of the tree lines - thorough analysis
if ( !hasPositionInfo )
{
// gather info on faces position - is face in the outer boundary or not
std::map< double, TInters > & u2inters = paramOnLine2TInters[ 0 ];
findOuterBoundary( u2inters.begin()->second._face );
}
} // two attempts - with and w/o faces position info in the mesh
return TopAbs_UNKNOWN;
}
//=======================================================================
/*!
* \brief Return elements possibly intersecting the line
*/
//=======================================================================
void SMESH_ElementSearcherImpl::
GetElementsNearLine( const gp_Ax1& line,
SMDSAbs_ElementType type,
std::vector< const SMDS_MeshElement* >& foundElems)
{
_elementType = type;
ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
if ( !ebbTree )
ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
ElementBndBoxTree::TElemSeq elems;
ebbTree->getElementsNearLine( line, elems );
foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
}
//=======================================================================
/*
* Return elements whose bounding box intersects a sphere
*/
//=======================================================================
void SMESH_ElementSearcherImpl::
GetElementsInSphere( const gp_XYZ& center,
const double radius,
SMDSAbs_ElementType type,
std::vector< const SMDS_MeshElement* >& foundElems)
{
_elementType = type;
ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
if ( !ebbTree )
ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
ElementBndBoxTree::TElemSeq elems;
ebbTree->getElementsInSphere( center, radius, elems );
foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
}
//=======================================================================
/*
* Return elements whose bounding box intersects a given bounding box
*/
//=======================================================================
void SMESH_ElementSearcherImpl::
GetElementsInBox( const Bnd_B3d& box,
SMDSAbs_ElementType type,
std::vector< const SMDS_MeshElement* >& foundElems)
{
_elementType = type;
ElementBndBoxTree*& ebbTree = _ebbTree[ type ];
if ( !ebbTree )
ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt, getTolerance() );
ElementBndBoxTree::TElemSeq elems;
ebbTree->getElementsInBox( box, elems );
foundElems.insert( foundElems.end(), elems.begin(), elems.end() );
}
//=======================================================================
/*
* \brief Return a projection of a given point to a mesh.
* Optionally return the closest element
*/
//=======================================================================
gp_XYZ SMESH_ElementSearcherImpl::Project(const gp_Pnt& point,
SMDSAbs_ElementType type,
const SMDS_MeshElement** closestElem)
{
_elementType = type;
if ( _mesh->GetMeshInfo().NbElements( _elementType ) == 0 )
throw SALOME_Exception( LOCALIZED( "No elements of given type in the mesh" ));
ElementBndBoxTree*& ebbTree = _ebbTree[ _elementType ];
if ( !ebbTree )
ebbTree = new ElementBndBoxTree( *_mesh, _elementType, _meshPartIt );
gp_XYZ p = point.XYZ();
ElementBndBoxTree* ebbLeaf = ebbTree->getLeafAtPoint( p );
const Bnd_B3d* box = ebbLeaf ? ebbLeaf->getBox() : ebbTree->getBox();
double radius = ( box->CornerMax() - box->CornerMin() ).Modulus();
ElementBndBoxTree::TElemSeq elems;
ebbTree->getElementsInSphere( p, radius, elems );
while ( elems.empty() && radius < 1e100 )
{
radius *= 1.5;
ebbTree->getElementsInSphere( p, radius, elems );
}
gp_XYZ proj, bestProj;
const SMDS_MeshElement* elem = 0;
double minDist = 2 * radius;
ElementBndBoxTree::TElemSeq::iterator e = elems.begin();
for ( ; e != elems.end(); ++e )
{
double d = SMESH_MeshAlgos::GetDistance( *e, point, &proj );
if ( d < minDist )
{
bestProj = proj;
elem = *e;
minDist = d;
}
}
if ( closestElem ) *closestElem = elem;
return bestProj;
}
//=======================================================================
/*!
* \brief Return true if the point is IN or ON of the element
*/
//=======================================================================
bool SMESH_MeshAlgos::IsOut( const SMDS_MeshElement* element, const gp_Pnt& point, double tol )
{
if ( element->GetType() == SMDSAbs_Volume)
{
return SMDS_VolumeTool( element ).IsOut( point.X(), point.Y(), point.Z(), tol );
}
// get ordered nodes
std::vector< SMESH_TNodeXYZ > xyz; xyz.reserve( element->NbNodes()+1 );
SMDS_NodeIteratorPtr nodeIt = element->interlacedNodesIterator();
for ( int i = 0; nodeIt->more(); ++i )
xyz.push_back( SMESH_TNodeXYZ( nodeIt->next() ));
int i, nbNodes = (int) xyz.size(); // central node of biquadratic is missing
if ( element->GetType() == SMDSAbs_Face ) // --------------------------------------------------
{
// compute face normal
gp_Vec faceNorm(0,0,0);
xyz.push_back( xyz.front() );
for ( i = 0; i < nbNodes; ++i )
{
gp_Vec edge1( xyz[i+1], xyz[i]);
gp_Vec edge2( xyz[i+1], xyz[(i+2)%nbNodes] );
faceNorm += edge1 ^ edge2;
}
double fNormSize = faceNorm.Magnitude();
if ( fNormSize <= tol )
{
// degenerated face: point is out if it is out of all face edges
for ( i = 0; i < nbNodes; ++i )
{
SMDS_LinearEdge edge( xyz[i]._node, xyz[i+1]._node );
if ( !IsOut( &edge, point, tol ))
return false;
}
return true;
}
faceNorm /= fNormSize;
// check if the point lays on face plane
gp_Vec n2p( xyz[0], point );
double dot = n2p * faceNorm;
if ( Abs( dot ) > tol ) // not on face plane
{
bool isOut = true;
if ( nbNodes > 3 ) // maybe the face is not planar
{
double elemThick = 0;
for ( i = 1; i < nbNodes; ++i )
{
gp_Vec n2n( xyz[0], xyz[i] );
elemThick = Max( elemThick, Abs( n2n * faceNorm ));
}
isOut = Abs( dot ) > elemThick + tol;
}
if ( isOut )
return isOut;
}
// check if point is out of face boundary:
// define it by closest transition of a ray point->infinity through face boundary
// on the face plane.
// First, find normal of a plane perpendicular to face plane, to be used as a cutting tool
// to find intersections of the ray with the boundary.
gp_Vec ray = n2p;
gp_Vec plnNorm = ray ^ faceNorm;
double n2pSize = plnNorm.Magnitude();
if ( n2pSize <= tol ) return false; // point coincides with the first node
if ( n2pSize * n2pSize > fNormSize * 100 ) return true; // point is very far
plnNorm /= n2pSize;
// for each node of the face, compute its signed distance to the cutting plane
std::vector<double> dist( nbNodes + 1);
for ( i = 0; i < nbNodes; ++i )
{
gp_Vec n2p( xyz[i], point );
dist[i] = n2p * plnNorm;
}
dist.back() = dist.front();
// find the closest intersection
int iClosest = -1;
double rClosest = 0, distClosest = 1e100;
gp_Pnt pClosest;
for ( i = 0; i < nbNodes; ++i )
{
double r;
if ( fabs( dist[i] ) < tol )
r = 0.;
else if ( fabs( dist[i+1]) < tol )
r = 1.;
else if ( dist[i] * dist[i+1] < 0 )
r = dist[i] / ( dist[i] - dist[i+1] );
else
continue; // no intersection
gp_Pnt pInt = xyz[i] * (1.-r) + xyz[i+1] * r;
gp_Vec p2int( point, pInt);
double intDist = p2int.SquareMagnitude();
if ( intDist < distClosest )
{
iClosest = i;
rClosest = r;
pClosest = pInt;
distClosest = intDist;
}
}
if ( iClosest < 0 )
return true; // no intesections - out
// analyse transition
gp_Vec edge( xyz[iClosest], xyz[iClosest+1] );
gp_Vec edgeNorm = -( edge ^ faceNorm ); // normal to intersected edge pointing out of face
gp_Vec p2int ( point, pClosest );
bool out = (edgeNorm * p2int) < -tol;
if ( rClosest > 0. && rClosest < 1. ) // not node intersection
return out;
// the ray passes through a face node; analyze transition through an adjacent edge
gp_Pnt p1 = xyz[ (rClosest == 0.) ? ((iClosest+nbNodes-1) % nbNodes) : (iClosest+1) ];
gp_Pnt p2 = xyz[ (rClosest == 0.) ? iClosest : ((iClosest+2) % nbNodes) ];
gp_Vec edgeAdjacent( p1, p2 );
gp_Vec edgeNorm2 = -( edgeAdjacent ^ faceNorm );
bool out2 = (edgeNorm2 * p2int) < -tol;
bool covexCorner = ( edgeNorm * edgeAdjacent * (rClosest==1. ? 1. : -1.)) < 0;
return covexCorner ? (out || out2) : (out && out2);
}
if ( element->GetType() == SMDSAbs_Edge ) // --------------------------------------------------
{
// point is out of edge if it is NOT ON any straight part of edge
// (we consider quadratic edge as being composed of two straight parts)
for ( i = 1; i < nbNodes; ++i )
{
gp_Vec edge( xyz[i-1], xyz[i] );
gp_Vec n1p ( xyz[i-1], point );
double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
if ( u <= 0. ) {
if ( n1p.SquareMagnitude() < tol * tol )
return false;
continue;
}
if ( u >= 1. ) {
if ( point.SquareDistance( xyz[i] ) < tol * tol )
return false;
continue;
}
gp_XYZ proj = ( 1. - u ) * xyz[i-1] + u * xyz[i]; // projection of the point on the edge
double dist2 = point.SquareDistance( proj );
if ( dist2 > tol * tol )
continue;
return false; // point is ON this part
}
return true;
}
// Node or 0D element -------------------------------------------------------------------------
{
gp_Vec n2p ( xyz[0], point );
return n2p.SquareMagnitude() > tol * tol;
}
return true;
}
//=======================================================================
namespace
{
// Position of a point relative to a segment
// . .
// . LEFT .
// . .
// VERTEX 1 o----ON-----> VERTEX 2
// . .
// . RIGHT .
// . .
enum PositionName { POS_LEFT = 1, POS_VERTEX = 2, POS_RIGHT = 4, //POS_ON = 8,
POS_ALL = POS_LEFT | POS_RIGHT | POS_VERTEX,
POS_MAX = POS_RIGHT };
struct PointPos
{
PositionName _name;
int _index; // index of vertex or segment
PointPos( PositionName n, int i=-1 ): _name(n), _index(i) {}
bool operator < (const PointPos& other ) const
{
if ( _name == other._name )
return ( _index < 0 || other._index < 0 ) ? false : _index < other._index;
return _name < other._name;
}
};
//================================================================================
/*!
* \brief Return position of a point relative to a segment
* \param point2D - the point to analyze position of
* \param segEnds - end points of segments
* \param index0 - 0-based index of the first point of segment
* \param posToFindOut - flags of positions to detect
* \retval PointPos - point position
*/
//================================================================================
PointPos getPointPosition( const gp_XY& point2D,
const gp_XY* segEnds,
const int index0 = 0,
const int posToFindOut = POS_ALL)
{
const gp_XY& p1 = segEnds[ index0 ];
const gp_XY& p2 = segEnds[ index0+1 ];
const gp_XY grad = p2 - p1;
if ( posToFindOut & POS_VERTEX )
{
// check if the point2D is at "vertex 1" zone
gp_XY pp1[2] = { p1, gp_XY( p1.X() - grad.Y(),
p1.Y() + grad.X() ) };
if ( getPointPosition( point2D, pp1, 0, POS_LEFT|POS_RIGHT )._name == POS_LEFT )
return PointPos( POS_VERTEX, index0 );
// check if the point2D is at "vertex 2" zone
gp_XY pp2[2] = { p2, gp_XY( p2.X() - grad.Y(),
p2.Y() + grad.X() ) };
if ( getPointPosition( point2D, pp2, 0, POS_LEFT|POS_RIGHT )._name == POS_RIGHT )
return PointPos( POS_VERTEX, index0 + 1);
}
double edgeEquation =
( point2D.X() - p1.X() ) * grad.Y() - ( point2D.Y() - p1.Y() ) * grad.X();
return PointPos( edgeEquation < 0 ? POS_LEFT : POS_RIGHT, index0 );
}
}
//=======================================================================
/*!
* \brief Return minimal distance from a point to an element
*
* Currently we ignore non-planarity and 2nd order of face
*/
//=======================================================================
double SMESH_MeshAlgos::GetDistance( const SMDS_MeshElement* elem,
const gp_Pnt& point,
gp_XYZ* closestPnt )
{
switch ( elem->GetType() )
{
case SMDSAbs_Volume:
return GetDistance( static_cast<const SMDS_MeshVolume*>( elem ), point, closestPnt );
case SMDSAbs_Face:
return GetDistance( static_cast<const SMDS_MeshFace*>( elem ), point, closestPnt );
case SMDSAbs_Edge:
return GetDistance( static_cast<const SMDS_MeshEdge*>( elem ), point, closestPnt );
case SMDSAbs_Node:
if ( closestPnt ) *closestPnt = SMESH_TNodeXYZ( elem );
return point.Distance( SMESH_TNodeXYZ( elem ));
default:;
}
return -1;
}
//=======================================================================
/*!
* \brief Return minimal distance from a point to a face
*
* Currently we ignore non-planarity and 2nd order of face
*/
//=======================================================================
double SMESH_MeshAlgos::GetDistance( const SMDS_MeshFace* face,
const gp_Pnt& point,
gp_XYZ* closestPnt )
{
const double badDistance = -1;
if ( !face ) return badDistance;
int nbCorners = face->NbCornerNodes();
if ( nbCorners > 3 )
{
std::vector< const SMDS_MeshNode* > nodes;
int nbTria = SMESH_MeshAlgos::Triangulate().GetTriangles( face, nodes );
double minDist = Precision::Infinite();
gp_XYZ cp;
for ( int i = 0; i < 3 * nbTria; i += 3 )
{
SMDS_FaceOfNodes triangle( nodes[i], nodes[i+1], nodes[i+2] );
double dist = GetDistance( &triangle, point, closestPnt );
if ( dist < minDist )
{
minDist = dist;
if ( closestPnt )
cp = *closestPnt;
}
}
if ( closestPnt )
*closestPnt = cp;
return minDist;
}
// coordinates of nodes (medium nodes, if any, ignored)
typedef SMDS_StdIterator< SMESH_TNodeXYZ, SMDS_ElemIteratorPtr > TXyzIterator;
std::vector<gp_XYZ> xyz( TXyzIterator( face->nodesIterator()), TXyzIterator() );
xyz.resize( 4 );
// transformation to get xyz[0] lies on the origin, xyz[1] lies on the Z axis,
// and xyz[2] lies in the XZ plane. This is to pass to 2D space on XZ plane.
gp_Trsf trsf;
gp_Vec OZ ( xyz[0], xyz[1] );
gp_Vec OX ( xyz[0], xyz[2] );
if ( OZ.Magnitude() < std::numeric_limits<double>::min() )
{
if ( xyz.size() < 4 ) return badDistance;
OZ = gp_Vec ( xyz[0], xyz[2] );
OX = gp_Vec ( xyz[0], xyz[3] );
}
gp_Ax3 tgtCS;
try {
tgtCS = gp_Ax3( xyz[0], OZ, OX );
}
catch ( Standard_Failure ) {
return badDistance;
}
trsf.SetTransformation( tgtCS );
// move all the nodes to 2D
std::vector<gp_XY> xy( xyz.size() );
for ( size_t i = 0; i < 3; ++i )
{
gp_XYZ p3d = xyz[i];
trsf.Transforms( p3d );
xy[i].SetCoord( p3d.X(), p3d.Z() );
}
xyz.back() = xyz.front();
xy.back() = xy.front();
// // move the point in 2D
gp_XYZ tmpPnt = point.XYZ();
trsf.Transforms( tmpPnt );
gp_XY point2D( tmpPnt.X(), tmpPnt.Z() );
// loop on edges of the face to analyze point position ralative to the face
std::vector< PointPos > pntPosByType[ POS_MAX + 1 ];
for ( size_t i = 1; i < xy.size(); ++i )
{
PointPos pos = getPointPosition( point2D, &xy[0], i-1 );
pntPosByType[ pos._name ].push_back( pos );
}
// compute distance
double dist = badDistance;
if ( pntPosByType[ POS_LEFT ].size() > 0 ) // point is most close to an edge
{
PointPos& pos = pntPosByType[ POS_LEFT ][0];
gp_Vec edge( xyz[ pos._index ], xyz[ pos._index+1 ]);
gp_Vec n1p ( xyz[ pos._index ], point );
double u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
gp_XYZ proj = xyz[ pos._index ] + u * edge.XYZ(); // projection on the edge
dist = point.Distance( proj );
if ( closestPnt ) *closestPnt = proj;
}
else if ( pntPosByType[ POS_RIGHT ].size() >= 2 ) // point is inside the face
{
dist = Abs( tmpPnt.Y() );
if ( closestPnt )
{
if ( dist < std::numeric_limits<double>::min() ) {
*closestPnt = point.XYZ();
}
else {
tmpPnt.SetY( 0 );
trsf.Inverted().Transforms( tmpPnt );
*closestPnt = tmpPnt;
}
}
}
else if ( pntPosByType[ POS_VERTEX ].size() > 0 ) // point is most close to a node
{
double minDist2 = Precision::Infinite();
for ( size_t i = 0; i < pntPosByType[ POS_VERTEX ].size(); ++i )
{
PointPos& pos = pntPosByType[ POS_VERTEX ][i];
double d2 = point.SquareDistance( xyz[ pos._index ]);
if ( minDist2 > d2 )
{
if ( closestPnt ) *closestPnt = xyz[ pos._index ];
minDist2 = d2;
}
}
dist = Sqrt( minDist2 );
}
return dist;
}
//=======================================================================
/*!
* \brief Return minimal distance from a point to an edge
*/
//=======================================================================
double SMESH_MeshAlgos::GetDistance( const SMDS_MeshEdge* seg,
const gp_Pnt& point,
gp_XYZ* closestPnt )
{
double dist = Precision::Infinite();
if ( !seg ) return dist;
int i = 0, nbNodes = seg->NbNodes();
std::vector< SMESH_TNodeXYZ > xyz( nbNodes );
for ( SMDS_NodeIteratorPtr nodeIt = seg->interlacedNodesIterator(); nodeIt->more(); i++ )
xyz[ i ].Set( nodeIt->next() );
for ( i = 1; i < nbNodes; ++i )
{
gp_Vec edge( xyz[i-1], xyz[i] );
gp_Vec n1p ( xyz[i-1], point );
double d, u = ( edge * n1p ) / edge.SquareMagnitude(); // param [0,1] on the edge
if ( u <= 0. ) {
if (( d = n1p.SquareMagnitude() ) < dist ) {
dist = d;
if ( closestPnt ) *closestPnt = xyz[i-1];
}
}
else if ( u >= 1. ) {
if (( d = point.SquareDistance( xyz[i] )) < dist ) {
dist = d;
if ( closestPnt ) *closestPnt = xyz[i];
}
}
else {
gp_XYZ proj = xyz[i-1] + u * edge.XYZ(); // projection of the point on the edge
if (( d = point.SquareDistance( proj )) < dist ) {
dist = d;
if ( closestPnt ) *closestPnt = proj;
}
}
}
return Sqrt( dist );
}
//=======================================================================
/*!
* \brief Return minimal distance from a point to a volume
*
* Currently we ignore non-planarity and 2nd order
*/
//=======================================================================
double SMESH_MeshAlgos::GetDistance( const SMDS_MeshVolume* volume,
const gp_Pnt& point,
gp_XYZ* closestPnt )
{
SMDS_VolumeTool vTool( volume );
vTool.SetExternalNormal();
const int iQ = volume->IsQuadratic() ? 2 : 1;
double n[3], bc[3];
double minDist = 1e100, dist;
gp_XYZ closeP = point.XYZ();
bool isOut = false;
for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
{
// skip a facet with normal not "looking at" the point
if ( !vTool.GetFaceNormal( iF, n[0], n[1], n[2] ) ||
!vTool.GetFaceBaryCenter( iF, bc[0], bc[1], bc[2] ))
continue;
gp_XYZ bcp = point.XYZ() - gp_XYZ( bc[0], bc[1], bc[2] );
if ( gp_XYZ( n[0], n[1], n[2] ) * bcp < -1e-12 )
continue;
// find distance to a facet
const SMDS_MeshNode** nodes = vTool.GetFaceNodes( iF );
switch ( vTool.NbFaceNodes( iF ) / iQ ) {
case 3:
{
SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ] );
dist = GetDistance( &tmpFace, point, closestPnt );
break;
}
case 4:
{
SMDS_FaceOfNodes tmpFace( nodes[0], nodes[ 1*iQ ], nodes[ 2*iQ ], nodes[ 3*iQ ]);
dist = GetDistance( &tmpFace, point, closestPnt );
break;
}
default:
std::vector<const SMDS_MeshNode *> nvec( nodes, nodes + vTool.NbFaceNodes( iF ));
SMDS_PolygonalFaceOfNodes tmpFace( nvec );
dist = GetDistance( &tmpFace, point, closestPnt );
}
if ( dist < minDist )
{
minDist = dist;
isOut = true;
if ( closestPnt ) closeP = *closestPnt;
}
}
if ( isOut )
{
if ( closestPnt ) *closestPnt = closeP;
return minDist;
}
return 0; // point is inside the volume
}
//================================================================================
/*!
* \brief Returns barycentric coordinates of a point within a triangle.
* A not returned bc2 = 1. - bc0 - bc1.
* The point lies within the triangle if ( bc0 >= 0 && bc1 >= 0 && bc0+bc1 <= 1 )
*/
//================================================================================
void SMESH_MeshAlgos::GetBarycentricCoords( const gp_XY& p,
const gp_XY& t0,
const gp_XY& t1,
const gp_XY& t2,
double & bc0,
double & bc1)
{
const double // matrix 2x2
T11 = t0.X()-t2.X(), T12 = t1.X()-t2.X(),
T21 = t0.Y()-t2.Y(), T22 = t1.Y()-t2.Y();
const double Tdet = T11*T22 - T12*T21; // matrix determinant
if ( Abs( Tdet ) < std::numeric_limits<double>::min() )
{
bc0 = bc1 = 2.;
return;
}
// matrix inverse
const double t11 = T22, t12 = -T12, t21 = -T21, t22 = T11;
// vector
const double r11 = p.X()-t2.X(), r12 = p.Y()-t2.Y();
// barycentric coordinates: multiply matrix by vector
bc0 = (t11 * r11 + t12 * r12)/Tdet;
bc1 = (t21 * r11 + t22 * r12)/Tdet;
}
//=======================================================================
//function : FindFaceInSet
//purpose : Return a face having linked nodes n1 and n2 and which is
// - not in avoidSet,
// - in elemSet provided that !elemSet.empty()
// i1 and i2 optionally returns indices of n1 and n2
//=======================================================================
const SMDS_MeshElement*
SMESH_MeshAlgos::FindFaceInSet(const SMDS_MeshNode* n1,
const SMDS_MeshNode* n2,
const TIDSortedElemSet& elemSet,
const TIDSortedElemSet& avoidSet,
int* n1ind,
int* n2ind)
{
int i1 = 0, i2 = 0;
const SMDS_MeshElement* face = 0;
SMDS_ElemIteratorPtr invElemIt = n1->GetInverseElementIterator(SMDSAbs_Face);
while ( invElemIt->more() && !face ) // loop on inverse faces of n1
{
const SMDS_MeshElement* elem = invElemIt->next();
if (avoidSet.count( elem ))
continue;
if ( !elemSet.empty() && !elemSet.count( elem ))
continue;
// index of n1
i1 = elem->GetNodeIndex( n1 );
// find a n2 linked to n1
int nbN = elem->IsQuadratic() ? elem->NbNodes()/2 : elem->NbNodes();
for ( int di = -1; di < 2 && !face; di += 2 )
{
i2 = (i1+di+nbN) % nbN;
if ( elem->GetNode( i2 ) == n2 )
face = elem;
}
if ( !face && elem->IsQuadratic())
{
// analysis for quadratic elements using all nodes
SMDS_NodeIteratorPtr anIter = elem->interlacedNodesIterator();
const SMDS_MeshNode* prevN = static_cast<const SMDS_MeshNode*>( anIter->next() );
for ( i1 = -1, i2 = 0; anIter->more() && !face; i1++, i2++ )
{
const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( anIter->next() );
if ( n1 == prevN && n2 == n )
{
face = elem;
}
else if ( n2 == prevN && n1 == n )
{
face = elem; std::swap( i1, i2 );
}
prevN = n;
}
}
}
if ( n1ind ) *n1ind = i1;
if ( n2ind ) *n2ind = i2;
return face;
}
//================================================================================
/*!
* Return sharp edges of faces and non-manifold ones. Optionally adds existing edges.
*/
//================================================================================
std::vector< SMESH_MeshAlgos::Edge >
SMESH_MeshAlgos::FindSharpEdges( SMDS_Mesh* theMesh,
double theAngle,
bool theAddExisting )
{
std::vector< Edge > resultEdges;
if ( !theMesh ) return resultEdges;
typedef std::pair< bool, const SMDS_MeshNode* > TIsSharpAndMedium;
typedef NCollection_DataMap< SMESH_TLink, TIsSharpAndMedium, SMESH_TLink > TLinkSharpMap;
TLinkSharpMap linkIsSharp( theMesh->NbFaces() );
TIsSharpAndMedium sharpMedium( true, 0 );
bool & isSharp = sharpMedium.first;
const SMDS_MeshNode* & nMedium = sharpMedium.second;
if ( theAddExisting )
{
for ( SMDS_EdgeIteratorPtr edgeIt = theMesh->edgesIterator(); edgeIt->more(); )
{
const SMDS_MeshElement* edge = edgeIt->next();
nMedium = ( edge->IsQuadratic() ) ? edge->GetNode(2) : 0;
linkIsSharp.Bind( SMESH_TLink( edge->GetNode(0), edge->GetNode(1)), sharpMedium );
}
}
// check angles between face normals
const double angleCos = Cos( theAngle * M_PI / 180. ), angleCos2 = angleCos * angleCos;
gp_XYZ norm1, norm2;
std::vector< const SMDS_MeshNode* > faceNodes, linkNodes(2);
std::vector<const SMDS_MeshElement *> linkFaces;
int nbSharp = linkIsSharp.Extent();
for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
{
const SMDS_MeshElement* face = faceIt->next();
size_t nbCorners = face->NbCornerNodes();
faceNodes.assign( face->begin_nodes(), face->end_nodes() );
if ( faceNodes.size() == nbCorners )
faceNodes.resize( nbCorners * 2, 0 );
const SMDS_MeshNode* nPrev = faceNodes[ nbCorners-1 ];
for ( size_t i = 0; i < nbCorners; ++i )
{
SMESH_TLink link( nPrev, faceNodes[i] );
if ( !linkIsSharp.IsBound( link ))
{
linkNodes[0] = link.node1();
linkNodes[1] = link.node2();
linkFaces.clear();
theMesh->GetElementsByNodes( linkNodes, linkFaces, SMDSAbs_Face );
isSharp = false;
if ( linkFaces.size() > 2 )
{
isSharp = true;
}
else if ( linkFaces.size() == 2 &&
FaceNormal( linkFaces[0], norm1, /*normalize=*/false ) &&
FaceNormal( linkFaces[1], norm2, /*normalize=*/false ))
{
double dot = norm1 * norm2; // == cos * |norm1| * |norm2|
if (( dot < 0 ) == ( angleCos < 0 ))
{
double cos2 = dot * dot / norm1.SquareModulus() / norm2.SquareModulus();
isSharp = ( angleCos < 0 ) ? ( cos2 > angleCos2 ) : ( cos2 < angleCos2 );
}
else
{
isSharp = ( angleCos > 0 );
}
}
nMedium = faceNodes[( i-1+nbCorners ) % nbCorners + nbCorners ];
linkIsSharp.Bind( link, sharpMedium );
nbSharp += isSharp;
}
nPrev = faceNodes[i];
}
}
resultEdges.resize( nbSharp );
TLinkSharpMap::Iterator linkIsSharpIter( linkIsSharp );
for ( int i = 0; linkIsSharpIter.More() && i < nbSharp; linkIsSharpIter.Next() )
{
const SMESH_TLink& link = linkIsSharpIter.Key();
const TIsSharpAndMedium& isSharpMedium = linkIsSharpIter.Value();
if ( isSharpMedium.first )
{
Edge & edge = resultEdges[ i++ ];
edge._node1 = link.node1();
edge._node2 = link.node2();
edge._medium = isSharpMedium.second;
}
}
return resultEdges;
}
//================================================================================
/*!
* Distribute all faces of the mesh between groups using given edges as group boundaries
*/
//================================================================================
std::vector< std::vector< const SMDS_MeshElement* > >
SMESH_MeshAlgos::SeparateFacesByEdges( SMDS_Mesh* theMesh, const std::vector< Edge >& theEdges )
{
std::vector< std::vector< const SMDS_MeshElement* > > groups;
if ( !theMesh ) return groups;
// build map of face edges (SMESH_TLink) and their faces
typedef std::vector< const SMDS_MeshElement* > TFaceVec;
typedef NCollection_DataMap< SMESH_TLink, TFaceVec, SMESH_TLink > TFacesByLinks;
TFacesByLinks facesByLink( theMesh->NbFaces() );
std::vector< const SMDS_MeshNode* > faceNodes;
for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
{
const SMDS_MeshElement* face = faceIt->next();
size_t nbCorners = face->NbCornerNodes();
faceNodes.assign( face->begin_nodes(), face->end_nodes() );
faceNodes.resize( nbCorners + 1 );
faceNodes[ nbCorners ] = faceNodes[0];
face->setIsMarked( false );
for ( size_t i = 0; i < nbCorners; ++i )
{
SMESH_TLink link( faceNodes[i], faceNodes[i+1] );
TFaceVec* linkFaces = facesByLink.ChangeSeek( link );
if ( !linkFaces )
{
linkFaces = facesByLink.Bound( link, TFaceVec() );
linkFaces->reserve(2);
}
linkFaces->push_back( face );
}
}
// remove the given edges from facesByLink map
for ( size_t i = 0; i < theEdges.size(); ++i )
{
SMESH_TLink link( theEdges[i]._node1, theEdges[i]._node2 );
facesByLink.UnBind( link );
}
// faces connected via links of facesByLink map form a group
while ( !facesByLink.IsEmpty() )
{
groups.push_back( TFaceVec() );
TFaceVec & group = groups.back();
group.push_back( TFacesByLinks::Iterator( facesByLink ).Value()[0] );
group.back()->setIsMarked( true );
for ( size_t iF = 0; iF < group.size(); ++iF )
{
const SMDS_MeshElement* face = group[iF];
size_t nbCorners = face->NbCornerNodes();
faceNodes.assign( face->begin_nodes(), face->end_nodes() );
faceNodes.resize( nbCorners + 1 );
faceNodes[ nbCorners ] = faceNodes[0];
for ( size_t iN = 0; iN < nbCorners; ++iN )
{
SMESH_TLink link( faceNodes[iN], faceNodes[iN+1] );
if ( const TFaceVec* faces = facesByLink.Seek( link ))
{
const TFaceVec& faceNeighbors = *faces;
for ( size_t i = 0; i < faceNeighbors.size(); ++i )
if ( !faceNeighbors[i]->isMarked() )
{
group.push_back( faceNeighbors[i] );
faceNeighbors[i]->setIsMarked( true );
}
facesByLink.UnBind( link );
}
}
}
}
// find faces that are alone in its group; they were not in facesByLink
int nbInGroups = 0;
for ( size_t i = 0; i < groups.size(); ++i )
nbInGroups += groups[i].size();
if ( nbInGroups < theMesh->NbFaces() )
{
for ( SMDS_FaceIteratorPtr faceIt = theMesh->facesIterator(); faceIt->more(); )
{
const SMDS_MeshElement* face = faceIt->next();
if ( !face->isMarked() )
{
groups.push_back( TFaceVec() );
groups.back().push_back( face );
}
}
}
return groups;
}
//================================================================================
/*!
* \brief Calculate normal of a mesh face
*/
//================================================================================
bool SMESH_MeshAlgos::FaceNormal(const SMDS_MeshElement* F, gp_XYZ& normal, bool normalized)
{
if ( !F || F->GetType() != SMDSAbs_Face )
return false;
normal.SetCoord(0,0,0);
int nbNodes = F->NbCornerNodes();
for ( int i = 0; i < nbNodes-2; ++i )
{
gp_XYZ p[3];
for ( int n = 0; n < 3; ++n )
{
const SMDS_MeshNode* node = F->GetNode( i + n );
p[n].SetCoord( node->X(), node->Y(), node->Z() );
}
normal += ( p[2] - p[1] ) ^ ( p[0] - p[1] );
}
double size2 = normal.SquareModulus();
bool ok = ( size2 > std::numeric_limits<double>::min() * std::numeric_limits<double>::min());
if ( normalized && ok )
normal /= sqrt( size2 );
return ok;
}
//=======================================================================
//function : GetCommonNodes
//purpose : Return nodes common to two elements
//=======================================================================
std::vector< const SMDS_MeshNode*> SMESH_MeshAlgos::GetCommonNodes(const SMDS_MeshElement* e1,
const SMDS_MeshElement* e2)
{
std::vector< const SMDS_MeshNode*> common;
for ( int i = 0 ; i < e1->NbNodes(); ++i )
if ( e2->GetNodeIndex( e1->GetNode( i )) >= 0 )
common.push_back( e1->GetNode( i ));
return common;
}
//================================================================================
/*!
* \brief Return true if node1 encounters first in the face and node2, after
*/
//================================================================================
bool SMESH_MeshAlgos::IsRightOrder( const SMDS_MeshElement* face,
const SMDS_MeshNode* node0,
const SMDS_MeshNode* node1 )
{
int i0 = face->GetNodeIndex( node0 );
int i1 = face->GetNodeIndex( node1 );
if ( face->IsQuadratic() )
{
if ( face->IsMediumNode( node0 ))
{
i0 -= ( face->NbNodes()/2 - 1 );
i1 *= 2;
}
else
{
i1 -= ( face->NbNodes()/2 - 1 );
i0 *= 2;
}
}
int diff = i1 - i0;
return ( diff == 1 ) || ( diff == -face->NbNodes()+1 );
}
//=======================================================================
/*!
* \brief Partition given 1D elements into groups of contiguous edges.
* A node where number of meeting edges != 2 is a group end.
* An optional startNode is used to orient groups it belongs to.
* \return a list of edge groups and a list of corresponding node groups.
* If a group is closed, the first and last nodes of the group are same.
*/
//=======================================================================
void SMESH_MeshAlgos::Get1DBranches( SMDS_ElemIteratorPtr theEdgeIt,
TElemGroupVector& theEdgeGroups,
TNodeGroupVector& theNodeGroups,
const SMDS_MeshNode* theStartNode )
{
if ( !theEdgeIt )
return;
// build map of nodes and their adjacent edges
typedef std::vector< const SMDS_MeshNode* > TNodeVec;
typedef std::vector< const SMDS_MeshElement* > TEdgeVec;
typedef NCollection_DataMap< const SMDS_MeshNode*, TEdgeVec, SMESH_Hasher > TEdgesByNodeMap;
TEdgesByNodeMap edgesByNode;
while ( theEdgeIt->more() )
{
const SMDS_MeshElement* edge = theEdgeIt->next();
if ( edge->GetType() != SMDSAbs_Edge )
continue;
const SMDS_MeshNode* nodes[2] = { edge->GetNode(0), edge->GetNode(1) };
for ( int i = 0; i < 2; ++i )
{
TEdgeVec* nodeEdges = edgesByNode.ChangeSeek( nodes[i] );
if ( !nodeEdges )
{
nodeEdges = edgesByNode.Bound( nodes[i], TEdgeVec() );
nodeEdges->reserve(2);
}
nodeEdges->push_back( edge );
}
}
if ( edgesByNode.IsEmpty() )
return;
// build edge branches
TElemGroupVector branches(2);
TNodeGroupVector nodeBranches(2);
while ( !edgesByNode.IsEmpty() )
{
if ( !theStartNode || !edgesByNode.IsBound( theStartNode ))
{
theStartNode = TEdgesByNodeMap::Iterator( edgesByNode ).Key();
}
size_t nbBranches = 0;
bool startIsBranchEnd = false;
while ( edgesByNode.IsBound( theStartNode ))
{
// initialize a new branch
++nbBranches;
if ( branches.size() < nbBranches )
{
branches.push_back ( TEdgeVec() );
nodeBranches.push_back( TNodeVec() );
}
TEdgeVec & branch = branches [ nbBranches - 1 ];
TNodeVec & nodeBranch = nodeBranches[ nbBranches - 1 ];
branch.clear();
nodeBranch.clear();
{
TEdgeVec& edges = edgesByNode( theStartNode );
startIsBranchEnd = ( edges.size() != 2 );
int nbEdges = 0;
const SMDS_MeshElement* startEdge = 0;
for ( size_t i = 0; i < edges.size(); ++i )
{
if ( !startEdge && edges[i] )
{
startEdge = edges[i];
edges[i] = 0;
}
nbEdges += bool( edges[i] );
}
if ( nbEdges == 0 )
edgesByNode.UnBind( theStartNode );
if ( !startEdge )
continue;
branch.push_back( startEdge );
nodeBranch.push_back( theStartNode );
nodeBranch.push_back( branch.back()->GetNode(0) );
if ( nodeBranch.back() == theStartNode )
nodeBranch.back() = branch.back()->GetNode(1);
}
// fill the branch
bool isBranchEnd = false;
TEdgeVec* edgesPtr;
while (( !isBranchEnd ) && ( edgesPtr = edgesByNode.ChangeSeek( nodeBranch.back() )))
{
TEdgeVec& edges = *edgesPtr;
isBranchEnd = ( edges.size() != 2 );
const SMDS_MeshNode* lastNode = nodeBranch.back();
switch ( edges.size() )
{
case 1:
edgesByNode.UnBind( lastNode );
break;
case 2:
{
if ( const SMDS_MeshElement* nextEdge = edges[ edges[0] == branch.back() ])
{
branch.push_back( nextEdge );
const SMDS_MeshNode* nextNode = nextEdge->GetNode(0);
if ( nodeBranch.back() == nextNode )
nextNode = nextEdge->GetNode(1);
nodeBranch.push_back( nextNode );
}
edgesByNode.UnBind( lastNode );
break;
}
default:
int nbEdges = 0;
for ( size_t i = 0; i < edges.size(); ++i )
{
if ( edges[i] == branch.back() )
edges[i] = 0;
nbEdges += bool( edges[i] );
}
if ( nbEdges == 0 )
edgesByNode.UnBind( lastNode );
}
}
} // while ( edgesByNode.IsBound( theStartNode ))
// put the found branches to the result
if ( nbBranches == 2 && !startIsBranchEnd ) // join two branches starting at the same node
{
if ( nodeBranches[0].back() == nodeBranches[1].back() )
{
// it is a closed branch, keep theStartNode first
nodeBranches[0].pop_back();
nodeBranches[0].reserve( nodeBranches[0].size() + nodeBranches[1].size() );
nodeBranches[0].insert( nodeBranches[0].end(),
nodeBranches[1].rbegin(), nodeBranches[1].rend() );
branches[0].reserve( branches[0].size() + branches[1].size() );
branches[0].insert( branches[0].end(), branches[1].rbegin(), branches[1].rend() );
}
else
{
std::reverse( nodeBranches[0].begin(), nodeBranches[0].end() );
nodeBranches[0].pop_back();
nodeBranches[0].reserve( nodeBranches[0].size() + nodeBranches[1].size() );
nodeBranches[0].insert( nodeBranches[0].end(),
nodeBranches[1].begin(), nodeBranches[1].end() );
std::reverse( branches[0].begin(), branches[0].end() );
branches[0].reserve( branches[0].size() + branches[1].size() );
branches[0].insert( branches[0].end(), branches[1].begin(), branches[1].end() );
}
nodeBranches[1].clear();
branches[1].clear();
}
for ( size_t i = 0; i < nbBranches; ++i )
{
if ( branches[i].empty() )
continue;
theEdgeGroups.push_back( TEdgeVec() );
theEdgeGroups.back().swap( branches[i] );
theNodeGroups.push_back( TNodeVec() );
theNodeGroups.back().swap( nodeBranches[i] );
}
} // while ( !edgesByNode.IsEmpty() )
return;
}
//=======================================================================
/*!
* \brief Return SMESH_NodeSearcher
*/
//=======================================================================
SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_Mesh& mesh)
{
return new SMESH_NodeSearcherImpl( &mesh );
}
//=======================================================================
/*!
* \brief Return SMESH_NodeSearcher
*/
//=======================================================================
SMESH_NodeSearcher* SMESH_MeshAlgos::GetNodeSearcher(SMDS_ElemIteratorPtr elemIt)
{
return new SMESH_NodeSearcherImpl( 0, elemIt );
}
//=======================================================================
/*!
* \brief Return SMESH_ElementSearcher
*/
//=======================================================================
SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
double tolerance)
{
return new SMESH_ElementSearcherImpl( mesh, tolerance );
}
//=======================================================================
/*!
* \brief Return SMESH_ElementSearcher acting on a sub-set of elements
*/
//=======================================================================
SMESH_ElementSearcher* SMESH_MeshAlgos::GetElementSearcher(SMDS_Mesh& mesh,
SMDS_ElemIteratorPtr elemIt,
double tolerance)
{
return new SMESH_ElementSearcherImpl( mesh, tolerance, elemIt );
}