We describe how to use the traveling salesman problem (TSP) to create continuous line drawings of target pictures.

In the Traveling Salesman Problem (TSP), a salesman wants to visit set of cities and return home. There is cost $$c_{ij}$$ traveling from city i j, which same in either direction for Symmetric TSP. The objective each exactly once, minimizing total travel costs. Graphical TSP, may be visited more than necessary on sparse graph. We present new integer programming formulation TSP requiring only tw...