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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
