Open CASCADE Technology Reference Manual 8.0.0
Loading...
Searching...
No Matches
Public Member Functions
Geom2dGcc_Circ2d2TanOn Class Reference

This class implements the algorithms used to create 2d circles TANgent to 2 entities and having the center ON a curve. The order of the tangency argument is always QualifiedCirc, QualifiedLin, QualifiedCurv, Pnt2d. the arguments are : More...

#include <Geom2dGcc_Circ2d2TanOn.hxx>

Public Member Functions

 Geom2dGcc_Circ2d2TanOn (const Geom2dGcc_QualifiedCurve &Qualified1, const Geom2dGcc_QualifiedCurve &Qualified2, const Geom2dAdaptor_Curve &OnCurve, const double Tolerance, const double Param1, const double Param2, const double ParamOn)
 This method implements the algorithms used to create 2d circles TANgent to two curves and having the center ON a 2d curve. Param1 is the initial guess on the first curve QualifiedCurv. Param1 is the initial guess on the second curve QualifiedCurv. ParamOn is the initial guess on the center curve OnCurv. Tolerance is used for the limit cases.
 
 Geom2dGcc_Circ2d2TanOn (const Geom2dGcc_QualifiedCurve &Qualified1, const occ::handle< Geom2d_Point > &Point, const Geom2dAdaptor_Curve &OnCurve, const double Tolerance, const double Param1, const double ParamOn)
 This method implements the algorithms used to create 2d circles TANgent to one curve and one point and having the center ON a 2d curve. Param1 is the initial guess on the first curve QualifiedCurv. ParamOn is the initial guess on the center curve OnCurv. Tolerance is used for the limit cases.
 
 Geom2dGcc_Circ2d2TanOn (const occ::handle< Geom2d_Point > &Point1, const occ::handle< Geom2d_Point > &Point2, const Geom2dAdaptor_Curve &OnCurve, const double Tolerance)
 This method implements the algorithms used to create 2d circles TANgent to two points and having the center ON a 2d curve. Tolerance is used for the limit cases.
 
void Results (const GccAna_Circ2d2TanOn &Circ)
 
void Results (const Geom2dGcc_Circ2d2TanOnGeo &Circ)
 
bool IsDone () const
 Returns true if the construction algorithm does not fail (even if it finds no solution). Note: IsDone protects against a failure arising from a more internal intersection algorithm, which has reached its numeric limits.
 
int NbSolutions () const
 This method returns the number of solutions. NotDone is raised if the algorithm failed.
 
gp_Circ2d ThisSolution (const int Index) const
 Returns the solution number Index and raises OutOfRange exception if Index is greater than the number of solutions. Be careful: the Index is only a way to get all the solutions, but is not associated to these outside the context of the algorithm-object. Exceptions Standard_OutOfRange if Index is less than or equal to zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.
 
void WhichQualifier (const int Index, GccEnt_Position &Qualif1, GccEnt_Position &Qualif2) const
 It returns the information about the qualifiers of the tangency arguments concerning the solution number Index. It returns the real qualifiers (the qualifiers given to the constructor method in case of enclosed, enclosing and outside and the qualifiers computedin case of unqualified). Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.
 
void Tangency1 (const int Index, double &ParSol, double &ParArg, gp_Pnt2d &PntSol) const
 Returns information about the tangency point between the result and the first argument. ParSol is the intrinsic parameter of the point PntSol on the solution curv. ParArg is the intrinsic parameter of the point PntSol on the argument curv.
 
void Tangency2 (const int Index, double &ParSol, double &ParArg, gp_Pnt2d &PntSol) const
 Returns information about the tangency point between the result and the second argument. ParSol is the intrinsic parameter of the point PntSol on the solution curv. ParArg is the intrinsic parameter of the point PntSol on the argument curv.
 
void CenterOn3 (const int Index, double &ParArg, gp_Pnt2d &PntSol) const
 Returns the center PntSol of the solution of index Index computed by this algorithm. ParArg is the parameter of the point PntSol on the third argument. Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.
 
bool IsTheSame1 (const int Index) const
 Returns true if the solution of index Index and, respectively, the first or second argument of this algorithm are the same (i.e. there are 2 identical circles). If Rarg is the radius of the first or second argument, Rsol is the radius of the solution and dist is the distance between the two centers, we consider the two circles to be identical if |Rarg - Rsol| and dist are less than or equal to the tolerance criterion given at the time of construction of this algorithm. Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.
 
bool IsTheSame2 (const int Index) const
 Returns true if the solution of index Index and, respectively, the first or second argument of this algorithm are the same (i.e. there are 2 identical circles). If Rarg is the radius of the first or second argument, Rsol is the radius of the solution and dist is the distance between the two centers, we consider the two circles to be identical if |Rarg - Rsol| and dist are less than or equal to the tolerance criterion given at the time of construction of this algorithm. Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.
 

Detailed Description

This class implements the algorithms used to create 2d circles TANgent to 2 entities and having the center ON a curve. The order of the tangency argument is always QualifiedCirc, QualifiedLin, QualifiedCurv, Pnt2d. the arguments are :

Constructor & Destructor Documentation

◆ Geom2dGcc_Circ2d2TanOn() [1/3]

Geom2dGcc_Circ2d2TanOn::Geom2dGcc_Circ2d2TanOn ( const Geom2dGcc_QualifiedCurve & Qualified1,
const Geom2dGcc_QualifiedCurve & Qualified2,
const Geom2dAdaptor_Curve & OnCurve,
const double Tolerance,
const double Param1,
const double Param2,
const double ParamOn )

