HLRBRep_ThePolyhedronOfInterCSurf Class Reference

#include <HLRBRep_ThePolyhedronOfInterCSurf.hxx>

Public Member Functions
	HLRBRep_ThePolyhedronOfInterCSurf (HLRBRep_Surface *Surface, const int nbdU, const int nbdV, const double U1, const double V1, const double U2, const double V2)
	HLRBRep_ThePolyhedronOfInterCSurf (HLRBRep_Surface *Surface, const NCollection_Array1< double > &Upars, const NCollection_Array1< double > &Vpars)
void	Destroy ()
	~HLRBRep_ThePolyhedronOfInterCSurf ()
void	DeflectionOverEstimation (const double flec)
void	UMinSingularity (const bool Sing)
void	UMaxSingularity (const bool Sing)
void	VMinSingularity (const bool Sing)
void	VMaxSingularity (const bool Sing)
void	Size (int &nbdu, int &nbdv) const
	get the size of the discretization.
int	NbTriangles () const
	Give the number of triangles in this double array of.
void	Triangle (const int Index, int &P1, int &P2, int &P3) const
	Give the 3 points of the triangle of address Index in the double array of triangles.
int	TriConnex (const int Triang, const int Pivot, const int Pedge, int &TriCon, int &OtherP) const
	Give the address Tricon of the triangle connexe to the triangle of address Triang by the edge Pivot Pedge and the third point of this connexe triangle. When we are on a free edge TriCon==0 but the function return the value of the triangle in the other side of Pivot on the free edge. Used to turn around a vertex.
int	NbPoints () const
	Give the number of point in the double array of triangles ((nbdu+1)*(nbdv+1)).
void	Point (const gp_Pnt &thePnt, const int lig, const int col, const double U, const double V)
	Set the value of a field of the double array of points.
const gp_Pnt &	Point (const int Index, double &U, double &V) const
	Give the point of index i in the MaTriangle.
const gp_Pnt &	Point (const int Index) const
	Give the point of index i in the MaTriangle.
void	Point (const int Index, gp_Pnt &P) const
	Give the point of index i in the MaTriangle.
const Bnd_Box &	Bounding () const
	Give the bounding box of the MaTriangle.
void	FillBounding ()
	Compute the array of boxes. The box <n> corresponding to the triangle <n>.
const occ::handle< NCollection_HArray1< Bnd_Box > > &	ComponentsBounding () const
	Give the array of boxes. The box <n> corresponding to the triangle <n>.
double	DeflectionOverEstimation () const
bool	HasUMinSingularity () const
bool	HasUMaxSingularity () const
bool	HasVMinSingularity () const
bool	HasVMaxSingularity () const
void	PlaneEquation (const int Triang, gp_XYZ &NormalVector, double &PolarDistance) const
	Give the plane equation of the triangle of address Triang.
bool	Contain (const int Triang, const gp_Pnt &ThePnt) const
	Give the plane equation of the triangle of address Triang.
void	Parameters (const int Index, double &U, double &V) const
bool	IsOnBound (const int Index1, const int Index2) const
	This method returns true if the edge based on points with indices Index1 and Index2 represents a boundary edge. It is necessary to take into account the boundary deflection for this edge.
double	GetBorderDeflection () const
	This method returns a border deflection.
void	Dump () const

Protected Member Functions
void	Init (HLRBRep_Surface *Surface, const double U1, const double V1, const double U2, const double V2)
void	Init (HLRBRep_Surface *Surface, const NCollection_Array1< double > &Upars, const NCollection_Array1< double > &Vpars)

Constructor & Destructor Documentation

HLRBRep_ThePolyhedronOfInterCSurf() [1/2]

HLRBRep_ThePolyhedronOfInterCSurf::HLRBRep_ThePolyhedronOfInterCSurf	(	HLRBRep_Surface *	Surface,
		const int	nbdU,
		const int	nbdV,
		const double	U1,
		const double	V1,
		const double	U2,
		const double	V2 )

HLRBRep_ThePolyhedronOfInterCSurf() [2/2]

HLRBRep_ThePolyhedronOfInterCSurf::HLRBRep_ThePolyhedronOfInterCSurf	(	HLRBRep_Surface *	Surface,
		const NCollection_Array1< double > &	Upars,
		const NCollection_Array1< double > &	Vpars )

~HLRBRep_ThePolyhedronOfInterCSurf()

HLRBRep_ThePolyhedronOfInterCSurf::~HLRBRep_ThePolyhedronOfInterCSurf ( )

inline

Member Function Documentation

Bounding()

const Bnd_Box & HLRBRep_ThePolyhedronOfInterCSurf::Bounding

(

)

const

Give the bounding box of the MaTriangle.

ComponentsBounding()

const occ::handle< NCollection_HArray1< Bnd_Box > > & HLRBRep_ThePolyhedronOfInterCSurf::ComponentsBounding

(

)

const

Give the array of boxes. The box <n> corresponding to the triangle <n>.

Contain()

bool HLRBRep_ThePolyhedronOfInterCSurf::Contain	(	const int	Triang,
		const gp_Pnt &	ThePnt ) const

Give the plane equation of the triangle of address Triang.

DeflectionOverEstimation() [1/2]

