Computes the Delaunay triangulation of the specified points in the plane.
Y-coordinates of the points in the plane. You must specify the same number of elements in y and x.
Error conditions that occur before this node runs.
The node responds to this input according to standard error behavior.
Standard Error Behavior
Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.
Default: No error
An n-by-3 array of indexes of the input points that form a Delaunay triangulation, where n is the number of triangles in the Delaunay triangulation. Each row of triangles represents a triangle defined by the three indexed points.
Error information.
The node produces this output according to standard error behavior.
Standard Error Behavior
Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.
Delaunay is a triangulation algorithm that meets the condition that no point is inside the circumcircle of any triangle.
A unique Delaunay triangulation exists if there is no combination of four points that are on the same circle.
Where This Node Can Run:
Desktop OS: Windows
FPGA: Not supported
Web Server: Not supported in VIs that run in a web application