

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
java.lang.Object visad.Delaunay visad.DelaunayCustom
public class DelaunayCustom
DelaunayCustom is a set of constructors to create an instance of Delaunay by passing in a precomputed 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)
construct a Delaunay from point locations and a list of triangles; call finish_triang() to fill in helper arrays (vertices, walk and edges); copy arguments 

DelaunayCustom(float[][] samples,
int[][] tri,
int[][] vertices,
int[][] walk,
int[][] edges,
int num_edges)
construct a Delaunay from point locations, a list of triangles, and helper arrays (vertices, walk and edges); copy arguments 

DelaunayCustom(float[][] samples,
int[][] tri,
int[][] vertices,
int[][] walk,
int[][] edges,
int num_edges,
boolean copy)
construct a Delaunay from point locations, a list of triangles, and helper arrays (vertices, walk and edges); copy arguments 
Method Summary  

static boolean 
checkAndFixSelfIntersection(float[][] samples)
determine if a closed path selfintersects, and remove consecutive identical points 
static boolean 
checkSelfIntersection(float[][] samples)
determine if a closed path selfintersects 
static boolean 
checkSelfIntersection(Gridded2DSet set)
determine if a closed path selfintersects 
static void 
clip(float[][] samples,
int[][] tris,
float xc,
float yc,
float v,
float[][][] outs,
int[][][] outt)
clip the topology (samples, tris) against the halfplane xc * x + yc * y <= v and return the clipped topology 
static float 
computeArea(float[][] samples)
compute the area inside a set of closed paths 
static float 
computeArea(Gridded2DSet set)
compute the area inside a set of closed paths 
static float 
computeArea(UnionSet set)
compute the area inside a set of closed paths 
static int[][] 
fill(float[][] samples)
check that 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)
check that 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 
fillCheck(Gridded2DSet set,
boolean check)
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 
fillCheck(UnionSet set,
boolean check)
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 boolean 
inside(float[][] s,
float x,
float y)
determine if a point is inside a closed path 
static float[][] 
link(float[][][] ss)
link multiple paths into a single path; this assumes that the paths in ss don't intersect each other but does test for selfintersection by each path 
Methods inherited from class visad.Delaunay 

clone, factory, finish_triang, getNonConvex, improve, perturb, sampleString, scale, setNonConvex, test, 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
samples
 locations of points for topology  dimensioned
float[dimension][number_of_points]tri
 list of triangles  dimensioned int[ntris][dim + 1]
tris values are indices into second index of samples
VisADException
 a VisAD error occurredpublic DelaunayCustom(float[][] samples, int[][] tri, int[][] vertices, int[][] walk, int[][] edges, int num_edges) throws VisADException
samples
 locations of points for topology  dimensioned
float[dimension][number_of_points]tri
 list of triangles  dimensioned int[ntris][dim + 1]
tris values are indices into second index of samplesvertices
 links from vertices to triangles/tetrahedra 
dimensioned int[number_of_points][nverts[i]]walk
 links from triangles/tetrahedra to neighboring
triangles/tetrahedra  dimensioned int[ntris][dim + 1]edges
 links from tri/tetra edges to global edge numbers 
dimensioned int[ntris][3 * (dim  1)]num_edges
 number of global edges
VisADException
 a VisAD error occurredpublic DelaunayCustom(float[][] samples, int[][] tri, int[][] vertices, int[][] walk, int[][] edges, int num_edges, boolean copy) throws VisADException
samples
 locations of points for topology  dimensioned
float[dimension][number_of_points]tri
 list of triangles  dimensioned int[ntris][dim + 1]
tris values are indices into second index of samplesvertices
 links from vertices to triangles/tetrahedra 
dimensioned int[number_of_points][nverts[i]]walk
 links from triangles/tetrahedra to neighboring
triangles/tetrahedra  dimensioned int[ntris][dim + 1]edges
 links from tri/tetra edges to global edge numbers 
dimensioned int[ntris][3 * (dim  1)]num_edges
 number of global edgescopy
 flag indicating whether to copy arrays
