A comparison of data structures for the simulation of polydisperse particle packings

DOI10.1002/nme.2988zbMath1217.76062OpenAlexW2022527379MaRDI QIDQ3018004

Steffen Raschdorf, Michael Kolonko

Publication date: 20 July 2011

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.2988

zbMATH Keywords

sphere packingdata structurepolydispersespatial indexVerlet listloose octree

Mathematics Subject Classification ID

Granularity (74E20) Particle methods and lattice-gas methods (76M28) Granular flows (76T25)

Related Items (2)

A hierarchical approach to simulate the packing density of particle mixtures on a computer ⋮ Fast, flexible particle simulations -- an introduction to MercuryDPM

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
• Performance comparisons of tree‐based and cell‐based contact detection algorithms
• A contact algorithm for partitioning N arbitrary sized objects
• An augmented spatial digital tree algorithm for contact detection in computational mechanics

This page was built for publication: A comparison of data structures for the simulation of polydisperse particle packings