TSP Art With A Ballpoint Pen
TSP – or the Traveling Salesman Problem asks the following question: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?” Wikipedia
This artwork is created by turning an image into a dot pattern. Then using a Traveling Salesman algorithm to connect the dots, then have a pen follow that path. Lighter and darker regions are created by differing point densities.
We will have some tutorials about how to make these soon!