Suppose you have a closed, non self-intersecting 2D curve. Split this curve into N parts, not necessarily equal but with maximum length going to zero. Find a TSP solution (shortest tour containing all the points) on the sampled set. Question: for large N, does the solution mimic the curve?
(Some parts of this are underspecified. Fill in the gaps as you like...)
Spoiler wall...
Spoiler wall...
Spoiler wall...