Delaunay triangulation of a set of points in 2d space.
[tri [,ptr] ] = delaunay_2(x,y)
A Delaunay triangulation of a set of points is a triangulation of the sets of points that fulfills the following empty circle property (also called Delaunay property): the circumscribing circle of any facet of the triangulation contains no point of the set in its interior. For a point set with no case of cocircularity of more than three points, the Delaunay triangulation is unique, it is the dual of the Voronoi diagram of the points.
for more details see CGAL Manual.
This function uses the Triangulation_2 package of CGAL, which is under QPL license. See License Terms