The TSP algorithm modified for Laser Cutting

This attempts to minimize the Laser Off time during positioning between cuts.

The first demo is a "real" lasercutting demo.

The other problems are traditional TSP problem sets, where each pair of points is treated as a segment to be cut (black lines), and a minimal length connection between the segments is sought for (red lines). As can be seen in the TEXT demo, this is not trivial at all. At least the line from 4 to 14 will not easily be found by hand.

my other applets (Traveling Salesman, Quadratic Assignment)