#include <GccAna_Lin2dTanPer.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_Lin2dTanPer (const gp_Pnt2d &ThePnt, const gp_Lin2d &TheLin) |
This method implements the algorithms used to create 2d lines passing through a point and perpendicular to a line. . | |
Standard_EXPORT | GccAna_Lin2dTanPer (const gp_Pnt2d &ThePnt, const gp_Circ2d &TheCircle) |
This method implements the algorithms used to create 2d lines passing through a point and perpendicular to a circle. . | |
Standard_EXPORT | GccAna_Lin2dTanPer (const GccEnt_QualifiedCirc &Qualified1, const gp_Lin2d &TheLin) |
This method implements the algorithms used to create 2d lines tangent to a circle and perpendicular to a line. . | |
Standard_EXPORT | GccAna_Lin2dTanPer (const GccEnt_QualifiedCirc &Qualified1, const gp_Circ2d &TheCircle) |
This method implements the algorithms used to create 2d lines tangent to a circle and perpendicular to a circle. . | |
Standard_EXPORT Standard_Boolean | IsDone () const |
Returns True if the algorithm succeeded. . | |
Standard_EXPORT Standard_Integer | NbSolutions () const |
Returns the number of solutions. Raises NotDone if the construction algorithm didn't succeed. . | |
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 enclosing or outside with respect to the argument, or - that computed during construction (i.e. enclosing or outside) when the solutions are defined as unqualified with respect to the argument, or - GccEnt_noqualifier if the tangency argument is a point. 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. . | |
Standard_EXPORT gp_Lin2d | ThisSolution (const Standard_Integer 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 those 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. . | |
Standard_EXPORT void | Tangency1 (const Standard_Integer Index, Standard_Real &ParSol, Standard_Real &ParArg, gp_Pnt2d &Pnt) const |
Returns informations about the tangency point between the result number Index and the first argument. ParSol is the intrinsic parameter of the point on the solution curv. ParArg is the intrinsic parameter of the point on the argument curv. If the first argument is a point ParArg is equal zero. raises NotDone if the construction algorithm didn't succeed. It raises OutOfRange if Index is greater than the number of solutions. . | |
Standard_EXPORT void | Intersection2 (const Standard_Integer Index, Standard_Real &ParSol, Standard_Real &ParArg, gp_Pnt2d &PntSol) const |
Returns informations about the intersection between the solution number Index and the second argument. It returns the first intersection in a case of Lin2dTanPer which is perpendicular to a circle . ParSol is the intrinsic parameter of the point on the solution curv. ParArg is the intrinsic parameter of the point on the argument curv. Raises NotDone if the construction algorithm didn't succeed. It raises OutOfRange if Index is greater than the number of solutions. . | |
Private Attributes | |
Standard_Boolean | WellDone |
Standard_Integer | NbrSol |
TColgp_Array1OfLin2d | linsol |
GccEnt_Array1OfPosition | qualifier1 |
TColgp_Array1OfPnt2d | pnttg1sol |
TColgp_Array1OfPnt2d | pntint2sol |
TColStd_Array1OfReal | par1sol |
TColStd_Array1OfReal | par2sol |
TColStd_Array1OfReal | pararg1 |
TColStd_Array1OfReal | pararg2 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|