This repository contains implementations for the strip packing problem that can be found here: https://en.wikipedia.org/wiki/Strip_packing_problem

The strip packing problem attempts to optimize the placing of rectangles in a strip of fixed width and variable height, such that the overall height of the strip is the smallest possible.

In this algorithm, I use an ingenious method of placing rectangles inside of Holes.
The first hole starts as the entirety of the strip (with a Height that is negligeable but higher than the height of any rectangle & the theoretical min height of the strip).
As we place the rectangles inside the holes, we break the antecedent hole into new holes using 15 different positional cases, check for overlap, etc ...

The web interface can be found here: https://r-besson.github.io/strip-packing/
We can choose to rotate rectangles efficiently, or to not do so. We can specify the width of the canvas (strip), generate random boxes, or specify our own boxes.