Approximation algorithms for solving packing problems of convex polygons in plane

DOI10.1016/S0747-5632(03)00006-2MaRDI QIDQ1801732zbMATH OpenFDO

Authors Yong Yan, Jian Liu, Q. H. Li

Publication date 17 August 1993

Published in Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

convex polygonsembedded depthinitial collisionminimum collision distancesqueezing elastic potential

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Numerical optimization method for packing regular convex polygons
• scientific article; zbMATH DE number 6698326
• scientific article; zbMATH DE number 1786500
• Approximating minimum-area rectangular and convex containers for packing convex polygons
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS

Cited in

(14)

• Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
• Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
• scientific article; zbMATH DE number 2127464 (Why is no real title available?)
• Approximating minimum-area rectangular and convex containers for packing convex polygons
• A heuristic algorithm for solving triangle packing problem
• scientific article; zbMATH DE number 3995477 (Why is no real title available?)
• Computational aspects of packing problems
• scientific article; zbMATH DE number 1629820 (Why is no real title available?)
• Precise determination of the saturation coverage of polygons in silico using exclusion assisted packing technique
• Improved approximation algorithms for rectangle tiling and packing.
• scientific article; zbMATH DE number 6698326 (Why is no real title available?)
• Using sentinels to detect intersections of convex and nonconvex polygons
• scientific article; zbMATH DE number 1786500 (Why is no real title available?)
• Numerical optimization method for packing regular convex polygons

This page was built for publication: Approximation algorithms for solving packing problems of convex polygons in plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801732)