Open CASCADE Technology 7.8.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>
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 Standard_Integer | N | ) | const |
const IntCurveSurface_IntersectionSegment & HLRBRep_Intersector::CSSegment | ( | const Standard_Integer | N | ) | const |
void HLRBRep_Intersector::Destroy | ( | ) |
Standard_Boolean HLRBRep_Intersector::IsDone | ( | ) | const |
void HLRBRep_Intersector::Load | ( | Standard_Address & | A | ) |
Standard_Integer HLRBRep_Intersector::NbPoints | ( | ) | const |
Standard_Integer HLRBRep_Intersector::NbSegments | ( | ) | const |
void HLRBRep_Intersector::Perform | ( | const gp_Lin & | L, |
const Standard_Real | P | ||
) |
void HLRBRep_Intersector::Perform | ( | const Standard_Address | A1, |
const Standard_Real | da1, | ||
const Standard_Real | db1 | ||
) |
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 HLRBRep_Intersector::Perform | ( | const Standard_Integer | nA, |
const Standard_Address | A1, | ||
const Standard_Real | da1, | ||
const Standard_Real | db1, | ||
const Standard_Integer | nB, | ||
const Standard_Address | A2, | ||
const Standard_Real | da2, | ||
const Standard_Real | db2, | ||
const Standard_Boolean | NoBound | ||
) |
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).
const IntRes2d_IntersectionPoint & HLRBRep_Intersector::Point | ( | const Standard_Integer | N | ) | const |
const IntRes2d_IntersectionSegment & HLRBRep_Intersector::Segment | ( | const Standard_Integer | N | ) | const |
void HLRBRep_Intersector::SimulateOnePoint | ( | const Standard_Address | A1, |
const Standard_Real | U, | ||
const Standard_Address | A2, | ||
const Standard_Real | V | ||
) |
Create a single IntersectionPoint (U on A1) (V on A2) The point is middle on both curves.