anupperboundonaveragetouchingnumberofavoronoipartition

CSpace

	anupperboundonaveragetouchingnumberofavoronoipartition
	Wang CS(王承曙)
	1989
发表期刊	chineseannalsofmathematicsseriesb
ISSN	0252-9599
卷号	000 期号:001 页码:19
摘要	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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/38986
专题	中国科学院数学与系统科学研究院
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Wang CS. anupperboundonaveragetouchingnumberofavoronoipartition[J]. chineseannalsofmathematicsseriesb,1989,000(001):19.
APA	王承曙.(1989).anupperboundonaveragetouchingnumberofavoronoipartition.chineseannalsofmathematicsseriesb,000(001),19.
MLA	王承曙."anupperboundonaveragetouchingnumberofavoronoipartition".chineseannalsofmathematicsseriesb 000.001(1989):19.