|Gerald Wu 8147f25efb||1 year ago|
|paper||2 years ago|
|program||2 years ago|
|.gitattributes||1 year ago|
|.gitignore||2 years ago|
|README.md||2 years ago|
This project attempts to use an approximate solution to the Bin-Packing Problem for Knolling, a popular photography style. The first-fit algorithm is used.
For more information, please read the paper located in the
The program is located in the
program directory. The rest of the instructions assume you are acting from within this directory.
There is already a pre-compiled binary of the main program in the repo. To recompile, run
To run the program, run
./run.sh. It will prompt you for the number of boxes to randomly generate. Type a number for a “demo” of the program. If you wish to use pre-defined box sizes in the
config file, type
Main language: C++
Helper language: Shell scripting
The result of running the program on a set of 12 randomly generated rectangles. The rectangles represent real-life objects that may be used for knolling.