An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
From MaRDI portal
Publication:2498331
DOI10.1007/S10035-004-0187-5zbMATH Open1094.74058OpenAlexW2106229228MaRDI QIDQ2498331FDOQ2498331
Publication date: 16 August 2006
Published in: Granular Matter (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10035-004-0187-5
Cites Work
- Monte Carlo sampling methods using Markov chains and their applications
- Random heterogeneous materials. Microstructure and macroscopic properties
- Geometric properties of random disk packings.
- An ellipse‐based discrete element model for granular materials
- Filling domains with disks: an advancing front approach
- Nearest neighbor and hard sphere models in continuum percolation
- Simulation of the quasi-static mechanics and scalar transport properties of ideal granular assemblages
- Perfect Simulation for Random Sequential Adsorption ofd-Dimensional Spheres with Random Radii
- Simulation of random packing of spheres
- Analysis of a triangulation based approach for specimen generation for discrete element simulations.
- Packing densities and simulated tempering for hard core Gibbs point processes
- An experimental and numerical study of the compaction of alumina agglomerates
Cited In (22)
- A new constructive algorithm for random polydisperse dense disk pack generation
- An efficient dense and stable particular elements generation method based on geometry
- Advances in particle packing algorithms for generating the medium in the discrete element method
- An iterative Bayesian filtering framework for fast and automated calibration of DEM models
- Influence of relative density on granular materials behavior: DEM simulations of triaxial tests
- Computational generation of open-foam representative volume elements with morphological control using distance fields
- An efficient algorithm to generate random sphere packs in arbitrary domains
- Contributions to the generalization of advancing front particle packing algorithms
- A comparison of data structures for the simulation of polydisperse particle packings
- Sphere Packing Based on Geometric Algorithm Generation Method
- A Minkowski difference‐based advancing front packing technique for generating convex noncircular particles in complex domains
- A statistical analysis of void size distribution in a simulated narrowly graded packing of spheres
- Physical processes within a 2D granular layer during an impact
- Stability and convergence analysis of a dynamics-based collective method for random sphere packing
- A hierarchical approach to simulate the packing density of particle mixtures on a computer
- Stochastic generation of particle structures with controlled degree of heterogeneity
- Mechanical properties of granular materials: A variational approach to grain-scale simulations
- High-density sphere packing for discrete element method simulations
- An algorithm to generate dense and stable particle assemblies for 2D DEM simulation
- A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
- Geometrical modeling of granular structures in two and three dimensions. Application to nanostructures
- Simulation of cutting processes using mesh-free Lagrangian particle methods
This page was built for publication: An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498331)
