// Created on: 1991-12-02 // Created by: Laurent PAINNOT // Copyright (c) 1991-1999 Matra Datavision // Copyright (c) 1999-2014 OPEN CASCADE SAS // // This file is part of Open CASCADE Technology software library. // // This library is free software; you can redistribute it and/or modify it under // the terms of the GNU Lesser General Public License version 2.1 as published // by the Free Software Foundation, with special exception defined in the file // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT // distribution for complete text of the license and disclaimer of any warranty. // // Alternatively, this file may be used under the terms of Open CASCADE // commercial license or contractual agreement. #ifndef _AppDef_ResConstraintOfTheGradient_HeaderFile #define _AppDef_ResConstraintOfTheGradient_HeaderFile #include #include #include #include #include #include #include #include #include #include class Standard_OutOfRange; class AppDef_MultiLine; class AppDef_MyLineTool; class AppParCurves_MultiCurve; class math_Matrix; class AppDef_ResConstraintOfTheGradient { public: DEFINE_STANDARD_ALLOC //! Given a MultiLine SSP with constraints points, this //! algorithm finds the best curve solution to approximate it. //! The poles from SCurv issued for example from the least //! squares are used as a guess solution for the uzawa //! algorithm. The tolerance used in the Uzawa algorithms //! is Tolerance. //! A is the Bernstein matrix associated to the MultiLine //! and DA is the derivative bernstein matrix.(They can come //! from an approximation with ParLeastSquare.) //! The MultiCurve is modified. New MultiPoles are given. Standard_EXPORT AppDef_ResConstraintOfTheGradient( const AppDef_MultiLine& SSP, AppParCurves_MultiCurve& SCurv, const int FirstPoint, const int LastPoint, const occ::handle>& Constraints, const math_Matrix& Bern, const math_Matrix& DerivativeBern, const double Tolerance = 1.0e-10); //! returns True if all has been correctly done. Standard_EXPORT bool IsDone() const; //! returns the maximum difference value between the curve //! and the given points. Standard_EXPORT double Error() const; Standard_EXPORT const math_Matrix& ConstraintMatrix() const; //! returns the duale variables of the system. Standard_EXPORT const math_Vector& Duale() const; //! Returns the derivative of the constraint matrix. Standard_EXPORT const math_Matrix& ConstraintDerivative(const AppDef_MultiLine& SSP, const math_Vector& Parameters, const int Deg, const math_Matrix& DA); //! returns the Inverse of Cont*Transposed(Cont), where //! Cont is the constraint matrix for the algorithm. Standard_EXPORT const math_Matrix& InverseMatrix() const; protected: //! is used internally to create the fields. Standard_EXPORT int NbConstraints( const AppDef_MultiLine& SSP, const int FirstPoint, const int LastPoint, const occ::handle>& TheConstraints) const; //! is internally used for the fields creation. Standard_EXPORT int NbColumns(const AppDef_MultiLine& SSP, const int Deg) const; private: bool Done; double Err; math_Matrix Cont; math_Matrix DeCont; math_Vector Secont; math_Matrix CTCinv; math_Vector Vardua; int IncPass; int IncTan; int IncCurv; NCollection_Array1 IPas; NCollection_Array1 ITan; NCollection_Array1 ICurv; }; #endif // _AppDef_ResConstraintOfTheGradient_HeaderFile