TriangulatedGridder2D Class Reference

Uses Delaunay triangulation to find a points neighbors and does inverse distance between the neighbors. More...

Inheritance diagram for TriangulatedGridder2D:

Public Member Functions
	TriangulatedGridder2D ()
	TriangulatedGridder2D (const TriangulatedGridder2D &)
	~TriangulatedGridder2D ()
bool	allPointsAreRelevant () const
Gridder2D *	clone () const
bool	getWeights (const Coord &, TypeSet< double > &weights, TypeSet< int > &relevantpoints) const
void	setGridArea (const Interval< float > &, const Interval< float > &)
Public Member Functions inherited from Gridder2D
virtual	~Gridder2D ()
virtual bool	areWeightsValuesDependent () const
virtual void	fillPar (IOPar &) const
const TypeSet< Coord > *	getPoints () const
virtual float	getValue (const Coord &, const TypeSet< double > *weights=0, const TypeSet< int > *relevantpoints=0) const
	Does the gridding. More...
const TypeSet< float > *	getValues () const
virtual bool	isPointUsable (const Coord &cpt, const Coord &dpt) const
virtual bool	operator== (const Gridder2D &) const
bool	setPoints (const TypeSet< Coord > &)
bool	setPoints (const TypeSet< Coord > &, TaskRunner *)
virtual void	setTrend (PolyTrend::Order)
bool	setValues (const TypeSet< float > &)
virtual bool	usePar (const IOPar &)
virtual bool	wantsAllPoints () const
	If false, points should be tested with isPointUsable. More...

Protected Member Functions
bool	pointsChangedCB (CallBacker *)
Protected Member Functions inherited from Gridder2D
	Gridder2D ()
	Gridder2D (const Gridder2D &)
float	getDetrendedValue (int idx) const
bool	isAtInputPos (const Coord &, int &idx) const
virtual void	valuesChangedCB (CallBacker *)

Protected Attributes
Coord	center_
Triangle2DInterpolator *	interpolator_
DAGTriangleTree *	triangles_
Interval< float >	xrg_
Interval< float >	yrg_
Protected Attributes inherited from Gridder2D
const TypeSet< Coord > *	points_
PolyTrend *	trend_
TypeSet< int >	usedpoints_
const TypeSet< float > *	values_

Detailed Description

Uses Delaunay triangulation to find a points neighbors and does inverse distance between the neighbors.

<>

Constructor & Destructor Documentation

TriangulatedGridder2D() [1/2]

TriangulatedGridder2D::TriangulatedGridder2D

(

)

TriangulatedGridder2D() [2/2]

TriangulatedGridder2D::TriangulatedGridder2D

(

const TriangulatedGridder2D &

)

~TriangulatedGridder2D()

TriangulatedGridder2D::~TriangulatedGridder2D

(

)

Member Function Documentation

allPointsAreRelevant()

bool TriangulatedGridder2D::allPointsAreRelevant ( ) const

virtual

Implements Gridder2D.

clone()

Gridder2D* TriangulatedGridder2D::clone ( ) const

virtual

Implements Gridder2D.

getWeights()

bool TriangulatedGridder2D::getWeights ( const Coord &  , TypeSet< double > &  weights, TypeSet< int > &  relevantpoints  ) const

virtual

Only use this if multiple setValues() are called for the same setPoints() The output weights and pointset must then be provided to the getValue function

Implements Gridder2D.

pointsChangedCB()

bool TriangulatedGridder2D::pointsChangedCB ( CallBacker *  )

protectedvirtual

Reimplemented from Gridder2D.

setGridArea()

void TriangulatedGridder2D::setGridArea ( const Interval< float > &  , const Interval< float > &    )

virtual

Given that we want to calculate cpt, is data at dpt usable. Tells gridder that you will not call setGridPoint outside these ranges. May speed up calculation.

Reimplemented from Gridder2D.

Member Data Documentation

center_

Coord TriangulatedGridder2D::center_

protected

interpolator_

Triangle2DInterpolator* TriangulatedGridder2D::interpolator_

protected

triangles_

DAGTriangleTree* TriangulatedGridder2D::triangles_

protected

xrg_

Interval<float> TriangulatedGridder2D::xrg_

protected

yrg_

Interval<float> TriangulatedGridder2D::yrg_

protected