Skip to main content
added 29 characters in body
Source Link
Joseph O'Rourke
  • 150.8k
  • 36
  • 358
  • 958

This question was explored here:

Lenhart, William J., and Sue H. Whitesides. "Reconfiguring closed polygonal chains in Euclidean $d$-space." Discrete & Computational Geometry 13, no. 1 (1995): 123-140; DOI: 10.1007/BF02574031, eudml.

From the Abstract: "It is shown that in three or more dimensions, reconfiguration is always possible, but that in dimension two this is not the case. Reconfiguration is shown to be always possible in two dimensions if and only if the sum of the lengths of the second and third longest links add to at most the sum of the lengths of the remaining links."


 [![BillSue1][1]][1]
         

This question was explored here:

Lenhart, William J., and Sue H. Whitesides. "Reconfiguring closed polygonal chains in Euclidean $d$-space." Discrete & Computational Geometry 13, no. 1 (1995): 123-140; DOI: 10.1007/BF02574031, eudml.

From the Abstract: "It is shown that in three or more dimensions, reconfiguration is always possible, but that in dimension two this is not the case. Reconfiguration is shown to be always possible in two dimensions if and only if the sum of the lengths of the second and third longest links add to at most the sum of the lengths of the remaining links."


         

This question was explored here:

Lenhart, William J., and Sue H. Whitesides. "Reconfiguring closed polygonal chains in Euclidean $d$-space." Discrete & Computational Geometry 13, no. 1 (1995): 123-140; DOI: 10.1007/BF02574031, eudml.

From the Abstract: "It is shown that in three or more dimensions, reconfiguration is always possible, but that in dimension two this is not the case. Reconfiguration is shown to be always possible in two dimensions if and only if the sum of the lengths of the second and third longest links add to at most the sum of the lengths of the remaining links."


[![BillSue1][1]][1]
         
added doi and a free link
Source Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

This question was explored here:

Lenhart, William J., and Sue H. Whitesides. "Reconfiguring closed polygonal chains in Euclidean $d$-space." Discrete & Computational Geometry 13, no. 1 (1995): 123-140140; DOI: 10.1007/BF02574031, eudml.

From the Abstract: "It is shown that in three or more dimensions, reconfiguration is always possible, but that in dimension two this is not the case. Reconfiguration is shown to be always possible in two dimensions if and only if the sum of the lengths of the second and third longest links add to at most the sum of the lengths of the remaining links."


         

This question was explored here:

Lenhart, William J., and Sue H. Whitesides. "Reconfiguring closed polygonal chains in Euclidean $d$-space." Discrete & Computational Geometry 13, no. 1 (1995): 123-140.

From the Abstract: "It is shown that in three or more dimensions, reconfiguration is always possible, but that in dimension two this is not the case. Reconfiguration is shown to be always possible in two dimensions if and only if the sum of the lengths of the second and third longest links add to at most the sum of the lengths of the remaining links."


         

This question was explored here:

Lenhart, William J., and Sue H. Whitesides. "Reconfiguring closed polygonal chains in Euclidean $d$-space." Discrete & Computational Geometry 13, no. 1 (1995): 123-140; DOI: 10.1007/BF02574031, eudml.

From the Abstract: "It is shown that in three or more dimensions, reconfiguration is always possible, but that in dimension two this is not the case. Reconfiguration is shown to be always possible in two dimensions if and only if the sum of the lengths of the second and third longest links add to at most the sum of the lengths of the remaining links."


         
Source Link
Joseph O'Rourke
  • 150.8k
  • 36
  • 358
  • 958

This question was explored here:

Lenhart, William J., and Sue H. Whitesides. "Reconfiguring closed polygonal chains in Euclidean $d$-space." Discrete & Computational Geometry 13, no. 1 (1995): 123-140.

From the Abstract: "It is shown that in three or more dimensions, reconfiguration is always possible, but that in dimension two this is not the case. Reconfiguration is shown to be always possible in two dimensions if and only if the sum of the lengths of the second and third longest links add to at most the sum of the lengths of the remaining links."