1 // Copyright (C) 2007-2015 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
23 // SMESH SMESH : implementaion of SMESH idl descriptions
24 // File : SMESH_Algo.cxx
25 // Author : Paul RASCLE, EDF
28 #include "SMESH_Algo.hxx"
30 #include "SMDS_EdgePosition.hxx"
31 #include "SMDS_FacePosition.hxx"
32 #include "SMDS_MeshElement.hxx"
33 #include "SMDS_MeshNode.hxx"
34 #include "SMDS_VolumeTool.hxx"
35 #include "SMESHDS_Mesh.hxx"
36 #include "SMESHDS_SubMesh.hxx"
37 #include "SMESH_Comment.hxx"
38 #include "SMESH_Gen.hxx"
39 #include "SMESH_HypoFilter.hxx"
40 #include "SMESH_Mesh.hxx"
41 #include "SMESH_MeshAlgos.hxx"
42 #include "SMESH_TypeDefs.hxx"
43 #include "SMESH_subMesh.hxx"
45 #include <Basics_OCCTVersion.hxx>
47 #include <BRepAdaptor_Curve.hxx>
48 #include <BRepLProp.hxx>
49 #include <BRep_Tool.hxx>
50 #include <GCPnts_AbscissaPoint.hxx>
51 #include <GeomAdaptor_Curve.hxx>
52 #include <Geom_Surface.hxx>
53 #include <LDOMParser.hxx>
55 #include <TopExp_Explorer.hxx>
56 #include <TopLoc_Location.hxx>
57 #include <TopTools_ListIteratorOfListOfShape.hxx>
58 #include <TopTools_ListOfShape.hxx>
60 #include <TopoDS_Edge.hxx>
61 #include <TopoDS_Face.hxx>
62 #include <TopoDS_Vertex.hxx>
63 #include <TopoDS_Wire.hxx>
65 #include <gp_Pnt2d.hxx>
68 #include <Standard_ErrorHandler.hxx>
69 #include <Standard_Failure.hxx>
71 #include "utilities.h"
75 #include "SMESH_ProxyMesh.hxx"
76 #include "SMESH_MesherHelper.hxx"
80 //================================================================================
82 * \brief Returns \a true if two algorithms (described by \a this and the given
83 * algo data) are compatible by their output and input types of elements.
85 //================================================================================
87 bool SMESH_Algo::Features::IsCompatible( const SMESH_Algo::Features& algo2 ) const
89 if ( _dim > algo2._dim ) return algo2.IsCompatible( *this );
90 // algo2 is of highter dimension
91 if ( _outElemTypes.empty() || algo2._inElemTypes.empty() )
93 bool compatible = true;
94 set<SMDSAbs_GeometryType>::const_iterator myOutType = _outElemTypes.begin();
95 for ( ; myOutType != _outElemTypes.end() && compatible; ++myOutType )
96 compatible = algo2._inElemTypes.count( *myOutType );
100 //================================================================================
102 * \brief Return Data of the algorithm
104 //================================================================================
106 const SMESH_Algo::Features& SMESH_Algo::GetFeatures( const std::string& algoType )
108 static map< string, SMESH_Algo::Features > theFeaturesByName;
109 if ( theFeaturesByName.empty() )
111 // Read Plugin.xml files
112 vector< string > xmlPaths = SMESH_Gen::GetPluginXMLPaths();
113 LDOMParser xmlParser;
114 for ( size_t iXML = 0; iXML < xmlPaths.size(); ++iXML )
116 bool error = xmlParser.parse( xmlPaths[iXML].c_str() );
119 TCollection_AsciiString data;
120 INFOS( xmlParser.GetError(data) );
123 // <algorithm type="Regular_1D"
126 // output="QUAD,TRIA">
128 LDOM_Document xmlDoc = xmlParser.getDocument();
129 LDOM_NodeList algoNodeList = xmlDoc.getElementsByTagName( "algorithm" );
130 for ( int i = 0; i < algoNodeList.getLength(); ++i )
132 LDOM_Node algoNode = algoNodeList.item( i );
133 LDOM_Element& algoElem = (LDOM_Element&) algoNode;
134 TCollection_AsciiString algoType = algoElem.getAttribute("type");
135 TCollection_AsciiString input = algoElem.getAttribute("input");
136 TCollection_AsciiString output = algoElem.getAttribute("output");
137 TCollection_AsciiString dim = algoElem.getAttribute("dim");
138 TCollection_AsciiString label = algoElem.getAttribute("label-id");
139 if ( algoType.IsEmpty() ) continue;
141 Features & data = theFeaturesByName[ algoType.ToCString() ];
142 data._dim = dim.IntegerValue();
143 data._label = label.ToCString();
144 for ( int isInput = 0; isInput < 2; ++isInput )
146 TCollection_AsciiString& typeStr = isInput ? input : output;
147 set<SMDSAbs_GeometryType>& typeSet = isInput ? data._inElemTypes : data._outElemTypes;
149 while ( beg <= typeStr.Length() )
151 while ( beg < typeStr.Length() && !isalpha( typeStr.Value( beg ) ))
154 while ( end < typeStr.Length() && isalpha( typeStr.Value( end + 1 ) ))
158 TCollection_AsciiString typeName = typeStr.SubString( beg, end );
159 if ( typeName == "EDGE" ) typeSet.insert( SMDSGeom_EDGE );
160 else if ( typeName == "TRIA" ) typeSet.insert( SMDSGeom_TRIANGLE );
161 else if ( typeName == "QUAD" ) typeSet.insert( SMDSGeom_QUADRANGLE );
169 return theFeaturesByName[ algoType ];
172 //=============================================================================
176 //=============================================================================
178 SMESH_Algo::SMESH_Algo (int hypId, int studyId, SMESH_Gen * gen)
179 : SMESH_Hypothesis(hypId, studyId, gen)
181 _compatibleAllHypFilter = _compatibleNoAuxHypFilter = NULL;
182 _onlyUnaryInput = _requireDiscreteBoundary = _requireShape = true;
183 _quadraticMesh = _supportSubmeshes = false;
185 for ( int i = 0; i < 4; ++i )
186 _neededLowerHyps[ i ] = false;
189 //=============================================================================
193 //=============================================================================
195 SMESH_Algo::~SMESH_Algo()
197 delete _compatibleNoAuxHypFilter;
198 // delete _compatibleAllHypFilter; -- _compatibleNoAuxHypFilter does it!!!
201 //=============================================================================
205 //=============================================================================
207 SMESH_0D_Algo::SMESH_0D_Algo(int hypId, int studyId, SMESH_Gen* gen)
208 : SMESH_Algo(hypId, studyId, gen)
210 _shapeType = (1 << TopAbs_VERTEX);
213 SMESH_1D_Algo::SMESH_1D_Algo(int hypId, int studyId, SMESH_Gen* gen)
214 : SMESH_Algo(hypId, studyId, gen)
216 _shapeType = (1 << TopAbs_EDGE);
219 SMESH_2D_Algo::SMESH_2D_Algo(int hypId, int studyId, SMESH_Gen* gen)
220 : SMESH_Algo(hypId, studyId, gen)
222 _shapeType = (1 << TopAbs_FACE);
225 SMESH_3D_Algo::SMESH_3D_Algo(int hypId, int studyId, SMESH_Gen* gen)
226 : SMESH_Algo(hypId, studyId, gen)
228 _shapeType = (1 << TopAbs_SOLID);
232 //=============================================================================
234 * Usually an algoritm has nothing to save
236 //=============================================================================
238 ostream & SMESH_Algo::SaveTo(ostream & save) { return save; }
239 istream & SMESH_Algo::LoadFrom(istream & load) { return load; }
241 //=============================================================================
245 //=============================================================================
247 const vector < string > &SMESH_Algo::GetCompatibleHypothesis()
249 return _compatibleHypothesis;
252 //=============================================================================
254 * List the hypothesis used by the algorithm associated to the shape.
255 * Hypothesis associated to father shape -are- taken into account (see
256 * GetAppliedHypothesis). Relevant hypothesis have a name (type) listed in
257 * the algorithm. This method could be surcharged by specific algorithms, in
258 * case of several hypothesis simultaneously applicable.
260 //=============================================================================
262 const list <const SMESHDS_Hypothesis *> &
263 SMESH_Algo::GetUsedHypothesis(SMESH_Mesh & aMesh,
264 const TopoDS_Shape & aShape,
265 const bool ignoreAuxiliary) const
267 SMESH_Algo* me = const_cast< SMESH_Algo* >( this );
268 me->_usedHypList.clear();
269 if ( const SMESH_HypoFilter* filter = GetCompatibleHypoFilter( ignoreAuxiliary ))
271 aMesh.GetHypotheses( aShape, *filter, me->_usedHypList, true );
272 if ( ignoreAuxiliary && _usedHypList.size() > 1 )
273 me->_usedHypList.clear(); //only one compatible hypothesis allowed
278 //=============================================================================
280 * List the relevant hypothesis associated to the shape. Relevant hypothesis
281 * have a name (type) listed in the algorithm. Hypothesis associated to
282 * father shape -are not- taken into account (see GetUsedHypothesis)
284 //=============================================================================
286 const list<const SMESHDS_Hypothesis *> &
287 SMESH_Algo::GetAppliedHypothesis(SMESH_Mesh & aMesh,
288 const TopoDS_Shape & aShape,
289 const bool ignoreAuxiliary) const
291 SMESH_Algo* me = const_cast< SMESH_Algo* >( this );
292 me->_appliedHypList.clear();
293 if ( const SMESH_HypoFilter* filter = GetCompatibleHypoFilter( ignoreAuxiliary ))
294 aMesh.GetHypotheses( aShape, *filter, me->_appliedHypList, false );
296 return _appliedHypList;
299 //=============================================================================
301 * Compute length of an edge
303 //=============================================================================
305 double SMESH_Algo::EdgeLength(const TopoDS_Edge & E)
307 double UMin = 0, UMax = 0;
309 Handle(Geom_Curve) C = BRep_Tool::Curve(E, L, UMin, UMax);
312 GeomAdaptor_Curve AdaptCurve(C, UMin, UMax); //range is important for periodic curves
313 double length = GCPnts_AbscissaPoint::Length(AdaptCurve, UMin, UMax);
317 //================================================================================
319 * \brief Just return false as the algorithm does not hold parameters values
321 //================================================================================
323 bool SMESH_Algo::SetParametersByMesh(const SMESH_Mesh* /*theMesh*/,
324 const TopoDS_Shape& /*theShape*/)
328 bool SMESH_Algo::SetParametersByDefaults(const TDefaults& , const SMESH_Mesh*)
332 //================================================================================
334 * \brief Fill vector of node parameters on geometrical edge, including vertex nodes
335 * \param theMesh - The mesh containing nodes
336 * \param theEdge - The geometrical edge of interest
337 * \param theParams - The resulting vector of sorted node parameters
338 * \retval bool - false if not all parameters are OK
340 //================================================================================
342 bool SMESH_Algo::GetNodeParamOnEdge(const SMESHDS_Mesh* theMesh,
343 const TopoDS_Edge& theEdge,
344 vector< double > & theParams)
348 if ( !theMesh || theEdge.IsNull() )
351 SMESHDS_SubMesh * eSubMesh = theMesh->MeshElements( theEdge );
352 if ( !eSubMesh || !eSubMesh->GetElements()->more() )
353 return false; // edge is not meshed
355 //int nbEdgeNodes = 0;
356 set < double > paramSet;
359 // loop on nodes of an edge: sort them by param on edge
360 SMDS_NodeIteratorPtr nIt = eSubMesh->GetNodes();
361 while ( nIt->more() )
363 const SMDS_MeshNode* node = nIt->next();
364 const SMDS_PositionPtr& pos = node->GetPosition();
365 if ( pos->GetTypeOfPosition() != SMDS_TOP_EDGE )
367 const SMDS_EdgePosition* epos =
368 static_cast<const SMDS_EdgePosition*>(node->GetPosition());
369 if ( !paramSet.insert( epos->GetUParameter() ).second )
370 return false; // equal parameters
373 // add vertex nodes params
375 TopExp::Vertices( theEdge, V1, V2);
376 if ( VertexNode( V1, theMesh ) &&
377 !paramSet.insert( BRep_Tool::Parameter(V1,theEdge) ).second )
378 return false; // there are equal parameters
379 if ( VertexNode( V2, theMesh ) &&
380 !paramSet.insert( BRep_Tool::Parameter(V2,theEdge) ).second )
381 return false; // there are equal parameters
384 theParams.resize( paramSet.size() );
385 set < double >::iterator par = paramSet.begin();
386 vector< double >::iterator vecPar = theParams.begin();
387 for ( ; par != paramSet.end(); ++par, ++vecPar )
390 return theParams.size() > 1;
393 //================================================================================
395 * \brief Fill vector of node parameters on geometrical edge, including vertex nodes
396 * \param theMesh - The mesh containing nodes
397 * \param theEdge - The geometrical edge of interest
398 * \param theParams - The resulting vector of sorted node parameters
399 * \retval bool - false if not all parameters are OK
401 //================================================================================
403 bool SMESH_Algo::GetSortedNodesOnEdge(const SMESHDS_Mesh* theMesh,
404 const TopoDS_Edge& theEdge,
405 const bool ignoreMediumNodes,
406 map< double, const SMDS_MeshNode* > & theNodes,
407 const SMDSAbs_ElementType typeToCheck)
411 if ( !theMesh || theEdge.IsNull() )
414 SMESHDS_SubMesh * eSubMesh = theMesh->MeshElements( theEdge );
415 if ( !eSubMesh || ( eSubMesh->NbElements()==0 && eSubMesh->NbNodes() == 0))
416 return false; // edge is not meshed
419 set < double > paramSet;
422 // loop on nodes of an edge: sort them by param on edge
423 SMDS_NodeIteratorPtr nIt = eSubMesh->GetNodes();
424 while ( nIt->more() )
426 const SMDS_MeshNode* node = nIt->next();
427 if ( ignoreMediumNodes && SMESH_MesherHelper::IsMedium( node, typeToCheck ))
429 const SMDS_PositionPtr& pos = node->GetPosition();
430 if ( pos->GetTypeOfPosition() != SMDS_TOP_EDGE )
432 const SMDS_EdgePosition* epos =
433 static_cast<const SMDS_EdgePosition*>(node->GetPosition());
434 theNodes.insert( theNodes.end(), make_pair( epos->GetUParameter(), node ));
439 TopoDS_Vertex v1, v2;
440 TopExp::Vertices(theEdge, v1, v2);
441 const SMDS_MeshNode* n1 = VertexNode( v1, eSubMesh, 0 );
442 const SMDS_MeshNode* n2 = VertexNode( v2, eSubMesh, 0 );
444 BRep_Tool::Range(theEdge, f, l);
445 if ( v1.Orientation() != TopAbs_FORWARD )
447 if ( n1 && ++nbNodes )
448 theNodes.insert( make_pair( f, n1 ));
449 if ( n2 && ++nbNodes )
450 theNodes.insert( make_pair( l, n2 ));
452 return (int)theNodes.size() == nbNodes;
455 //================================================================================
457 * \brief Returns the filter recognizing only compatible hypotheses
458 * \param ignoreAuxiliary - make filter ignore auxiliary hypotheses
459 * \retval SMESH_HypoFilter* - the filter that can be NULL
461 //================================================================================
463 const SMESH_HypoFilter*
464 SMESH_Algo::GetCompatibleHypoFilter(const bool ignoreAuxiliary) const
466 if ( !_compatibleHypothesis.empty() )
468 if ( !_compatibleAllHypFilter )
470 SMESH_HypoFilter* filter = new SMESH_HypoFilter();
471 filter->Init( filter->HasName( _compatibleHypothesis[0] ));
472 for ( size_t i = 1; i < _compatibleHypothesis.size(); ++i )
473 filter->Or( filter->HasName( _compatibleHypothesis[ i ] ));
475 SMESH_HypoFilter* filterNoAux = new SMESH_HypoFilter( filter );
476 filterNoAux->AndNot( filterNoAux->IsAuxiliary() );
478 // _compatibleNoAuxHypFilter will detele _compatibleAllHypFilter!!!
479 SMESH_Algo* me = const_cast< SMESH_Algo* >( this );
480 me->_compatibleAllHypFilter = filter;
481 me->_compatibleNoAuxHypFilter = filterNoAux;
483 return ignoreAuxiliary ? _compatibleNoAuxHypFilter : _compatibleAllHypFilter;
488 //================================================================================
490 * \brief Return continuity of two edges
491 * \param E1 - the 1st edge
492 * \param E2 - the 2nd edge
493 * \retval GeomAbs_Shape - regularity at the junction between E1 and E2
495 //================================================================================
497 GeomAbs_Shape SMESH_Algo::Continuity(TopoDS_Edge E1,
500 //E1.Orientation(TopAbs_FORWARD), E2.Orientation(TopAbs_FORWARD); // avoid pb with internal edges
501 if (E1.Orientation() > TopAbs_REVERSED) // INTERNAL
502 E1.Orientation( TopAbs_FORWARD );
503 if (E2.Orientation() > TopAbs_REVERSED) // INTERNAL
504 E2.Orientation( TopAbs_FORWARD );
506 TopoDS_Vertex V, VV1[2], VV2[2];
507 TopExp::Vertices( E1, VV1[0], VV1[1], true );
508 TopExp::Vertices( E2, VV2[0], VV2[1], true );
509 if ( VV1[1].IsSame( VV2[0] )) { V = VV1[1]; }
510 else if ( VV1[0].IsSame( VV2[1] )) { V = VV1[0]; }
511 else if ( VV1[1].IsSame( VV2[1] )) { V = VV1[1]; E1.Reverse(); }
512 else if ( VV1[0].IsSame( VV2[0] )) { V = VV1[0]; E1.Reverse(); }
513 else { return GeomAbs_C0; }
515 Standard_Real u1 = BRep_Tool::Parameter( V, E1 );
516 Standard_Real u2 = BRep_Tool::Parameter( V, E2 );
517 BRepAdaptor_Curve C1( E1 ), C2( E2 );
518 Standard_Real tol = BRep_Tool::Tolerance( V );
519 Standard_Real angTol = 2e-3;
522 return BRepLProp::Continuity(C1, C2, u1, u2, tol, angTol);
524 catch (Standard_Failure) {
529 //================================================================================
531 * \brief Return true if an edge can be considered straight
533 //================================================================================
535 bool SMESH_Algo::IsStraight( const TopoDS_Edge & E,
536 const bool degenResult)
540 if ( BRep_Tool::Curve( E, f, l ).IsNull())
543 BRepAdaptor_Curve curve( E );
544 switch( curve.GetType() )
549 case GeomAbs_Ellipse:
550 case GeomAbs_Hyperbola:
551 case GeomAbs_Parabola:
553 // case GeomAbs_BezierCurve:
554 // case GeomAbs_BSplineCurve:
555 // case GeomAbs_OtherCurve:
558 const double f = curve.FirstParameter();
559 const double l = curve.LastParameter();
560 const gp_Pnt pf = curve.Value( f );
561 const gp_Pnt pl = curve.Value( l );
562 const gp_Vec v1( pf, pl );
563 const double v1Len = v1.Magnitude();
564 if ( v1Len < std::numeric_limits< double >::min() )
565 return false; // E seems closed
566 const double tol = Min( 10 * curve.Tolerance(), v1Len * 1e-2 );
567 const double nbSamples = 7;
568 for ( int i = 0; i < nbSamples; ++i )
570 const double r = ( i + 1 ) / nbSamples;
571 const gp_Pnt pi = curve.Value( f * r + l * ( 1 - r ));
572 const gp_Vec vi( pf, pi );
573 const double h = 0.5 * v1.Crossed( vi ).Magnitude() / v1Len;
580 //================================================================================
582 * \brief Return true if an edge has no 3D curve
584 //================================================================================
586 bool SMESH_Algo::isDegenerated( const TopoDS_Edge & E )
590 Handle(Geom_Curve) C = BRep_Tool::Curve( E, loc, f,l );
594 //================================================================================
596 * \brief Return the node built on a vertex
597 * \param V - the vertex
598 * \param meshDS - mesh
599 * \retval const SMDS_MeshNode* - found node or NULL
600 * \sa SMESH_MesherHelper::GetSubShapeByNode( const SMDS_MeshNode*, SMESHDS_Mesh* )
602 //================================================================================
604 const SMDS_MeshNode* SMESH_Algo::VertexNode(const TopoDS_Vertex& V,
605 const SMESHDS_Mesh* meshDS)
607 if ( SMESHDS_SubMesh* sm = meshDS->MeshElements(V) ) {
608 SMDS_NodeIteratorPtr nIt= sm->GetNodes();
615 //=======================================================================
617 * \brief Return the node built on a vertex.
618 * A node moved to other geometry by MergeNodes() is also returned.
619 * \param V - the vertex
621 * \retval const SMDS_MeshNode* - found node or NULL
623 //=======================================================================
625 const SMDS_MeshNode* SMESH_Algo::VertexNode(const TopoDS_Vertex& V,
626 const SMESH_Mesh* mesh)
628 const SMDS_MeshNode* node = VertexNode( V, mesh->GetMeshDS() );
630 if ( !node && mesh->HasModificationsToDiscard() )
632 PShapeIteratorPtr edgeIt = SMESH_MesherHelper::GetAncestors( V, *mesh, TopAbs_EDGE );
633 while ( const TopoDS_Shape* edge = edgeIt->next() )
634 if ( SMESHDS_SubMesh* edgeSM = mesh->GetMeshDS()->MeshElements( *edge ))
635 if ( edgeSM->NbElements() > 0 )
636 return VertexNode( V, edgeSM, mesh, /*checkV=*/false );
641 //=======================================================================
643 * \brief Return the node built on a vertex.
644 * A node moved to other geometry by MergeNodes() is also returned.
645 * \param V - the vertex
646 * \param edgeSM - sub-mesh of a meshed EDGE sharing the vertex
647 * \param checkV - if \c true, presence of a node on the vertex is checked
648 * \retval const SMDS_MeshNode* - found node or NULL
650 //=======================================================================
652 const SMDS_MeshNode* SMESH_Algo::VertexNode(const TopoDS_Vertex& V,
653 const SMESHDS_SubMesh* edgeSM,
654 const SMESH_Mesh* mesh,
657 const SMDS_MeshNode* node = checkV ? VertexNode( V, edgeSM->GetParent() ) : 0;
659 if ( !node && edgeSM )
661 // find nodes not shared by mesh segments
662 typedef set< const SMDS_MeshNode* > TNodeSet;
663 typedef map< const SMDS_MeshNode*, const SMDS_MeshNode* > TNodeMap;
664 TNodeMap notSharedNodes;
665 TNodeSet otherShapeNodes;
666 vector< const SMDS_MeshNode* > segNodes(3);
667 SMDS_ElemIteratorPtr segIt = edgeSM->GetElements();
668 while ( segIt->more() )
670 const SMDS_MeshElement* seg = segIt->next();
671 if ( seg->GetType() != SMDSAbs_Edge )
673 segNodes.assign( seg->begin_nodes(), seg->end_nodes() );
674 for ( int i = 0; i < 2; ++i )
676 const SMDS_MeshNode* n1 = segNodes[i];
677 const SMDS_MeshNode* n2 = segNodes[1-i];
678 pair<TNodeMap::iterator, bool> it2new = notSharedNodes.insert( make_pair( n1, n2 ));
679 if ( !it2new.second ) // n encounters twice
680 notSharedNodes.erase( it2new.first );
681 if ( n1->getshapeId() != edgeSM->GetID() )
682 otherShapeNodes.insert( n1 );
685 if ( otherShapeNodes.size() == 1 && notSharedNodes.empty() ) // a closed EDGE
686 return *otherShapeNodes.begin();
688 if ( notSharedNodes.size() == 2 ) // two end nodes found
690 SMESHDS_Mesh* meshDS = edgeSM->GetParent();
691 const TopoDS_Shape& E = meshDS->IndexToShape( edgeSM->GetID() );
692 if ( E.IsNull() || E.ShapeType() != TopAbs_EDGE )
694 const SMDS_MeshNode* n1 = notSharedNodes.begin ()->first;
695 const SMDS_MeshNode* n2 = notSharedNodes.rbegin()->first;
696 TopoDS_Shape S1 = SMESH_MesherHelper::GetSubShapeByNode( n1, meshDS );
697 if ( S1.ShapeType() == TopAbs_VERTEX && SMESH_MesherHelper::IsSubShape( S1, E ))
699 TopoDS_Shape S2 = SMESH_MesherHelper::GetSubShapeByNode( n2, meshDS );
700 if ( S2.ShapeType() == TopAbs_VERTEX && SMESH_MesherHelper::IsSubShape( S2, E ))
702 if ( edgeSM->NbElements() <= 2 || !mesh ) // one-two segments
704 gp_Pnt pV = BRep_Tool::Pnt( V );
705 double dist1 = pV.SquareDistance( SMESH_TNodeXYZ( n1 ));
706 double dist2 = pV.SquareDistance( SMESH_TNodeXYZ( n2 ));
707 return dist1 < dist2 ? n1 : n2;
711 SMESH_MesherHelper helper( const_cast<SMESH_Mesh&>( *mesh ));
712 const SMDS_MeshNode* n1i = notSharedNodes.begin ()->second;
713 const SMDS_MeshNode* n2i = notSharedNodes.rbegin()->second;
714 const TopoDS_Edge& edge = TopoDS::Edge( E );
716 double pos1 = helper.GetNodeU( edge, n1i, n2i, &posOK );
717 double pos2 = helper.GetNodeU( edge, n2i, n1i, &posOK );
718 double posV = BRep_Tool::Parameter( V, edge );
719 if ( Abs( pos1 - posV ) < Abs( pos2 - posV )) return n1;
727 //=======================================================================
728 //function : GetMeshError
729 //purpose : Finds topological errors of a sub-mesh
730 //WARNING : 1D check is NOT implemented so far
731 //=======================================================================
733 SMESH_Algo::EMeshError SMESH_Algo::GetMeshError(SMESH_subMesh* subMesh)
735 EMeshError err = MEr_OK;
737 SMESHDS_SubMesh* smDS = subMesh->GetSubMeshDS();
741 switch ( subMesh->GetSubShape().ShapeType() )
743 case TopAbs_FACE: { // ====================== 2D =====================
745 SMDS_ElemIteratorPtr fIt = smDS->GetElements();
749 // We check that olny links on EDGEs encouter once, the rest links, twice
750 set< SMESH_TLink > links;
751 while ( fIt->more() )
753 const SMDS_MeshElement* f = fIt->next();
754 int nbNodes = f->NbCornerNodes(); // ignore medium nodes
755 for ( int i = 0; i < nbNodes; ++i )
757 const SMDS_MeshNode* n1 = f->GetNode( i );
758 const SMDS_MeshNode* n2 = f->GetNode(( i+1 ) % nbNodes);
759 std::pair< set< SMESH_TLink >::iterator, bool > it_added =
760 links.insert( SMESH_TLink( n1, n2 ));
761 if ( !it_added.second )
762 // As we do NOT(!) check if mesh is manifold, we believe that a link can
763 // encounter once or twice only (not three times), we erase a link as soon
764 // as it encounters twice to speed up search in the <links> map.
765 links.erase( it_added.first );
768 // the links remaining in the <links> should all be on EDGE
769 set< SMESH_TLink >::iterator linkIt = links.begin();
770 for ( ; linkIt != links.end(); ++linkIt )
772 const SMESH_TLink& link = *linkIt;
773 if ( link.node1()->GetPosition()->GetTypeOfPosition() > SMDS_TOP_EDGE ||
774 link.node2()->GetPosition()->GetTypeOfPosition() > SMDS_TOP_EDGE )
777 // TODO: to check orientation
780 case TopAbs_SOLID: { // ====================== 3D =====================
782 SMDS_ElemIteratorPtr vIt = smDS->GetElements();
786 SMDS_VolumeTool vTool;
787 while ( !vIt->more() )
789 if (!vTool.Set( vIt->next() ))
792 for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
793 if ( vTool.IsFreeFace( iF ))
795 int nbN = vTool.NbFaceNodes( iF );
796 const SMDS_MeshNode** nodes = vTool.GetFaceNodes( iF );
797 for ( int i = 0; i < nbN; ++i )
798 if ( nodes[i]->GetPosition()->GetTypeOfPosition() > SMDS_TOP_FACE )
809 //================================================================================
811 * \brief Sets event listener to submeshes if necessary
812 * \param subMesh - submesh where algo is set
814 * After being set, event listener is notified on each event of a submesh.
815 * By default non listener is set
817 //================================================================================
819 void SMESH_Algo::SetEventListener(SMESH_subMesh* /*subMesh*/)
823 //================================================================================
825 * \brief Allow algo to do something after persistent restoration
826 * \param subMesh - restored submesh
828 * This method is called only if a submesh has HYP_OK algo_state.
830 //================================================================================
832 void SMESH_Algo::SubmeshRestored(SMESH_subMesh* /*subMesh*/)
836 //================================================================================
838 * \brief Computes mesh without geometry
839 * \param aMesh - the mesh
840 * \param aHelper - helper that must be used for adding elements to \aaMesh
841 * \retval bool - is a success
843 //================================================================================
845 bool SMESH_Algo::Compute(SMESH_Mesh & /*aMesh*/, SMESH_MesherHelper* /*aHelper*/)
847 return error( COMPERR_BAD_INPUT_MESH, "Mesh built on shape expected");
850 //=======================================================================
851 //function : CancelCompute
852 //purpose : Sets _computeCanceled to true. It's usage depends on
853 // * implementation of a particular mesher.
854 //=======================================================================
856 void SMESH_Algo::CancelCompute()
858 _computeCanceled = true;
859 _error = COMPERR_CANCELED;
862 //================================================================================
864 * If possible, returns progress of computation [0.,1.]
866 //================================================================================
868 double SMESH_Algo::GetProgress() const
873 //================================================================================
875 * \brief store error and comment and then return ( error == COMPERR_OK )
877 //================================================================================
879 bool SMESH_Algo::error(int error, const SMESH_Comment& comment)
883 return ( error == COMPERR_OK );
886 //================================================================================
888 * \brief store error and return ( error == COMPERR_OK )
890 //================================================================================
892 bool SMESH_Algo::error(SMESH_ComputeErrorPtr error)
895 _error = error->myName;
896 _comment = error->myComment;
897 _badInputElements = error->myBadElements;
898 return error->IsOK();
903 //================================================================================
905 * \brief return compute error
907 //================================================================================
909 SMESH_ComputeErrorPtr SMESH_Algo::GetComputeError() const
911 SMESH_ComputeErrorPtr err = SMESH_ComputeError::New( _error, _comment, this );
912 // hope this method is called by only SMESH_subMesh after this->Compute()
913 err->myBadElements.splice( err->myBadElements.end(),
914 (list<const SMDS_MeshElement*>&) _badInputElements );
918 //================================================================================
920 * \brief initialize compute error before call of Compute()
922 //================================================================================
924 void SMESH_Algo::InitComputeError()
928 list<const SMDS_MeshElement*>::iterator elem = _badInputElements.begin();
929 for ( ; elem != _badInputElements.end(); ++elem )
930 if ( (*elem)->GetID() < 1 )
932 _badInputElements.clear();
934 _computeCanceled = false;
939 //================================================================================
941 * \brief Return compute progress by nb of calls of this method
943 //================================================================================
945 double SMESH_Algo::GetProgressByTic() const
948 for ( size_t i = 0; i < _smToCompute.size(); ++i )
949 computeCost += _smToCompute[i]->GetComputeCost();
951 const_cast<SMESH_Algo*>( this )->_progressTic++;
953 double x = 5 * _progressTic;
954 x = ( x < computeCost ) ? ( x / computeCost ) : 1.;
955 return 0.9 * sin( x * M_PI / 2 );
958 //================================================================================
960 * \brief store a bad input element preventing computation,
961 * which may be a temporary one i.e. not residing the mesh,
962 * then it will be deleted by InitComputeError()
964 //================================================================================
966 void SMESH_Algo::addBadInputElement(const SMDS_MeshElement* elem)
969 _badInputElements.push_back( elem );
972 //=======================================================================
973 //function : addBadInputElements
974 //purpose : store a bad input elements or nodes preventing computation
975 //=======================================================================
977 void SMESH_Algo::addBadInputElements(const SMESHDS_SubMesh* sm,
984 SMDS_NodeIteratorPtr nIt = sm->GetNodes();
985 while ( nIt->more() ) addBadInputElement( nIt->next() );
989 SMDS_ElemIteratorPtr eIt = sm->GetElements();
990 while ( eIt->more() ) addBadInputElement( eIt->next() );
995 //=============================================================================
999 //=============================================================================
1001 // int SMESH_Algo::NumberOfWires(const TopoDS_Shape& S)
1004 // for (TopExp_Explorer exp(S,TopAbs_WIRE); exp.More(); exp.Next())
1009 //=============================================================================
1013 //=============================================================================
1015 int SMESH_Algo::NumberOfPoints(SMESH_Mesh& aMesh, const TopoDS_Wire& W)
1018 for (TopExp_Explorer exp(W,TopAbs_EDGE); exp.More(); exp.Next()) {
1019 const TopoDS_Edge& E = TopoDS::Edge(exp.Current());
1020 int nb = aMesh.GetSubMesh(E)->GetSubMeshDS()->NbNodes();
1023 nbPoints += nb + 1; // internal points plus 1 vertex of 2 (last point ?)
1029 //================================================================================
1031 * Method in which an algorithm generating a structured mesh
1032 * fixes positions of in-face nodes after there movement
1033 * due to insertion of viscous layers.
1035 //================================================================================
1037 bool SMESH_2D_Algo::FixInternalNodes(const SMESH_ProxyMesh& mesh,
1038 const TopoDS_Face& face)
1040 const SMESHDS_SubMesh* smDS = mesh.GetSubMesh(face);
1041 if ( !smDS || smDS->NbElements() < 1 )
1044 SMESH_MesherHelper helper( *mesh.GetMesh() );
1046 // get all faces from a proxy sub-mesh
1047 typedef SMDS_StdIterator< const SMDS_MeshElement*, SMDS_ElemIteratorPtr > TIterator;
1048 TIDSortedElemSet allFaces( TIterator( smDS->GetElements() ), TIterator() );
1049 TIDSortedElemSet avoidSet, firstRowQuads;
1051 // indices of nodes to pass to a neighbour quad using SMESH_MeshAlgos::FindFaceInSet()
1054 // get two first rows of nodes by passing through the first row of faces
1055 vector< vector< const SMDS_MeshNode* > > nodeRows;
1056 int iRow1 = 0, iRow2 = 1;
1057 const SMDS_MeshElement* quad;
1059 // look for a corner quadrangle and it's corner node
1060 const SMDS_MeshElement* cornerQuad = 0;
1061 int cornerNodeInd = -1;
1062 SMDS_ElemIteratorPtr fIt = smDS->GetElements();
1063 while ( !cornerQuad && fIt->more() )
1065 cornerQuad = fIt->next();
1066 if ( cornerQuad->NbCornerNodes() != 4 )
1068 SMDS_NodeIteratorPtr nIt = cornerQuad->nodeIterator();
1069 for ( int i = 0; i < 4; ++i )
1071 int nbInverseQuads = 0;
1072 SMDS_ElemIteratorPtr fIt = nIt->next()->GetInverseElementIterator(SMDSAbs_Face);
1073 while ( fIt->more() )
1074 nbInverseQuads += allFaces.count( fIt->next() );
1075 if ( nbInverseQuads == 1 )
1076 cornerNodeInd = i, i = 4;
1078 if ( cornerNodeInd < 0 )
1081 if ( !cornerQuad || cornerNodeInd < 0 )
1084 iN1 = helper.WrapIndex( cornerNodeInd + 1, 4 );
1085 iN2 = helper.WrapIndex( cornerNodeInd + 2, 4 );
1086 int iN3 = helper.WrapIndex( cornerNodeInd + 3, 4 );
1088 nodeRows[iRow1].push_back( cornerQuad->GetNode( cornerNodeInd ));
1089 nodeRows[iRow1].push_back( cornerQuad->GetNode( iN1 ));
1090 nodeRows[iRow2].push_back( cornerQuad->GetNode( iN3 ));
1091 nodeRows[iRow2].push_back( cornerQuad->GetNode( iN2 ));
1092 firstRowQuads.insert( cornerQuad );
1094 // pass through the rest quads in a face row
1099 avoidSet.insert( quad );
1100 if (( quad = SMESH_MeshAlgos::FindFaceInSet( nodeRows[iRow1].back(),
1101 nodeRows[iRow2].back(),
1102 allFaces, avoidSet, &iN1, &iN2)))
1104 nodeRows[iRow1].push_back( quad->GetNode( helper.WrapIndex( iN2 + 2, 4 )));
1105 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN1 + 2, 4 )));
1106 if ( quad->NbCornerNodes() != 4 )
1110 if ( nodeRows[iRow1].size() < 3 )
1111 return true; // there is nothing to fix
1114 nodeRows.reserve( smDS->NbElements() / nodeRows[iRow1].size() );
1116 // get the rest node rows
1121 // get the first quad in the next face row
1122 if (( quad = SMESH_MeshAlgos::FindFaceInSet( nodeRows[iRow1][0],
1124 allFaces, /*avoid=*/firstRowQuads,
1127 if ( quad->NbCornerNodes() != 4 )
1129 nodeRows.resize( iRow2+1 );
1130 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN2 + 2, 4 )));
1131 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN1 + 2, 4 )));
1132 firstRowQuads.insert( quad );
1136 break; // no more rows
1139 // pass through the rest quads in a face row
1143 avoidSet.insert( quad );
1144 if (( quad = SMESH_MeshAlgos::FindFaceInSet( nodeRows[iRow1][ nodeRows[iRow2].size()-1 ],
1145 nodeRows[iRow2].back(),
1146 allFaces, avoidSet, &iN1, &iN2)))
1148 if ( quad->NbCornerNodes() != 4 )
1150 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN1 + 2, 4 )));
1153 if ( nodeRows[iRow1].size() != nodeRows[iRow2].size() )
1156 if ( nodeRows.size() < 3 )
1157 return true; // there is nothing to fix
1159 // get params of the first (bottom) and last (top) node rows
1160 UVPtStructVec uvB( nodeRows[0].size() ), uvT( nodeRows[0].size() );
1161 for ( int isBot = 0; isBot < 2; ++isBot )
1163 UVPtStructVec & uvps = isBot ? uvB : uvT;
1164 vector< const SMDS_MeshNode* >& nodes = nodeRows[ isBot ? 0 : nodeRows.size()-1 ];
1165 for ( size_t i = 0; i < nodes.size(); ++i )
1167 uvps[i].node = nodes[i];
1168 gp_XY uv = helper.GetNodeUV( face, uvps[i].node );
1169 uvps[i].u = uv.Coord(1);
1170 uvps[i].v = uv.Coord(2);
1173 // calculate x (normalized param)
1174 for ( size_t i = 1; i < nodes.size(); ++i )
1175 uvps[i].x = uvps[i-1].x + SMESH_TNodeXYZ( uvps[i-1].node ).Distance( uvps[i].node );
1176 for ( size_t i = 1; i < nodes.size(); ++i )
1177 uvps[i].x /= uvps.back().x;
1180 // get params of the left and right node rows
1181 UVPtStructVec uvL( nodeRows.size() ), uvR( nodeRows.size() );
1182 for ( int isLeft = 0; isLeft < 2; ++isLeft )
1184 UVPtStructVec & uvps = isLeft ? uvL : uvR;
1185 const int iCol = isLeft ? 0 : nodeRows[0].size() - 1;
1186 for ( size_t i = 0; i < nodeRows.size(); ++i )
1188 uvps[i].node = nodeRows[i][iCol];
1189 gp_XY uv = helper.GetNodeUV( face, uvps[i].node );
1190 uvps[i].u = uv.Coord(1);
1191 uvps[i].v = uv.Coord(2);
1194 // calculate y (normalized param)
1195 for ( size_t i = 1; i < nodeRows.size(); ++i )
1196 uvps[i].y = uvps[i-1].y + SMESH_TNodeXYZ( uvps[i-1].node ).Distance( uvps[i].node );
1197 for ( size_t i = 1; i < nodeRows.size(); ++i )
1198 uvps[i].y /= uvps.back().y;
1201 // update node coordinates
1202 SMESHDS_Mesh* meshDS = mesh.GetMeshDS();
1203 Handle(Geom_Surface) S = BRep_Tool::Surface( face );
1204 gp_XY a0 ( uvB.front().u, uvB.front().v );
1205 gp_XY a1 ( uvB.back().u, uvB.back().v );
1206 gp_XY a2 ( uvT.back().u, uvT.back().v );
1207 gp_XY a3 ( uvT.front().u, uvT.front().v );
1208 for ( size_t iRow = 1; iRow < nodeRows.size()-1; ++iRow )
1210 gp_XY p1 ( uvR[ iRow ].u, uvR[ iRow ].v );
1211 gp_XY p3 ( uvL[ iRow ].u, uvL[ iRow ].v );
1212 const double y0 = uvL[ iRow ].y;
1213 const double y1 = uvR[ iRow ].y;
1214 for ( size_t iCol = 1; iCol < nodeRows[0].size()-1; ++iCol )
1216 gp_XY p0 ( uvB[ iCol ].u, uvB[ iCol ].v );
1217 gp_XY p2 ( uvT[ iCol ].u, uvT[ iCol ].v );
1218 const double x0 = uvB[ iCol ].x;
1219 const double x1 = uvT[ iCol ].x;
1220 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1221 double y = y0 + x * (y1 - y0);
1222 gp_XY uv = helper.calcTFI( x, y, a0,a1,a2,a3, p0,p1,p2,p3 );
1223 gp_Pnt p = S->Value( uv.Coord(1), uv.Coord(2));
1224 const SMDS_MeshNode* n = nodeRows[iRow][iCol];
1225 meshDS->MoveNode( n, p.X(), p.Y(), p.Z() );
1226 if ( SMDS_FacePosition* pos = dynamic_cast< SMDS_FacePosition*>( n->GetPosition() ))
1227 pos->SetParameters( uv.Coord(1), uv.Coord(2) );