BRepApprox
OCCT package BRepApprox: BRepApprox_ApproxLine, BRepApprox_BSpGradient_BFGSOfMyBSplGradientOfTheComputeLineOfApprox,…
BRepApprox_ApproxLine
Constructors(2)
- constructor(lin: IntSurf_LineOn2S, theTang?: boolean): BRepApprox_ApproxLine
theTang variable has been entered only for compatibility with the alias
IntPatch_WLine. They are not used in this class.Parameters (2)lintheTang
- constructor(CurveXYZ: Geom_BSplineCurve, CurveUV1: Geom2d_BSplineCurve, CurveUV2: Geom2d_BSplineCurve): BRepApprox_ApproxLineParameters (3)
CurveXYZCurveUV1CurveUV2
Static methods(2)
- get_type_name(): string
Instance methods(3)
- NbPnts(): number
- Point(Index: number): IntSurf_PntOn2SParameters (1)
Index
BRepApprox_BSpGradient_BFGSOfMyBSplGradientOfTheComputeLineOfApprox
Constructors(1)
- constructor(F: math_MultipleVarFunctionWithGradient, StartingPoint: math_Vector, Tolerance3d: number, Tolerance2d: number, Eps: number, NbIterations?: number): BRepApprox_BSpGradient_BFGSOfMyBSplGradientOfTheComputeLineOfApproxParameters (6)
FStartingPointTolerance3dTolerance2dEpsNbIterations
Instance methods(1)
- IsSolutionReached(F: math_MultipleVarFunctionWithGradient): boolean
This method is called at the end of each iteration to check if the solution is found. It can be redefined in a sub-class to implement a specific test to stop the iterations.
Parameters (1)F
BRepApprox_BSpParFunctionOfMyBSplGradientOfTheComputeLineOfApprox
Constructors(1)
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, Parameters: math_Vector, Knots: NCollection_Array1_double, Mults: NCollection_Array1_int, NbPol: number): BRepApprox_BSpParFunctionOfMyBSplGradientOfTheComputeLineOfApprox
initializes the fields of the function. The approximating curve has <NbPol> control points.
Parameters (8)SSPFirstPointLastPointTheConstraintsParametersKnotsMultsNbPol
Instance methods(16)
- NbVariables(): number
returns the number of variables of the function. It corresponds to the number of MultiPoints.
- Value(X: math_Vector, F: number): { returnValue: boolean; F: number }
this method computes the new approximation of the MultiLine SSP and calculates F = sum (||Pui - Bi*Pi||2) for each point of the MultiLine.
Parameters (2)XF
ReturnsA result object with fields:
returnValue: the C++ return valueF: updated value from the call.
- Gradient(X: math_Vector, G: math_Vector): boolean
returns the gradient G of the sum above for the parameters Xi.
Parameters (2)XG
- Values(X: math_Vector, F: number, G: math_Vector): { returnValue: boolean; F: number }
returns the value F=sum(||Pui - Bi*Pi||)2. returns the value G = grad(F) for the parameters Xi.
Parameters (3)XFG
ReturnsA result object with fields:
returnValue: the C++ return valueF: updated value from the call.
- NewParameters(): math_Vector
returns the new parameters of the MultiLine.
returns the MultiBSpCurve approximating the set after computing the value F or Grad(F).
- Error(IPoint: number, CurveIndex: number): number
returns the distance between the MultiPoint of range IPoint and the curve CurveIndex.
Parameters (2)IPointCurveIndex
- MaxError3d(): number
returns the maximum distance between the points and the MultiBSpCurve.
- MaxError2d(): number
returns the maximum distance between the points and the MultiBSpCurve.
returns the function matrix used to approximate the multiline.
returns the derivative function matrix used to approximate the multiline.
- Index(): math_IntegerVector
Returns the indexes of the first non null values of A and DA. The values are non null from Index(ieme point) +1 to Index(ieme point) + degree +1.
- FirstConstraint(TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, FirstPoint: number): AppParCurves_ConstraintParameters (2)
TheConstraintsFirstPoint
- LastConstraint(TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, LastPoint: number): AppParCurves_ConstraintParameters (2)
TheConstraintsLastPoint
- SetFirstLambda(l1: number): voidParameters (1)
l1
- SetLastLambda(l2: number): voidParameters (1)
l2
BRepApprox_BSpParLeastSquareOfMyBSplGradientOfTheComputeLineOfApprox
Constructors(4)
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, NbPol: number): BRepApprox_BSpParLeastSquareOfMyBSplGradientOfTheComputeLineOfApprox
Initializes the fields of the object.
Parameters (6)SSPFirstPointLastPointFirstConsLastConsNbPol
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, Parameters: math_Vector, NbPol: number): BRepApprox_BSpParLeastSquareOfMyBSplGradientOfTheComputeLineOfApprox
given a MultiLine, this algorithm computes the least square resolution using the Householder-QR method.
If the first and/or the last point is a constraint point, the value of the tangency or curvature is computed in the resolution. NbPol is the number of control points wanted for the approximating curves. The system to solve is the following: A X = B. Where A is the Bernstein matrix computed with the parameters, B the points coordinates and X the poles solutions.
The matrix A is the same for each coordinate x, y and z and is also the same for each MultiLine point because they are approximated in parallel(so with the same parameter, only the vector B changes).Parameters (7)SSPFirstPointLastPointFirstConsLastConsParametersNbPol
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, Knots: NCollection_Array1_double, Mults: NCollection_Array1_int, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, NbPol: number): BRepApprox_BSpParLeastSquareOfMyBSplGradientOfTheComputeLineOfApprox
Initializes the fields of the object.
Parameters (8)SSPKnotsMultsFirstPointLastPointFirstConsLastConsNbPol
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, Knots: NCollection_Array1_double, Mults: NCollection_Array1_int, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, Parameters: math_Vector, NbPol: number): BRepApprox_BSpParLeastSquareOfMyBSplGradientOfTheComputeLineOfApprox
given a MultiLine, this algorithm computes the least square resolution using the Householder-QR method.
If the first and/or the last point is a constraint point, the value of the tangency or curvature is computed in the resolution. Deg is the degree wanted for the approximating curves. The system to solve is the following: A X = B. Where A is the BSpline functions matrix computed with <parameters>, B the points coordinates and X the poles solutions.
The matrix A is the same for each coordinate x, y and z and is also the same for each MultiLine point because they are approximated in parallel(so with the same parameter, only the vector B changes).Parameters (9)SSPKnotsMultsFirstPointLastPointFirstConsLastConsParametersNbPol
Instance methods(17)
- Perform(Parameters: math_Vector): void
Is used after having initialized the fields. The case "CurvaturePoint" is not treated in this method.
Parameters (1)Parameters
- Perform(Parameters: math_Vector, l1: number, l2: number): void
Is used after having initialized the fields.
Parameters (3)Parametersl1l2
- Perform(Parameters: math_Vector, V1t: math_Vector, V2t: math_Vector, l1: number, l2: number): void
Is used after having initialized the fields. <V1t> is the tangent vector at the first point. <V2t> is the tangent vector at the last point.
Parameters (5)ParametersV1tV2tl1l2
- Perform(Parameters: math_Vector, V1t: math_Vector, V2t: math_Vector, V1c: math_Vector, V2c: math_Vector, l1: number, l2: number): void
Is used after having initialized the fields. <V1t> is the tangent vector at the first point. <V2t> is the tangent vector at the last point. <V1c> is the tangent vector at the first point. <V2c> is the tangent vector at the last point.
Parameters (7)ParametersV1tV2tV1cV2cl1l2
- IsDone(): boolean
returns True if all has been correctly done.
returns the result of the approximation, i.e. all the Curves. An exception is raised if NotDone.
returns the result of the approximation, i.e. all the Curves. An exception is raised if NotDone.
returns the function matrix used to approximate the set.
returns the derivative function matrix used to approximate the set.
- ErrorGradient(Grad: math_Vector, F: number, MaxE3d: number, MaxE2d: number): { F: number; MaxE3d: number; MaxE2d: number }
returns the maximum errors between the MultiLine and the approximation curves. F is the sum of the square distances. Grad is the derivative vector of the function F.
Parameters (4)GradFMaxE3dMaxE2d
ReturnsA result object with fields:
F: updated value from the call.MaxE3d: updated value from the call.MaxE2d: updated value from the call.
returns the distances between the points of the multiline and the approximation curves.
- Error(F: number, MaxE3d: number, MaxE2d: number): { F: number; MaxE3d: number; MaxE2d: number }
returns the maximum errors between the MultiLine and the approximation curves. F is the sum of the square distances.
Parameters (3)FMaxE3dMaxE2d
ReturnsA result object with fields:
F: updated value from the call.MaxE3d: updated value from the call.MaxE2d: updated value from the call.
- FirstLambda(): number
returns the value (P2 - P1)/ V1 if the first point was a tangency point.
- LastLambda(): number
returns the value (PN - PN-1)/ VN if the last point was a tangency point.
returns the matrix of points value.
- Poles(): math_Matrix
returns the matrix of resulting control points value.
- KIndex(): math_IntegerVector
Returns the indexes of the first non null values of A and DA. The values are non null from Index(ieme point) +1 to Index(ieme point) + degree +1.
BRepApprox_Gradient_BFGSOfMyGradientbisOfTheComputeLineOfApprox
Constructors(1)
- constructor(F: math_MultipleVarFunctionWithGradient, StartingPoint: math_Vector, Tolerance3d: number, Tolerance2d: number, Eps: number, NbIterations?: number): BRepApprox_Gradient_BFGSOfMyGradientbisOfTheComputeLineOfApproxParameters (6)
FStartingPointTolerance3dTolerance2dEpsNbIterations
Instance methods(1)
- IsSolutionReached(F: math_MultipleVarFunctionWithGradient): boolean
This method is called at the end of each iteration to check if the solution is found. It can be redefined in a sub-class to implement a specific test to stop the iterations.
Parameters (1)F
BRepApprox_Gradient_BFGSOfMyGradientOfTheComputeLineBezierOfApprox
Constructors(1)
- constructor(F: math_MultipleVarFunctionWithGradient, StartingPoint: math_Vector, Tolerance3d: number, Tolerance2d: number, Eps: number, NbIterations?: number): BRepApprox_Gradient_BFGSOfMyGradientOfTheComputeLineBezierOfApproxParameters (6)
FStartingPointTolerance3dTolerance2dEpsNbIterations
Instance methods(1)
- IsSolutionReached(F: math_MultipleVarFunctionWithGradient): boolean
This method is called at the end of each iteration to check if the solution is found. It can be redefined in a sub-class to implement a specific test to stop the iterations.
Parameters (1)F
BRepApprox_MyBSplGradientOfTheComputeLineOfApprox
Constructors(2)
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, Parameters: math_Vector, Knots: NCollection_Array1_double, Mults: NCollection_Array1_int, Deg: number, Tol3d: number, Tol2d: number, NbIterations?: number): BRepApprox_MyBSplGradientOfTheComputeLineOfApprox
Tries to minimize the sum (square(||Qui - Bi*Pi||)) where Pui describe the approximating BSpline 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.
Parameters (11)SSPFirstPointLastPointTheConstraintsParametersKnotsMultsDegTol3dTol2dNbIterations
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, Parameters: math_Vector, Knots: NCollection_Array1_double, Mults: NCollection_Array1_int, Deg: number, Tol3d: number, Tol2d: number, NbIterations: number, lambda1: number, lambda2: number): BRepApprox_MyBSplGradientOfTheComputeLineOfApprox
Tries to minimize the sum (square(||Qui - Bi*Pi||)) where Pui describe the approximating BSpline 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.
Parameters (13)SSPFirstPointLastPointTheConstraintsParametersKnotsMultsDegTol3dTol2dNbIterationslambda1lambda2
Instance methods(6)
- IsDone(): boolean
returns True if all has been correctly done.
returns all the BSpline curves approximating the MultiLine SSP after minimization of the parameter.
- Error(Index: number): number
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.
Parameters (1)Index
- MaxError3d(): number
returns the maximum difference between the old and the new approximation.
- MaxError2d(): number
returns the maximum difference between the old and the new approximation.
- AverageError(): number
returns the average error between the old and the new approximation.
BRepApprox_MyGradientbisOfTheComputeLineOfApprox
Constructors(1)
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, Parameters: math_Vector, Deg: number, Tol3d: number, Tol2d: number, NbIterations?: number): BRepApprox_MyGradientbisOfTheComputeLineOfApprox
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.
Parameters (9)SSPFirstPointLastPointTheConstraintsParametersDegTol3dTol2dNbIterations
Instance methods(6)
- IsDone(): boolean
returns True if all has been correctly done.
returns all the Bezier curves approximating the MultiLine SSP after minimization of the parameter.
- Error(Index: number): number
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.
Parameters (1)Index
- MaxError3d(): number
returns the maximum difference between the old and the new approximation.
- MaxError2d(): number
returns the maximum difference between the old and the new approximation.
- AverageError(): number
returns the average error between the old and the new approximation.
BRepApprox_MyGradientOfTheComputeLineBezierOfApprox
Constructors(1)
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, Parameters: math_Vector, Deg: number, Tol3d: number, Tol2d: number, NbIterations?: number): BRepApprox_MyGradientOfTheComputeLineBezierOfApprox
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.
Parameters (9)SSPFirstPointLastPointTheConstraintsParametersDegTol3dTol2dNbIterations
Instance methods(6)
- IsDone(): boolean
returns True if all has been correctly done.
returns all the Bezier curves approximating the MultiLine SSP after minimization of the parameter.
- Error(Index: number): number
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.
Parameters (1)Index
- MaxError3d(): number
returns the maximum difference between the old and the new approximation.
- MaxError2d(): number
returns the maximum difference between the old and the new approximation.
- AverageError(): number
returns the average error between the old and the new approximation.
BRepApprox_ParFunctionOfMyGradientbisOfTheComputeLineOfApprox
Constructors(1)
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, Parameters: math_Vector, Deg: number): BRepApprox_ParFunctionOfMyGradientbisOfTheComputeLineOfApprox
initializes the fields of the function. The approximating curve has the desired degree Deg.
Parameters (6)SSPFirstPointLastPointTheConstraintsParametersDeg
Instance methods(11)
- NbVariables(): number
returns the number of variables of the function. It corresponds to the number of MultiPoints.
- Value(X: math_Vector, F: number): { returnValue: boolean; F: number }
this method computes the new approximation of the MultiLine SSP and calculates F = sum (||Pui - Bi*Pi||2) for each point of the MultiLine.
Parameters (2)XF
ReturnsA result object with fields:
returnValue: the C++ return valueF: updated value from the call.
- Gradient(X: math_Vector, G: math_Vector): boolean
returns the gradient G of the sum above for the parameters Xi.
Parameters (2)XG
- Values(X: math_Vector, F: number, G: math_Vector): { returnValue: boolean; F: number }
returns the value F=sum(||Pui - Bi*Pi||)2. returns the value G = grad(F) for the parameters Xi.
Parameters (3)XFG
ReturnsA result object with fields:
returnValue: the C++ return valueF: updated value from the call.
- NewParameters(): math_Vector
returns the new parameters of the MultiLine.
returns the MultiCurve approximating the set after computing the value F or Grad(F).
- Error(IPoint: number, CurveIndex: number): number
returns the distance between the MultiPoint of range IPoint and the curve CurveIndex.
Parameters (2)IPointCurveIndex
- MaxError3d(): number
returns the maximum distance between the points and the MultiCurve.
- MaxError2d(): number
returns the maximum distance between the points and the MultiCurve.
- FirstConstraint(TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, FirstPoint: number): AppParCurves_ConstraintParameters (2)
TheConstraintsFirstPoint
- LastConstraint(TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, LastPoint: number): AppParCurves_ConstraintParameters (2)
TheConstraintsLastPoint
BRepApprox_ParFunctionOfMyGradientOfTheComputeLineBezierOfApprox
Constructors(1)
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, Parameters: math_Vector, Deg: number): BRepApprox_ParFunctionOfMyGradientOfTheComputeLineBezierOfApprox
initializes the fields of the function. The approximating curve has the desired degree Deg.
Parameters (6)SSPFirstPointLastPointTheConstraintsParametersDeg
Instance methods(11)
- NbVariables(): number
returns the number of variables of the function. It corresponds to the number of MultiPoints.
- Value(X: math_Vector, F: number): { returnValue: boolean; F: number }
this method computes the new approximation of the MultiLine SSP and calculates F = sum (||Pui - Bi*Pi||2) for each point of the MultiLine.
Parameters (2)XF
ReturnsA result object with fields:
returnValue: the C++ return valueF: updated value from the call.
- Gradient(X: math_Vector, G: math_Vector): boolean
returns the gradient G of the sum above for the parameters Xi.
Parameters (2)XG
- Values(X: math_Vector, F: number, G: math_Vector): { returnValue: boolean; F: number }
returns the value F=sum(||Pui - Bi*Pi||)2. returns the value G = grad(F) for the parameters Xi.
Parameters (3)XFG
ReturnsA result object with fields:
returnValue: the C++ return valueF: updated value from the call.
- NewParameters(): math_Vector
returns the new parameters of the MultiLine.
returns the MultiCurve approximating the set after computing the value F or Grad(F).
- Error(IPoint: number, CurveIndex: number): number
returns the distance between the MultiPoint of range IPoint and the curve CurveIndex.
Parameters (2)IPointCurveIndex
- MaxError3d(): number
returns the maximum distance between the points and the MultiCurve.
- MaxError2d(): number
returns the maximum distance between the points and the MultiCurve.
- FirstConstraint(TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, FirstPoint: number): AppParCurves_ConstraintParameters (2)
TheConstraintsFirstPoint
- LastConstraint(TheConstraints: NCollection_HArray1_AppParCurves_ConstraintCouple, LastPoint: number): AppParCurves_ConstraintParameters (2)
TheConstraintsLastPoint
BRepApprox_ParLeastSquareOfMyGradientbisOfTheComputeLineOfApprox
Constructors(4)
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, NbPol: number): BRepApprox_ParLeastSquareOfMyGradientbisOfTheComputeLineOfApprox
Initializes the fields of the object.
Parameters (6)SSPFirstPointLastPointFirstConsLastConsNbPol
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, Parameters: math_Vector, NbPol: number): BRepApprox_ParLeastSquareOfMyGradientbisOfTheComputeLineOfApprox
given a MultiLine, this algorithm computes the least square resolution using the Householder-QR method.
If the first and/or the last point is a constraint point, the value of the tangency or curvature is computed in the resolution. NbPol is the number of control points wanted for the approximating curves. The system to solve is the following: A X = B. Where A is the Bernstein matrix computed with the parameters, B the points coordinates and X the poles solutions.
The matrix A is the same for each coordinate x, y and z and is also the same for each MultiLine point because they are approximated in parallel(so with the same parameter, only the vector B changes).Parameters (7)SSPFirstPointLastPointFirstConsLastConsParametersNbPol
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, Knots: NCollection_Array1_double, Mults: NCollection_Array1_int, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, NbPol: number): BRepApprox_ParLeastSquareOfMyGradientbisOfTheComputeLineOfApprox
Initializes the fields of the object.
Parameters (8)SSPKnotsMultsFirstPointLastPointFirstConsLastConsNbPol
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, Knots: NCollection_Array1_double, Mults: NCollection_Array1_int, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, Parameters: math_Vector, NbPol: number): BRepApprox_ParLeastSquareOfMyGradientbisOfTheComputeLineOfApprox
given a MultiLine, this algorithm computes the least square resolution using the Householder-QR method.
If the first and/or the last point is a constraint point, the value of the tangency or curvature is computed in the resolution. Deg is the degree wanted for the approximating curves. The system to solve is the following: A X = B. Where A is the BSpline functions matrix computed with <parameters>, B the points coordinates and X the poles solutions.
The matrix A is the same for each coordinate x, y and z and is also the same for each MultiLine point because they are approximated in parallel(so with the same parameter, only the vector B changes).Parameters (9)SSPKnotsMultsFirstPointLastPointFirstConsLastConsParametersNbPol
Instance methods(17)
- Perform(Parameters: math_Vector): void
Is used after having initialized the fields. The case "CurvaturePoint" is not treated in this method.
Parameters (1)Parameters
- Perform(Parameters: math_Vector, l1: number, l2: number): void
Is used after having initialized the fields.
Parameters (3)Parametersl1l2
- Perform(Parameters: math_Vector, V1t: math_Vector, V2t: math_Vector, l1: number, l2: number): void
Is used after having initialized the fields. <V1t> is the tangent vector at the first point. <V2t> is the tangent vector at the last point.
Parameters (5)ParametersV1tV2tl1l2
- Perform(Parameters: math_Vector, V1t: math_Vector, V2t: math_Vector, V1c: math_Vector, V2c: math_Vector, l1: number, l2: number): void
Is used after having initialized the fields. <V1t> is the tangent vector at the first point. <V2t> is the tangent vector at the last point. <V1c> is the tangent vector at the first point. <V2c> is the tangent vector at the last point.
Parameters (7)ParametersV1tV2tV1cV2cl1l2
- IsDone(): boolean
returns True if all has been correctly done.
returns the result of the approximation, i.e. all the Curves. An exception is raised if NotDone.
returns the result of the approximation, i.e. all the Curves. An exception is raised if NotDone.
returns the function matrix used to approximate the set.
returns the derivative function matrix used to approximate the set.
- ErrorGradient(Grad: math_Vector, F: number, MaxE3d: number, MaxE2d: number): { F: number; MaxE3d: number; MaxE2d: number }
returns the maximum errors between the MultiLine and the approximation curves. F is the sum of the square distances. Grad is the derivative vector of the function F.
Parameters (4)GradFMaxE3dMaxE2d
ReturnsA result object with fields:
F: updated value from the call.MaxE3d: updated value from the call.MaxE2d: updated value from the call.
returns the distances between the points of the multiline and the approximation curves.
- Error(F: number, MaxE3d: number, MaxE2d: number): { F: number; MaxE3d: number; MaxE2d: number }
returns the maximum errors between the MultiLine and the approximation curves. F is the sum of the square distances.
Parameters (3)FMaxE3dMaxE2d
ReturnsA result object with fields:
F: updated value from the call.MaxE3d: updated value from the call.MaxE2d: updated value from the call.
- FirstLambda(): number
returns the value (P2 - P1)/ V1 if the first point was a tangency point.
- LastLambda(): number
returns the value (PN - PN-1)/ VN if the last point was a tangency point.
returns the matrix of points value.
- Poles(): math_Matrix
returns the matrix of resulting control points value.
- KIndex(): math_IntegerVector
Returns the indexes of the first non null values of A and DA. The values are non null from Index(ieme point) +1 to Index(ieme point) + degree +1.
BRepApprox_ParLeastSquareOfMyGradientOfTheComputeLineBezierOfApprox
Constructors(4)
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, NbPol: number): BRepApprox_ParLeastSquareOfMyGradientOfTheComputeLineBezierOfApprox
Initializes the fields of the object.
Parameters (6)SSPFirstPointLastPointFirstConsLastConsNbPol
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, Parameters: math_Vector, NbPol: number): BRepApprox_ParLeastSquareOfMyGradientOfTheComputeLineBezierOfApprox
given a MultiLine, this algorithm computes the least square resolution using the Householder-QR method.
If the first and/or the last point is a constraint point, the value of the tangency or curvature is computed in the resolution. NbPol is the number of control points wanted for the approximating curves. The system to solve is the following: A X = B. Where A is the Bernstein matrix computed with the parameters, B the points coordinates and X the poles solutions.
The matrix A is the same for each coordinate x, y and z and is also the same for each MultiLine point because they are approximated in parallel(so with the same parameter, only the vector B changes).Parameters (7)SSPFirstPointLastPointFirstConsLastConsParametersNbPol
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, Knots: NCollection_Array1_double, Mults: NCollection_Array1_int, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, NbPol: number): BRepApprox_ParLeastSquareOfMyGradientOfTheComputeLineBezierOfApprox
Initializes the fields of the object.
Parameters (8)SSPKnotsMultsFirstPointLastPointFirstConsLastConsNbPol
- constructor(SSP: BRepApprox_TheMultiLineOfApprox, Knots: NCollection_Array1_double, Mults: NCollection_Array1_int, FirstPoint: number, LastPoint: number, FirstCons: AppParCurves_Constraint, LastCons: AppParCurves_Constraint, Parameters: math_Vector, NbPol: number): BRepApprox_ParLeastSquareOfMyGradientOfTheComputeLineBezierOfApprox
given a MultiLine, this algorithm computes the least square resolution using the Householder-QR method.
If the first and/or the last point is a constraint point, the value of the tangency or curvature is computed in the resolution. Deg is the degree wanted for the approximating curves. The system to solve is the following: A X = B. Where A is the BSpline functions matrix computed with <parameters>, B the points coordinates and X the poles solutions.
The matrix A is the same for each coordinate x, y and z and is also the same for each MultiLine point because they are approximated in parallel(so with the same parameter, only the vector B changes).Parameters (9)SSPKnotsMultsFirstPointLastPointFirstConsLastConsParametersNbPol
Instance methods(17)
- Perform(Parameters: math_Vector): void
Is used after having initialized the fields. The case "CurvaturePoint" is not treated in this method.
Parameters (1)Parameters
- Perform(Parameters: math_Vector, l1: number, l2: number): void
Is used after having initialized the fields.
Parameters (3)Parametersl1l2
- Perform(Parameters: math_Vector, V1t: math_Vector, V2t: math_Vector, l1: number, l2: number): void
Is used after having initialized the fields. <V1t> is the tangent vector at the first point. <V2t> is the tangent vector at the last point.
Parameters (5)ParametersV1tV2tl1l2
- Perform(Parameters: math_Vector, V1t: math_Vector, V2t: math_Vector, V1c: math_Vector, V2c: math_Vector, l1: number, l2: number): void
Is used after having initialized the fields. <V1t> is the tangent vector at the first point. <V2t> is the tangent vector at the last point. <V1c> is the tangent vector at the first point. <V2c> is the tangent vector at the last point.
Parameters (7)ParametersV1tV2tV1cV2cl1l2
- IsDone(): boolean
returns True if all has been correctly done.
returns the result of the approximation, i.e. all the Curves. An exception is raised if NotDone.
returns the result of the approximation, i.e. all the Curves. An exception is raised if NotDone.
returns the function matrix used to approximate the set.
returns the derivative function matrix used to approximate the set.
- ErrorGradient(Grad: math_Vector, F: number, MaxE3d: number, MaxE2d: number): { F: number; MaxE3d: number; MaxE2d: number }
returns the maximum errors between the MultiLine and the approximation curves. F is the sum of the square distances. Grad is the derivative vector of the function F.
Parameters (4)GradFMaxE3dMaxE2d
ReturnsA result object with fields:
F: updated value from the call.MaxE3d: updated value from the call.MaxE2d: updated value from the call.
returns the distances between the points of the multiline and the approximation curves.
- Error(F: number, MaxE3d: number, MaxE2d: number): { F: number; MaxE3d: number; MaxE2d: number }
returns the maximum errors between the MultiLine and the approximation curves. F is the sum of the square distances.
Parameters (3)FMaxE3dMaxE2d
ReturnsA result object with fields:
F: updated value from the call.MaxE3d: updated value from the call.MaxE2d: updated value from the call.
- FirstLambda(): number
returns the value (P2 - P1)/ V1 if the first point was a tangency point.
- LastLambda(): number
returns the value (PN - PN-1)/ VN if the last point was a tangency point.
returns the matrix of points value.
- Poles(): math_Matrix
returns the matrix of resulting control points value.
- KIndex(): math_IntegerVector
Returns the indexes of the first non null values of A and DA. The values are non null from Index(ieme point) +1 to Index(ieme point) + degree +1.
BRepApprox_SurfaceTool
Constructors(1)
Static methods(39)
- FirstUParameter(S: BRepAdaptor_Surface): numberParameters (1)
S
- FirstVParameter(S: BRepAdaptor_Surface): numberParameters (1)
S
- LastUParameter(S: BRepAdaptor_Surface): numberParameters (1)
S
- LastVParameter(S: BRepAdaptor_Surface): numberParameters (1)
S
- NbUIntervals(S: BRepAdaptor_Surface, Sh: GeomAbs_Shape): numberParameters (2)
SSh
- NbVIntervals(S: BRepAdaptor_Surface, Sh: GeomAbs_Shape): numberParameters (2)
SSh
- UIntervals(S: BRepAdaptor_Surface, T: NCollection_Array1_double, Sh: GeomAbs_Shape): voidParameters (3)
STSh
- VIntervals(S: BRepAdaptor_Surface, T: NCollection_Array1_double, Sh: GeomAbs_Shape): voidParameters (3)
STSh
- UTrim(S: BRepAdaptor_Surface, First: number, Last: number, Tol: number): Adaptor3d_Surface
If <First> >= <Last>.
Parameters (4)SFirstLastTol
- VTrim(S: BRepAdaptor_Surface, First: number, Last: number, Tol: number): Adaptor3d_Surface
If <First> >= <Last>.
Parameters (4)SFirstLastTol
- IsUClosed(S: BRepAdaptor_Surface): booleanParameters (1)
S
- IsVClosed(S: BRepAdaptor_Surface): booleanParameters (1)
S
- IsUPeriodic(S: BRepAdaptor_Surface): booleanParameters (1)
S
- UPeriod(S: BRepAdaptor_Surface): numberParameters (1)
S
- IsVPeriodic(S: BRepAdaptor_Surface): booleanParameters (1)
S
- VPeriod(S: BRepAdaptor_Surface): numberParameters (1)
S
- Value(S: BRepAdaptor_Surface, u: number, v: number): gp_PntParameters (3)
Suv
- D0(S: BRepAdaptor_Surface, u: number, v: number, P: gp_Pnt): voidParameters (4)
SuvP
- D1(S: BRepAdaptor_Surface, u: number, v: number, P: gp_Pnt, D1u: gp_Vec, D1v: gp_Vec): voidParameters (6)
SuvPD1uD1v
- D2(S: BRepAdaptor_Surface, u: number, v: number, P: gp_Pnt, D1U: gp_Vec, D1V: gp_Vec, D2U: gp_Vec, D2V: gp_Vec, D2UV: gp_Vec): voidParameters (9)
SuvPD1UD1VD2UD2VD2UV
- D3(S: BRepAdaptor_Surface, u: number, v: number, P: gp_Pnt, D1U: gp_Vec, D1V: gp_Vec, D2U: gp_Vec, D2V: gp_Vec, D2UV: gp_Vec, D3U: gp_Vec, D3V: gp_Vec, D3UUV: gp_Vec, D3UVV: gp_Vec): voidParameters (13)
SuvPD1UD1VD2UD2VD2UVD3UD3VD3UUVD3UVV
- DN(S: BRepAdaptor_Surface, u: number, v: number, Nu: number, Nv: number): gp_VecParameters (5)
SuvNuNv
- UResolution(S: BRepAdaptor_Surface, R3d: number): numberParameters (2)
SR3d
- VResolution(S: BRepAdaptor_Surface, R3d: number): numberParameters (2)
SR3d
- Parameters (1)
S
- Parameters (1)
S
- Parameters (1)
S
- Parameters (1)
S
- Parameters (1)
S
- Parameters (1)
S
- Parameters (1)
S
- Parameters (1)
S
- Parameters (1)
S
- Parameters (1)
S
- Parameters (1)
S
- NbSamplesU(S: BRepAdaptor_Surface): numberParameters (1)
S
- NbSamplesU(S: BRepAdaptor_Surface, u1: number, u2: number): numberParameters (3)
Su1u2
- NbSamplesV(S: BRepAdaptor_Surface): numberParameters (1)
S
- NbSamplesV(S: BRepAdaptor_Surface, v1: number, v2: number): numberParameters (3)
Sv1v2
BRepApprox_TheImpPrmSvSurfacesOfApprox
Constructors(2)
- constructor(Surf1: BRepAdaptor_Surface, Surf2: IntSurf_Quadric): BRepApprox_TheImpPrmSvSurfacesOfApproxParameters (2)
Surf1Surf2
- constructor(Surf1: IntSurf_Quadric, Surf2: BRepAdaptor_Surface): BRepApprox_TheImpPrmSvSurfacesOfApproxParameters (2)
Surf1Surf2
Instance methods(7)
- Compute(u1: number, v1: number, u2: number, v2: number, Pt: gp_Pnt, Tg: gp_Vec, Tguv1: gp_Vec2d, Tguv2: gp_Vec2d): { returnValue: boolean; u1: number; v1: number; u2: number; v2: number }
returns True if Tg,Tguv1 Tguv2 can be computed.
Parameters (8)u1v1u2v2Pt—Mutated in place; read the updated value from this argument after the call.Tg—Mutated in place; read the updated value from this argument after the call.Tguv1—Mutated in place; read the updated value from this argument after the call.Tguv2—Mutated in place; read the updated value from this argument after the call.
ReturnsA result object with fields:
returnValue: the C++ return valueu1: updated value from the call.v1: updated value from the call.u2: updated value from the call.v2: updated value from the call.
- Parameters (5)
u1v1u2v2P
- SeekPoint(u1: number, v1: number, u2: number, v2: number, Point: IntSurf_PntOn2S): boolean
computes point on curve and parameters on the surfaces
Parameters (5)u1v1u2v2Point—Mutated in place; read the updated value from this argument after the call.
- Parameters (5)
u1v1u2v2Tg
- TangencyOnSurf1(u1: number, v1: number, u2: number, v2: number, Tg: gp_Vec2d): booleanParameters (5)
u1v1u2v2Tg
- TangencyOnSurf2(u1: number, v1: number, u2: number, v2: number, Tg: gp_Vec2d): booleanParameters (5)
u1v1u2v2Tg
- FillInitialVectorOfSolution(u1: number, v1: number, u2: number, v2: number, binfu: number, bsupu: number, binfv: number, bsupv: number, X: math_Vector, TranslationU: number, TranslationV: number): { returnValue: boolean; TranslationU: number; TranslationV: number }Parameters (11)
u1v1u2v2binfubsupubinfvbsupvXTranslationUTranslationV
BRepApprox_TheInt2SOfThePrmPrmSvSurfacesOfApprox
Constructors(2)
- constructor(S1: BRepAdaptor_Surface, S2: BRepAdaptor_Surface, TolTangency: number): BRepApprox_TheInt2SOfThePrmPrmSvSurfacesOfApprox
initialize the parameters to compute the solution point it 's possible to write to optimize: IntImp_Int2S inter(S1,S2,Func,TolTangency);
math_FunctionSetRootrsnld(inter.Function()); while ...{ Param(1)=... Param(2)=... param(3)=... inter.Perform(Param,rsnld); }Parameters (3)S1S2TolTangency
- constructor(Param: NCollection_Array1_double, S1: BRepAdaptor_Surface, S2: BRepAdaptor_Surface, TolTangency: number): BRepApprox_TheInt2SOfThePrmPrmSvSurfacesOfApprox
compute the solution point with the close point
Parameters (4)ParamS1S2TolTangency
Instance methods(8)
- IsDone(): boolean
Returns TRUE if the creation completed without failure.
- IsEmpty(): boolean
Returns TRUE when there is no solution to the problem.
Returns the intersection point.
- IsTangent(): boolean
Returns True if the surfaces are tangent at the intersection point.
Returns the tangent at the intersection line.
Returns the tangent at the intersection line in the parametric space of the first surface.
Returns the tangent at the intersection line in the parametric space of the second surface.
return the intersection point which is enable for changing.
BRepApprox_TheMultiLineOfApprox
Constructors(2)
- constructor(line: BRepApprox_ApproxLine, NbP3d: number, NbP2d: number, ApproxU1V1: boolean, ApproxU2V2: boolean, xo: number, yo: number, zo: number, u1o: number, v1o: number, u2o: number, v2o: number, P2DOnFirst: boolean, IndMin?: number, IndMax?: number): BRepApprox_TheMultiLineOfApprox
No Extra points will be added on the current line.
Parameters (15)lineNbP3dNbP2dApproxU1V1ApproxU2V2xoyozou1ov1ou2ov2oP2DOnFirstIndMinIndMax
Instance methods(14)
- FirstPoint(): number
- LastPoint(): number
- NbP2d(): number
Returns the number of 2d points of a TheLine.
- NbP3d(): number
Returns the number of 3d points of a TheLine.
- Value(MPointIndex: number, tabPt: NCollection_Array1_gp_Pnt): void
Returns the 3d points of the multipoint <MPointIndex> when only 3d points exist.
Parameters (2)MPointIndextabPt—Mutated in place; read the updated value from this argument after the call.
- Value(MPointIndex: number, tabPt2d: NCollection_Array1_gp_Pnt2d): void
Returns the 2d points of the multipoint <MPointIndex> when only 2d points exist.
Parameters (2)MPointIndextabPt2d—Mutated in place; read the updated value from this argument after the call.
- Value(MPointIndex: number, tabPt: NCollection_Array1_gp_Pnt, tabPt2d: NCollection_Array1_gp_Pnt2d): void
Returns the 3d and 2d points of the multipoint <MPointIndex>.
Parameters (3)MPointIndextabPt—Mutated in place; read the updated value from this argument after the call.tabPt2d—Mutated in place; read the updated value from this argument after the call.
- Tangency(MPointIndex: number, tabV: NCollection_Array1_gp_Vec): boolean
Returns the 3d tangency points of the multipoint <MPointIndex> only when 3d points exist.
Parameters (2)MPointIndextabV—Mutated in place; read the updated value from this argument after the call.
- Tangency(MPointIndex: number, tabV2d: NCollection_Array1_gp_Vec2d): boolean
Returns the 2d tangency points of the multipoint <MPointIndex> only when 2d points exist.
Parameters (2)MPointIndextabV2d—Mutated in place; read the updated value from this argument after the call.
- Tangency(MPointIndex: number, tabV: NCollection_Array1_gp_Vec, tabV2d: NCollection_Array1_gp_Vec2d): boolean
Returns the 3d and 2d points of the multipoint <MPointIndex>.
Parameters (3)MPointIndextabV—Mutated in place; read the updated value from this argument after the call.tabV2d—Mutated in place; read the updated value from this argument after the call.
- MakeMLBetween(Low: number, High: number, NbPointsToInsert: number): BRepApprox_TheMultiLineOfApprox
Tries to make a sub-line between <Low> and <High> points of this line by adding <NbPointsToInsert> new points.
Parameters (3)LowHighNbPointsToInsert
- MakeMLOneMorePoint(Low: number, High: number, indbad: number, OtherLine: BRepApprox_TheMultiLineOfApprox): boolean
Tries to make a sub-line between <Low> and <High> points of this line by adding one more point between (indbad-1)-th and indbad-th points.
Parameters (4)LowHighindbadOtherLine—Mutated in place; read the updated value from this argument after the call.
- Dump(): void
Dump of the current multi-line.
BRepApprox_TheMultiLineToolOfApprox
Constructors(1)
Static methods(17)
- FirstPoint(ML: BRepApprox_TheMultiLineOfApprox): number
Returns the number of multipoints of the TheMultiLine.
Parameters (1)ML
- LastPoint(ML: BRepApprox_TheMultiLineOfApprox): number
Returns the number of multipoints of the TheMultiLine.
Parameters (1)ML
- NbP2d(ML: BRepApprox_TheMultiLineOfApprox): number
Returns the number of 2d points of a TheMultiLine.
Parameters (1)ML
- NbP3d(ML: BRepApprox_TheMultiLineOfApprox): number
Returns the number of 3d points of a TheMultiLine.
Parameters (1)ML
- Value(ML: BRepApprox_TheMultiLineOfApprox, MPointIndex: number, tabPt: NCollection_Array1_gp_Pnt): void
returns the 3d points of the multipoint <MPointIndex> when only 3d points exist.
Parameters (3)MLMPointIndextabPt—Mutated in place; read the updated value from this argument after the call.
- Value(ML: BRepApprox_TheMultiLineOfApprox, MPointIndex: number, tabPt2d: NCollection_Array1_gp_Pnt2d): void
returns the 2d points of the multipoint <MPointIndex> when only 2d points exist.
Parameters (3)MLMPointIndextabPt2d—Mutated in place; read the updated value from this argument after the call.
- Value(ML: BRepApprox_TheMultiLineOfApprox, MPointIndex: number, tabPt: NCollection_Array1_gp_Pnt, tabPt2d: NCollection_Array1_gp_Pnt2d): void
returns the 3d and 2d points of the multipoint <MPointIndex>.
Parameters (4)MLMPointIndextabPt—Mutated in place; read the updated value from this argument after the call.tabPt2d—Mutated in place; read the updated value from this argument after the call.
- Tangency(ML: BRepApprox_TheMultiLineOfApprox, MPointIndex: number, tabV: NCollection_Array1_gp_Vec): boolean
returns the 3d points of the multipoint <MPointIndex> when only 3d points exist.
Parameters (3)MLMPointIndextabV—Mutated in place; read the updated value from this argument after the call.
- Tangency(ML: BRepApprox_TheMultiLineOfApprox, MPointIndex: number, tabV2d: NCollection_Array1_gp_Vec2d): boolean
returns the 2d tangency points of the multipoint <MPointIndex> only when 2d points exist.
Parameters (3)MLMPointIndextabV2d—Mutated in place; read the updated value from this argument after the call.
- Tangency(ML: BRepApprox_TheMultiLineOfApprox, MPointIndex: number, tabV: NCollection_Array1_gp_Vec, tabV2d: NCollection_Array1_gp_Vec2d): boolean
returns the 3d and 2d points of the multipoint <MPointIndex>.
Parameters (4)MLMPointIndextabV—Mutated in place; read the updated value from this argument after the call.tabV2d—Mutated in place; read the updated value from this argument after the call.
- Curvature(ML: BRepApprox_TheMultiLineOfApprox, MPointIndex: number, tabV: NCollection_Array1_gp_Vec): boolean
returns the 3d curvature of the multipoint <MPointIndex> when only 3d points exist.
Parameters (3)MLMPointIndextabV—Mutated in place; read the updated value from this argument after the call.
- Curvature(ML: BRepApprox_TheMultiLineOfApprox, MPointIndex: number, tabV2d: NCollection_Array1_gp_Vec2d): boolean
returns the 2d curvature points of the multipoint <MPointIndex> only when 2d points exist.
Parameters (3)MLMPointIndextabV2d—Mutated in place; read the updated value from this argument after the call.
- Curvature(ML: BRepApprox_TheMultiLineOfApprox, MPointIndex: number, tabV: NCollection_Array1_gp_Vec, tabV2d: NCollection_Array1_gp_Vec2d): boolean
returns the 3d and 2d curvature of the multipoint <MPointIndex>.
Parameters (4)MLMPointIndextabV—Mutated in place; read the updated value from this argument after the call.tabV2d—Mutated in place; read the updated value from this argument after the call.
- MakeMLBetween(ML: BRepApprox_TheMultiLineOfApprox, I1: number, I2: number, NbPMin: number): BRepApprox_TheMultiLineOfApprox
Is called if WhatStatus returned "PointsAdded".
Parameters (4)MLI1I2NbPMin
- MakeMLOneMorePoint(ML: BRepApprox_TheMultiLineOfApprox, I1: number, I2: number, indbad: number, OtherLine: BRepApprox_TheMultiLineOfApprox): boolean
Is called when the Bezier curve contains a loop.
Parameters (5)MLI1I2indbadOtherLine—Mutated in place; read the updated value from this argument after the call.
- WhatStatus(ML: BRepApprox_TheMultiLineOfApprox, I1: number, I2: number): Approx_StatusParameters (3)
MLI1I2
- Dump(ML: BRepApprox_TheMultiLineOfApprox): void
Dump of the current multi-line.
Parameters (1)ML
BRepApprox_ThePrmPrmSvSurfacesOfApprox
Constructors(1)
- constructor(Surf1: BRepAdaptor_Surface, Surf2: BRepAdaptor_Surface): BRepApprox_ThePrmPrmSvSurfacesOfApproxParameters (2)
Surf1Surf2
Instance methods(6)
- Compute(u1: number, v1: number, u2: number, v2: number, Pt: gp_Pnt, Tg: gp_Vec, Tguv1: gp_Vec2d, Tguv2: gp_Vec2d): { returnValue: boolean; u1: number; v1: number; u2: number; v2: number }
returns True if Tg,Tguv1 Tguv2 can be computed.
Parameters (8)u1v1u2v2Pt—Mutated in place; read the updated value from this argument after the call.Tg—Mutated in place; read the updated value from this argument after the call.Tguv1—Mutated in place; read the updated value from this argument after the call.Tguv2—Mutated in place; read the updated value from this argument after the call.
ReturnsA result object with fields:
returnValue: the C++ return valueu1: updated value from the call.v1: updated value from the call.u2: updated value from the call.v2: updated value from the call.
- Parameters (5)
u1v1u2v2P
- SeekPoint(u1: number, v1: number, u2: number, v2: number, Point: IntSurf_PntOn2S): boolean
computes point on curve and parameters on the surfaces
Parameters (5)u1v1u2v2Point—Mutated in place; read the updated value from this argument after the call.
- Parameters (5)
u1v1u2v2Tg
- TangencyOnSurf1(u1: number, v1: number, u2: number, v2: number, Tg: gp_Vec2d): booleanParameters (5)
u1v1u2v2Tg
- TangencyOnSurf2(u1: number, v1: number, u2: number, v2: number, Tg: gp_Vec2d): booleanParameters (5)
u1v1u2v2Tg
BRepApprox_TheZerImpFuncOfTheImpPrmSvSurfacesOfApprox
Constructors(3)
- Parameters (1)
IS
- constructor(PS: BRepAdaptor_Surface, IS: IntSurf_Quadric): BRepApprox_TheZerImpFuncOfTheImpPrmSvSurfacesOfApproxParameters (2)
PSIS
Instance methods(16)
- Set(PS: BRepAdaptor_Surface): voidParameters (1)
PS
- Set(Tolerance: number): voidParameters (1)
Tolerance
- SetImplicitSurface(IS: IntSurf_Quadric): voidParameters (1)
IS
- NbVariables(): number
Returns the number of variables of the function.
- NbEquations(): number
Returns the number of equations of the function.
- Value(X: math_Vector, F: math_Vector): boolean
Computes the values <F> of the Functions for the variable <X>. Returns True if the computation was done successfully, False otherwise.
Parameters (2)XF
- Derivatives(X: math_Vector, D: math_Matrix): boolean
Returns the values <D> of the derivatives for the variable <X>. Returns True if the computation was done successfully, False otherwise.
Parameters (2)XD
- Values(X: math_Vector, F: math_Vector, D: math_Matrix): boolean
returns the values <F> of the functions and the derivatives <D> for the variable <X>. Returns True if the computation was done successfully, False otherwise.
Parameters (3)XFD
- Root(): number
- Tolerance(): number
Returns the value Tol so that if std::abs(Func.Root())<Tol the function is considered null.
- IsTangent(): boolean