Voronoi Diagrams

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

The Voronoi diagram for a set of points S in the plane is a partition of the plane into convex polygons, each of which consists of all the points in the plane closer to one particular point of S than to any other. You can also use -click (-click on Mac) with your mouse to add or delete points.

Contributed by: Ed Pegg Jr and Jeff Bryant (March 2011)
Updated by: Theodore W. Gray
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.