Ma, YuexinChen, ZhongguiHu, WenchaoWang, WenpingJu, Tao and Vaxman, Amir2018-07-272018-07-2720181467-8659https://doi.org/10.1111/cgf.13490https://diglib.eg.org:443/handle/10.1111/cgf13490Packing problems arise in a wide variety of practical applications. The basic problem is that of placing as many objects as possible in a non-overlapping configuration within a given container. Problems involving irregular shapes are the most challenging cases. In this paper, we consider the most general forms of irregular shape packing problems in 3D space, where both the containers and the objects can be of any shapes, and free rotations of the objects are allowed. We propose a heuristic method for efficiently packing irregular objects by combining continuous optimization and combinatorial optimization. Starting from an initial placement of an appropriate number of objects, we optimize the positions and orientations of the objects using continuous optimization. In combinatorial optimization, we further reduce the gaps between objects by swapping and replacing the deployed objects and inserting new objects. We demonstrate the efficacy of our method with experiments and comparisons.I.3.5 [Computer Graphics]Computational Geometry and Object ModelingGeometric algorithmslanguagesand systems10.1111/cgf.1349049-59