Abstract
This paper considers solving a problem in combinatorial search: the automated arrangement of irregular-shaped objects for industrial 3D printing. The input is a set of triangulated models; the output is a set of location and orientation vectors for the objects. The proposed algorithm consists of three stages: (1) translation of the models into an octree; (2) design of an efficient test for pairwise intersection based on sphere trees; and (3) computation of an optimized placement of the objects using simulated annealing. We compare several sphere-tree construction methods and annealing parameter settings to derive valid packings.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bradshaw, G., O’Sullivan, C.: Adaptive medial-axis approximation for sphere-tree construction. ACM Transactions On Graphics 23(1), 1–26 (2004)
Crainic, T.G., Perboli, G., Tadei, R.: Recent Advances in Multi-Dimensional Packing Problems. InTech (2012)
Devillers, O., Pion, S., Teillaud, M.: Walking in a triangulation. In: Symposium on Computational Geometry, pp. 106–114 (2001)
Edelkamp, S., Gath, M., Rohde, M.: Monte-carlo tree search for 3D packing with object orientation. In: German Conference on Artificial Intelligence, pp. 285–296 (2014)
Egeblad, J., Nielsen, B.K., Odgaard, A.: Fast neighborhood search for two- and three-dimensional nesting problems. Europ. Journ. of Oper. Res. 183(3), 1249–1266 (2007)
Gärtner, B.: Fast and robust smallest enclosing balls. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 325–338. Springer, Heidelberg (1999)
Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7(4), 381–413 (1992)
Huang, E., Korf, R.E.: Optimal rectangle packing on non-square benchmarks. In: AAAI (2010)
Huang, E., Korf, R.E.: Optimal packing of high-precision rectangles. In: SOCS (2011)
Hubbard, P.M.: Collision detection for interactive graphics applications. IEEE Transactions on Visualization and Computer Graphics 1(3), 218–230 (1995)
Ikonen, I., Biles, W.E., Kumar, A., Wissel, J.C., Ragade, R.K.: A genetic algorithm for packing three-dimensional non-convex objects having cavities and holes. In: International Conference on Genetic Algorithms, pp. 591–598 (1997)
Korf, R.E.: Optimal rectangle packing: Initial results. In: ICAPS, pp. 287–295 (2003)
Korf, R.E.: Optimal rectangle packing: new results. In: ICAPS, pp. 142–149 (2004)
Lim, A., Ying, W.: A new method for the three dimensional container packing problem. In: IJCAI, pp. 342–347 (2001)
Moffitt, M.D., Pollack, M.E.: Optimal rectangle packing: a Meta-CSP approach. In: ICAPS, pp. 93–102 (2006)
Mücke, E.P., Saias, I., Zhu, B.: Fast randomized point location without preprocessing in two- and three-dimensional delaunay triangulations. In: Symposium on Computational Geometry, pp. 274–283 (1996)
Nezhad, A.S., Vatani, M., Barazandeh, F., Rahimi, A.R.: Multi objective optimization of part orientation in stereolithography. In: International Conference on Simulation, Modelling and Optimization, pp. 36–40 (2009)
Padhye, N., Deb, K.: Multi-objective optimisation and multi-criteria decision making for FDM using evolutionary approaches. In: Multi-objective Evolutionary Optimisation for Product Design and Manufacturing, pp. 219–247 (2011)
Palmer, I.J., Grimsdale, R.L.: Collision detection for animation using sphere-trees. Computer Graphics Forum 14(2), 105–116 (1995)
Turk, G.: Generating random points in triangles. In: Glassner, A.S. (ed.) Graphics Gems, pp. 24–28. Academic Press Professional Inc. (1990)
van den Bergen, G.: Efficient collision detection of complex deformable models using AABB trees. Journal of Graphics, GPU, & Game Tools 2(4), 1–13 (1997)
Watson, D.F.: Computing the \(n\)-dimensional delaunay tessellation with application to Voronoi polytopes, 24(2) (1981)
Weller, R., Frese, U., Zachmann, G.: Parallel collision detection in constant time. In: Workshop on Virtual Reality Interactions and Physical, pp. 61–70 (2013)
Wu, S., Kay, M., King, R., Vila-Parrish, A., Warsing, D.: Multi-objective optimization of 3D packing problem in additive manufacturing. In: Industrial and Systems Engineering Research Conference (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Edelkamp, S., Wichern, P. (2015). Packing Irregular-Shaped Objects for 3D Printing. In: Hölldobler, S., , Peñaloza, R., Rudolph, S. (eds) KI 2015: Advances in Artificial Intelligence. KI 2015. Lecture Notes in Computer Science(), vol 9324. Springer, Cham. https://doi.org/10.1007/978-3-319-24489-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-24489-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24488-4
Online ISBN: 978-3-319-24489-1
eBook Packages: Computer ScienceComputer Science (R0)