||Delaunay represents an abstract class for calculating an
N-dimensional Delaunay triangulation, that can be extended
to allow for various triangulation algorithms.
||DelaunayClarkson represents an O(N*logN) method
with high overhead to find the Delaunay triangulation
of a set of samples of R^DomainDimension.
||DelaunayFast is a method of finding an imperfect triangulation
or tetrahedralization of a set of samples of R^2 or R^3.
||DelaunayOverlap quickly constructs a triangulation of a series
of partially overlapping two-dimensional gridded sets.
||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.