Skip to content

A javascript binary tree based algorithm for 2d bin-packing suitable for generating CSS sprites. This fork adds a max size for growing packer

License

Notifications You must be signed in to change notification settings

scottmcdonnell/bin-packing

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

39 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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.

Demo

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.

Usage

If you want to use this in your own javascript projects, you need something like this:

<script src='packer.growing.js'></script>
<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 },
    etc
    etc
  ];

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

  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);
    }
  }
</script>

See source code comments for more details.

License

See LICENSE file.

Contact

If you have any ideas, feedback, requests or bug reports, you can reach me at [email protected], or via my website: Code inComplete

About

A javascript binary tree based algorithm for 2d bin-packing suitable for generating CSS sprites. This fork adds a max size for growing packer

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • JavaScript 82.6%
  • HTML 12.8%
  • CSS 4.6%