Project implements a heuristic 2D rectangle packing algorithm

NOTE: Moved to https://github.com/tomazas/convex-rect-pack

Used for: packing as much rectangles as possible in convex & concave containers

Based on ideas described in paper:
"A heuristic approach for packing rectangles in convex regions" by Andrea Cassioli, Marco Locatelli (paper)

Implementation details: * Coded with Processing.org Java IDE * Runs on Linux OS * Uses liblbfgs and Java liblbfgs wrapper * Best for x/y axis aligned & convex regions * Supports 90 degrees rectangle rotation (horizontal & vertical) * Multi-iteration solving * Same size rectangles & any size container * Example container editor included for generating input data

Screenshots

http://convex-rect-pack.googlecode.com/svn/trunk/img/pic1.png'>http://convex-rect-pack.googlecode.com/svn/trunk/img/pic1.png' width='200' height='150' /> http://convex-rect-pack.googlecode.com/svn/trunk/img/pic2.png'>http://convex-rect-pack.googlecode.com/svn/trunk/img/pic2.png' width='200' height='150' /> http://convex-rect-pack.googlecode.com/svn/trunk/img/pic3.png'>http://convex-rect-pack.googlecode.com/svn/trunk/img/pic3.png' width='200' height='150' />