A Multi-sphere Scheme for 2D and 3D Packing Problems
In this paper, we deal with a packing problem that asks to place a given set of objects such as non-convex polytopes compactly in ℝ2 and ℝ3, where we treat translation, rotation and deformation as possible motions of each object. We propose a multi-sphere scheme that approximates each object with a set of spheres to find a compact layout of the original objects. We focus on the case that all objects are rigid, and develop an efficient local search algorithm based on a nonlinear program formulation.
Keywordspacking problem multi-sphere scheme iterated local search unconstrained nonlinear program
Unable to display preview. Download preview PDF.
- 4.Sloane, N.J.A.: The sphere packing problem. Documenta Mathematica ICM III, 387–396 (1998)Google Scholar
- 5.Imamichi, T., Yagiura, M., Nagamochi, H.: An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Technical report 2007-009, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University (2007)Google Scholar
- 7.Ferrez, J.A.: Dynamic triangulations for efficient 3D simulation of granular materials. PhD thesis, École Polytechnique Fédérale de Lausanne (2001)Google Scholar