a typical sphere packing problem is to find an arrangement in which the spheres fill as large a proportion of the space as possible. the proportion of space filled by the spheres is called the density of the arrangement. as the local density of a packing in an infinite space can vary depending on the volume over which it is measured, the problem is usually to maximise the average or asymptotic density, measured over a large enough volume.