A linear-time approximation scheme for maximum weight triangulation of convex polygons

CSpace

	A linear-time approximation scheme for maximum weight triangulation of convex polygons
	Qian, JB ; Wang, CA
	2004-11-01
发表期刊	ALGORITHMICA
ISSN	0178-4617
卷号	40 期号:3 页码:161-172
摘要	In this paper we present a linear-time approximation scheme for determining the maximum weight triangulation of a convex polygon. Our algorithm is simple and can be implemented easily.
关键词	algorithm approximation scheme convex polygon maximum weight triangulation
DOI	10.1007/s00453-004-1101-6
语种	英语
WOS研究方向	Computer Science ; Mathematics
WOS类目	Computer Science, Software Engineering ; Mathematics, Applied
WOS记录号	WOS:000223641900002
出版者	SPRINGER
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/19354
专题	中国科学院数学与系统科学研究院
通讯作者	Qian, JB
作者单位	1.Chinese Acad Sci, Inst Appl Math, Beijing, Peoples R China 2.Mem Univ Newfoundland, Dept Comp Sci, St Johns, NF A1B 3X5, Canada
推荐引用方式 GB/T 7714	Qian, JB,Wang, CA. A linear-time approximation scheme for maximum weight triangulation of convex polygons[J]. ALGORITHMICA,2004,40(3):161-172.
APA	Qian, JB,&Wang, CA.(2004).A linear-time approximation scheme for maximum weight triangulation of convex polygons.ALGORITHMICA,40(3),161-172.
MLA	Qian, JB,et al."A linear-time approximation scheme for maximum weight triangulation of convex polygons".ALGORITHMICA 40.3(2004):161-172.