EIC code displayed by LXR master/​include/​opencascade/​Geom2dGcc_Circ2dTanOnRadGeo.hxx	Source navigation Diff markup Identifier search General search
	Version: master test Revert   Change

File indexing completed on 2026-11-05 10:40:14

 // Created on: 1991-04-03
 // Created by: Remi GILET
 // Copyright (c) 1991-1999 Matra Datavision
 // Copyright (c) 1999-2014 OPEN CASCADE SAS
 //
 // This file is part of Open CASCADE Technology software library.
 //
 // This library is free software; you can redistribute it and/or modify it under
 // the terms of the GNU Lesser General Public License version 2.1 as published
 // by the Free Software Foundation, with special exception defined in the file
 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
 // distribution for complete text of the license and disclaimer of any warranty.
 //
 // Alternatively, this file may be used under the terms of Open CASCADE
 // commercial license or contractual agreement.
 
 #ifndef _Geom2dGcc_Circ2dTanOnRadGeo_HeaderFile
 #define _Geom2dGcc_Circ2dTanOnRadGeo_HeaderFile
 
 #include <Standard.hxx>
 #include <Standard_DefineAlloc.hxx>
 
 #include <Standard_Integer.hxx>
 #include <gp_Circ2d.hxx>
 #include <NCollection_Array1.hxx>
 #include <GccEnt_Position.hxx>
 #include <gp_Pnt2d.hxx>
 class Geom2dGcc_QCurve;
 class gp_Lin2d;
 class gp_Circ2d;
 class GccEnt_QualifiedCirc;
 class Geom2dAdaptor_Curve;
 class GccEnt_QualifiedLin;
 class gp_Pnt2d;
 
 //! This class implements the algorithms used to
 //! create a 2d circle tangent to a 2d entity,
 //! centered on a 2d entity and with a given radius.
 //! More than one argument must be a curve.
 //! The arguments of all construction methods are :
 //! - The qualified element for the tangency constrains
 //! (QualifiedCirc, QualifiedLin, QualifiedCurvPoints).
 //! - The Center element (circle, line, curve).
 //! - A real Tolerance.
 //! Tolerance is only used in the limits cases.
 //! For example :
 //! We want to create a circle tangent to an OutsideCurv Cu1
 //! centered on a line OnLine with a radius Radius and with
 //! a tolerance Tolerance.
 //! If we did not use Tolerance it is impossible to
 //! find a solution in the following case : OnLine is
 //! outside Cu1. There is no intersection point between Cu1
 //! and OnLine. The distance between the line and the
 //! circle is greater than Radius.
 //! With Tolerance we will give a solution if the
 //! distance between Cu1 and OnLine is lower than or
 //! equal Tolerance.
 class Geom2dGcc_Circ2dTanOnRadGeo
 {
 public:
   DEFINE_STANDARD_ALLOC
 
   //! This methods implements the algorithms used to create
   //! 2d Circles tangent to a curve and centered on a 2d Line
   //! with a given radius.
   //! Tolerance is used to find solution in every limit cases.
   //! raises NegativeValue in case of NegativeRadius.
   Standard_EXPORT Geom2dGcc_Circ2dTanOnRadGeo(const Geom2dGcc_QCurve& Qualified1,
                                               const gp_Lin2d&         OnLine,
                                               const double            Radius,
                                               const double            Tolerance);
 
   //! This methods implements the algorithms used to create
   //! 2d Circles tangent to a curve and centered on a 2d Circle
   //! with a given radius.
   //! Tolerance is used to find solution in every limit cases.
   //! raises NegativeValue in case of NegativeRadius.
   Standard_EXPORT Geom2dGcc_Circ2dTanOnRadGeo(const Geom2dGcc_QCurve& Qualified1,
                                               const gp_Circ2d&        OnCirc,
                                               const double            Radius,
                                               const double            Tolerance);
 
   //! This methods implements the algorithms used to create
   //! 2d Circles tangent to a circle and centered on a 2d curve
   //! with a given radius.
   //! Tolerance is used to find solution in every limit cases.
   //! raises NegativeValue in case of NegativeRadius.
   Standard_EXPORT Geom2dGcc_Circ2dTanOnRadGeo(const GccEnt_QualifiedCirc& Qualified1,
                                               const Geom2dAdaptor_Curve&  OnCurv,
                                               const double                Radius,
                                               const double                Tolerance);
 
   //! This methods implements the algorithms used to create
   //! 2d Circles tangent to a 2d Line and centered on a 2d curve
   //! with a given radius.
   //! Tolerance is used to find solution in every limit cases.
   //! raises NegativeValue in case of NegativeRadius.
   Standard_EXPORT Geom2dGcc_Circ2dTanOnRadGeo(const GccEnt_QualifiedLin& Qualified1,
                                               const Geom2dAdaptor_Curve& OnCurv,
                                               const double               Radius,
                                               const double               Tolerance);
 
   //! This methods implements the algorithms used to create
   //! 2d Circles tangent to a 2d curve and centered on a 2d curve
   //! with a given radius.
   //! Tolerance is used to find solution in every limit cases.
   //! raises NegativeValue in case of NegativeRadius.
   Standard_EXPORT Geom2dGcc_Circ2dTanOnRadGeo(const Geom2dGcc_QCurve&    Qualified1,
                                               const Geom2dAdaptor_Curve& OnCurv,
                                               const double               Radius,
                                               const double               Tolerance);
 
   //! This methods implements the algorithms used to create
   //! 2d Circles passing through a 2d point and centered on a
   //! 2d curve with a given radius.
   //! Tolerance is used to find solution in every limit cases.
   //! raises NegativeValue in case of NegativeRadius.
   Standard_EXPORT Geom2dGcc_Circ2dTanOnRadGeo(const gp_Pnt2d&            Point1,
                                               const Geom2dAdaptor_Curve& OnCurv,
                                               const double               Radius,
                                               const double               Tolerance);
 
   //! This method returns True if the construction
   //! algorithm succeeded.
   Standard_EXPORT bool IsDone() const;
 
   //! This method returns the number of solutions.
   //! It raises NotDone if the construction algorithm
   //! didn't succeed.
   Standard_EXPORT int NbSolutions() 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.
   //! It raises NotDone if the construction algorithm
   //! didn't succeed.
   //! It raises OutOfRange if Index is greater than the
   //! number of solutions.
   Standard_EXPORT gp_Circ2d ThisSolution(const int Index) const;
 
   Standard_EXPORT void WhichQualifier(const int Index, GccEnt_Position& Qualif1) const;
 
   //! Returns information 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.
   //! PntSol is the tangency point on the solution curv.
   //! PntArg is the tangency point 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.
   Standard_EXPORT void Tangency1(const int Index,
                                  double&   ParSol,
                                  double&   ParArg,
                                  gp_Pnt2d& PntSol) const;
 
   //! Returns information about the center (on the curv)
   //! of the result.
   //! ParArg is the intrinsic parameter of the point on
   //! the argument curv.
   //! PntSol is the center point of the solution curv.
   //! It raises NotDone if the construction algorithm
   //! didn't succeed.
   //! It raises OutOfRange if Index is greater than the
   //! number of solutions.
   Standard_EXPORT void CenterOn3(const int Index, double& ParArg, gp_Pnt2d& PntSol) const;
 
   //! Returns True if the solution number Index is equal to
   //! the first argument and False in the other cases.
   //! It raises NotDone if the construction algorithm
   //! didn't succeed.
   //! It raises OutOfRange if Index is greater than the
   //! number of solutions.
   Standard_EXPORT bool IsTheSame1(const int Index) const;
 
 private:
   bool                                WellDone;
   int                                 NbrSol;
   NCollection_Array1<gp_Circ2d>       cirsol;
   NCollection_Array1<GccEnt_Position> qualifier1;
   NCollection_Array1<int>             TheSame1;
   NCollection_Array1<gp_Pnt2d>        pnttg1sol;
   NCollection_Array1<gp_Pnt2d>        pntcen3;
   NCollection_Array1<double>          par1sol;
   NCollection_Array1<double>          pararg1;
   NCollection_Array1<double>          parcen3;
 };
 
 #endif // _Geom2dGcc_Circ2dTanOnRadGeo_HeaderFile

This page was automatically generated by the 2.3.7 LXR engine. The LXR team