Difference between revisions of "2D-Packing Rectangles and Images"
(→Multithreaded 2D-Packing with pre-placed items) |
(→2D-Packing Rectangles) |
||
| Line 9: | Line 9: | ||
</bluebox> | </bluebox> | ||
| − | + | ==Multithreaded 2D-Packing== | |
| + | <br /> | ||
| + | {| | ||
| + | | | ||
| + | <videoflash>vKiCq6dEyrI</videoflash> | ||
| + | | | ||
| + | A demo made of a ''2D-Packing heuristic''. The algorithm is given 10,000 randomly generated rectangles. <br /> | ||
| + | The heuristic is ''multithreaded'', with a "manager/worker" ''scheduling'' algorithm. In this movie 1 manager distributes rectangles to 6 workers. The rectangles are colored by the first worker they are given to. Workers return rectangles to the manager when they cannot pack them, and the manager distributes them to other workers. | ||
| + | <br /> | ||
| + | This version of the heuristic stops packing when it has reached a threshold, in this case if more than 99% of the original rectangular surface is covered. This corresponds to 9,869 rectangles of the 10,000 original ones picked. The actual coverage of the surface is 99.14%, corresponding to a packing ''factor'' of 1/0.9914 = 1.0087. | ||
| + | <br /> | ||
| + | The demo is written in Java and uses Processing for the display of the progression of the algorithm. The program is run on a MacPro with 2 x 2.8 GHz Quad-Core Intel Xeon processors, and 12 GBytes of RAM, and runs in 17.79 seconds. | ||
| + | <br /> | ||
| + | This page is aliased to the easier to use URL: [http://tinyurl.com/2DPacking http://tinyurl.com/2DPacking]. | ||
| + | <br /> | ||
| + | Algorithm and video generated by | ||
| + | Dominique Thiebaut, Dept. Computer Science, Smith College, Northampton, MA 01060, USA. | ||
| + | |} | ||
| + | <br /> | ||
==Multithreaded 2D-Packing with pre-placed items== | ==Multithreaded 2D-Packing with pre-placed items== | ||
<br /> | <br /> | ||
Revision as of 10:36, 8 July 2013
--D. Thiebaut (talk) 10:26, 8 July 2013 (EDT)
2D-Packing Rectangles
Multithreaded 2D-Packing
|
|
A demo made of a 2D-Packing heuristic. The algorithm is given 10,000 randomly generated rectangles. |
Multithreaded 2D-Packing with pre-placed items
|
|
A demo made of a 2D-Packing heuristic. The algorithm is given 10,000 randomly generated rectangles, 5 of which have been modified to have fixed positions, and specific locations in the final rectangular surface. These are the pre-placed items. |
