计算
包装问题
球形填料
统计物理学
数学
组合数学
计算机科学
物理
算法
几何学
作者
Peter K. Morse,Patrick Charbonneau
标识
DOI:10.1039/9781837673940-00109
摘要
The apparent simplicity of amorphous sphere packings can be misleading. Although random close packing is a common phenomenon that has been studied for decades, recent theoretical and computational advances reveal how complex the underlying physics actually is. By bringing together perspectives from thermodynamics, constraint satisfaction problems, and optimization, unique insights emerge. This chapter reviews these advances and describes a framework for addressing some of the remaining open problems, including how to define a more rigorous analogue to random close packing and how to compute its properties.
科研通智能强力驱动
Strongly Powered by AbleSci AI