The best known packings of unequal circles with radii of i-1/5, i=1,2,3,..., in a circle (complete up to N = 64)


Last update: 01-Jun-2024

Overview    Download    Results    History of updates    References

Overview

5-16   17-28   29-40   41-50   53-64  

Download

You may download ASCII files which contain all the values of radius, ratio etc. by using the links given in the table header below.
All coordinates of all packings are packed as ASCII files here.
All packings are stored as nice PDF files here.
All contact graphs of all packings are stored as nice PDF files here.
  For industrial applications, for instance if a machine has to do an important job at every circle center,
it is useful to know a tour visiting each of the circle centers once which is of minimal length.
This problem is known as the "Traveling Salesman Problem" (TSP). Thus (very near) optimal tours are provided for every packing.
All optimal TSP tours of all packings are stored as nice PDF files here.

Results

The table below summarizes the current status of the search.
Please use the links in the following table to view a picture for a certain configuration.
Furthermore, note that for certain values of N several distinct optimal configurations exist; however, only one is shown here.
Proven optimal packings are indicated by a radius in bold face type.

Legend:
N
the number of circles; colors correspond to active researchers in the past, see "References" at the bottom of the page
radius
of the circles in the container circle, the latter has always a *radius* of 1
ratio
= 1/radius, that is the radius of the circumcircle if r1=1
density
ratio of total area occupied by the circles to container area
contacts
number of contacts between circles and container and between the circles themselves, respectively
loose
number of circles that have still degrees of freedom for a movement inside the container (so called "rattlers")
boundary
number of circles that have contact to the container (rattlers too if possible)
symmetry group
of the packing (Schönfliess notation); if field is empty then the packing has symmetry element C1
reference
for the best known packing so far
records
the sequence of N 's that establish density records

