|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object visad.Delaunay visad.DelaunayClarkson
public 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.
Field Summary |
---|
Fields inherited from class visad.Delaunay |
---|
Edges, NumEdges, Tri, Vertices, Walk |
Constructor Summary | |
---|---|
DelaunayClarkson(float[][] samples)
construct a Delaunay triangulation of the points in the samples array using Clarkson's algorithm |
Method Summary |
---|
Methods inherited from class visad.Delaunay |
---|
factory, finish_triang, getNonConvex, improve, perturb, sampleString, scale, setNonConvex, test, test, toString |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public DelaunayClarkson(float[][] samples) throws VisADException
samples
- locations of points for topology - dimensioned
float[dimension][number_of_points]
VisADException
- a VisAD error occurred
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |