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

this class contains the generic algorithm of computation of the bisecting locus. More...

#include <MAT2d_Mat2d.hxx>

Public Member Functions

 MAT2d_Mat2d (const bool IsOpenResult=false)
 Empty constructor.
 
 ~MAT2d_Mat2d ()
 
void CreateMat (MAT2d_Tool2d &aTool)
 Algorithm of computation of the bisecting locus.
 
void CreateMatOpen (MAT2d_Tool2d &aTool)
 Algorithm of computation of the bisecting locus for open wire.
 
bool IsDone () const
 Returns <TRUE> if CreateMat has succeeded.
 
void Init ()
 Initialize an iterator on the set of the roots of the trees of bisectors.
 
bool More () const
 Return False if there is no more roots.
 
void Next ()
 Move to the next root.
 
occ::handle< MAT_BisectorBisector () const
 Returns the current root.
 
bool SemiInfinite () const
 Returns True if there are semi_infinite bisectors. So there is a tree for each semi_infinte bisector.
 
int NumberOfBisectors () const
 Returns the total number of bisectors.
 

Detailed Description

this class contains the generic algorithm of computation of the bisecting locus.

Constructor & Destructor Documentation

◆ MAT2d_Mat2d()

MAT2d_Mat2d::MAT2d_Mat2d ( const bool IsOpenResult = false)

Empty constructor.

◆ ~MAT2d_Mat2d()

MAT2d_Mat2d::~MAT2d_Mat2d ( )

Member Function Documentation

◆ Bisector()

occ::handle< MAT_Bisector > MAT2d_Mat2d::Bisector ( ) const

Returns the current root.

◆ CreateMat()

void MAT2d_Mat2d::CreateMat ( MAT2d_Tool2d & aTool)

Algorithm of computation of the bisecting locus.

◆ CreateMatOpen()

void MAT2d_Mat2d::CreateMatOpen ( MAT2d_Tool2d & aTool)

Algorithm of computation of the bisecting locus for open wire.

◆ Init()

void MAT2d_Mat2d::Init ( )

Initialize an iterator on the set of the roots of the trees of bisectors.

◆ IsDone()

bool MAT2d_Mat2d::IsDone ( ) const

Returns <TRUE> if CreateMat has succeeded.

◆ More()

bool MAT2d_Mat2d::More ( ) const

Return False if there is no more roots.

◆ Next()

void MAT2d_Mat2d::Next ( )

Move to the next root.

◆ NumberOfBisectors()

int MAT2d_Mat2d::NumberOfBisectors ( ) const

Returns the total number of bisectors.

◆ SemiInfinite()

bool MAT2d_Mat2d::SemiInfinite ( ) const

Returns True if there are semi_infinite bisectors. So there is a tree for each semi_infinte bisector.


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