N radius ratio density contacts loose boundary symmetry group reference
5 0.445510532110326177870183871898 2.2446158461465061681365756907 0.695057227703432417181722063386 10 5 [31]
6 0.418762856923068159265446214336 2.3879863829081483893070603544 0.699742410812028340555458125491 12 5 [31]
7 0.412775680938211778412205685930 2.4226233428458436434183291482 0.758109420731057351851704962697 12 1 6 [31]
8 0.396224843326 2.5238195354 0.766868928566 16 7 [1]
9 0.380224295376059535407571212515 2.6300265715817907674242237225 0.766215322600868718277677878324 16 1 8 [31]
10 0.368217684481656716319320819988 2.7157848255107812766391671463 0.772565778836813320126648944150 20 8 [31]
11 0.361341346032030330688841606070 2.7674663057001983356153099388 0.794015905603797412906638348064 18 2 7 [31]
12 0.353479496272733992389020193735 2.8290184028904197499412701320 0.806084390413839540166375811627 20 2 7 [31]
13 0.342006880889543238267855568678 2.9239177802477210672764305206 0.796535449627403853986318240679 18 4 9 [31]
14 0.335032622223411528392029785221 2.9847839692851308416825739213 0.803439693248824770469031828267 22 3 9 [31]
15 0.328894133918061387803680706002 3.0404920516129779897597900930 0.810884472461238920116529836488 28 1 10 [31]
16 0.322954185272443564609595356354 3.0964144315281185000463318685 0.816265195197173455167992150450 26 3 8 [31]
17 0.317245884377294160290338777441 3.1521291504312159304842404949 0.820069830754265493125926677131 28 3 9 [31]
18 0.311059040079333127847243506653 3.2148237831151217267556956941 0.818845406873179625136584232669 24 6 12 [31]
19 0.306811260790019573470353226916 3.2593327814144217074335490012 0.825623556098338510867602859667 32 3 12 [31]
20 0.301947772922070894938182032518 3.3118310174060731598852539477 0.827163434918595060730462216542 32 4 10 [31]
21 0.297477939502610777803564463151 3.3615938098536668985386539829 0.829038291966683067500043827504 36 3 11 [31]
22 0.293130379095334552998896504596 3.4114512562165070561010510254 0.829937734851978894470055541589 38 3 12 [31]
23 0.289843532600795971301975763171 3.4501373586876224461066694594 0.835398274496243113526712993435 40 3 13 [31]
24 0.285778774990 3.4992101846 0.835038750854 42 3 13 [1]
25 0.282415234076 3.5408854741 0.837507049914 44 3 11 [1]
26 0.278794617379 3.5868698234 0.837285136140 30 11 15 [1]
27 0.275927749611 3.6241371207 0.840526473015 46 4 13 [1]
28 0.272685619729 3.6672267536 0.840499536021 52 2 14 [1]
29 0.269953601659 3.7043402787 0.842692522166 32 13 16 [1]
30 0.266901145291 3.7467055411 0.842017837625 50 5 13 [1]
31 0.264340788855 3.7829954444 0.843632809859 54 4 15 [1]
32 0.261920960889 3.8179456757 0.845408589325 58 3 15 [1]
33 0.259519937562 3.8532684980 0.846611621173 60 3 15 [1]
34 0.257100935289 3.8895229956 0.847031840781 66 1 17 [1]
35 0.254836796866 3.9240800869 0.847842694381 64 3 16 [1]
36 0.252564650718 3.9593822697 0.848004547109 66 3 17 [1]
37 0.250666572685 3.9893631978 0.850128748075 66 4 18 [1]
38 0.248471752172 4.0246023593 0.849715802731 68 4 18 [1]
39 0.246628908370 4.0546747201 0.851207886666 70 4 19 [1]
40 0.244751967916 4.0857689869 0.851998243278 66 7 14 [1]
41 0.243022203381 4.1148503556 0.853369389008 68 7 17 [1]
42 0.241122741426 4.1472653889 0.853118616941 76 4 18 [1]
43 0.239393044130 4.1772308115 0.853653014666 78 4 17 [1]
44 0.237629712595 4.2082279572 0.853552130899 76 6 14 [1]
45 0.236113181126 4.2352569866 0.854852921826 88 1 18 [1]
46 0.234480321898 4.2647502012 0.854958224392 78 7 16 [1]
47 0.232911913429 4.2934686564 0.855188117342 80 7 18 [1]
48 0.231420408102 4.3211400766 0.855654709430 88 4 21 [1]
49 0.229962919827 4.3485271484 0.856059836268 78 10 14 [1]
50 0.228518348939 4.3760162133 0.856259291679 98 1 19 [1]
51 0.226192880643510832953142460204 4.4210056353455289180997292690 0.849536122016254424482486200523 88 7 17 [31]
52 0.224360980017201659857357637092 4.4571030128471110708457418436 0.846194511448489459079778372144 98 2 19 [31]
53 0.223159727243272159875924005967 4.4810952780466265452089970096 0.847332228908881620222424550399 94 6 19 [31]
54 0.221865564750487885979052693972 4.5072339239512425677774925296 0.847515025733540030414654029965 89 9 19 [31]
55 0.220586952714334435516709285911 4.5333596919262253710893865049 0.847569937773715936653476211620 98 6 19 [31]
56 0.219664248260970659696836128641 4.5524021679301977399160073017 0.850137777205819918806750870250 104 3 21 [31]
57 0.218181884536199900068024189542 4.5833319394309468521160207802 0.848149354872142186485609915777 98 8 17 [31]
58 0.217189245374810335374023143557 4.6042795455837071461066861049 0.849745638314288936899387227123 108 4 23 [31]
59 0.215799455564850505922440853003 4.6339319873746723434553369349 0.848020488178801736184554917752 106 6 21 [31]
60 0.214546032482071502417834064663 4.6610043934677039809568631047 0.847147143698002821342871310406 113 3 21 [31]
61 0.213686180138230397035065868342 4.6797598204671679843220315058 0.849189431959752049758290813051 110 6 19 [31]
62 0.212587886982871157039546994184 4.7039368714388369454312345559 0.849154647009415904816509283015 112 6 22 [31]
63 0.211206913801211992889403887752 4.7346934908636574431853015221 0.846663356564031734689057782124 120 3 24 [31]
64 0.210314293460139669092401153863 4.7547885764099407064378678448 0.847902416329505139863917451633 118 5 23 [31]



Updates

Please note that the results are taken from a running search. For updates look at the list below.

09-Aug-2013: First complete presentation from N=5 to N=64.
26-Jun-2014: First improvements for N= 21–26, 28, 29, 31, 32, 35, 36, 37, 39, 40, 42, 43, 44, 47, 48, 51–57, and 60 by Eckard Specht [31].
01-Jun-2024: Significant improvements for N= 8, 24–50 by Jianrong Zhou, Jiyao He, and Kun He [1].

References

[1]   , Solution-Hashing Search Based on Layout-Graph Transformation for Unequal Circle Packing, submitted to European Journal of Operational Research, under review, May 2024.
[31]   , program ccib, 2005–2024.
[32]   Eckard Specht, A precise algorithm to detect voids in polydisperse circle packings, Proc. R. Soc. A 471 (2015), 20150421.

Datenschutzerklärung der Otto-von-Guericke-Universität Magdeburg nach DSGVO

©  E. Specht    01-Jun-2024