Due to the current gap in continued funding from the U.S. National Science Foundation (NSF), the NSF Unidata Program Center has temporarily paused most operations. See NSF Unidata Pause in Most Operations for details.
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: