CSpace  > 系统科学研究所
Gao XS(高小山); Zhu ZC(朱长才)
Source Publicationjournalofcomputerscienceandtechnology
AbstractIt 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.
Document Type期刊论文
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[高小山]'s Articles
[朱长才]'s Articles
Baidu academic
Similar articles in Baidu academic
[高小山]'s Articles
[朱长才]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[高小山]'s Articles
[朱长才]'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.