An efficient algorithm to generate random sphere packs in arbitrary domains
DOI10.1016/J.CAMWA.2016.02.032zbMATH Open1443.68221OpenAlexW2305748903MaRDI QIDQ2007204FDOQ2007204
Authors: Elias Lozano, Deane Roehl, Waldemar Celes, Marcelo Gattass 
Publication date: 12 October 2020
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2016.02.032
Recommendations
- Stability and convergence analysis of a dynamics-based collective method for random sphere packing
- A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
- Algorithm for random close packing of spheres with periodic boundary conditions
- High-density sphere packing for discrete element method simulations
- Application of a force field algorithm for creating strongly correlated multiscale sphere packings
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- The quickhull algorithm for convex hulls
- High-density sphere packing for discrete element method simulations
- Geometric properties of random disk packings.
- 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
- An algorithm to generate random dense arrangements for discrete element simulations of granular assemblies
- Filling domains with disks: an advancing front approach
- Packing spherical discrete elements for large scale simulations
- THE FRACTAL DIMENSION OF THE APOLLONIAN SPHERE PACKING
- Geometrical modeling of granular structures in two and three dimensions. Application to nanostructures
- Analysis of a triangulation based approach for specimen generation for discrete element simulations.
- Determining the spatial containment of a point in general polyhedra
Cited In (13)
- A new constructive algorithm for random polydisperse dense disk pack generation
- Accelerated simulation of sphere packings using parallel hardware
- Sphere packing based on geometric algorithm generation method
- Almost Optimal Pseudorandom Generators for Spherical Caps
- A highly efficient algorithm for the generation of random fractal aggregates
- On the application of random searching for the hard particles packing problem for composite solid propellant structure modeling
- Application of a force field algorithm for creating strongly correlated multiscale sphere packings
- Optimized filling of a given cuboid with spherical powders for additive manufacturing
- Single-particle fabric tensors for assemblies of spherical particles
- An algorithm to generate dense and stable particle assemblies for 2D DEM simulation
- Computing variational bounds for flow through random aggregates of spheres
- A particle packing algorithm for packed beds with size distribution
- A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
Uses Software
This page was built for publication: An efficient algorithm to generate random sphere packs in arbitrary domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007204)
