Open CASCADE Technology Reference Manual 8.0.0
Loading...
Searching...
No Matches
Public Member Functions
HLRBRep_Intersector Class Reference

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_IntersectionPointPoint (const int N) const
 
const IntCurveSurface_IntersectionPointCSPoint (const int N) const
 
int NbSegments () const
 
const IntRes2d_IntersectionSegmentSegment (const int N) const
 
const IntCurveSurface_IntersectionSegmentCSSegment (const int N) const
 
void Destroy ()
 
 ~HLRBRep_Intersector ()
 

Detailed Description

The Intersector computes 2D intersections of the projections of 3D curves. It can also computes the intersection of a 3D line and a surface.

Constructor & Destructor Documentation

◆ HLRBRep_Intersector()

HLRBRep_Intersector::HLRBRep_Intersector ( )

◆ ~HLRBRep_Intersector()

HLRBRep_Intersector::~HLRBRep_Intersector ( )
inline

Member Function Documentation

◆ CSPoint()

const IntCurveSurface_IntersectionPoint & HLRBRep_Intersector::CSPoint ( const int N) const

◆ CSSegment()

const IntCurveSurface_IntersectionSegment & HLRBRep_Intersector::CSSegment ( const int N) const

◆ Destroy()

void HLRBRep_Intersector::Destroy ( )

◆ IsDone()

bool HLRBRep_Intersector::IsDone ( ) const

◆ Load()

void HLRBRep_Intersector::Load ( HLRBRep_Surface * theSurface)

◆ NbPoints()

int HLRBRep_Intersector::NbPoints ( ) const

◆ NbSegments()

int HLRBRep_Intersector::NbSegments ( ) const

◆ Perform() [1/3]

void HLRBRep_Intersector::Perform ( const gp_Lin & theL,
const double theP )

◆ Perform() [2/3]

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).

◆ Perform() [3/3]

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).

◆ Point()

const IntRes2d_IntersectionPoint & HLRBRep_Intersector::Point ( const int N) const

◆ Segment()

const IntRes2d_IntersectionSegment & HLRBRep_Intersector::Segment ( const int N) const

◆ SimulateOnePoint()

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.


The documentation for this class was generated from the following file: