OP's site is from 2005 and Bosch's site mentions the author of, and links back to, the submitted link ;)
Oh, thanks, I explicitly tried to check but somehow missed that!
/u/rhiever also published some code on transforming an image into a travelling salesman path: http://www.randalolson.com/2018/04/11/traveling-salesman-por...
I went to Oberlin, where Bob is a professor. The pair of Campbells soup pictures were gallery framed on the wall of one of the classroom buildings
His don't really look like mazes, though. There's never any choice involved in the lines. In a maze, you're constantly needing to decide if you should go left or right. His art is just one single line without any branches, as far as I can tell (...and as you'd expect from a TSP algorithm!).
Did you miss this part of the post you're responding to (I am modifying it to make it hopefully clearer)?
> The two problems are clearly dual
> A: since a maze's solution is a non-intersecting path, and
> B: conversely every non-intersecting path is the solution to a corresponding maze
Focus on "B" - the output of a TSP algorithm "is the solution to a corresponding maze".
IOW, the negative space of the TSP algorithms output is the maze itself...
That post was edited after I responded to it.
http://www2.oberlin.edu/math/faculty/bosch/tspart-page.html