#include <Extrema_LocateExtPC2d.hxx>
|
| Extrema_LocateExtPC2d () |
|
| Extrema_LocateExtPC2d (const gp_Pnt2d &P, const Adaptor2d_Curve2d &C, const Standard_Real U0, const Standard_Real TolF) |
| Calculates the distance with a close point. The close point is defined by the parameter value U0. The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0. The algorithm searchs a zero near the close point. TolF is used to decide to stop the iterations. At the nth iteration, the criteria is: abs(Un - Un-1) < TolF. More...
|
|
| Extrema_LocateExtPC2d (const gp_Pnt2d &P, const Adaptor2d_Curve2d &C, const Standard_Real U0, const Standard_Real Umin, const Standard_Real Usup, const Standard_Real TolF) |
| Calculates the distance with a close point. The close point is defined by the parameter value U0. The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0. The algorithm searchs a zero near the close point. Zeros are searched between Umin et Usup. TolF is used to decide to stop the iterations. At the nth iteration, the criteria is: abs(Un - Un-1) < TolF. More...
|
|
void | Initialize (const Adaptor2d_Curve2d &C, const Standard_Real Umin, const Standard_Real Usup, const Standard_Real TolF) |
| sets the fields of the algorithm. More...
|
|
void | Perform (const gp_Pnt2d &P, const Standard_Real U0) |
|
Standard_Boolean | IsDone () const |
| Returns True if the distance is found. More...
|
|
Standard_Real | SquareDistance () const |
| Returns the value of the extremum square distance. More...
|
|
Standard_Boolean | IsMin () const |
| Returns True if the extremum distance is a minimum. More...
|
|
const Extrema_POnCurv2d & | Point () const |
| Returns the point of the extremum distance. More...
|
|
Extrema_LocateExtPC2d::Extrema_LocateExtPC2d |
( |
| ) |
|
Calculates the distance with a close point. The close point is defined by the parameter value U0. The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0. The algorithm searchs a zero near the close point. TolF is used to decide to stop the iterations. At the nth iteration, the criteria is: abs(Un - Un-1) < TolF.
Calculates the distance with a close point. The close point is defined by the parameter value U0. The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0. The algorithm searchs a zero near the close point. Zeros are searched between Umin et Usup. TolF is used to decide to stop the iterations. At the nth iteration, the criteria is: abs(Un - Un-1) < TolF.
sets the fields of the algorithm.
Returns True if the distance is found.
Returns True if the extremum distance is a minimum.
Returns the point of the extremum distance.
Returns the value of the extremum square distance.
The documentation for this class was generated from the following file: