Uses of Class
visad.Delaunay

Packages that use Delaunay

visad

Uses of Delaunay in visad

Subclasses of Delaunay in visad

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

Methods in visad that return Delaunay

static Delaunay

Delaunay.factory(float[][] samples, boolean exact) 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.