A Novel Method for Equal and Unequal Circle Packing Problem

摘要

We propose a novel method for circle packing problem. With our method, as for unequal circle packing the optimal layout is irrelevant with the position of the biggest circle, for equal circle packing we produce good solutions. In this article the algorithm is described in detail. Appropriate software has been devised and computational results are also provided and discussed.