We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 14 Issue 5
September  1999
Turn off MathJax
Article Contents
Abstract
References
Related Articles
GAO Xiaoshan, ZHU Changcai. Automated Generation of Kempe Linkageand Its Complexity[J]. Journal of Computer Science and Technology, 1999, 14(5): 460-467.
Citation: GAO Xiaoshan, ZHU Changcai. Automated Generation of Kempe Linkageand Its Complexity[J]. Journal of Computer Science and Technology, 1999, 14(5): 460-467.
shu

Automated Generation of Kempe Linkageand Its Complexity

  • Institute of Systems Sciences; Chinese Academy of Sciences; Beijing 100080; P.R. China;

More Information
  • Published Date: September 09, 1999
    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.
    • FullText(HTML)
    • References (3)
  • [1]
    Hopcroft J, Joseph D, Whitesides A S. Movement problems for 2-dimensional linkages. SIAM J. ComP., 13(3): 610-629.
    [2]
    Yates R C. Geometrical Tools, A Mathematical Sketch and Model Book. Educational Pub. Inc., Saint Louis, 1949.
    [3]
    Gao X S, Zhu C C, Huang Y. Building dynamic mathematical models with geometry expert, II Linkages. In Proceedings of the Third Asian SymPosium on Computer Mathematics, Li Z B (ed.), pp.15-22, Lanzhou Univ. Press, 1998. ……….
    • Relative Articles

  • Related Articles

    [1]Ji-Gang Wu, Thambipillai Srikanthan, Guang-Wei Zou. New Model and Algorithm for Hardware/Software Partitioning[J]. Journal of Computer Science and Technology, 2008, 23(4): 644-651.
    [2]Qi Ge, Hai-Tao Wang, Hong Zhu. An Improved Algorithm for Finding the Closest Pair of Points[J]. Journal of Computer Science and Technology, 2006, 21(1): 27-31.
    [3]Dao-Yun Xu, Zhi-Hong Tao. Complexities of Homomorphism and Isomorphism for Definite Logic Programs[J]. Journal of Computer Science and Technology, 2005, 20(6): 758-762.
    [4]ZHU Daming, LUAN Junfeng, MA Shaohan. Hardness and Methods to Solve CLIQUE[J]. Journal of Computer Science and Technology, 2001, 16(4).
    [5]GAO Suixiang, LIN Guohui. Decision Tree Complexity of Graph Properties with Dimension at Most5[J]. Journal of Computer Science and Technology, 2000, 15(5): 416-422.
    [6]JIANG Tao, LI Ming, Paul M.B. Average-Case Analysis of Algorithms Using Kolmogorov Complexity[J]. Journal of Computer Science and Technology, 2000, 15(5): 402-408.
    [7]GAO Suixiang, LIN Guohui. Decision Tree Complexity of Graph Properties with Dimension at Most 5[J]. Journal of Computer Science and Technology, 2000, 15(5).
    [8]WU Jigang, JI Yongchang, CHEN Guoliang. An Optimal Online Algorithm for Half Plane Intersection[J]. Journal of Computer Science and Technology, 2000, 15(3): 295-299.
    [9]Huang Wenqi, Li Wei. A Hopeful CNF-SAT─Algorithm Its High Efficiency, Industrial Application and Limitation[J]. Journal of Computer Science and Technology, 1998, 13(1): 9-12.
    [10]Lu Xuemiao. On the Complexity of Induction of Structural Descriptions[J]. Journal of Computer Science and Technology, 1987, 2(1): 12-21.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (29) PDF downloads (1323) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return