Influence of computational domain boundaries on internal structure in low-porosity sphere packings

Collective rearrangement is an important class of algorithms for the comput er generation of random sphere packings, especially for those of low porosi ty. In this paper we examine how the choice of boundary conditions affects internal packing structure. The results help to quantify the depth to which non-periodic boundaries influence internal structure. Mon interesting resu lts are obtained for periodic boundary conditions, showing that for small p ackings, self-assembly into ordered packings is possible, even without a se ed structure or undue influence from the algorithm. Furthermore, the struct ure depends on the shape of the periodic domain. Finally, we propose examin ing the transition from random to ordered packings to better characterize t he random-close-packed (RCP) limit and its associated packing structures. ( C) 2000 Elsevier Science S.A. All rights reserved.