ON THE SPHERE PACKING PROBLEM AND THE PROOF OF KEPLER'S CONJECTURE
From MaRDI portal
Publication:4287348
DOI10.1142/S0129167X93000364zbMATH Open0844.52017WikidataQ56267707 ScholiaQ56267707MaRDI QIDQ4287348FDOQ4287348
Authors: Wu-Yi Hsiang 
Publication date: 12 April 1994
Published in: International Journal of Mathematics (Search for Journal in Brave)
Recommendations
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Cited In (23)
- The sphere packing problem
- Cannonballs and honeycombs.
- Title not available (Why is that?)
- The Kepler Conjecture
- The history of the Kepler conjecture
- Kepler, spheres, clusters, catastrophes; finite and infinite sphere packings; remarks on history, problems and applications
- Title not available (Why is that?)
- The art of unlocking
- The dodecahedral conjecture
- Minimal-energy clusters of hard spheres
- A rejoinder to Hale's article
- Study of the Kepler's conjecture: the problem of the closest packing
- Validating Kepler's conjecture: A new approach
- Title not available (Why is that?)
- What are all the best sphere packings in low dimensions?
- The status of the Kepler conjecture
- Revisiting the hexagonal lattice: on optimal lattice circle packing
- Surface reconstruction using Delaunay triangulation for applications in life sciences
- On packing spheres into containers
- Sphere packings revisited
- Densest packings of more than three \(d\)-spheres are nonplanar
- A conceptual breakthrough in sphere packing
- Bounds for local density of sphere packings and the Kepler conjecture
This page was built for publication: ON THE SPHERE PACKING PROBLEM AND THE PROOF OF KEPLER'S CONJECTURE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287348)
