Translational packing of arbitrary polytopes

Computational Geometry: Theory and Applications

Volumn 42, Issue 4, 2009, Pages 269-288

  Egeblad, Jens ^a   Nielsen, Benny K ^a   Brazil, Marcus ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Guided local search; Heuristics; Maximizing overlap; Minimizing overlap; Packing; Packing polytopes; Strip packing; Translational packing

Indexed keywords

EID: 84867932105     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2008.06.003     Document Type: Article

References (34)

1. H.-K. Ahn, O. Cheong, C.-D. Park, C.-S. Shin, and A. Vigneron Maximizing the overlap of two planar convex sets under rigid motions Computational Geometry 37 1 2006 3 15
2. A. Bortfeldt, H. Gehring, and D. Mack A parallel tabu search algorithm for solving the container loading problem Parallel Computing 29 2002 641 662
3. J. Cagan, D. Degentesh, and S. Yin A simulated annealing-based algorithm using hierarchical models for general three-dimensional component layout Computer Aided Design 30 10 1998 781 790
4. J. Cagan, K. Shimada, and S. Yin A survey of computational approaches to three-dimensional layout problems Computer-Aided Design 34 8 2002 597 611
5. O. Cheong, A. Efrat, and S. Har-Peled Finding a guard that sees most and a shop that sells most Discrete & Computational Geometry 37 4 2007 545 563
6. J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F. Brooks, and W. Wright Simplification envelopes Computer Graphics 30 1996 119 128 (Annual Conference Series)
7. M. de Berg, L.J. Guibas, and D. Halperin Vertical decompositions for triangles in 3-space Discrete & Computational Geometry 15 1 1996 35 61
8. M. de Berg, O. Cheong, O. Devillers, and M. van Kreveld Computing the maximum overlap of two convex polygons under translations Theory of Computing Systems 31 5 1998 613 628
9. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications second ed. 2000 Springer
10. J.K. Dickinson, and G.K. Knopf A moment based metric for 2-D and 3-D packing European Journal of Operational Research 122 1 2000 133 144
11. J.K. Dickinson, and G.K. Knopf Packing subsets of 3d parts for layered manufacturing International Journal of Smart Engineering System Design 4 3 2002 147 161
12. K.A. Dowsland, and W.B. Dowsland Solution approaches to irregular nesting problems European Journal of Operational Research 84 1995 506 521
13. J. Egeblad, B.K. Nielsen, and A. Odgaard Fast neighborhood search for two- and three-dimensional nesting problems European Journal of Operational Research 183 3 2007 1249 1266
14. F. Eisenbrand, S. Funke, A. Karrenbauer, J. Reichel, and E. Schömer Packing a trunk: Now with a twist! SPM '05: Proceedings of the 2005 ACM Symposium on Solid and Physical Modeling New York, NY, USA 2005 ACM Press 197 206
15. M. Eley Solving container loading problems by block arrangement European Journal of Operational Research 141 2 2002 393 409
16. O. Faroe, D. Pisinger, and M. Zachariasen Guided local search for the three-dimensional bin packing problem INFORMS Journal on Computing 15 3 2003 267 283
17. R.J. Fowler, M.S. Paterson, and S.L. Tanimoto Optimal packing and covering in the plane are NP-complete Information Processing Letters 12 3 1981 133 137
18. P. Hachenberger, L. Kettner, 3D Boolean operations on nef polyhedra, in: C.E. Board (Ed.), CGAL-3.2 User and Reference Manual, 2006
19. J. Heistermann, and T. Lengauer The nesting problem in the leather manufacturing industry Annals of Operations Research 57 1995 147 173
20. S.-M. Hur, K.-H. Choi, S.-H. Lee, and P.-K. Chang Determination of fabricating orientation and packing in SLS process Journal of Materials Processing Technology 112 2-3 2001 236 243
21. I. Ikonen, W.E. Biles, A. Kumar, J.C. Wissel, and R.K. Ragade A genetic algorithm for packing three-dimensional non-convex objects having cavities and holes Proceedings of the 7th International Conference on Genetic Algorithms East Lansing, Michigan 1997 Morgan Kaufmann Publishers 591 598
22. J. Lawrence Polytope volume computation Mathematics of Computation 57 195 1991 259 271
23. A. Lodi, S. Martello, and D. Vigo Heuristic algorithms for the three-dimensional bin packing problem European Journal of Operational Research 141 2 2002 410 420
24. D.M. Mount, R. Silverman, and A.Y. Wu On the area of overlap of translated polygons Computer Vision and Image Understanding 64 1 1996 53 61
25. B.K. Nielsen An efficient solution method for relaxed variants of the nesting problem J. Gudmundsson, B. Jay, Theory of Computing, Proceedings of the Thirteenth Computing: The Australasian Theory Symposium Ballarat, Australia CRPIT vol. 65 2007 ACS 123 130
26. B.K. Nielsen, Nesting problems and Steiner tree problems, PhD thesis, DIKU, University of Copenhagen, Denmark, 2008
27. T. Osogami, Approaches to 3D free-form cutting and packing problems and their applications: A survey, Technical Report RT0287, IBM Research, Tokyo Research Laboratory, 1998
28. Y.G. Stoyan, N.I. Gil, G. Scheithauer, A. Pankratov, and I. Magdalina Packing of convex polytopes into a parallelepiped Optimization 54 2 2005 215 235
29. P.E. Sweeney, and E.R. Paternoster Cutting and packing problems: A categorized, application-orientated research bibliography Journal of the Operational Research Society 43 7 1992 691 706
30. C. Voudouris, and E. Tsang Guided local search and its application to the traveling salesman problem European Journal of Operational Research 113 1999 469 499
31. G. Wäscher, H. Haussner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 2006
32. X. Yan, and P. Gu A review of rapid prototyping technologies and systems Computer Aided Design 28 4 1996 307 318
33. S. Yin, and J. Cagan An extended pattern search algorithm for three-dimensional component layout Journal of Mechanical Design 122 1 2000 102 108
34. S. Yin, and J. Cagan Exploring the effectiveness of various patterns in an extended pattern search layout algorithm Journal of Mechanical Design 126 1 2004 22 28