Skip to main content
Image link broken; now fixed.
Source Link
Joseph O'Rourke
  • 150.9k
  • 36
  • 358
  • 958

Here is one approach. Start with a regular $n$-gon in the $xy$-plane with unit edge lengths; say its vertices are $v_i$, $i=0,\ldots,n-1$. Now iterate the following process.

Select a random diagonal, $v_i v_j$. Rotate the chain $v_i, v_{i+1}, \ldots, v_j$ (indices appropriately mod $n$) as a rigid unit about the line through $v_i v_j$, by a random angle $\theta \in [0,2\pi)$.

Continue until there is sufficient "mixing." I illustrate the process below for 30 iterations appliesapplied to a hexagon.
           HexVecsAnim http://cs.smith.edu/~orourke/MathOverflow/HexVecs.gifHexVecsAnim
(Apologies for the scale—the chain wanders away from its initial locaion.)

Here is one approach. Start with a regular $n$-gon in the $xy$-plane with unit edge lengths; say its vertices are $v_i$, $i=0,\ldots,n-1$. Now iterate the following process.

Select a random diagonal, $v_i v_j$. Rotate the chain $v_i, v_{i+1}, \ldots, v_j$ (indices appropriately mod $n$) as a rigid unit about the line through $v_i v_j$, by a random angle $\theta \in [0,2\pi)$.

Continue until there is sufficient "mixing." I illustrate the process below for 30 iterations applies to a hexagon.
           HexVecsAnim http://cs.smith.edu/~orourke/MathOverflow/HexVecs.gif
(Apologies for the scale—the chain wanders away from its initial locaion.)

Here is one approach. Start with a regular $n$-gon in the $xy$-plane with unit edge lengths; say its vertices are $v_i$, $i=0,\ldots,n-1$. Now iterate the following process.

Select a random diagonal, $v_i v_j$. Rotate the chain $v_i, v_{i+1}, \ldots, v_j$ (indices appropriately mod $n$) as a rigid unit about the line through $v_i v_j$, by a random angle $\theta \in [0,2\pi)$.

Continue until there is sufficient "mixing." I illustrate the process below for 30 iterations applied to a hexagon.
           HexVecsAnim
(Apologies for the scale—the chain wanders away from its initial locaion.)

deleted 3 characters in body
Source Link
Joseph O'Rourke
  • 150.9k
  • 36
  • 358
  • 958

Here is one possibilityapproach. Start with a regular $n$-gon in the $xy$-plane with unit edge lengths; say its vertices are $v_i$, $i=0,\ldots,n-1$. Now iterate the following process.

Select a random diagonal, $v_i v_j$. Rotate the chain $v_i, v_{i+1}, \ldots, v_j$ (indices appropriately mod $n$) as a rigid unit about the line through $v_i v_j$, by a random angle $\theta \in [0,2\pi)$.

Continue until there is sufficient "mixing." I illustrate the process below for 30 iterations applies to a hexagon.
           HexVecsAnim http://cs.smith.edu/~orourke/MathOverflow/HexVecs.gif
(Apologies for the scale—the chain wanders away from its initial locaion.)

Here is one possibility. Start with a regular $n$-gon in the $xy$-plane with unit edge lengths; say its vertices are $v_i$, $i=0,\ldots,n-1$. Now iterate the following process.

Select a random diagonal, $v_i v_j$. Rotate the chain $v_i, v_{i+1}, \ldots, v_j$ (indices appropriately mod $n$) as a rigid unit about the line through $v_i v_j$, by a random angle $\theta \in [0,2\pi)$.

Continue until there is sufficient "mixing." I illustrate the process below for 30 iterations applies to a hexagon.
           HexVecsAnim http://cs.smith.edu/~orourke/MathOverflow/HexVecs.gif
(Apologies for the scale—the chain wanders away from its initial locaion.)

Here is one approach. Start with a regular $n$-gon in the $xy$-plane with unit edge lengths; say its vertices are $v_i$, $i=0,\ldots,n-1$. Now iterate the following process.

Select a random diagonal, $v_i v_j$. Rotate the chain $v_i, v_{i+1}, \ldots, v_j$ (indices appropriately mod $n$) as a rigid unit about the line through $v_i v_j$, by a random angle $\theta \in [0,2\pi)$.

Continue until there is sufficient "mixing." I illustrate the process below for 30 iterations applies to a hexagon.
           HexVecsAnim http://cs.smith.edu/~orourke/MathOverflow/HexVecs.gif
(Apologies for the scale—the chain wanders away from its initial locaion.)

edited body
Source Link
Joseph O'Rourke
  • 150.9k
  • 36
  • 358
  • 958

Here is one possibility. Start with a regular $n$-gon in the $xy$-plane with unit edge lengths; say its vertices are $v_i$, $i=0,\ldots,n-1$. Now iterate the following process.

Select a random diagonal, $v_i v_j$. Rotate the chain $v_i, v_{i+1}, \ldots, v_j$ (indices appropriately mod $n$) as a rigid unit about the line through $v_i v_j$, by a random angle $\theta \in [0,2\pi]$$\theta \in [0,2\pi)$.

Continue until there is sufficient "mixing." I illustrate the process below for 30 iterations applies to a hexagon.
           HexVecsAnim http://cs.smith.edu/~orourke/MathOverflow/HexVecs.gif
(Apologies for the scale—the chain wanders away from its initial locaion.)

Here is one possibility. Start with a regular $n$-gon in the $xy$-plane with unit edge lengths; say its vertices are $v_i$, $i=0,\ldots,n-1$. Now iterate the following process.

Select a random diagonal, $v_i v_j$. Rotate the chain $v_i, v_{i+1}, \ldots, v_j$ (indices appropriately mod $n$) as a rigid unit about the line through $v_i v_j$, by a random angle $\theta \in [0,2\pi]$.

Continue until there is sufficient "mixing." I illustrate the process below for 30 iterations applies to a hexagon.
           HexVecsAnim http://cs.smith.edu/~orourke/MathOverflow/HexVecs.gif
(Apologies for the scale—the chain wanders away from its initial locaion.)

Here is one possibility. Start with a regular $n$-gon in the $xy$-plane with unit edge lengths; say its vertices are $v_i$, $i=0,\ldots,n-1$. Now iterate the following process.

Select a random diagonal, $v_i v_j$. Rotate the chain $v_i, v_{i+1}, \ldots, v_j$ (indices appropriately mod $n$) as a rigid unit about the line through $v_i v_j$, by a random angle $\theta \in [0,2\pi)$.

Continue until there is sufficient "mixing." I illustrate the process below for 30 iterations applies to a hexagon.
           HexVecsAnim http://cs.smith.edu/~orourke/MathOverflow/HexVecs.gif
(Apologies for the scale—the chain wanders away from its initial locaion.)

Source Link
Joseph O'Rourke
  • 150.9k
  • 36
  • 358
  • 958
Loading