Approximation algorithms for solving packing problems of convex polygons in plane
From MaRDI portal
Publication:1801732
DOI10.1016/S0747-5632(03)00006-2zbMATH Open0772.68103MaRDI QIDQ1801732FDOQ1801732
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)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
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
- Title not available (Why is that?)
- Approximating minimum-area rectangular and convex containers for packing convex polygons
- A heuristic algorithm for solving triangle packing problem
- Title not available (Why is that?)
- Computational aspects of packing problems
- Precise determination of the saturation coverage of polygons in silico using exclusion assisted packing technique
- Title not available (Why is that?)
- Improved approximation algorithms for rectangle tiling and packing.
- Title not available (Why is that?)
- Using sentinels to detect intersections of convex and nonconvex polygons
- Title not available (Why is that?)
- 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)
