The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Computer simulation of close random packing of equal spheres
Abstract
We have developed an algorithm which generates a random close packing of equal spheres from a random distribution of points. Each point is the center of an inner and an outer sphere. The inner diameter defines the true density and the outer a nominal density. The algorithm eliminates overlaps among outer spheres while slowly shrinking the outer diameter. The two diameters approach each other, and the eventual coincidence of true and nominal densities terminates the procedure. The spheres in the packing, which is inherently homogeneous and isotropic, are close together but not touching. Thus, near neighbors are defined as those within a specified distance, \ensuremath{\delta}, of touching. When the outer diameter is contracted relatively quickly, the number of near neighbors depends strongly on \ensuremath{\delta}. As the contraction rate approaches zero, this dependence decreases sharply. We speculate that the limiting value is exactly 6 for all \ensuremath{\delta}\ensuremath{\le}${10}^{\mathrm{\ensuremath{-}}3}$. Packing fractions between 0.642 and 0.649, which are easily achieved by this method, are higher than any experimental or previously simulated values, but are consistent with Berryman's extrapolation [Phys. Rev. A 27, 1053 (1983)] from the radial distribution function for hard spheres. The algorithm can also be used for packing hyperspheres in higher dimensions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Random packings and the structure of simple liquids. I. The geometry of random close packing
Finney, J. L. (1970) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1970.0189 · Cited by 1,458
Random close packing of hard spheres and disks
Berryman, J. G. (1983) · Physical Review A · doi:10.1103/physreva.27.1053 · Cited by 692
Serially Deposited Amorphous Aggregates of Hard Spheres
Bennett, C. H. (1972) · Journal of Applied Physics · doi:10.1063/1.1661585 · Cited by 604
Structural properties of packed beds — A review
Haughey, D. P., & Beveridge, G. S. G. (1969) · The Canadian Journal of Chemical Engineering · doi:10.1002/cjce.5450470206 · Cited by 229
Cited by
Is Random Close Packing of Spheres Well Defined?
Torquato, S., Truskett, T. M., & Debenedetti, P. G. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.2064 · Cited by 1,379
Jammed hard-particle packings: From Kepler to Bernal and beyond
Torquato, S., & Stillinger, F. H. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.2633 · Cited by 768
Mean-field theory of hard sphere glasses and jamming
Parisi, G., & Zamponi, F. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.789 · Cited by 705
Generation of 3D representative volume elements for heterogeneous materials: A review
Bargmann, S., Klusemann, B., Markmann, J., Schnabel, J. E., Schneider, K., Soyarslan, C., & Wilmers, J. (2018) · Progress in Materials Science · doi:10.1016/j.pmatsci.2018.02.003 · Cited by 546
Computer simulation of the packing of fine particles
Yang, R. Y., Zou, R. P., & Yu, A. B. (2000) · Physical Review E · doi:10.1103/physreve.62.3900 · Cited by 475
Metadata
- Authors
- Jodrey, W. S., & Tory, E. M.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1985-10-01
- Volume
- 32
- Issue
- 4
- Pages
- 2347-2351
- ISSN
- 0556-2791 (ISSN-L)
- OpenAlex
- W2036732006
- Cited by
- 473
- References
- 4
- FWCI
- 1.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.