NOTICE: This version of the NSF Unidata web site (archive.unidata.ucar.edu) is no longer being updated.
Current content can be found at unidata.ucar.edu.
To learn about what's going on, see About the Archive Site.
I would like to display the Delaunay triangulation of a 2-D set of points. The only example program I could find dealing with this is Region.java, in which a set of points is triangulated, then used to form an Irregular2DSet, which is then displayed. However, this shows up as a solid region bounded by the outer boundary of the triangulation, whereas I would like to see each edge of the triangulation. I succeeded in displaying a triangulation by extracting each triangle from Delaunay, then building a FlatField for each triangle by setting the y-values of the triangle versus an Irregular1DSet of the x-values. A data reference is constructed and added to the display for each of these triangle FlatFields. Before adding any data references to the display, x and y ScalarMaps are added to the display and the ranges set so that all triangles are plotted on the same scale. This works, but it doesn't seem to be a very good way to do it, and it takes several minutes just to display about 1000 triangles. What would be a better way to display a triangulation? Thanks, Neil Bomberger
visad
archives: