#include <GccAna_Circ2dTanCen.hxx>
Public Member Functions | |
void * | operator new (size_t, void *anAddress) |
void * | operator new (size_t size) |
void | operator delete (void *anAddress) |
Standard_EXPORT | GccAna_Circ2dTanCen (const GccEnt_QualifiedCirc &Qualified1, const gp_Pnt2d &Pcenter, const Standard_Real Tolerance) |
This method implements the algorithms used to create 2d circles tangent to a circle and centered on a point. . | |
Standard_EXPORT | GccAna_Circ2dTanCen (const gp_Lin2d &Linetan, const gp_Pnt2d &Pcenter) |
This method implements the algorithms used to create 2d circles tangent to a line and centered on a point. . | |
Standard_EXPORT | GccAna_Circ2dTanCen (const gp_Pnt2d &Point1, const gp_Pnt2d &Pcenter) |
This method implements the algorithms used to create 2d circles passing thrue a point and centered on a point. Tolerance is a tolerance criterion used by the algorithm to find a solution when, mathematically, the problem posed does not have a solution, but where there is numeric uncertainty attached to the arguments. In these algorithms Tolerance is only used in very specific cases where the center of the solution is very close to the circle to which it is tangential, and where the solution is therefore a very small circle. Exceptions GccEnt_BadQualifier if a qualifier is inconsistent with the argument it qualifies (for example, enclosing for a line). . | |
Standard_EXPORT Standard_Boolean | IsDone () const |
This method returns True if the construction algorithm succeeded. Note: IsDone protects against a failure arising from a more internal intersection algorithm, which has reached its numeric limits. . | |
Standard_EXPORT Standard_Integer | NbSolutions () const |
Returns the number of circles, representing solutions computed by this algorithm and raises NotDone exception if the algorithm didn't succeed. . | |
Standard_EXPORT gp_Circ2d | ThisSolution (const Standard_Integer Index) const |
Returns the circle, representing the solution number Index and raises OutOfRange exception if Index is greater than the number of solutions. Be carefull: the Index is only a way to get all the solutions, but is not associated to theses outside the context of the algorithm-object. Raises NotDone if the construction algorithm didn't succeed. It raises OutOfRange if Index is greater than the number of solutions or less than zer . | |
Standard_EXPORT void | WhichQualifier (const Standard_Integer Index, GccEnt_Position &Qualif1) const |
Returns the qualifier Qualif1 of the tangency argument for the solution of index Index computed by this algorithm. The returned qualifier is: - that specified at the start of construction when the solutions are defined as enclosed, enclosing or 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). . | |
Standard_EXPORT void | Tangency1 (const Standard_Integer Index, Standard_Real &ParSol, Standard_Real &ParArg, gp_Pnt2d &PntSol) const |
Returns informations about the tangency point between the result number Index 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 PntArg on the argument curv. //! It raises NotDone if the construction algorithm didn't succeed. It raises OutOfRange if Index is greater than the number of solutions or less than zero. . | |
Standard_EXPORT Standard_Boolean | IsTheSame1 (const Standard_Integer Index) const |
Returns True if the solution number Index is equal to the first argument. //! It raises NotDone if the construction algorithm didn't succeed. It raises OutOfRange if Index is greater than the number of solutions or less than zero. . | |
Private Attributes | |
Standard_Boolean | WellDone |
Standard_Integer | NbrSol |
TColgp_Array1OfCirc2d | cirsol |
GccEnt_Array1OfPosition | qualifier1 |
TColStd_Array1OfInteger | TheSame1 |
TColgp_Array1OfPnt2d | pnttg1sol |
TColStd_Array1OfReal | par1sol |
TColStd_Array1OfReal | pararg1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|