Compute the Delaunay triangulation of a set of points
This functionality does not run in MATLAB.
plot::delaunay computes the Delaunay triangulation
of a list of points in arbitrary dimension.
The Delaunay triangulation of a list of points is a triangulation of their convex hull such that for each edge of the triangulation, there is a circle containing the two endpoints of this edge but no other point of the list.
plot::delaunay accepts and returns
floating-point values, the actual computations take place in hardware
floating-points and are therefore not affected
by the value of
Delaunay triangulation does not introduce new points:
n0 := 10: l := [[Re, Im](exp(float(2*I*PI*n)/n0)) $ n = 1.. n0]: d := plot::delaunay(l): plot(plot::PointList2d(l, PointSize=3), plot::Polygon2d(t, Closed) $ t in d)
A list of points, which are given as lists of real values
List of simplices in the dimension of the points in
given as lists of lists of floating-point values.
plot::delaunay uses qhull from the Geometry
Center of the University of Minnesota, see www.qhull.org.