With a bit of effort you too could have found this site.
Circle Packing -- from Wolfram MathWorld
We would like to pack as many circles of diameterd as possible into another large circle of
diameter D. We denote by N(d;D) such number.
(a) Give the upper bound for N(d;D).
(b) Give in details how we can calculate a lower bound for N(d;D). Find an explicit value for
Nwhen d = 9 mm and D = 72 mm.
ANY IDEAS?!
With a bit of effort you too could have found this site.
Circle Packing -- from Wolfram MathWorld
But, i need equations which gave values on Circle Packing -- from Wolfram MathWorld beacuse part a) deals with variables
To my knowledge, there is no formula that will compute N(d;D) precisely. However, Eckard Specht has compiled a table of observed packings for N up to 900 (and beyond). From his data, it's clear that D/d varies smoothly as a power function of N.
There's a javascript calculator at the bottom of Fiber Stuffing Revisited | Saphum that uses Specht's data to estimate N(d;D).
For D = 72mm and d = 9mm, N = 51.
-peter