Open CASCADE Technology  7.3.0
Public Member Functions

HLRBRep_Intersector Class Reference

The Intersector computes 2D intersections of the projections of 3D curves. More...

#include <HLRBRep_Intersector.hxx>

Public Member Functions

 HLRBRep_Intersector ()
 
void Perform (const Standard_Address A1, const Standard_Real da1, const Standard_Real db1)
 Performs the auto intersection of an edge. The edge domain is cutted at start with da1*(b-a) and at end with db1*(b-a). More...
 
void 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 cutted at start with da*(b-a) and at end with db*(b-a). More...
 
void 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. More...
 
void Load (Standard_Address &A)
 
void Perform (const gp_Lin &L, const Standard_Real P)
 
Standard_Boolean IsDone () const
 
Standard_Integer NbPoints () const
 
const IntRes2d_IntersectionPointPoint (const Standard_Integer N) const
 
const IntCurveSurface_IntersectionPointCSPoint (const Standard_Integer N) const
 
Standard_Integer NbSegments () const
 
const IntRes2d_IntersectionSegmentSegment (const Standard_Integer N) const
 
const IntCurveSurface_IntersectionSegmentCSSegment (const Standard_Integer 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 Standard_Integer  N) const

◆ CSSegment()

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

◆ Destroy()

void HLRBRep_Intersector::Destroy ( )

◆ IsDone()

Standard_Boolean HLRBRep_Intersector::IsDone ( ) const

◆ Load()

void HLRBRep_Intersector::Load ( Standard_Address A)

◆ NbPoints()

Standard_Integer HLRBRep_Intersector::NbPoints ( ) const

◆ NbSegments()

Standard_Integer HLRBRep_Intersector::NbSegments ( ) const

◆ Perform() [1/3]

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 cutted at start with da1*(b-a) and at end with db1*(b-a).

◆ Perform() [2/3]

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 cutted at start with da*(b-a) and at end with db*(b-a).

◆ Perform() [3/3]

void HLRBRep_Intersector::Perform ( const gp_Lin L,
const Standard_Real  P 
)

◆ Point()

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

◆ Segment()

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

◆ SimulateOnePoint()

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.


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