Advertisement

Sphere Packings

  • Károly Bezdek
Chapter
Part of the CMS Books in Mathematics book series (CMSBM)

Abstract

The main problem in this section is fondly known as the kissing number problem. The kissing number τd is the maximum number of nonoverlapping d-dimensional balls of equal size that can touch a congruent one in the d-dimensional Euclidean space \(\mathbb{E}^d\). In three dimensions this question was the subject of a famous discussion between Isaac Newton and David Gregory in 1694. So, it is not surprising that the literature on the kissing number problem is an extensive one. Perhaps the best source of information on this problem is the book [108] by Conway and Sloane. In what follows we give a short description of the present status of this problem.

Keywords

Unit Ball Voronoi Cell Sphere Packing Circle Packing Contact Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Mathematics and StatisticsUniversity of CalgaryCalgaryCanada

Personalised recommendations