A new constructive algorithm for random polydisperse dense disk pack generation

DOI10.1002/NME.6774zbMATH Open1548.7404MaRDI QIDQ6554149

Elias Lozano, Marcelo Gattass

Publication date: 12 June 2024

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

zbMATH Keywords

polygonal meshgeometric algorithmdisk packingadvancing-front approach

Mathematics Subject Classification ID

Random materials and composite materials (74A40)

Cites Work

• A fast and practical method to pack spheres for mesh generation
• Packing spherical discrete elements for large scale simulations
• Analysis of a triangulation based approach for specimen generation for discrete element simulations.
• A local search-based method for sphere packing problems
• A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
• Geometric properties of random disk packings.
• An efficient algorithm to generate random sphere packs in arbitrary 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
• Geometrical modeling of granular structures in two and three dimensions. Application to nanostructures
• A new mesh generation scheme for arbitrary planar domains
• The quickhull algorithm for convex hulls
• Filling domains with disks: an advancing front approach

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)