Re: Allocation of 2D space
Jon Olick <[email protected]>
| Newsgroups | gmane.games.devel.algorithms |
|---|---|
| Message-ID | <[email protected]> |
Hi, Think Tetris. Find a spot in the texture which minimizes waste (unused holes) and the horizon line. Best, Jon Olick On Tue, Aug 11, 2009 at 2:41 PM, Brian Meidell <[email protected]>wrote: > Hi, > > I'm looking for an algorithm to allocate 2d rectangles of different > sizes from a larger 2d rectangle (small areas out of a large texture), > while wasting as little space as possible without being insanely slow. > > Search terms that yield google results are welcome answers (I tried, > but I guess my google-fu proved too weak). > > Regards, > Brian Meidell > The Game Equation > > > > ------------------------------------------------------------------------------ > Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day > trial. Simplify your report design, integration and deployment - and focus > on > what you do best, core application coding. Discover what's new with > Crystal Reports now. http://p.sf.net/sfu/bobj-july > _______________________________________________ > GDAlgorithms-list mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list > Archives: > http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list > ------------------------------------------------------------------------------ Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day trial. Simplify your report design, integration and deployment - and focus on what you do best, core application coding. Discover what's new with Crystal Reports now. http://p.sf.net/sfu/bobj-july _______________________________________________ GDAlgorithms-list mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list