|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectvisad.Delaunay
visad.DelaunayCustom
public class DelaunayCustom
DelaunayCustom is a set of constructors to create an instance of Delaunay by passing in a pre-computed triangulation. DelaunayCustom is useful for creating instances of Delaunay that can be passed into IrregularSet. If you want to perform consistency checks on your triangulation, call Delaunay.test() on your DelaunayCustom object after it is constructed.
Field Summary |
---|
Fields inherited from class visad.Delaunay |
---|
Edges, NumEdges, Tri, Vertices, Walk |
Constructor Summary | |
---|---|
DelaunayCustom(float[][] samples,
int[][] tri)
shortcut constructor |
|
DelaunayCustom(float[][] samples,
int[][] tri,
int[][] vertices,
int[][] walk,
int[][] edges,
int num_edges)
complete constructor |
|
DelaunayCustom(float[][] samples,
int[][] tri,
int[][] vertices,
int[][] walk,
int[][] edges,
int num_edges,
boolean copy)
|
Method Summary | |
---|---|
static boolean |
checkAndFixSelfIntersection(float[][] samples)
return true if closed path in samples self-intersects |
static boolean |
checkSelfIntersection(float[][] samples)
return true if closed path in samples self-intersects |
static boolean |
checkSelfIntersection(Gridded2DSet set)
return true if closed path in samples self-intersects |
static void |
clip(float[][] samples,
int[][] tris,
float xc,
float yc,
float v,
float[][][] outs,
int[][][] outt)
clip (samples, tris) against xc * x + yc * c <= v |
static float |
computeArea(float[][] samples)
compute area inside closed path |
static float |
computeArea(Gridded2DSet set)
compute area inside closed path |
static float |
computeArea(UnionSet set)
compute area inside closed path |
static int[][] |
fill(float[][] samples)
check that float[2][number_of_points] samples describes the boundary of a simply connected plane region; return a decomposition of that region into triangles whose vertices are all boundary points from samples; the trick is that the region may not be convex, but the triangles must all lie inside the region |
static Irregular2DSet |
fill(Gridded2DSet set)
check that set describes the boundary of a simply connected plane region; return a decomposition of that region into triangles whose vertices are all boundary points from samples, as an Irregular2DSet |
static Irregular2DSet |
fill(UnionSet set)
check that set describes the boundary of a simply connected plane region; return a decomposition of that region into triangles whose vertices are all boundary points from samples, as an Irregular2DSet |
static int[][] |
fillCheck(float[][] samples,
boolean check)
|
static Irregular2DSet |
fillCheck(Gridded2DSet set,
boolean check)
|
static Irregular2DSet |
fillCheck(UnionSet set,
boolean check)
|
static boolean |
inside(float[][] s,
float x,
float y)
determine if (x, y) is inside the closed path defined by s |
static float[][] |
link(float[][][] ss)
link multiple paths into a single path |
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 |
Constructor Detail |
---|
public DelaunayCustom(float[][] samples, int[][] tri) throws VisADException
VisADException
public DelaunayCustom(float[][] samples, int[][] tri, int[][] vertices, int[][] walk, int[][] edges, int num_edges) throws VisADException
VisADException
public DelaunayCustom(float[][] samples, int[][] tri, int[][] vertices, int[][] walk, int[][] edges, int num_edges, boolean copy) throws VisADException
VisADException
Method Detail |
---|
public static boolean checkSelfIntersection(Gridded2DSet set) throws VisADException
VisADException
public static boolean checkSelfIntersection(float[][] samples) throws VisADException
VisADException
public static boolean checkAndFixSelfIntersection(float[][] samples) throws VisADException
VisADException
public static float computeArea(UnionSet set) throws VisADException
VisADException
public static float computeArea(Gridded2DSet set) throws VisADException
VisADException
public static float computeArea(float[][] samples) throws VisADException
VisADException
public static Irregular2DSet fill(Gridded2DSet set) throws VisADException
VisADException
public static Irregular2DSet fillCheck(Gridded2DSet set, boolean check) throws VisADException
VisADException
public static int[][] fill(float[][] samples) throws VisADException
VisADException
public static int[][] fillCheck(float[][] samples, boolean check) throws VisADException
VisADException
public static Irregular2DSet fill(UnionSet set) throws VisADException
VisADException
public static Irregular2DSet fillCheck(UnionSet set, boolean check) throws VisADException
VisADException
public static float[][] link(float[][][] ss) throws VisADException
VisADException
public static boolean inside(float[][] s, float x, float y) throws VisADException
VisADException
public static void clip(float[][] samples, int[][] tris, float xc, float yc, float v, float[][][] outs, int[][][] outt) throws VisADException
VisADException
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |