A javascript binary tree based algorithm for 2d bin-packing suitable for generating CSS sprites
JavaScript HTML CSS
Latest commit 6c8ea72 Jan 5, 2016 @jakesgordon updated copyright 2016


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.


Clone this repository

git clone https://github.com/jakesgordon/bin-packing

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 (block.fit) {
      DrawRectangle(block.fit.x, block.fit.y, 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 jake@codeincomplete.com, or via my website: Code inComplete