1 // Copyright (C) 2007-2013 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.
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 //gen->_mapAlgo[hypId] = this;
183 _onlyUnaryInput = _requireDiscreteBoundary = _requireShape = true;
184 _quadraticMesh = _supportSubmeshes = false;
186 for ( int i = 0; i < 4; ++i )
187 _neededLowerHyps[ i ] = false;
190 //=============================================================================
194 //=============================================================================
196 SMESH_Algo::~SMESH_Algo()
200 //=============================================================================
204 //=============================================================================
206 SMESH_0D_Algo::SMESH_0D_Algo(int hypId, int studyId, SMESH_Gen* gen)
207 : SMESH_Algo(hypId, studyId, gen)
209 _shapeType = (1 << TopAbs_VERTEX);
211 //gen->_map0D_Algo[hypId] = this;
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);
218 //gen->_map1D_Algo[hypId] = this;
220 SMESH_2D_Algo::SMESH_2D_Algo(int hypId, int studyId, SMESH_Gen* gen)
221 : SMESH_Algo(hypId, studyId, gen)
223 _shapeType = (1 << TopAbs_FACE);
225 //gen->_map2D_Algo[hypId] = this;
227 SMESH_3D_Algo::SMESH_3D_Algo(int hypId, int studyId, SMESH_Gen* gen)
228 : SMESH_Algo(hypId, studyId, gen)
230 _shapeType = (1 << TopAbs_SOLID);
232 //gen->_map3D_Algo[hypId] = this;
235 //=============================================================================
237 * Usually an algoritm has nothing to save
239 //=============================================================================
241 ostream & SMESH_Algo::SaveTo(ostream & save) { return save; }
242 istream & SMESH_Algo::LoadFrom(istream & load) { return load; }
244 //=============================================================================
248 //=============================================================================
250 const vector < string > &SMESH_Algo::GetCompatibleHypothesis()
252 return _compatibleHypothesis;
255 //=============================================================================
257 * List the hypothesis used by the algorithm associated to the shape.
258 * Hypothesis associated to father shape -are- taken into account (see
259 * GetAppliedHypothesis). Relevant hypothesis have a name (type) listed in
260 * the algorithm. This method could be surcharged by specific algorithms, in
261 * case of several hypothesis simultaneously applicable.
263 //=============================================================================
265 const list <const SMESHDS_Hypothesis *> &
266 SMESH_Algo::GetUsedHypothesis(SMESH_Mesh & aMesh,
267 const TopoDS_Shape & aShape,
268 const bool ignoreAuxiliary) const
270 SMESH_Algo* me = const_cast< SMESH_Algo* >( this );
271 me->_usedHypList.clear();
272 SMESH_HypoFilter filter;
273 if ( InitCompatibleHypoFilter( filter, ignoreAuxiliary ))
275 aMesh.GetHypotheses( aShape, filter, me->_usedHypList, true );
276 if ( ignoreAuxiliary && _usedHypList.size() > 1 )
277 me->_usedHypList.clear(); //only one compatible hypothesis allowed
282 //=============================================================================
284 * List the relevant hypothesis associated to the shape. Relevant hypothesis
285 * have a name (type) listed in the algorithm. Hypothesis associated to
286 * father shape -are not- taken into account (see GetUsedHypothesis)
288 //=============================================================================
290 const list<const SMESHDS_Hypothesis *> &
291 SMESH_Algo::GetAppliedHypothesis(SMESH_Mesh & aMesh,
292 const TopoDS_Shape & aShape,
293 const bool ignoreAuxiliary) const
295 SMESH_Algo* me = const_cast< SMESH_Algo* >( this );
296 me->_appliedHypList.clear();
297 SMESH_HypoFilter filter;
298 if ( InitCompatibleHypoFilter( filter, ignoreAuxiliary ))
299 aMesh.GetHypotheses( aShape, filter, me->_appliedHypList, false );
301 return _appliedHypList;
304 //=============================================================================
306 * Compute length of an edge
308 //=============================================================================
310 double SMESH_Algo::EdgeLength(const TopoDS_Edge & E)
312 double UMin = 0, UMax = 0;
314 Handle(Geom_Curve) C = BRep_Tool::Curve(E, L, UMin, UMax);
317 GeomAdaptor_Curve AdaptCurve(C, UMin, UMax); //range is important for periodic curves
318 double length = GCPnts_AbscissaPoint::Length(AdaptCurve, UMin, UMax);
322 //================================================================================
324 * \brief Just return false as the algorithm does not hold parameters values
326 //================================================================================
328 bool SMESH_Algo::SetParametersByMesh(const SMESH_Mesh* /*theMesh*/,
329 const TopoDS_Shape& /*theShape*/)
333 bool SMESH_Algo::SetParametersByDefaults(const TDefaults& , const SMESH_Mesh*)
337 //================================================================================
339 * \brief Fill vector of node parameters on geometrical edge, including vertex nodes
340 * \param theMesh - The mesh containing nodes
341 * \param theEdge - The geometrical edge of interest
342 * \param theParams - The resulting vector of sorted node parameters
343 * \retval bool - false if not all parameters are OK
345 //================================================================================
347 bool SMESH_Algo::GetNodeParamOnEdge(const SMESHDS_Mesh* theMesh,
348 const TopoDS_Edge& theEdge,
349 vector< double > & theParams)
353 if ( !theMesh || theEdge.IsNull() )
356 SMESHDS_SubMesh * eSubMesh = theMesh->MeshElements( theEdge );
357 if ( !eSubMesh || !eSubMesh->GetElements()->more() )
358 return false; // edge is not meshed
360 //int nbEdgeNodes = 0;
361 set < double > paramSet;
364 // loop on nodes of an edge: sort them by param on edge
365 SMDS_NodeIteratorPtr nIt = eSubMesh->GetNodes();
366 while ( nIt->more() )
368 const SMDS_MeshNode* node = nIt->next();
369 const SMDS_PositionPtr& pos = node->GetPosition();
370 if ( pos->GetTypeOfPosition() != SMDS_TOP_EDGE )
372 const SMDS_EdgePosition* epos =
373 static_cast<const SMDS_EdgePosition*>(node->GetPosition());
374 if ( !paramSet.insert( epos->GetUParameter() ).second )
375 return false; // equal parameters
378 // add vertex nodes params
380 TopExp::Vertices( theEdge, V1, V2);
381 if ( VertexNode( V1, theMesh ) &&
382 !paramSet.insert( BRep_Tool::Parameter(V1,theEdge) ).second )
383 return false; // there are equal parameters
384 if ( VertexNode( V2, theMesh ) &&
385 !paramSet.insert( BRep_Tool::Parameter(V2,theEdge) ).second )
386 return false; // there are equal parameters
389 theParams.resize( paramSet.size() );
390 set < double >::iterator par = paramSet.begin();
391 vector< double >::iterator vecPar = theParams.begin();
392 for ( ; par != paramSet.end(); ++par, ++vecPar )
395 return theParams.size() > 1;
398 //================================================================================
400 * \brief Fill vector of node parameters on geometrical edge, including vertex nodes
401 * \param theMesh - The mesh containing nodes
402 * \param theEdge - The geometrical edge of interest
403 * \param theParams - The resulting vector of sorted node parameters
404 * \retval bool - false if not all parameters are OK
406 //================================================================================
408 bool SMESH_Algo::GetSortedNodesOnEdge(const SMESHDS_Mesh* theMesh,
409 const TopoDS_Edge& theEdge,
410 const bool ignoreMediumNodes,
411 map< double, const SMDS_MeshNode* > & theNodes)
415 if ( !theMesh || theEdge.IsNull() )
418 SMESHDS_SubMesh * eSubMesh = theMesh->MeshElements( theEdge );
419 if ( !eSubMesh || !eSubMesh->GetElements()->more() )
420 return false; // edge is not meshed
423 set < double > paramSet;
426 // loop on nodes of an edge: sort them by param on edge
427 SMDS_NodeIteratorPtr nIt = eSubMesh->GetNodes();
428 while ( nIt->more() )
430 const SMDS_MeshNode* node = nIt->next();
431 if ( ignoreMediumNodes ) {
432 SMDS_ElemIteratorPtr elemIt = node->GetInverseElementIterator();
433 if ( elemIt->more() && elemIt->next()->IsMediumNode( node ))
436 const SMDS_PositionPtr& pos = node->GetPosition();
437 if ( pos->GetTypeOfPosition() != SMDS_TOP_EDGE )
439 const SMDS_EdgePosition* epos =
440 static_cast<const SMDS_EdgePosition*>(node->GetPosition());
441 theNodes.insert( theNodes.end(), make_pair( epos->GetUParameter(), node ));
442 //MESSAGE("U " << epos->GetUParameter() << " ID " << node->GetID());
447 TopoDS_Vertex v1, v2;
448 TopExp::Vertices(theEdge, v1, v2);
449 const SMDS_MeshNode* n1 = VertexNode( v1, (SMESHDS_Mesh*) theMesh );
450 const SMDS_MeshNode* n2 = VertexNode( v2, (SMESHDS_Mesh*) theMesh );
451 //MESSAGE("Vertices ID " << n1->GetID() << " " << n2->GetID());
453 BRep_Tool::Range(theEdge, f, l);
454 if ( v1.Orientation() != TopAbs_FORWARD )
456 if ( n1 && ++nbNodes )
457 theNodes.insert( make_pair( f, n1 ));
458 if ( n2 && ++nbNodes )
459 theNodes.insert( make_pair( l, n2 ));
461 return theNodes.size() == nbNodes;
464 //================================================================================
466 * \brief Make filter recognize only compatible hypotheses
467 * \param theFilter - the filter to initialize
468 * \param ignoreAuxiliary - make filter ignore compatible auxiliary hypotheses
470 //================================================================================
472 bool SMESH_Algo::InitCompatibleHypoFilter( SMESH_HypoFilter & theFilter,
473 const bool ignoreAuxiliary) const
475 if ( !_compatibleHypothesis.empty() )
477 theFilter.Init( theFilter.HasName( _compatibleHypothesis[0] ));
478 for ( int i = 1; i < _compatibleHypothesis.size(); ++i )
479 theFilter.Or( theFilter.HasName( _compatibleHypothesis[ i ] ));
481 if ( ignoreAuxiliary )
482 theFilter.AndNot( theFilter.IsAuxiliary() );
489 //================================================================================
491 * \brief Return continuity of two edges
492 * \param E1 - the 1st edge
493 * \param E2 - the 2nd edge
494 * \retval GeomAbs_Shape - regularity at the junction between E1 and E2
496 //================================================================================
498 GeomAbs_Shape SMESH_Algo::Continuity(TopoDS_Edge E1,
501 //E1.Orientation(TopAbs_FORWARD), E2.Orientation(TopAbs_FORWARD); // avoid pb with internal edges
502 if (E1.Orientation() > TopAbs_REVERSED) // INTERNAL
503 E1.Orientation( TopAbs_FORWARD );
504 if (E2.Orientation() > TopAbs_REVERSED) // INTERNAL
505 E2.Orientation( TopAbs_FORWARD );
507 TopoDS_Vertex V, VV1[2], VV2[2];
508 TopExp::Vertices( E1, VV1[0], VV1[1], true );
509 TopExp::Vertices( E2, VV2[0], VV2[1], true );
510 if ( VV1[1].IsSame( VV2[0] )) { V = VV1[1]; }
511 else if ( VV1[0].IsSame( VV2[1] )) { V = VV1[0]; }
512 else if ( VV1[1].IsSame( VV2[1] )) { V = VV1[1]; E1.Reverse(); }
513 else if ( VV1[0].IsSame( VV2[0] )) { V = VV1[0]; E1.Reverse(); }
514 else { return GeomAbs_C0; }
516 Standard_Real u1 = BRep_Tool::Parameter( V, E1 );
517 Standard_Real u2 = BRep_Tool::Parameter( V, E2 );
518 BRepAdaptor_Curve C1( E1 ), C2( E2 );
519 Standard_Real tol = BRep_Tool::Tolerance( V );
520 Standard_Real angTol = 2e-3;
522 #if OCC_VERSION_LARGE > 0x06010000
525 return BRepLProp::Continuity(C1, C2, u1, u2, tol, angTol);
527 catch (Standard_Failure) {
532 //================================================================================
534 * \brief Return true if an edge can be considered straight
536 //================================================================================
538 bool SMESH_Algo::isStraight( const TopoDS_Edge & E,
539 const bool degenResult)
543 if ( BRep_Tool::Curve( E, f, l ).IsNull())
546 BRepAdaptor_Curve curve( E );
547 switch( curve.GetType() )
552 case GeomAbs_Ellipse:
553 case GeomAbs_Hyperbola:
554 case GeomAbs_Parabola:
556 // case GeomAbs_BezierCurve:
557 // case GeomAbs_BSplineCurve:
558 // case GeomAbs_OtherCurve:
561 const double f = curve.FirstParameter();
562 const double l = curve.LastParameter();
563 const gp_Pnt pf = curve.Value( f );
564 const gp_Pnt pl = curve.Value( l );
565 const gp_Vec v1( pf, pl );
566 const double v1Len = v1.Magnitude();
567 if ( v1Len < std::numeric_limits< double >::min() )
568 return false; // E seems closed
569 const double tol = Min( 10 * curve.Tolerance(), v1Len * 1e-2 );
570 const int nbSamples = 7;
571 for ( int i = 0; i < nbSamples; ++i )
573 const double r = ( i + 1 ) / nbSamples;
574 const gp_Pnt pi = curve.Value( f * r + l * ( 1 - r ));
575 const gp_Vec vi( pf, pi );
576 const double h = 0.5 * v1.Crossed( vi ).Magnitude() / v1Len;
583 //================================================================================
585 * \brief Return true if an edge has no 3D curve
587 //================================================================================
589 bool SMESH_Algo::isDegenerated( const TopoDS_Edge & E )
593 Handle(Geom_Curve) C = BRep_Tool::Curve( E, loc, f,l );
597 //================================================================================
599 * \brief Return the node built on a vertex
600 * \param V - the vertex
601 * \param meshDS - mesh
602 * \retval const SMDS_MeshNode* - found node or NULL
604 //================================================================================
606 const SMDS_MeshNode* SMESH_Algo::VertexNode(const TopoDS_Vertex& V,
607 const SMESHDS_Mesh* meshDS)
609 if ( SMESHDS_SubMesh* sm = meshDS->MeshElements(V) ) {
610 SMDS_NodeIteratorPtr nIt= sm->GetNodes();
617 //=======================================================================
618 //function : GetMeshError
619 //purpose : Finds topological errors of a sub-mesh
620 //WARNING : 1D check is NOT implemented so far
621 //=======================================================================
623 SMESH_Algo::EMeshError SMESH_Algo::GetMeshError(SMESH_subMesh* subMesh)
625 EMeshError err = MEr_OK;
627 SMESHDS_SubMesh* smDS = subMesh->GetSubMeshDS();
631 switch ( subMesh->GetSubShape().ShapeType() )
633 case TopAbs_FACE: { // ====================== 2D =====================
635 SMDS_ElemIteratorPtr fIt = smDS->GetElements();
639 // We check that olny links on EDGEs encouter once, the rest links, twice
640 set< SMESH_TLink > links;
641 while ( fIt->more() )
643 const SMDS_MeshElement* f = fIt->next();
644 int nbNodes = f->NbCornerNodes(); // ignore medium nodes
645 for ( int i = 0; i < nbNodes; ++i )
647 const SMDS_MeshNode* n1 = f->GetNode( i );
648 const SMDS_MeshNode* n2 = f->GetNode(( i+1 ) % nbNodes);
649 std::pair< set< SMESH_TLink >::iterator, bool > it_added =
650 links.insert( SMESH_TLink( n1, n2 ));
651 if ( !it_added.second )
652 // As we do NOT(!) check if mesh is manifold, we believe that a link can
653 // encounter once or twice only (not three times), we erase a link as soon
654 // as it encounters twice to speed up search in the <links> map.
655 links.erase( it_added.first );
658 // the links remaining in the <links> should all be on EDGE
659 set< SMESH_TLink >::iterator linkIt = links.begin();
660 for ( ; linkIt != links.end(); ++linkIt )
662 const SMESH_TLink& link = *linkIt;
663 if ( link.node1()->GetPosition()->GetTypeOfPosition() > SMDS_TOP_EDGE ||
664 link.node2()->GetPosition()->GetTypeOfPosition() > SMDS_TOP_EDGE )
667 // TODO: to check orientation
670 case TopAbs_SOLID: { // ====================== 3D =====================
672 SMDS_ElemIteratorPtr vIt = smDS->GetElements();
676 SMDS_VolumeTool vTool;
677 while ( !vIt->more() )
679 if (!vTool.Set( vIt->next() ))
682 for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
683 if ( vTool.IsFreeFace( iF ))
685 int nbN = vTool.NbFaceNodes( iF );
686 const SMDS_MeshNode** nodes = vTool.GetFaceNodes( iF );
687 for ( int i = 0; i < nbN; ++i )
688 if ( nodes[i]->GetPosition()->GetTypeOfPosition() > SMDS_TOP_FACE )
699 //================================================================================
701 * \brief Sets event listener to submeshes if necessary
702 * \param subMesh - submesh where algo is set
704 * After being set, event listener is notified on each event of a submesh.
705 * By default non listener is set
707 //================================================================================
709 void SMESH_Algo::SetEventListener(SMESH_subMesh* /*subMesh*/)
713 //================================================================================
715 * \brief Allow algo to do something after persistent restoration
716 * \param subMesh - restored submesh
718 * This method is called only if a submesh has HYP_OK algo_state.
720 //================================================================================
722 void SMESH_Algo::SubmeshRestored(SMESH_subMesh* /*subMesh*/)
726 //================================================================================
728 * \brief Computes mesh without geometry
729 * \param aMesh - the mesh
730 * \param aHelper - helper that must be used for adding elements to \aaMesh
731 * \retval bool - is a success
733 //================================================================================
735 bool SMESH_Algo::Compute(SMESH_Mesh & /*aMesh*/, SMESH_MesherHelper* /*aHelper*/)
737 return error( COMPERR_BAD_INPUT_MESH, "Mesh built on shape expected");
740 //=======================================================================
741 //function : CancelCompute
742 //purpose : Sets _computeCanceled to true. It's usage depends on
743 // * implementation of a particular mesher.
744 //=======================================================================
746 void SMESH_Algo::CancelCompute()
748 _computeCanceled = true;
749 _error = COMPERR_CANCELED;
752 //================================================================================
754 * If possible, returns progress of computation [0.,1.]
756 //================================================================================
758 double SMESH_Algo::GetProgress() const
763 //================================================================================
765 * \brief store error and comment and then return ( error == COMPERR_OK )
767 //================================================================================
769 bool SMESH_Algo::error(int error, const SMESH_Comment& comment)
773 return ( error == COMPERR_OK );
776 //================================================================================
778 * \brief store error and return ( error == COMPERR_OK )
780 //================================================================================
782 bool SMESH_Algo::error(SMESH_ComputeErrorPtr error)
785 _error = error->myName;
786 _comment = error->myComment;
787 _badInputElements = error->myBadElements;
788 return error->IsOK();
793 //================================================================================
795 * \brief return compute error
797 //================================================================================
799 SMESH_ComputeErrorPtr SMESH_Algo::GetComputeError() const
801 SMESH_ComputeErrorPtr err = SMESH_ComputeError::New( _error, _comment, this );
802 // hope this method is called by only SMESH_subMesh after this->Compute()
803 err->myBadElements.splice( err->myBadElements.end(),
804 (list<const SMDS_MeshElement*>&) _badInputElements );
808 //================================================================================
810 * \brief initialize compute error before call of Compute()
812 //================================================================================
814 void SMESH_Algo::InitComputeError()
818 list<const SMDS_MeshElement*>::iterator elem = _badInputElements.begin();
819 for ( ; elem != _badInputElements.end(); ++elem )
820 if ( (*elem)->GetID() < 1 )
822 _badInputElements.clear();
824 _computeCanceled = false;
829 //================================================================================
831 * \brief Return compute progress by nb of calls of this method
833 //================================================================================
835 double SMESH_Algo::GetProgressByTic() const
838 for ( size_t i = 0; i < _smToCompute.size(); ++i )
839 computeCost += _smToCompute[i]->GetComputeCost();
841 const_cast<SMESH_Algo*>( this )->_progressTic++;
843 double x = 5 * _progressTic;
844 x = ( x < computeCost ) ? ( x / computeCost ) : 1.;
845 return 0.9 * sin( x * M_PI / 2 );
848 //================================================================================
850 * \brief store a bad input element preventing computation,
851 * which may be a temporary one i.e. not residing the mesh,
852 * then it will be deleted by InitComputeError()
854 //================================================================================
856 void SMESH_Algo::addBadInputElement(const SMDS_MeshElement* elem)
859 _badInputElements.push_back( elem );
862 //=======================================================================
863 //function : addBadInputElements
864 //purpose : store a bad input elements or nodes preventing computation
865 //=======================================================================
867 void SMESH_Algo::addBadInputElements(const SMESHDS_SubMesh* sm,
874 SMDS_NodeIteratorPtr nIt = sm->GetNodes();
875 while ( nIt->more() ) addBadInputElement( nIt->next() );
879 SMDS_ElemIteratorPtr eIt = sm->GetElements();
880 while ( eIt->more() ) addBadInputElement( eIt->next() );
885 //=============================================================================
889 //=============================================================================
891 // int SMESH_Algo::NumberOfWires(const TopoDS_Shape& S)
894 // for (TopExp_Explorer exp(S,TopAbs_WIRE); exp.More(); exp.Next())
899 //=============================================================================
903 //=============================================================================
905 int SMESH_Algo::NumberOfPoints(SMESH_Mesh& aMesh, const TopoDS_Wire& W)
908 for (TopExp_Explorer exp(W,TopAbs_EDGE); exp.More(); exp.Next()) {
909 const TopoDS_Edge& E = TopoDS::Edge(exp.Current());
910 int nb = aMesh.GetSubMesh(E)->GetSubMeshDS()->NbNodes();
913 nbPoints += nb + 1; // internal points plus 1 vertex of 2 (last point ?)
919 //================================================================================
921 * Method in which an algorithm generating a structured mesh
922 * fixes positions of in-face nodes after there movement
923 * due to insertion of viscous layers.
925 //================================================================================
927 bool SMESH_2D_Algo::FixInternalNodes(const SMESH_ProxyMesh& mesh,
928 const TopoDS_Face& face)
930 const SMESHDS_SubMesh* smDS = mesh.GetSubMesh(face);
931 if ( !smDS || smDS->NbElements() < 1 )
934 SMESH_MesherHelper helper( *mesh.GetMesh() );
936 // get all faces from a proxy sub-mesh
937 typedef SMDS_StdIterator< const SMDS_MeshElement*, SMDS_ElemIteratorPtr > TIterator;
938 TIDSortedElemSet allFaces( TIterator( smDS->GetElements() ), TIterator() );
939 TIDSortedElemSet avoidSet, firstRowQuads;
941 // indices of nodes to pass to a neighbour quad using SMESH_MeshAlgos::FindFaceInSet()
944 // get two first rows of nodes by passing through the first row of faces
945 vector< vector< const SMDS_MeshNode* > > nodeRows;
946 int iRow1 = 0, iRow2 = 1;
947 const SMDS_MeshElement* quad;
949 // look for a corner quadrangle and it's corner node
950 const SMDS_MeshElement* cornerQuad = 0;
951 int cornerNodeInd = -1;
952 SMDS_ElemIteratorPtr fIt = smDS->GetElements();
953 while ( !cornerQuad && fIt->more() )
955 cornerQuad = fIt->next();
956 if ( cornerQuad->NbCornerNodes() != 4 )
958 SMDS_NodeIteratorPtr nIt = cornerQuad->nodeIterator();
959 for ( int i = 0; i < 4; ++i )
961 int nbInverseQuads = 0;
962 SMDS_ElemIteratorPtr fIt = nIt->next()->GetInverseElementIterator(SMDSAbs_Face);
963 while ( fIt->more() )
964 nbInverseQuads += allFaces.count( fIt->next() );
965 if ( nbInverseQuads == 1 )
966 cornerNodeInd = i, i = 4;
968 if ( cornerNodeInd < 0 )
971 if ( !cornerQuad || cornerNodeInd < 0 )
974 iN1 = helper.WrapIndex( cornerNodeInd + 1, 4 );
975 iN2 = helper.WrapIndex( cornerNodeInd + 2, 4 );
976 int iN3 = helper.WrapIndex( cornerNodeInd + 3, 4 );
978 nodeRows[iRow1].push_back( cornerQuad->GetNode( cornerNodeInd ));
979 nodeRows[iRow1].push_back( cornerQuad->GetNode( iN1 ));
980 nodeRows[iRow2].push_back( cornerQuad->GetNode( iN3 ));
981 nodeRows[iRow2].push_back( cornerQuad->GetNode( iN2 ));
982 firstRowQuads.insert( cornerQuad );
984 // pass through the rest quads in a face row
989 avoidSet.insert( quad );
990 if (( quad = SMESH_MeshAlgos::FindFaceInSet( nodeRows[iRow1].back(),
991 nodeRows[iRow2].back(),
992 allFaces, avoidSet, &iN1, &iN2)))
994 nodeRows[iRow1].push_back( quad->GetNode( helper.WrapIndex( iN2 + 2, 4 )));
995 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN1 + 2, 4 )));
996 if ( quad->NbCornerNodes() != 4 )
1000 if ( nodeRows[iRow1].size() < 3 )
1001 return true; // there is nothing to fix
1004 nodeRows.reserve( smDS->NbElements() / nodeRows[iRow1].size() );
1006 // get the rest node rows
1011 // get the first quad in the next face row
1012 if (( quad = SMESH_MeshAlgos::FindFaceInSet( nodeRows[iRow1][0],
1014 allFaces, /*avoid=*/firstRowQuads,
1017 if ( quad->NbCornerNodes() != 4 )
1019 nodeRows.resize( iRow2+1 );
1020 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN2 + 2, 4 )));
1021 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN1 + 2, 4 )));
1022 firstRowQuads.insert( quad );
1026 break; // no more rows
1029 // pass through the rest quads in a face row
1033 avoidSet.insert( quad );
1034 if (( quad = SMESH_MeshAlgos::FindFaceInSet( nodeRows[iRow1][ nodeRows[iRow2].size()-1 ],
1035 nodeRows[iRow2].back(),
1036 allFaces, avoidSet, &iN1, &iN2)))
1038 if ( quad->NbCornerNodes() != 4 )
1040 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN1 + 2, 4 )));
1043 if ( nodeRows[iRow1].size() != nodeRows[iRow2].size() )
1046 if ( nodeRows.size() < 3 )
1047 return true; // there is nothing to fix
1049 // get params of the first (bottom) and last (top) node rows
1050 UVPtStructVec uvB( nodeRows[0].size() ), uvT( nodeRows[0].size() );
1051 for ( int isBot = 0; isBot < 2; ++isBot )
1053 UVPtStructVec & uvps = isBot ? uvB : uvT;
1054 vector< const SMDS_MeshNode* >& nodes = nodeRows[ isBot ? 0 : nodeRows.size()-1 ];
1055 for ( size_t i = 0; i < nodes.size(); ++i )
1057 uvps[i].node = nodes[i];
1058 gp_XY uv = helper.GetNodeUV( face, uvps[i].node );
1059 uvps[i].u = uv.Coord(1);
1060 uvps[i].v = uv.Coord(2);
1063 // calculate x (normalized param)
1064 for ( size_t i = 1; i < nodes.size(); ++i )
1065 uvps[i].x = uvps[i-1].x + SMESH_TNodeXYZ( uvps[i-1].node ).Distance( uvps[i].node );
1066 for ( size_t i = 1; i < nodes.size(); ++i )
1067 uvps[i].x /= uvps.back().x;
1070 // get params of the left and right node rows
1071 UVPtStructVec uvL( nodeRows.size() ), uvR( nodeRows.size() );
1072 for ( int isLeft = 0; isLeft < 2; ++isLeft )
1074 UVPtStructVec & uvps = isLeft ? uvL : uvR;
1075 const int iCol = isLeft ? 0 : nodeRows[0].size() - 1;
1076 for ( size_t i = 0; i < nodeRows.size(); ++i )
1078 uvps[i].node = nodeRows[i][iCol];
1079 gp_XY uv = helper.GetNodeUV( face, uvps[i].node );
1080 uvps[i].u = uv.Coord(1);
1081 uvps[i].v = uv.Coord(2);
1084 // calculate y (normalized param)
1085 for ( size_t i = 1; i < nodeRows.size(); ++i )
1086 uvps[i].y = uvps[i-1].y + SMESH_TNodeXYZ( uvps[i-1].node ).Distance( uvps[i].node );
1087 for ( size_t i = 1; i < nodeRows.size(); ++i )
1088 uvps[i].y /= uvps.back().y;
1091 // update node coordinates
1092 SMESHDS_Mesh* meshDS = mesh.GetMeshDS();
1093 Handle(Geom_Surface) S = BRep_Tool::Surface( face );
1094 gp_XY a0 ( uvB.front().u, uvB.front().v );
1095 gp_XY a1 ( uvB.back().u, uvB.back().v );
1096 gp_XY a2 ( uvT.back().u, uvT.back().v );
1097 gp_XY a3 ( uvT.front().u, uvT.front().v );
1098 for ( size_t iRow = 1; iRow < nodeRows.size()-1; ++iRow )
1100 gp_XY p1 ( uvR[ iRow ].u, uvR[ iRow ].v );
1101 gp_XY p3 ( uvL[ iRow ].u, uvL[ iRow ].v );
1102 const double y0 = uvL[ iRow ].y;
1103 const double y1 = uvR[ iRow ].y;
1104 for ( size_t iCol = 1; iCol < nodeRows[0].size()-1; ++iCol )
1106 gp_XY p0 ( uvB[ iCol ].u, uvB[ iCol ].v );
1107 gp_XY p2 ( uvT[ iCol ].u, uvT[ iCol ].v );
1108 const double x0 = uvB[ iCol ].x;
1109 const double x1 = uvT[ iCol ].x;
1110 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1111 double y = y0 + x * (y1 - y0);
1112 gp_XY uv = helper.calcTFI( x, y, a0,a1,a2,a3, p0,p1,p2,p3 );
1113 gp_Pnt p = S->Value( uv.Coord(1), uv.Coord(2));
1114 const SMDS_MeshNode* n = nodeRows[iRow][iCol];
1115 meshDS->MoveNode( n, p.X(), p.Y(), p.Z() );
1116 if ( SMDS_FacePosition* pos = dynamic_cast< SMDS_FacePosition*>( n->GetPosition() ))
1117 pos->SetParameters( uv.Coord(1), uv.Coord(2) );