Packing & Covering Problems
Packing and covering problems are special optimization problems concerning geometric objects in a given space or region. Many of the problems involve arranging geometric objects (usually identical) into the space or region as densely as possible with no overlap. Wolfram|Alpha can find the best-known solutions for many two-dimensional packing problems. It can also do estimations for packing/covering with everyday‐life objects.
Optimize the packing of common 2D geometric figures into a given area.
Compute properties of a geometric packing:
Specify dimensions of the container:
Specify dimensions of packed objects:
Estimate the number of objects required to pack or cover another object.