1. Chazelle, B., Edelsbrunner, H., Guibas, L.J.: The complexity of cutting complexes. Discrete Comput. Geom. 4(2), 139–181 (1989)
2. Lenstra, J.K., Rinnooy, A.H.G.: Complexity of packing, covering, and partitioning problems. In: Schrijver, A. (ed.) Packing and Covering in Combinatorics, pp. 275–291. Mathematisch Centrum, Amsterdam (1979)
3. Stillinger, F.H., Lubachevsky, B.D.: Crystalline-amorphous interface packings for disks and spheres. J. Stat. Phys. 73, 497–514 (1993)
4. Yaskov, G.N.: Methodology to solve multi-dimensional sphere packing problems. J. Mech. Eng. Problemy Mashynobuduvannia. 22(1), 67–75 (2019)
5. Pankratov, A.V., Romanova, T.E., Chugay, A.M.: Optimal packing of convex polytopes using quasi-phi-functions. J. Mech. Eng. Problemy Mashynobuduvannia. 18(2), 55–65 (2015)