Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

RE: (tye)Re3: Packaging Algorithm

by extremely (Priest)
on Nov 08, 2000 at 07:59 UTC ( #40470=note: print w/replies, xml ) Need Help??


in reply to (tye)Re3: Packaging Algorithm
in thread Packaging Algorithm

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?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://40470]
help
Chatterbox?
[trahulprajapati]: Hello All, Good Morning

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (7)
As of 2017-06-28 12:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many monitors do you use while coding?















    Results (637 votes). Check out past polls.