Delaunay triangulation of a set of points in some n-dimensional space
[tes,ptr]=delaunay_n(S);
tes = delaunay_n(S) is a Delaunay triangulation of a set S of points in some n-dimensional space. We call S the underlying point set and n the dimension of the underlying space. A Delaunay triangulation is a simplicial complex. All simplices in the Delaunay triangulation have dimension dcur. In the nearest site Delaunay triangulation the circumsphere of any simplex in the triangulation contains no point of S in its interior. In the furthest site Delaunay triangulation the circumsphere of any simplex contains no point of S in its exterior. If the points in S are co-circular then any triangulation of S is a nearest as well as a furthest site Delaunay triangulation of S.
For more details see CGAL Manual.
Remark: you may experience robustness problems (errors, loops) because this cglab function does not yet make use of CGAL's exactness features.
This function uses the Convex_hull_d package of CGAL, which is under the QPL license. See License Terms