public class DelaunayFast extends Delaunay
Modifier and Type | Field and Description |
---|---|
static double |
ROTATE
Number of radians to rotate points before triangulating
|
Constructor and Description |
---|
DelaunayFast(float[][] samples)
construct an approximate Delaunay triangulation of the points
in the samples array using Curtis Rueden's algorithm
|
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] argv)
Illustrates the speed increase over other Delaunay algorithms
|
clone, factory, finish_triang, getNonConvex, improve, perturb, sampleString, scale, setNonConvex, test, test, toString
public static final double ROTATE
public DelaunayFast(float[][] samples) throws VisADException
samples
- locations of points for topology - dimensioned
float[dimension][number_of_points]VisADException
- a VisAD error occurredpublic static void main(String[] argv) throws VisADException
argv
- command line argumentsVisADException
- a VisAD error occurredCopyright © 1996–2023 The SSEC Visualization Project. All rights reserved.