The two-dimensional (2D) irregular packing problem is a combinatorial optimization problem with NP-complete characteristics, which is common in the production process of clothing, ships, and plate ...
Geometric packing problems involve arranging objects of given shapes within a confined region so as to maximise density, minimise wasted space or satisfy prescribed distance and balance constraints.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results