Smooth transitioning US tour in the same vein as this example. Steps:
- Compares both shapes and adds evenly-spaced points to whichever polygon has fewer so that both have the same number of points
- Picks the winding of the first polygon that minimizes the sum of the squared distances between point pairs
Some possible improvements:
- Adding additional points to both shapes first such that every segment longer than a certain distance is bisected
- Tweaking the placement of added points with simulated annealing
- Using a cost function that factors in self-intersections at the halfway mark in addition to distance traveled
