Voronoi Art

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.

Given a finite set of points , the Voronoi diagram for partitions the plane into convex polygons, where each polygon contains one point of such that all the points of are closer to than to any other point of .


A picture is divided into blocks of pixels of size with at most random points, where is proportional to the mean gray level of each block. Then a Voronoi diagram is constructed for this set of points.


Contributed by: Enrique Zeleny (November 2012)
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.