This method implements the algorithms used to create 2d circles TANgent to two curves and having the center ON a 2d curve. Param1 is the initial guess on the first curve QualifiedCurv. Param1 is the initial guess on the second curve QualifiedCurv. ParamOn is the initial guess on the center curve OnCurv. Tolerance is used for the limit cases.

◆ Geom2dGcc_Circ2d2TanOn() [2/3]

Geom2dGcc_Circ2d2TanOn::Geom2dGcc_Circ2d2TanOn ( const Geom2dGcc_QualifiedCurve & Qualified1,
const occ::handle< Geom2d_Point > & Point,
const Geom2dAdaptor_Curve & OnCurve,
const double Tolerance,
const double Param1,
const double ParamOn )

This method implements the algorithms used to create 2d circles TANgent to one curve and one point and having the center ON a 2d curve. Param1 is the initial guess on the first curve QualifiedCurv. ParamOn is the initial guess on the center curve OnCurv. Tolerance is used for the limit cases.

◆ Geom2dGcc_Circ2d2TanOn() [3/3]

Geom2dGcc_Circ2d2TanOn::Geom2dGcc_Circ2d2TanOn ( const occ::handle< Geom2d_Point > & Point1,
const occ::handle< Geom2d_Point > & Point2,
const Geom2dAdaptor_Curve & OnCurve,
const double Tolerance )

This method implements the algorithms used to create 2d circles TANgent to two points and having the center ON a 2d curve. Tolerance is used for the limit cases.

Member Function Documentation

◆ CenterOn3()

void Geom2dGcc_Circ2d2TanOn::CenterOn3 ( const int Index,
double & ParArg,
gp_Pnt2d & PntSol ) const

Returns the center PntSol of the solution of index Index computed by this algorithm. ParArg is the parameter of the point PntSol on the third argument. Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.

◆ IsDone()

bool Geom2dGcc_Circ2d2TanOn::IsDone ( ) const

Returns true if the construction algorithm does not fail (even if it finds no solution). Note: IsDone protects against a failure arising from a more internal intersection algorithm, which has reached its numeric limits.

◆ IsTheSame1()

bool Geom2dGcc_Circ2d2TanOn::IsTheSame1 ( const int Index) const

Returns true if the solution of index Index and, respectively, the first or second argument of this algorithm are the same (i.e. there are 2 identical circles). If Rarg is the radius of the first or second argument, Rsol is the radius of the solution and dist is the distance between the two centers, we consider the two circles to be identical if |Rarg - Rsol| and dist are less than or equal to the tolerance criterion given at the time of construction of this algorithm. Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.

◆ IsTheSame2()

bool Geom2dGcc_Circ2d2TanOn::IsTheSame2 ( const int Index) const

Returns true if the solution of index Index and, respectively, the first or second argument of this algorithm are the same (i.e. there are 2 identical circles). If Rarg is the radius of the first or second argument, Rsol is the radius of the solution and dist is the distance between the two centers, we consider the two circles to be identical if |Rarg - Rsol| and dist are less than or equal to the tolerance criterion given at the time of construction of this algorithm. Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.

◆ NbSolutions()

int Geom2dGcc_Circ2d2TanOn::NbSolutions ( ) const

This method returns the number of solutions. NotDone is raised if the algorithm failed.

◆ Results() [1/2]

void Geom2dGcc_Circ2d2TanOn::Results ( const GccAna_Circ2d2TanOn & Circ)

◆ Results() [2/2]

void Geom2dGcc_Circ2d2TanOn::Results ( const Geom2dGcc_Circ2d2TanOnGeo & Circ)

◆ Tangency1()

void Geom2dGcc_Circ2d2TanOn::Tangency1 ( const int Index,
double & ParSol,
double & ParArg,
gp_Pnt2d & PntSol ) const

Returns information about the tangency point between the result and the first argument. ParSol is the intrinsic parameter of the point PntSol on the solution curv. ParArg is the intrinsic parameter of the point PntSol on the argument curv.

◆ Tangency2()

void Geom2dGcc_Circ2d2TanOn::Tangency2 ( const int Index,
double & ParSol,
double & ParArg,
gp_Pnt2d & PntSol ) const

Returns information about the tangency point between the result and the second argument. ParSol is the intrinsic parameter of the point PntSol on the solution curv. ParArg is the intrinsic parameter of the point PntSol on the argument curv.

◆ ThisSolution()

gp_Circ2d Geom2dGcc_Circ2d2TanOn::ThisSolution ( const int Index) const

Returns the solution number Index and raises OutOfRange exception if Index is greater than the number of solutions. Be careful: the Index is only a way to get all the solutions, but is not associated to these outside the context of the algorithm-object. Exceptions Standard_OutOfRange if Index is less than or equal to zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.

◆ WhichQualifier()

void Geom2dGcc_Circ2d2TanOn::WhichQualifier ( const int Index,
GccEnt_Position & Qualif1,
GccEnt_Position & Qualif2 ) const

It returns the information about the qualifiers of the tangency arguments concerning the solution number Index. It returns the real qualifiers (the qualifiers given to the constructor method in case of enclosed, enclosing and outside and the qualifiers computedin case of unqualified). Exceptions Standard_OutOfRange if Index is less than zero or greater than the number of solutions computed by this algorithm. StdFail_NotDone if the construction fails.


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