|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectvisad.Delaunay
visad.DelaunayFast
public class DelaunayFast
DelaunayFast is a method of finding an imperfect triangulation or tetrahedralization of a set of samples of R^2 or R^3. It provides a substantial speed increase over the true Delaunay triangulation algorithms.
Field Summary | |
---|---|
static double |
ROTATE
Number of radians to rotate points before triangulating |
Fields inherited from class visad.Delaunay |
---|
Edges, NumEdges, Tri, Vertices, Walk |
Constructor Summary | |
---|---|
DelaunayFast(float[][] samples)
The constructor computes the triangulation |
Method Summary | |
---|---|
static void |
main(java.lang.String[] argv)
Illustrates the speed increase over other Delaunay algorithms |
Methods inherited from class visad.Delaunay |
---|
clone, factory, finish_triang, getNonConvex, improve, perturb, sampleString, scale, setNonConvex, test, toString |
Methods inherited from class java.lang.Object |
---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Field Detail |
---|
public static final double ROTATE
Constructor Detail |
---|
public DelaunayFast(float[][] samples) throws VisADException
VisADException
Method Detail |
---|
public static void main(java.lang.String[] argv) throws VisADException
VisADException
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |