Applying the traveling salesman problem to pixel art.
Go
Latest commit 8f58d2a Jan 14, 2016 @fogleman Update README.md
Permalink
Failed to load latest commit information.
examples example Jan 13, 2016
pixsort ignore transparent Jan 13, 2016
README.md Update README.md Jan 14, 2016
main.go Closest Jan 13, 2016

README.md

pixsort

Applying the traveling salesman problem to pixel art.

Goal: Find the shortest path to visit all black pixels in an image.

Algorithm: Simulated annealing.

Frog

Peach

Usage

go get github.com/fogleman/pixsort
pixsort image.png

This will generate a file named image.png.gif with the result.

You can also pass in a quality parameter to make it try harder.

pixsort image.png 28

The algorithm will run 2 ^ quality iterations.