A Multi-sphere Scheme for 2D and 3D Packing Problems

  • Takashi Imamichi
  • Hiroshi Nagamochi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4638)

Abstract

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.

Keywords

packing problem multi-sphere scheme iterated local search unconstrained nonlinear program 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwal, P.K., Guibas, L.J., Har-Peled, S., Rabinovitch, A., Sharir, M.: Penetration depth of two convex polytopes in 3D. Nordic Journal of Computing 7(3), 227–240 (2000)MATHGoogle Scholar
  2. 2.
    Wang, H., Huang, W., Zhang, Q., Xu, D.: An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research 141(2), 440–453 (2002)MATHCrossRefGoogle Scholar
  3. 3.
    Birgin, E.G., Martínez, J.M., Ronconi, D.P.: Optimizing the packing of cylinders into a rectangular container: A nonlinear approach. European Journal of Operational Research 160(1), 19–33 (2005)MATHCrossRefGoogle Scholar
  4. 4.
    Sloane, N.J.A.: The sphere packing problem. Documenta Mathematica ICM III, 387–396 (1998)Google Scholar
  5. 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
  6. 6.
    Milenkovic, V.J.: Rotational polygon overlap minimization and compaction. Computational Geometry 10(4), 305–318 (1998)MATHCrossRefGoogle Scholar
  7. 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
  8. 8.
    Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Mathematical Programming 45(3), 503–528 (1989)MATHCrossRefGoogle Scholar
  9. 9.
    Mintseris, J., Wiehe, K., Pierce, B., Anderson, R., Chen, R., Janin, J., Weng, Z.: Protein-protein docking benchmark 2.0: an update. Proteins 60(2), 214–216 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Takashi Imamichi
    • 1
  • Hiroshi Nagamochi
    • 1
  1. 1.Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, KyotoJapan

Personalised recommendations