MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS

DOI10.1142/S0218195906001926zbMath1095.68126OpenAlexW2158034392MaRDI QIDQ5291406

Danny Z. Chen, Charlie C. L. Wang, Kai Tang

Publication date: 10 May 2006

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195906001926

zbMATH Keywords

minimum areacontact configurationconvex packing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (7)

Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons ⋮ The smallest convex \(k\)-gon containing \(n\) congruent disks ⋮ Packing convex polygons in minimum-perimeter convex hulls ⋮ Bundling three convex polygons to minimize area or perimeter ⋮ Aligning two convex figures to minimize area or perimeter ⋮ Bundling Two Simple Polygons to Minimize Their Convex Hull ⋮ Optimized packing clusters of objects in a rectangular container

Cites Work

• Unnamed Item
• Recent advances on two-dimensional bin packing problems
• The trim-loss and assortment problems: A survey
• An approximately global optimization method for assortment problems
• A lower bound for the non-oriented two-dimensional bin packing problem
• An efficient approach for the multi-pallet loading problem
• Performance analysis and improvement for some linear on-line bin-packing algorithms
• Approximately global optimization for assortment problems using piecewise linearization techniques
• Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
• Finding minimal enclosing boxes
• Analysis of upper bounds for the pallet loading problem
• A fast algorithm for assortment optimization problems

This page was built for publication: MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS