多面体的稠密填充:柏拉图立体与阿基米德立体
Dense Packings of Polyhedra: Platonic and Archimedean Solids
摘要:
我们制定的问题产生密集包装的非重叠,非平铺多面体内的自适应基本细胞周期性边界条件作为一个优化问题,我们称之为自适应收缩细胞(ASC)计划。这个新的优化问题在这里解决(使用各种多粒子初始配置),以找到三维欧几里得空间R3中每个柏拉图固体的稠密填充,除了立方体,这是唯一的柏拉图固体,瓷砖空间。我们发现密度为0.823,0.836,0.904和0.947的四面体,二十面体,十二面体和八面体的密度已知的包装。值得注意的是,这种密排四面体堆积不具有长程序。与不一定是布拉维格填充的密排四面体填充不同,我们得到的其他非平铺柏拉图立体的密排填充是它们先前已知的最优(布拉维)格填充。我们还得到了一个简单的上界的最大密度的包装全等非球形粒子,并将其应用到柏拉图固体,阿基米德固体,超球和椭球。我们的模拟结果,严格的上限,和其他理论论据,使我们的猜想,即中心对称的柏拉图和阿基米德固体的dennial包装是由其相应的dennial晶格包装。此外,我们还猜想,任何无中心对称的凸全等多面体的最优填充一般都不是格填充。
英文摘要:
We formulate the problem of generating dense packings of nonoverlapping, non-tiling polyhedra within an adaptive fundamental cell subject to periodic boundary conditions as an optimization problem, which we call the Adaptive Shrinking Cell (ASC) scheme. This novel optimization problem is solved here (using a variety of multi-particle initial configurations) to find the dense packings of each of the Platonic solids in three-dimensional Euclidean space R3 , except for the cube, which is the only Platonic solid that tiles space. We find the densest known packings of tetrahedra, icosahedra, dodecahedra, and octahedra with densities 0.823, 0.836, 0.904, and 0.947, respectively. It is noteworthy that the densest tetrahedral packing possesses no long-range order. Unlike the densest tetrahedral packing, which must not be a Bravais lattice packing, the densest packings of the other non-tiling Platonic solids that we obtain are their previously known optimal (Bravais) lattice packings. We also derive a simple upper bound on the maximal density of packings of congruent nonspherical particles, and apply it to Platonic solids, Archimedean solids, superballs and ellipsoids. Our simulation results, rigorous upper bounds, and other theoretical arguments lead us to the conjecture that the densest packings of Platonic and Archimedean solids with central symmetry are given by their corresponding densest lattice packings. In addition, we conjecture that the optimal packing of any convex, congruent polyhedron without central symmetry generally is not a lattice packing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。