Traveling Salesman Art

In a picture, random points are selected proportionally to the gray levels of the picture. An algorithm for the "traveling salesman problem"—which asks for the shortest path through a set of cities without passing through any of them twice—is then used to draw a precomputed continuous line with no overlaps through the set of points. This Demonstration lets you see how the tour progresses.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


The built-in Mathematica command used to calculate the path is FindShortestTour, with the Method option set to "RemoveCrossings".
The man in the picture is Alan Turing, founder of computer science, born in 1912.
[1] C. S. Kaplan and R. Bosch. "TSP Art." (May 19, 2005)
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.