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.
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results