binary tree based bin packing algorithm

Downloads in past


0.0.112 years ago12 years agoMinified + gzip package size for binpacking in KB


Binary Tree Algorithm for 2D Bin Packing
This project is a javascript experiment to write a binary tree based bin packing algorithm that is suitable for generating CSS sprites.
You can play with the demo here You can find a description here
NodeJS demo
> Note: the node demo is quick and dirty. Npm support, test suite coming soon...
Clone this repository:
git clone
See usage example:
Run the demo:
node node-test.js
Clone this repository
git clone
View the index.html file in your favorite browser for examples of algorithm in use with lots of configurable options.
If you want to use this in your own javascript projects, you need something like this:
<script src='packer.growing.js'></script>
  var packer = new Packer(1000, 1000);   // or:  new GrowingPacker();
  var blocks = [
    { w: 100, h: 100 },
    { w: 100, h: 100 },
    { w:  80, h:  80 },
    { w:  80, h:  80 },

  blocks.sort(function(a,b) { return (b.h < a.h); }); // sort inputs for best results;

for(var n = 0 ; n < blocks.length ; n++) {
  var block = blocks[n];
  if ( {
    DrawRectangle(,, block.w, block.h);
See source code comments for more details.
See LICENSE file.
If you have any ideas, feedback, requests or bug reports, you can reach me at, or via my website: Code inComplete