Question: How to create Voronoi diagram with Maple?

In the simplest and most familiar case (shown in the picture), we are given a finite set of points
{p1,...,pn} in the Euclidean plane. In this case each site pk is simply a point, and its corresponding Voronoi
 cell (also called Voronoi region or Dirichlet cell) Rk consisting of all points whose distance to pk is not
greater than their distance to any other site. Each such cell is obtained from the intersection of half-spaces,
 and hence it is a convex polygon. The segments of the Voronoi diagram are all the points in the plane that are equidistant to the two nearest sites. The Voronoi vertices (nodes) are the points equidistant to three (or more) sites.

See for more details.

Please Wait...