![]() |
Open CASCADE Technology Reference Manual 8.0.1
|
#include <BRepApprox_MyGradientOfTheComputeLineBezierOfApprox.hxx>
Public Member Functions | |
| BRepApprox_MyGradientOfTheComputeLineBezierOfApprox (const BRepApprox_TheMultiLineOfApprox &SSP, const int FirstPoint, const int LastPoint, const occ::handle< NCollection_HArray1< AppParCurves_ConstraintCouple > > &TheConstraints, math_Vector &Parameters, const int Deg, const double Tol3d, const double Tol2d, const int NbIterations=200) | |
| Tries to minimize the sum (square(||Qui - Bi*Pi||)) where Pui describe the approximating Bezier curves'Poles and Qi the MultiLine points with a parameter ui. In this algorithm, the parameters ui are the unknowns. The tolerance required on this sum is given by Tol. The desired degree of the resulting curve is Deg. | |
| bool | IsDone () const |
| returns True if all has been correctly done. | |
| AppParCurves_MultiCurve | Value () const |
| returns all the Bezier curves approximating the MultiLine SSP after minimization of the parameter. | |
| double | Error (const int Index) const |
| returns the difference between the old and the new approximation. An exception is raised if NotDone. An exception is raised if Index<1 or Index>NbParameters. | |
| double | MaxError3d () const |
| returns the maximum difference between the old and the new approximation. | |
| double | MaxError2d () const |
| returns the maximum difference between the old and the new approximation. | |
| double | AverageError () const |
| returns the average error between the old and the new approximation. | |
| BRepApprox_MyGradientOfTheComputeLineBezierOfApprox::BRepApprox_MyGradientOfTheComputeLineBezierOfApprox | ( | const BRepApprox_TheMultiLineOfApprox & | SSP, |
| const int | FirstPoint, | ||
| const int | LastPoint, | ||
| const occ::handle< NCollection_HArray1< AppParCurves_ConstraintCouple > > & | TheConstraints, | ||
| math_Vector & | Parameters, | ||
| const int | Deg, | ||
| const double | Tol3d, | ||
| const double | Tol2d, | ||
| const int | NbIterations = 200 ) |
Tries to minimize the sum (square(||Qui - Bi*Pi||)) where Pui describe the approximating Bezier curves'Poles and Qi the MultiLine points with a parameter ui. In this algorithm, the parameters ui are the unknowns. The tolerance required on this sum is given by Tol. The desired degree of the resulting curve is Deg.
| double BRepApprox_MyGradientOfTheComputeLineBezierOfApprox::AverageError | ( | ) | const |
returns the average error between the old and the new approximation.
| double BRepApprox_MyGradientOfTheComputeLineBezierOfApprox::Error | ( | const int | Index | ) | const |
returns the difference between the old and the new approximation. An exception is raised if NotDone. An exception is raised if Index<1 or Index>NbParameters.
| bool BRepApprox_MyGradientOfTheComputeLineBezierOfApprox::IsDone | ( | ) | const |
returns True if all has been correctly done.
| double BRepApprox_MyGradientOfTheComputeLineBezierOfApprox::MaxError2d | ( | ) | const |
returns the maximum difference between the old and the new approximation.
| double BRepApprox_MyGradientOfTheComputeLineBezierOfApprox::MaxError3d | ( | ) | const |
returns the maximum difference between the old and the new approximation.
| AppParCurves_MultiCurve BRepApprox_MyGradientOfTheComputeLineBezierOfApprox::Value | ( | ) | const |
returns all the Bezier curves approximating the MultiLine SSP after minimization of the parameter.