Pages that link to "Item:Q1937453"
From MaRDI portal
The following pages link to A packing algorithm for three-dimensional convex particles (Q1937453):
Displaying 18 items.
- A method to model realistic particle shape and inertia in DEM (Q351916) (← links)
- A hierarchical approach to simulate the packing density of particle mixtures on a computer (Q351955) (← links)
- Weighted Poisson cells as models for random convex~polytopes (Q479144) (← links)
- Rigidly connected overlapping spherical particles: a versatile grain model (Q608148) (← links)
- Simulation of the packing of granular mixtures of non-convex particles and voids characterization (Q732731) (← links)
- A particle packing algorithm for packed beds with size distribution (Q944395) (← links)
- Using level sets for creating virtual random packs of non-spherical convex shapes (Q964261) (← links)
- Stochastic simulations of two-dimensional composite packings (Q1372030) (← links)
- An efficient algorithm for granular dynamics simulations with complex-shaped objects (Q1937455) (← links)
- A comparison of data structures for the simulation of polydisperse particle packings (Q3018004) (← links)
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects (Q3177900) (← links)
- (Q3397111) (← links)
- Dynamic Numerical Investigation of Random Packing for Spherical and Nonconvex Particles (Q3649503) (← links)
- (Q3753399) (← links)
- A PACKING GENERATION SCHEME FOR THE GRANULAR ASSEMBLIES WITH PLANAR ELLIPTICAL PARTICLES (Q4360825) (← links)
- (Q4636493) (← links)
- A packing generation scheme for the granular assemblies with 3D ellipsoidal particles (Q4939668) (← links)
- A procedure for efficient generation and behavioral evaluation of ultra‐packed ellipsoidal particle systems (Q6092190) (← links)