How should a person pack cylindrical cells within a rectangular prism(i.e., box) whose width and height perfectly meet with whatever arrangment the cells take(the box can be customized to whatever size needed)? So far, it seems two of the most popular methods include "1 cell directly ontop of the cell below it" and the "pyramidal arrangement", like so:
(one cell directly atop the one below)
O.O.O
O.O.O
O.O.O
(pyramidal type of arrangement)
O.O.O
.O.O.O
O.O.O
(The O's are the cylindrical cells and the periods are just "white space" so I can make the proper shape. :wink: )
Assuming N columns of cells and M rows of cells, the packing ratio for the top pattern is pi/4 and the "pyramidal arrangment pattern" is, for odd numbers of M,..
pi*N*M
-------------------------------------------(dividing line)
[2N+1]*[2M+1+(1/2)*3^(1/2)]
Ideally, for a given N and M, the denomiator should be as small as possible and as N and M go large(and approach infinity), the packing ratio approaches pi/4. For finite N and M, which is where we work at :lol: , the packing ratio is less than pi/4 and decreasingly so for smaller values of N and M.
So in effect, the regular stacking pattern(top one) is the most efficient for a rectangular box. Now, if you can start fitting in parallelogram boxes into wherever(like the diamond of a bike-frame), the pyramidal arrangment would become competitive as the packing ratio could exceed pi/4. Now, who's upto analyzing the ideal packing ratio for the ideal parallelgram case?
(one cell directly atop the one below)
O.O.O
O.O.O
O.O.O
(pyramidal type of arrangement)
O.O.O
.O.O.O
O.O.O
(The O's are the cylindrical cells and the periods are just "white space" so I can make the proper shape. :wink: )
Assuming N columns of cells and M rows of cells, the packing ratio for the top pattern is pi/4 and the "pyramidal arrangment pattern" is, for odd numbers of M,..
pi*N*M
-------------------------------------------(dividing line)
[2N+1]*[2M+1+(1/2)*3^(1/2)]
Ideally, for a given N and M, the denomiator should be as small as possible and as N and M go large(and approach infinity), the packing ratio approaches pi/4. For finite N and M, which is where we work at :lol: , the packing ratio is less than pi/4 and decreasingly so for smaller values of N and M.
So in effect, the regular stacking pattern(top one) is the most efficient for a rectangular box. Now, if you can start fitting in parallelogram boxes into wherever(like the diamond of a bike-frame), the pyramidal arrangment would become competitive as the packing ratio could exceed pi/4. Now, who's upto analyzing the ideal packing ratio for the ideal parallelgram case?