mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-04 18:06:22 +03:00
5ae6e53dec
- removal of excess interferences in case of simple hiding face - correct processing of boundary edges coinciding with outlines - change of API for testing Draw Command - correction of Draw command "build3d" - test cases are added. Linux reference data is changed. Partially fixed 0027340: Insufficient exact HLR speed Number of samples in PolyPoly intersection algorithm tuned in each instance of generic class. Default number of the samples in Geom2dAdaptor is changed according to the Adaptor2d_Curve2d class. Minimal number of points in case of B-Spline is changed. Minimal number of samples support is added in intersection algorithms.
88 lines
3.7 KiB
C++
88 lines
3.7 KiB
C++
// Created on: 1992-06-04
|
|
// Created by: Jacques GOUSSARD
|
|
// Copyright (c) 1992-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 _Geom2dInt_TheIntPCurvePCurveOfGInter_HeaderFile
|
|
#define _Geom2dInt_TheIntPCurvePCurveOfGInter_HeaderFile
|
|
|
|
#include <Standard.hxx>
|
|
#include <Standard_DefineAlloc.hxx>
|
|
#include <Standard_Handle.hxx>
|
|
|
|
#include <IntRes2d_Domain.hxx>
|
|
#include <IntRes2d_Intersection.hxx>
|
|
#include <Standard_Real.hxx>
|
|
#include <Standard_Integer.hxx>
|
|
#include <Standard_Boolean.hxx>
|
|
class Adaptor2d_Curve2d;
|
|
class Geom2dInt_Geom2dCurveTool;
|
|
class Geom2dInt_TheProjPCurOfGInter;
|
|
class Geom2dInt_ThePolygon2dOfTheIntPCurvePCurveOfGInter;
|
|
class Geom2dInt_TheDistBetweenPCurvesOfTheIntPCurvePCurveOfGInter;
|
|
class Geom2dInt_ExactIntersectionPointOfTheIntPCurvePCurveOfGInter;
|
|
class IntRes2d_Domain;
|
|
|
|
|
|
|
|
class Geom2dInt_TheIntPCurvePCurveOfGInter : public IntRes2d_Intersection
|
|
{
|
|
public:
|
|
|
|
DEFINE_STANDARD_ALLOC
|
|
|
|
Standard_EXPORT Geom2dInt_TheIntPCurvePCurveOfGInter();
|
|
|
|
Standard_EXPORT void Perform (const Adaptor2d_Curve2d& Curve1, const IntRes2d_Domain& Domain1, const Adaptor2d_Curve2d& Curve2, const IntRes2d_Domain& Domain2, const Standard_Real TolConf, const Standard_Real Tol);
|
|
|
|
Standard_EXPORT void Perform (const Adaptor2d_Curve2d& Curve1, const IntRes2d_Domain& Domain1, const Standard_Real TolConf, const Standard_Real Tol);
|
|
|
|
//! Set / get minimum number of points in polygon for intersection.
|
|
Standard_EXPORT void SetMinNbSamples (const Standard_Integer theMinNbSamples);
|
|
Standard_EXPORT Standard_Integer GetMinNbSamples () const;
|
|
|
|
|
|
protected:
|
|
|
|
|
|
Standard_EXPORT void Perform (const Adaptor2d_Curve2d& Curve1, const IntRes2d_Domain& Domain1, const Adaptor2d_Curve2d& Curve2, const IntRes2d_Domain& Domain2, const Standard_Real TolConf, const Standard_Real Tol, const Standard_Integer NbIter, const Standard_Real DeltaU, const Standard_Real DeltaV);
|
|
|
|
Standard_EXPORT void Perform (const Adaptor2d_Curve2d& Curve1, const IntRes2d_Domain& Domain1, const Standard_Real TolConf, const Standard_Real Tol, const Standard_Integer NbIter, const Standard_Real DeltaU, const Standard_Real DeltaV);
|
|
|
|
private:
|
|
|
|
|
|
//! Method to find intersection between two curves
|
|
//! : returns false for case when some points of polygon
|
|
//! : were replaced on line and exact point of intersection was not found
|
|
//! : for case when point of intersection was found
|
|
//! : during prelimanary search for line (case of bad paramerization of Bspline for example).
|
|
Standard_EXPORT Standard_Boolean findIntersect (const Adaptor2d_Curve2d& Curve1, const IntRes2d_Domain& Domain1, const Adaptor2d_Curve2d& Curve2, const IntRes2d_Domain& Domain2, const Standard_Real TolConf, const Standard_Real Tol, const Standard_Integer NbIter, const Standard_Real DeltaU, const Standard_Real DeltaV, const Geom2dInt_ThePolygon2dOfTheIntPCurvePCurveOfGInter& thePoly1, const Geom2dInt_ThePolygon2dOfTheIntPCurvePCurveOfGInter& thePoly2, const Standard_Boolean isFullRepresentation);
|
|
|
|
IntRes2d_Domain DomainOnCurve1;
|
|
IntRes2d_Domain DomainOnCurve2;
|
|
|
|
//! Minimal number of sample points
|
|
Standard_Integer myMinPntNb;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif // _Geom2dInt_TheIntPCurvePCurveOfGInter_HeaderFile
|