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.