scientific article; zbMATH DE number 1256725

MaRDI QIDQ4228460zbMATH OpenFDO

Authors Victor J. Milenkovic

Publication date 1 March 1999

zbMATH Keywords

linear programming based restriction

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 910876
• Multiple translational containment. I: An approximate algorithm
• Multiple translational containment. II: Exact algorithms

Cited in

(14)

• Rotational polygon overlap minimization and compaction
• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• Multiple translational containment. II: Exact algorithms
• Densest translational lattice packing of non-convex polygons
• The minimum convex container of two convex polytopes under translations
• Aligning two convex figures to minimize area or perimeter
• Approximating minimum-area rectangular and convex containers for packing convex polygons
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
• 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
• Minimal number of sensors for 3D coverage
• Online packing to minimize area or perimeter
• Bundling three convex polygons to minimize area or perimeter

This page was built for publication:

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