#include <InterpKernelGeo2DComposedEdge.hxx>

Inheritance diagram for INTERP_KERNEL.ComposedEdge:

Public Member Functions
	ComposedEdge ()
	ComposedEdge (const ComposedEdge &other)
	ComposedEdge (int size)
void	reverse ()
int	recursiveSize () const
void	initLocations () const
ComposedEdge *	clone () const
bool	isNodeIn (Node *n) const
double	getArea () const
double	getPerimeter () const
double	getHydraulicDiameter () const
void	getBarycenter (double *bary) const
void	getBarycenterGeneral (double *bary) const
double	normalize (ComposedEdge *other, double &xBary, double &yBary)
void	fillBounds (Bounds &output) const
void	applySimilarity (double xBary, double yBary, double dimChar)
void	applyGlobalSimilarity (double xBary, double yBary, double dimChar)
void	dispatchPerimeter (double &partConsidered) const
void	dispatchPerimeterExcl (double &partConsidered, double &commonPart) const
double	dispatchPerimeterAdv (const ComposedEdge &father, std::vector< double > &result) const
void	getAllNodes (std::set< Node * > &output) const
void	getBarycenter (double *bary, double &weigh) const
bool	completed () const
void	setValueAt (int i, Edge *e, bool direction=true)
double	getCommonLengthWith (const ComposedEdge &other) const
void	clear ()
bool	empty () const
ElementaryEdge *	front () const
ElementaryEdge *	back () const
void	resize (int i)
void	pushBack (Edge *edge, bool direction=true)
void	pushBack (ElementaryEdge *elem)
void	pushBack (ComposedEdge *elem)
int	size () const
ElementaryEdge *	operator[] (int i) const
Node *	getEndNode () const
Node *	getStartNode () const
bool	changeEndNodeWith (Node *node) const
bool	changeStartNodeWith (Node *node) const
void	dumpInXfigFile (std::ostream &stream, int resolution, const Bounds &box) const
bool	isInOrOut (Node *nodeToTest) const
bool	getDirection () const
bool	intresincEqCoarse (const Edge *other) const
Static Public Member Functions
static void	Delete (ComposedEdge *pt)
static void	SoftDelete (ComposedEdge *pt)
Protected Member Functions
	~ComposedEdge ()
Protected Attributes
std::list< ElementaryEdge * >	_sub_edges
Private Member Functions
std::list< ElementaryEdge * > *	getListBehind ()
void	clearAll (std::list< ElementaryEdge * >::iterator startToDel)
Friends
class	IteratorOnComposedEdge

Constructor & Destructor Documentation

INTERP_KERNEL.ComposedEdge.ComposedEdge ( )

ComposedEdge::ComposedEdge ( const ComposedEdge & other )

References INTERP_KERNEL.ComposedEdge._sub_edges.

INTERP_KERNEL.ComposedEdge.ComposedEdge ( int size )

ComposedEdge::~ComposedEdge ( ) [protected]

References INTERP_KERNEL.ComposedEdge._sub_edges, and INTERP_KERNEL.ComposedEdge.clearAll().

Member Function Documentation

static void INTERP_KERNEL.ComposedEdge.Delete ( ComposedEdge * pt ) [static]

static void INTERP_KERNEL.ComposedEdge.SoftDelete ( ComposedEdge * pt ) [static]

References INTERP_KERNEL.ComposedEdge._sub_edges.

void ComposedEdge::reverse ( )

References INTERP_KERNEL.ComposedEdge._sub_edges.

int INTERP_KERNEL.ComposedEdge.recursiveSize ( ) const

void ComposedEdge::initLocations ( ) const

References INTERP_KERNEL.ComposedEdge._sub_edges.

ComposedEdge * ComposedEdge::clone ( ) const

References INTERP_KERNEL.ComposedEdge.ComposedEdge().

bool ComposedEdge::isNodeIn ( Node * n ) const

References INTERP_KERNEL.ComposedEdge._sub_edges, and testMEDMEM.ret.

double ComposedEdge::getArea ( ) const

This method computes the area of 'this'. By definition :

$Area=\int_{Polygon} dS$

Thanks to Green's theorem we have.

$\int_{Polygon} x \cdot dS=\sum_{0 \leq i < nb of edges} -\int_{Edge_{i}}ydx=\sum_{0 \leq i < nb of edges} AreaOfZone_{Edge_{i}}$

