Open CASCADE Technology
6.9.0
|
the main algorithm. Algorythm outputs are lines and points like discribe in the last paragraph. The Algorythm provides direct acces to the elements of those lines and points. Other classes of this package are for internal use and only concern the algorithmic part. More...
#include <IntPolyh_Intersection.hxx>
the main algorithm. Algorythm outputs are lines and points like discribe in the last paragraph. The Algorythm provides direct acces to the elements of those lines and points. Other classes of this package are for internal use and only concern the algorithmic part.
IntPolyh_Intersection::IntPolyh_Intersection | ( | const Handle< Adaptor3d_HSurface > & | S1, |
const Handle< Adaptor3d_HSurface > & | S2 | ||
) |
Constructor.
IntPolyh_Intersection::IntPolyh_Intersection | ( | const Handle< Adaptor3d_HSurface > & | S1, |
const Standard_Integer | NbSU1, | ||
const Standard_Integer | NbSV1, | ||
const Handle< Adaptor3d_HSurface > & | S2, | ||
const Standard_Integer | NbSU2, | ||
const Standard_Integer | NbSV2 | ||
) |
NbSU1 ... NbSV2 are used to compute the initial samples of the iso parametric meshes on the surfaces.
IntPolyh_Intersection::IntPolyh_Intersection | ( | const Handle< Adaptor3d_HSurface > & | S1, |
const TColStd_Array1OfReal & | anUpars1, | ||
const TColStd_Array1OfReal & | aVpars1, | ||
const Handle< Adaptor3d_HSurface > & | S2, | ||
const TColStd_Array1OfReal & | anUpars2, | ||
const TColStd_Array1OfReal & | aVpars2 | ||
) |
D1, D2 are used to compute the initial samples of the iso parametric meshes on the surfaces.
void IntPolyh_Intersection::GetLinePoint | ( | const Standard_Integer | IndexLine, |
const Standard_Integer | IndexPoint, | ||
Standard_Real & | x, | ||
Standard_Real & | y, | ||
Standard_Real & | z, | ||
Standard_Real & | u1, | ||
Standard_Real & | v1, | ||
Standard_Real & | u2, | ||
Standard_Real & | v2, | ||
Standard_Real & | incidence | ||
) | const |
void IntPolyh_Intersection::GetTangentZonePoint | ( | const Standard_Integer | IndexLine, |
const Standard_Integer | IndexPoint, | ||
Standard_Real & | x, | ||
Standard_Real & | y, | ||
Standard_Real & | z, | ||
Standard_Real & | u1, | ||
Standard_Real & | v1, | ||
Standard_Real & | u2, | ||
Standard_Real & | v2 | ||
) | const |
Standard_Boolean IntPolyh_Intersection::IsDone | ( | ) | const |
Standard_Integer IntPolyh_Intersection::NbPointsInLine | ( | const Standard_Integer | IndexLine | ) | const |
Standard_Integer IntPolyh_Intersection::NbPointsInTangentZone | ( | const Standard_Integer | IndexLine | ) | const |
Standard_Integer IntPolyh_Intersection::NbSectionLines | ( | ) | const |
Standard_Integer IntPolyh_Intersection::NbTangentZones | ( | ) | const |
void IntPolyh_Intersection::Perform | ( | ) |
Compute the intersection.
void IntPolyh_Intersection::Perform | ( | const TColStd_Array1OfReal & | Upars1, |
const TColStd_Array1OfReal & | Vpars1, | ||
const TColStd_Array1OfReal & | Upars2, | ||
const TColStd_Array1OfReal & | Vpars2 | ||
) |
Compute the intersection.