Automated generation of Kempe linkage and its complexity |
| |
Authors: | Xiaoshan Gao Changcai Zhu |
| |
Affiliation: | (1) Institute of Systems Sciences, Chinese Academy of Sciences, 100080 Beijing, P.R. China |
| |
Abstract: | It is a famous result of Kempe that a lillkage can be designed togenerate any given plane algebraic curve. In this paper, Kempe's result is improvedto give a precise algorithm for generating Kempe linkage. We proved that for analgebraic plane curve of degree n, Kempe linkage uses at most O(n4) links. Effortsto implement a program which may generate Kempe linkage and simulation of thegeneration process of the plane curves are presellted in the paper. |
| |
Keywords: | CAD linkage design Kempe linkage complexity |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |