edu.mines.jtk.interp

Enum SibsonInterpolator2.Method

java.lang.Object

java.lang.Enum<SibsonInterpolator2.Method>

edu.mines.jtk.interp.SibsonInterpolator2.Method

All Implemented Interfaces:

java.io.Serializable, java.lang.Comparable<SibsonInterpolator2.Method>

Enclosing class:

SibsonInterpolator2

public static enum SibsonInterpolator2.Method
extends java.lang.Enum<SibsonInterpolator2.Method>

The implementation method. Methods differ in the algorithm by which Sibson coordinates (polygon areas) are computed for natural neighbors.

Enum Constant Summary

Enum Constants

Enum Constant and Description
BRAUN_SAMBRIDGE The Braun-Sambridge algorithm.
HALE_LIANG The Hale-Liang algorithm.
WATSON_SAMBRIDGE The Watson-Sambridge algorithm.

Method Summary

Methods

Modifier and Type	Method and Description
static SibsonInterpolator2.Method	valueOf(java.lang.String name) Returns the enum constant of this type with the specified name.
static SibsonInterpolator2.Method[]	values() Returns an array containing the constants of this enum type, in the order they are declared.

Methods inherited from class java.lang.Enum

clone, compareTo, equals, finalize, getDeclaringClass, hashCode, name, ordinal, toString, valueOf

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Enum Constant Detail

HALE_LIANG

public static final SibsonInterpolator2.Method HALE_LIANG

The Hale-Liang algorithm. Developed by Dave Hale and Luming Liang at the Colorado School of Mines. Accurate, robust and fast, this method is the default.

BRAUN_SAMBRIDGE

public static final SibsonInterpolator2.Method BRAUN_SAMBRIDGE

The Braun-Sambridge algorithm. Developed by Braun and Sambridge (1995), this method uses Lasserre's (1983) algorithm for computing the areas of polygons without computing their vertices. This method is much slower than the other methods provided here. It may also suffer from numerical instability due to divisions in Lasserre's algorithm.

WATSON_SAMBRIDGE

public static final SibsonInterpolator2.Method WATSON_SAMBRIDGE

The Watson-Sambridge algorithm. Developed by Watson (1992) and described further by Sambridge et al. (1995). Though simplest to implement and fast, this method is inaccurate (sometimes wildly so) at interpolation points (x1,x2) that lie on or near edges of a Delaunay triangulation of the scattered sample points.

Method Detail

values

public static SibsonInterpolator2.Method[] values()

Returns an array containing the constants of this enum type, in the order they are declared. This method may be used to iterate over the constants as follows:

for (SibsonInterpolator2.Method c : SibsonInterpolator2.Method.values())
    System.out.println(c);

Returns:

an array containing the constants of this enum type, in the order they are declared

valueOf

public static SibsonInterpolator2.Method valueOf(java.lang.String name)

Returns the enum constant of this type with the specified name. The string must match exactly an identifier used to declare an enum constant in this type. (Extraneous whitespace characters are not permitted.)

Parameters:

name - the name of the enum constant to be returned.

Returns:

the enum constant with the specified name

Throws:

java.lang.IllegalArgumentException - if this enum type has no constant with the specified name

java.lang.NullPointerException - if the argument is null