I am looking for an algorithm that I can apply for a random tessellation of polygons with different areas. The algorithm can relax the geometry of the polygons to a condition that all of them would have the same area!
Someone should have faced this problem. The simplest case is that all the polygons have the same number of edges. In that case, one can find the relationship between the periphery and the area. However, the algorithm should work for general case with polygons with different number of edges.
I would appreciate if you guys give me some hints or link me to some related studies that might exist in the field of graph, computational geometry and mathematics.