1 // SMESH StdMeshers : implementaion of point distribution algorithm
3 // Copyright (C) 2003 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
24 // File : StdMeshers_Distribution.cxx
25 // Author : Alexandre SOLOVYOV
29 #include "StdMeshers_Distribution.hxx"
31 #include <math_GaussSingleIntegration.hxx>
32 #include <utilities.h>
34 #if (OCC_VERSION_MAJOR << 16 | OCC_VERSION_MINOR << 8 | OCC_VERSION_MAINTENANCE) > 0x060100
38 #include <Standard_Failure.hxx>
41 #include <Standard_ErrorHandler.hxx>
43 #include "CASCatch.hxx"
46 Function::Function( const int conv )
55 bool Function::value( const double, double& f ) const
67 } catch(Standard_Failure) {
69 } CASCatch_CATCH(Standard_Failure) {
71 Handle(Standard_Failure) aFail = Standard_Failure::Caught();
76 else if( myConv==1 && f<0.0 )
82 FunctionIntegral::FunctionIntegral( const Function* f, const double st )
84 myFunc( const_cast<Function*>( f ) ),
89 FunctionIntegral::~FunctionIntegral()
93 bool FunctionIntegral::value( const double t, double& f ) const
95 f = myFunc ? myFunc->integral( myStart, t ) : 0;
96 return myFunc!=0 && Function::value( t, f );
99 double FunctionIntegral::integral( const double, const double ) const
104 FunctionTable::FunctionTable( const std::vector<double>& data, const int conv )
110 FunctionTable::~FunctionTable()
114 bool FunctionTable::value( const double t, double& f ) const
117 if( !findBounds( t, i1, i2 ) )
121 f = myData[ 2*i1+1 ];
126 x1 = myData[2*i1], y1 = myData[2*i1+1],
127 x2 = myData[2*i2], y2 = myData[2*i2+1];
129 Function::value( x1, y1 );
130 Function::value( x2, y2 );
132 f = y1 + ( y2-y1 ) * ( t-x1 ) / ( x2-x1 );
136 double FunctionTable::integral( const int i ) const
138 if( i>=0 && i<myData.size()-1 )
139 return integral( i, myData[2*(i+1)]-myData[2*i] );
144 double FunctionTable::integral( const int i, const double d ) const
146 double f1,f2, res = 0.0;
147 if( value( myData[2*i]+d, f1 ) )
148 if(!value(myData[2*i], f2))
150 res = (f2+f1) * d / 2.0;
154 double FunctionTable::integral( const double a, const double b ) const
156 int x1s, x1f, x2s, x2f;
157 findBounds( a, x1s, x1f );
158 findBounds( b, x2s, x2f );
160 for( int i=x1s; i<x2s; i++ )
162 J-=integral( x1s, a-myData[2*x1s] );
163 J+=integral( x2s, b-myData[2*x2s] );
167 bool FunctionTable::findBounds( const double x, int& x_ind_1, int& x_ind_2 ) const
169 int n = myData.size() / 2;
170 if( n==0 || x<myData[0] )
172 x_ind_1 = x_ind_2 = 0;
176 for( int i=0; i<n-1; i++ )
177 if( myData[2*i]<=x && x<myData[2*(i+1)] )
185 return ( fabs( x - myData[2*x_ind_2] ) < 1.e-10 );
188 FunctionExpr::FunctionExpr( const char* str, const int conv )
200 myExpr = ExprIntrp_GenExp::Create();
201 myExpr->Process( ( Standard_CString )str );
203 } catch(Standard_Failure) {
205 } CASCatch_CATCH(Standard_Failure) {
207 Handle(Standard_Failure) aFail = Standard_Failure::Caught();
211 if( !ok || !myExpr->IsDone() )
214 myVars.ChangeValue( 1 ) = new Expr_NamedUnknown( "t" );
217 FunctionExpr::~FunctionExpr()
221 Standard_Boolean FunctionExpr::Value( Standard_Real T, Standard_Real& F )
224 Standard_Boolean res = value( T, f );
229 bool FunctionExpr::value( const double t, double& f ) const
231 if( myExpr.IsNull() )
234 ( ( TColStd_Array1OfReal& )myValues ).ChangeValue( 1 ) = t;
242 f = myExpr->Expression()->Evaluate( myVars, myValues );
244 } catch(Standard_Failure) {
246 } CASCatch_CATCH(Standard_Failure) {
248 Handle(Standard_Failure) aFail = Standard_Failure::Caught();
253 ok = Function::value( t, f ) && ok;
257 double FunctionExpr::integral( const double a, const double b ) const
266 math_GaussSingleIntegration _int
267 ( *static_cast<math_Function*>( const_cast<FunctionExpr*> (this) ), a, b, 20 );
271 } catch(Standard_Failure) {
273 } CASCatch_CATCH(Standard_Failure) {
276 MESSAGE( "Exception in integral calculating" );
281 double dihotomySolve( Function& f, const double val, const double _start, const double _fin, const double eps, bool& ok )
283 double start = _start, fin = _fin, start_val, fin_val; bool ok1, ok2;
284 ok1 = f.value( start, start_val );
285 ok2 = f.value( fin, fin_val );
293 bool start_pos = start_val>=val, fin_pos = fin_val>=val;
296 while( fin-start>eps )
298 double mid = ( start+fin )/2.0, mid_val;
299 ok = f.value( mid, mid_val );
304 //sprintf( buf, "start=%f\nfin=%f\nmid_val=%f\n", float( start ), float( fin ), float( mid_val ) );
307 bool mid_pos = mid_val>=val;
308 if( start_pos!=mid_pos )
313 else if( fin_pos!=mid_pos )
324 return (start+fin)/2.0;
327 bool buildDistribution( const TCollection_AsciiString& f, const int conv, const double start, const double end,
328 const int nbSeg, vector<double>& data, const double eps )
330 FunctionExpr F( f.ToCString(), conv );
331 return buildDistribution( F, start, end, nbSeg, data, eps );
334 bool buildDistribution( const std::vector<double>& f, const int conv, const double start, const double end,
335 const int nbSeg, vector<double>& data, const double eps )
337 FunctionTable F( f, conv );
338 return buildDistribution( F, start, end, nbSeg, data, eps );
341 bool buildDistribution( const Function& func, const double start, const double end, const int nbSeg,
342 vector<double>& data, const double eps )
347 data.resize( nbSeg+1 );
349 double J = func.integral( start, end ) / nbSeg;
354 //MESSAGE( "distribution:" );
356 for( int i=1; i<nbSeg; i++ )
358 FunctionIntegral f_int( &func, data[i-1] );
359 data[i] = dihotomySolve( f_int, J, data[i-1], end, eps, ok );
360 //sprintf( buf, "%f\n", float( data[i] ) );