Author/Authors :
Therese Biedl، نويسنده , , Erik Demaine، نويسنده , , Martin Demaine، نويسنده , , Sylvain Lazard، نويسنده , , Anna Lubiw، نويسنده , , Joseph OʹRourke، نويسنده , , Steve Robbins، نويسنده , , Ileana Streinu، نويسنده , , Godfried Toussaint، نويسنده , , Sue Whitesides، نويسنده ,
Abstract :
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Ω(N) equivalence classes of configurations.
Keywords :
Motion planning , Graph embedding , Distance geometry , Tree embedding , Linkage reconfiguration
