A new constructive algorithm for random polydisperse dense disk pack generation
From MaRDI portal
Publication:6554149
Recommendations
- A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
- Filling domains with disks: an advancing front approach
- 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 algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
Cites work
- A fast and practical method to pack spheres for mesh generation
- A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
- A local search-based method for sphere packing problems
- A new mesh generation scheme for arbitrary planar domains
- An algorithm to generate dense and stable particle assemblies for 2D DEM simulation
- An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
- An efficient algorithm to generate random sphere packs in arbitrary domains
- Analysis of a triangulation based approach for specimen generation for discrete element simulations.
- Filling domains with disks: an advancing front approach
- Geometric properties of random disk packings.
- Geometrical modeling of granular structures in two and three dimensions. Application to nanostructures
- Packing spherical discrete elements for large scale simulations
- The quickhull algorithm for convex hulls
This page was built for publication: A new constructive algorithm for random polydisperse dense disk pack generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554149)
