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.
Hello: Im using visad to create a Delaunay triangulation. I have two ways. *1st way: try { delaunay_ = Delaunay.factory(verteces_, true); } catch (VisADException exc) { exc.printStackTrace(); } assert delaunay_.test(verteces_);* 2nd way: try { delaunay_ = new DelaunayClarkson(verteces_); } catch (VisADException e) { e.printStackTrace(); } The first way uses the factory (that heuristically decides which method will be use), and then uses the method test. So I guess this would be quite expensive, but will provide an exact triangulation. My question is, if used this way, DelaunayClarkson could return a wrong triangulation, and if it would be faster than using the factory method (or at least always O(N*logN) ). Thank you very much
visad
archives: