Hostname: page-component-77c89778f8-m42fx Total loading time: 0 Render date: 2024-07-20T11:32:01.540Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Densest Packing of Spheres in a Cube

Published online by Cambridge University Press:  20 November 2018

J. Schaer
J. Schaer*
Affiliation:
University of Alberta, Calgary
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

How many spheres of given diameter can be packed in a cube of given size? Or: What is the maximum diameter of k identical spheres if they can be packed in a cube of given size? These questions are obviously equivalent to the following problem:

Let d(Pi, Pj) denote the distance between the points Pi and Pj, and Γk the set of all configurations of k points Pi (1 ≤ i < j ≤ k) in a closed unit cube C.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 9 , Issue 3 , August 1966 , pp. 265 - 270
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Schaer, J., The densest packing of nine circles in a square.Google Scholar