Maximum packing densities of basic 3D objects

DOI10.1007/s11434-009-0650-0zbMath1196.52009OpenAlexW1976338618MaRDI QIDQ708025

D. Kharzeev

Publication date: 8 October 2010

Published in: Chinese Science Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11434-009-0650-0

zbMATH Keywords

conepackingcylinderparticletetrahedronspherocylindernonspherical particle

Mathematics Subject Classification ID

Polytopes and polyhedra (52B99) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items (7)

Two approaches to modeling and solving the packing problem for convex polytopes ⋮ Minimal surface convex hulls of spheres ⋮ Parallel computing technologies for solving optimization problems of geometric design ⋮ Multistage approach to solving the optimization problem of packing nonconvex polyhedra ⋮ Particle packing and the mean theory ⋮ Optimized Object Packings Using Quasi-Phi-Functions ⋮ Packing of concave polyhedra with continuous rotations using nonlinear optimisation

Uses Software

• kepler98

Cites Work

• A dense packing of regular tetrahedra
• A proof of the Kepler conjecture
• Packing, tiling, and covering with tetrahedra
• Unnamed Item

This page was built for publication: Maximum packing densities of basic 3D objects