Automated generation of Kempe linkage and its complexity

  title={Automated generation of Kempe linkage and its complexity},
  author={Xiao-Shan Gao and Changcai Zhu},
  journal={Journal of Computer Science and Technology},
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 degreen Kempe linkage uses at mostO(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. 

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 10 references

Building Dynamic Mathematical Models with Geometry Expert, II. Linkages

X. S. Gao, C. C. Zhu, Y. Huang
Proceedings of the Third Asian Symposium on Computer Mathematics, • 1998
View 2 Excerpts

Developing the Curriculum for Curves Using History and Technology

M. Isoda
Proceedings of the Third Asian Technology Conference in Mathematics, • 1998

Geometry Expert

X. S. Gao, J. Z. Zhang, S. C. Chou
Nine Chapter Pub., • 1998
View 2 Excerpts

Geometer’s Sketchpad, User guide and Reference Manual, Key Curriculum

N. Jakiw

Kinematics and Linkage Design, Prentice-Hall, INC

A. S. Hall

Analysis of the Four-bar Linkage

J. A. Hrones, G. L. Nelson

Geometrical Tools, A Mathematical Sketch and Model Book

R. C. Yates
Educational Pub. Inc., Saint Louis, • 1949

On a general method of describing plane curves of the nth degree by linkwork

B. KempeA
American Mathematical Monthly

Similar Papers

Loading similar papers…