Computer generation of dense polydisperse sphere packings

Anuraag R. Kansal; Salvatore Torquato; Frank H. Stillinger

doi:10.1063/1.1511510

Computer generation of dense polydisperse sphere packings

Anuraag R. Kansal, Salvatore Torquato, Frank H. Stillinger

Research output: Contribution to journal › Article › peer-review

145 Scopus citations

Abstract

The Lubachevsky-Stillinger algorithm was extended and used to study the packing of a binary sphere mixture over a wide range of sphere volume ratios. It was found that the extended algorithm is able to pack bidisperse spheres significantly more efficiently than a recursive method over the range of sphere volume ratios considered.

Original language	English (US)
Pages (from-to)	8212-8218
Number of pages	7
Journal	Journal of Chemical Physics
Volume	117
Issue number	18
DOIs	https://doi.org/10.1063/1.1511510
State	Published - Nov 8 2002

All Science Journal Classification (ASJC) codes

General Physics and Astronomy
Physical and Theoretical Chemistry

Access to Document

10.1063/1.1511510

Cite this

@article{905bb0d9b2ff40a3977dcb2f1ae83982,

title = "Computer generation of dense polydisperse sphere packings",

abstract = "The Lubachevsky-Stillinger algorithm was extended and used to study the packing of a binary sphere mixture over a wide range of sphere volume ratios. It was found that the extended algorithm is able to pack bidisperse spheres significantly more efficiently than a recursive method over the range of sphere volume ratios considered.",

author = "Kansal, \{Anuraag R.\} and Salvatore Torquato and Stillinger, \{Frank H.\}",

year = "2002",

month = nov,

day = "8",

doi = "10.1063/1.1511510",

language = "English (US)",

volume = "117",

pages = "8212--8218",

journal = "Journal of Chemical Physics",

issn = "0021-9606",

publisher = "American Institute of Physics",

number = "18",

}

TY - JOUR

T1 - Computer generation of dense polydisperse sphere packings

AU - Kansal, Anuraag R.

AU - Torquato, Salvatore

AU - Stillinger, Frank H.

PY - 2002/11/8

Y1 - 2002/11/8

N2 - The Lubachevsky-Stillinger algorithm was extended and used to study the packing of a binary sphere mixture over a wide range of sphere volume ratios. It was found that the extended algorithm is able to pack bidisperse spheres significantly more efficiently than a recursive method over the range of sphere volume ratios considered.

AB - The Lubachevsky-Stillinger algorithm was extended and used to study the packing of a binary sphere mixture over a wide range of sphere volume ratios. It was found that the extended algorithm is able to pack bidisperse spheres significantly more efficiently than a recursive method over the range of sphere volume ratios considered.

UR - https://www.scopus.com/pages/publications/0037044988

UR - https://www.scopus.com/inward/citedby.url?scp=0037044988&partnerID=8YFLogxK

U2 - 10.1063/1.1511510

DO - 10.1063/1.1511510

M3 - Article

AN - SCOPUS:0037044988

SN - 0021-9606

VL - 117

SP - 8212

EP - 8218

JO - Journal of Chemical Physics

JF - Journal of Chemical Physics

IS - 18

ER -

Computer generation of dense polydisperse sphere packings

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this