|
||||
File indexing completed on 2025-01-18 10:03:34
0001 // Created on: 1992-10-20 0002 // Created by: Remi GILET 0003 // Copyright (c) 1992-1999 Matra Datavision 0004 // Copyright (c) 1999-2014 OPEN CASCADE SAS 0005 // 0006 // This file is part of Open CASCADE Technology software library. 0007 // 0008 // This library is free software; you can redistribute it and/or modify it under 0009 // the terms of the GNU Lesser General Public License version 2.1 as published 0010 // by the Free Software Foundation, with special exception defined in the file 0011 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT 0012 // distribution for complete text of the license and disclaimer of any warranty. 0013 // 0014 // Alternatively, this file may be used under the terms of Open CASCADE 0015 // commercial license or contractual agreement. 0016 0017 #ifndef _Geom2dGcc_Lin2d2Tan_HeaderFile 0018 #define _Geom2dGcc_Lin2d2Tan_HeaderFile 0019 0020 #include <Standard.hxx> 0021 #include <Standard_DefineAlloc.hxx> 0022 0023 #include <Standard_Integer.hxx> 0024 #include <TColgp_Array1OfLin2d.hxx> 0025 #include <GccEnt_Array1OfPosition.hxx> 0026 #include <TColgp_Array1OfPnt2d.hxx> 0027 #include <TColStd_Array1OfReal.hxx> 0028 #include <GccEnt_Position.hxx> 0029 class Geom2dGcc_QualifiedCurve; 0030 class gp_Pnt2d; 0031 class gp_Lin2d; 0032 class Geom2dGcc_Lin2d2TanIter; 0033 class Geom2dAdaptor_Curve; 0034 0035 0036 //! This class implements the algorithms used to 0037 //! create 2d lines tangent to 2 other elements which 0038 //! can be circles, curves or points. 0039 //! More than one argument must be a curve. 0040 //! Describes functions for building a 2D line: 0041 //! - tangential to 2 curves, or 0042 //! - tangential to a curve and passing through a point. 0043 //! A Lin2d2Tan object provides a framework for: 0044 //! - defining the construction of 2D line(s), 0045 //! - implementing the construction algorithm, and 0046 //! - consulting the result(s). 0047 //! 0048 //! Note: Some constructors may check the type of the qualified argument 0049 //! and raise BadQualifier Error in case of incorrect couple (qualifier, curv). 0050 class Geom2dGcc_Lin2d2Tan 0051 { 0052 public: 0053 0054 DEFINE_STANDARD_ALLOC 0055 0056 0057 //! This class implements the algorithms used to create 2d 0058 //! line tangent to two curves. 0059 //! Tolang is used to determine the tolerance for the tangency points. 0060 Standard_EXPORT Geom2dGcc_Lin2d2Tan(const Geom2dGcc_QualifiedCurve& Qualified1, const Geom2dGcc_QualifiedCurve& Qualified2, const Standard_Real Tolang); 0061 0062 //! This class implements the algorithms used to create 2d 0063 //! lines passing through a point and tangent to a curve. 0064 //! Tolang is used to determine the tolerance for the tangency points. 0065 Standard_EXPORT Geom2dGcc_Lin2d2Tan(const Geom2dGcc_QualifiedCurve& Qualified1, const gp_Pnt2d& ThePoint, const Standard_Real Tolang); 0066 0067 //! This class implements the algorithms used to create 2d 0068 //! line tangent to two curves. 0069 //! Tolang is used to determine the tolerance for the tangency points. 0070 //! Param1 is used for the initial guess on the first curve. 0071 //! Param2 is used for the initial guess on the second curve. 0072 Standard_EXPORT Geom2dGcc_Lin2d2Tan(const Geom2dGcc_QualifiedCurve& Qualified1, const Geom2dGcc_QualifiedCurve& Qualified2, const Standard_Real Tolang, const Standard_Real Param1, const Standard_Real Param2); 0073 0074 //! This class implements the algorithms used to create 2d 0075 //! lines passing through a point and tangent to a curve. 0076 //! Tolang is used to determine the tolerance for the tangency points. 0077 //! Param2 is used for the initial guess on the curve. 0078 Standard_EXPORT Geom2dGcc_Lin2d2Tan(const Geom2dGcc_QualifiedCurve& Qualified1, const gp_Pnt2d& ThePoint, const Standard_Real Tolang, const Standard_Real Param1); 0079 0080 //! Returns true if the construction algorithm does not fail 0081 //! (even if it finds no solution). 0082 //! Note: IsDone protects against a failure arising from a 0083 //! more internal intersection algorithm, which has 0084 //! reached its numeric limits. 0085 Standard_EXPORT Standard_Boolean IsDone() const; 0086 0087 //! Returns the number of lines, representing solutions computed by this algorithm. 0088 //! Exceptions StdFail_NotDone if the construction fails.R 0089 Standard_EXPORT Standard_Integer NbSolutions() const; 0090 0091 //! Returns a line, representing the solution of index Index computed by this algorithm. 0092 //! Warning 0093 //! This indexing simply provides a means of consulting the 0094 //! solutions. The index values are not associated with 0095 //! these solutions outside the context of the algorithm object. 0096 //! Exceptions 0097 //! Standard_OutOfRange if Index is less than zero or 0098 //! greater than the number of solutions computed by this algorithm. 0099 //! StdFail_NotDone if the construction fails. 0100 Standard_EXPORT gp_Lin2d ThisSolution (const Standard_Integer Index) const; 0101 0102 //! Returns the qualifiers Qualif1 and Qualif2 of the 0103 //! tangency arguments for the solution of index Index 0104 //! computed by this algorithm. 0105 //! The returned qualifiers are: 0106 //! - those specified at the start of construction when the 0107 //! solutions are defined as enclosing or outside with 0108 //! respect to the arguments, or 0109 //! - those computed during construction (i.e. enclosing or 0110 //! outside) when the solutions are defined as unqualified 0111 //! with respect to the arguments, or 0112 //! - GccEnt_noqualifier if the tangency argument is a point. 0113 //! Exceptions 0114 //! Standard_OutOfRange if Index is less than zero or 0115 //! greater than the number of solutions computed by this algorithm. 0116 //! StdFail_NotDone if the construction fails. 0117 Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1, GccEnt_Position& Qualif2) const; 0118 0119 //! Returns information about the tangency point between the 0120 //! result and the first argument. 0121 //! ParSol is the intrinsic parameter of the point PntSol on 0122 //! the solution curv. 0123 //! ParArg is the intrinsic parameter of the point PntSol on the argument curv. 0124 //! Exceptions 0125 //! Standard_OutOfRange if Index is less than zero or 0126 //! greater than the number of solutions computed by this algorithm. 0127 //! StdFail_NotDone if the construction fails. 0128 Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const; 0129 0130 //! Returns information about the tangency point between the 0131 //! result and the first argument. 0132 //! ParSol is the intrinsic parameter of the point PntSol on the solution curv. 0133 //! ParArg is the intrinsic parameter of the point PntSol on the argument curv. 0134 //! Exceptions 0135 //! Standard_OutOfRange if Index is less than zero or 0136 //! greater than the number of solutions computed by this algorithm. 0137 //! StdFail_NotDone if the construction fails. 0138 Standard_EXPORT void Tangency2 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const; 0139 0140 0141 0142 0143 protected: 0144 0145 0146 0147 0148 0149 private: 0150 0151 0152 Standard_EXPORT Standard_Boolean Add (const Standard_Integer theIndex, const Geom2dGcc_Lin2d2TanIter& theLin, const Standard_Real theTol, const Geom2dAdaptor_Curve& theC1, const Geom2dAdaptor_Curve& theC2); 0153 0154 0155 Standard_Boolean WellDone; 0156 Standard_Integer NbrSol; 0157 TColgp_Array1OfLin2d linsol; 0158 GccEnt_Array1OfPosition qualifier1; 0159 GccEnt_Array1OfPosition qualifier2; 0160 TColgp_Array1OfPnt2d pnttg1sol; 0161 TColgp_Array1OfPnt2d pnttg2sol; 0162 TColStd_Array1OfReal par1sol; 0163 TColStd_Array1OfReal par2sol; 0164 TColStd_Array1OfReal pararg1; 0165 TColStd_Array1OfReal pararg2; 0166 0167 0168 }; 0169 0170 0171 0172 0173 0174 0175 0176 #endif // _Geom2dGcc_Lin2d2Tan_HeaderFile
[ Source navigation ] | [ Diff markup ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.3.7 LXR engine. The LXR team |