scientific article; zbMATH DE number 1786500
From MaRDI portal
Publication:4547792
Recommendations
- Approximating minimum-area rectangular and convex containers for packing convex polygons
- scientific article; zbMATH DE number 6698326
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- Packing convex polygons in minimum-perimeter convex hulls
- Approximation algorithms for solving packing problems of convex polygons in plane
Cited in
(17)- A simple method for fitting of bounding rectangle to closed regions
- Approximation algorithms for solving packing problems of convex polygons in plane
- Covering polygons with rectangles
- Packing of convex polytopes into a parallelepiped
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- Optimized packing clusters of objects in a rectangular container
- Bundling three convex polygons to minimize area or perimeter
- Packing convex polygons in minimum-perimeter convex hulls
- The minimum convex container of two convex polytopes under translations
- Periodic interlocking problems in \(\mathbb R\times[0,w]\)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- Bundling two simple polygons to minimize their convex hull
- Aligning two convex figures to minimize area or perimeter
- Approximating minimum-area rectangular and convex containers for packing convex polygons
- Packing and covering the plane with translates of a convex polygon
- Column-based strip packing using ordered and compliant containment
- Regular packing of congruent polygons on the rectangular sheet
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547792)