automatedgenerationofkempelinkageanditscomplexity

CSpace > 系统科学研究所

	automatedgenerationofkempelinkageanditscomplexity
	Gao XS(高小山); Zhu ZC(朱长才)
	1999
发表期刊	journalofcomputerscienceandtechnology
ISSN	1000-9000
卷号	014 期号:005 页码:460
摘要	It is a famous result of Kempe that a linkage can be designed to generate any given plane algebraic curve.In this paper,Kempe's result is improved to give a precise algorithm for generating Kempe linkage.We proved that for an algebraic plane curve of degrenn n,Kempe linkage uses at most O(n^4) links.Efforts to implement a program which may generate Kempe linkage and simulation of the generation process of the plane curves are presented in the paper.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/40065
专题	系统科学研究所
作者单位	中国科学院数学与系统科学研究院
推荐引用方式 GB/T 7714	Gao XS,Zhu ZC. automatedgenerationofkempelinkageanditscomplexity[J]. journalofcomputerscienceandtechnology,1999,014(005):460.
APA	高小山,&朱长才.(1999).automatedgenerationofkempelinkageanditscomplexity.journalofcomputerscienceandtechnology,014(005),460.
MLA	高小山,et al."automatedgenerationofkempelinkageanditscomplexity".journalofcomputerscienceandtechnology 014.005(1999):460.