class TGraphDelaunay: public TNamed

 TGraphDelaunay default constructor

 TGraphDelaunay normal constructor

 TGraphDelaunay destructor.

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

 Function used internally only. It creates the data structures needed to
 compute the Delaunay triangles.

 Is point e inside the triangle t1-t2-t3 ?

 Files the triangle defined by the 3 vertices p, n and m into the
 fxTried arrays. If these arrays are to small they are automatically
 expanded.

 Attempt to find all the Delaunay triangles of the point set. It is not
 guaranteed that it will fully succeed, and no check is made that it has
 fully succeeded (such a check would be possible by referencing the points
 that make up the convex hull). The method is to check if each triangle
 shares all three of its sides with other triangles. If not, a point is
 generated just outside the triangle on the side(s) not shared, and a new
 triangle is found for that point. If this method is not working properly
 (many triangles are not being found) it's probably because the new points
 are too far beyond or too close to the non-shared sides. Fiddling with
 the size of the `alittlebit' parameter may help.

 Finds those points which make up the convex hull of the set. If the xy
 plane were a sheet of wood, and the points were nails hammered into it
 at the respective coordinates, then if an elastic band were stretched
 over all the nails it would form the shape of the convex hull. Those
 nails in contact with it are the points that make up the hull.

 Is point e inside the hull defined by all points apart from x ?

 Finds the z-value at point e given that it lies
 on the plane defined by t1,t2,t3

 Finds the Delaunay triangle that the point (xi,yi) sits in (if any) and
 calculate a z-value for it by linearly interpolating the z-values that
 make up that triangle.

 Defines the number of triangles tested for a Delaunay triangle
 (number of iterations) before abandoning the search

 Sets the histogram bin height for points lying outside the convex hull ie:
 the bins in the margin.