Abstract
Packings of hard polyhedra have been studied for centuries due to their mathematical aesthetic and more recently for their applications in fields such as nanoscience, granular and colloidal matter, and biology. In all these fields, particle shape is important for structure and properties, especially upon crowding. Here, we explore packing as a function of shape. By combining simulations and analytic calculations, we study three two-parameter families of hard polyhedra and report an extensive and systematic analysis of the densest known packings of more than 55 000 convex shapes. The three families have the symmetries of triangle groups (icosahedral, octahedral, tetrahedral) and interpolate between various symmetric solids (Platonic, Archimedean, Catalan). We find optimal (maximum) packing-density surfaces that reveal unexpected richness and complexity, containing as many as 132 different structures within a single family. Our results demonstrate the importance of thinking about shape not as a static property of an object, in the context of packings, but rather as but one point in a higher-dimensional shape space whose neighbors in that space may have identical or markedly different packings. Finally, we present and interpret our packing results in a consistent and generally applicable way by proposing a method to distinguish regions of packings and classify types of transitions between them.
10 More- Received 10 September 2013
DOI:https://doi.org/10.1103/PhysRevX.4.011024
This article is available under the terms of the Creative Commons Attribution 3.0 License. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI.
Published by the American Physical Society
Synopsis
Packing Polyhedra
Published 26 February 2014
A computational study determines the maximum packing density of different particle shapes, with potential applications in nanotechnology and biology.
See more in Physics
Popular Summary
Calculating the densest way to pack objects in space is known as the packing problem and has intrigued scientists and philosophers for millennia. The solution is notoriously difficult to prove mathematically; instead, researchers optimize numerical and analytical computations and can usually, at best, claim to have found the highest known packing density for a given shape. The difficulty and complexity of the calculations mean that little is known about how packing changes with shape. Such knowledge is important in industry, where tailoring the shape of particles for optimal packing efficiency can minimize costs. In addition, a better understanding of how shape affects the way particles pack could lead to new shape-shifting materials that are able to toggle between different structures and properties.
Here, we take a comprehensive approach to understanding packing density as a function of shape by using analytical and computational methods to calculate the densest known packing for over 55,000 polyhedra. Our approach is distinguished from earlier work in that we look at the effects of changing two parameters (as opposed to only one) in shape space, namely, the degree to which the edges and vertices of a polyhedron have been truncated. We are therefore able to explore the complexity and diversity of shape effects that may have been missed in earlier studies.
We represent our findings as surfaces of maximum densities for related shapes and find both smooth regions (indicating that the changes in packing density and packing structures evolve continuously with shape change) and highly corrugated neighborhoods (indicating a discontinuous evolution of the change in packing density and packing structures). Our key finding is that minor changes in particle shape can cause major changes in packing: both in how the shapes pack and how densely they pack. Finally, we present general principles for navigating this complex problem, where we advocate thinking of shape not as a static property of an object but as merely a point in a high-dimensional shape space.