Algorithm Outline

V0.2

Definitions

Definition 1: A Voronoi edge is called 'red' iff the points in the adjacent areas are red

Outline

Given a set R of red and blue points, initially containing red ones only.

1. Calculate the Voronoi graph of R.

2. Find a Delaunay circle for each red Voronoi edge, the smallest. Put them into a set C of circles.

3. Get the arrangement faces of C in a suitable format to store information like which face covers which circles.

4. Find a minimal set M of faces which covers each circle.

5. Remove all blue points in R.

6. For each face in M add a blue points to R.

7. Calculate the Voronoi graph of R again.

8. Continue with step 1 if there are red edges.