Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

(tye)Re2: Packaging Algorithm

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

in reply to RE: Re: Packaging Algorithm
in thread Packaging Algorithm

BTW, I used to work for a guy who had several good solutions for packing spheres. He used them for designing composites (for example, what mixes of sizes of gravel to use for certain types of concrete). One involved selecting spheres from the chosen mix at random and dropping them into a virtual cylinder and letting them settle. Sure, he wasn't proving the maximally tightest possible packing. But he was able to make good predictions about how certain mixes of sizes of spheres would pack in practice.

He also sometimes repeated the experiment of make a bunch of spheres, put them in a bag, squeeze the bag for a few days, poor wax in, let it cool, remove bag, analyze positions of spheres.

Don't let someone's proof that some problem is impossible to solve prevent you from solving the problem well enough to get your work done!

        - tye (but my friends call me "Tye")

Replies are listed 'Best First'.
RE: (tye)Re2: Packaging Algorithm
by extremely (Priest) on Nov 08, 2000 at 07:18 UTC
    Don't let someone's proof that some problem is impossible to solve prevent you from solving the problem well enough to get your work done!
    (smartest thing said so far in this whole discussion.)

    Well, again, "the sphere packing problem" is different than that. In fact, there have been some neat breakthru's in the field. We have 9600 baud and up modems thanks to a trellis-code based on packing spheres efficiently in 8 dimensions. Turns out a single sphere can be touched by 1024 spheres in a tightly-packed regular array. =) That result is basically cool in anyone's book.

    The original problem was that given a bunch of spheres that are the same size, how many can you get to touch a single sphere at the same time. In 2d, the answer is clearly 6. (try it with pennies.) In 3d, 12 is the answer but if you look at the spherical cone of impact that each outer sphere makes, it would seem that 13 COULD be possible. The deal is that no one has found a function that provably states for each dimension what the number is. Only a special case exists for multiples of 8. High-weirdness, plain and simple.

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

      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")
        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://40367]
[gnosti]: Corion: Thanks. Going to seconds, then back to H:M:S using strftime looks good.
[gnosti]: True, it's easy to go both ways ;-)
[marioroy]: kcott found the link.

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (8)
As of 2017-08-18 09:10 GMT
Find Nodes?
    Voting Booth?
    Who is your favorite scientist and why?

    Results (297 votes). Check out past polls.