4 lines
174 B
Plaintext
4 lines
174 B
Plaintext
rectangle-packer solves the following problem: Given a set of rectangles with
|
|
fixed orientations, find a bounding box of minimum area that contains them all
|
|
with no overlap.
|