AN UPPER BOUND ON AVERAGE TOUCHING NUMBER OF A VORONOI PARTITION

作     者：王承曙 

作者机构：The Computing Centre Academia Sinica Beijing China 

出 版 物：《Chinese Annals of Mathematics,Series B》 (数学年刊（B辑英文版）)

年 卷 期：1989年第10卷第1期

页      面：19-25页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：partition overlapping neighbor decided Euclidean nearest vertex viola spheres 切二 

摘      要：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.