Locked and Unlocked Chains of Planar Shapes

Locked and Unlocked Chains of Planar Shapes

We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged together sequentially at rotatable joints. Our goal is to c...

Full description

Bibliographic Details
Main Authors: Connelly, Robert, Demaine, Erik D., Demaine, Martin L., Fekete, Sandor P., Langerman, Stefan, Mitchell, Joseph S. B., Ribo, Ares, Rote, Gunter
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Spring New York 2011
Online Access:http://hdl.handle.net/1721.1/62017
https://orcid.org/0000-0003-3803-5703

Internet

http://hdl.handle.net/1721.1/62017
https://orcid.org/0000-0003-3803-5703

Similar Items