CSpace
Progress on maximum weight triangulation
Chin, FYL; Qian, JB; Wang, CA
2004
发表期刊COMPUTING AND COMBINATORICS, PROCEEDINGS
ISSN0302-9743
卷号3106页码:53-61
摘要In this paper, we investigate the maximum weight triangulation of a point set in the plane. We prove that the weight of maximum weight triangulation of any planar point set with diameter D is bounded above by ((2epsilon+2)(.)n + pi(1-2epsilon)/8epsilonroot1-epsilon(2) + pi/2 - 5(epsilon+1))D, where epsilon for 0 < epsilon less than or equal to 1/2 is a constant and n is the numb er of points in the set. If we use 'spoke-scan' algorithm to find a triangulation of the point set, we obtain an approximation ratio of 4.238. Furthermore, if the point set forms a 'semi-lune' or a 'semi-circled' convex polygon', then its maximum weight triangulation can be found in O(n(2)) time.
关键词algorithm approximation maximum weight triangulation
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Software Engineering ; Computer Science, Theory & Methods
WOS记录号WOS:000223614000008
出版者SPRINGER-VERLAG BERLIN
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/19306
专题中国科学院数学与系统科学研究院
通讯作者Chin, FYL
作者单位1.Univ Hong Kong, Dept Comp Sci & Informat Syst, Hong Kong, Hong Kong, Peoples R China
2.Chinese Acad Sci, Inst Appl Math, Beijing, Peoples R China
3.Mem Univ Newfoundland, Dept Comp Sci, St Johns, NF A1B 3X5, Canada
推荐引用方式
GB/T 7714
Chin, FYL,Qian, JB,Wang, CA. Progress on maximum weight triangulation[J]. COMPUTING AND COMBINATORICS, PROCEEDINGS,2004,3106:53-61.
APA Chin, FYL,Qian, JB,&Wang, CA.(2004).Progress on maximum weight triangulation.COMPUTING AND COMBINATORICS, PROCEEDINGS,3106,53-61.
MLA Chin, FYL,et al."Progress on maximum weight triangulation".COMPUTING AND COMBINATORICS, PROCEEDINGS 3106(2004):53-61.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Chin, FYL]的文章
[Qian, JB]的文章
[Wang, CA]的文章
百度学术
百度学术中相似的文章
[Chin, FYL]的文章
[Qian, JB]的文章
[Wang, CA]的文章
必应学术
必应学术中相似的文章
[Chin, FYL]的文章
[Qian, JB]的文章
[Wang, CA]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。