Chain reconfiguration the Ins and Outs, Ups and Downs of moving polygons and polygonal linkages

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Apolygonal linkage or chain is a sequence of segments of fixed lengths, free to turn about their endpoints, which act as joints. This paper reviews some results in chain reconfiguration and highlights several open problems 1 © 2001 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Whitesides, S. (2001). Chain reconfiguration the Ins and Outs, Ups and Downs of moving polygons and polygonal linkages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2223 LNCS, pp. 1–13). https://doi.org/10.1007/3-540-45678-3_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free