Generates a Delauney triangulation from 2 dimensional data. The output
is a pyramid format. Duplicate points in 2 space are removed.
Input lattice of points.
Constraints: 2-D compression
Constraints: unique-compression type
output pyramid of connected faces.
If the input lattice is 3 dimensions, then the z component is ignored in
the triangulation. Since duplicate points are removed, this can lead to
a 2D surface through the 3D data, not what the user generally expects.
© The Numerical Algorithms Group Ltd, Oxford UK. 2000