Sphere packing based on geometric algorithm generation method

DOI10.1007/978-981-10-1926-5_22zbMATH Open1381.74237OpenAlexW2559224949MaRDI QIDQ2963356FDOQ2963356

Authors: Y. Li, Shunying Ji 

Publication date: 13 February 2017

Published in: Springer Proceedings in Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-10-1926-5_22

Recommendations

• A geometric algorithm based on tetrahedral meshes to generate a dense polydisperse sphere packing
• Packing spherical discrete elements for large scale simulations
• A fast and practical method to pack spheres for mesh generation
• Geometrical modeling of granular structures
• An efficient algorithm to generate random sphere packs in arbitrary domains

Mathematics Subject Classification ID

Granularity (74E20)

Cites Work

• 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
• Analysis of a triangulation based approach for specimen generation for discrete element simulations.

Cited In (2)

• 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

This page was built for publication: Sphere packing based on geometric algorithm generation method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963356)