Efficient generation of densely packed convex polyhedra for 3D discrete and finite-discrete element methods
DOI10.1002/nme.4429zbMath1352.65473OpenAlexW1653571679MaRDI QIDQ2952225
Scott M. Johnson, S. R. Buechler
Publication date: 30 December 2016
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.4429
convex polyhedratetrahedral meshdiscrete element methoddense packingsample generationsurface concavity
Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (1)
Uses Software
Cites Work
- A method to model realistic particle shape and inertia in DEM
- Influence of particle shape on sheared dense granular media
- Packing spherical discrete elements for large scale simulations
- Four results on randomized incremental constructions
- Polyhedrization of an arbitrary 3D point set.
- A 3-D discrete-element method for dry granular flows of ellipsoidal particles
- Effects of model scale and particle size on micro-mechanical properties and failure processes of rocks-A particle mechanics approach
- Geometric properties of random disk packings.
- Particle shape effect on macro- and micro-behaviors of monodisperse ellipsoids
- The modelling of particle systems with real shapes
- Dynamics of a Projectile Penetrating Sand
- Granular jets
- Contact mechanics for analysis of fracturing and fragmenting solids in the combined finite-discrete element method
- The quickhull algorithm for convex hulls
- Contact resolution algorithm for an ellipsoid approximation for discrete element modeling
- Three‐dimensional discrete element simulation for granular materials
This page was built for publication: Efficient generation of densely packed convex polyhedra for 3D discrete and finite-discrete element methods
