1 // Created on: 1995-06-06
2 // Created by: Jean Yves LEBEY
3 // Copyright (c) 1995-1999 Matra Datavision
4 // Copyright (c) 1999-2014 OPEN CASCADE SAS
6 // This file is part of Open CASCADE Technology software library.
8 // This library is free software; you can redistribute it and/or modify it under
9 // the terms of the GNU Lesser General Public License version 2.1 as published
10 // by the Free Software Foundation, with special exception defined in the file
11 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
12 // distribution for complete text of the license and disclaimer of any warranty.
14 // Alternatively, this file may be used under the terms of Open CASCADE
15 // commercial license or contractual agreement.
17 #ifndef _BRepApprox_ResConstraintOfMyGradientbisOfTheComputeLineOfApprox_HeaderFile
18 #define _BRepApprox_ResConstraintOfMyGradientbisOfTheComputeLineOfApprox_HeaderFile
20 #include <Standard.hxx>
21 #include <Standard_DefineAlloc.hxx>
22 #include <Standard_Handle.hxx>
24 #include <Standard_Real.hxx>
25 #include <math_Matrix.hxx>
26 #include <math_Vector.hxx>
27 #include <Standard_Integer.hxx>
28 #include <TColStd_Array1OfInteger.hxx>
29 #include <AppParCurves_HArray1OfConstraintCouple.hxx>
30 class Standard_OutOfRange;
31 class BRepApprox_TheMultiLineOfApprox;
32 class BRepApprox_TheMultiLineToolOfApprox;
33 class AppParCurves_MultiCurve;
38 class BRepApprox_ResConstraintOfMyGradientbisOfTheComputeLineOfApprox
45 //! Given a MultiLine SSP with constraints points, this
46 //! algorithm finds the best curve solution to approximate it.
47 //! The poles from SCurv issued for example from the least
48 //! squares are used as a guess solution for the uzawa
49 //! algorithm. The tolerance used in the Uzawa algorithms
51 //! A is the Bernstein matrix associated to the MultiLine
52 //! and DA is the derivative bernstein matrix.(They can come
53 //! from an approximation with ParLeastSquare.)
54 //! The MultiCurve is modified. New MultiPoles are given.
55 Standard_EXPORT BRepApprox_ResConstraintOfMyGradientbisOfTheComputeLineOfApprox(const BRepApprox_TheMultiLineOfApprox& SSP, AppParCurves_MultiCurve& SCurv, const Standard_Integer FirstPoint, const Standard_Integer LastPoint, const Handle(AppParCurves_HArray1OfConstraintCouple)& Constraints, const math_Matrix& Bern, const math_Matrix& DerivativeBern, const Standard_Real Tolerance = 1.0e-10);
57 //! returns True if all has been correctly done.
58 Standard_EXPORT Standard_Boolean IsDone() const;
60 //! returns the maximum difference value between the curve
61 //! and the given points.
62 Standard_EXPORT Standard_Real Error() const;
64 Standard_EXPORT const math_Matrix& ConstraintMatrix() const;
66 //! returns the duale variables of the system.
67 Standard_EXPORT const math_Vector& Duale() const;
69 //! Returns the derivative of the constraint matrix.
70 Standard_EXPORT const math_Matrix& ConstraintDerivative (const BRepApprox_TheMultiLineOfApprox& SSP, const math_Vector& Parameters, const Standard_Integer Deg, const math_Matrix& DA);
72 //! returns the Inverse of Cont*Transposed(Cont), where
73 //! Cont is the constraint matrix for the algorithm.
74 Standard_EXPORT const math_Matrix& InverseMatrix() const;
82 //! is used internally to create the fields.
83 Standard_EXPORT Standard_Integer NbConstraints (const BRepApprox_TheMultiLineOfApprox& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint, const Handle(AppParCurves_HArray1OfConstraintCouple)& TheConstraints) const;
85 //! is internally used for the fields creation.
86 Standard_EXPORT Standard_Integer NbColumns (const BRepApprox_TheMultiLineOfApprox& SSP, const Standard_Integer Deg) const;
95 Standard_Boolean Done;
102 Standard_Integer IncPass;
103 Standard_Integer IncTan;
104 Standard_Integer IncCurv;
105 TColStd_Array1OfInteger IPas;
106 TColStd_Array1OfInteger ITan;
107 TColStd_Array1OfInteger ICurv;
118 #endif // _BRepApprox_ResConstraintOfMyGradientbisOfTheComputeLineOfApprox_HeaderFile