A Note on Reconfiguring Tree Linkages: Trees can Lock - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2002

A Note on Reconfiguring Tree Linkages: Trees can Lock

Résumé

It has recently been shown that any polygonal chain in the plane can be reconfigured to lie on a straight line, and any polygon can be reconfigured to be convex. This result cannot be extended to tree linkages: we show that there are trees with two configurations that are not connected by a motion. Indeed, we prove that an $N$-link tree can have $2^{Omega(N)}$ equivalence classes of configurations.

Dates et versions

inria-00100889 , version 1 (26-09-2006)

Identifiants

Citer

Thérèse Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, et al.. A Note on Reconfiguring Tree Linkages: Trees can Lock. Discrete Applied Mathematics, 2002, 117 (1-3), pp.293-297. ⟨10.1016/S0166-218X(01)00229-3⟩. ⟨inria-00100889⟩
70 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More