The traveling salesman problem (TSP) is a well-known NP-complete problem. It has appeared in diverse field of human knowledge. Different heuristics have been developed to generate approximate solutions for TSP. In this project, we used 3 different heuristics for TSP to implement a half toning algorithm. We followed the 3 steps below to implement a half toning algorithm.
Given any input image,
The project report can be found here.
The source code repository is hosted at code.google.com. You can checkout the source code from here.