Sphere packing in a cube

In geometry, sphere packing in a cube is a three-dimensional sphere packing problem with the objective of packing spheres inside a cube. It is the three-dimensional equivalent of the circle packing in a square problem in two dimensions. The problem consists of determining the optimal packing of a given number of spheres inside the cube.

References[edit]

Gensane, T. (2004). "Dense Packings of Equal Spheres in a Cube". The Electronic Journal of Combinatorics. 11 (1). ISSN 1077-8926.

This geometry-related article is a stub. You can help Wikipedia by expanding it.

v t e Packing problems
Abstract packing	Bin Set
Circle packing	In a circle / equilateral triangle / isosceles right triangle / square Apollonian gasket Circle packing theorem Tammes problem (on sphere)
Sphere packing	Apollonian Finite In a sphere In a cube In a cylinder Close-packing Kissing number Sphere-packing (Hamming) bound
Other 2-D packing	Square packing
Other 3-D packing	Tetrahedron Ellipsoid
Puzzles	Conway Slothouber–Graatsma

See also[edit]

References[edit]