2008Chinese Physics LettersOpen access

Numerical Simulation of Random Close Packing with Tetrahedra

Shuixiang Li, Zhao Jian, Xuan Zhou

Open full text 23 citations

Abstract

The densest packing of tetrahedra is still an unsolved problem. Numerical simulations of random close packing of tetrahedra are carried out with a sphere assembly model and improved relaxation algorithm. The packing density and average contact number obtained for random close packing of regular tetrahedra is 0.6817 and 7.21 respectively, while the values of spheres are 0.6435 and 5.95. The simulation demonstrates that tetrahedra can be randomly packed denser than spheres. Random close packings of tetrahedra with a range of height are simulated as well. We find that the regular tetrahedron might be the optimal shape which gives the highest packing density of tetrahedra.

Open-access reader

About this research paper

What this paper is about

The densest packing of tetrahedra is still an unsolved problem. Numerical simulations of random close packing of tetrahedra are carried out with a sphere assembly model and improved relaxation algorithm. The packing density and average contact number obtained for random close packing of regular tetrahedra is 0.6817 and 7.21 respectively, while the values of spheres are 0.6435 and 5.95. The simulation demonstrates that tetrahedra can be randomly packed denser than spheres. Random close packings of tetrahedra with a range of height are simulated as well. We find that the regular tetrahedron might be the optimal shape which gives the highest packing density of tetrahedra.

Why it matters

OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The densest packing of tetrahedra is still an unsolved problem. Numerical simulations of random close packing of tetrahedra are carried out with a sphere assembly model and improved relaxation algorithm. The packing density and average contact number obtained for random close packing of regular tetrahedra is 0.6817 and 7.21 respectively, while the values of spheres are 0.6435 and 5.95. The simulation demonstrates that tetrahedra can be randomly packed denser than spheres. Random close packings of tetrahedra with a range of height are simulated as well. We find that the regular tetrahedron might be the optimal shape which gives the highest packing density of tetrahedra.

Key concepts: Tetrahedron, Sphere packing, SPHERES, Relaxation (psychology), Materials science, Packing problems, Close-packing of equal spheres, Hard spheres

Related papers

Back to paper searchBrowse research topicsOriginal source
Numerical Simulation of Random Close Packing with Tetrahedra — Research Paper | ScholarLens