摘要
A Voronoi partition is decided bythe configurations of N centerepoints in n dimensional Euclidean space. The total number of nearest neighbor points for a given centerpoint in the partition is called its touching number. It is shown that the average touching number for all points in a Voronoi partition is not greater than the n dimensional kissing number, that is, the maximum uumber of unit spheres that can touch a given unit sphere without overlapping.
A Voronoi partition is decided bythe configurations of N centerepoints in n dimensional Euclidean space. The total number of nearest neighbor points for a given centerpoint in the partition is called its touching number. It is shown that the average touching number for all points in a Voronoi partition is not greater than the n dimensional kissing number, that is, the maximum uumber of unit spheres that can touch a given unit sphere without overlapping.