Where $AreaOfZone_{i}$ is computed virtually by INTERP_KERNEL.Edge.getAreaOfZone with following formula :

$AreaOfZone_{i}=\int_{Edge_{i}} -ydx$

References INTERP_KERNEL.ComposedEdge._sub_edges, and testMEDMEM.ret.

double ComposedEdge::getPerimeter ( ) const

References INTERP_KERNEL.ComposedEdge._sub_edges, and testMEDMEM.ret.

double ComposedEdge::getHydraulicDiameter ( ) const

References INTERP_KERNEL.ComposedEdge.getArea(), and INTERP_KERNEL.ComposedEdge.getPerimeter().

void ComposedEdge::getBarycenter ( double * bary ) const

This method computes barycenter of 'this' by returning xG in bary[0] and yG in bary[1]. By definition :

$Area \cdot x_{G}=\int_{Polygon} x \cdot dS$

$Area \cdot y_{G}=\int_{Polygon} y \cdot dS$

Thanks to Green's theorem we have.

$\int_{Polygon} x \cdot dS=\sum_{0 \leq i < nb of edges} -\int_{Edge_{i}}yxdx$

$\int_{Polygon} y \cdot dS=\sum_{0 \leq i < nb of edges} -\int_{Edge_{i}}\frac{y^{2}}{2}dx$

Area is computed using the same principle than described in INTERP_KERNEL.ComposedEdge.getArea method. $-\int_{Edge_{i}}yxdx$ and $-\int_{Edge_{i}}\frac{y^{2}}{2}dx$ are computed virtually with INTERP_KERNEL.Edge.getBarycenterOfZone.

References INTERP_KERNEL.ComposedEdge._sub_edges, and med_test1.area.

void ComposedEdge::getBarycenterGeneral ( double * bary ) const

Idem ComposedEdge.getBarycenter except that the special case where _sub_edges==1 is dealt here.

References INTERP_KERNEL.ComposedEdge._sub_edges, and INTERP_KERNEL.ComposedEdge.getBarycenter().

double ComposedEdge::normalize	(	ComposedEdge *	other,
		double &	xBary,
		double &	yBary
	)

References INTERP_KERNEL.ComposedEdge.applyGlobalSimilarity(), testGaussLocalization.b, INTERP_KERNEL.ComposedEdge.fillBounds(), INTERP_KERNEL.Bounds.getBarycenter(), INTERP_KERNEL.Bounds.getCaracteristicDim(), and INTERP_KERNEL.Bounds.prepareForAggregation().

void ComposedEdge::fillBounds ( Bounds & output ) const

References INTERP_KERNEL.ComposedEdge._sub_edges.

void ComposedEdge::applySimilarity	(	double	xBary,
		double	yBary,
		double	dimChar
	)

WARNING : applies similarity ONLY on edges without any change on Nodes. To perform a global similarity call applyGlobalSimilarity.

References INTERP_KERNEL.ComposedEdge._sub_edges.

void ComposedEdge::applyGlobalSimilarity	(	double	xBary,
		double	yBary,
		double	dimChar
	)

Perform Similarity transformation on all elements of this Nodes and Edges.

References INTERP_KERNEL.ComposedEdge._sub_edges, and INTERP_KERNEL.ComposedEdge.getAllNodes().

void ComposedEdge::dispatchPerimeter ( double & partConsidered ) const

This method append to param 'partConsidered' the part of length of subedges IN or ON.

Parameters:

partConsidered INOUT param.

References INTERP_KERNEL.ComposedEdge._sub_edges, INTERP_KERNEL.FULL_IN_1, and INTERP_KERNEL.FULL_ON_1.

void ComposedEdge::dispatchPerimeterExcl	(	double &	partConsidered,
		double &	commonPart
	)		const

Idem dispatchPerimeterExcl except that when a subedge is declared as ON this subedge is counted in commonPart.

References INTERP_KERNEL.ComposedEdge._sub_edges, INTERP_KERNEL.FULL_IN_1, and INTERP_KERNEL.FULL_ON_1.

double INTERP_KERNEL.ComposedEdge.dispatchPerimeterAdv	(	const ComposedEdge &	father,
		std::vector< double > &	result
	)		const

void ComposedEdge::getAllNodes ( std::set< Node * > & output ) const

References INTERP_KERNEL.ComposedEdge._sub_edges.

void ComposedEdge::getBarycenter	(	double *	bary,
		double &	weigh
	)		const

References INTERP_KERNEL.ComposedEdge._sub_edges.

bool INTERP_KERNEL.ComposedEdge.completed ( ) const

void ComposedEdge::setValueAt	(	int	i,
		Edge *	e,
		bool	direction = `true`
	)

References INTERP_KERNEL.ComposedEdge._sub_edges, and Med_Gen_test.it.

double ComposedEdge::getCommonLengthWith ( const ComposedEdge & other ) const

References INTERP_KERNEL.ComposedEdge._sub_edges, INTERP_KERNEL.ElementaryEdge.getCurveLength(), and testMEDMEM.ret.

void ComposedEdge::clear ( )

References INTERP_KERNEL.ComposedEdge._sub_edges, and INTERP_KERNEL.ComposedEdge.clearAll().

bool INTERP_KERNEL.ComposedEdge.empty ( ) const

ElementaryEdge* INTERP_KERNEL.ComposedEdge.front ( ) const

ElementaryEdge* INTERP_KERNEL.ComposedEdge.back ( ) const

void INTERP_KERNEL.ComposedEdge.resize ( int i )

void ComposedEdge::pushBack	(	Edge *	edge,
		bool	direction = `true`
	)

References INTERP_KERNEL.ComposedEdge._sub_edges.

void ComposedEdge::pushBack ( ElementaryEdge * elem )

References INTERP_KERNEL.ComposedEdge._sub_edges.

void ComposedEdge::pushBack ( ComposedEdge * elem )

References INTERP_KERNEL.ComposedEdge._sub_edges, and INTERP_KERNEL.ComposedEdge.getListBehind().

int INTERP_KERNEL.ComposedEdge.size ( ) const

ElementaryEdge * ComposedEdge::operator[] ( int i ) const

References INTERP_KERNEL.ComposedEdge._sub_edges.

Node * ComposedEdge::getEndNode ( ) const

References INTERP_KERNEL.ComposedEdge._sub_edges.

Node * ComposedEdge::getStartNode ( ) const

References INTERP_KERNEL.ComposedEdge._sub_edges.

bool ComposedEdge::changeEndNodeWith ( Node * node ) const

References INTERP_KERNEL.ComposedEdge._sub_edges.

bool ComposedEdge::changeStartNodeWith ( Node * node ) const

References INTERP_KERNEL.ComposedEdge._sub_edges.

void ComposedEdge::dumpInXfigFile	(	std::ostream &	stream,
		int	resolution,
		const Bounds &	box
	)		const

Reimplemented in INTERP_KERNEL.QuadraticPolygon.

References INTERP_KERNEL.ComposedEdge._sub_edges.

bool ComposedEdge::isInOrOut ( Node * nodeToTest ) const

References INTERP_KERNEL.ComposedEdge._sub_edges, testGaussLocalization.b, INTERP_KERNEL.Edge.buildIntersectorWith(), INTERP_KERNEL.Edge.decrRef(), TestMedCorba4.e1, INTERP_KERNEL.ComposedEdge.fillBounds(), INTERP_KERNEL.ComposedEdge.getAllNodes(), INTERP_KERNEL.EdgeLin.getCharactValue(), INTERP_KERNEL.ElementaryEdge.getPtr(), INTERP_KERNEL.Node.getSlope(), INTERP_KERNEL.Bounds.nearlyWhere(), nodes, INTERP_KERNEL.ON_1, INTERP_KERNEL.OUT, INTERP_KERNEL.Bounds.prepareForAggregation(), and testMEDMEM.ret.

bool ComposedEdge::getDirection ( ) const

bool ComposedEdge::intresincEqCoarse ( const Edge * other ) const

References INTERP_KERNEL.ComposedEdge._sub_edges.

std::list<ElementaryEdge *>* INTERP_KERNEL.ComposedEdge.getListBehind ( ) [private]

void ComposedEdge::clearAll ( std::list< ElementaryEdge * >::iterator startToDel ) [private]

References INTERP_KERNEL.ComposedEdge._sub_edges.

Friends And Related Function Documentation

friend class IteratorOnComposedEdge [friend]

Field Documentation

std::list<ElementaryEdge *> INTERP_KERNEL.ComposedEdge._sub_edges [protected]

INTERP_KERNEL.ComposedEdge Class Reference

Public Member Functions

Static Public Member Functions

Protected Member Functions

Protected Attributes

Private Member Functions

Friends

Constructor & Destructor Documentation

Member Function Documentation

Friends And Related Function Documentation

Field Documentation