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

DOI10.1007/S10035-010-0216-5zbMATH Open1267.74030OpenAlexW2082577247MaRDI QIDQ351955FDOQ351955

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

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

zbMATH Keywords

packing densityparticle simulationsphere packingpolydisperse particlesspace fillingsystematic sampling

Mathematics Subject Classification ID

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

Cites Work

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

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)