- What is the Goal?
- The Algorithm
- Full Single Iteration
- Second Iteration
What is the Goal?
Given a set of nodes that are connected together, we want to know how they should move when the end node is moved.
- The Blue Node is our fixed starting point.
- The Green Node is position where we want to move the end (left most) Node.
This is our end goal configuration which we want to calculate:
The algorithm is iterative, so we will repeatable be doing the same steps until we reach our desired result. The steps of the algorithm are as follows:
- Move the first point desired location.
- Move the next point towards the previous so that it’s the correct distance away.
- Repeat Step 2 until all points are processed.
The above steps are a single iteration. Once a single iteration is complete, we do it again, but in the reverse order. So the point we finished on will be the starting point in the next iteration.
Move the first point to the desired location (the Green Node):
Move the next point towards the previous (in this case the first node) so it’s the correct distance away:
Repeat Step 2 until all points are processed:
Full Single Iteration
Notice that the order of the points has been reversed
After performing 20 iterations (10 each way) we have the following result: