#include <BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox.hxx>

Public Member Functions
	BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox (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)
	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_Boolean	IsDone () const
	returns True if all has been correctly done.

Standard_Real	Error () const
	returns the maximum difference value between the curve and the given points.

const math_Matrix &	ConstraintMatrix () const

const math_Vector &	Duale () const
	returns the duale variables of the system.

const math_Matrix &	ConstraintDerivative (const BRepApprox_TheMultiLineOfApprox &SSP, const math_Vector &Parameters, const Standard_Integer Deg, const math_Matrix &DA)
	Returns the derivative of the constraint matrix.

const math_Matrix &	InverseMatrix () const
	returns the Inverse of Cont*Transposed(Cont), where Cont is the constraint matrix for the algorithm.

Protected Member Functions
Standard_Integer	NbConstraints (const BRepApprox_TheMultiLineOfApprox &SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint, const Handle< AppParCurves_HArray1OfConstraintCouple > &TheConstraints) const
	is used internally to create the fields.

Standard_Integer	NbColumns (const BRepApprox_TheMultiLineOfApprox &SSP, const Standard_Integer Deg) const
	is internally used for the fields creation.

Constructor & Destructor Documentation

◆ BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox()

BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox::BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox	(	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`
	)

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.

Member Function Documentation

◆ ConstraintDerivative()

const math_Matrix & BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox::ConstraintDerivative	(	const BRepApprox_TheMultiLineOfApprox &	SSP,
		const math_Vector &	Parameters,
		const Standard_Integer	Deg,
		const math_Matrix &	DA
	)

Returns the derivative of the constraint matrix.

◆ ConstraintMatrix()

const math_Matrix & BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox::ConstraintMatrix ( ) const

◆ Duale()

const math_Vector & BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox::Duale ( ) const

returns the duale variables of the system.

◆ Error()

Standard_Real BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox::Error ( ) const

returns the maximum difference value between the curve and the given points.

◆ InverseMatrix()

const math_Matrix & BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox::InverseMatrix ( ) const

returns the Inverse of Cont*Transposed(Cont), where Cont is the constraint matrix for the algorithm.

◆ IsDone()

Standard_Boolean BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox::IsDone ( ) const

returns True if all has been correctly done.

◆ NbColumns()

Standard_Integer BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox::NbColumns	(	const BRepApprox_TheMultiLineOfApprox &	SSP,
		const Standard_Integer	Deg
	)		const

protected

is internally used for the fields creation.

◆ NbConstraints()

Standard_Integer BRepApprox_ResConstraintOfMyGradientOfTheComputeLineBezierOfApprox::NbConstraints	(	const BRepApprox_TheMultiLineOfApprox &	SSP,
		const Standard_Integer	FirstPoint,
		const Standard_Integer	LastPoint,
		const Handle< AppParCurves_HArray1OfConstraintCouple > &	TheConstraints
	)		const