A comparison of data structures for the simulation of polydisperse particle packings
From MaRDI portal
Recommendations
- Accelerated simulation of sphere packings using parallel hardware
- A packing algorithm for three-dimensional convex particles
- A hierarchical approach to simulate the packing density of particle mixtures on a computer
- A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
- Packing spherical discrete elements for large scale simulations
Cites work
- A contact algorithm for partitioning N arbitrary sized objects
- An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
- An augmented spatial digital tree algorithm for contact detection in computational mechanics
- scientific article; zbMATH DE number 46777 (Why is no real title available?)
- scientific article; zbMATH DE number 1323177 (Why is no real title available?)
- Performance comparisons of tree‐based and cell‐based contact detection algorithms
Cited in
(6)- Accelerated simulation of sphere packings using parallel hardware
- Fast, flexible particle simulations -- an introduction to MercuryDPM
- Property predictions for packed columns using Monte Carlo and discrete element digital packing algorithms
- A hierarchical approach to simulate the packing density of particle mixtures on a computer
- Data structure for on-lattice cluster-cluster aggregation model performance optimization
- Elastoplastic damage model and numerical implementation of nano-silica incorporated concrete
This page was built for publication: A comparison of data structures for the simulation of polydisperse particle packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3018004)
