An arrangement of non-overlapping spheres within a containing space
Sphere packing finds practical application in the stacking of cannonballs.
In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space. However, sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions (where the problem becomes circle packing in two dimensions, or hypersphere packing in higher dimensions) or to non-Euclidean spaces such as hyperbolic space.
A typical sphere packing problem is to find an arrangement in which the spheres fill as much of the space as possible. The proportion of space filled by the spheres is called the packing 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.
For equal spheres in three dimensions, the densest packing uses approximately 74% of the volume. A random packing of equal spheres generally has a density around 63.5%.[1]
^Wu, Yugong; Fan, Zhigang; Lu, Yuzhu (1 May 2003). "Bulk and interior packing densities of random close packing of hard spheres". Journal of Materials Science. 38 (9): 2019–2025. doi:10.1023/A:1023597707363. ISSN 1573-4803. S2CID 137583828.
In geometry, a spherepacking is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical...
Spherepacking in a sphere is a three-dimensional packing problem with the objective of packing a given number of equal spheres inside a unit sphere. It...
Apollonian spherepacking is the three-dimensional equivalent of the Apollonian gasket. The principle of construction is very similar: with any four spheres that...
Spherepacking in a cylinder is a three-dimensional packing problem with the objective of packing a given number of identical spheres inside a cylinder...
finite spherepacking concerns the question of how a finite number of equally-sized spheres can be most efficiently packed. The question of packing finitely...
this is called spherepacking, which usually deals only with identical spheres. The branch of mathematics generally known as "circle packing" is concerned...
structures offer the best lattice packing of spheres, and is believed to be the optimal of all packings. With 'simple' spherepackings in three dimensions ('simple'...
2 December 1984) is a Ukrainian mathematician known for her work in spherepacking. She is a full professor and Chair of Number Theory at the Institute...
block code: it is also known as the sphere-packing bound or the volume bound from an interpretation in terms of packing balls in the Hamming metric into...
n-dimensional spheres of a fixed radius in Rn so that no two spheres overlap. Lattice packings are special types of spherepackings where the spheres are centered...
Random close packing (RCP) of spheres is an empirical parameter used to characterize the maximum volume fraction of solid objects obtained when they are...
mathematical theorem about spherepacking in three-dimensional Euclidean space. It states that no arrangement of equally sized spheres filling space has a greater...
In crystallography, atomic packing factor (APF), packing efficiency, or packing fraction is the fraction of volume in a crystal structure that is occupied...
spheres therefore must not intersect, we are faced with the problem of spherepacking. How many distinct codewords can we pack into our n{\displaystyle n}-bit...
unit spheres that can be arranged in that space such that they each touch a common unit sphere. For a given spherepacking (arrangement of spheres) in...
In geometry, spherepacking in a cube is a three-dimensional spherepacking problem with the objective of packingspheres inside a cube. It is the three-dimensional...
contributions are in the fields of combinatorics, error-correcting codes, and spherepacking. Sloane is best known for being the creator and maintainer of the On-Line...
\right)\right)+o\left(1\right)} Block codes are tied to the spherepacking problem which has received some attention over the years. In two dimensions...
defines the translative packing constant of that body. Atomic packing factor Spherepacking List of shapes with known packing constant Groemer, H. (1986)...
honeycombs, the tesseractic honeycomb corresponds to a spherepacking of edge-length-diameter spheres centered on each vertex, or (dually) inscribed in each...
the 'inspheres' of their polyhedra. Circumscribed sphere Inscribed circle Midsphere Spherepacking Coxeter, H.S.M. Regular Polytopes 3rd Edn. Dover (1973)...
on the density of spherepackings using the Poisson summation formula, which subsequently led to a proof of optimal spherepackings in dimension 8 and...
Romik published a paper simplifying Maryna Viazovska's solution to the spherepacking problem in dimension 8. Viazovska's original solution relied on computer...
complex which is homeomorphic to the sphere. The circle packing theorem guarantees the existence of a circle packing with finitely many circles whose intersection...
However, spherepacking problems can be generalised to consider unequal spheres, n-dimensional Euclidean space (where the problem becomes circle packing in...
Global Information