The isotropic algorithm is constructed for random close packing of equisized spheres with triply periodic boundary conditions. All previously published packing methods with periodic boundaries were kinetics-determined; i.e., they contained a densification rate as an arbitrary parameter. In contrast,
Ordinal algorithms for packing with target center of gravity
β Scribed by Wei-Ping Liu; Jeffrey B. Sidney
- Publisher
- Springer Netherlands
- Year
- 1996
- Tongue
- English
- Weight
- 657 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
β¦ Synopsis
The problem of arranging N unit length weights on a line segment of length IV, given a target center of gravity on this line segment, is examined under the assumption that the only information we have about the weights is their order, i.e., at > a2 2 2 aN. Lower bounds on worst case performance of algorithms for this problem are developed, and algorithms (permutations) which come close to achieving these bounds are provided.
π SIMILAR VOLUMES
The determination of structures of multimers presents interesting new challenges. The structure(s) of the individual monomers must be found and the transformations to produce the packing interfaces must be described. A substantial difficulty results from ambiguities in assigning intermolecular dista
In a previous article (J. Fernandez Rico, R. Upez and G. Ramirez, J. Comp. Chem., 9, 790 (1988)) we have proposed the calculation of molecular integrals involving STOs by means of some recurrence relations which use two sets (h and H) of overlap integrals (basic matrices). In the present paper, we d