https://github.com/fogleman/pixsort

Applying the traveling salesman problem to pixel art.
https://github.com/fogleman/pixsort

Last synced: 11 months ago
JSON representation

Applying the traveling salesman problem to pixel art.

• Host: GitHub
• URL: https://github.com/fogleman/pixsort
• Owner: fogleman
• License: mit
• Created: 2016-01-13T04:15:19.000Z (about 10 years ago)
• Default Branch: master
• Last Pushed: 2019-07-06T16:21:36.000Z (over 6 years ago)
• Last Synced: 2024-06-20T12:01:29.359Z (almost 2 years ago)
• Language: Go
• Homepage:
• Size: 15.6 KB
• Stars: 59
• Watchers: 4
• Forks: 11
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

          
## 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](http://i.imgur.com/2xiwTVE.gif)

![Peach](http://i.imgur.com/sCBhROn.gif)

## 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.