Rectangle packing, also known as 2D packing or rectangular packing, is a combinatorial optimization problem where the goal is to pack a set of rectangles into a defined area (often referred to as a "bin" or "container") in the most efficient way. The objective can vary depending on the application, but common goals include minimizing the area of the container used, maximizing the number of rectangles that can be packed, or achieving a specific configuration.
New to topics? Read the docs here!