TOPICS
Search

Compact Disk Packing


A compact disk packing is a packing of disks with disjoint interiors whose tangency graph, drawn by joining the disk centers, is a locally finite triangulation of the whole plane (Fernique et al. 2021, Zhang 2026). It is also called a triangulated disk packing. For disk radii r_v bounded above and bounded away from zero, define its radius ratio by

 q=(inf_(v)r_v)/(sup_(v)r_v).

Among nonuniform compact disk packings with these radius bounds, Zhang (2026) proved that the largest possible radius ratio is s=0.651050185882609..., the unique root in (0.65105018,0.65105019) of

 89s^8+1344s^7+4008s^6-464s^5-2410s^4+176s^3+296s^2-96s+1=0.

Equality holds precisely for similarity transformations of packing 53 of Fernique et al. (2021). Every nonuniform compact disk packing with radius ratio at least 0.65105 is similar to this packing, so it has exactly three disk sizes and two independent translation periods. No periodicity assumption or bound on the number of disk sizes is imposed in the theorem. This optimizes the radius ratio in the triangulated class rather than the density among arbitrary disk packings.

The proof combines geometric arguments with exact interval arithmetic exclusions. Zhang (2026) reports that ChatGPT produced the search and verification programs essential to completing these exclusions.


See also

Circle Packing, Disk, Triangulation

Explore with Wolfram|Alpha

References

Fernique, T.; Hashemi, A.; and Sizova, O. "Compact Packings of the Plane with Three Sizes of Discs." Disc. Comput. Geom. 66, 613-635, 2021. https://doi.org/10.1007/s00454-019-00166-y.Zhang, Z. "Optimal Radius Ratio of Compact Nonuniform Packings." 19 Nov 2026. https://arxiv.org/abs/2611.26189v1.

Cite this as:

Weisstein, Eric W. "Compact Disk Packing." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CompactDiskPacking.html

Subject classifications