Owning Palette: Computational Geometry VIs
Requires: Full Development System
Computes the Delaunay triangulation of the specified points in the plane.
|X specifies the x-coordinates of the points in the plane. The length of X must be greater than or equal to 3.|
|Y specifies the y-coordinates of the points in the plane. The length of Y must equal the length of X.|
|Triangles returns an n-by-3 array, where n equals the number of triangles in the Delaunay triangulation. Each row of Triangles represents a triangle of the Delaunay triangulation, using the indexes of the input points (X, Y).|
|error returns any error or warning from the VI. You can wire error to the Error Cluster From Error Code VI to convert the error code or warning into an error cluster.|
Delaunay is a triangulation algorithm that meets the condition that no point is inside the circumcircle, which the points of the triangle determine. A unique Delaunay triangulation exists if no three points are on the same line and no four points are on the same circle.
Refer to the Voronoi and Delaunay Plot VI in the labview\examples\analysis\mathxmpl.llb for an example of using the Delaunay Triangulation VI.