Skip to content

Latest commit

 

History

History
27 lines (20 loc) · 1.28 KB

README.md

File metadata and controls

27 lines (20 loc) · 1.28 KB
Raw

gcode-sort

Optimize a GCODE file by reducing the total time spent moving the bit (G0) vs cutting or carving (G1)

Before

image

After

image

Features

  • should work with gcode from Easel
  • fast optimization using the 2-opt algorithm that is commonly used for solving the Traveling Salesman Problem.
  • option to show/hide travel/cutting/z changes.
  • reports what you save (in term of total distance)
  • download the optimized file

Known issues

  • hard-coded work area of 512x512

Bugs? Issues?

If you encounter a bug or have a gcode file that wasn't handled properly, please create an issue with the relevant file attached and I will take a look at it.

Want to contribute? Request a feature?

Any help is appreciated. Send in a PR or reach out to me.

Thanks

Thank to @pedrohfsd for his javascript version of the 2-opt algorithm. I used it because it was easy to understand and adapt.