MATLAB Mathematics - SERC - Index of

Interpolation
You can use cameramenu to rotate the figure in any direction.
Voronoi Diagrams
Given m data points in n-dimensional space, a Voronoi diagram is the partition
of n-dimensional space into m polyhedral regions, one region for each data
point. Such a region is called a Voronoi cell. A Voronoi cell satisfies the
condition that it contains all points that are closer to its data point than any
other data point in the set.
Computing a Voronoi Diagram. The voronoin function returns two outputs:
• V is an m-by-n matrix of m points in n-space. Each row of V represents a
Voronoi vertex.
• C is a cell array of vectors. Each vector in the cell array C represents a Voronoi
cell. The vector contains indices of the points in V that are the vertices of the
Voronoi cell. Each Voronoi cell may have a different number of points.
2-31