Multiple translational containment. II: Exact algorithms

DOI10.1007/PL00014416MaRDI QIDQ1364353zbMATH OpenFDO

Authors O. Diekmann

Publication date 25 August 1997

Published in Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

translational containment problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 910876
• scientific article; zbMATH DE number 1256725
• Multiple translational containment. I: An approximate algorithm
• scientific article; zbMATH DE number 30304
• scientific article; zbMATH DE number 3911704

Cited in

(15)

• Rotational polygon overlap minimization and compaction
• Multiple translational containment. I: An approximate algorithm
• A new algorithm for the two-polygon containment problem
• Densest translational lattice packing of non-convex polygons
• Optimal clustering of a pair of irregular objects
• Approximate unions of lines and Minkowski sums
• scientific article; zbMATH DE number 6118050 (Why is no real title available?)
• Approximating minimum-area rectangular and convex containers for packing convex polygons
• scientific article; zbMATH DE number 3911704 (Why is no real title available?)
• scientific article; zbMATH DE number 1256725 (Why is no real title available?)
• scientific article; zbMATH DE number 1947380 (Why is no real title available?)
• scientific article; zbMATH DE number 910876 (Why is no real title available?)
• Column-based strip packing using ordered and compliant containment
• Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems
• Convex polygon containment: improving quadratic to near linear time

This page was built for publication: Multiple translational containment. II: Exact algorithms

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