{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/44375"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/44375","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Generalizations of Kempe's universality theorem","abstract":"In 1876, A. B. Kempe presented a flawed proof of what is now called Kempe's Universality Theorem: that the intersection of a closed disk with any curve in R2 defined by a polynomial equation can be drawn by a linkage. Kapovich and Millson published the first correct proof of this claim in 2002, but their argument relied on different, more complex constructions. We provide a corrected version of Kempe's proof, using a novel contraparallelogram bracing. The resulting historical proof of Kempe's Universality Theorem uses simpler gadgets than those of Kapovich and Millson. We use our two-dimensional proof of Kempe's theorem to give simple proofs of two extensions of Kempe's theorem first shown by King: a generalization to d dimensions and a characterization of the drawable subsets of Rd. Our results improve King's by proving better continuity properties for the constructions. We prove that our construction requires only O(nd) bars to draw a curve defined by a polynomial of degree n in d dimensions, improving the previously known bounds of O(n4) in two dimensions and O(n6) in three dimensions. We also prove a matching Q(nd) lower bound in the worst case. We give an algorithm for computing a configuration above a given point on a given polynomial curve, running in time polynomial in the size of the dense representation of the polynomial defining the curve. We use this algorithm to prove the coNP-hardness of testing the rigidity of a given configuration of a linkage. While this theorem has long been assumed in rigidity theory, we believe this to be the first published proof that this problem is computationally intractable. This thesis is joint work with Reid W. Barton and Erik D. Demaine.","abstract_html":"In 1876, A. B. Kempe presented a flawed proof of what is now called Kempe's Universality Theorem: that the intersection of a closed disk with any curve in R2 defined by a polynomial equation can be drawn by a linkage. Kapovich and Millson published the first correct proof of this claim in 2002, but their argument relied on different, more complex constructions. We provide a corrected version of Kempe's proof, using a novel contraparallelogram bracing. The resulting historical proof of Kempe's Universality Theorem uses simpler gadgets than those of Kapovich and Millson. We use our two-dimensional proof of Kempe's theorem to give simple proofs of two extensions of Kempe's theorem first shown by King: a generalization to d dimensions and a characterization of the drawable subsets of Rd. Our results improve King's by proving better continuity properties for the constructions. We prove that our construction requires only O(nd) bars to draw a curve defined by a polynomial of degree n in d dimensions, improving the previously known bounds of O(n4) in two dimensions and O(n6) in three dimensions. We also prove a matching Q(nd) lower bound in the worst case. We give an algorithm for computing a configuration above a given point on a given polynomial curve, running in time polynomial in the size of the dense representation of the polynomial defining the curve. We use this algorithm to prove the coNP-hardness of testing the rigidity of a given configuration of a linkage. While this theorem has long been assumed in rigidity theory, we believe this to be the first published proof that this problem is computationally intractable. This thesis is joint work with Reid W. Barton and Erik D. Demaine.","abstract_has_math":false,"creators":["Abbott, Timothy Good"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Erik D. Demaine."],"committee_chairs":[],"committee_members":[],"year":2008,"date_issued":"2008","date_published":"2008","updated_at":"2026-07-22T22:21:11Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/44375","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Erik D. Demaine."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Abbott, Timothy Good"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2009-01-30T16:38:56Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2009-01-30T16:38:56Z"]},{"key":"dc:date.issued","label":"Date","values":["2008"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/44375"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.","Copyright statement on t.p. reads: ©Timothy Good Abbott, 2004-2007, ©Reid W. Barton, 2004-2007.","Includes bibliographical references (p. 85-86)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In 1876, A. B. Kempe presented a flawed proof of what is now called Kempe's Universality Theorem: that the intersection of a closed disk with any curve in R2 defined by a polynomial equation can be drawn by a linkage. Kapovich and Millson published the first correct proof of this claim in 2002, but their argument relied on different, more complex constructions. We provide a corrected version of Kempe's proof, using a novel contraparallelogram bracing. The resulting historical proof of Kempe's Universality Theorem uses simpler gadgets than those of Kapovich and Millson. We use our two-dimensional proof of Kempe's theorem to give simple proofs of two extensions of Kempe's theorem first shown by King: a generalization to d dimensions and a characterization of the drawable subsets of Rd. Our results improve King's by proving better continuity properties for the constructions. We prove that our construction requires only O(nd) bars to draw a curve defined by a polynomial of degree n in d dimensions, improving the previously known bounds of O(n4) in two dimensions and O(n6) in three dimensions. We also prove a matching Q(nd) lower bound in the worst case. We give an algorithm for computing a configuration above a given point on a given polynomial curve, running in time polynomial in the size of the dense representation of the polynomial defining the curve. We use this algorithm to prove the coNP-hardness of testing the rigidity of a given configuration of a linkage. While this theorem has long been assumed in rigidity theory, we believe this to be the first published proof that this problem is computationally intractable. This thesis is joint work with Reid W. Barton and Erik D. Demaine."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Generalizations of Kempe's universality theorem"]}]}],"canonical_facts":{"dc:contributor.advisor":["Erik D. Demaine."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Abbott, Timothy Good"],"dc:date.accessioned":["2009-01-30T16:38:56Z"],"dc:date.available":["2009-01-30T16:38:56Z"],"dc:date.issued":["2008"],"dc:description":["Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.","Copyright statement on t.p. reads: ©Timothy Good Abbott, 2004-2007, ©Reid W. Barton, 2004-2007.","Includes bibliographical references (p. 85-86)."],"dc:description.abstract":["In 1876, A. B. Kempe presented a flawed proof of what is now called Kempe's Universality Theorem: that the intersection of a closed disk with any curve in R2 defined by a polynomial equation can be drawn by a linkage. Kapovich and Millson published the first correct proof of this claim in 2002, but their argument relied on different, more complex constructions. We provide a corrected version of Kempe's proof, using a novel contraparallelogram bracing. The resulting historical proof of Kempe's Universality Theorem uses simpler gadgets than those of Kapovich and Millson. We use our two-dimensional proof of Kempe's theorem to give simple proofs of two extensions of Kempe's theorem first shown by King: a generalization to d dimensions and a characterization of the drawable subsets of Rd. Our results improve King's by proving better continuity properties for the constructions. We prove that our construction requires only O(nd) bars to draw a curve defined by a polynomial of degree n in d dimensions, improving the previously known bounds of O(n4) in two dimensions and O(n6) in three dimensions. We also prove a matching Q(nd) lower bound in the worst case. We give an algorithm for computing a configuration above a given point on a given polynomial curve, running in time polynomial in the size of the dense representation of the polynomial defining the curve. We use this algorithm to prove the coNP-hardness of testing the rigidity of a given configuration of a linkage. While this theorem has long been assumed in rigidity theory, we believe this to be the first published proof that this problem is computationally intractable. This thesis is joint work with Reid W. Barton and Erik D. Demaine."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/44375"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Generalizations of Kempe's universality theorem"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:11Z"}