Returns the Delaunay Triangulation of the set of points given. The triangulation is returned as an array of triples of indices into the provided points array, such that [1, 2, 3] is the triangle defined by points[1], points[2], and points[3].
Triangulates the polygon given by boundary (and optional holes), each of which is a list of Points (where holes is itself a list of such polygons). To perform the computation, the points are "flattened" to 2d based on the plane of the first 3 non- collinear points. The resulting vertices, however, are the same as those passed in. Although not required, it is recommended that the boundary points circulate counter- clockwise around the face when view from the outside, and holes circulate clockwise.
Returns the convex hull of the given points. The hull points are ordered around the perimeter as a polygon. This assumes the points are in the XY plane.