Abstract.
A collection of non-overlapping spheres in the space is called a packing. Two spheres are said to be neighbours if they have a boundary point in common. A packing is called k-regular if each sphere has exactly k neighbours. We are concerned with the following question. What is the minimum number of not necessarily congruent spheres which may form a k-regular packing? In general, for which natural numbers n and k does there exist a connected k-regular packing of exactly n spheres?
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Eingegangen am 20. 3. 2000
Rights and permissions
About this article
Cite this article
Harborth, H., Szabó, L. & Ujváry-Menyhárt, Z. Regular sphere packings. Arch. Math. 78, 81–89 (2002). https://doi.org/10.1007/s00013-002-8219-z
Issue Date:
DOI: https://doi.org/10.1007/s00013-002-8219-z