Multiple translational containment. II: Exact algorithms
From MaRDI portal
Publication:1364353
DOI10.1007/PL00014416zbMath0882.68142MaRDI QIDQ1364353
Publication date: 25 August 1997
Published in: Algorithmica (Search for Journal in Brave)
Related Items
Approximate unions of lines and Minkowski sums ⋮ Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons ⋮ A new algorithm for the two-polygon containment problem ⋮ Optimal clustering of a pair of irregular objects ⋮ Rotational polygon overlap minimization and compaction ⋮ Densest translational lattice packing of non-convex polygons