MATLAB Function Reference Volume 1: A - E - Bad Request

delaunay
2delaunay
Purpose Delaunay triangulation
Syntax TRI = delaunay(x,y)
Definition Given a set of data points, the Delaunay triangulation is a set of lines
connecting each point to its natural neighbors. The Delaunay triangulation is
related to the Voronoi diagram— the circle circumscribed about a Delaunay
triangle has its center at the vertex of a Voronoi polygon.
Description TRI = delaunay(x,y) for the data points defined by vectors x and y, returns a
set of triangles such that no data points are contained in any triangle's
circumscribed circle. Each row of the m-by-3 matrix TRI defines one such
triangle and contains indices into x and y. If the original data points are
collinear or x is empty, the triangles cannot be computed and delaunay returns
an empty matrix.
Remarks The Delaunay triangulation is used by: griddata (to interpolate scattered
data), voronoi (to compute the voronoi diagram), and is useful by itself to
create a triangular grid for scattered data points.
2-416
x
Delaunay triangle
Voronoi polygon
The functions dsearch and tsearch search the triangulation to find nearest
neighbor points or enclosing triangles, respectively.
Note delaunay is based on qhull [2]. For information about qhull, see
http://www.geom.umn.edu/software/qhull/. For copyright information, see
http://www.geom.umn.edu/software/download/COPYING.html.