Guney Digital Art – TSP Path Algorithm

Guney Digital Art – TSP Path Algorithm

The Original Photo of Guney Candan Back ground removed Thanks to http://www.evilmadscientist.com/ below is the Voronoi Diagram calculated by StippleGen_2   Then after 20 iterations with 3000 dots ductBelow is the TSP path calculated   The final V plated end product ! One hand drawing added. This time no software generated view I tried to converting to SVG file

Read More

Traveling Salesman Problem and Digital Art

Traveling Salesman Problem and Digital Art

 Traveling salesman problem: Wikipedia: “The travelling salesman problem (TSP) 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? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.”   In the mathematics literature, it appears that the first mention of the TSP was…

Read More