Documentation of 'visad.DelaunayFast' Java class
DelaunayFast
visad

Class DelaunayFast

  • All Implemented Interfaces:
    java.io.Serializable


    public class DelaunayFast
    extends Delaunay
    DelaunayFast is a method of finding an imperfect triangulation or tetrahedralization of a set of samples of R^2 or R^3. It provides a substantial speed increase over the true Delaunay triangulation algorithms.

    See Also:
    Serialized Form
    • Field Detail

      • ROTATE

        public static final double ROTATE
        Number of radians to rotate points before triangulating
        See Also:
        Constant Field Values
    • Constructor Detail

      • DelaunayFast

        public DelaunayFast(float[][] samples)
                     throws VisADException
        construct an approximate Delaunay triangulation of the points in the samples array using Curtis Rueden's algorithm
        Parameters:
        samples - locations of points for topology - dimensioned float[dimension][number_of_points]
        Throws:
        VisADException - a VisAD error occurred
    • Method Detail

      • main

        public static void main(java.lang.String[] argv)
                         throws VisADException
        Illustrates the speed increase over other Delaunay algorithms
        Parameters:
        argv - command line arguments
        Throws:
        VisADException - a VisAD error occurred

DMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.