Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Wolfram Mathematica Documentation Center
DOCUMENTATION CENTER SEARCH
New to Mathematica? Find your learning path »
Computational Geometry Package >
COMPUTATIONAL GEOMETRY PACKAGE SYMBOLTutorials »|See Also »|More About »

VoronoiDiagram


yields the planar Voronoi diagram of the points .

takes val to be the Delaunay triangulation vertex adjacency list.

takes hull to be the convex hull index list.
MORE INFORMATION
  • The Voronoi diagram is represented by two lists, a vertex coordinate list and a vertex adjacency list.
  • An element of the vertex adjacency list corresponds to the point , and the indices identify the vertices or rays in the vertex coordinate list which form the polygon associated with the point .
  • The optional arguments val and hull may be used to speed up the Voronoi diagram computation if the Delaunay triangulation and convex hull are available.
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF