Voronoi Art

2

3

4

5

6

7

8

9

10

2

3

4

5

seed

color

None

Given a finite set of points

S

, the Voronoi diagram for

S

partitions the plane into convex polygons, where each polygon

P

contains one point

s

P

of

S

such that all the points of

P

are closer to

s

P

than to any other point of

S

.

A picture is divided into blocks of pixels of size

n

with at most

r

random points, where

r

is proportional to the mean gray level of each block. Then a Voronoi diagram is constructed for this set of points.

Enrique Zeleny