Skip to content

Instantly share code, notes, and snippets.

@wchargin
Last active July 8, 2025 04:51
Show Gist options
  • Select an option

  • Save wchargin/686d8b0b5b37cb1e2e9eec84928c0e81 to your computer and use it in GitHub Desktop.

Select an option

Save wchargin/686d8b0b5b37cb1e2e9eec84928c0e81 to your computer and use it in GitHub Desktop.

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...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

Spoiler wall...

@wchargin

wchargin commented Jul 8, 2025

Copy link
Copy Markdown
Author

I think it's false.

Sketch of my solution to the problem

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment