Approximating Smallest Containers for Packing Three-Dimensional Convex Objects

DOI10.1142/S0218195918600026zbMath1397.68194arXiv1601.04585WikidataQ129562383 ScholiaQ129562383MaRDI QIDQ3177900

Helmut Alt, Nadja Scharf

Publication date: 2 August 2018

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.04585

zbMATH Keywords

approximation algorithmpackingcomputational geometry

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Three-dimensional packings with rotations
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing
• Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
• Improved Approximation Algorithm for Two-Dimensional Bin Packing
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• A Compactness Theorem For Affine Equivalence-Classes of Convex Regions
• An optimal deterministic algorithm for computing the diameter of a three-dimensional point set

This page was built for publication: Approximating Smallest Containers for Packing Three-Dimensional Convex Objects