Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

(tye)Re3: Packaging Algorithm

by tye (Sage)
on Nov 08, 2000 at 07:35 UTC ( #40467=note: print w/ replies, xml ) Need Help??

in reply to RE: (tye)Re2: Packaging Algorithm
in thread Packaging Algorithm

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")
Comment on (tye)Re3: Packaging Algorithm
Replies are listed 'Best First'.
RE: (tye)Re3: Packaging Algorithm
by extremely (Priest) on Nov 08, 2000 at 07:59 UTC
    I'm aware of them. And in a way, you are correct, the kissing spheres is a subset of the regular vs. irregular tightest packing series of questions. As I recall (and it has been years) Solving the kissing problem in "n" dimensions leads to solutions to the regular packing density question.

    And this has now officially gone completely off-topic and gotten rude so that's it for me on this topic.

    $you = new YOU;
    honk() if $you->love(perl)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://40467]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (3)
As of 2016-05-01 18:48 GMT
Find Nodes?
    Voting Booth?