CSpace
anupperboundonaveragetouchingnumberofavoronoipartition
Wang CS(王承曙)
1989
Source Publicationchineseannalsofmathematicsseriesb
ISSN0252-9599
Volume000Issue:001Pages:19
AbstractA 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.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/38986
Collection中国科学院数学与系统科学研究院
Affiliation中国科学院数学与系统科学研究院
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[王承曙]'s Articles
Baidu academic
Similar articles in Baidu academic
[王承曙]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[王承曙]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.