![]() |
Open CASCADE Technology Reference Manual 8.0.0
|
The Intersector computes 2D intersections of the projections of 3D curves. It can also computes the intersection of a 3D line and a surface. More...
#include <HLRBRep_Intersector.hxx>
Public Member Functions | |
| HLRBRep_Intersector () | |
| void | Perform (HLRBRep_EdgeData *theEdge1, const double theDa1, const double theDb1) |
| Performs the auto intersection of an edge. The edge domain is cut at start with da1*(b-a) and at end with db1*(b-a). | |
| void | Perform (const int theNA, HLRBRep_EdgeData *theEdge1, const double theDa1, const double theDb1, const int theNB, HLRBRep_EdgeData *theEdge2, const double theDa2, const double theDb2, const bool theNoBound) |
| Performs the intersection between the two edges. The edges domains are cut at start with da*(b-a) and at end with db*(b-a). | |
| void | SimulateOnePoint (HLRBRep_EdgeData *theEdge1, const double theU, HLRBRep_EdgeData *theEdge2, const double theV) |
| Create a single IntersectionPoint (U on theEdge1) (V on theEdge2) The point is middle on both curves. | |
| void | Load (HLRBRep_Surface *theSurface) |
| void | Perform (const gp_Lin &theL, const double theP) |
| bool | IsDone () const |
| int | NbPoints () const |
| const IntRes2d_IntersectionPoint & | Point (const int N) const |
| const IntCurveSurface_IntersectionPoint & | CSPoint (const int N) const |
| int | NbSegments () const |
| const IntRes2d_IntersectionSegment & | Segment (const int N) const |
| const IntCurveSurface_IntersectionSegment & | CSSegment (const int N) const |
| void | Destroy () |
| ~HLRBRep_Intersector () | |
The Intersector computes 2D intersections of the projections of 3D curves. It can also computes the intersection of a 3D line and a surface.
| HLRBRep_Intersector::HLRBRep_Intersector | ( | ) |
|
inline |
| const IntCurveSurface_IntersectionPoint & HLRBRep_Intersector::CSPoint | ( | const int | N | ) | const |
| const IntCurveSurface_IntersectionSegment & HLRBRep_Intersector::CSSegment | ( | const int | N | ) | const |
| void HLRBRep_Intersector::Destroy | ( | ) |
| bool HLRBRep_Intersector::IsDone | ( | ) | const |
| void HLRBRep_Intersector::Load | ( | HLRBRep_Surface * | theSurface | ) |
| int HLRBRep_Intersector::NbPoints | ( | ) | const |
| int HLRBRep_Intersector::NbSegments | ( | ) | const |
| void HLRBRep_Intersector::Perform | ( | const int | theNA, |
| HLRBRep_EdgeData * | theEdge1, | ||
| const double | theDa1, | ||
| const double | theDb1, | ||
| const int | theNB, | ||
| HLRBRep_EdgeData * | theEdge2, | ||
| const double | theDa2, | ||
| const double | theDb2, | ||
| const bool | theNoBound ) |
Performs the intersection between the two edges. The edges domains are cut at start with da*(b-a) and at end with db*(b-a).
| void HLRBRep_Intersector::Perform | ( | HLRBRep_EdgeData * | theEdge1, |
| const double | theDa1, | ||
| const double | theDb1 ) |
Performs the auto intersection of an edge. The edge domain is cut at start with da1*(b-a) and at end with db1*(b-a).
| const IntRes2d_IntersectionPoint & HLRBRep_Intersector::Point | ( | const int | N | ) | const |
| const IntRes2d_IntersectionSegment & HLRBRep_Intersector::Segment | ( | const int | N | ) | const |
| void HLRBRep_Intersector::SimulateOnePoint | ( | HLRBRep_EdgeData * | theEdge1, |
| const double | theU, | ||
| HLRBRep_EdgeData * | theEdge2, | ||
| const double | theV ) |
Create a single IntersectionPoint (U on theEdge1) (V on theEdge2) The point is middle on both curves.