Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650463 | Discrete Mathematics | 2008 | 16 Pages |
Abstract
In this paper we consider the problem of packing a set of d-dimensional congruent cubes into a sphere of smallest radius. We describe and investigate an approach based on a function Ï called the maximal inflation function. In the three-dimensional case, we localize the contact between two inflated cubes and we thus improve the efficiency of calculating Ï. This approach and a stochastic algorithm are used to find dense packings of cubes in 3 dimensions up to n=20. For example, we obtain a packing of eight cubes that improves on the cubic lattice packing.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Thierry Gensane, Philippe Ryckelynck,