VisADException
 a VisAD error occurredMethod Detail 

public static boolean checkSelfIntersection(Gridded2DSet set) throws VisADException
set
 Gridded2DSet with manifold dimension = 1
VisADException
 a VisAD error occurredpublic static boolean checkSelfIntersection(float[][] samples) throws VisADException
samples
 locations of points on closed path  dimensioned
float[2][number_of_points]
VisADException
 a VisAD error occurredpublic static boolean checkAndFixSelfIntersection(float[][] samples) throws VisADException
samples
 locations of points on closed path  dimensioned
float[2][number_of_points]  may be modified on
return
VisADException
 a VisAD error occurredpublic static float computeArea(UnionSet set) throws VisADException
set
 UnionSet of Gridded2DSets with manifold dimension = 1,
interpreted as a set of closed paths
VisADException
 path self intersects or a VisAD error
occurredpublic static float computeArea(Gridded2DSet set) throws VisADException
set
 Gridded2DSet with manifold dimension = 1, interpreted
as a closed path
VisADException
 path self intersects or a VisAD error
occurredpublic static float computeArea(float[][] samples) throws VisADException
samples
 locations of points on closed path  dimensioned
float[2][number_of_points]
VisADException
 path self intersects or a VisAD error
occurredpublic static Irregular2DSet fill(Gridded2DSet set) throws VisADException
set
 Gridded2DSet with manifold dimension = 1, interpreted
as a closed path boundary
VisADException
 path self intersects or a VisAD error
occurredpublic static Irregular2DSet fillCheck(Gridded2DSet set, boolean check) throws VisADException
set
 Gridded2DSet with manifold dimension = 1, interpreted
as a closed path boundarycheck
 if true then throw a VisADException if path self
intersects, else just return null
VisADException
 path self intersects or a VisAD error
occurredpublic static int[][] fill(float[][] samples) throws VisADException
samples
 locations of points on closed path  dimensioned
float[2][number_of_points]
VisADException
 path self intersects or a VisAD error
occurredpublic static int[][] fillCheck(float[][] samples, boolean check) throws VisADException
samples
 locations of points on closed path  dimensioned
float[2][number_of_points]check
 if true then throw a VisADException if path self
intersects, else just return null
VisADException
 path self intersects or a VisAD error
occurredpublic static Irregular2DSet fill(UnionSet set) throws VisADException
set
 UnionSet of Gridded2DSets with manifold dimension = 1,
interpreted as a set of closed paths
VisADException
 path self intersects or a VisAD error
occurredpublic static Irregular2DSet fillCheck(UnionSet set, boolean check) throws VisADException
set
 UnionSet of Gridded2DSets with manifold dimension = 1,
interpreted as a set of closed pathscheck
 if true then throw a VisADException if path self
intersects, else just return null
VisADException
 path self intersects or a VisAD error
occurredpublic static float[][] link(float[][][] ss) throws VisADException
ss
 a set of paths  dimensioned
float[number_of_paths][2][number_of_points_for_path]
VisADException
 a path self intersects or a VisAD error
occurredpublic static boolean inside(float[][] s, float x, float y) throws VisADException
s
 locations of points on closed path  dimensioned
float[2][number_of_points]x
 first coordinate of pointy
 second coordinate of point
VisADException
 a VisAD error occurredpublic static void clip(float[][] samples, int[][] tris, float xc, float yc, float v, float[][][] outs, int[][][] outt) throws VisADException
samples
 locations of points for topology  dimensioned
float[dimension][number_of_points]tris
 list of triangles  dimensioned int[ntris][dim + 1]
tris values are indices into second index of samplesxc
 x coefficient in halfplane inequalityyc
 y coefficient in halfplane inequalityv
 constant in halfplane inequalityouts
 array dimensioned float[1][][] to take samples
of clipped topology  on output dimensioned
float[1][2][number_of_output_samples]outt
 array dimensioned int[1][][] to take tris
of clipped topology  on output dimensioned
int[1][number_of_output_triangles][3]
VisADException
 a VisAD error occurred


PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 