Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!rochester!cornellcs!newsstand.cit.cornell.edu!news.kei.com!newsfeed.internetmci.com!EU.net!ieunet!news.tcd.ie!rwallace
From: rwallace@tcd.ie (russell wallace)
Subject: Re: Bin packing??
Message-ID: <DKMEn3.1G1@news.tcd.ie>
Sender: usenet@news.tcd.ie (TCD News System )
Organization: University of Dublin, Trinity College
References: <19960101.191154.85@mageton.demon.co.uk> <4ccido$58f@newsbf02.news.aol.com>
Date: Wed, 3 Jan 1996 19:40:14 GMT
Lines: 18

In <4ccido$58f@newsbf02.news.aol.com> jstraszhei@aol.com (JStraszhei) writes:

>The problem involves a two dimentional area (dims 1024 x 1024 for example)
>apon which will be places a number of images of varying dimentions.  Find
>the
>best fit.

This is an interesting problem.  My guess is that any conventional
algorithmic approach will end up taking exponential time, but that it
could probably be solved quite well by a genetic algorithm or simulated
annealing approach; I was thinking awhile ago of trying these approaches
on it to see how well they worked, but I haven't got around to it yet.
Has anyone come up with any sort of solution?

--
"To summarize the summary of the summary: people are a problem"
Russell Wallace, Trinity College, Dublin
rwallace@vax1.tcd.ie
