A hierarchical approach to simulate the packing density of particle mixtures on a computer

DOI10.1007/S10035-010-0216-5MaRDI QIDQ351955zbMATH OpenOpenAlexFDO

Authors Michael Kolonko, Steffen Raschdorf, Dominic Wäsch

Publication date 10 July 2013

Published in Granular Matter (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10035-010-0216-5

zbMATH Keywords

packing densityparticle simulationsphere packingpolydisperse particlesspace fillingsystematic sampling

Mathematics Subject Classification ID

Granularity (74E20) Numerical and other methods in solid mechanics (74S99)

Recommendations

• A comparison of data structures for the simulation of polydisperse particle packings
• A packing algorithm for three-dimensional convex particles
• Advances in particle packing algorithms for generating the medium in the discrete element method
• A heuristic approach for the densest packing fraction of hard-sphere mixtures
• High-density sphere packing for discrete element method simulations

Cites work

• A comparison of data structures for the simulation of polydisperse particle packings
• An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
• Random heterogeneous materials. Microstructure and macroscopic properties
• Sampling algorithms.

Cited in

(3)

• A comparison of data structures for the simulation of polydisperse particle packings
• A heuristic approach for the densest packing fraction of hard-sphere mixtures
• Physalis method for heterogeneous mixtures of dielectrics and conductors: accurately simulating one million particles using a PC

This page was built for publication: A hierarchical approach to simulate the packing density of particle mixtures on a computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351955)