include/opencascade/Geom2dInt_TheIntPCurvePCurveOfGInter.hxx

0001 // Created on: 1992-06-04
0002 // Created by: Jacques GOUSSARD
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 _Geom2dInt_TheIntPCurvePCurveOfGInter_HeaderFile
0018 #define _Geom2dInt_TheIntPCurvePCurveOfGInter_HeaderFile
0019
0020 #include <Standard.hxx>
0021 #include <Standard_DefineAlloc.hxx>
0022
0023 #include <IntRes2d_Domain.hxx>
0024 #include <IntRes2d_Intersection.hxx>
0025 #include <Standard_Integer.hxx>
0026 class Adaptor2d_Curve2d;
0027 class Geom2dInt_Geom2dCurveTool;
0028 class Geom2dInt_TheProjPCurOfGInter;
0029 class Geom2dInt_ThePolygon2dOfTheIntPCurvePCurveOfGInter;
0030 class Geom2dInt_TheDistBetweenPCurvesOfTheIntPCurvePCurveOfGInter;
0031 class Geom2dInt_ExactIntersectionPointOfTheIntPCurvePCurveOfGInter;
0032 class IntRes2d_Domain;
0033
0034 class Geom2dInt_TheIntPCurvePCurveOfGInter : public IntRes2d_Intersection
0035 {
0036 public:
0037   DEFINE_STANDARD_ALLOC
0038
0039   Standard_EXPORT Geom2dInt_TheIntPCurvePCurveOfGInter();
0040
0041   Standard_EXPORT void Perform(const Adaptor2d_Curve2d& Curve1,
0042                                const IntRes2d_Domain&   Domain1,
0043                                const Adaptor2d_Curve2d& Curve2,
0044                                const IntRes2d_Domain&   Domain2,
0045                                const double             TolConf,
0046                                const double             Tol);
0047
0048   Standard_EXPORT void Perform(const Adaptor2d_Curve2d& Curve1,
0049                                const IntRes2d_Domain&   Domain1,
0050                                const double             TolConf,
0051                                const double             Tol);
0052
0053   //! Set / get minimum number of points in polygon for intersection.
0054   Standard_EXPORT void SetMinNbSamples(const int theMinNbSamples);
0055   Standard_EXPORT int  GetMinNbSamples() const;
0056
0057 protected:
0058   Standard_EXPORT void Perform(const Adaptor2d_Curve2d& Curve1,
0059                                const IntRes2d_Domain&   Domain1,
0060                                const Adaptor2d_Curve2d& Curve2,
0061                                const IntRes2d_Domain&   Domain2,
0062                                const double             TolConf,
0063                                const double             Tol,
0064                                const int                NbIter,
0065                                const double             DeltaU,
0066                                const double             DeltaV);
0067
0068   Standard_EXPORT void Perform(const Adaptor2d_Curve2d& Curve1,
0069                                const IntRes2d_Domain&   Domain1,
0070                                const double             TolConf,
0071                                const double             Tol,
0072                                const int                NbIter,
0073                                const double             DeltaU,
0074                                const double             DeltaV);
0075
0076 private:
0077   //! Method to find intersection between two curves
0078   //! : returns false for case when some points of polygon
0079   //! : were replaced on line and exact point of intersection was not found
0080   //! : for case when point of intersection was found
0081   //! : during prelimanary search for line (case of bad parameterization of Bspline for example).
0082   Standard_EXPORT bool findIntersect(
0083     const Adaptor2d_Curve2d&                                  Curve1,
0084     const IntRes2d_Domain&                                    Domain1,
0085     const Adaptor2d_Curve2d&                                  Curve2,
0086     const IntRes2d_Domain&                                    Domain2,
0087     const double                                              TolConf,
0088     const double                                              Tol,
0089     const int                                                 NbIter,
0090     const double                                              DeltaU,
0091     const double                                              DeltaV,
0092     const Geom2dInt_ThePolygon2dOfTheIntPCurvePCurveOfGInter& thePoly1,
0093     const Geom2dInt_ThePolygon2dOfTheIntPCurvePCurveOfGInter& thePoly2,
0094     const bool                                                isFullRepresentation);
0095
0096   IntRes2d_Domain DomainOnCurve1;
0097   IntRes2d_Domain DomainOnCurve2;
0098
0099   //! Minimal number of sample points
0100   int myMinPntNb;
0101 };
0102
0103 #endif // _Geom2dInt_TheIntPCurvePCurveOfGInter_HeaderFile