Open CASCADE Technology  7.6.0
Public Member Functions

Extrema_EPCOfExtPC2d Class Reference

#include <Extrema_EPCOfExtPC2d.hxx>

Public Member Functions

 Extrema_EPCOfExtPC2d ()
 
 Extrema_EPCOfExtPC2d (const gp_Pnt2d &P, const Adaptor2d_Curve2d &C, const Standard_Integer NbU, const Standard_Real TolU, const Standard_Real TolF)
 It calculates all the distances. The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0. The algorithm searches all the zeros inside the definition range of the curve. NbU is used to locate the close points to find the zeros. Tol and TolU are used to decide to stop the iterations according to the following condition: if n is the number of iterations, abs(Un-Un-1) < TolU and abs(F(Un)-F(Un-1)) < Tol. More...
 
 Extrema_EPCOfExtPC2d (const gp_Pnt2d &P, const Adaptor2d_Curve2d &C, const Standard_Integer NbU, const Standard_Real Umin, const Standard_Real Usup, const Standard_Real TolU, const Standard_Real TolF)
 It calculates all the distances. The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0. The algorithm searches all the zeros inside the definition range of the curve. NbU is used to locate the close points to find the zeros. Zeros are searched between umin and usup. Tol and TolU are used to decide to stop the iterations according to the following condition: if n is the number of iterations, abs(Un-Un-1) < TolU and abs(F(Un)-F(Un-1)) < Tol. More...
 
void Initialize (const Adaptor2d_Curve2d &C, const Standard_Integer NbU, const Standard_Real TolU, const Standard_Real TolF)
 sets the fields of the algorithm. More...
 
void Initialize (const Adaptor2d_Curve2d &C, const Standard_Integer NbU, const Standard_Real Umin, const Standard_Real Usup, const Standard_Real TolU, const Standard_Real TolF)
 sets the fields of the algorithm. More...
 
void Initialize (const Adaptor2d_Curve2d &C)
 sets the fields of the algorithm. More...
 
void Initialize (const Standard_Integer NbU, const Standard_Real Umin, const Standard_Real Usup, const Standard_Real TolU, const Standard_Real TolF)
 sets the fields of the algorithm. More...
 
void Perform (const gp_Pnt2d &P)
 the algorithm is done with the point P. An exception is raised if the fields have not been initialized. More...
 
Standard_Boolean IsDone () const
 True if the distances are found. More...
 
Standard_Integer NbExt () const
 Returns the number of extremum distances. More...
 
Standard_Real SquareDistance (const Standard_Integer N) const
 Returns the value of the Nth extremum square distance. More...
 
Standard_Boolean IsMin (const Standard_Integer N) const
 Returns True if the Nth extremum distance is a minimum. More...
 
const Extrema_POnCurv2dPoint (const Standard_Integer N) const
 Returns the point of the Nth extremum distance. More...
 

Constructor & Destructor Documentation

◆ Extrema_EPCOfExtPC2d() [1/3]

Extrema_EPCOfExtPC2d::Extrema_EPCOfExtPC2d ( )

◆ Extrema_EPCOfExtPC2d() [2/3]

Extrema_EPCOfExtPC2d::Extrema_EPCOfExtPC2d ( const gp_Pnt2d P,
const Adaptor2d_Curve2d C,
const Standard_Integer  NbU,
const Standard_Real  TolU,
const Standard_Real  TolF 
)

It calculates all the distances. The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0. The algorithm searches all the zeros inside the definition range of the curve. NbU is used to locate the close points to find the zeros. Tol and TolU are used to decide to stop the iterations according to the following condition: if n is the number of iterations, abs(Un-Un-1) < TolU and abs(F(Un)-F(Un-1)) < Tol.

◆ Extrema_EPCOfExtPC2d() [3/3]

Extrema_EPCOfExtPC2d::Extrema_EPCOfExtPC2d ( const gp_Pnt2d P,
const Adaptor2d_Curve2d C,
const Standard_Integer  NbU,
const Standard_Real  Umin,
const Standard_Real  Usup,
const Standard_Real  TolU,
const Standard_Real  TolF 
)

It calculates all the distances. The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0. The algorithm searches all the zeros inside the definition range of the curve. NbU is used to locate the close points to find the zeros. Zeros are searched between umin and usup. Tol and TolU are used to decide to stop the iterations according to the following condition: if n is the number of iterations, abs(Un-Un-1) < TolU and abs(F(Un)-F(Un-1)) < Tol.

Member Function Documentation

◆ Initialize() [1/4]

void Extrema_EPCOfExtPC2d::Initialize ( const Adaptor2d_Curve2d C)

sets the fields of the algorithm.

◆ Initialize() [2/4]

void Extrema_EPCOfExtPC2d::Initialize ( const Adaptor2d_Curve2d C,
const Standard_Integer  NbU,
const Standard_Real  TolU,
const Standard_Real  TolF 
)

sets the fields of the algorithm.

◆ Initialize() [3/4]

void Extrema_EPCOfExtPC2d::Initialize ( const Adaptor2d_Curve2d C,
const Standard_Integer  NbU,
const Standard_Real  Umin,
const Standard_Real  Usup,
const Standard_Real  TolU,
const Standard_Real  TolF 
)

sets the fields of the algorithm.

◆ Initialize() [4/4]

void Extrema_EPCOfExtPC2d::Initialize ( const Standard_Integer  NbU,
const Standard_Real  Umin,
const Standard_Real  Usup,
const Standard_Real  TolU,
const Standard_Real  TolF 
)

sets the fields of the algorithm.

◆ IsDone()

Standard_Boolean Extrema_EPCOfExtPC2d::IsDone ( ) const

True if the distances are found.

◆ IsMin()

Standard_Boolean Extrema_EPCOfExtPC2d::IsMin ( const Standard_Integer  N) const

Returns True if the Nth extremum distance is a minimum.

◆ NbExt()

Standard_Integer Extrema_EPCOfExtPC2d::NbExt ( ) const

Returns the number of extremum distances.

◆ Perform()

void Extrema_EPCOfExtPC2d::Perform ( const gp_Pnt2d P)

the algorithm is done with the point P. An exception is raised if the fields have not been initialized.

◆ Point()

const Extrema_POnCurv2d& Extrema_EPCOfExtPC2d::Point ( const Standard_Integer  N) const

Returns the point of the Nth extremum distance.

◆ SquareDistance()

Standard_Real Extrema_EPCOfExtPC2d::SquareDistance ( const Standard_Integer  N) const

Returns the value of the Nth extremum square distance.


The documentation for this class was generated from the following file: