Continuous drawing drawing based on the problem of the traveling agent
Keywords:
Images, Continuos drawline, traveling salesman problemAbstract
The traveling salesman problem (TSP) is a classical combinatoric optimization problem. It consists on finding a closed path of minimum length, when connecting a collection of points on the plane. This paper describes how to use the TSP to create continuos drawline images from a picture in digital format. To do it we built TSP instances by manipulating the digital file, defining points on the plane (cities) and simplifying the pixel density in the target image in grayscale format. Then, we solve the instances by using an application which calculates the optimal tours, and so drawing the images.
Downloads
Downloads
Published
Issue
Section
License
The opinions expressed by the authors do not necessarily reflect the position of the publisher of the publication or of UCLA. The total or partial reproduction of the texts published here is authorized, as long as the complete source and the electronic address of this journal are cited.
The authors fully retain the rights to their works, giving the journal the right to be the first publication where the article is presented. The authors have the right to use their articles for any purpose as long as it is done for non-profit. Authors are recommended to disseminate their articles in the final version, after publication in this journal, in the electronic media of the institutions to which they are affiliated or personal digital media.
