Producing dense packings of cubes (Q2519836): Difference between revisions

The problemt of packing a set of \(n\) \(d\)-dimensional congruent cubes into a sphere of smallest radius is considered. An earlier method of the same authors for the \(d\)-dimensional case is adapted and generalized, but used only for \(d= 3\), up to \(n=20\). The main steps of algorithm are: \(\bullet\) Choose randomly \(n\) non-overlapping-cubes inside the unit ball \(K\). \(\bullet\) Move randomly the \(n\) cubes without overlap inside \(K\) and inflate them if it is possible. Continue until the packing is jammed. The approach is based on a function \(\psi\) called the maximal inflation function. In this paper, the efficiency of calculating \(\psi\) is improved.