// SMESH SMESH : implementaion of SMESH idl descriptions // // Copyright (C) 2003 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN, // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS // // This library is free software; you can redistribute it and/or // modify it under the terms of the GNU Lesser General Public // License as published by the Free Software Foundation; either // version 2.1 of the License. // // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU // Lesser General Public License for more details. // // You should have received a copy of the GNU Lesser General Public // License along with this library; if not, write to the Free Software // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA // // See http://www.opencascade.org/SALOME/ or email : webmaster.salome@opencascade.org // // // // File : SMESH_Algo.cxx // Author : Paul RASCLE, EDF // Module : SMESH // $Header$ using namespace std; #include "SMESH_Algo.hxx" #include "SMESH_Gen.hxx" #include "SMESH_Mesh.hxx" #include "SMESH_HypoFilter.hxx" #include #include #include #include "utilities.h" #include #include #include //============================================================================= /*! * */ //============================================================================= SMESH_Algo::SMESH_Algo(int hypId, int studyId, SMESH_Gen * gen):SMESH_Hypothesis(hypId, studyId, gen) { // _compatibleHypothesis.push_back("hypothese_bidon"); _type = ALGO; gen->_mapAlgo[hypId] = this; _onlyUnaryInput = _requireDescretBoundary = true; } //============================================================================= /*! * */ //============================================================================= SMESH_Algo::~SMESH_Algo() { } //============================================================================= /*! * */ //============================================================================= const vector < string > &SMESH_Algo::GetCompatibleHypothesis() { return _compatibleHypothesis; } //============================================================================= /*! * List the hypothesis used by the algorithm associated to the shape. * Hypothesis associated to father shape -are- taken into account (see * GetAppliedHypothesis). Relevant hypothesis have a name (type) listed in * the algorithm. This method could be surcharged by specific algorithms, in * case of several hypothesis simultaneously applicable. */ //============================================================================= const list & SMESH_Algo::GetUsedHypothesis( SMESH_Mesh & aMesh, const TopoDS_Shape & aShape) { _usedHypList.clear(); if ( !_compatibleHypothesis.empty() ) { SMESH_HypoFilter filter( SMESH_HypoFilter::HasName( _compatibleHypothesis[0] )); for ( int i = 1; i < _compatibleHypothesis.size(); ++i ) filter.Or( filter.HasName( _compatibleHypothesis[ i ] )); aMesh.GetHypotheses( aShape, filter, _usedHypList, true ); if ( _usedHypList.size() > 1 ) _usedHypList.clear(); //only one compatible hypothesis allowed } return _usedHypList; } //============================================================================= /*! * List the relevant hypothesis associated to the shape. Relevant hypothesis * have a name (type) listed in the algorithm. Hypothesis associated to * father shape -are not- taken into account (see GetUsedHypothesis) */ //============================================================================= const list & SMESH_Algo::GetAppliedHypothesis( SMESH_Mesh & aMesh, const TopoDS_Shape & aShape) { _appliedHypList.clear(); if ( !_compatibleHypothesis.empty() ) { SMESH_HypoFilter filter( SMESH_HypoFilter::HasName( _compatibleHypothesis[0] )); for ( int i = 1; i < _compatibleHypothesis.size(); ++i ) filter.Or( filter.HasName( _compatibleHypothesis[ i ] )); aMesh.GetHypotheses( aShape, filter, _appliedHypList, false ); } return _appliedHypList; } //============================================================================= /*! * Compute length of an edge */ //============================================================================= double SMESH_Algo::EdgeLength(const TopoDS_Edge & E) { double UMin = 0, UMax = 0; TopLoc_Location L; if (BRep_Tool::Degenerated(E)) return 0; Handle(Geom_Curve) C = BRep_Tool::Curve(E, L, UMin, UMax); GeomAdaptor_Curve AdaptCurve(C); GCPnts_AbscissaPoint gabs; double length = gabs.Length(AdaptCurve, UMin, UMax); return length; }