Improved Domain Partitions for Variational Circle Packing

This paper presents a circle packing algorithm which converges faster by improving the domain partitions based on power diagram. By setting the area of the container fixed, we firstly shrank the input circles so that they wouldn＇t overlap when scattered randomly in the container. Secondly, we triangulated the circle center points, and divided the container area into sub-regions according to the radius ratio of adjacent circles. And then all circles grew by the same ratio within their own regions. By repeating the ＂partition-and-grow＂ operations, we finally got the packing result. Experimental results show that our method can converge more quickly.