AN UPPER BOUND ON AVERAGE TOUCHING NUMBER OF A VORONOI PARTITION
Citation：
Wang Chengshu.AN UPPER BOUND ON AVERAGE TOUCHING NUMBER OF A VORONOI PARTITION[J].Chinese Annals of Mathematics B,1989,10(1):19~25
Page view： 875Net amount： 745
Authors：
Wang Chengshu;
Abstract：
A Voronoi partition is decided by the 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 number of unit spheres that can touch a given unit sphere without overlapping.
