I suggest you do a search for "sphere packing problem" and see the variety of problems that fall under this category. I ran into several before hitting the "kissing number" problem for idential spheres in different numbers of dimensions that you seem to think is the only one.
From what I read, the original problem was popularized by Kepler when he guessed how tightly you could pack identical spheres in 3 dimensions. This one was recently solved (by proving the "obvious").
- tye (but my friends call me "Tye")In reply to (tye)Re3: Packaging Algorithm
by tye
in thread Packaging Algorithm
by marius
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |