Multiple translational containment. I: An approximate algorithm

DOI10.1007/PL00014415zbMath0883.68127OpenAlexW2057629368MaRDI QIDQ1364368

Karen E. Daniels, Victor J. Milenkovic

Publication date: 16 March 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00014415

zbMATH Keywords

approximate multiple containment problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

Approximation algorithms for aligning points ⋮ The minimum convex container of two convex polytopes under translations ⋮ Approximate unions of lines and Minkowski sums ⋮ A new algorithm for the two-polygon containment problem ⋮ Compaction and separation algorithms for non-convex polygons and their applications ⋮ Bundling three convex polygons to minimize area or perimeter ⋮ Bundling Two Simple Polygons to Minimize Their Convex Hull ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Densest translational lattice packing of non-convex polygons

This page was built for publication: Multiple translational containment. I: An approximate algorithm