class ROOT::Math::Delaunay2D

Function Members (Methods)

public:

	~Delaunay2D()
vector<ROOT::Math::Delaunay2D::Triangle>::const_iterator	begin() const
ROOT::Math::Delaunay2D	Delaunay2D(int n, const double* x, const double* y, const double* z, double xmin = 0, double xmax = 0, double ymin = 0, double ymax = 0)
vector<ROOT::Math::Delaunay2D::Triangle>::const_iterator	end() const
void	FindAllTriangles()
double	Interpolate(double x, double y)
Int_t	NumberOfTriangles() const
void	SetInputPoints(int n, const double* x, const double* y, const double* z, double xmin = 0, double xmax = 0, double ymin = 0, double ymax = 0)
void	SetZOuterValue(double z = 0.)
double	XMax() const
double	XMin() const
double	YMax() const
double	YMin() const
double	ZOuterValue() const

protected:

private:

ROOT::Math::Delaunay2D	Delaunay2D(const ROOT::Math::Delaunay2D&)
void	DoFindTriangles()
double	DoInterpolateNormalized(double x, double y)
void	DoNormalizePoints()
double	Linear_transform(double x, double offset, double factor)
ROOT::Math::Delaunay2D&	operator=(const ROOT::Math::Delaunay2D&)

protected:

set<UInt_t>	fCells[676]	! grid cells with containing triangles
Bool_t	fInit	!True if FindAllTriangels() has been performed
static const int	fNCells	! number of cells to divide the normalized space
Int_t	fNdt	!Number of Delaunay triangles found
Int_t	fNpoints	!Number of data points
double	fOffsetX	!Normalization offset X
double	fOffsetY	!Normalization offset Y
double	fScaleFactorX	!Normalization factor X
double	fScaleFactorY	!Normalization factor Y
ROOT::Math::Delaunay2D::Triangles	fTriangles	!Triangles of Triangulation
const double*	fX	!Pointer to X array (managed externally)
double	fXCellStep	! inverse denominator to calculate X cell = fNCells / (fXNmax - fXNmin)
vector<double>	fXN	! normalized X
double	fXNmax	!Maximum value of fXN
double	fXNmin	!Minimum value of fXN
const double*	fY	!Pointer to Y array
double	fYCellStep	! inverse denominator to calculate X cell = fNCells / (fYNmax - fYNmin)
vector<double>	fYN	! normalized Y
double	fYNmax	!Maximum value of fYN
double	fYNmin	!Minimum value of fYN
const double*	fZ	!Pointer to Z array
double	fZout	!Height for points lying outside the convex hull

Inheritance Chart:

ROOT::Math::Delaunay2D

Delaunay2D(int n, const double* x, const double* y, const double* z, double xmin = 0, double xmax = 0, double ymin = 0, double ymax = 0)

void SetInputPoints(int n, const double* x, const double* y, const double* z, double xmin = 0, double xmax = 0, double ymin = 0, double ymax = 0)

 set the input points for building the graph

double Interpolate(double x, double y)

 Return the Interpolated z value corresponding to the (x,y) point

 Find all triangles

 return the number of triangles

{return fNdt;}

double XMin() const

{return fXNmin;}

double XMax() const

{return fXNmax;}

double YMin() const

{return fYNmin;}

double YMax() const

{return fYNmax;}

void SetZOuterValue(double z = 0.)

 set z value to be returned for points  outside the region

{ fZout = z; }

double ZOuterValue() const

 return the user defined Z-outer value

{ return fZout; }

Triangles::const_iterator begin() const

 iterators on the found triangles

{ return fTriangles.begin(); }

Triangles::const_iterator end() const

{ return fTriangles.end(); }

double Linear_transform(double x, double offset, double factor)

 internal methods

 internal function to normalize the points

 internal function to find the triangle
 use Triangle or CGAL if flag is set

double DoInterpolateNormalized(double x, double y)

 internal method to compute the interpolation

 class is not copyable

unsigned int Cell(UInt_t x, UInt_t y) const

int CellX(double x) const

int CellY(double y) const