How to combine sites (polygons) into groups in a Voronov diagram?

Question

Algorithms

For example, I get a Voronov diagram, that is, a linked list of edges, and I can quickly determine the neighbors to points. Now the task is to divide the entire space (for example, from 100 sites) into 10 areas and color them, the areas should be of fixed sizes, and there should not be any enclaves .
How can I get a picture like this.