# Circle packing

This article describes the packing of circles on surfaces. For the related article on circle packing with a prescribed intersection graph, please see the circle packing theorem.
The most efficient way to pack different-sized circles together is not obvious.

In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that all circles touch one another. The associated packing density, η, of an arrangement is the proportion of the surface covered by the circles. Generalisations can be made to higher dimensions – this is called sphere packing, which usually deals only with identical spheres.

While the circle has a relatively low maximum packing density of 0.9069 on the Euclidean plane, it does not have the lowest possible. The "worst" shape to pack onto a plane is not known, but the smoothed octagon has a packing density of about 0.902414, which is the lowest maximum packing density known of any centrally-symmetric convex shape.[1] Packing densities of concave shapes such as star polygons can be arbitrarily small.

The branch of mathematics generally known as "circle packing" is concerned with the geometry and combinatorics of packings of arbitrarily-sized circles: these give rise to discrete analogs of conformal mapping, Riemann surfaces and the like.

## Packings in the plane

Identical circles in a hexagonal packing arrangement, the densest packing possible.
Hexagonal packing through natural arrangement of equal circles with transitions to an irregular arrangement of unequal circles.

In two dimensional Euclidean space, Joseph Louis Lagrange proved in 1773 that the highest-density lattice arrangement of circles is the hexagonal packing arrangement,[2] in which the centres of the circles are arranged in a hexagonal lattice (staggered rows, like a honeycomb), and each circle is surrounded by 6 other circles. The density of this arrangement is

${\displaystyle \eta _{h}={\frac {\pi }{2{\sqrt {3}}}}\approx 0.9069.}$

Axel Thue provided the first proof that this was optimal in 1890, showing that the hexagonal lattice is the densest of all possible circle packings, both regular and irregular. However, his proof was considered by some to be incomplete. The first rigorous proof is attributed to László Fejes Tóth in 1940.[2]

At the other extreme, very low density arrangements of rigidly packed circles have been identified.

### Uniform packings

There are 11 circle packings based on the 11 uniform tilings of the plane.[3] In these packings, every circle can be mapped to every other circle by reflections and rotations. The hexagonal gaps can be filled by one circle and the dodecagonal gaps can be filled with 7 circles, creating 3-uniform packings. The truncated trihexagonal tiling with both types of gaps can be filled as a 4-uniform packing. The snub hexagonal tiling has two mirror-image forms.

 Triangular Square Hexagonal Elongated triangular Trihexagonal Snub square Truncated square Truncated hexagonal Rhombitrihexagonal Snub hexagonal Snub hexagonal (mirrored) Truncated trihexagonal

## Packings on the sphere

A related problem is to determine the lowest-energy arrangement of identically interacting points that are constrained to lie within a given surface. The Thomson problem deals with the lowest energy distribution of identical electric charges on the surface of a sphere. The Tammes problem is a generalisation of this, dealing with maximising the minimum distance between circles on sphere. This is analogous to distributing non-point charges on a sphere.

## Packings in bounded areas

Fifteen equal circles packed within the smallest possible square. Only four equilateral triangles are formed by adjacent circles.

Packing circles in simple bounded shapes is a common type of problem in recreational mathematics. The influence of the container walls is important, and hexagonal packing is generally not optimal for small numbers of circles.

## Unequal circles

A compact binary circle packing with the most similarly sized circles possible.[4] It is also the densest possible packing of discs with this size ratio (ratio of 0.6375559772 with packing fraction (area density) of 0.910683).[5]

There are also a range of problems which permit the sizes of the circles to be non-uniform. One such extension is to find the maximum possible density of a system with two specific sizes of circle (a binary system). Only nine particular radius ratios permit compact packing, which is when every pair of circles in contact is in mutual contact with two other circles (when line segments are drawn from contacting circle-center to circle-center, they triangulate the surface).[4] For seven of these radius ratios a compact packing is known that achieves the maximum possible packing fraction (above that of uniformly-sized discs) for mixtures of discs with that radius ratio. The highest packing density is 0.911627478 for a radius ratio of 0.545151042·[5][6]

It is also known that if the radius ratio is above 0.742, a binary mixture cannot pack better than uniformly-sized discs.[5] Upper bounds for the density that can be obtained in such binary packings at smaller ratios have also been obtained.[7]

## Applications of circle packing

Quadrature amplitude modulation is based on packing circles into circles within a phase-amplitude space. A modem transmits data as a series of points in a 2-dimensional phase-amplitude plane. The spacing between the points determines the noise tolerance of the transmission, while the circumscribing circle diameter determines the transmitter power required. Performance is maximized when the constellation of code points are at the centres of an efficient circle packing. In practice, suboptimal rectangular packings are often used to simplify decoding.

Circle packing has become an essential tool in origami design, as each appendage on an origami figure requires a circle of paper.[8] Robert J. Lang has used the mathematics of circle packing to develop computer programs that aid in the design of complex origami figures.