Delaunay represents an abstract class for calculating an
N-dimensional Delaunay triangulation, that can be extended
to allow for various triangulation algorithms.
Construct a Delaunay triangulation of the points in the
samples array, which are a sequence of 2-D grids of size
lenx * leny, and which may overlap with each other.
DelaunayWatson represents an O(N^2) method with low overhead
to find the Delaunay triangulation or tetrahedralization of
a set of samples of R^2 or R^3.
The factory class method heuristically decides which extension
to the Delaunay abstract class to use in order to construct the
fastest triangulation, and calls that extension, returning the
finished triangulation.
Generic class used to do the conversion between 4 different coordinate systems:
WGS84 coordinates
Garmin coordinates (derivative from WGS84)
User defined coordinate system (X/Y), defined by a converter class
Map coordinates (pixels), basically the user defined coordinate system
scaled to fit the desired zoom level and position to display.
increments samples coordinates by random numbers between -epsilon
and epsilon, in order to eliminate triangulation problems such as
co-linear and co-located points