Multiple translational containment. I: An approximate algorithm
From MaRDI portal
Publication:1364368
DOI10.1007/PL00014415zbMath0883.68127MaRDI QIDQ1364368
Karen E. Daniels, Victor J. Milenkovic
Publication date: 16 March 1998
Published in: Algorithmica (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing, Bundling three convex polygons to minimize area or perimeter, Compaction and separation algorithms for non-convex polygons and their applications, A new algorithm for the two-polygon containment problem, Densest translational lattice packing of non-convex polygons, The minimum convex container of two convex polytopes under translations, Approximation algorithms for aligning points, Approximate unions of lines and Minkowski sums, Bundling Two Simple Polygons to Minimize Their Convex Hull