Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Hopcroft J, Joseph D, Whitesides A S. Movement problems for 2-dimensional linkages.SIAM J. Comp.,13(3): 610–629.
Yates R C. Geometrical Tools, A Mathematical Sketch and Model Book. Educational Pub. Inc., Saint Louis, 1949.
Gao X S, Zhu C C, Huang Y. Building dynamic mathematical models with geometry expert, II Linkages. InProceedings of the Third Asian Symposium on Computer Mathematics, Li Z B (ed.), pp.15–22, Lanzhou Univ. Press, 1998.
Isoda M. Developing the Curriculum for Curves Using History and Technology. InProceedings of the Third Asian Technology Conference in Mathematics, Yang W C (eds.), Springer-Verlag, 1998, pp.82–89.
Gao X S. Automated Geometry Diagram Construction and Engineering Geometry.Math. Mech. Res. Preprints, No. 17, to appear in Automated Deduction in Geometry, Springer-Verlag.
Kempe A B. On a general method of describing plane curves of thenth degree by linkwork. In.Proc. of L.M.S., 213–216, 1876;voir aussi Messenger of Math., T. VI., 143–144.
Gao X S, Zhang J Z, Chou S C. Geometry Expert. Nine Chapter Pub., 1998 (in Chinese), Taiwan.
Nemhauser G L, Rinnooy Kan A G H, Todd M J (eds.),Optimization. Elsevier Science Publishers B.V., 1989.
Elster K H (ed.). Modern Mathematical Methods of Optimization. Akademie Verlag, 1993.
Author information
Authors and Affiliations
Additional information
GAO Xiaoshan received his B.S. degree in computer science from the National University of Defence Science and Technology in 1984, and his Ph.D. degree in mathematics from the Institute of Systems Science, Chinese Academy of Sciences in 1988. His main research interests include automated reasoning, symbolic computation, geometric constraint solving and intelligent CAD, intelligen CAI (computer aided instruction). He has published more than fifty papers and two monographs.
ZHU Changcai received his B.S. degree in mathematics from University of Science & Technology of China in 1997 and his M.S. degree in mathematics from Institute of Systems Science in 1999. Now he is a Ph.D. candidate in Institute of Systems Science. His major research interests are design and analysis of linkage, computational complexity, and satisfiability problem.
Rights and permissions
About this article
Cite this article
Gao, X., Zhu, C. Automated generation of Kempe linkage and its complexity. J. Comput. Sci. & Technol. 14, 460–467 (1999). https://doi.org/10.1007/BF02948787
Issue Date:
DOI: https://doi.org/10.1007/BF02948787