1 // Copyright (C) 2007-2019 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 : implementation 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 <BRepAdaptor_Curve.hxx>
46 #include <BRepLProp.hxx>
47 #include <BRep_Tool.hxx>
48 #include <GCPnts_AbscissaPoint.hxx>
49 #include <GeomAdaptor_Curve.hxx>
50 #include <Geom_Surface.hxx>
51 #include <LDOMParser.hxx>
53 #include <TopExp_Explorer.hxx>
54 #include <TopLoc_Location.hxx>
55 #include <TopTools_ListIteratorOfListOfShape.hxx>
56 #include <TopTools_ListOfShape.hxx>
58 #include <TopoDS_Edge.hxx>
59 #include <TopoDS_Face.hxx>
60 #include <TopoDS_Vertex.hxx>
61 #include <TopoDS_Wire.hxx>
63 #include <gp_Pnt2d.hxx>
66 #include <Standard_ErrorHandler.hxx>
67 #include <Standard_Failure.hxx>
69 #include "utilities.h"
73 #include "SMESH_ProxyMesh.hxx"
74 #include "SMESH_MesherHelper.hxx"
78 //================================================================================
80 * \brief Returns \a true if two algorithms (described by \a this and the given
81 * algo data) are compatible by their output and input types of elements.
83 //================================================================================
85 bool SMESH_Algo::Features::IsCompatible( const SMESH_Algo::Features& algo2 ) const
87 if ( _dim > algo2._dim ) return algo2.IsCompatible( *this );
88 // algo2 is of higher dimension
89 if ( _outElemTypes.empty() || algo2._inElemTypes.empty() )
91 bool compatible = true;
92 set<SMDSAbs_GeometryType>::const_iterator myOutType = _outElemTypes.begin();
93 for ( ; myOutType != _outElemTypes.end() && compatible; ++myOutType )
94 compatible = algo2._inElemTypes.count( *myOutType );
98 //================================================================================
100 * \brief Return Data of the algorithm
102 //================================================================================
104 const SMESH_Algo::Features& SMESH_Algo::GetFeatures( const std::string& algoType )
106 static map< string, SMESH_Algo::Features > theFeaturesByName;
107 if ( theFeaturesByName.empty() )
109 // Read Plugin.xml files
110 vector< string > xmlPaths = SMESH_Gen::GetPluginXMLPaths();
111 LDOMParser xmlParser;
112 for ( size_t iXML = 0; iXML < xmlPaths.size(); ++iXML )
114 bool error = xmlParser.parse( xmlPaths[iXML].c_str() );
117 TCollection_AsciiString data;
118 INFOS( xmlParser.GetError(data) );
121 // <algorithm type="Regular_1D"
124 // output="QUAD,TRIA">
126 LDOM_Document xmlDoc = xmlParser.getDocument();
127 LDOM_NodeList algoNodeList = xmlDoc.getElementsByTagName( "algorithm" );
128 for ( int i = 0; i < algoNodeList.getLength(); ++i )
130 LDOM_Node algoNode = algoNodeList.item( i );
131 LDOM_Element& algoElem = (LDOM_Element&) algoNode;
132 TCollection_AsciiString algoType = algoElem.getAttribute("type");
133 TCollection_AsciiString input = algoElem.getAttribute("input");
134 TCollection_AsciiString output = algoElem.getAttribute("output");
135 TCollection_AsciiString dim = algoElem.getAttribute("dim");
136 TCollection_AsciiString label = algoElem.getAttribute("label-id");
137 if ( algoType.IsEmpty() ) continue;
139 Features & data = theFeaturesByName[ algoType.ToCString() ];
140 data._dim = dim.IntegerValue();
141 data._label = label.ToCString();
142 for ( int isInput = 0; isInput < 2; ++isInput )
144 TCollection_AsciiString& typeStr = isInput ? input : output;
145 set<SMDSAbs_GeometryType>& typeSet = isInput ? data._inElemTypes : data._outElemTypes;
147 while ( beg <= typeStr.Length() )
149 while ( beg < typeStr.Length() && !isalpha( typeStr.Value( beg ) ))
152 while ( end < typeStr.Length() && isalpha( typeStr.Value( end + 1 ) ))
156 TCollection_AsciiString typeName = typeStr.SubString( beg, end );
157 if ( typeName == "EDGE" ) typeSet.insert( SMDSGeom_EDGE );
158 else if ( typeName == "TRIA" ) typeSet.insert( SMDSGeom_TRIANGLE );
159 else if ( typeName == "QUAD" ) typeSet.insert( SMDSGeom_QUADRANGLE );
167 return theFeaturesByName[ algoType ];
170 //=============================================================================
174 //=============================================================================
176 SMESH_Algo::SMESH_Algo (int hypId, SMESH_Gen * gen)
177 : SMESH_Hypothesis(hypId, gen)
179 _compatibleAllHypFilter = _compatibleNoAuxHypFilter = NULL;
180 _onlyUnaryInput = _requireDiscreteBoundary = _requireShape = true;
181 _quadraticMesh = _supportSubmeshes = false;
183 for ( int i = 0; i < 4; ++i )
184 _neededLowerHyps[ i ] = false;
187 //=============================================================================
191 //=============================================================================
193 SMESH_Algo::~SMESH_Algo()
195 delete _compatibleNoAuxHypFilter;
196 // delete _compatibleAllHypFilter; -- _compatibleNoAuxHypFilter does it!!!
199 //=============================================================================
203 //=============================================================================
205 SMESH_0D_Algo::SMESH_0D_Algo(int hypId, SMESH_Gen* gen)
206 : SMESH_Algo(hypId, gen)
208 _shapeType = (1 << TopAbs_VERTEX);
211 SMESH_1D_Algo::SMESH_1D_Algo(int hypId, SMESH_Gen* gen)
212 : SMESH_Algo(hypId, gen)
214 _shapeType = (1 << TopAbs_EDGE);
217 SMESH_2D_Algo::SMESH_2D_Algo(int hypId, SMESH_Gen* gen)
218 : SMESH_Algo(hypId, gen)
220 _shapeType = (1 << TopAbs_FACE);
223 SMESH_3D_Algo::SMESH_3D_Algo(int hypId, SMESH_Gen* gen)
224 : SMESH_Algo(hypId, gen)
226 _shapeType = (1 << TopAbs_SOLID);
230 //=============================================================================
232 * Usually an algorithm has nothing to save
234 //=============================================================================
236 ostream & SMESH_Algo::SaveTo(ostream & save) { return save; }
237 istream & SMESH_Algo::LoadFrom(istream & load) { return load; }
239 //=============================================================================
243 //=============================================================================
245 const vector < string > &SMESH_Algo::GetCompatibleHypothesis()
247 return _compatibleHypothesis;
250 //=============================================================================
252 * List the hypothesis used by the algorithm associated to the shape.
253 * Hypothesis associated to father shape -are- taken into account (see
254 * GetAppliedHypothesis). Relevant hypothesis have a name (type) listed in
255 * the algorithm. This method could be surcharged by specific algorithms, in
256 * case of several hypothesis simultaneously applicable.
258 //=============================================================================
260 const list <const SMESHDS_Hypothesis *> &
261 SMESH_Algo::GetUsedHypothesis(SMESH_Mesh & aMesh,
262 const TopoDS_Shape & aShape,
263 const bool ignoreAuxiliary) const
265 SMESH_Algo* me = const_cast< SMESH_Algo* >( this );
267 std::list<const SMESHDS_Hypothesis *> savedHyps; // don't delete the list if
268 savedHyps.swap( me->_usedHypList ); // it does not change (#16578)
270 me->_usedHypList.clear();
271 if ( const SMESH_HypoFilter* filter = GetCompatibleHypoFilter( ignoreAuxiliary ))
273 aMesh.GetHypotheses( aShape, *filter, me->_usedHypList, true );
274 if ( ignoreAuxiliary && _usedHypList.size() > 1 )
275 me->_usedHypList.clear(); //only one compatible hypothesis allowed
277 if ( _usedHypList == savedHyps )
278 savedHyps.swap( me->_usedHypList );
283 //=============================================================================
285 * List the relevant hypothesis associated to the shape. Relevant hypothesis
286 * have a name (type) listed in the algorithm. Hypothesis associated to
287 * father shape -are not- taken into account (see GetUsedHypothesis)
289 //=============================================================================
291 const list<const SMESHDS_Hypothesis *> &
292 SMESH_Algo::GetAppliedHypothesis(SMESH_Mesh & aMesh,
293 const TopoDS_Shape & aShape,
294 const bool ignoreAuxiliary) const
296 SMESH_Algo* me = const_cast< SMESH_Algo* >( this );
298 std::list<const SMESHDS_Hypothesis *> savedHyps; // don't delete the list if
299 savedHyps.swap( me->_appliedHypList ); // it does not change (#16578)
301 me->_appliedHypList.clear();
302 if ( const SMESH_HypoFilter* filter = GetCompatibleHypoFilter( ignoreAuxiliary ))
303 aMesh.GetHypotheses( aShape, *filter, me->_appliedHypList, false );
305 if ( _appliedHypList == savedHyps )
306 savedHyps.swap( me->_appliedHypList );
308 return _appliedHypList;
311 //=============================================================================
313 * Compute length of an edge
315 //=============================================================================
317 double SMESH_Algo::EdgeLength(const TopoDS_Edge & E)
319 double UMin = 0, UMax = 0;
321 Handle(Geom_Curve) C = BRep_Tool::Curve(E, L, UMin, UMax);
324 GeomAdaptor_Curve AdaptCurve(C, UMin, UMax); //range is important for periodic curves
325 double length = GCPnts_AbscissaPoint::Length(AdaptCurve, UMin, UMax);
329 //================================================================================
331 * \brief Just return false as the algorithm does not hold parameters values
333 //================================================================================
335 bool SMESH_Algo::SetParametersByMesh(const SMESH_Mesh* /*theMesh*/,
336 const TopoDS_Shape& /*theShape*/)
340 bool SMESH_Algo::SetParametersByDefaults(const TDefaults& , const SMESH_Mesh*)
344 //================================================================================
346 * \brief Fill vector of node parameters on geometrical edge, including vertex nodes
347 * \param theMesh - The mesh containing nodes
348 * \param theEdge - The geometrical edge of interest
349 * \param theParams - The resulting vector of sorted node parameters
350 * \retval bool - false if not all parameters are OK
352 //================================================================================
354 bool SMESH_Algo::GetNodeParamOnEdge(const SMESHDS_Mesh* theMesh,
355 const TopoDS_Edge& theEdge,
356 vector< double > & theParams)
360 if ( !theMesh || theEdge.IsNull() )
363 SMESHDS_SubMesh * eSubMesh = theMesh->MeshElements( theEdge );
364 if ( !eSubMesh || !eSubMesh->GetElements()->more() )
365 return false; // edge is not meshed
367 //int nbEdgeNodes = 0;
368 set < double > paramSet;
371 // loop on nodes of an edge: sort them by param on edge
372 SMDS_NodeIteratorPtr nIt = eSubMesh->GetNodes();
373 while ( nIt->more() )
375 SMDS_EdgePositionPtr epos = nIt->next()->GetPosition();
378 if ( !paramSet.insert( epos->GetUParameter() ).second )
379 return false; // equal parameters
382 // add vertex nodes params
384 TopExp::Vertices( theEdge, V1, V2);
385 if ( VertexNode( V1, theMesh ) &&
386 !paramSet.insert( BRep_Tool::Parameter(V1,theEdge) ).second )
387 return false; // there are equal parameters
388 if ( VertexNode( V2, theMesh ) &&
389 !paramSet.insert( BRep_Tool::Parameter(V2,theEdge) ).second )
390 return false; // there are equal parameters
393 theParams.resize( paramSet.size() );
394 set < double >::iterator par = paramSet.begin();
395 vector< double >::iterator vecPar = theParams.begin();
396 for ( ; par != paramSet.end(); ++par, ++vecPar )
399 return theParams.size() > 1;
402 //================================================================================
404 * \brief Fill vector of node parameters on geometrical edge, including vertex nodes
405 * \param theMesh - The mesh containing nodes
406 * \param theEdge - The geometrical edge of interest
407 * \param theParams - The resulting vector of sorted node parameters
408 * \retval bool - false if not all parameters are OK
410 //================================================================================
412 bool SMESH_Algo::GetSortedNodesOnEdge(const SMESHDS_Mesh* theMesh,
413 const TopoDS_Edge& theEdge,
414 const bool ignoreMediumNodes,
415 map< double, const SMDS_MeshNode* > & theNodes,
416 const SMDSAbs_ElementType typeToCheck)
420 if ( !theMesh || theEdge.IsNull() )
423 SMESHDS_SubMesh * eSubMesh = theMesh->MeshElements( theEdge );
424 if ( !eSubMesh || ( eSubMesh->NbElements() == 0 && eSubMesh->NbNodes() == 0))
425 return false; // edge is not meshed
428 set < double > paramSet;
431 // loop on nodes of an edge: sort them by param on edge
432 SMDS_NodeIteratorPtr nIt = eSubMesh->GetNodes();
433 while ( nIt->more() )
435 const SMDS_MeshNode* node = nIt->next();
436 if ( ignoreMediumNodes && SMESH_MesherHelper::IsMedium( node, typeToCheck ))
438 SMDS_EdgePositionPtr epos = node->GetPosition();
441 theNodes.insert( theNodes.end(), make_pair( epos->GetUParameter(), node ));
446 TopoDS_Vertex v1, v2;
447 TopExp::Vertices(theEdge, v1, v2);
448 const SMDS_MeshNode* n1 = VertexNode( v1, eSubMesh, 0 );
449 const SMDS_MeshNode* n2 = VertexNode( v2, eSubMesh, 0 );
450 const SMDS_MeshNode* nEnd[2] = { nbNodes ? theNodes.begin()->second : 0,
451 nbNodes ? theNodes.rbegin()->second : 0 };
453 BRep_Tool::Range(theEdge, f, l);
454 if ( v1.Orientation() != TopAbs_FORWARD )
456 if ( n1 && n1 != nEnd[0] && n1 != nEnd[1] && ++nbNodes )
457 theNodes.insert( make_pair( f, n1 ));
458 if ( n2 && n2 != nEnd[0] && n2 != nEnd[1] && ++nbNodes )
459 theNodes.insert( make_pair( l, n2 ));
461 return (int)theNodes.size() == nbNodes;
464 //================================================================================
466 * \brief Returns the filter recognizing only compatible hypotheses
467 * \param ignoreAuxiliary - make filter ignore auxiliary hypotheses
468 * \retval SMESH_HypoFilter* - the filter that can be NULL
470 //================================================================================
472 const SMESH_HypoFilter*
473 SMESH_Algo::GetCompatibleHypoFilter(const bool ignoreAuxiliary) const
475 if ( !_compatibleHypothesis.empty() )
477 if ( !_compatibleAllHypFilter )
479 SMESH_HypoFilter* filter = new SMESH_HypoFilter();
480 filter->Init( filter->HasName( _compatibleHypothesis[0] ));
481 for ( size_t i = 1; i < _compatibleHypothesis.size(); ++i )
482 filter->Or( filter->HasName( _compatibleHypothesis[ i ] ));
484 SMESH_HypoFilter* filterNoAux = new SMESH_HypoFilter( filter );
485 filterNoAux->AndNot( filterNoAux->IsAuxiliary() );
487 // _compatibleNoAuxHypFilter will detele _compatibleAllHypFilter!!!
488 SMESH_Algo* me = const_cast< SMESH_Algo* >( this );
489 me->_compatibleAllHypFilter = filter;
490 me->_compatibleNoAuxHypFilter = filterNoAux;
492 return ignoreAuxiliary ? _compatibleNoAuxHypFilter : _compatibleAllHypFilter;
497 //================================================================================
499 * \brief Return continuity of two edges
500 * \param E1 - the 1st edge
501 * \param E2 - the 2nd edge
502 * \retval GeomAbs_Shape - regularity at the junction between E1 and E2
504 //================================================================================
506 GeomAbs_Shape SMESH_Algo::Continuity(const TopoDS_Edge& theE1,
507 const TopoDS_Edge& theE2)
509 // avoid pb with internal edges
510 TopoDS_Edge E1 = theE1, E2 = theE2;
511 if (E1.Orientation() > TopAbs_REVERSED) // INTERNAL
512 E1.Orientation( TopAbs_FORWARD );
513 if (E2.Orientation() > TopAbs_REVERSED) // INTERNAL
514 E2.Orientation( TopAbs_FORWARD );
516 TopoDS_Vertex V, VV1[2], VV2[2];
517 TopExp::Vertices( E1, VV1[0], VV1[1], true );
518 TopExp::Vertices( E2, VV2[0], VV2[1], true );
519 if ( VV1[1].IsSame( VV2[0] )) { V = VV1[1]; }
520 else if ( VV1[0].IsSame( VV2[1] )) { V = VV1[0]; }
521 else if ( VV1[1].IsSame( VV2[1] )) { V = VV1[1]; E1.Reverse(); }
522 else if ( VV1[0].IsSame( VV2[0] )) { V = VV1[0]; E1.Reverse(); }
523 else { return GeomAbs_C0; }
525 Standard_Real u1 = BRep_Tool::Parameter( V, E1 );
526 Standard_Real u2 = BRep_Tool::Parameter( V, E2 );
527 BRepAdaptor_Curve C1( E1 ), C2( E2 );
528 Standard_Real tol = BRep_Tool::Tolerance( V );
529 Standard_Real angTol = 2e-3;
532 return BRepLProp::Continuity(C1, C2, u1, u2, tol, angTol);
534 catch (Standard_Failure) {
539 //================================================================================
541 * \brief Return true if an edge can be considered straight
543 //================================================================================
545 bool SMESH_Algo::IsStraight( const TopoDS_Edge & E,
546 const bool degenResult)
550 if ( BRep_Tool::Curve( E, f, l ).IsNull())
553 BRepAdaptor_Curve curve( E );
554 switch( curve.GetType() )
559 case GeomAbs_Ellipse:
560 case GeomAbs_Hyperbola:
561 case GeomAbs_Parabola:
563 // case GeomAbs_BezierCurve:
564 // case GeomAbs_BSplineCurve:
565 // case GeomAbs_OtherCurve:
569 // evaluate how far from a straight line connecting the curve ends
570 // stand internal points of the curve
571 double f = curve.FirstParameter();
572 double l = curve.LastParameter();
573 gp_Pnt pf = curve.Value( f );
574 gp_Pnt pl = curve.Value( l );
575 gp_Vec lineVec( pf, pl );
576 double lineLen2 = lineVec.SquareMagnitude();
577 if ( lineLen2 < std::numeric_limits< double >::min() )
578 return false; // E seems closed
580 double edgeTol = 10 * curve.Tolerance();
581 double lenTol2 = lineLen2 * 1e-4;
582 double tol2 = Min( edgeTol * edgeTol, lenTol2 );
584 const double nbSamples = 7;
585 for ( int i = 0; i < nbSamples; ++i )
587 double r = ( i + 1 ) / nbSamples;
588 gp_Pnt pi = curve.Value( f * r + l * ( 1 - r ));
590 double h2 = lineVec.Crossed( vi ).SquareMagnitude() / lineLen2;
597 //================================================================================
599 * \brief Return true if an edge has no 3D curve
601 //================================================================================
603 bool SMESH_Algo::isDegenerated( const TopoDS_Edge & E, const bool checkLength )
606 return EdgeLength( E ) == 0;
609 Handle(Geom_Curve) C = BRep_Tool::Curve( E, loc, f,l );
613 //================================================================================
615 * \brief Return the node built on a vertex
616 * \param V - the vertex
617 * \param meshDS - mesh
618 * \retval const SMDS_MeshNode* - found node or NULL
619 * \sa SMESH_MesherHelper::GetSubShapeByNode( const SMDS_MeshNode*, SMESHDS_Mesh* )
621 //================================================================================
623 const SMDS_MeshNode* SMESH_Algo::VertexNode(const TopoDS_Vertex& V,
624 const SMESHDS_Mesh* meshDS)
626 if ( SMESHDS_SubMesh* sm = meshDS->MeshElements(V) ) {
627 SMDS_NodeIteratorPtr nIt= sm->GetNodes();
634 //=======================================================================
636 * \brief Return the node built on a vertex.
637 * A node moved to other geometry by MergeNodes() is also returned.
638 * \param V - the vertex
640 * \retval const SMDS_MeshNode* - found node or NULL
642 //=======================================================================
644 const SMDS_MeshNode* SMESH_Algo::VertexNode(const TopoDS_Vertex& V,
645 const SMESH_Mesh* mesh)
647 const SMDS_MeshNode* node = VertexNode( V, mesh->GetMeshDS() );
649 if ( !node && mesh->HasModificationsToDiscard() )
651 PShapeIteratorPtr edgeIt = SMESH_MesherHelper::GetAncestors( V, *mesh, TopAbs_EDGE );
652 while ( const TopoDS_Shape* edge = edgeIt->next() )
653 if ( SMESHDS_SubMesh* edgeSM = mesh->GetMeshDS()->MeshElements( *edge ))
654 if ( edgeSM->NbElements() > 0 )
655 return VertexNode( V, edgeSM, mesh, /*checkV=*/false );
660 //=======================================================================
662 * \brief Return the node built on a vertex.
663 * A node moved to other geometry by MergeNodes() is also returned.
664 * \param V - the vertex
665 * \param edgeSM - sub-mesh of a meshed EDGE sharing the vertex
666 * \param checkV - if \c true, presence of a node on the vertex is checked
667 * \retval const SMDS_MeshNode* - found node or NULL
669 //=======================================================================
671 const SMDS_MeshNode* SMESH_Algo::VertexNode(const TopoDS_Vertex& V,
672 const SMESHDS_SubMesh* edgeSM,
673 const SMESH_Mesh* mesh,
676 const SMDS_MeshNode* node = checkV ? VertexNode( V, edgeSM->GetParent() ) : 0;
678 if ( !node && edgeSM )
680 // find nodes not shared by mesh segments
681 typedef set< const SMDS_MeshNode* > TNodeSet;
682 typedef map< const SMDS_MeshNode*, const SMDS_MeshNode* > TNodeMap;
683 TNodeMap notSharedNodes;
684 TNodeSet otherShapeNodes;
685 vector< const SMDS_MeshNode* > segNodes(3);
686 SMDS_ElemIteratorPtr segIt = edgeSM->GetElements();
687 while ( segIt->more() )
689 const SMDS_MeshElement* seg = segIt->next();
690 if ( seg->GetType() != SMDSAbs_Edge )
692 segNodes.assign( seg->begin_nodes(), seg->end_nodes() );
693 for ( int i = 0; i < 2; ++i )
695 const SMDS_MeshNode* n1 = segNodes[i];
696 const SMDS_MeshNode* n2 = segNodes[1-i];
697 pair<TNodeMap::iterator, bool> it2new = notSharedNodes.insert( make_pair( n1, n2 ));
698 if ( !it2new.second ) // n encounters twice
699 notSharedNodes.erase( it2new.first );
700 if ( n1->getshapeId() != edgeSM->GetID() )
701 otherShapeNodes.insert( n1 );
704 if ( otherShapeNodes.size() == 1 && notSharedNodes.empty() ) // a closed EDGE
705 return *otherShapeNodes.begin();
707 if ( notSharedNodes.size() == 2 ) // two end nodes found
709 SMESHDS_Mesh* meshDS = edgeSM->GetParent();
710 const TopoDS_Shape& E = meshDS->IndexToShape( edgeSM->GetID() );
711 if ( E.IsNull() || E.ShapeType() != TopAbs_EDGE )
713 const SMDS_MeshNode* n1 = notSharedNodes.begin ()->first;
714 const SMDS_MeshNode* n2 = notSharedNodes.rbegin()->first;
715 TopoDS_Shape S1 = SMESH_MesherHelper::GetSubShapeByNode( n1, meshDS );
716 if ( S1.ShapeType() == TopAbs_VERTEX && SMESH_MesherHelper::IsSubShape( S1, E ))
718 TopoDS_Shape S2 = SMESH_MesherHelper::GetSubShapeByNode( n2, meshDS );
719 if ( S2.ShapeType() == TopAbs_VERTEX && SMESH_MesherHelper::IsSubShape( S2, E ))
721 if ( edgeSM->NbElements() <= 2 || !mesh ) // one-two segments
723 gp_Pnt pV = BRep_Tool::Pnt( V );
724 double dist1 = pV.SquareDistance( SMESH_TNodeXYZ( n1 ));
725 double dist2 = pV.SquareDistance( SMESH_TNodeXYZ( n2 ));
726 return dist1 < dist2 ? n1 : n2;
730 SMESH_MesherHelper helper( const_cast<SMESH_Mesh&>( *mesh ));
731 const SMDS_MeshNode* n1i = notSharedNodes.begin ()->second;
732 const SMDS_MeshNode* n2i = notSharedNodes.rbegin()->second;
733 const TopoDS_Edge& edge = TopoDS::Edge( E );
735 double pos1 = helper.GetNodeU( edge, n1i, n2i, &posOK );
736 double pos2 = helper.GetNodeU( edge, n2i, n1i, &posOK );
737 double posV = BRep_Tool::Parameter( V, edge );
738 if ( Abs( pos1 - posV ) < Abs( pos2 - posV )) return n1;
746 //=======================================================================
747 //function : GetMeshError
748 //purpose : Finds topological errors of a sub-mesh
749 //WARNING : 1D check is NOT implemented so far
750 //=======================================================================
752 SMESH_Algo::EMeshError SMESH_Algo::GetMeshError(SMESH_subMesh* subMesh)
754 EMeshError err = MEr_OK;
756 SMESHDS_SubMesh* smDS = subMesh->GetSubMeshDS();
760 switch ( subMesh->GetSubShape().ShapeType() )
762 case TopAbs_FACE: { // ====================== 2D =====================
764 SMDS_ElemIteratorPtr fIt = smDS->GetElements();
768 // We check that only links on EDGEs encounter once, the rest links, twice
769 set< SMESH_TLink > links;
770 while ( fIt->more() )
772 const SMDS_MeshElement* f = fIt->next();
773 int nbNodes = f->NbCornerNodes(); // ignore medium nodes
774 for ( int i = 0; i < nbNodes; ++i )
776 const SMDS_MeshNode* n1 = f->GetNode( i );
777 const SMDS_MeshNode* n2 = f->GetNode(( i+1 ) % nbNodes);
778 std::pair< set< SMESH_TLink >::iterator, bool > it_added =
779 links.insert( SMESH_TLink( n1, n2 ));
780 if ( !it_added.second )
781 // As we do NOT(!) check if mesh is manifold, we believe that a link can
782 // encounter once or twice only (not three times), we erase a link as soon
783 // as it encounters twice to speed up search in the <links> map.
784 links.erase( it_added.first );
787 // the links remaining in the <links> should all be on EDGE
788 set< SMESH_TLink >::iterator linkIt = links.begin();
789 for ( ; linkIt != links.end(); ++linkIt )
791 const SMESH_TLink& link = *linkIt;
792 if ( link.node1()->GetPosition()->GetTypeOfPosition() > SMDS_TOP_EDGE ||
793 link.node2()->GetPosition()->GetTypeOfPosition() > SMDS_TOP_EDGE )
796 // TODO: to check orientation
799 case TopAbs_SOLID: { // ====================== 3D =====================
801 SMDS_ElemIteratorPtr vIt = smDS->GetElements();
805 SMDS_VolumeTool vTool;
806 while ( !vIt->more() )
808 if (!vTool.Set( vIt->next() ))
811 for ( int iF = 0; iF < vTool.NbFaces(); ++iF )
812 if ( vTool.IsFreeFace( iF ))
814 int nbN = vTool.NbFaceNodes( iF );
815 const SMDS_MeshNode** nodes = vTool.GetFaceNodes( iF );
816 for ( int i = 0; i < nbN; ++i )
817 if ( nodes[i]->GetPosition()->GetTypeOfPosition() > SMDS_TOP_FACE )
828 //================================================================================
830 * \brief Sets event listener to submeshes if necessary
831 * \param subMesh - submesh where algo is set
833 * After being set, event listener is notified on each event of a submesh.
834 * By default non listener is set
836 //================================================================================
838 void SMESH_Algo::SetEventListener(SMESH_subMesh* /*subMesh*/)
842 //================================================================================
844 * \brief Allow algo to do something after persistent restoration
845 * \param subMesh - restored submesh
847 * This method is called only if a submesh has HYP_OK algo_state.
849 //================================================================================
851 void SMESH_Algo::SubmeshRestored(SMESH_subMesh* /*subMesh*/)
855 //================================================================================
857 * \brief Computes mesh without geometry
858 * \param aMesh - the mesh
859 * \param aHelper - helper that must be used for adding elements to \aaMesh
860 * \retval bool - is a success
862 //================================================================================
864 bool SMESH_Algo::Compute(SMESH_Mesh & /*aMesh*/, SMESH_MesherHelper* /*aHelper*/)
866 return error( COMPERR_BAD_INPUT_MESH, "Mesh built on shape expected");
869 //=======================================================================
870 //function : IsApplicableToShape
871 //purpose : Return true if the algorithm can mesh a given shape
872 //=======================================================================
874 bool SMESH_Algo::IsApplicableToShape(const TopoDS_Shape & shape, bool toCheckAll) const
879 //=======================================================================
880 //function : CancelCompute
881 //purpose : Sets _computeCanceled to true. It's usage depends on
882 // * implementation of a particular mesher.
883 //=======================================================================
885 void SMESH_Algo::CancelCompute()
887 _computeCanceled = true;
888 _error = COMPERR_CANCELED;
891 //================================================================================
893 * If possible, returns progress of computation [0.,1.]
895 //================================================================================
897 double SMESH_Algo::GetProgress() const
902 //================================================================================
904 * \brief store error and comment and then return ( error == COMPERR_OK )
906 //================================================================================
908 bool SMESH_Algo::error(int error, const SMESH_Comment& comment)
912 return ( error == COMPERR_OK );
915 //================================================================================
917 * \brief store error and return ( error == COMPERR_OK )
919 //================================================================================
921 bool SMESH_Algo::error(SMESH_ComputeErrorPtr error)
924 _error = error->myName;
925 _comment = error->myComment;
926 if ( error->HasBadElems() )
928 SMESH_BadInputElements* badElems = static_cast<SMESH_BadInputElements*>( error.get() );
929 _badInputElements = badElems->GetElements();
930 _mesh = badElems->GetMesh();
932 return error->IsOK();
937 //================================================================================
939 * \brief return compute error
941 //================================================================================
943 SMESH_ComputeErrorPtr SMESH_Algo::GetComputeError() const
945 if ( !_badInputElements.empty() && _mesh )
947 SMESH_BadInputElements* err = new SMESH_BadInputElements( _mesh, _error, _comment, this );
948 // hope this method is called by only SMESH_subMesh after this->Compute()
949 err->myBadElements.splice( err->myBadElements.end(),
950 (list<const SMDS_MeshElement*>&) _badInputElements );
951 return SMESH_ComputeErrorPtr( err );
953 return SMESH_ComputeError::New( _error, _comment, this );
956 //================================================================================
958 * \brief initialize compute error before call of Compute()
960 //================================================================================
962 void SMESH_Algo::InitComputeError()
966 list<const SMDS_MeshElement*>::iterator elem = _badInputElements.begin();
967 for ( ; elem != _badInputElements.end(); ++elem )
968 if ( (*elem)->GetID() < 1 )
970 _badInputElements.clear();
973 _computeCanceled = false;
978 //================================================================================
980 * \brief Return compute progress by nb of calls of this method
982 //================================================================================
984 double SMESH_Algo::GetProgressByTic() const
987 for ( size_t i = 0; i < _smToCompute.size(); ++i )
988 computeCost += _smToCompute[i]->GetComputeCost();
990 const_cast<SMESH_Algo*>( this )->_progressTic++;
992 double x = 5 * _progressTic;
993 x = ( x < computeCost ) ? ( x / computeCost ) : 1.;
994 return 0.9 * sin( x * M_PI / 2 );
997 //================================================================================
999 * \brief store a bad input element preventing computation,
1000 * which may be a temporary one i.e. not residing the mesh,
1001 * then it will be deleted by InitComputeError()
1003 //================================================================================
1005 void SMESH_Algo::addBadInputElement(const SMDS_MeshElement* elem)
1008 _badInputElements.push_back( elem );
1011 //=======================================================================
1012 //function : addBadInputElements
1013 //purpose : store a bad input elements or nodes preventing computation
1014 //=======================================================================
1016 void SMESH_Algo::addBadInputElements(const SMESHDS_SubMesh* sm,
1017 const bool addNodes)
1023 SMDS_NodeIteratorPtr nIt = sm->GetNodes();
1024 while ( nIt->more() ) addBadInputElement( nIt->next() );
1028 SMDS_ElemIteratorPtr eIt = sm->GetElements();
1029 while ( eIt->more() ) addBadInputElement( eIt->next() );
1034 //=============================================================================
1038 //=============================================================================
1040 // int SMESH_Algo::NumberOfWires(const TopoDS_Shape& S)
1043 // for (TopExp_Explorer exp(S,TopAbs_WIRE); exp.More(); exp.Next())
1048 //=============================================================================
1052 //=============================================================================
1054 int SMESH_Algo::NumberOfPoints(SMESH_Mesh& aMesh, const TopoDS_Wire& W)
1057 for (TopExp_Explorer exp(W,TopAbs_EDGE); exp.More(); exp.Next()) {
1058 const TopoDS_Edge& E = TopoDS::Edge(exp.Current());
1059 int nb = aMesh.GetSubMesh(E)->GetSubMeshDS()->NbNodes();
1062 nbPoints += nb + 1; // internal points plus 1 vertex of 2 (last point ?)
1068 //================================================================================
1070 * Method in which an algorithm generating a structured mesh
1071 * fixes positions of in-face nodes after there movement
1072 * due to insertion of viscous layers.
1074 //================================================================================
1076 bool SMESH_2D_Algo::FixInternalNodes(const SMESH_ProxyMesh& mesh,
1077 const TopoDS_Face& face)
1079 const SMESHDS_SubMesh* smDS = mesh.GetSubMesh(face);
1080 if ( !smDS || smDS->NbElements() < 1 )
1083 SMESH_MesherHelper helper( *mesh.GetMesh() );
1085 // get all faces from a proxy sub-mesh
1086 typedef SMDS_StdIterator< const SMDS_MeshElement*, SMDS_ElemIteratorPtr > TIterator;
1087 TIDSortedElemSet allFaces( TIterator( smDS->GetElements() ), TIterator() );
1088 TIDSortedElemSet avoidSet, firstRowQuads;
1090 // indices of nodes to pass to a neighbour quad using SMESH_MeshAlgos::FindFaceInSet()
1093 // get two first rows of nodes by passing through the first row of faces
1094 vector< vector< const SMDS_MeshNode* > > nodeRows;
1095 int iRow1 = 0, iRow2 = 1;
1096 const SMDS_MeshElement* quad;
1098 // look for a corner quadrangle and it's corner node
1099 const SMDS_MeshElement* cornerQuad = 0;
1100 int cornerNodeInd = -1;
1101 SMDS_ElemIteratorPtr fIt = smDS->GetElements();
1102 while ( !cornerQuad && fIt->more() )
1104 cornerQuad = fIt->next();
1105 if ( cornerQuad->NbCornerNodes() != 4 )
1107 SMDS_NodeIteratorPtr nIt = cornerQuad->nodeIterator();
1108 for ( int i = 0; i < 4; ++i )
1110 int nbInverseQuads = 0;
1111 SMDS_ElemIteratorPtr fIt = nIt->next()->GetInverseElementIterator(SMDSAbs_Face);
1112 while ( fIt->more() )
1113 nbInverseQuads += allFaces.count( fIt->next() );
1114 if ( nbInverseQuads == 1 )
1115 cornerNodeInd = i, i = 4;
1117 if ( cornerNodeInd < 0 )
1120 if ( !cornerQuad || cornerNodeInd < 0 )
1123 iN1 = helper.WrapIndex( cornerNodeInd + 1, 4 );
1124 iN2 = helper.WrapIndex( cornerNodeInd + 2, 4 );
1125 int iN3 = helper.WrapIndex( cornerNodeInd + 3, 4 );
1127 nodeRows[iRow1].push_back( cornerQuad->GetNode( cornerNodeInd ));
1128 nodeRows[iRow1].push_back( cornerQuad->GetNode( iN1 ));
1129 nodeRows[iRow2].push_back( cornerQuad->GetNode( iN3 ));
1130 nodeRows[iRow2].push_back( cornerQuad->GetNode( iN2 ));
1131 firstRowQuads.insert( cornerQuad );
1133 // pass through the rest quads in a face row
1138 avoidSet.insert( quad );
1139 if (( quad = SMESH_MeshAlgos::FindFaceInSet( nodeRows[iRow1].back(),
1140 nodeRows[iRow2].back(),
1141 allFaces, avoidSet, &iN1, &iN2)))
1143 nodeRows[iRow1].push_back( quad->GetNode( helper.WrapIndex( iN2 + 2, 4 )));
1144 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN1 + 2, 4 )));
1145 if ( quad->NbCornerNodes() != 4 )
1149 if ( nodeRows[iRow1].size() < 3 )
1150 return true; // there is nothing to fix
1153 nodeRows.reserve( smDS->NbElements() / nodeRows[iRow1].size() );
1155 // get the rest node rows
1160 // get the first quad in the next face row
1161 if (( quad = SMESH_MeshAlgos::FindFaceInSet( nodeRows[iRow1][0],
1163 allFaces, /*avoid=*/firstRowQuads,
1166 if ( quad->NbCornerNodes() != 4 )
1168 nodeRows.resize( iRow2+1 );
1169 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN2 + 2, 4 )));
1170 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN1 + 2, 4 )));
1171 firstRowQuads.insert( quad );
1175 break; // no more rows
1178 // pass through the rest quads in a face row
1182 avoidSet.insert( quad );
1183 if (( quad = SMESH_MeshAlgos::FindFaceInSet( nodeRows[iRow1][ nodeRows[iRow2].size()-1 ],
1184 nodeRows[iRow2].back(),
1185 allFaces, avoidSet, &iN1, &iN2)))
1187 if ( quad->NbCornerNodes() != 4 )
1189 nodeRows[iRow2].push_back( quad->GetNode( helper.WrapIndex( iN1 + 2, 4 )));
1192 if ( nodeRows[iRow1].size() != nodeRows[iRow2].size() )
1195 if ( nodeRows.size() < 3 )
1196 return true; // there is nothing to fix
1198 // get params of the first (bottom) and last (top) node rows
1199 UVPtStructVec uvB( nodeRows[0].size() ), uvT( nodeRows[0].size() );
1200 for ( int isBot = 0; isBot < 2; ++isBot )
1202 UVPtStructVec & uvps = isBot ? uvB : uvT;
1203 vector< const SMDS_MeshNode* >& nodes = nodeRows[ isBot ? 0 : nodeRows.size()-1 ];
1204 for ( size_t i = 0; i < nodes.size(); ++i )
1206 uvps[i].node = nodes[i];
1207 gp_XY uv = helper.GetNodeUV( face, uvps[i].node );
1208 uvps[i].u = uv.Coord(1);
1209 uvps[i].v = uv.Coord(2);
1212 // calculate x (normalized param)
1213 for ( size_t i = 1; i < nodes.size(); ++i )
1214 uvps[i].x = uvps[i-1].x + SMESH_TNodeXYZ( uvps[i-1].node ).Distance( uvps[i].node );
1215 for ( size_t i = 1; i < nodes.size(); ++i )
1216 uvps[i].x /= uvps.back().x;
1219 // get params of the left and right node rows
1220 UVPtStructVec uvL( nodeRows.size() ), uvR( nodeRows.size() );
1221 for ( int isLeft = 0; isLeft < 2; ++isLeft )
1223 UVPtStructVec & uvps = isLeft ? uvL : uvR;
1224 const int iCol = isLeft ? 0 : nodeRows[0].size() - 1;
1225 for ( size_t i = 0; i < nodeRows.size(); ++i )
1227 uvps[i].node = nodeRows[i][iCol];
1228 gp_XY uv = helper.GetNodeUV( face, uvps[i].node );
1229 uvps[i].u = uv.Coord(1);
1230 uvps[i].v = uv.Coord(2);
1233 // calculate y (normalized param)
1234 for ( size_t i = 1; i < nodeRows.size(); ++i )
1235 uvps[i].y = uvps[i-1].y + SMESH_TNodeXYZ( uvps[i-1].node ).Distance( uvps[i].node );
1236 for ( size_t i = 1; i < nodeRows.size(); ++i )
1237 uvps[i].y /= uvps.back().y;
1240 // update node coordinates
1241 SMESHDS_Mesh* meshDS = mesh.GetMeshDS();
1242 Handle(Geom_Surface) S = BRep_Tool::Surface( face );
1243 gp_XY a0 ( uvB.front().u, uvB.front().v );
1244 gp_XY a1 ( uvB.back().u, uvB.back().v );
1245 gp_XY a2 ( uvT.back().u, uvT.back().v );
1246 gp_XY a3 ( uvT.front().u, uvT.front().v );
1247 for ( size_t iRow = 1; iRow < nodeRows.size()-1; ++iRow )
1249 gp_XY p1 ( uvR[ iRow ].u, uvR[ iRow ].v );
1250 gp_XY p3 ( uvL[ iRow ].u, uvL[ iRow ].v );
1251 const double y0 = uvL[ iRow ].y;
1252 const double y1 = uvR[ iRow ].y;
1253 for ( size_t iCol = 1; iCol < nodeRows[0].size()-1; ++iCol )
1255 gp_XY p0 ( uvB[ iCol ].u, uvB[ iCol ].v );
1256 gp_XY p2 ( uvT[ iCol ].u, uvT[ iCol ].v );
1257 const double x0 = uvB[ iCol ].x;
1258 const double x1 = uvT[ iCol ].x;
1259 double x = (x0 + y0 * (x1 - x0)) / (1 - (y1 - y0) * (x1 - x0));
1260 double y = y0 + x * (y1 - y0);
1261 gp_XY uv = helper.calcTFI( x, y, a0,a1,a2,a3, p0,p1,p2,p3 );
1262 gp_Pnt p = S->Value( uv.Coord(1), uv.Coord(2));
1263 const SMDS_MeshNode* n = nodeRows[iRow][iCol];
1264 meshDS->MoveNode( n, p.X(), p.Y(), p.Z() );
1265 if ( SMDS_FacePositionPtr pos = n->GetPosition() )
1266 pos->SetParameters( uv.Coord(1), uv.Coord(2) );
1272 //=======================================================================
1273 //function : IsApplicableToShape
1274 //purpose : Return true if the algorithm can mesh a given shape
1275 //=======================================================================
1277 bool SMESH_1D_Algo::IsApplicableToShape(const TopoDS_Shape & shape, bool toCheckAll) const
1279 return ( !shape.IsNull() && TopExp_Explorer( shape, TopAbs_EDGE ).More() );
1282 //=======================================================================
1283 //function : IsApplicableToShape
1284 //purpose : Return true if the algorithm can mesh a given shape
1285 //=======================================================================
1287 bool SMESH_2D_Algo::IsApplicableToShape(const TopoDS_Shape & shape, bool toCheckAll) const
1289 return ( !shape.IsNull() && TopExp_Explorer( shape, TopAbs_FACE ).More() );
1292 //=======================================================================
1293 //function : IsApplicableToShape
1294 //purpose : Return true if the algorithm can mesh a given shape
1295 //=======================================================================
1297 bool SMESH_3D_Algo::IsApplicableToShape(const TopoDS_Shape & shape, bool toCheckAll) const
1299 return ( !shape.IsNull() && TopExp_Explorer( shape, TopAbs_SOLID ).More() );