ABSTRACT
In 1998, the oldest problem in discrete geometry, the 400-year old Kep ler conjecture, was solved. The conjecture asserts that the familiar cannonball packing of balls achieves the greatest density of any possible packing. The proof of the conjecture was unusually long, requiring nearly 300 pages of careful reasoning, 3 gigabytes of stored data, and 40,000 lines of specialized computer code. The computer verifications required for the proof were carried out over a period of years.
This lecture will propose a new, vastly simplified, intuitive solution of the Kepler conjecture based on ideas from the field of generative programming.
Index Terms
Sphere packings and generative
Recommendations
Sphere packings revisited
In this paper we survey most of the recent and often surprising results on packings of congruent spheres in d-dimensional spaces of constant curvature. The topics discussed are as follows: - Hadwiger numbers of convex bodies and kissing numbers of ...
Finite sphere packing and sphere covering
A basic problem of finite packing and covering is to determine, for a given number ofk unit balls in Euclideand-spaceEd, (1) the minimal volume of all convex bodies into which thek balls can be packed and (2) the maximal volume of all convex bodies ...






Comments