double HLRBRep_ThePolyhedronOfInterCSurf::DeflectionOverEstimation

(

)

const

DeflectionOverEstimation() [2/2]

void HLRBRep_ThePolyhedronOfInterCSurf::DeflectionOverEstimation

(

const double

flec

)

Destroy()

void HLRBRep_ThePolyhedronOfInterCSurf::Destroy

(

)

Dump()

void HLRBRep_ThePolyhedronOfInterCSurf::Dump

(

)

const

FillBounding()

void HLRBRep_ThePolyhedronOfInterCSurf::FillBounding

(

)

Compute the array of boxes. The box <n> corresponding to the triangle <n>.

GetBorderDeflection()

double HLRBRep_ThePolyhedronOfInterCSurf::GetBorderDeflection ( ) const

inline

This method returns a border deflection.

HasUMaxSingularity()

bool HLRBRep_ThePolyhedronOfInterCSurf::HasUMaxSingularity

(

)

const

HasUMinSingularity()

bool HLRBRep_ThePolyhedronOfInterCSurf::HasUMinSingularity

(

)

const

HasVMaxSingularity()

bool HLRBRep_ThePolyhedronOfInterCSurf::HasVMaxSingularity

(

)

const

HasVMinSingularity()

bool HLRBRep_ThePolyhedronOfInterCSurf::HasVMinSingularity

(

)

const

Init() [1/2]

void HLRBRep_ThePolyhedronOfInterCSurf::Init ( HLRBRep_Surface * Surface, const double U1, const double V1, const double U2, const double V2 )

protected

Init() [2/2]

void HLRBRep_ThePolyhedronOfInterCSurf::Init ( HLRBRep_Surface * Surface, const NCollection_Array1< double > & Upars, const NCollection_Array1< double > & Vpars )

protected

IsOnBound()

bool HLRBRep_ThePolyhedronOfInterCSurf::IsOnBound	(	const int	Index1,
		const int	Index2 ) const

This method returns true if the edge based on points with indices Index1 and Index2 represents a boundary edge. It is necessary to take into account the boundary deflection for this edge.

NbPoints()

int HLRBRep_ThePolyhedronOfInterCSurf::NbPoints

(

)

const

Give the number of point in the double array of triangles ((nbdu+1)*(nbdv+1)).

NbTriangles()

int HLRBRep_ThePolyhedronOfInterCSurf::NbTriangles

(

)

const

Give the number of triangles in this double array of.

Parameters()

void HLRBRep_ThePolyhedronOfInterCSurf::Parameters	(	const int	Index,
		double &	U,
		double &	V ) const

PlaneEquation()

void HLRBRep_ThePolyhedronOfInterCSurf::PlaneEquation	(	const int	Triang,
		gp_XYZ &	NormalVector,
		double &	PolarDistance ) const

Give the plane equation of the triangle of address Triang.

Point() [1/4]

void HLRBRep_ThePolyhedronOfInterCSurf::Point	(	const gp_Pnt &	thePnt,
		const int	lig,
		const int	col,
		const double	U,
		const double	V )

Set the value of a field of the double array of points.

Point() [2/4]

const gp_Pnt & HLRBRep_ThePolyhedronOfInterCSurf::Point

(

const int

Index

)

const

Give the point of index i in the MaTriangle.

Point() [3/4]

const gp_Pnt & HLRBRep_ThePolyhedronOfInterCSurf::Point	(	const int	Index,
		double &	U,
		double &	V ) const

Give the point of index i in the MaTriangle.

Point() [4/4]

void HLRBRep_ThePolyhedronOfInterCSurf::Point	(	const int	Index,
		gp_Pnt &	P ) const

Give the point of index i in the MaTriangle.

Size()

void HLRBRep_ThePolyhedronOfInterCSurf::Size	(	int &	nbdu,
		int &	nbdv ) const

get the size of the discretization.

Triangle()

void HLRBRep_ThePolyhedronOfInterCSurf::Triangle	(	const int	Index,
		int &	P1,
		int &	P2,
		int &	P3 ) const

Give the 3 points of the triangle of address Index in the double array of triangles.

TriConnex()

int HLRBRep_ThePolyhedronOfInterCSurf::TriConnex	(	const int	Triang,
		const int	Pivot,
		const int	Pedge,
		int &	TriCon,
		int &	OtherP ) const

Give the address Tricon of the triangle connexe to the triangle of address Triang by the edge Pivot Pedge and the third point of this connexe triangle. When we are on a free edge TriCon==0 but the function return the value of the triangle in the other side of Pivot on the free edge. Used to turn around a vertex.

UMaxSingularity()

void HLRBRep_ThePolyhedronOfInterCSurf::UMaxSingularity

(

const bool

Sing

)

UMinSingularity()

void HLRBRep_ThePolyhedronOfInterCSurf::UMinSingularity

(

const bool

Sing

)

VMaxSingularity()

void HLRBRep_ThePolyhedronOfInterCSurf::VMaxSingularity

(

const bool

Sing

)

VMinSingularity()

void HLRBRep_ThePolyhedronOfInterCSurf::VMinSingularity

(

const bool

Sing

)

---

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

• HLRBRep_ThePolyhedronOfInterCSurf.hxx