Optimizing the Greedy Algorithm Used in the TSP Abstract Problems
2014 ◽
Vol 651-653
◽
pp. 2352-2355
Keyword(s):
TSP problem is a class of classical problems in the combinatorial optimization problem; it has important applications in gene sequencing, robot control and other areas, especially in the computer domain, applied more widely. This paper considers abstracting the problem of stitching and reduction for scraps of paper as a class of TSP problem, and use the optimized greedy algorithm, achieve automatic image stitching shredding by the use of computer graphics technology. Contents of this paper make a useful attempt to study the automatic stitching algorithm for scraps of paper.
1979 ◽
Vol 20
(1)
◽
pp. 39-51
◽
2011 ◽
Vol 1
(1)
◽
pp. 88-92