The kissing problem in three dimensions

30Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The kissing number k(3) is the maximal number of equal size nonoverlapping spheres in three dimensions that can touch another sphere of the same size. This number was the subject of a famous discussion between Isaac Newton and David Gregory in 1694. The first proof that k(3) = 12 was given by Schutte and van der Waerden only in 1953. In this paper we present a new solution of the Newton - Gregory problem that uses our extension of the Delsarte method. This proof relies on basic calculus and simple spherical geometry. © 2005 Springer Science+Business Media, Inc.

Cite

CITATION STYLE

APA

Musin, O. R. (2006). The kissing problem in three dimensions. Discrete and Computational Geometry, 35(3), 375–384. https://doi.org/10.1007/s00454-005-1201-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free