Covering a Square with up to 30 Equal Circles

Abstract

A computational method for finding good coverings of a square with equal circles is presented. The algorithm uses a quasi-Newton method with BFGS secant update to minimize the uncovered area by moving the circles. The radius of the circles is further adapted to find locally optimal coverings, and the algorithm is applied repeatedly to random initial… (More)

Topics

9 Figures and Tables

Slides referencing similar topics