Skip to content

Commit

Permalink
Update readme
Browse files Browse the repository at this point in the history
  • Loading branch information
dvdoug committed Jul 29, 2013
1 parent 9227a47 commit 0e4f659
Showing 1 changed file with 3 additions and 3 deletions.
6 changes: 3 additions & 3 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@ Principles
----------

* Pack largest (by volume) items first
* [TODO] Pack vertically up the side of the box
* Pack vertically up the side of the box
* [TODO] Exception is where the item under consideration is half-size or less than
the item underneath it. Then pack side-by-side. Again, prefer mini-stacks
where possible
Expand All @@ -34,13 +34,13 @@ Principles
Constraints
-----------

* My use case for this code is a store that sell publications, which need to
* My use case for this code is a store that sells books, which need to
be shipped flat. The algorithm as implemented therefore considers simple 2D
rotation of items when determining fit but will not try turning items on
their side.
* The algorithm does consider spatial constraints in all 3 dimensions, plus
consideration of weight.
* The code is alpha, use at your own risk
* The code is beta, use at your own risk

Requirements
------------
Expand Down

0 comments on commit 0e4f659

Please sign in to comment.